{"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82542515,0.00031521037,0.019836415,0.008475917,0.0028166398,0.0016024316,0.00018797311,0.00019951182,0.14114073],"genre_scores_gemma":[0.9969454,0.000003930443,0.00018680631,0.00008474937,0.0002476527,0.00003790389,0.0000031390534,0.000016786644,0.0024736575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872345,0.000010562646,0.00062422233,0.00030673336,0.00008959373,0.00024543275],"domain_scores_gemma":[0.9987858,0.00009341018,0.00064713624,0.000079840574,0.0003284522,0.000065367974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013702146,0.00014419963,0.0003084874,0.00009665102,0.00021349544,0.00009869795,0.00052199495,0.000089264846,0.00013307587],"category_scores_gemma":[0.0013332623,0.0001318457,0.00015955698,0.00021548188,0.00016856742,0.0001495849,0.00007852654,0.00021810335,0.0002220767],"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.00009079506,0.00007321097,0.0043757926,0.00004240103,0.000019816951,3.124637e-8,0.0008386509,0.000051673494,0.0005328126,0.992382,0.0002834554,0.0013093572],"study_design_scores_gemma":[0.00015237066,0.00029292604,0.000570179,0.00009157469,0.000012139275,0.0000022581257,0.0009665535,0.036755126,0.021872822,0.9275927,0.011390835,0.00030051742],"about_ca_topic_score_codex":0.00007743347,"about_ca_topic_score_gemma":0.0000073508445,"teacher_disagreement_score":0.1715202,"about_ca_system_score_codex":0.000050610914,"about_ca_system_score_gemma":0.000030474908,"threshold_uncertainty_score":0.5376512},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7410979,0.000077373246,0.21424498,0.00130825,0.0003382201,0.0021975557,0.000022770277,0.00035831268,0.040354647],"genre_scores_gemma":[0.9799788,0.000019058127,0.019602021,0.000095775365,0.000046792164,0.000120006654,0.0000010360897,0.000022207481,0.0001143199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99719834,0.000033989312,0.0006991755,0.0007874209,0.0006766146,0.00060446595],"domain_scores_gemma":[0.99801874,0.00014247814,0.00033479207,0.0006695412,0.0006881847,0.00014628367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000580776,0.00031469058,0.00033221167,0.00029322068,0.0002435167,0.00018911375,0.0033823124,0.00010948575,0.00006796495],"category_scores_gemma":[0.0001513874,0.00022921088,0.000087391556,0.0015420924,0.0005325383,0.0007361078,0.0006290931,0.0005315217,0.00012941183],"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.00008894435,0.00046864935,0.016647117,0.0000497354,0.000019303558,0.0000047310878,0.009928179,0.00031640165,0.023554755,0.9341998,0.00006231262,0.014660053],"study_design_scores_gemma":[0.000032104945,0.00039297374,0.0017461742,0.00055043236,0.00001615138,0.000012891022,0.0048478227,0.07302496,0.85206217,0.06671755,0.00010725752,0.00048952835],"about_ca_topic_score_codex":0.0002763401,"about_ca_topic_score_gemma":0.000057525376,"teacher_disagreement_score":0.86748224,"about_ca_system_score_codex":0.00007197913,"about_ca_system_score_gemma":0.00017795124,"threshold_uncertainty_score":0.9346948},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12646751,0.00019093521,0.5657788,0.16169992,0.0042164377,0.003891032,0.000025370377,0.00066079537,0.13706918],"genre_scores_gemma":[0.9975789,0.000032702854,0.0011668178,0.00067263376,0.00019941432,0.00012360585,5.5166583e-7,0.00001281727,0.00021252688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801177,0.00009979038,0.00070547976,0.00044310538,0.00038826597,0.0003515691],"domain_scores_gemma":[0.9984336,0.00022505675,0.00048624753,0.0002954754,0.00050977885,0.00004984656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013613296,0.00022708358,0.00031337127,0.00015056999,0.0005007973,0.0006164574,0.0020535272,0.00011189352,0.000013170237],"category_scores_gemma":[0.00031587822,0.00014661471,0.00009701643,0.0006711794,0.00014482636,0.0004323905,0.00034849264,0.00036466034,0.000015857575],"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.0000061445407,0.000060158378,0.00018995852,0.000029772596,0.000012438664,1.12841136e-7,0.00633614,0.000058378177,0.0032123325,0.95203054,0.003862994,0.034201045],"study_design_scores_gemma":[0.000092087466,0.0003144703,0.00036776782,0.0008264822,0.000019407162,0.000015411428,0.015112958,0.7571562,0.1137387,0.1056142,0.006024843,0.00071748375],"about_ca_topic_score_codex":0.00035663936,"about_ca_topic_score_gemma":0.00011795101,"teacher_disagreement_score":0.8711114,"about_ca_system_score_codex":0.000073760755,"about_ca_system_score_gemma":0.000070368944,"threshold_uncertainty_score":0.59787744},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006611168,0.000008470672,0.9412423,0.017923992,0.0005574466,0.0010521498,0.0000044850676,0.00015528566,0.032444745],"genre_scores_gemma":[0.9847885,0.000012095725,0.013436931,0.00031541302,0.0002460002,0.000059624224,9.0302166e-7,0.000014688974,0.0011258448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979375,0.000021348194,0.00054011453,0.00046425822,0.00061961694,0.0004171579],"domain_scores_gemma":[0.99759316,0.00012229841,0.0005161914,0.00037509613,0.0012275107,0.00016575125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005329148,0.00021515526,0.00024321117,0.00031059305,0.00016313598,0.00026062905,0.0019333806,0.00008181843,0.000003344009],"category_scores_gemma":[0.0022558528,0.00016894644,0.00013703493,0.0012097406,0.0002514786,0.0005287059,0.00040503257,0.00019785923,0.00005051513],"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.000078683064,0.000050493134,0.00007318834,0.000012745196,0.000014491681,1.2974292e-7,0.0021662242,0.009988277,0.0022023441,0.9518257,0.00036543387,0.03322229],"study_design_scores_gemma":[0.00006699236,0.00057298254,0.00008335784,0.00008093109,0.000009473509,0.0000033676697,0.00071381324,0.46229425,0.15521082,0.38057035,0.00019853852,0.00019513351],"about_ca_topic_score_codex":0.0002117187,"about_ca_topic_score_gemma":0.000008000897,"teacher_disagreement_score":0.9781773,"about_ca_system_score_codex":0.00019853639,"about_ca_system_score_gemma":0.00049493974,"threshold_uncertainty_score":0.68894356},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9110953,0.00001907756,0.054594863,0.00085509336,0.0017310184,0.0009832509,0.00001013797,0.00072745996,0.029983765],"genre_scores_gemma":[0.99559885,0.000055087443,0.004122212,0.00009646025,0.000039025992,0.000027346114,8.16026e-7,0.0000108561435,0.00004933477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.997547,0.0000230791,0.0010776623,0.00035945655,0.00062761613,0.00036523835],"domain_scores_gemma":[0.99651116,0.000100697755,0.0011445304,0.00041994522,0.0017352714,0.00008841052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061066996,0.00027181004,0.0003265133,0.00031682433,0.00017816114,0.00015105808,0.0016924661,0.0001656775,0.000120385936],"category_scores_gemma":[0.0006648166,0.00021201032,0.00017962886,0.0008731397,0.00038380985,0.0026068438,0.0002775639,0.00032391827,0.00021396279],"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.0001708583,0.00023002333,0.0004049405,0.00009585414,0.000034915738,3.8294064e-7,0.008830587,0.00009264259,0.097119436,0.6203004,0.00025108462,0.27246884],"study_design_scores_gemma":[0.00001494009,0.00027522273,0.0021500746,0.00014987911,0.000015023324,0.000008317332,0.0018238334,0.08755025,0.8302398,0.07752258,0.000054835393,0.0001952532],"about_ca_topic_score_codex":0.00030057455,"about_ca_topic_score_gemma":0.00001984039,"teacher_disagreement_score":0.7331203,"about_ca_system_score_codex":0.0000781566,"about_ca_system_score_gemma":0.00012879209,"threshold_uncertainty_score":0.864553},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6237581,0.000115654526,0.112776905,0.0008374809,0.0025224744,0.0009686736,0.0000056105896,0.0003137219,0.25870144],"genre_scores_gemma":[0.99629694,0.000016282793,0.0033505277,0.00007562248,0.00004671849,0.00001880985,2.490767e-7,0.000010720165,0.00018413986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981526,0.000023690565,0.00051514915,0.000519583,0.00034956558,0.00043938792],"domain_scores_gemma":[0.9989233,0.00008793641,0.00031145607,0.0002994208,0.00028500945,0.000092854636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000526774,0.00023255877,0.00028190555,0.00019064339,0.0001497758,0.00012382847,0.0022930545,0.00011165749,0.00006563431],"category_scores_gemma":[0.0004747565,0.0001756367,0.000108856744,0.0006834772,0.0002539927,0.00039405146,0.00045406923,0.0003586063,0.00011600995],"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.00008501503,0.00019825116,0.0016894932,0.000025510679,0.000009690731,0.0000043813466,0.008422981,0.000020702793,0.0042457874,0.96998227,0.00004181359,0.01527409],"study_design_scores_gemma":[0.0001251768,0.00044789896,0.0065593566,0.00048948696,0.00001883829,0.000015776674,0.0014373244,0.1270807,0.122486785,0.74070555,0.00008777269,0.0005453275],"about_ca_topic_score_codex":0.00008750342,"about_ca_topic_score_gemma":0.00004054823,"teacher_disagreement_score":0.37253886,"about_ca_system_score_codex":0.000073143914,"about_ca_system_score_gemma":0.00011736033,"threshold_uncertainty_score":0.7162257},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67763853,0.0000033180193,0.2553908,0.0030705975,0.0021038146,0.00075114483,0.0000051432385,0.00028436963,0.06075228],"genre_scores_gemma":[0.9679349,0.000005764371,0.031514317,0.00021523003,0.00011487593,0.00004512757,3.681725e-7,0.000011057712,0.00015836892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978263,0.000040586452,0.0005974455,0.00057973946,0.00064678886,0.0003091534],"domain_scores_gemma":[0.997929,0.00016524707,0.00055782514,0.000600131,0.0006610538,0.00008677607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013430674,0.00019472722,0.00020741999,0.0001351711,0.00025100828,0.00029983494,0.002142686,0.000114095776,0.00006422895],"category_scores_gemma":[0.0023345484,0.00015576463,0.000108963395,0.0007366488,0.0002561076,0.00088601134,0.0002884179,0.0005780905,0.00012944963],"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.000019097479,0.00007643685,0.00014352343,0.000015053549,0.0000039005035,1.3951261e-7,0.0010246589,0.000013805398,0.15071243,0.75861007,0.000024800685,0.08935607],"study_design_scores_gemma":[0.000015117498,0.00009259407,0.00064092124,0.00006305756,0.0000036808024,0.0000037457644,0.00030041672,0.031966925,0.68345875,0.28323632,0.000078222845,0.00014021034],"about_ca_topic_score_codex":0.000039705403,"about_ca_topic_score_gemma":0.0000060077896,"teacher_disagreement_score":0.5327463,"about_ca_system_score_codex":0.000035815185,"about_ca_system_score_gemma":0.00006854283,"threshold_uncertainty_score":0.6351897},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96369857,0.000075452306,0.006306662,0.0011813933,0.000244292,0.00033204746,0.000008579253,0.000028011085,0.028125012],"genre_scores_gemma":[0.9991752,0.000055570235,0.00027615274,0.000118282216,0.000029778505,0.000019954019,7.770998e-7,0.000010945971,0.00031334095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987162,0.00002264859,0.0006880762,0.00032381553,0.00006028249,0.00018898107],"domain_scores_gemma":[0.999131,0.00008725913,0.0005095487,0.00012330963,0.00011142446,0.00003742697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013713372,0.00013359713,0.00029275895,0.0001552031,0.000080097496,0.00010889851,0.0003644661,0.00007244788,0.00008131668],"category_scores_gemma":[0.00066115207,0.00012014877,0.00004205364,0.0002990553,0.00011342929,0.00025037033,0.00008073652,0.00016128484,0.000084659114],"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.00002323768,0.00004698374,0.0055145277,0.000104798215,0.000004183522,1.9242378e-8,0.0018492532,0.00004456235,0.0010637897,0.9814999,0.000015321648,0.009833418],"study_design_scores_gemma":[0.000055700402,0.00014062502,0.0061134053,0.0005676586,0.0000044141443,0.0000014240172,0.0008805069,0.047681697,0.020296391,0.9236754,0.00036528843,0.00021749594],"about_ca_topic_score_codex":0.00013420869,"about_ca_topic_score_gemma":0.000022215485,"teacher_disagreement_score":0.057824515,"about_ca_system_score_codex":0.000029503437,"about_ca_system_score_gemma":0.000007825293,"threshold_uncertainty_score":0.48995247},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53754824,0.000014938109,0.44153082,0.0006204453,0.0011464612,0.00037157853,0.000013841219,0.00017481438,0.018578857],"genre_scores_gemma":[0.9866751,0.000007662724,0.013106977,0.000077011995,0.00004989857,0.000007806766,0.0000031786712,0.000017457876,0.00005492621],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989123,0.000007184741,0.00041865456,0.00017381315,0.00026696472,0.00022111995],"domain_scores_gemma":[0.9992463,0.00007876189,0.00011759049,0.00010531531,0.00038494065,0.00006711388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035939834,0.00015897465,0.00016812362,0.00008314574,0.000112389105,0.000103763974,0.0004058806,0.0000926755,0.000101369544],"category_scores_gemma":[0.00016732178,0.00012926651,0.000066833214,0.00029348957,0.00015418355,0.000075961354,0.00004656018,0.00031447358,0.00003606562],"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.000010964434,0.000045985773,0.000039377854,0.000045757217,0.000014403834,8.93186e-8,0.0004432314,0.110297956,0.5148813,0.34194818,0.00024460198,0.032028142],"study_design_scores_gemma":[0.000013272394,0.000018844261,0.000068514724,0.000034813154,0.0000050069693,0.0000012097595,0.00014265282,0.6379547,0.35561317,0.0058023673,0.00023793904,0.00010751709],"about_ca_topic_score_codex":0.000007940528,"about_ca_topic_score_gemma":0.000002256299,"teacher_disagreement_score":0.52765673,"about_ca_system_score_codex":0.000019963798,"about_ca_system_score_gemma":0.000027388149,"threshold_uncertainty_score":0.5271335},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6562998,0.0000964386,0.27232182,0.0005792192,0.0004041435,0.0007543141,0.000005720867,0.00022663813,0.06931186],"genre_scores_gemma":[0.9883753,0.0000037138354,0.011358907,0.00008185652,0.00002573823,0.000029736384,2.197732e-7,0.00001375444,0.00011075994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99779856,0.000039345752,0.0005657328,0.0005893951,0.00047687738,0.0005301038],"domain_scores_gemma":[0.9989315,0.000120814926,0.00022811178,0.00033128553,0.00027283255,0.000115407005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087829377,0.00025254596,0.00030543288,0.00023777441,0.00017351171,0.000153886,0.0022976622,0.00012356688,0.000017723974],"category_scores_gemma":[0.00014778225,0.00019862712,0.000095290845,0.00075392774,0.0002941472,0.0002700904,0.0004012224,0.0005536628,0.000034700206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036508864,0.0006186141,0.011111404,0.0002458166,0.000037320355,0.000023689016,0.053041067,0.0061203437,0.006111701,0.71504956,0.000121137986,0.20715427],"study_design_scores_gemma":[0.000055321707,0.0003589108,0.0022041332,0.0005671733,0.000010180954,0.00001816905,0.0023562761,0.87715596,0.08558845,0.031312283,0.00001000656,0.00036311382],"about_ca_topic_score_codex":0.00027132942,"about_ca_topic_score_gemma":0.0000125721945,"teacher_disagreement_score":0.87103564,"about_ca_system_score_codex":0.000056546494,"about_ca_system_score_gemma":0.0001466575,"threshold_uncertainty_score":0.80997795},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.563968,0.00007402264,0.26884902,0.0698522,0.0034830596,0.0028587645,0.0000613104,0.0014861844,0.08936744],"genre_scores_gemma":[0.99753344,0.000014701536,0.00082369876,0.00022371518,0.00014981355,0.00005212002,0.0000011296627,0.000011457616,0.00118994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973886,0.000106237865,0.00079586793,0.0004896015,0.000951581,0.00026810594],"domain_scores_gemma":[0.9963757,0.0006539053,0.0006849522,0.0005680696,0.0016007877,0.000116619965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004098327,0.00017557835,0.00020241049,0.00007728695,0.00092287594,0.0005825593,0.0022786772,0.00009101169,0.0001474205],"category_scores_gemma":[0.002276695,0.00009782835,0.00009941558,0.00087485573,0.00077835965,0.00041403022,0.00014909486,0.00024146357,0.0005751819],"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.00002134065,0.00009032517,0.00003823032,0.0000011964793,0.0000046821906,1.7373978e-8,0.00041901405,0.00007113413,0.005003433,0.7052088,0.0005496096,0.28859228],"study_design_scores_gemma":[0.000014442214,0.000106029,0.0004629486,0.000024402912,0.000011715931,0.000002838016,0.002137,0.29418677,0.110597186,0.5891085,0.0032264066,0.000121759585],"about_ca_topic_score_codex":0.000029779143,"about_ca_topic_score_gemma":0.00003494907,"teacher_disagreement_score":0.43356544,"about_ca_system_score_codex":0.000025589254,"about_ca_system_score_gemma":0.00008611635,"threshold_uncertainty_score":0.7392992},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4530349,0.00094243296,0.29023746,0.0561616,0.002314198,0.0024566269,0.00008298665,0.0007287328,0.19404107],"genre_scores_gemma":[0.99397993,0.00009952803,0.0051478953,0.00023835774,0.00007480658,0.000041209812,0.0000014131093,0.000019067513,0.00039778993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9968007,0.000022210754,0.0008905014,0.000839087,0.0009138134,0.00053365476],"domain_scores_gemma":[0.995971,0.000115621464,0.00067854207,0.0005445792,0.0025183952,0.00017183408],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034119384,0.00036364706,0.00051962235,0.000161058,0.00022790986,0.00034664886,0.0030971996,0.00018225578,0.00012740977],"category_scores_gemma":[0.00060773036,0.00026318544,0.00016539765,0.0025611168,0.00047453222,0.0007110403,0.00056171557,0.00051980047,0.000033323744],"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.00010069834,0.00045168016,0.0004749667,0.0008348951,0.0000295469,0.0000041196245,0.0024039198,0.000026112184,0.02158046,0.9547033,0.0001383587,0.019252],"study_design_scores_gemma":[0.00005869217,0.00015258664,0.00016335378,0.00056305306,0.000017466464,0.0000249672,0.00048557625,0.0028613375,0.72476405,0.2704925,0.00014762055,0.00026880592],"about_ca_topic_score_codex":0.000016364278,"about_ca_topic_score_gemma":0.00002204853,"teacher_disagreement_score":0.7031836,"about_ca_system_score_codex":0.000029134966,"about_ca_system_score_gemma":0.00094863086,"threshold_uncertainty_score":0.99998206},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17506412,0.000018604365,0.81151366,0.005568256,0.00034202667,0.00043506574,0.0000018421567,0.00011479503,0.0069416277],"genre_scores_gemma":[0.9881065,0.000005015431,0.011424764,0.00027770034,0.000075257376,0.000029044317,5.9920234e-7,0.000014451497,0.00006670336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774516,0.000041915937,0.0005813119,0.0005729128,0.00056486914,0.00049381424],"domain_scores_gemma":[0.99867,0.00034771446,0.00020906409,0.00028810572,0.00035477817,0.0001303333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001446263,0.00023057846,0.0002729323,0.0003313429,0.00031503613,0.0003325781,0.0015857156,0.00009942116,0.000015498043],"category_scores_gemma":[0.0006292717,0.00019604295,0.00006196406,0.0010711683,0.000113531554,0.00067401974,0.00040558673,0.0004431956,0.00011743505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008434173,0.00009886828,0.0038659587,0.00009280079,0.000008655461,0.0000017350687,0.015606924,0.061593298,0.010874611,0.6341127,0.00015966821,0.2735004],"study_design_scores_gemma":[0.00004760989,0.00046694095,0.00042703532,0.0019246849,0.0000060782254,0.000004409371,0.0024376048,0.789782,0.16751394,0.036809538,0.00021169339,0.00036847487],"about_ca_topic_score_codex":0.00024925757,"about_ca_topic_score_gemma":0.000070799775,"teacher_disagreement_score":0.81304234,"about_ca_system_score_codex":0.00008840878,"about_ca_system_score_gemma":0.00007906898,"threshold_uncertainty_score":0.7994399},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017426582,0.0000060140806,0.96449673,0.003932693,0.00018699454,0.000232238,9.991127e-7,0.000107017695,0.013610735],"genre_scores_gemma":[0.9766212,0.00003578874,0.022155099,0.0002542939,0.000091559144,0.00001557141,0.0000011655347,0.0000122136635,0.0008131003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983486,0.000018366325,0.00038816268,0.00041039818,0.00055192574,0.000282542],"domain_scores_gemma":[0.9982091,0.000042780623,0.0003384989,0.0003336522,0.0010100498,0.00006590266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024994963,0.00018316366,0.00018393353,0.00012343827,0.00019884369,0.0003713414,0.0009817776,0.00007344024,0.0000207106],"category_scores_gemma":[0.00022708533,0.00013397772,0.00006717301,0.0009342728,0.00012580409,0.00090090744,0.000278634,0.0002758847,0.000035151254],"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.000026995376,0.000048800808,0.000033941058,0.000035689605,0.000012140419,6.057008e-7,0.00092401804,0.117277,0.019816786,0.8484454,0.000019418436,0.013359188],"study_design_scores_gemma":[0.000017335096,0.000093646755,0.000015035174,0.00010234714,0.0000052318783,0.0000075330413,0.00017695961,0.6102195,0.3456791,0.04354263,0.00003424531,0.00010643823],"about_ca_topic_score_codex":0.000022197164,"about_ca_topic_score_gemma":0.0000047685903,"teacher_disagreement_score":0.9591946,"about_ca_system_score_codex":0.00006645644,"about_ca_system_score_gemma":0.00025417085,"threshold_uncertainty_score":0.5463453},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3155464,0.000042455118,0.6434838,0.034732472,0.001044241,0.0010580195,0.000018848437,0.00057489565,0.0034988793],"genre_scores_gemma":[0.9496936,0.0000056867684,0.05001699,0.00012291635,0.00005586509,0.00005999035,9.216307e-7,0.0000133169015,0.00003067819],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789566,0.0000145349295,0.00051108544,0.00058996194,0.00057527097,0.0004134748],"domain_scores_gemma":[0.9964853,0.00015876215,0.0004290715,0.0017360275,0.0010899563,0.000100864156],"candidate_categories":["metaresearch","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0011425613,0.00021336472,0.00023407106,0.00016879429,0.00018850318,0.0003061442,0.016594118,0.00012494912,0.0000037692173],"category_scores_gemma":[0.022072805,0.00016705458,0.000099199846,0.00076598744,0.00026712642,0.00031777925,0.011747454,0.00026517888,0.00004885521],"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.000088931345,0.00018060033,0.00011609716,0.000058724465,0.000017660392,3.6679398e-7,0.00088175485,0.00072578766,0.0730761,0.836983,0.012811002,0.07505997],"study_design_scores_gemma":[0.000021582053,0.00009025074,0.000013015246,0.00006759041,0.000004189792,0.0000016649742,0.00018748984,0.34793866,0.3278042,0.3236884,0.00008021079,0.00010274785],"about_ca_topic_score_codex":0.000024632913,"about_ca_topic_score_gemma":0.000004314766,"teacher_disagreement_score":0.6341472,"about_ca_system_score_codex":0.0001228768,"about_ca_system_score_gemma":0.0001571911,"threshold_uncertainty_score":0.9962453},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63690203,0.00016523967,0.26185927,0.006850662,0.0026372103,0.0022352564,0.0000034985062,0.0005404724,0.08880639],"genre_scores_gemma":[0.9986452,0.0000035789467,0.0010281941,0.000067354464,0.000055093282,0.000034162225,4.6631357e-7,0.000007235636,0.00015872998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981128,0.000043409498,0.00054105034,0.00048268796,0.0004995217,0.00032052514],"domain_scores_gemma":[0.99854094,0.00007781358,0.00034343486,0.00033261784,0.0005922895,0.00011291869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012972405,0.00018748466,0.00024675764,0.00013365927,0.0000717519,0.000249695,0.0013160292,0.00011247735,0.000014610179],"category_scores_gemma":[0.00051518704,0.0001365808,0.000086266045,0.0006526572,0.00020021373,0.00046337038,0.00014329843,0.00029017593,0.00008377131],"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.0000532144,0.00024211804,0.0024166761,0.000035036595,0.0000039429183,8.881905e-7,0.0010041549,0.00015886597,0.004682005,0.88562095,0.00006876592,0.10571336],"study_design_scores_gemma":[0.00008431696,0.0005426717,0.0016757889,0.00006405611,0.0000069432504,0.0000063551242,0.001582316,0.08885892,0.23245287,0.6738954,0.00050937914,0.00032096953],"about_ca_topic_score_codex":0.0004546915,"about_ca_topic_score_gemma":0.00013125145,"teacher_disagreement_score":0.36174318,"about_ca_system_score_codex":0.000103618,"about_ca_system_score_gemma":0.00024685505,"threshold_uncertainty_score":0.55696034},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12547378,0.000015387846,0.8697483,0.002273705,0.00023564737,0.00052449014,0.0000038049677,0.00014567554,0.0015792125],"genre_scores_gemma":[0.97084063,0.0000015408956,0.028784813,0.00019680696,0.000052458417,0.000050397673,0.0000023778412,0.000014818465,0.00005614313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984817,0.000034680404,0.00032605362,0.00041184723,0.00042608532,0.00031963456],"domain_scores_gemma":[0.9982907,0.00058050704,0.00025969718,0.00023608569,0.00056984444,0.00006317194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009813661,0.00017716538,0.00019603166,0.00012915459,0.00046245893,0.00024459325,0.0010557648,0.00005416838,0.000016515884],"category_scores_gemma":[0.0005558033,0.00013080197,0.000053998898,0.00049076095,0.00010317501,0.00040111458,0.00012089901,0.00024784944,0.000009554294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005753231,0.00014011524,0.006241894,0.00018795012,0.00002471502,4.704214e-7,0.006752887,0.09144473,0.03303749,0.7671921,0.00028039207,0.09412191],"study_design_scores_gemma":[0.00005447397,0.0006524516,0.000082304505,0.00028068558,0.000006923209,0.0000010370936,0.00052417093,0.72154653,0.26041546,0.016065734,0.00019594956,0.00017427541],"about_ca_topic_score_codex":0.00006536792,"about_ca_topic_score_gemma":0.000010218607,"teacher_disagreement_score":0.84536684,"about_ca_system_score_codex":0.00003803956,"about_ca_system_score_gemma":0.0001307757,"threshold_uncertainty_score":0.53339493},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043720912,0.0000013795768,0.9430262,0.003804643,0.0008666983,0.00067547325,0.000004664285,0.00024402443,0.0076560136],"genre_scores_gemma":[0.92805934,0.0000019311192,0.07149282,0.0002100733,0.000070003225,0.000050146235,7.39713e-7,0.000009953144,0.00010500779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854857,0.000008100714,0.0004621596,0.00038290033,0.00033359844,0.00026466924],"domain_scores_gemma":[0.99847144,0.000113910595,0.00032468518,0.00018499323,0.0008177216,0.000087265034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044302968,0.00017196807,0.00018279468,0.00015308918,0.0002430292,0.00026758216,0.00084043667,0.00010975705,0.00015669945],"category_scores_gemma":[0.00047905548,0.00014003646,0.00011756733,0.0004862118,0.00017541977,0.0003488934,0.00007214494,0.00028416322,0.000023275714],"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.000020743673,0.0000739505,0.00021556957,0.000024637255,0.000007898279,7.901794e-8,0.00014180181,0.00032367426,0.08006689,0.7845703,0.000073472926,0.134481],"study_design_scores_gemma":[0.000032136923,0.000081446,0.0003181641,0.00003772486,0.000006820145,0.0000035938301,0.000036090747,0.57323,0.39091712,0.03511845,0.000100799254,0.00011762292],"about_ca_topic_score_codex":0.000013167595,"about_ca_topic_score_gemma":0.000017152843,"teacher_disagreement_score":0.88433844,"about_ca_system_score_codex":0.000027226697,"about_ca_system_score_gemma":0.00018212668,"threshold_uncertainty_score":0.5710521},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89590484,0.0000027498243,0.093541026,0.0018898213,0.00032492465,0.0015761118,0.000033778568,0.000121646044,0.0066050873],"genre_scores_gemma":[0.99305606,0.0000015205643,0.006177295,0.000090791305,0.00009099471,0.00026812192,0.000003027886,0.000018810757,0.00029339077],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99747235,0.00004141255,0.0008616331,0.0006665817,0.0006455121,0.00031251617],"domain_scores_gemma":[0.9964354,0.00056271395,0.0006599757,0.00049588474,0.0017289172,0.00011711351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033700347,0.00021730062,0.00031444008,0.00020028133,0.00025457743,0.000411814,0.00192765,0.00014822555,0.00016914959],"category_scores_gemma":[0.0027165157,0.0001474073,0.00016189508,0.0008661939,0.0005641984,0.00044209906,0.00013303915,0.00035782286,0.000077461475],"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.000097694945,0.000109983615,0.0001078562,0.000008575683,0.0000034375023,3.309566e-8,0.00037496668,0.000054197906,0.6225063,0.3514444,0.00009027023,0.025202299],"study_design_scores_gemma":[0.000014962619,0.00013277556,0.00009597114,0.000021903445,0.000007650236,0.0000028743762,0.000463717,0.027496375,0.5388041,0.4327681,0.000087289955,0.0001042719],"about_ca_topic_score_codex":0.0000137319175,"about_ca_topic_score_gemma":0.0000119719325,"teacher_disagreement_score":0.09715119,"about_ca_system_score_codex":0.000014869101,"about_ca_system_score_gemma":0.00008113711,"threshold_uncertainty_score":0.60110956},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10312457,0.000016548918,0.89164424,0.0022544484,0.00053912157,0.00052773836,0.0000063730113,0.00015322801,0.0017337131],"genre_scores_gemma":[0.9633968,0.000012082732,0.035986334,0.00018398957,0.00011978375,0.000038713504,0.0000012985521,0.000017576698,0.000243407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980719,0.000017503158,0.00041447577,0.0006266474,0.00036772076,0.00050176913],"domain_scores_gemma":[0.99791014,0.00015446998,0.00039162417,0.0003024715,0.0011209171,0.000120396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004533283,0.00030225553,0.00030528163,0.00009070948,0.00038207028,0.0004246382,0.002003649,0.00018416838,0.000045578447],"category_scores_gemma":[0.00037345683,0.00020086902,0.00010823721,0.0004891524,0.00033791462,0.0003359918,0.000271641,0.000913436,0.000009386228],"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.00009791457,0.000053767573,0.00034450076,0.000023784452,0.000019718249,4.0205242e-7,0.0006026414,0.0014620536,0.042585123,0.916093,0.00011156569,0.03860552],"study_design_scores_gemma":[0.000050513983,0.00051030953,0.00025553754,0.00016488227,0.000021976708,0.000014206924,0.00031607552,0.5516041,0.21015635,0.23645753,0.00009107291,0.00035742635],"about_ca_topic_score_codex":0.000024217943,"about_ca_topic_score_gemma":0.000034414537,"teacher_disagreement_score":0.8602722,"about_ca_system_score_codex":0.000026355967,"about_ca_system_score_gemma":0.0001112844,"threshold_uncertainty_score":0.8191201},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26632667,0.0000012803968,0.72847337,0.0020253717,0.00040691742,0.000529301,0.0000013371744,0.00004787216,0.002187859],"genre_scores_gemma":[0.98424345,0.0000034259585,0.015433941,0.0001233703,0.00009056441,0.000014740963,2.7850115e-7,0.000011330035,0.000078891404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851656,0.00000851062,0.00049120386,0.0003320576,0.0003311961,0.00032046458],"domain_scores_gemma":[0.9990047,0.00011292921,0.0001565868,0.00024459153,0.00042688398,0.000054305685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050033495,0.00016197533,0.00018516996,0.000263923,0.0001281397,0.000198497,0.0013794834,0.00010745072,0.00001359263],"category_scores_gemma":[0.00062738877,0.00013149677,0.00009246519,0.0007690908,0.00015785982,0.00044943465,0.00013230758,0.0003377634,0.000011178895],"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.000023566494,0.000034709443,0.00035579078,0.000022694534,0.0000034921795,5.961643e-8,0.0007024275,0.031539567,0.12777175,0.82857877,0.0000032350981,0.010963935],"study_design_scores_gemma":[0.00003171389,0.00008502901,0.00016784205,0.00006005424,0.0000034441423,0.0000011168491,0.0000422446,0.6853062,0.2513439,0.06279636,0.000047020854,0.00011509155],"about_ca_topic_score_codex":0.000090459485,"about_ca_topic_score_gemma":0.000025282301,"teacher_disagreement_score":0.7657824,"about_ca_system_score_codex":0.00004839562,"about_ca_system_score_gemma":0.00016288046,"threshold_uncertainty_score":0.53622824},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93002695,0.000005158767,0.064437136,0.001159846,0.0006398947,0.00029627493,0.0000049264877,0.000093356175,0.003336452],"genre_scores_gemma":[0.9835921,0.0000035256464,0.016185096,0.00005208256,0.0000458726,0.000007668565,3.5240052e-7,0.000009458448,0.000103848775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99829584,0.00001859803,0.00049409224,0.00037848068,0.00051662745,0.0002963292],"domain_scores_gemma":[0.9982394,0.00026176835,0.00047442384,0.00032202236,0.0006132894,0.00008911981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076377374,0.00017238785,0.00021754058,0.00014631575,0.00020489846,0.0002552563,0.0012334954,0.000091134694,0.000029081873],"category_scores_gemma":[0.00085344183,0.00013010384,0.00009424861,0.00043350065,0.00023757809,0.00032408015,0.00024189455,0.0006290147,0.000031194206],"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.00006098066,0.00015379183,0.0015636416,0.00006321285,0.000012050559,5.20999e-7,0.0017352146,0.002141694,0.2841086,0.6575173,0.000047925834,0.052595075],"study_design_scores_gemma":[0.000021887476,0.00013089793,0.0010628076,0.00027914764,0.000010221524,0.00000842221,0.00012427881,0.37711778,0.5941393,0.02679728,0.00012778795,0.00018021012],"about_ca_topic_score_codex":0.00019506397,"about_ca_topic_score_gemma":0.000015333304,"teacher_disagreement_score":0.63072,"about_ca_system_score_codex":0.000016413065,"about_ca_system_score_gemma":0.00011569439,"threshold_uncertainty_score":0.5305481},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39238918,0.000069392554,0.59055233,0.0025900805,0.0012159426,0.00038470145,0.0000026598275,0.00020925415,0.012586476],"genre_scores_gemma":[0.9695887,0.000022958428,0.029609198,0.0002932278,0.000084028674,0.000008434507,7.4649535e-7,0.000017572378,0.00037515545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973864,0.000037691596,0.00076225604,0.0006207523,0.00071986933,0.00047302543],"domain_scores_gemma":[0.9972873,0.00014591747,0.0006543864,0.0004873212,0.001306781,0.00011830183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000566803,0.0002732167,0.00033755004,0.00011067472,0.00038723144,0.0005537325,0.0021233805,0.00011099501,0.00006721472],"category_scores_gemma":[0.0016697827,0.00023126673,0.00014157395,0.0010710596,0.0003133959,0.0006359436,0.0009401903,0.00042766143,0.0000443355],"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.0000059023328,0.00006443905,0.0045475597,0.000094989286,0.00002993782,0.000002039441,0.0020746945,0.02340828,0.1324855,0.8216764,0.000058221598,0.015552089],"study_design_scores_gemma":[0.000020173324,0.000047605557,0.0002166911,0.00036523963,0.0000135838145,0.000009669414,0.0005069002,0.48353928,0.48338702,0.03159981,0.0000774367,0.00021660839],"about_ca_topic_score_codex":0.000074682124,"about_ca_topic_score_gemma":0.0000076667075,"teacher_disagreement_score":0.79007655,"about_ca_system_score_codex":0.00007152263,"about_ca_system_score_gemma":0.00043590248,"threshold_uncertainty_score":0.94307834},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89607525,0.0000035565774,0.100082956,0.00083738484,0.0005672851,0.0005328908,0.000001703101,0.00006542404,0.0018335562],"genre_scores_gemma":[0.9945309,0.000006019817,0.005189115,0.00012917211,0.000064396765,0.000024788755,5.0243455e-7,0.000007815729,0.00004727115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985372,0.000014395756,0.00045341568,0.0003412829,0.00040390878,0.00024980068],"domain_scores_gemma":[0.9989896,0.000034776484,0.00035084895,0.00025776846,0.00030678275,0.000060246635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035302402,0.00016957751,0.00018867545,0.00014685182,0.00010143103,0.00021641937,0.0010957447,0.000079386075,0.000027180926],"category_scores_gemma":[0.000051169143,0.00011476944,0.000056278837,0.00039932705,0.0000910899,0.00061682146,0.0001686497,0.00026316504,0.000054911878],"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.00013173469,0.0006236679,0.0073056165,0.00017385006,0.000028007653,0.0000028131647,0.00878818,0.0017197361,0.12121855,0.5988208,0.00039662034,0.2607904],"study_design_scores_gemma":[0.00005829436,0.00018580824,0.0023375368,0.00019401652,0.0000040052723,0.000018585562,0.000085779735,0.56718904,0.4208396,0.008776344,0.000112021844,0.0001989751],"about_ca_topic_score_codex":0.000061729384,"about_ca_topic_score_gemma":0.00013960643,"teacher_disagreement_score":0.59004444,"about_ca_system_score_codex":0.0000299222,"about_ca_system_score_gemma":0.000039224175,"threshold_uncertainty_score":0.4680162},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012889224,0.000014665818,0.97459596,0.0023655,0.00031494003,0.0005411568,0.0000056864214,0.00024142016,0.009031439],"genre_scores_gemma":[0.97651875,0.000027210182,0.022840643,0.0002891658,0.00008047936,0.000019073663,4.83905e-7,0.000012886199,0.00021127888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99834275,0.000017623397,0.0004278173,0.0004819563,0.00036116043,0.00036867123],"domain_scores_gemma":[0.9982632,0.00029640278,0.0003429178,0.00035610652,0.0006448703,0.000096508884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000566681,0.00022060785,0.00029596948,0.00013486635,0.00033137255,0.00021396513,0.0019278448,0.00008061294,0.000019330977],"category_scores_gemma":[0.0010435196,0.00016449862,0.00018576294,0.0004992986,0.00020271458,0.00063836284,0.00030251377,0.0002310186,0.00002656746],"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.000047619444,0.000071642105,0.00006410735,0.000028137001,0.000009194664,1.2066182e-7,0.00043359242,0.00002936801,0.052722044,0.87338823,0.000549281,0.072656676],"study_design_scores_gemma":[0.000023950353,0.00024225608,0.000066550805,0.00014164143,0.000008113581,0.0000017435191,0.00017608929,0.04695245,0.6648373,0.28683636,0.0005486819,0.00016485166],"about_ca_topic_score_codex":0.000016000618,"about_ca_topic_score_gemma":0.00000276644,"teacher_disagreement_score":0.96362954,"about_ca_system_score_codex":0.000047041,"about_ca_system_score_gemma":0.000055363565,"threshold_uncertainty_score":0.67080593},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038800124,0.0001472617,0.9423164,0.0065102563,0.0010945539,0.00064817787,0.000031192412,0.00019874971,0.010253265],"genre_scores_gemma":[0.94435817,0.000013092756,0.054533534,0.00037006,0.00010695082,0.00004086461,0.0000027056062,0.000015408976,0.0005592256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99817944,0.000017093103,0.0004794688,0.00052227755,0.00037345185,0.00042829264],"domain_scores_gemma":[0.99802476,0.00031387788,0.00031510222,0.00030278185,0.000940849,0.00010261707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005336645,0.00021698607,0.00026421383,0.00007895617,0.0003398604,0.00038721028,0.0014634008,0.000103499486,0.00003118324],"category_scores_gemma":[0.00082089985,0.00018029791,0.00013469685,0.0004946078,0.00013307441,0.00026957507,0.00034624935,0.00030517584,0.000030608553],"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.00007217608,0.00011033719,0.0005011687,0.000103470076,0.00002520577,0.0000041764793,0.0019059938,0.0025405039,0.01742646,0.9283049,0.0016033275,0.047402263],"study_design_scores_gemma":[0.00005142979,0.0001955052,0.00007884678,0.0005274818,0.000020426061,0.000019188377,0.0006350579,0.31273356,0.5964551,0.08704894,0.0019078203,0.00032662522],"about_ca_topic_score_codex":0.000008036731,"about_ca_topic_score_gemma":0.0000014300143,"teacher_disagreement_score":0.90555805,"about_ca_system_score_codex":0.000037983187,"about_ca_system_score_gemma":0.0002167939,"threshold_uncertainty_score":0.73523355},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84135014,0.00001542352,0.14579608,0.0030431526,0.00046700615,0.000400762,0.000004442825,0.00013679887,0.008786194],"genre_scores_gemma":[0.9399546,0.0000045857996,0.059661947,0.000093642506,0.00008723216,0.000009314416,2.8024039e-7,0.000016009886,0.00017243256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99794066,0.000013914989,0.00038858713,0.0005418861,0.0006187104,0.0004962638],"domain_scores_gemma":[0.9983737,0.00012613606,0.0002449821,0.00040100838,0.00071262434,0.00014153679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007031537,0.00025161004,0.00024313142,0.0001499887,0.00046604537,0.00042506537,0.002228486,0.00012325782,0.00006700265],"category_scores_gemma":[0.00015870373,0.00017602918,0.00007973855,0.0007197203,0.00039288195,0.0005120936,0.00037103955,0.00077547366,0.00007402543],"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.00012104805,0.00021151536,0.0032905845,0.00008135983,0.000026404832,0.0000034185155,0.0031670178,0.0035062302,0.11280322,0.8484004,0.000070482485,0.02831831],"study_design_scores_gemma":[0.00003990409,0.0003986635,0.0001055157,0.00040541653,0.00001692832,0.000037647733,0.00040107494,0.4184826,0.5672919,0.012336333,0.00014301177,0.00034098653],"about_ca_topic_score_codex":0.00016484463,"about_ca_topic_score_gemma":0.00003626449,"teacher_disagreement_score":0.8360641,"about_ca_system_score_codex":0.000028562205,"about_ca_system_score_gemma":0.00023753209,"threshold_uncertainty_score":0.7178262},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7722841,0.000015027756,0.017110387,0.14531249,0.0022315308,0.003390955,0.0002579601,0.00011645659,0.059281077],"genre_scores_gemma":[0.99633,0.0000036307722,0.0009420655,0.00052064285,0.00019211893,0.00015095927,5.9443664e-7,0.000009883299,0.0018500891],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99775666,0.000024461657,0.00077515945,0.00040747444,0.00069682795,0.00033943568],"domain_scores_gemma":[0.99634653,0.0008586108,0.00055204885,0.0004682151,0.0016172202,0.0001573496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003500555,0.00016554144,0.00022651987,0.00013947052,0.0011888122,0.00050125446,0.0024007978,0.00011962983,0.00052506424],"category_scores_gemma":[0.003364534,0.00008922679,0.00016585863,0.0007833687,0.00089883205,0.00019574711,0.0001024428,0.0004060259,0.00018439759],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00003110853,0.00003204596,0.00011852694,0.000003318436,0.0000056920458,9.442777e-9,0.0007482982,0.000029339324,0.024245828,0.9195041,0.0008108268,0.05447089],"study_design_scores_gemma":[0.000014296124,0.00003593817,0.0012952453,0.000009995483,0.000010198293,0.0000014520963,0.0018673429,0.00093270506,0.20256607,0.78649503,0.0066633034,0.000108433844],"about_ca_topic_score_codex":0.012784905,"about_ca_topic_score_gemma":0.061691355,"teacher_disagreement_score":0.2240459,"about_ca_system_score_codex":0.00003151078,"about_ca_system_score_gemma":0.00029145312,"threshold_uncertainty_score":0.993789},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46239653,0.00000569461,0.5161762,0.005125727,0.0008815795,0.0007454656,0.0000023066464,0.0001671327,0.014499364],"genre_scores_gemma":[0.9785025,0.000008654375,0.021050623,0.00019090179,0.00009255003,0.000009723738,5.7634804e-7,0.00001556093,0.00012886863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778163,0.000028095517,0.0007084955,0.0004453324,0.00056090526,0.00047556104],"domain_scores_gemma":[0.998288,0.00014239008,0.0005325306,0.0003068382,0.00064133154,0.00008893226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073210895,0.00025254794,0.00029782162,0.00047759642,0.00019978108,0.00035525745,0.0019273813,0.0001429204,0.0000215452],"category_scores_gemma":[0.0011682498,0.00020890993,0.0000951567,0.0016401889,0.00033964653,0.0005431751,0.00061150064,0.0006494951,0.000035140674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032900778,0.000070535796,0.000625311,0.000031918098,0.00000803781,7.471086e-7,0.0022107342,0.306659,0.09016816,0.58903694,0.000027168344,0.011128538],"study_design_scores_gemma":[0.00005172836,0.00008198752,0.00046443086,0.00014680233,0.0000052351274,0.000007585079,0.00032957576,0.8605183,0.10069244,0.037472147,0.00001817526,0.0002115995],"about_ca_topic_score_codex":0.0006387252,"about_ca_topic_score_gemma":0.000048708804,"teacher_disagreement_score":0.5538593,"about_ca_system_score_codex":0.00011045727,"about_ca_system_score_gemma":0.00026957414,"threshold_uncertainty_score":0.85191},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9837269,0.000016480319,0.00018617087,0.0009997714,0.0007456513,0.00020647881,0.000055233584,0.00001699138,0.0140463095],"genre_scores_gemma":[0.9989763,0.0000062822646,0.00027304125,0.000116103074,0.00021166199,0.00001253888,0.000003101807,0.0000105699855,0.00039043458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987719,0.0000066084617,0.00062825903,0.00031889958,0.000074610856,0.00019972918],"domain_scores_gemma":[0.99922615,0.000033746146,0.0004135292,0.0001494247,0.00013740716,0.0000397682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006561009,0.00013364044,0.00024047277,0.00014195932,0.00008653966,0.00009714059,0.00047030096,0.000120825694,0.000705012],"category_scores_gemma":[0.0004890778,0.00011735379,0.0000710337,0.00026094445,0.00016356616,0.00017865974,0.000054287335,0.00035932363,0.00012689171],"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.00001633767,0.000052114316,0.004372313,0.000016564687,0.000004840262,8.37087e-8,0.0007216127,0.00003738156,0.045963906,0.9475725,0.00006838008,0.0011739155],"study_design_scores_gemma":[0.000034199613,0.000050352955,0.0030305418,0.000050739105,0.000002219694,0.0000036231872,0.00029059983,0.0143758785,0.1908839,0.79066795,0.0004283616,0.00018164355],"about_ca_topic_score_codex":0.000084590436,"about_ca_topic_score_gemma":0.00011725076,"teacher_disagreement_score":0.15690462,"about_ca_system_score_codex":0.000023960696,"about_ca_system_score_gemma":0.000021086777,"threshold_uncertainty_score":0.7719387},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51966846,0.000013269718,0.46008107,0.0013336851,0.0006285302,0.0004218116,0.0000011714473,0.00014346522,0.017708555],"genre_scores_gemma":[0.9522693,0.00000573684,0.04722133,0.00025199476,0.00005573751,0.000009440653,3.394072e-8,0.000011647303,0.0001747545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981855,0.000014902471,0.00047111386,0.0005252689,0.00042620042,0.00037700633],"domain_scores_gemma":[0.99875057,0.000035035016,0.00023176186,0.00040366445,0.0004599453,0.000119039556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043726878,0.00019978208,0.00023363983,0.0001564686,0.000173926,0.00016508425,0.0023767117,0.00007156722,0.000068662266],"category_scores_gemma":[0.0002974805,0.00015591898,0.00009593514,0.00058598677,0.000118473596,0.00041406712,0.0006407082,0.00022928244,0.00014997326],"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.000023158895,0.00008273099,0.00049909257,0.000028641307,0.000010490319,8.0954607e-7,0.0046379585,0.00013636233,0.054309826,0.89476097,0.00002320794,0.045486767],"study_design_scores_gemma":[0.00001160129,0.00012260552,0.00017321853,0.00026321175,0.0000109956145,0.000007855204,0.0005831832,0.18910943,0.6475202,0.16192223,0.000035822297,0.00023964545],"about_ca_topic_score_codex":0.00023486784,"about_ca_topic_score_gemma":0.00001731389,"teacher_disagreement_score":0.73283875,"about_ca_system_score_codex":0.000044103563,"about_ca_system_score_gemma":0.0000801548,"threshold_uncertainty_score":0.6358192},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9733028,0.000020302123,0.015926888,0.0019357901,0.00044340288,0.00028959068,0.000005102648,0.00008255801,0.00799361],"genre_scores_gemma":[0.9914392,0.000014559565,0.0082768975,0.00005325062,0.00003731697,0.000005896327,2.482767e-7,0.000005451052,0.00016717921],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987113,0.000016973645,0.00035317495,0.00036770545,0.000356284,0.00019454666],"domain_scores_gemma":[0.99852496,0.00024243725,0.00033137324,0.00025963582,0.0005742789,0.00006732983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044401563,0.00015474457,0.00020046737,0.000081739825,0.00013303268,0.00012463993,0.0011455365,0.00008796985,0.000028220338],"category_scores_gemma":[0.0013133762,0.00011050051,0.000055652818,0.00034802224,0.00031865694,0.00021973484,0.0002606865,0.0004725467,0.0000075159705],"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.000028712042,0.000081804435,0.0005869829,0.00004554178,0.000006375773,1.8908338e-7,0.0016443066,0.000030284824,0.10116308,0.5679729,0.000026246733,0.32841358],"study_design_scores_gemma":[0.0000286578,0.0002155444,0.003715,0.000106118656,0.000009113357,0.000010581047,0.00022343881,0.2847931,0.5478815,0.16274135,0.00009158757,0.0001839872],"about_ca_topic_score_codex":0.00009251945,"about_ca_topic_score_gemma":0.000023580014,"teacher_disagreement_score":0.44671842,"about_ca_system_score_codex":0.0000050128706,"about_ca_system_score_gemma":0.000051311796,"threshold_uncertainty_score":0.450608},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93108124,0.0000052149135,0.000061494495,0.010285281,0.00046419213,0.00040496004,0.000007761133,0.00003698926,0.05765288],"genre_scores_gemma":[0.99915737,0.000011530287,0.000075014475,0.0004149394,0.000103251776,0.000023937804,4.461233e-7,0.0000080275095,0.00020546147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985103,0.000032767795,0.0003747002,0.00023592047,0.000615572,0.00023075355],"domain_scores_gemma":[0.99823785,0.00032581214,0.0004862548,0.00018064717,0.00071197894,0.000057454843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009765867,0.00013050674,0.00017037445,0.00007303704,0.000467112,0.00014685286,0.0011735852,0.00010259318,0.0005227269],"category_scores_gemma":[0.00088013866,0.00007838495,0.0001095465,0.00043350874,0.0006860812,0.00018718028,0.00006121002,0.00031752454,0.000060387716],"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.00009117548,0.00010213647,0.00062323647,0.000023057259,0.000008810538,8.686323e-8,0.002428661,0.00002642191,0.04370305,0.93933064,0.000051442355,0.013611281],"study_design_scores_gemma":[0.00007437571,0.00022345489,0.0011620583,0.00031401074,0.00005029269,2.867971e-7,0.0113355685,0.02496968,0.5275968,0.4328933,0.0010952643,0.00028492918],"about_ca_topic_score_codex":0.00065888325,"about_ca_topic_score_gemma":0.0009718253,"teacher_disagreement_score":0.5064373,"about_ca_system_score_codex":0.000017029424,"about_ca_system_score_gemma":0.00017058669,"threshold_uncertainty_score":0.5723493},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9956482,0.00002635569,0.0010389873,0.001113167,0.000106765394,0.00016008556,0.00009226232,0.0000280861,0.0017860981],"genre_scores_gemma":[0.9799939,0.000049544204,0.019609122,0.00016836185,0.00006892237,8.9008006e-7,0.000029455166,0.000014472592,0.000065366505],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985247,0.000017370921,0.00036128281,0.00055352825,0.00031254019,0.0002305377],"domain_scores_gemma":[0.9992275,0.000059343354,0.00019877273,0.000363528,0.00007101822,0.00007980848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001973555,0.00017100469,0.00019205389,0.00002623765,0.00026269225,0.00016188998,0.0005959268,0.000062603234,0.00026250078],"category_scores_gemma":[0.00018570606,0.0001420515,0.000032946813,0.000268933,0.00036445144,0.00027232655,0.00088338426,0.00018183033,0.000033080745],"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.00006553495,0.00034026592,0.006831568,0.000024092764,0.00003562983,0.0000020358837,0.0012287155,0.00081488973,0.79996586,0.000976245,0.00013893472,0.18957622],"study_design_scores_gemma":[0.00004514544,0.00003194976,0.0025529005,0.00027194075,0.00005798329,0.000012833854,0.0031817697,0.3764041,0.61184824,0.005084046,0.00025473261,0.00025432793],"about_ca_topic_score_codex":0.0012446096,"about_ca_topic_score_gemma":0.0005027781,"teacher_disagreement_score":0.37558922,"about_ca_system_score_codex":0.000055355817,"about_ca_system_score_gemma":0.00003063017,"threshold_uncertainty_score":0.5792692},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9963122,0.000044466375,0.0018998092,0.00006487864,0.00019405213,0.00020310807,0.000025590842,0.000056009812,0.0011998927],"genre_scores_gemma":[0.99974555,0.00006774674,0.000029798497,0.000012296726,0.00003652612,0.000020171683,0.0000011244612,0.000012883702,0.00007391075],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991106,0.000009460226,0.00033258097,0.0001846626,0.00023516527,0.0001275474],"domain_scores_gemma":[0.99960274,0.000023291424,0.00012942348,0.00008990062,0.00011080457,0.000043845885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000110010915,0.00013259327,0.00018744745,0.000054355918,0.000060603637,0.00003201744,0.00011522702,0.00007119478,0.000046020476],"category_scores_gemma":[0.00003822436,0.000101727106,0.000045509878,0.00017704844,0.00010728635,0.0001339442,0.00002534854,0.00014423685,0.000007190725],"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.00008845906,0.00003509935,0.00027059732,0.00006026824,0.000027674441,2.556331e-7,0.00037951808,0.00033729238,0.9694668,0.0006561593,0.0000016860587,0.02867617],"study_design_scores_gemma":[0.000053073658,0.00015163839,0.0020733937,0.00014460002,0.000019963483,0.0000127560115,0.0012726483,0.068791755,0.9268042,0.00052615034,0.000055416072,0.000094452706],"about_ca_topic_score_codex":0.000008080353,"about_ca_topic_score_gemma":0.000009645875,"teacher_disagreement_score":0.06845446,"about_ca_system_score_codex":0.000029803432,"about_ca_system_score_gemma":0.00001249585,"threshold_uncertainty_score":0.4148311},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9797638,0.0000029066744,0.00044751377,0.00031578352,0.000091055364,0.00014827332,0.000009435629,0.00011173583,0.019109482],"genre_scores_gemma":[0.9990857,0.000027096197,0.00059714995,0.00003732941,0.000047440328,0.0000158248,0.0000011540875,0.00001800766,0.00017024683],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99918824,0.0000041310673,0.0001999701,0.00021730654,0.00020328871,0.00018703607],"domain_scores_gemma":[0.9993975,0.000038786042,0.00009997695,0.00009123305,0.0002955754,0.00007693622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017399316,0.00016844826,0.00018639899,0.0001021965,0.000104524326,0.000113914866,0.00021393546,0.00008599416,0.00044308024],"category_scores_gemma":[0.00008951747,0.000121581805,0.000055985263,0.00029830515,0.00019029471,0.00022437584,0.000036932386,0.0003703762,0.00014205338],"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.000062935505,0.000066791115,0.00018571057,0.000059042166,0.00004265781,3.7983352e-7,0.00035020118,0.00003408089,0.8007593,0.005504558,0.00010221585,0.1928321],"study_design_scores_gemma":[0.00003149245,0.000082377446,0.0003785017,0.0001352667,0.000051519746,0.000011591454,0.000207799,0.06735812,0.9172202,0.014210488,0.0000764355,0.00023625162],"about_ca_topic_score_codex":0.000019420271,"about_ca_topic_score_gemma":0.00003472887,"teacher_disagreement_score":0.19259584,"about_ca_system_score_codex":0.000011081594,"about_ca_system_score_gemma":0.000013833537,"threshold_uncertainty_score":0.4957962},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91940725,0.00023753187,0.0027932015,0.0020572697,0.0009983756,0.00042809147,0.000014759519,0.00076476193,0.073298745],"genre_scores_gemma":[0.998651,0.00015457612,0.00070056657,0.00012347872,0.0000944098,0.000012789093,0.0000012889517,0.000029603394,0.00023223062],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986232,0.000015702319,0.00035866423,0.00032735002,0.0003889431,0.0002861329],"domain_scores_gemma":[0.9989588,0.0000775247,0.00013838541,0.00029452238,0.00046013386,0.00007058315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000119780656,0.0002602572,0.00029090684,0.00009547335,0.00012918386,0.00015736558,0.00055678654,0.000113675684,0.00013273966],"category_scores_gemma":[0.00019005769,0.00019401131,0.000119487064,0.00034587033,0.00017042927,0.00012395011,0.00013251207,0.00035675475,0.00006973422],"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.00013949422,0.00019852053,0.00016112188,0.0000822928,0.000046019428,0.000007242751,0.0007055187,0.0037917586,0.70641387,0.24161367,0.004722935,0.042117555],"study_design_scores_gemma":[0.000020226535,0.00008424228,0.0001105744,0.0009225732,0.000014312755,0.0000050624385,0.00050941965,0.042562872,0.9251459,0.029740714,0.0006782018,0.00020588978],"about_ca_topic_score_codex":0.000015882126,"about_ca_topic_score_gemma":0.0000091024085,"teacher_disagreement_score":0.21873204,"about_ca_system_score_codex":0.00003363099,"about_ca_system_score_gemma":0.00003308241,"threshold_uncertainty_score":0.7911552},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79581153,0.00031234397,0.004794136,0.012543912,0.0017320049,0.00057139306,0.00002596064,0.00009175456,0.18411694],"genre_scores_gemma":[0.9982811,0.000025283445,0.00028050473,0.0002037307,0.00023643227,0.000017139173,0.0000010564802,0.000018115528,0.0009366203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836713,0.000019384695,0.0008365241,0.0003838145,0.00010758809,0.0002855722],"domain_scores_gemma":[0.99843156,0.00015555738,0.000812344,0.00025342306,0.00031398286,0.00003313539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001364586,0.00016762328,0.00028983862,0.00007753955,0.0003231146,0.00026582068,0.00066336605,0.00009934367,0.00032129523],"category_scores_gemma":[0.0013346758,0.00013019396,0.00012775633,0.00047534858,0.00015418204,0.0002185412,0.0001534668,0.00035184552,0.00027323162],"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.000018110792,0.000046590438,0.00210384,0.000048433005,0.000015813219,3.8627408e-7,0.0012666958,0.00011078042,0.0038813357,0.9806694,0.000031974858,0.011806643],"study_design_scores_gemma":[0.000039822025,0.000082290324,0.0034987517,0.0005718248,0.00001880682,0.000018305922,0.0039087865,0.041162595,0.14478505,0.80411667,0.0014496077,0.00034751932],"about_ca_topic_score_codex":0.00003413189,"about_ca_topic_score_gemma":0.00001588668,"teacher_disagreement_score":0.20246957,"about_ca_system_score_codex":0.000050366525,"about_ca_system_score_gemma":0.000031006733,"threshold_uncertainty_score":0.53091556},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84932095,0.00000511422,0.06128389,0.06800082,0.0019349834,0.0004869666,0.000031144107,0.00023610896,0.018700028],"genre_scores_gemma":[0.9944819,0.0000034796572,0.0050572255,0.00032364126,0.00008425041,0.000015432492,0.000003155549,0.00000717966,0.000023739824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985007,0.000017297281,0.00046696627,0.00041076122,0.0003165007,0.00028777958],"domain_scores_gemma":[0.998966,0.00015196577,0.0003076966,0.00022395501,0.0002922931,0.000058125617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054898654,0.00015880285,0.0002182058,0.00022392931,0.0001578448,0.00023636846,0.0017394102,0.00010290222,0.000114756],"category_scores_gemma":[0.00074568135,0.00012456905,0.0001031824,0.000925708,0.00015859063,0.00043827522,0.00022807819,0.00043622678,0.000056915313],"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.000023963341,0.00014786639,0.0013420569,0.0000108677605,0.0000059665563,2.5144982e-7,0.0012756143,0.000009795211,0.03909062,0.57813,0.00047953814,0.3794835],"study_design_scores_gemma":[0.000097728065,0.00010190481,0.0016891637,0.000121951605,0.000018680721,0.000001916906,0.0019608485,0.26467147,0.5527334,0.1771731,0.0009651507,0.0004646491],"about_ca_topic_score_codex":0.0000965214,"about_ca_topic_score_gemma":0.0006066097,"teacher_disagreement_score":0.5136428,"about_ca_system_score_codex":0.000023705177,"about_ca_system_score_gemma":0.000104232444,"threshold_uncertainty_score":0.50797784},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9097442,0.0000020825364,0.031761475,0.00895878,0.00085843937,0.0003414886,0.000012179927,0.00007461033,0.04824676],"genre_scores_gemma":[0.99743074,0.0000014602446,0.0014861899,0.00015841187,0.00013600271,0.000025363082,0.0000011569633,0.0000071728996,0.00075352576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979584,0.000021007352,0.00068344845,0.0003808302,0.00078309665,0.00017317406],"domain_scores_gemma":[0.9974358,0.00033458893,0.00050238287,0.00026695107,0.0013778149,0.00008242908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001204911,0.00013081881,0.00018938887,0.00016970634,0.00051825494,0.00028823002,0.0012262383,0.00007553781,0.00074113195],"category_scores_gemma":[0.0012511071,0.00009228397,0.00012477725,0.0008927746,0.00049468345,0.00032174622,0.00014724796,0.0003969878,0.00063864153],"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.000027212003,0.00009444962,0.0005524884,0.000001838398,0.000004815793,3.1835736e-8,0.00030293572,0.00031285992,0.07964733,0.90285856,0.00034896258,0.015848529],"study_design_scores_gemma":[0.000014207119,0.00003198819,0.002880008,0.00001889477,0.000008179392,0.000008256626,0.0008788371,0.024215996,0.16878909,0.80250454,0.0005480266,0.00010199272],"about_ca_topic_score_codex":0.000014498776,"about_ca_topic_score_gemma":0.000031146123,"teacher_disagreement_score":0.10035402,"about_ca_system_score_codex":0.000016987646,"about_ca_system_score_gemma":0.00006645683,"threshold_uncertainty_score":0.8208658},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16073547,0.000027352022,0.6836759,0.020086175,0.005178322,0.0013807727,0.000017429596,0.0004422259,0.12845637],"genre_scores_gemma":[0.9369345,0.000012456545,0.060827434,0.00011589521,0.00014102827,0.000021362857,4.5420327e-7,0.000014166367,0.0019327335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99757177,0.000026409994,0.0004587995,0.0005144001,0.0010348818,0.00039372488],"domain_scores_gemma":[0.9976195,0.00013253304,0.00018585884,0.0004120061,0.0015009962,0.00014906771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091123284,0.00018134265,0.0002044219,0.00023871407,0.0002456017,0.00043359102,0.002594032,0.0001049026,0.00048704568],"category_scores_gemma":[0.001037099,0.00013689633,0.000104065024,0.0010764416,0.00040917797,0.00042861985,0.0005519737,0.0006533229,0.00022718681],"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.00001971038,0.0002069765,0.00016026254,0.000014119706,0.000011447493,4.2430935e-7,0.00032215452,0.00006192279,0.12178795,0.7572852,0.0004236361,0.11970619],"study_design_scores_gemma":[0.000023595288,0.00011414578,0.00021692883,0.000033034088,0.0000041571125,0.000009866648,0.00009254585,0.2769368,0.6676471,0.053949345,0.00079562794,0.00017686286],"about_ca_topic_score_codex":0.000029570167,"about_ca_topic_score_gemma":0.000008305734,"teacher_disagreement_score":0.776199,"about_ca_system_score_codex":0.000034313198,"about_ca_system_score_gemma":0.00018416722,"threshold_uncertainty_score":0.558247},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021945022,0.000075995675,0.90635943,0.005206162,0.0020517353,0.0014158767,0.000009087326,0.00029263177,0.06264405],"genre_scores_gemma":[0.9904695,0.000082932485,0.008533356,0.00009027202,0.000058455742,0.000040149826,2.747543e-7,0.000013721594,0.00071132206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997568,0.000053572658,0.00061146164,0.00046533672,0.00084809755,0.000453547],"domain_scores_gemma":[0.99763334,0.00025939502,0.00036708947,0.0005710892,0.0010383276,0.00013073832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060077524,0.00021889445,0.0002326476,0.000104593055,0.0005220468,0.0004333159,0.004429891,0.000071304465,0.00023894724],"category_scores_gemma":[0.00080749474,0.00012895174,0.00012095339,0.00070306804,0.000584877,0.00026300445,0.0007346034,0.00037630374,0.00016685495],"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.000053819796,0.00014749478,0.00004753638,0.0000156295,0.000019569743,5.017623e-7,0.0009261434,0.000017334452,0.003592899,0.947091,0.0003354333,0.04775266],"study_design_scores_gemma":[0.00004889808,0.00020934366,0.00072050415,0.00008558903,0.000015724712,0.00000548095,0.00030344387,0.52034765,0.26235792,0.21529116,0.00034517059,0.00026908622],"about_ca_topic_score_codex":0.000047159596,"about_ca_topic_score_gemma":0.0000053390204,"teacher_disagreement_score":0.9685245,"about_ca_system_score_codex":0.000029193596,"about_ca_system_score_gemma":0.00010775629,"threshold_uncertainty_score":0.8231913},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67171043,0.0000041498324,0.27157825,0.0055888155,0.0021451993,0.0009575739,0.000014064774,0.00020953115,0.04779195],"genre_scores_gemma":[0.9888776,0.000006533382,0.010910742,0.000079982325,0.00003211046,0.000013829085,3.8353696e-7,0.0000063368157,0.0000725115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985603,0.00001229099,0.0005440499,0.0003120238,0.00036966137,0.00020167073],"domain_scores_gemma":[0.99831676,0.00008624871,0.00047592007,0.00025164973,0.00079522067,0.000074194424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003264857,0.00015555727,0.0002024326,0.0001254302,0.00015530344,0.00011199002,0.0009379755,0.00008402833,0.0003151956],"category_scores_gemma":[0.0004963198,0.00011789024,0.00010114196,0.00045701544,0.00062446226,0.00028533215,0.00018234263,0.0003626268,0.000024587911],"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.000008084334,0.00006828831,0.0007718112,0.000015552048,0.000007841917,6.807489e-8,0.0003196928,0.000027776445,0.1757304,0.72013944,0.000018374032,0.10289266],"study_design_scores_gemma":[0.000042638676,0.000114947296,0.0019629782,0.000118966665,0.000011771978,0.000011655278,0.0004361821,0.06286051,0.8736846,0.060532607,0.00003915807,0.00018399984],"about_ca_topic_score_codex":0.000015695246,"about_ca_topic_score_gemma":0.000021190786,"teacher_disagreement_score":0.6979542,"about_ca_system_score_codex":0.000015276642,"about_ca_system_score_gemma":0.00013478757,"threshold_uncertainty_score":0.48074245},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8948166,0.00001681512,0.093565665,0.003371078,0.0007892637,0.00072265905,0.0000054486054,0.00007053247,0.0066419384],"genre_scores_gemma":[0.99855757,0.00004193201,0.0011821865,0.0000972261,0.00005497609,0.00002584639,2.3801738e-7,0.00001120125,0.000028821902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9972038,0.000042055253,0.0010232911,0.00038437094,0.00085399597,0.00049248285],"domain_scores_gemma":[0.99762845,0.00045918414,0.0005379809,0.00053167006,0.000760904,0.000081835205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017511663,0.00026048595,0.00033379663,0.0003453076,0.00022737637,0.00041913276,0.0034888107,0.00015035612,0.000042952313],"category_scores_gemma":[0.001025029,0.00017561333,0.00015384445,0.0013706814,0.00073773944,0.0014556672,0.00058021443,0.0008940817,0.000037920505],"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.00006963784,0.000088050496,0.0038000871,0.00005440896,0.000012583021,2.7762428e-7,0.012383271,0.0017212374,0.033961065,0.9001586,0.000022155547,0.047728624],"study_design_scores_gemma":[0.000030840605,0.0001688538,0.0017657952,0.00026343804,0.000010387544,0.0000061231576,0.006250085,0.30812725,0.5423823,0.14067356,0.00004334671,0.00027801664],"about_ca_topic_score_codex":0.0004167835,"about_ca_topic_score_gemma":0.0006078813,"teacher_disagreement_score":0.75948507,"about_ca_system_score_codex":0.000103905026,"about_ca_system_score_gemma":0.00019365172,"threshold_uncertainty_score":0.7161303},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93745345,0.00002019273,0.049389668,0.003020616,0.0009148202,0.0010305721,0.0000014008793,0.00023893997,0.007930354],"genre_scores_gemma":[0.99562424,0.000018774488,0.0038057491,0.00017346346,0.000077195706,0.00010480831,1.8144014e-7,0.00001667335,0.00017890558],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9971658,0.000045520475,0.0009570528,0.0006384732,0.0006635813,0.00052959705],"domain_scores_gemma":[0.9980967,0.00015506691,0.000520757,0.00039687296,0.0007267056,0.00010391259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065633736,0.00028951897,0.00032048894,0.0003133666,0.00024428338,0.0004937232,0.00228868,0.00015726834,0.00019960693],"category_scores_gemma":[0.00072612794,0.00022899549,0.00014023039,0.0013451074,0.00032308596,0.0012024047,0.00065485795,0.0004434407,0.0004246966],"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.000018861334,0.00014156586,0.0005687849,0.000031625335,0.000007593296,6.687598e-7,0.001997266,0.00018258147,0.30541882,0.28761765,0.00005048524,0.4039641],"study_design_scores_gemma":[0.000012655798,0.00010666467,0.0010092332,0.00018318876,0.0000033488218,0.0000043511345,0.00058216276,0.216549,0.6448387,0.13650669,0.000016703634,0.00018730988],"about_ca_topic_score_codex":0.00055619766,"about_ca_topic_score_gemma":0.00013764626,"teacher_disagreement_score":0.4037768,"about_ca_system_score_codex":0.00014125441,"about_ca_system_score_gemma":0.00010533828,"threshold_uncertainty_score":0.9338165},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16775642,0.000060979724,0.78208137,0.010956759,0.0013728122,0.0008638256,0.0000048955544,0.00044456575,0.036458354],"genre_scores_gemma":[0.9757278,0.000008223486,0.02342536,0.00023499812,0.00010045402,0.000039161223,7.0892474e-7,0.000018285551,0.0004450295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9972115,0.000027125483,0.00063486205,0.0006300375,0.0010604687,0.00043597643],"domain_scores_gemma":[0.9971346,0.00014205498,0.00051789376,0.00046074457,0.0015568098,0.00018787303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007943491,0.00030187704,0.00029514823,0.00018880062,0.00022704715,0.00043316596,0.0019585183,0.00011000849,0.000057649082],"category_scores_gemma":[0.00092672236,0.00020779499,0.00010101597,0.0009759618,0.000507369,0.0011156243,0.00039476002,0.00036013284,0.00023575922],"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.00011769944,0.00012296817,0.00044883386,0.000018346806,0.000018422437,0.0000010830238,0.0020893645,0.0025172804,0.004053409,0.901123,0.0007907369,0.08869884],"study_design_scores_gemma":[0.000025746722,0.0003555768,0.00017279598,0.00022815561,0.000013762633,0.000020344454,0.0012536066,0.30795476,0.39581886,0.29370913,0.00015793364,0.0002893217],"about_ca_topic_score_codex":0.000059747636,"about_ca_topic_score_gemma":0.00002234931,"teacher_disagreement_score":0.80797136,"about_ca_system_score_codex":0.00011094442,"about_ca_system_score_gemma":0.00032044674,"threshold_uncertainty_score":0.8473634},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58953565,0.00009723292,0.07442215,0.0017291739,0.00037068388,0.0008286501,0.000010231359,0.00034604993,0.33266017],"genre_scores_gemma":[0.9954129,0.000022624015,0.00408813,0.000020454863,0.000021613707,0.0000042467964,3.0846553e-7,0.000008211016,0.00042152332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99849856,0.000016766242,0.00055324903,0.0003385945,0.00035557957,0.00023727426],"domain_scores_gemma":[0.9980518,0.00009613876,0.00064011244,0.00022492239,0.0009284584,0.0000585254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036686505,0.00015239895,0.00026893467,0.00013252847,0.00021495704,0.000104248444,0.0014038573,0.000046668338,0.0002255824],"category_scores_gemma":[0.0006975961,0.00011379963,0.00011848682,0.0010651207,0.00022620728,0.0005189879,0.0002544327,0.00020647272,0.000045620054],"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.00012013263,0.00042036126,0.005425574,0.00023521841,0.00011016607,9.703764e-7,0.021948582,0.0012438032,0.11384182,0.7602105,0.000104813415,0.096338026],"study_design_scores_gemma":[0.000018937008,0.00026327625,0.0005486315,0.0002695681,0.000026699448,0.00000421979,0.0012531944,0.11539188,0.8367391,0.045276973,0.000022492368,0.00018497641],"about_ca_topic_score_codex":0.00012583753,"about_ca_topic_score_gemma":0.000005001447,"teacher_disagreement_score":0.72289735,"about_ca_system_score_codex":0.000013794274,"about_ca_system_score_gemma":0.00008519128,"threshold_uncertainty_score":0.4640614},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16782962,0.000013977337,0.8116206,0.009018068,0.0007875066,0.0005574308,0.0000055923388,0.00013168086,0.010035546],"genre_scores_gemma":[0.9912999,0.000015264557,0.008200592,0.00010528002,0.000038213933,0.000018129695,9.479268e-8,0.00001233699,0.00031014212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99807006,0.000041035404,0.0005831827,0.00045786667,0.00054130517,0.0003065661],"domain_scores_gemma":[0.9978043,0.00028099728,0.0006544673,0.0003839976,0.0008091586,0.00006709139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006909105,0.00021094219,0.0003115287,0.00013776471,0.00013582008,0.000068794805,0.0026033153,0.00009133886,0.00006767806],"category_scores_gemma":[0.0012550489,0.0001295331,0.00012424265,0.00067599677,0.00059480016,0.0004392787,0.00060024275,0.00019912209,0.00003462522],"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.00006137372,0.00005973571,0.0015749288,0.000030464224,0.00001645068,2.5324996e-7,0.0006692096,0.00015473328,0.10652372,0.834427,0.000046680634,0.05643545],"study_design_scores_gemma":[0.00007033064,0.00019461507,0.0009563812,0.00055261503,0.000011974643,0.0000028623163,0.0003538705,0.04158862,0.76081175,0.19503291,0.00017160107,0.00025248554],"about_ca_topic_score_codex":0.00003734642,"about_ca_topic_score_gemma":0.000004255179,"teacher_disagreement_score":0.8234703,"about_ca_system_score_codex":0.00004454702,"about_ca_system_score_gemma":0.00017401569,"threshold_uncertainty_score":0.5282207},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88825244,0.0000037330835,0.0018830062,0.00013497137,0.000104894796,0.0006083962,0.0000065773806,0.000039387647,0.10896657],"genre_scores_gemma":[0.99485093,0.000003875506,0.004284942,0.00014693182,0.00006098565,0.00003128523,5.56878e-7,0.000021291991,0.00059922313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852395,0.0000059127387,0.00034743187,0.0003730408,0.0003661939,0.00038349515],"domain_scores_gemma":[0.9993732,0.00007430558,0.0002953741,0.00016614927,0.000019525933,0.00007147152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026872224,0.0002122384,0.0001691883,0.00009932391,0.0002716623,0.00005647706,0.0007035191,0.00005411418,0.00071674853],"category_scores_gemma":[0.00015721144,0.00014792875,0.00008313818,0.00031334886,0.0004060678,0.00022763784,0.00030455302,0.00013218069,0.00015878696],"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.0016732878,0.0005249541,0.08576612,0.00008013496,0.000057921818,0.0000023422806,0.014111154,0.003870702,0.010225952,0.55752856,0.00079913303,0.32535973],"study_design_scores_gemma":[0.00041202988,0.003059221,0.035218764,0.0020017317,0.00019233061,0.000019713289,0.005675014,0.17086405,0.24370883,0.53412724,0.0027217837,0.0019993165],"about_ca_topic_score_codex":0.000076894146,"about_ca_topic_score_gemma":0.000011650778,"teacher_disagreement_score":0.32336044,"about_ca_system_score_codex":0.000085751875,"about_ca_system_score_gemma":0.000012437195,"threshold_uncertainty_score":0.7847893},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34589013,0.000032814463,0.642415,0.0038088665,0.0006661769,0.0013048665,0.000057028523,0.000042529922,0.0057825525],"genre_scores_gemma":[0.9782522,0.0000135050195,0.019856697,0.00017624292,0.000030583844,0.00013374878,9.896797e-7,0.000011271385,0.0015247785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99761117,0.000040043586,0.0008896789,0.0006002215,0.00055369776,0.00030521073],"domain_scores_gemma":[0.99763626,0.00054854044,0.00047260372,0.00031252654,0.0009537622,0.00007628677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016196102,0.00017657923,0.00031010862,0.00015058482,0.0002482162,0.00027353625,0.0010855759,0.00010252117,0.00030830136],"category_scores_gemma":[0.0027781997,0.00012437445,0.00017594216,0.00090883573,0.00022610139,0.00027340298,0.00019040353,0.00020740827,0.00010927786],"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.000094660936,0.00022090689,0.00006388852,0.0000074071554,0.0000073491146,3.807997e-7,0.0006880646,0.00025462086,0.12060089,0.84284824,0.000055906694,0.035157673],"study_design_scores_gemma":[0.000043544384,0.000042388434,0.000043032094,0.000041824638,0.000005984143,0.00000212153,0.0034542445,0.024112731,0.49057636,0.4814972,0.00009207433,0.00008848824],"about_ca_topic_score_codex":0.000008699803,"about_ca_topic_score_gemma":0.00003800381,"teacher_disagreement_score":0.632362,"about_ca_system_score_codex":0.00003919758,"about_ca_system_score_gemma":0.000104014056,"threshold_uncertainty_score":0.50718427},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.507431,0.000005295528,0.48240027,0.0070419014,0.0013083628,0.00056181516,0.00000215821,0.00022254516,0.001026702],"genre_scores_gemma":[0.9290134,0.0000024851122,0.07070767,0.00011908224,0.000094119794,0.000018462859,5.2856245e-7,0.000009713047,0.000034583685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986962,0.000011246227,0.0003365912,0.0004360602,0.0002489121,0.00027099723],"domain_scores_gemma":[0.9990065,0.000086058295,0.000287402,0.0002367947,0.00030822356,0.000074982294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006673345,0.00017538977,0.00019643978,0.00008858931,0.00036507534,0.00038773383,0.00091709296,0.000118982214,0.000004149555],"category_scores_gemma":[0.00041520628,0.00013695237,0.00006156889,0.00027524418,0.00022163086,0.000250164,0.00024215806,0.0006937439,0.0000032966211],"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.000018951645,0.00001825757,0.0002118029,0.000029668054,0.000005453739,2.3400563e-8,0.0011413179,0.00023349324,0.017458193,0.59711283,0.000038334212,0.3837317],"study_design_scores_gemma":[0.00014886334,0.00023662216,0.0047868313,0.00016625131,0.000034505385,0.000026373582,0.0013563915,0.17312437,0.30526,0.51083714,0.0034380532,0.0005845857],"about_ca_topic_score_codex":0.000023722612,"about_ca_topic_score_gemma":0.000009652464,"teacher_disagreement_score":0.4215824,"about_ca_system_score_codex":0.000017819502,"about_ca_system_score_gemma":0.00005892457,"threshold_uncertainty_score":0.55847555},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9969142,0.00005337004,0.000016402224,0.0016354908,0.00011314092,0.0001531969,0.0000029035452,0.000022886725,0.0010883965],"genre_scores_gemma":[0.999406,0.00021336754,0.0001527542,0.00009059382,0.00008848349,0.000013153038,3.7473015e-7,8.940449e-7,0.000034400084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990978,0.0000068332592,0.0002644237,0.00024460247,0.00017863733,0.00020768735],"domain_scores_gemma":[0.9996053,0.00002960869,0.000080064296,0.000028012835,0.00019337254,0.00006365583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001714178,0.00012873622,0.00013603123,0.000016840719,0.0001449428,0.00007278105,0.00033570649,0.000049481016,0.000045788835],"category_scores_gemma":[0.00008171566,0.00004667619,0.000039011262,0.0002640105,0.00009659586,0.0001820538,0.000116323,0.000117029245,0.000010162524],"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.0004305014,0.00022732835,0.204001,0.00009182214,0.000019111021,0.00000299407,0.0052540647,0.000084109866,0.13019665,0.60099584,0.00003062927,0.058665972],"study_design_scores_gemma":[0.00004540023,0.00024391526,0.2041505,0.0014138567,0.000033793516,0.0000033025592,0.0051241675,0.014749928,0.6256748,0.14746892,0.00033782917,0.00075358385],"about_ca_topic_score_codex":0.0002793009,"about_ca_topic_score_gemma":0.0001033486,"teacher_disagreement_score":0.49547815,"about_ca_system_score_codex":0.000016691367,"about_ca_system_score_gemma":0.000013002702,"threshold_uncertainty_score":0.19033998},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90096664,0.000070492446,0.013277434,0.007518486,0.00042904948,0.0007622552,0.00011517889,0.000083122875,0.07677735],"genre_scores_gemma":[0.99787545,0.000013516476,0.0009494438,0.00021685762,0.000053893666,0.000016235905,0.0000019633123,0.000007389234,0.0008652543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975843,0.000046680427,0.0004988018,0.00047036834,0.0011681359,0.00023174669],"domain_scores_gemma":[0.99802244,0.00022853618,0.0004242162,0.000332282,0.00085516897,0.00013738616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018743392,0.00016815175,0.0002817152,0.00013265223,0.00016049865,0.00046271435,0.0012996703,0.000048771464,0.00017223497],"category_scores_gemma":[0.0020012625,0.00009918596,0.00005060352,0.00048582174,0.0007548985,0.0004287893,0.0005550282,0.00015493442,0.000102367536],"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.00046982898,0.00019166006,0.00078672916,0.000034893692,0.000021919242,0.0000022012498,0.0031050837,0.000060119586,0.0025536066,0.92548126,0.0013388599,0.06595384],"study_design_scores_gemma":[0.00018971077,0.0005591566,0.0015343652,0.00038238286,0.00004711056,0.000009379831,0.038586352,0.007898056,0.19614449,0.7490517,0.005123938,0.00047335261],"about_ca_topic_score_codex":0.0001581009,"about_ca_topic_score_gemma":0.00007016795,"teacher_disagreement_score":0.19359088,"about_ca_system_score_codex":0.000016774153,"about_ca_system_score_gemma":0.00005959601,"threshold_uncertainty_score":0.44619653},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15122736,0.000012992594,0.7978474,0.0025136876,0.00028256705,0.0012041477,0.000008420908,0.0006701258,0.046233334],"genre_scores_gemma":[0.91864204,0.000011290424,0.080858134,0.00016834398,0.00002430725,0.00006091747,5.7699754e-7,0.000012869562,0.00022152069],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99820995,0.000027338669,0.00038709946,0.0005547498,0.00046790345,0.000352946],"domain_scores_gemma":[0.9984037,0.000053676198,0.00027866496,0.00035456358,0.0007979688,0.0001114056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004947778,0.0002387634,0.00025150867,0.00015183614,0.00022873063,0.00019713973,0.0024974316,0.00007285771,0.000057169364],"category_scores_gemma":[0.00037351478,0.00016551393,0.000054892436,0.00081216206,0.0002519595,0.00059996085,0.00053986954,0.00033445223,0.000120345874],"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.00022363506,0.00016289736,0.00071271847,0.000015750995,0.000020762414,0.0000012446893,0.0078266645,0.000062737665,0.010882658,0.94037527,0.00044446436,0.03927122],"study_design_scores_gemma":[0.00006673417,0.0021513645,0.0011987984,0.0005649069,0.000021822303,0.000016465467,0.0015276129,0.028632563,0.89551336,0.06938299,0.00036837612,0.00055503385],"about_ca_topic_score_codex":0.0001274105,"about_ca_topic_score_gemma":0.000023096753,"teacher_disagreement_score":0.8846307,"about_ca_system_score_codex":0.000047324404,"about_ca_system_score_gemma":0.000097675475,"threshold_uncertainty_score":0.6749462},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9192082,0.00013895117,0.02488516,0.0051975814,0.0013372721,0.00055230886,0.000007313203,0.0002011545,0.048472017],"genre_scores_gemma":[0.99305195,0.00009913379,0.00608379,0.0001777978,0.00008849217,0.000031195865,6.520198e-7,0.000020098196,0.00044686988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9965433,0.000026270416,0.0011244622,0.0008674866,0.0007511107,0.00068738684],"domain_scores_gemma":[0.9972483,0.00026779005,0.000536577,0.0005530427,0.0012709543,0.00012335379],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00068994844,0.00037173618,0.0004555616,0.00025574933,0.00021760345,0.00066691707,0.0025582286,0.00017616057,0.00027635202],"category_scores_gemma":[0.0010367037,0.00030911795,0.00021490993,0.001434744,0.00044535764,0.0014582627,0.0007133846,0.00064427394,0.00017984313],"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.00003647793,0.00021646147,0.00044326458,0.00004496199,0.0000151477825,0.000010985798,0.00358198,0.0008436158,0.065673985,0.8765774,0.0001189274,0.052436836],"study_design_scores_gemma":[0.000018856566,0.00009725558,0.0013915456,0.00037299213,0.0000069657676,0.000015708378,0.00721336,0.032788426,0.71854603,0.23907433,0.00013910365,0.0003354252],"about_ca_topic_score_codex":0.00009675774,"about_ca_topic_score_gemma":0.00010499196,"teacher_disagreement_score":0.652872,"about_ca_system_score_codex":0.000110439796,"about_ca_system_score_gemma":0.0004689017,"threshold_uncertainty_score":0.9999361},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25456,0.00029017974,0.6982523,0.018599257,0.0015579227,0.0021500043,0.000033140772,0.000585005,0.023972142],"genre_scores_gemma":[0.9679116,0.00004596017,0.030315138,0.00043912692,0.00011760982,0.000080831975,0.0000010646592,0.000032175587,0.001056516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9968837,0.00002871504,0.0007750561,0.0009403392,0.00072271953,0.0006494815],"domain_scores_gemma":[0.995733,0.00070385874,0.00053876755,0.0006352959,0.0022392892,0.00014979215],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048805037,0.00038918926,0.0004605702,0.00013669938,0.0003764738,0.00057979824,0.0026052915,0.00013785077,0.000065632485],"category_scores_gemma":[0.00132077,0.00028462266,0.00020870377,0.0010298324,0.0005132962,0.00064275146,0.0005175951,0.00035648549,0.00005934816],"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.00010234882,0.00019400982,0.00014880451,0.00006438981,0.000043193944,0.000005166371,0.001956511,0.0009723025,0.049543995,0.8253349,0.00012448952,0.121509895],"study_design_scores_gemma":[0.000024658262,0.00030240114,0.000023507286,0.0002865931,0.000022403337,0.000020038093,0.0015178686,0.11997942,0.759585,0.11727634,0.00064245815,0.00031928375],"about_ca_topic_score_codex":0.000026980872,"about_ca_topic_score_gemma":0.0000451454,"teacher_disagreement_score":0.71335155,"about_ca_system_score_codex":0.00006566657,"about_ca_system_score_gemma":0.00033868963,"threshold_uncertainty_score":0.9999606},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64408815,0.00010607253,0.3505838,0.00086193695,0.000415702,0.00029667135,0.000001824326,0.00008904509,0.0035568373],"genre_scores_gemma":[0.9729409,0.000048040667,0.026875649,0.000052231666,0.000023125558,0.000008875081,2.495248e-7,0.0000069556622,0.000043933374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984173,0.00002370248,0.0005200415,0.00039516235,0.00041884772,0.00022494356],"domain_scores_gemma":[0.99851894,0.00009363773,0.0005868353,0.0002661773,0.00046697556,0.000067409914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040256095,0.0001934762,0.00028559312,0.00023660346,0.00013288793,0.00019547837,0.0010008212,0.00008768881,0.000015584781],"category_scores_gemma":[0.0003760504,0.00013098586,0.00006895042,0.0008789432,0.0003284034,0.0007808101,0.00025791654,0.00022534798,0.000007064754],"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.000011841816,0.000039351642,0.00012503093,0.000114935865,0.0000049504847,7.944694e-8,0.00096396613,0.000015219431,0.027845956,0.6168413,0.0000103807915,0.35402694],"study_design_scores_gemma":[0.000024188674,0.00011664228,0.00034759645,0.00036997176,0.000009176879,0.000010022785,0.00033248673,0.5308108,0.20949589,0.25836053,0.0000028354675,0.00011988819],"about_ca_topic_score_codex":0.000033968467,"about_ca_topic_score_gemma":0.0000034268203,"teacher_disagreement_score":0.5307956,"about_ca_system_score_codex":0.000022376284,"about_ca_system_score_gemma":0.000051691677,"threshold_uncertainty_score":0.5341449},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85229075,0.00035116155,0.08449681,0.003521,0.0008840345,0.00056704495,0.00018223154,0.000047179918,0.05765979],"genre_scores_gemma":[0.99853677,0.000023113034,0.0004159664,0.00005245723,0.000021388998,0.0000136207545,0.0000048991415,0.000008174453,0.00092359254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986476,0.0000145557015,0.0008118048,0.00030089956,0.000097087046,0.00012808359],"domain_scores_gemma":[0.99849623,0.000076200486,0.00069340185,0.00017992225,0.0005260436,0.000028214119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006997287,0.00010653783,0.00027264445,0.00005891653,0.00008784259,0.00004866086,0.00033320254,0.000060876308,0.00043151347],"category_scores_gemma":[0.0010380157,0.000100597346,0.0001078738,0.000422278,0.00019415148,0.00015717602,0.000059054386,0.000098397344,0.00005915351],"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.000030484714,0.00011841032,0.003958209,0.00008494323,0.000012808438,6.063323e-8,0.0005114279,0.00013178385,0.0070353015,0.9875377,0.00002470311,0.0005542093],"study_design_scores_gemma":[0.000027059345,0.00003894367,0.0016095937,0.00013915512,0.000004808675,0.000001586327,0.00037046167,0.023137245,0.12716585,0.8470461,0.00033791355,0.0001213043],"about_ca_topic_score_codex":0.000016031065,"about_ca_topic_score_gemma":0.000014483472,"teacher_disagreement_score":0.14624605,"about_ca_system_score_codex":0.000044716064,"about_ca_system_score_gemma":0.000053698393,"threshold_uncertainty_score":0.472477},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87829936,0.0000057920906,0.07255119,0.015128779,0.003539267,0.0015681103,0.00006889657,0.00054601656,0.028292608],"genre_scores_gemma":[0.9972544,0.00000306131,0.0010995662,0.00009438868,0.00017897035,0.000093390256,9.5081265e-7,0.000011364716,0.0012639308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980313,0.000012600436,0.0007326688,0.0004392383,0.000552978,0.00023121055],"domain_scores_gemma":[0.99710137,0.0004282446,0.0006144415,0.00030665591,0.0014638425,0.00008545938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014419894,0.00014995155,0.00019672757,0.00018181506,0.0006222599,0.0002514102,0.0010447475,0.00012120694,0.00036534062],"category_scores_gemma":[0.0031193632,0.00010495978,0.00016600499,0.0007996126,0.00037674405,0.00040617576,0.0000855855,0.00032604308,0.00026618075],"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.00006746905,0.000113516966,0.000032869528,0.000005387409,0.000007174359,1.9754017e-8,0.0003898674,0.00020181351,0.22105457,0.73391646,0.0011221534,0.043088708],"study_design_scores_gemma":[0.000016606275,0.000043497323,0.00037831115,0.000020826143,0.000010599845,0.0000047231406,0.0012928372,0.05153475,0.39278704,0.5524835,0.0013258095,0.000101526006],"about_ca_topic_score_codex":0.000017325448,"about_ca_topic_score_gemma":0.000028101655,"teacher_disagreement_score":0.18143296,"about_ca_system_score_codex":0.00001903554,"about_ca_system_score_gemma":0.000067071676,"threshold_uncertainty_score":0.47859833},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060702707,0.000018058085,0.9882203,0.0023464987,0.00048090503,0.00053468504,0.0000040357727,0.00018177002,0.0021434838],"genre_scores_gemma":[0.9669596,0.00007698834,0.032171108,0.0001947182,0.000047442656,0.00005281055,0.000012496213,0.000017749673,0.00046707652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99745965,0.000028723636,0.00074776117,0.0005498042,0.0006409391,0.0005730993],"domain_scores_gemma":[0.99721503,0.00035369574,0.00055661943,0.0003901932,0.0013615978,0.00012284503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004417754,0.0002667707,0.0003327017,0.00008325469,0.0004338198,0.0005647899,0.0017016034,0.000106322565,0.00010753934],"category_scores_gemma":[0.0025442878,0.00022482863,0.00021559293,0.0007464603,0.00014129808,0.00039648192,0.0005447251,0.00034956975,0.000033988854],"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.00005459266,0.00007596238,0.00025092677,0.00006753147,0.00004460881,5.188746e-7,0.0007218686,0.055493444,0.01185003,0.9256324,0.0001665229,0.0056415778],"study_design_scores_gemma":[0.00008339699,0.00020363118,0.00006518222,0.00013376033,0.000021801296,0.000003331666,0.0002993447,0.6149811,0.33021727,0.051248576,0.0025119088,0.00023069732],"about_ca_topic_score_codex":0.000021069003,"about_ca_topic_score_gemma":0.0000026841765,"teacher_disagreement_score":0.96088934,"about_ca_system_score_codex":0.00012766548,"about_ca_system_score_gemma":0.00026695346,"threshold_uncertainty_score":0.9168246},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37917313,0.000014006968,0.6039934,0.0018611582,0.0009806869,0.00050735887,0.0000029588919,0.00022659202,0.013240653],"genre_scores_gemma":[0.9846784,0.000014681268,0.0147765055,0.0003677846,0.00010910249,0.000017128083,6.138098e-7,0.000012462737,0.000023363717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9975267,0.000044636734,0.0008788415,0.00042454494,0.00065673894,0.00046851728],"domain_scores_gemma":[0.9976628,0.00019318494,0.0006676159,0.00044033225,0.0009246652,0.000111439535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000951126,0.00029180894,0.00030900314,0.00026388862,0.00038581554,0.0006333635,0.002238525,0.00013214022,0.000059690476],"category_scores_gemma":[0.0008539945,0.00023220066,0.00017448803,0.0008032338,0.00030384256,0.0022087707,0.00049452845,0.00033513826,0.000201473],"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.00002694909,0.000058381476,0.00022427314,0.000033583245,0.000010594617,9.64569e-8,0.0016057703,0.00080564583,0.067797415,0.7776586,0.00007316985,0.15170553],"study_design_scores_gemma":[0.000009964339,0.000117115276,0.00008736813,0.00015475418,0.000008633204,0.000006171011,0.00033599252,0.40509665,0.47777185,0.11612077,0.00010623878,0.00018450976],"about_ca_topic_score_codex":0.00009535409,"about_ca_topic_score_gemma":0.000007842199,"teacher_disagreement_score":0.6615378,"about_ca_system_score_codex":0.000101356534,"about_ca_system_score_gemma":0.00009749853,"threshold_uncertainty_score":0.9468868},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10938936,0.000018348774,0.8859873,0.0026008398,0.0005096435,0.0004395774,0.0000025258846,0.00013917725,0.00091327727],"genre_scores_gemma":[0.98796505,0.000017596612,0.011302472,0.00024332682,0.00010320899,0.00004005996,0.0000018838567,0.00001624224,0.000310143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803483,0.000030460922,0.000559992,0.0005784871,0.00042681527,0.00036939108],"domain_scores_gemma":[0.9983399,0.00020710927,0.00047512254,0.00025574514,0.0006369023,0.000085257816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005614642,0.00021840564,0.00026949964,0.00009136981,0.000284094,0.00026256716,0.0014340157,0.00011201527,0.000021602758],"category_scores_gemma":[0.0010699162,0.00017677642,0.00011909868,0.00031121747,0.00014375437,0.00047678064,0.00024244259,0.00025094498,0.00001889095],"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.000030849267,0.000053078867,0.00007590173,0.000030076382,0.00000620946,3.0694235e-8,0.0018365241,0.0009213514,0.0795225,0.8484528,0.0004730917,0.06859759],"study_design_scores_gemma":[0.000033754313,0.00019776399,0.000006458608,0.000106109714,0.000006110435,8.5108564e-7,0.00035797912,0.6066028,0.32152736,0.07048044,0.0005339869,0.00014641718],"about_ca_topic_score_codex":0.000027276481,"about_ca_topic_score_gemma":0.0000012434132,"teacher_disagreement_score":0.87857574,"about_ca_system_score_codex":0.000043922595,"about_ca_system_score_gemma":0.000056698478,"threshold_uncertainty_score":0.7208733},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56044734,0.000074861484,0.32236436,0.03812897,0.0008746421,0.0014641734,0.000025371044,0.00008830362,0.076532006],"genre_scores_gemma":[0.99869263,0.000023657778,0.0010887055,0.00009112404,0.000062760344,0.0000143583,9.539351e-8,0.0000054400934,0.000021223708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987975,0.000043224474,0.00035901877,0.0002555108,0.0003690287,0.00017575717],"domain_scores_gemma":[0.99831504,0.00047400958,0.00040296908,0.00029510196,0.00048014836,0.000032725744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050765084,0.00013567948,0.0002298438,0.00005760159,0.00011508251,0.0000438901,0.0013620354,0.000030653315,0.000029612438],"category_scores_gemma":[0.00049429416,0.00007823442,0.00012895769,0.000298808,0.0002865085,0.00015538836,0.00021116834,0.00012874245,0.000012827239],"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.000013964584,0.00011544129,0.000013327684,0.0000140482525,0.0000139469275,1.2053937e-8,0.0015445558,0.00026909055,0.04173192,0.90744364,0.00007313907,0.048766937],"study_design_scores_gemma":[0.000013581955,0.0002901874,0.0001610405,0.00008857259,0.0000084385965,1.6942369e-7,0.00052238896,0.090334855,0.6349689,0.27352062,0.000024450856,0.000066820896],"about_ca_topic_score_codex":0.000026998327,"about_ca_topic_score_gemma":0.0000091822285,"teacher_disagreement_score":0.633923,"about_ca_system_score_codex":0.000009553716,"about_ca_system_score_gemma":0.00003343612,"threshold_uncertainty_score":0.3190307},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69651,0.000032414227,0.2604063,0.02821842,0.00080238236,0.00056355254,0.00001811583,0.00016980991,0.013279021],"genre_scores_gemma":[0.997414,0.000026170523,0.0019618834,0.00036901195,0.00004168897,0.000016491642,0.0000013438138,0.0000055449527,0.00016387859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99853176,0.00003910876,0.0004252938,0.00039498662,0.0004056623,0.00020321245],"domain_scores_gemma":[0.9986279,0.00013022333,0.00023728992,0.0003040769,0.0006434586,0.000057048903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047728492,0.00013890772,0.00014603618,0.00004076856,0.00039404305,0.00021096364,0.00066454744,0.000061353,0.00035957052],"category_scores_gemma":[0.0004318535,0.00009419542,0.00011150876,0.000595856,0.00025464257,0.0003548908,0.00021543486,0.00021797256,0.000036861016],"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.0000572778,0.00022316254,0.001182795,0.000036635316,0.000020609521,9.002125e-7,0.004085722,0.0007577728,0.076544456,0.61089903,0.00015508776,0.30603653],"study_design_scores_gemma":[0.00006404535,0.000083229075,0.00070925377,0.00008836992,0.000015087254,0.000019954488,0.00083453575,0.2552325,0.69877136,0.043923147,0.00011202356,0.00014648285],"about_ca_topic_score_codex":0.000021721651,"about_ca_topic_score_gemma":0.00006360988,"teacher_disagreement_score":0.6222269,"about_ca_system_score_codex":0.000067420006,"about_ca_system_score_gemma":0.00012523406,"threshold_uncertainty_score":0.3937045},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8847578,0.0000097222055,8.915305e-7,0.00095041434,0.00057161454,0.000510361,0.0000072121393,0.000053983396,0.11313798],"genre_scores_gemma":[0.9988967,0.000018530916,0.00020343192,0.000065084976,0.00015489916,0.000106200125,7.1680375e-7,0.000017337106,0.00053708546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99808437,0.000015074817,0.00062975555,0.00039035632,0.0003818288,0.000498595],"domain_scores_gemma":[0.9990107,0.00006276008,0.00035944965,0.00017222445,0.0002859177,0.00010895217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082021614,0.00020753844,0.00028141955,0.00014562969,0.00047557428,0.00019424414,0.0010885859,0.00015463478,0.0003614884],"category_scores_gemma":[0.00031831162,0.00018394372,0.00011673466,0.00036386444,0.001149,0.0005343843,0.0003275062,0.0005555942,0.000051233757],"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.00002770267,0.00022480056,0.0912633,0.00000958559,0.000004866856,5.0782427e-7,0.012253629,0.0000010668552,0.35043764,0.5391585,0.00003780135,0.0065805754],"study_design_scores_gemma":[0.000061817234,0.00022242227,0.011369348,0.000114472154,0.000029420718,0.0000016776368,0.02469712,0.00022588504,0.8679291,0.09477656,0.00014807862,0.0004240765],"about_ca_topic_score_codex":0.0022517464,"about_ca_topic_score_gemma":0.005473426,"teacher_disagreement_score":0.51749146,"about_ca_system_score_codex":0.00011062523,"about_ca_system_score_gemma":0.00010672202,"threshold_uncertainty_score":0.75010073},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6277146,0.0002977062,0.060490973,0.006061125,0.002768207,0.0014340838,0.000009962097,0.0006796662,0.3005437],"genre_scores_gemma":[0.99459344,0.000025565765,0.004196766,0.00020440378,0.00015007716,0.000035509758,4.666803e-7,0.000014923809,0.00077886734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973904,0.00004461736,0.0005865329,0.00069935806,0.00074511586,0.00053396315],"domain_scores_gemma":[0.99760246,0.00009229542,0.00044678478,0.00045951593,0.001146614,0.00025233277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010836254,0.00033447228,0.0004065301,0.0001471622,0.00021714889,0.00047194856,0.0031154256,0.00014716615,0.000041782718],"category_scores_gemma":[0.0008426568,0.00022741802,0.00014884952,0.000774527,0.0003571588,0.00072326366,0.00070939166,0.0004321951,0.00027317437],"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.000083072286,0.00017794542,0.0029656177,0.000037012698,0.000026179945,9.186867e-7,0.007172117,0.00003293122,0.005473911,0.94702196,0.001046891,0.035961438],"study_design_scores_gemma":[0.00014837553,0.00069259945,0.0007385162,0.0004559828,0.000038361755,0.000025552386,0.0033993865,0.07922384,0.42565292,0.4865638,0.0022649325,0.00079571403],"about_ca_topic_score_codex":0.000104933955,"about_ca_topic_score_gemma":0.000046101286,"teacher_disagreement_score":0.46045816,"about_ca_system_score_codex":0.00008175712,"about_ca_system_score_gemma":0.00035015025,"threshold_uncertainty_score":0.9273837},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22735582,0.00010255334,0.6285674,0.05691194,0.0019569197,0.0035560788,0.000014261207,0.00078820385,0.080746844],"genre_scores_gemma":[0.9873146,0.00004686079,0.0089960825,0.0013590512,0.000071350136,0.00015934205,4.4866653e-7,0.000027985947,0.0020242843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99628824,0.000031855117,0.0009695924,0.0008780856,0.0010124999,0.0008197518],"domain_scores_gemma":[0.9968468,0.00011260444,0.00052189647,0.00076875737,0.0015052111,0.00024471554],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005697196,0.00042472026,0.0004063131,0.00023485396,0.0003881241,0.00080189743,0.0045321938,0.00018060466,0.0003680483],"category_scores_gemma":[0.00038733505,0.00032446248,0.0002164308,0.0010469571,0.00043270626,0.0020845614,0.0009136864,0.0005569761,0.0020596774],"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.000015736634,0.00023151604,0.00012719756,0.000025237478,0.00001855496,4.792075e-7,0.0010422107,0.0013428801,0.0762662,0.880408,0.0044952934,0.036026698],"study_design_scores_gemma":[0.000009960877,0.00008427611,0.000036358426,0.00006955159,0.000005124488,0.000002005455,0.00024448516,0.37169522,0.312713,0.31485772,0.00008312617,0.00019915217],"about_ca_topic_score_codex":0.00031904058,"about_ca_topic_score_gemma":0.000022228787,"teacher_disagreement_score":0.7599588,"about_ca_system_score_codex":0.00011603067,"about_ca_system_score_gemma":0.00018238268,"threshold_uncertainty_score":0.9999207},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8428326,0.00013224951,0.09104174,0.00061719696,0.0014330866,0.0009293151,0.0000059129934,0.00040200207,0.06260586],"genre_scores_gemma":[0.9890026,0.000032604858,0.010665024,0.000050713377,0.000038565413,0.0000113736605,1.8271427e-7,0.000014505498,0.00018445471],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99817437,0.00002533684,0.0005963441,0.0004871307,0.00035321785,0.00036363018],"domain_scores_gemma":[0.99810183,0.000118322176,0.00062024564,0.00031206658,0.000756362,0.00009116604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030854254,0.00024727307,0.00032839607,0.000168415,0.00016357777,0.000057702477,0.0023412576,0.000097669166,0.00007885647],"category_scores_gemma":[0.0004117554,0.0001850229,0.00015853246,0.0009975332,0.00040638976,0.00051525235,0.00054547825,0.00042766205,0.00002317752],"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.00006335795,0.00010813981,0.0008752369,0.000043119075,0.000015270205,4.408329e-7,0.004130788,0.00010020283,0.04865031,0.8481479,0.000050301227,0.0978149],"study_design_scores_gemma":[0.00002223591,0.00031106695,0.00059147645,0.00020062651,0.00001020274,0.0000043383234,0.00042765154,0.032776866,0.7511393,0.21426396,0.000056404213,0.00019585645],"about_ca_topic_score_codex":0.000021875036,"about_ca_topic_score_gemma":0.0000074837317,"teacher_disagreement_score":0.702489,"about_ca_system_score_codex":0.000022323617,"about_ca_system_score_gemma":0.000058688816,"threshold_uncertainty_score":0.75450146},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9714627,0.000010682821,0.016278682,0.0012979441,0.000035454985,0.0003692522,0.000008358794,0.000079623744,0.010457263],"genre_scores_gemma":[0.9990054,0.0000036235112,0.0005237572,0.00006407355,0.00013396435,0.000040397306,0.000008174143,0.000020344065,0.00020028235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983012,0.000031112162,0.0004978028,0.0004294216,0.00037395625,0.00036648606],"domain_scores_gemma":[0.9984795,0.000089725596,0.00025068628,0.00015363548,0.0009699206,0.000056525932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025224654,0.00022625695,0.00033973492,0.0000898158,0.0002371592,0.00014219718,0.00050691067,0.00007692857,0.0005878504],"category_scores_gemma":[0.000083696235,0.00017871207,0.00009801483,0.0010646052,0.00032663645,0.00023345322,0.00018665486,0.0003603315,0.00003279754],"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.00084741,0.0018475987,0.02162494,0.000103832026,0.00015116532,0.0000036523022,0.0028713674,0.01923228,0.090103716,0.79560506,0.00058131287,0.067027636],"study_design_scores_gemma":[0.000086109074,0.00017189077,0.0011316774,0.0005459802,0.000090627495,0.000002500459,0.0010167696,0.59992176,0.22875182,0.16774467,0.000026656538,0.0005095406],"about_ca_topic_score_codex":0.000036153222,"about_ca_topic_score_gemma":0.0000096538915,"teacher_disagreement_score":0.6278604,"about_ca_system_score_codex":0.000035486366,"about_ca_system_score_gemma":0.00010603166,"threshold_uncertainty_score":0.7287667},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83271617,0.00018579792,0.13976218,0.0052337185,0.0006017349,0.0003316394,0.00001970792,0.00014629208,0.021002758],"genre_scores_gemma":[0.99494475,0.00009476577,0.0045699766,0.000080012505,0.000028729859,0.000008122485,5.181478e-7,0.0000057920693,0.00026733906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99874717,0.0000150666365,0.00039537853,0.0003326757,0.0002927199,0.00021698076],"domain_scores_gemma":[0.99868345,0.000097801145,0.0002881462,0.00022906618,0.0006375285,0.000063991116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033375176,0.00013890404,0.00019385741,0.000074020536,0.00019739896,0.00013624298,0.0007905354,0.00006401098,0.00002836169],"category_scores_gemma":[0.00022999216,0.000110136185,0.000056168217,0.0005566227,0.00019475797,0.0003917191,0.00032114392,0.00023217738,0.000011238453],"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.000050401643,0.00016596944,0.004214091,0.00023726122,0.000038366736,0.0000012960766,0.004493363,0.00188805,0.07431208,0.78822726,0.0002569055,0.12611495],"study_design_scores_gemma":[0.000023757251,0.00015719888,0.001227441,0.00046017117,0.000012299051,0.000014228008,0.00043236653,0.2984279,0.6803743,0.018651135,0.00007512943,0.0001440471],"about_ca_topic_score_codex":0.000013916301,"about_ca_topic_score_gemma":0.00000363042,"teacher_disagreement_score":0.76957613,"about_ca_system_score_codex":0.000013741212,"about_ca_system_score_gemma":0.00013799673,"threshold_uncertainty_score":0.4491223},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87305015,0.00028007745,0.11351847,0.0004768325,0.0015325517,0.0021258038,0.00001890386,0.00030400578,0.008693195],"genre_scores_gemma":[0.9989948,0.00008065995,0.00054762536,0.000023255076,0.00011242835,0.00018067629,0.0000015824714,0.00002203678,0.000036890127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880195,0.000013933328,0.0005662559,0.00014764673,0.00017556045,0.00029463216],"domain_scores_gemma":[0.9993801,0.00011402353,0.00012728329,0.00008849071,0.00023189632,0.000058218393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008253697,0.00016688029,0.00035178225,0.0001318078,0.00007505216,0.00007800521,0.00026220203,0.000107250926,0.00001794085],"category_scores_gemma":[0.00031688233,0.00013208935,0.00013156008,0.00028846637,0.00009091249,0.00026693655,0.000015476646,0.00020491148,0.000015155973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00219484,0.00010412158,0.00038416494,0.00031806275,0.000041618594,3.7256502e-8,0.0033806202,0.032803927,0.028977172,0.92286694,0.000023383538,0.0089051295],"study_design_scores_gemma":[0.0010967605,0.00003151694,0.000073983014,0.0002735893,0.000031600994,0.000001542358,0.0027598501,0.92221767,0.06268561,0.010580612,0.000045502995,0.0002017897],"about_ca_topic_score_codex":0.000020496982,"about_ca_topic_score_gemma":0.00001220568,"teacher_disagreement_score":0.9122863,"about_ca_system_score_codex":0.00008351348,"about_ca_system_score_gemma":0.000018685787,"threshold_uncertainty_score":0.53864473},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07475843,0.00043340286,0.491784,0.16496454,0.0067838244,0.005478132,0.00004529375,0.0019618315,0.25379053],"genre_scores_gemma":[0.9912985,0.000023581682,0.0073360708,0.00043011695,0.000098807206,0.000052828007,8.8132276e-7,0.000012531809,0.00074666017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998103,0.000056533045,0.00046323522,0.00054343685,0.00051069475,0.0003230623],"domain_scores_gemma":[0.99755734,0.000086453125,0.0008831125,0.00035627207,0.00097411906,0.00014268699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085898675,0.00023457444,0.00029892428,0.00017981943,0.00014973803,0.00041876687,0.0018765334,0.00011984558,0.000021001151],"category_scores_gemma":[0.0006335387,0.0001678416,0.00011488417,0.0008545589,0.000108573964,0.00062657666,0.00050382345,0.00035095133,0.000040565494],"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.000070082824,0.00020615791,0.0010730594,0.00003808822,0.000027910091,0.0000014066933,0.0023861644,0.000008298287,0.0027970967,0.8578516,0.042897448,0.09264264],"study_design_scores_gemma":[0.000113149814,0.00046164065,0.0019285853,0.00044349002,0.00001972069,0.000035238452,0.0033421493,0.015899384,0.58361137,0.38842583,0.0051269857,0.0005924564],"about_ca_topic_score_codex":0.00008676313,"about_ca_topic_score_gemma":0.000022466653,"teacher_disagreement_score":0.9165401,"about_ca_system_score_codex":0.00009263976,"about_ca_system_score_gemma":0.000091430426,"threshold_uncertainty_score":0.68443817},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39019898,0.000009019603,0.57037985,0.0022845322,0.00026032052,0.00042512408,0.00003395019,0.000050680606,0.03635755],"genre_scores_gemma":[0.9985347,0.0000097820985,0.0008849939,0.00008589523,0.000028193648,0.000017631359,0.0000021401602,0.0000063532348,0.0004303274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977493,0.00005270149,0.0008801401,0.00039906974,0.0007575142,0.00016125325],"domain_scores_gemma":[0.9968004,0.0005343242,0.000879951,0.00041657963,0.0013043387,0.00006438114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021253051,0.00013222023,0.00036195258,0.00042667586,0.00013553441,0.000109010114,0.0013647443,0.000072177994,0.0007707052],"category_scores_gemma":[0.003123518,0.00008738234,0.00022955443,0.0031214978,0.0006527266,0.00017817874,0.00013882726,0.00013168181,0.000092773014],"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.000046157755,0.00008308028,0.000449519,0.0000056644185,0.00003860914,8.9690255e-9,0.0006712151,0.02218525,0.00438536,0.9528931,0.000039506045,0.019202579],"study_design_scores_gemma":[0.000011215779,0.00005967719,0.00029341516,0.000024739269,0.0001238809,4.2389456e-7,0.0008432203,0.32405123,0.13971788,0.53469473,0.00009215655,0.000087416425],"about_ca_topic_score_codex":0.000017712391,"about_ca_topic_score_gemma":0.000008266945,"teacher_disagreement_score":0.60833573,"about_ca_system_score_codex":0.000015528372,"about_ca_system_score_gemma":0.00003467435,"threshold_uncertainty_score":0.8438682},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26791918,0.000016324419,0.7095089,0.007627071,0.0005497476,0.000681957,0.0000021577553,0.00023577036,0.013458887],"genre_scores_gemma":[0.991051,0.000025401756,0.008538764,0.00019699948,0.00004441184,0.000057462094,4.973944e-7,0.0000139759295,0.000071485876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756527,0.000038061582,0.0007332715,0.00066371955,0.0005381973,0.0004614572],"domain_scores_gemma":[0.9978879,0.0002630998,0.0003654486,0.00042784755,0.0009532709,0.00010243888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008726792,0.0002899466,0.00032621485,0.00023617444,0.00018801447,0.00030932634,0.0021881768,0.00014100842,0.000032252054],"category_scores_gemma":[0.0022580056,0.00023331745,0.00007706443,0.0013901911,0.00022491471,0.00055532175,0.00042353352,0.00044285887,0.00007141852],"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.000022825649,0.00014494159,0.0006006747,0.00006803188,0.00000436776,2.4288704e-7,0.0010936827,0.0018662681,0.003509712,0.9056023,0.000015752115,0.087071195],"study_design_scores_gemma":[0.000037536694,0.00016466394,0.0013661374,0.0004002555,0.0000052596224,0.0000020159914,0.0000932866,0.64763033,0.020989845,0.3290254,0.000033980778,0.0002513244],"about_ca_topic_score_codex":0.00010779901,"about_ca_topic_score_gemma":0.00010997237,"teacher_disagreement_score":0.72313184,"about_ca_system_score_codex":0.00007156748,"about_ca_system_score_gemma":0.00012794328,"threshold_uncertainty_score":0.95144093},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21620367,0.000043107782,0.7660628,0.014871764,0.00016804843,0.00069293706,0.00000168347,0.00029338498,0.0016626053],"genre_scores_gemma":[0.9613805,0.000018378123,0.03794839,0.00037610024,0.000022278733,0.00004244329,4.2653903e-7,0.000010807971,0.00020070547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983044,0.000019434665,0.0003559127,0.00048152357,0.00048601808,0.00035265845],"domain_scores_gemma":[0.9987771,0.00009279395,0.00024329816,0.00022746868,0.0005751884,0.00008413931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031469102,0.00022050831,0.0002560067,0.00020378445,0.00014268696,0.00024336543,0.0013737784,0.00012797465,0.000031240976],"category_scores_gemma":[0.00040635522,0.00015821094,0.00010044672,0.0008943559,0.00024265626,0.0007151902,0.00030381128,0.00064006157,0.000035945515],"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.000050966064,0.00018010895,0.00097118237,0.000032300133,0.0000059374024,0.0000010528737,0.00026972822,0.0036277366,0.07235254,0.8323281,0.000333191,0.08984719],"study_design_scores_gemma":[0.000019818284,0.000115314746,0.00038172211,0.00013321685,0.0000020576383,9.981857e-7,0.000029199178,0.37572414,0.3679257,0.25550902,0.00002085019,0.0001379546],"about_ca_topic_score_codex":0.000053321757,"about_ca_topic_score_gemma":0.0000046465484,"teacher_disagreement_score":0.7451768,"about_ca_system_score_codex":0.000037799386,"about_ca_system_score_gemma":0.00009327727,"threshold_uncertainty_score":0.6451655},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042141806,0.00001464124,0.9850734,0.0043442403,0.00038387964,0.00029509078,0.0000019540648,0.00018293064,0.005489675],"genre_scores_gemma":[0.962433,0.0000022557072,0.03619654,0.0011643093,0.00007644865,0.000027740585,0.0000017531635,0.0000150441365,0.00008290401],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808395,0.00004080535,0.0005027755,0.00049973605,0.0004802752,0.00039245322],"domain_scores_gemma":[0.9983327,0.00022669414,0.0004142628,0.00033924566,0.00057814573,0.000108943575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008914414,0.00024270819,0.00025348883,0.00016888932,0.00032449712,0.00034274612,0.0017146545,0.00012133888,0.000042956442],"category_scores_gemma":[0.00044955465,0.00019391517,0.00010220813,0.00061963004,0.00015769141,0.00045248604,0.00019338146,0.00038716747,0.000052231764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009927145,0.00015497244,0.0015903113,0.000096631775,0.000018064027,8.634905e-7,0.0016786173,0.34191597,0.008747065,0.53439105,0.00067524664,0.11063192],"study_design_scores_gemma":[0.000029860566,0.00015460332,0.000047031586,0.00032809685,0.000007651512,0.0000022109368,0.000056654193,0.8299364,0.14169377,0.02736538,0.0001728201,0.00020556487],"about_ca_topic_score_codex":0.00003731867,"about_ca_topic_score_gemma":0.0000018293862,"teacher_disagreement_score":0.9582188,"about_ca_system_score_codex":0.000042706004,"about_ca_system_score_gemma":0.00011633699,"threshold_uncertainty_score":0.79076314},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027729247,0.0000047696044,0.98452187,0.006858664,0.00064101483,0.00057111576,0.000007591788,0.000091359216,0.0045306925],"genre_scores_gemma":[0.9789952,0.000012140558,0.020191617,0.00032766358,0.00014379859,0.00005668711,6.416071e-7,0.000009931203,0.00026231256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869835,0.000016499878,0.00038111326,0.00036043033,0.00029191948,0.0002516999],"domain_scores_gemma":[0.9984333,0.00038512805,0.00028548998,0.0002548391,0.00058087544,0.000060376973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059885957,0.00017314736,0.00018266636,0.00006496356,0.0003265853,0.00021987165,0.0011670219,0.00006220959,0.000078543395],"category_scores_gemma":[0.00063442823,0.00010883568,0.0001294151,0.00032813742,0.0003442074,0.00027884895,0.00020499261,0.00018353053,0.000050642757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025296404,0.000035025685,0.00003908508,0.000012881035,0.000017113394,3.616078e-8,0.00061883254,0.0007447391,0.010161159,0.6512861,0.00011838788,0.33694133],"study_design_scores_gemma":[0.000036631263,0.000127991,0.0001597754,0.00006921727,0.000012589627,0.000004100395,0.00024953828,0.82437134,0.125152,0.049210858,0.00045671203,0.0001492196],"about_ca_topic_score_codex":0.000010742025,"about_ca_topic_score_gemma":0.0000038129808,"teacher_disagreement_score":0.9762223,"about_ca_system_score_codex":0.000030618412,"about_ca_system_score_gemma":0.00006408624,"threshold_uncertainty_score":0.44381902},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009427655,0.0000123950085,0.9781022,0.007517604,0.00093647285,0.00036047577,0.0000055391006,0.000045992307,0.0035916686],"genre_scores_gemma":[0.92373276,0.000011987575,0.07561787,0.00018879262,0.00029389342,0.00002847463,2.7477245e-7,0.000009928401,0.00011602166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984725,0.000014591904,0.0003952846,0.00045721565,0.0003481465,0.0003122274],"domain_scores_gemma":[0.99794906,0.00021587686,0.00057727384,0.00044556835,0.0007447237,0.00006747194],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006398885,0.00018692444,0.00022650391,0.00006876798,0.0011684143,0.0011388717,0.002522137,0.000101323756,0.000029660183],"category_scores_gemma":[0.0020379722,0.0001449406,0.00014480912,0.00014400328,0.0002145857,0.0009336298,0.00044961637,0.00020131918,0.000018729594],"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.000030508596,0.00004687389,0.000099039054,0.000017913993,0.000014673392,1.4373823e-7,0.0005956834,0.00036869737,0.04318574,0.9098545,0.000121574914,0.04566469],"study_design_scores_gemma":[0.000018820225,0.00007788167,0.0005471616,0.000229043,0.000010699838,0.0000011586126,0.00007238362,0.32885462,0.27812862,0.39175564,0.00014889397,0.00015505224],"about_ca_topic_score_codex":0.000026730271,"about_ca_topic_score_gemma":0.000003848509,"teacher_disagreement_score":0.9143051,"about_ca_system_score_codex":0.000039946677,"about_ca_system_score_gemma":0.00008584064,"threshold_uncertainty_score":0.999898},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39231628,0.0000076168717,0.60480624,0.0009802356,0.0000968939,0.0004454754,0.000002396995,0.000060526538,0.001284369],"genre_scores_gemma":[0.97099584,0.0000064346973,0.028781215,0.00010845658,0.000054413165,0.000013436008,4.0251345e-7,0.000017509761,0.000022283039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99776727,0.00010841549,0.00050576293,0.00059950835,0.0006311424,0.00038791462],"domain_scores_gemma":[0.997914,0.00016845463,0.00053875975,0.00044167144,0.0008140736,0.0001230042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093187497,0.00028186865,0.00036799398,0.00012967753,0.0003151976,0.00022212083,0.0024364062,0.00013377285,0.000009836601],"category_scores_gemma":[0.0004168141,0.0001526416,0.000090254616,0.00085024425,0.0005326847,0.00059670035,0.00020502969,0.0006572201,0.0000011894482],"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.000071902505,0.000072166345,0.00006664302,0.000086304,0.000013583178,2.705888e-7,0.0055993805,0.0012844416,0.012167935,0.9191057,0.0000020195503,0.061529666],"study_design_scores_gemma":[0.000023891318,0.0004628985,0.0000582296,0.00016327552,0.000014540001,0.00001255797,0.00035682064,0.29166618,0.118318014,0.5887738,0.0000022053177,0.00014756959],"about_ca_topic_score_codex":0.000038099723,"about_ca_topic_score_gemma":0.000033103115,"teacher_disagreement_score":0.57867956,"about_ca_system_score_codex":0.00001930057,"about_ca_system_score_gemma":0.00012317902,"threshold_uncertainty_score":0.6224544},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31413347,0.00002437123,0.67261297,0.0016943064,0.0006118339,0.0011599042,0.000008459253,0.0001708724,0.009583799],"genre_scores_gemma":[0.99380964,0.0000061037963,0.005650357,0.00020666959,0.00010293922,0.000062332816,0.0000018959266,0.000013159679,0.00014687734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984142,0.00003769994,0.00039770728,0.0004964905,0.00028427737,0.00036959935],"domain_scores_gemma":[0.99843025,0.00028212238,0.00032691882,0.00023236765,0.0006366389,0.00009170775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000716669,0.00021121505,0.00028460915,0.00013834421,0.00016039457,0.00021699729,0.0012073572,0.000115767834,0.000009897987],"category_scores_gemma":[0.0010154455,0.00016349596,0.00010332393,0.0004140841,0.00019175264,0.0003914956,0.00013175115,0.00022445631,0.000024310766],"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.00012866993,0.00037733378,0.0005797289,0.00006102077,0.00000841509,3.6728767e-7,0.0029558649,0.00021911602,0.019879602,0.84955025,0.000026284317,0.12621337],"study_design_scores_gemma":[0.00015678896,0.00080459553,0.0005467883,0.00029808513,0.000018152725,0.0000021663434,0.0012062564,0.3764507,0.49115494,0.12901984,0.00004996411,0.00029172588],"about_ca_topic_score_codex":0.00005105852,"about_ca_topic_score_gemma":0.00016709662,"teacher_disagreement_score":0.7205304,"about_ca_system_score_codex":0.00004832061,"about_ca_system_score_gemma":0.00009756611,"threshold_uncertainty_score":0.6667172},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56566197,0.00015996584,0.2257502,0.0615853,0.0035019973,0.0011276709,0.0000029813727,0.00021438467,0.14199555],"genre_scores_gemma":[0.9919059,0.000035757952,0.0069181537,0.00013622615,0.000088658744,0.000005046713,4.434677e-7,0.000006697605,0.00090308615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99843365,0.000025816496,0.0004627004,0.00035234352,0.0005028018,0.00022268335],"domain_scores_gemma":[0.99810404,0.00006723432,0.00028991405,0.00022929165,0.0012062816,0.00010324818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039988817,0.0001322906,0.0002272453,0.00010390685,0.00009983966,0.00013359747,0.0010667858,0.00006381539,0.00025510247],"category_scores_gemma":[0.00051002536,0.00010343926,0.00007851636,0.0009051404,0.00024946782,0.00035219788,0.0002868716,0.00028682692,0.00004525391],"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.000018533057,0.000092107766,0.00066685246,0.000047947982,0.000011753766,2.978339e-7,0.0035692658,0.000048029953,0.07315379,0.77034014,0.00016620652,0.15188509],"study_design_scores_gemma":[0.00002677091,0.00011842892,0.0003231079,0.00020395698,0.000008352077,0.000018440353,0.0048690583,0.01816811,0.8846505,0.091298245,0.00020110254,0.00011388688],"about_ca_topic_score_codex":0.0000555017,"about_ca_topic_score_gemma":0.0000068524555,"teacher_disagreement_score":0.81149673,"about_ca_system_score_codex":0.000027351678,"about_ca_system_score_gemma":0.0004570173,"threshold_uncertainty_score":0.42181307},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14820601,0.000041193904,0.75940925,0.008355288,0.001832318,0.000940294,0.0000047915287,0.000588783,0.08062205],"genre_scores_gemma":[0.9910804,0.0000200574,0.00795215,0.0005947776,0.000108092885,0.00001811672,2.6004182e-7,0.000014878622,0.00021123474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978915,0.000025653117,0.00052032026,0.0005769916,0.0005312271,0.0004542972],"domain_scores_gemma":[0.9983685,0.0002026467,0.0004203591,0.0004367582,0.00045019962,0.000121514895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005129433,0.00025538853,0.0003059461,0.00012639214,0.0002469899,0.00023239758,0.0027436055,0.00009841369,0.000043023218],"category_scores_gemma":[0.00042577993,0.0001910258,0.0001413729,0.00072549924,0.00034617053,0.0005575657,0.0003827306,0.0003973932,0.0001393726],"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.00001843418,0.000043469863,0.00016198852,0.00001528506,0.0000064606475,2.141969e-7,0.00029374444,0.00026506258,0.020036997,0.9060219,0.00025276947,0.07288365],"study_design_scores_gemma":[0.000022938686,0.00015231923,0.00010232039,0.0001276262,0.0000052403802,0.0000052826786,0.00009147384,0.2607835,0.39851537,0.33934793,0.0006198311,0.0002261351],"about_ca_topic_score_codex":0.0000071510435,"about_ca_topic_score_gemma":0.000002062635,"teacher_disagreement_score":0.8428744,"about_ca_system_score_codex":0.000029679997,"about_ca_system_score_gemma":0.000036085992,"threshold_uncertainty_score":0.7789806},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054990172,0.000008686137,0.94126886,0.00068945653,0.00061159674,0.0004894096,0.0000015617344,0.000058908245,0.0018813659],"genre_scores_gemma":[0.96945256,0.000005864407,0.030074185,0.00008011826,0.000077339166,0.000012830501,0.0000010120003,0.000011096095,0.00028498514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998232,0.000017284654,0.00050769903,0.0003694469,0.0006191741,0.00025438762],"domain_scores_gemma":[0.99779093,0.00018423669,0.0005254794,0.0002862069,0.0011380317,0.0000751349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071478885,0.0001562833,0.00019927837,0.00020806218,0.00014893265,0.00047549338,0.0012300739,0.00007364412,0.0000031650552],"category_scores_gemma":[0.0020714551,0.00012410196,0.00010397847,0.0011676466,0.00010873289,0.001216878,0.00029008507,0.00014839572,0.000013430606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058756497,0.000045321147,0.0007461628,0.000026558117,0.000013960477,1.010846e-7,0.0010304861,0.23822124,0.011000048,0.7377622,0.00010029416,0.010994882],"study_design_scores_gemma":[0.000034605062,0.0001348189,0.000051727046,0.000055605255,0.000011996512,0.0000010788527,0.00032147107,0.7565469,0.17852639,0.064154975,0.00004332218,0.00011712018],"about_ca_topic_score_codex":0.00003318259,"about_ca_topic_score_gemma":0.0000011805158,"teacher_disagreement_score":0.9144624,"about_ca_system_score_codex":0.00010386655,"about_ca_system_score_gemma":0.00013395294,"threshold_uncertainty_score":0.5060731},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19088772,0.000039678398,0.8002309,0.0020843938,0.0010066158,0.0005882612,0.0000019005801,0.00014299268,0.005017528],"genre_scores_gemma":[0.99027807,0.000009849705,0.009355692,0.00014535694,0.00009300633,0.000024476136,2.743563e-7,0.000019011208,0.00007424545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970621,0.00004317966,0.0009188542,0.00066261843,0.0007926513,0.00052058726],"domain_scores_gemma":[0.99790096,0.00008587842,0.0005104299,0.00043339626,0.00090702204,0.00016233533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001162123,0.0002979068,0.000333003,0.0003042611,0.00014011162,0.0003534197,0.0024047457,0.00015055518,0.0000199262],"category_scores_gemma":[0.0007222349,0.00024507704,0.00011018904,0.0012921346,0.0003809798,0.0017232035,0.0006356497,0.00039378062,0.00011741332],"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.00006954346,0.00017332807,0.0004492437,0.000026682703,0.0000068116647,0.0000028046327,0.004128037,0.0047456273,0.027419237,0.7922452,0.000048425733,0.17068507],"study_design_scores_gemma":[0.0000160388,0.00011634981,0.00001896707,0.00011406905,0.0000044562544,0.0000053284234,0.0024931633,0.43792477,0.385402,0.17370096,0.00002056308,0.00018334023],"about_ca_topic_score_codex":0.00057901646,"about_ca_topic_score_gemma":0.00012814823,"teacher_disagreement_score":0.7993904,"about_ca_system_score_codex":0.00024760282,"about_ca_system_score_gemma":0.00030580146,"threshold_uncertainty_score":0.9993952},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13510786,0.00001735403,0.8613154,0.0009918244,0.00022181879,0.00036908197,0.0000072234657,0.000080148784,0.001889249],"genre_scores_gemma":[0.9782941,0.000004626314,0.021348044,0.00009754342,0.00007436714,0.00003765924,4.8210194e-7,0.0000147288865,0.00012848024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802023,0.00002251226,0.0007168451,0.00045570682,0.00037355543,0.00041113436],"domain_scores_gemma":[0.9972143,0.00041761505,0.0006819913,0.00039545057,0.0011971919,0.00009344914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010960437,0.00021943782,0.00037576226,0.00012673563,0.00034886965,0.00022933201,0.0013947072,0.00010163241,0.000004571111],"category_scores_gemma":[0.0025374491,0.00017609798,0.00020293832,0.00051166717,0.00026672287,0.00027363622,0.00025636042,0.00022996061,0.000006005112],"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.000027436025,0.00006516155,0.000028700339,0.00007262978,0.000012367953,4.8878462e-8,0.0010513838,0.009368852,0.12841149,0.804346,0.000047130707,0.05656877],"study_design_scores_gemma":[0.000027324912,0.000067916124,0.0000060921484,0.00036904844,0.000013282491,0.000001171665,0.00012003872,0.57402885,0.31283525,0.11240596,0.000014500128,0.00011056745],"about_ca_topic_score_codex":0.000024797993,"about_ca_topic_score_gemma":0.0000074945547,"teacher_disagreement_score":0.8431862,"about_ca_system_score_codex":0.000043330023,"about_ca_system_score_gemma":0.0001074639,"threshold_uncertainty_score":0.71810675},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8475081,0.00004127652,0.058643375,0.03363112,0.0020138086,0.0014647926,0.00010788956,0.00026816328,0.056321535],"genre_scores_gemma":[0.99608505,0.000009334422,0.0010257097,0.00030759635,0.00048025383,0.000017191636,0.0000010907027,0.00002185704,0.002051914],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994979,0.00007568267,0.0010556437,0.0007613453,0.0025647648,0.0005635642],"domain_scores_gemma":[0.99508756,0.0011505462,0.000679301,0.0004250294,0.0025046994,0.00015288577],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0024147257,0.00027181456,0.00046494033,0.0003088675,0.00047599536,0.00038926443,0.0034093063,0.00014905457,0.00063614483],"category_scores_gemma":[0.014648248,0.00017595282,0.00022835011,0.001674155,0.0008326069,0.0004484412,0.0005901471,0.00061029324,0.0005894009],"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.0001613487,0.00048773852,0.00080767676,0.000021178354,0.000020600477,3.6994376e-7,0.0010882328,0.00018281526,0.024741014,0.33311394,0.0026101638,0.63676494],"study_design_scores_gemma":[0.00007173569,0.00031116707,0.0041031353,0.00007921059,0.000013382071,0.0000032420103,0.0017749639,0.06441732,0.22131239,0.70002455,0.0075237993,0.00036512245],"about_ca_topic_score_codex":0.000043295495,"about_ca_topic_score_gemma":0.00005230113,"teacher_disagreement_score":0.6363998,"about_ca_system_score_codex":0.00006259482,"about_ca_system_score_gemma":0.000104998595,"threshold_uncertainty_score":0.9936518},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26923186,0.0003792295,0.66228575,0.0020971606,0.0016764858,0.0010762603,0.000008867323,0.0005240614,0.06272036],"genre_scores_gemma":[0.98874557,0.000009966427,0.010196248,0.00019280362,0.00012535282,0.0000396622,0.000001399498,0.000019355712,0.0006696656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997269,0.000041798972,0.00064300647,0.0007482834,0.0007045316,0.00059341296],"domain_scores_gemma":[0.99810755,0.0001172525,0.00046537645,0.00038561982,0.00063971145,0.00028445793],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00091573235,0.000348118,0.00040595556,0.00015730067,0.0002292758,0.00042401362,0.002488499,0.00015608157,0.000012850003],"category_scores_gemma":[0.000599406,0.00024759487,0.00015486145,0.0006445662,0.0003289673,0.0005146972,0.0007132264,0.00052428554,0.000104526676],"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.00014468734,0.0006337359,0.0042335866,0.0001018124,0.00004838038,0.000006135599,0.026717953,0.0018323315,0.0054990007,0.94394654,0.0020320315,0.014803814],"study_design_scores_gemma":[0.00016499902,0.00038279698,0.00067819067,0.0004948731,0.000023556315,0.000026600726,0.0042379615,0.84982693,0.049063455,0.093774535,0.00074652553,0.00057956716],"about_ca_topic_score_codex":0.00003248277,"about_ca_topic_score_gemma":0.0000020812884,"teacher_disagreement_score":0.850172,"about_ca_system_score_codex":0.00013682093,"about_ca_system_score_gemma":0.00022478832,"threshold_uncertainty_score":0.9999976},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19405131,0.00009116478,0.7822768,0.012409962,0.0009403665,0.0017322892,0.00001724578,0.00038890104,0.008091957],"genre_scores_gemma":[0.9882662,0.0000040844475,0.01060495,0.0004911166,0.000079440586,0.00012208874,0.0000012607356,0.000015568465,0.00041525168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980568,0.000019376244,0.00052228547,0.0005271527,0.00037983738,0.0004945423],"domain_scores_gemma":[0.99807817,0.00036378225,0.00037817084,0.0003090172,0.0007461284,0.00012473819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052940694,0.00025763002,0.00027486504,0.00012132788,0.0003508897,0.00044140033,0.0018328821,0.000105333354,0.000061641134],"category_scores_gemma":[0.00043396882,0.00019113765,0.00013936807,0.00044971332,0.00018118651,0.0004413629,0.0002600266,0.0002976329,0.00010345305],"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.00006595381,0.00013436501,0.00049095997,0.00013134956,0.000033940352,5.045226e-7,0.0035665121,0.015089697,0.012503884,0.89189196,0.0027636902,0.0733272],"study_design_scores_gemma":[0.000046654593,0.00028198806,0.00020477989,0.00047364132,0.000013783683,0.000004401166,0.0010522904,0.6080973,0.03979956,0.3495613,0.00014723113,0.00031701478],"about_ca_topic_score_codex":0.000111969784,"about_ca_topic_score_gemma":0.000003186645,"teacher_disagreement_score":0.7942149,"about_ca_system_score_codex":0.000049527007,"about_ca_system_score_gemma":0.00012413158,"threshold_uncertainty_score":0.7794367},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17191736,0.000009469807,0.81385267,0.0019346129,0.00018367491,0.00052992144,0.0000018063747,0.00011673673,0.011453729],"genre_scores_gemma":[0.9964547,0.00001900539,0.0032218033,0.00020015206,0.00003013399,0.000022131437,3.4277792e-7,0.000004972328,0.00004676602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99877685,0.000016854532,0.0003423315,0.00019612601,0.0004959091,0.00017193978],"domain_scores_gemma":[0.99861,0.000110152396,0.0005094138,0.00021793308,0.00051754684,0.00003493137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003702469,0.00015025417,0.00015897698,0.000092022696,0.00014002094,0.00014030044,0.001024858,0.000050360297,0.000010387562],"category_scores_gemma":[0.00024016816,0.0000824217,0.000051177147,0.00042018134,0.00021277415,0.0011582244,0.00013747525,0.0001951161,0.000022673741],"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.00016182182,0.00011441605,0.00008077643,0.000027535703,0.000009591715,6.167761e-8,0.0017554607,0.00004322701,0.054963514,0.62019736,0.00012954498,0.32251668],"study_design_scores_gemma":[0.000021263151,0.0006817021,0.00014524446,0.00011598613,0.000004853956,0.0000015700078,0.00055992824,0.010049472,0.96405417,0.023810312,0.00045224483,0.00010325605],"about_ca_topic_score_codex":0.000015248975,"about_ca_topic_score_gemma":0.0000015756747,"teacher_disagreement_score":0.90909064,"about_ca_system_score_codex":0.00002257773,"about_ca_system_score_gemma":0.00003671219,"threshold_uncertainty_score":0.33610594},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9166913,0.00006095015,0.0025198145,0.0008064175,0.00038374058,0.00028001337,0.000017362021,0.00005481432,0.0791856],"genre_scores_gemma":[0.99832696,0.0000091444435,0.000502458,0.000058092566,0.000053183314,0.000020457615,6.8359844e-7,0.00001769376,0.001011334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853635,0.000011123561,0.00062981696,0.00040003122,0.0001305568,0.00029215196],"domain_scores_gemma":[0.9987459,0.000047394085,0.000654475,0.0001959144,0.00025478625,0.000101487574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010662619,0.00019817635,0.00036675905,0.00012951947,0.00012171991,0.00016087407,0.0008102438,0.000079332494,0.000110795045],"category_scores_gemma":[0.00021218862,0.00014632715,0.000075533346,0.0003718325,0.00024426088,0.0002637368,0.00010363096,0.00025595925,0.00038058643],"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.00013361312,0.000075816184,0.002940717,0.000038958915,0.000021730457,2.6446472e-7,0.0024041957,0.000103567145,0.00056469033,0.9916329,0.000031232605,0.002052332],"study_design_scores_gemma":[0.00005445125,0.00036532967,0.0004672626,0.00027325342,0.000008873619,0.000009005674,0.00410505,0.003556926,0.012876091,0.97781825,0.00019654783,0.0002689553],"about_ca_topic_score_codex":0.00019259399,"about_ca_topic_score_gemma":0.000036784808,"teacher_disagreement_score":0.08163566,"about_ca_system_score_codex":0.000059232807,"about_ca_system_score_gemma":0.000049202456,"threshold_uncertainty_score":0.5967048},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92099786,0.000010674381,0.06677909,0.007438694,0.00014715162,0.00019472638,4.762265e-7,0.00002357136,0.0044077747],"genre_scores_gemma":[0.9987967,0.000016226119,0.0008730077,0.00023431523,0.00005069547,0.000010594389,4.2898625e-7,0.0000027433546,0.000015294425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989869,0.00002788641,0.00029675406,0.00022643081,0.00032768186,0.00013434865],"domain_scores_gemma":[0.9995538,0.000055126206,0.00014387595,0.0000907009,0.00014015926,0.000016338923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008319697,0.0000894706,0.00011168062,0.00010590834,0.00018645762,0.0002535703,0.00071005063,0.000034802368,0.000008457477],"category_scores_gemma":[0.00009851026,0.000058100177,0.00004268016,0.0003941638,0.00005561326,0.00030802947,0.0000969436,0.00011833074,0.00000811727],"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.000007642504,0.00003487028,0.00032279044,0.0000072059456,0.000004041974,3.2992123e-8,0.005232107,0.00029550123,0.0068349973,0.9479626,0.00002631595,0.03927192],"study_design_scores_gemma":[0.00002247656,0.00003315676,0.00021399038,0.00003758723,0.0000053591552,5.613098e-7,0.0021133672,0.9200269,0.016137013,0.061323557,0.00001509824,0.00007094407],"about_ca_topic_score_codex":0.000024002804,"about_ca_topic_score_gemma":0.000016376138,"teacher_disagreement_score":0.9197314,"about_ca_system_score_codex":0.000013721466,"about_ca_system_score_gemma":0.000015967194,"threshold_uncertainty_score":0.24451841},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2046389,0.000009032367,0.7790237,0.0015113952,0.00041986725,0.00034280843,0.0000028897155,0.00008999134,0.013961412],"genre_scores_gemma":[0.91438806,0.000016735394,0.08538557,0.000076397126,0.000054122225,0.0000133127805,5.36998e-7,0.000007633282,0.000057640078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99822426,0.000049181537,0.00053817616,0.00035179945,0.00059910404,0.00023750454],"domain_scores_gemma":[0.99812543,0.00014004574,0.00046937354,0.00034021444,0.0008692032,0.000055724668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014374856,0.00014170806,0.00019477942,0.00016416052,0.00014342547,0.000110627174,0.0016855849,0.000070723676,0.000035284273],"category_scores_gemma":[0.0011619388,0.000112522925,0.0000854184,0.00063567556,0.0002671498,0.00056481507,0.00032170335,0.00021909135,0.00004122468],"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.000024695904,0.000051287218,0.00018762593,0.00004142436,0.0000053676713,2.1929084e-8,0.00071826344,0.00027568408,0.031211823,0.86302125,0.000030334902,0.104432225],"study_design_scores_gemma":[0.0000139296,0.00012029275,0.00087891746,0.00008801484,0.000004254194,0.0000011889983,0.00018372886,0.26802382,0.47333494,0.25718957,0.00006965358,0.00009166685],"about_ca_topic_score_codex":0.00003389855,"about_ca_topic_score_gemma":0.0000025334946,"teacher_disagreement_score":0.70974916,"about_ca_system_score_codex":0.00003964831,"about_ca_system_score_gemma":0.00005010748,"threshold_uncertainty_score":0.45885515},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49176624,0.000031416217,0.49190652,0.010244066,0.00082031626,0.0015926172,0.000018923196,0.00012468209,0.0034952122],"genre_scores_gemma":[0.99375385,0.0000067190276,0.0059113335,0.00008711645,0.000059303296,0.000065919856,0.0000011993951,0.000006497954,0.0001080371],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870247,0.000014386155,0.0003312666,0.0003343198,0.00036033345,0.0002572202],"domain_scores_gemma":[0.99852765,0.00014974507,0.00032238307,0.00032075436,0.0006250603,0.000054400647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004601391,0.00014684854,0.00017001499,0.000043496606,0.0005585727,0.00009023093,0.002081348,0.00006712737,0.0000114507975],"category_scores_gemma":[0.00008563575,0.00009518821,0.00014991939,0.00038442924,0.00041441893,0.00022505729,0.0006599169,0.00016669215,0.000014620616],"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.000045862158,0.00016323719,0.00048827654,0.000012039654,0.000015177042,1.1030294e-8,0.0006131765,0.000053287626,0.003133498,0.9475811,0.00007857108,0.04781577],"study_design_scores_gemma":[0.00018435164,0.0008551257,0.006010701,0.000105542465,0.00008230392,0.000002394355,0.0017897361,0.18667562,0.11191453,0.69157666,0.00041843753,0.0003845944],"about_ca_topic_score_codex":0.00015089275,"about_ca_topic_score_gemma":0.000029636736,"teacher_disagreement_score":0.50198764,"about_ca_system_score_codex":0.000039785664,"about_ca_system_score_gemma":0.00006268767,"threshold_uncertainty_score":0.4296146},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4184115,0.00001336991,0.5779237,0.0016379246,0.00033784469,0.00038288432,0.00019652877,0.000099979305,0.0009962807],"genre_scores_gemma":[0.9546844,0.000009528632,0.045191616,0.000045803794,0.00003228303,0.000010310793,0.000007828883,0.0000059838976,0.000012241841],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858505,0.000011571329,0.00057216745,0.00034211765,0.00027332333,0.00021579377],"domain_scores_gemma":[0.9976372,0.00015468881,0.0007363734,0.0003778983,0.0010316615,0.00006217312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052918197,0.00016256746,0.0002887139,0.00010677583,0.00009741621,0.00016211705,0.0017065426,0.00009992903,0.0000016090635],"category_scores_gemma":[0.000890148,0.00012929131,0.000034252836,0.00024944302,0.0003065123,0.0013213024,0.00074750034,0.00018446393,0.0000043025857],"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.000055867065,0.000032816937,0.0008584879,0.000026395337,0.000018232065,7.996574e-8,0.0010854078,0.000011822515,0.004370692,0.91828233,0.00006398706,0.075193875],"study_design_scores_gemma":[0.000094758165,0.00023481232,0.0005406504,0.000363656,0.000032515494,0.000002580729,0.0029955483,0.58641887,0.1670093,0.24187791,0.00017708598,0.0002523026],"about_ca_topic_score_codex":0.000082244085,"about_ca_topic_score_gemma":0.0000069260864,"teacher_disagreement_score":0.6764044,"about_ca_system_score_codex":0.000030452045,"about_ca_system_score_gemma":0.00009973025,"threshold_uncertainty_score":0.5272346},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88078517,0.00004087159,0.10621024,0.0060078446,0.0015530252,0.000585229,0.0000052341506,0.00012865118,0.004683766],"genre_scores_gemma":[0.9826248,0.000053100608,0.016297437,0.00055683905,0.0001410299,0.000033628563,4.2594755e-7,0.000020974025,0.00027170603],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9970038,0.00003831157,0.00092518196,0.0008265159,0.00062021613,0.0005859761],"domain_scores_gemma":[0.99733937,0.00015239678,0.00041274866,0.0004906084,0.001444747,0.00016013716],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005881136,0.0003138276,0.00037882436,0.00034925016,0.00031435644,0.00048989244,0.0015173331,0.00014466494,0.00010802398],"category_scores_gemma":[0.0009541262,0.0002796542,0.00016465559,0.0017187906,0.00014192006,0.00128799,0.0005609612,0.0004966641,0.00019181838],"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.000036294325,0.00017197077,0.00037710372,0.000024362316,0.000014034258,0.0000075847665,0.0018976732,0.0045229476,0.4634737,0.45737788,0.00006572511,0.07203072],"study_design_scores_gemma":[0.000013593804,0.00006194392,0.00041727166,0.00024119686,0.000009278196,0.00002873941,0.0023545586,0.11674926,0.8189426,0.0607497,0.00015935392,0.00027251802],"about_ca_topic_score_codex":0.00017032582,"about_ca_topic_score_gemma":0.00018596178,"teacher_disagreement_score":0.39662817,"about_ca_system_score_codex":0.00022241595,"about_ca_system_score_gemma":0.00030749562,"threshold_uncertainty_score":0.99996555},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57876605,0.000015079487,0.41765812,0.000595095,0.000088874796,0.0006126827,0.000016657244,0.000106537984,0.0021409215],"genre_scores_gemma":[0.9957806,0.000020067231,0.004039233,0.00004963488,0.00003408843,0.000047749814,0.000003743416,0.000013274825,0.000011632531],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898356,0.000013039039,0.00030002336,0.00026591145,0.00023236641,0.00020508148],"domain_scores_gemma":[0.99900264,0.00014620824,0.0001349349,0.0001402313,0.0005235853,0.000052418014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031945703,0.00017905388,0.00021742945,0.00008864258,0.00014526471,0.00009523339,0.00026919972,0.00008192584,0.000027982573],"category_scores_gemma":[0.0003434122,0.0001240664,0.000052852938,0.00031254507,0.00023829375,0.0001823032,0.000019985531,0.00015528838,0.000001474317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001619774,0.000035013938,0.000708344,0.0002770844,0.00002590853,1.922892e-8,0.0007048351,0.8575276,0.0049468577,0.10876903,0.0000334148,0.026809886],"study_design_scores_gemma":[0.000039220846,0.00017505605,0.00013754399,0.00012908559,0.00003308502,3.792654e-7,0.00037178726,0.85099393,0.11718041,0.03076478,0.00003112265,0.00014363171],"about_ca_topic_score_codex":0.000024227738,"about_ca_topic_score_gemma":0.000042192452,"teacher_disagreement_score":0.41701454,"about_ca_system_score_codex":0.000035597885,"about_ca_system_score_gemma":0.000028455297,"threshold_uncertainty_score":0.50592804},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.505454,0.00009370662,0.3836512,0.039314527,0.0026230467,0.0026852386,0.00043722746,0.00019149143,0.06554955],"genre_scores_gemma":[0.9897421,0.000017069358,0.0040735425,0.00028419346,0.0001208092,0.00013947362,0.0000019935692,0.000012250885,0.0056085885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997792,0.000038728256,0.0007710771,0.0005448975,0.0006120472,0.00024125399],"domain_scores_gemma":[0.99616027,0.0004724814,0.0005579883,0.0003416128,0.0023857392,0.00008192661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012441756,0.00015783438,0.00026035038,0.00010538107,0.0005973267,0.00029883083,0.0009775076,0.00008057464,0.0004537886],"category_scores_gemma":[0.0043741255,0.00011516277,0.0002080837,0.001066876,0.00031019264,0.00029597367,0.00018475596,0.00020022051,0.00020214888],"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.00005991401,0.00013828286,0.00007057462,0.000009541217,0.000015382213,1.4264656e-7,0.0011142456,0.00014867657,0.030382115,0.92103326,0.0022278267,0.044800017],"study_design_scores_gemma":[0.000018284867,0.000032066742,0.000086759224,0.000043944317,0.000013134929,0.0000049628957,0.003349376,0.005159897,0.38237676,0.60581946,0.0030012336,0.00009411543],"about_ca_topic_score_codex":0.000005622042,"about_ca_topic_score_gemma":0.000011927856,"teacher_disagreement_score":0.48428807,"about_ca_system_score_codex":0.0000341586,"about_ca_system_score_gemma":0.00012781212,"threshold_uncertainty_score":0.5236553},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042202245,0.000012868871,0.944406,0.0051725414,0.00062713696,0.00091228326,0.0000044599633,0.00014707494,0.0065154424],"genre_scores_gemma":[0.95835483,0.0000033879655,0.041094415,0.00017401803,0.000067158595,0.000092335555,0.0000014904701,0.000012010567,0.00020032578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982041,0.000033709697,0.0005068203,0.0004402311,0.000516487,0.00029865277],"domain_scores_gemma":[0.9981812,0.00014197659,0.00044511774,0.00022657473,0.0008758397,0.00012926324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012616768,0.00018458629,0.00021070833,0.00012281715,0.00018279468,0.00033007475,0.0011501891,0.00008476433,0.000013530221],"category_scores_gemma":[0.0011199893,0.00014653582,0.00010112029,0.0005021716,0.00014918394,0.00053586,0.00015509546,0.00018883568,0.000080596874],"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.000106551575,0.000083800325,0.000034326084,0.000028869581,0.000008616626,1.371173e-7,0.0050321277,0.00128302,0.0028589864,0.9662381,0.00007561113,0.024249885],"study_design_scores_gemma":[0.00008535908,0.0002730526,0.00022835961,0.00009336552,0.000009769754,0.0000020865532,0.0012006002,0.3437673,0.011352095,0.6422196,0.0005873908,0.00018104684],"about_ca_topic_score_codex":0.000025909058,"about_ca_topic_score_gemma":0.0000142219415,"teacher_disagreement_score":0.9161526,"about_ca_system_score_codex":0.00008347693,"about_ca_system_score_gemma":0.00020082579,"threshold_uncertainty_score":0.59755576},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7304531,0.00013128096,0.040180832,0.023076335,0.0023193934,0.0025120038,0.00003594874,0.0002728707,0.20101827],"genre_scores_gemma":[0.9959678,0.000021176826,0.0004250642,0.00029195388,0.0001194134,0.00004548276,3.2550759e-7,0.000013256465,0.0031155064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969243,0.00008175626,0.00091755047,0.0005428723,0.00119545,0.00033811197],"domain_scores_gemma":[0.99477077,0.0017110924,0.00087023905,0.00044792844,0.0020505916,0.00014940067],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0036059248,0.00022152954,0.00029579145,0.00013168446,0.0007502415,0.00035618874,0.0020496603,0.00008297283,0.000065870394],"category_scores_gemma":[0.009116769,0.00011992435,0.00014401457,0.0010175159,0.00074606505,0.0002650745,0.00027180128,0.0003983916,0.0007100839],"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.00014880672,0.00012369224,0.0003527156,0.0000029762077,0.000011004736,1.5970372e-7,0.003520111,0.00012658563,0.0056500738,0.9366162,0.00077632227,0.052671347],"study_design_scores_gemma":[0.00008106729,0.00027561566,0.00050738186,0.00021999827,0.000019053909,0.000005168937,0.052143086,0.022314444,0.39442992,0.5205987,0.00911923,0.00028629298],"about_ca_topic_score_codex":0.000024278645,"about_ca_topic_score_gemma":0.00002372366,"teacher_disagreement_score":0.41601747,"about_ca_system_score_codex":0.00007117704,"about_ca_system_score_gemma":0.000111454945,"threshold_uncertainty_score":0.99922985},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53584945,0.000114402734,0.41982338,0.012632196,0.0019146069,0.0014249823,0.000048790236,0.00043146536,0.027760698],"genre_scores_gemma":[0.98505366,0.0000048288407,0.014367158,0.0004184055,0.000039509578,0.000018122055,0.000001857203,0.000012570552,0.00008386508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979563,0.000044097043,0.00055555353,0.00046738947,0.00067548285,0.00030121123],"domain_scores_gemma":[0.9978281,0.0000960628,0.0004601997,0.00038673673,0.0010902359,0.0001386448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008545341,0.0002241884,0.0002684801,0.00016440295,0.00014372374,0.00017121417,0.0016969849,0.00010282936,0.000022522623],"category_scores_gemma":[0.0006583435,0.00017268654,0.00008632233,0.00081613846,0.00018269649,0.0003612254,0.00017361688,0.00024135037,0.00003967724],"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.00018229481,0.0002718415,0.0017731672,0.000108988665,0.000017690234,0.000001859432,0.0033407987,0.024633799,0.05322872,0.87427247,0.00081821455,0.041350186],"study_design_scores_gemma":[0.00004046866,0.00035904508,0.00004337251,0.00035509228,0.000006719019,0.0000019097126,0.000104858365,0.57881594,0.39115667,0.02888668,0.00006422932,0.00016503327],"about_ca_topic_score_codex":0.00007064774,"about_ca_topic_score_gemma":0.000003842571,"teacher_disagreement_score":0.8453858,"about_ca_system_score_codex":0.0000648572,"about_ca_system_score_gemma":0.00031584984,"threshold_uncertainty_score":0.70419526},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6997405,0.000059346665,0.29502553,0.001312353,0.0017968669,0.00040678523,0.00001142237,0.00018467364,0.0014625],"genre_scores_gemma":[0.9703271,0.000005080312,0.029193379,0.00010705532,0.0003178247,0.000019524146,0.0000019838494,0.000011411173,0.000016683518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997988,0.000064009844,0.00059110514,0.00044892723,0.0005695255,0.00033846244],"domain_scores_gemma":[0.9982644,0.00013629739,0.0005611226,0.0001699688,0.0007638779,0.00010435315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076143944,0.00022093802,0.00029770366,0.00009407956,0.0002498254,0.00025475313,0.0011265265,0.00013489225,0.000024511251],"category_scores_gemma":[0.00016195688,0.00017905237,0.00012386206,0.000373781,0.00025464589,0.00063326303,0.00040909727,0.0002578119,0.000021316566],"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.00010988777,0.00007845321,0.002823813,0.000010526702,0.00003310505,7.864033e-7,0.0046479395,0.00007531361,0.005681302,0.9697691,0.0012015698,0.015568206],"study_design_scores_gemma":[0.00012077187,0.00018809651,0.0021670405,0.00044544405,0.00003068084,0.00001357841,0.0034811364,0.3442165,0.04253034,0.60613173,0.00018423753,0.0004904151],"about_ca_topic_score_codex":0.00015929165,"about_ca_topic_score_gemma":0.000045083572,"teacher_disagreement_score":0.36363733,"about_ca_system_score_codex":0.00013050476,"about_ca_system_score_gemma":0.00010517549,"threshold_uncertainty_score":0.73015434},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.950907,0.00003444754,0.0020762805,0.0015809899,0.0004215191,0.00024257733,0.000016165695,0.000044992586,0.044676047],"genre_scores_gemma":[0.9992157,0.000010164072,0.00009277435,0.00010342733,0.00022032586,0.000017722175,6.1727405e-7,0.000011340381,0.00032790395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986888,0.000015565249,0.00062818016,0.00035654232,0.00007804713,0.00023287183],"domain_scores_gemma":[0.9990163,0.000102872684,0.0005817644,0.00009966499,0.00014724469,0.0000521573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094638433,0.00015312512,0.00031215439,0.00009362814,0.00023853927,0.0001526626,0.00043813584,0.000093791365,0.00011959198],"category_scores_gemma":[0.0006911388,0.00013097617,0.000075460055,0.00022229902,0.00028111046,0.00018050378,0.00008947688,0.00017284142,0.00014783781],"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.000018790073,0.000040657585,0.0066601015,0.000040571056,0.000011962263,1.1667888e-8,0.0012134884,0.0000070591127,0.00063342456,0.98172635,0.000063115294,0.009584457],"study_design_scores_gemma":[0.00005062865,0.00016675894,0.0072852927,0.00008156678,0.000009223913,0.000001328715,0.000485471,0.011573652,0.022085475,0.9567112,0.0013046912,0.0002447469],"about_ca_topic_score_codex":0.000077608755,"about_ca_topic_score_gemma":0.0000076240417,"teacher_disagreement_score":0.048308745,"about_ca_system_score_codex":0.000016275833,"about_ca_system_score_gemma":0.000012332341,"threshold_uncertainty_score":0.53410536},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001652961,0.000007817043,0.98364985,0.002458337,0.00033512758,0.00061710697,5.5802536e-7,0.00016181664,0.011116414],"genre_scores_gemma":[0.9567234,0.0000049799955,0.04183935,0.0003723585,0.00006031104,0.00006340562,0.0000012137282,0.000021644639,0.00091331924],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99744815,0.000018910407,0.0007081486,0.0005191741,0.0007918,0.0005138134],"domain_scores_gemma":[0.99750865,0.00011968924,0.00059880456,0.00037133897,0.0012195746,0.00018196694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011407775,0.00027756486,0.00030814766,0.00017723496,0.00028092362,0.00036524967,0.0022783987,0.00011094609,0.000012923978],"category_scores_gemma":[0.001330522,0.00022674177,0.00016651495,0.00051733485,0.00018130215,0.00048576004,0.0003876268,0.00038030662,0.000037166603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049397702,0.000020737958,0.000059193917,0.00003630818,0.000008127585,1.01413804e-7,0.0008066869,0.6225054,0.0016720595,0.36964628,0.00014072654,0.005054983],"study_design_scores_gemma":[0.00006946929,0.00041138334,0.0000028541986,0.00019380383,0.000012049999,8.492195e-7,0.00027669495,0.8661893,0.095674284,0.036723588,0.00021485245,0.00023087031],"about_ca_topic_score_codex":0.000012876132,"about_ca_topic_score_gemma":0.0000013285528,"teacher_disagreement_score":0.95507044,"about_ca_system_score_codex":0.00013888977,"about_ca_system_score_gemma":0.0003417586,"threshold_uncertainty_score":0.9246262},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9827769,0.000024260404,0.00088966306,0.0002170849,0.00042986913,0.00038160887,0.000025778918,0.000021928508,0.015232908],"genre_scores_gemma":[0.9996124,0.000007138494,0.00012484817,0.000024056091,0.00004022276,0.00002005329,0.0000011845037,0.000015088396,0.00015500463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99825835,0.000032873588,0.0008972944,0.0003903752,0.00015447341,0.0002666579],"domain_scores_gemma":[0.99860495,0.00010967356,0.0008374829,0.00019256548,0.0001830314,0.000072308896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018718299,0.00019913731,0.00051786855,0.00020719068,0.00005801622,0.000084170104,0.0006693191,0.00010194762,0.000075133095],"category_scores_gemma":[0.00051414,0.00015445045,0.000082744606,0.00039956224,0.00024075573,0.00021155053,0.00008008507,0.00027359417,0.00006422719],"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.0015270812,0.00017261229,0.0062314617,0.00008963468,0.000022228465,3.9163265e-7,0.003024715,0.0006204625,0.001244746,0.9864758,0.000006786874,0.00058407057],"study_design_scores_gemma":[0.00030567034,0.0005390981,0.0012183832,0.0005461406,0.000008981253,0.00000254269,0.00197166,0.0053586066,0.036982283,0.95280725,0.000009948918,0.00024946735],"about_ca_topic_score_codex":0.00044153197,"about_ca_topic_score_gemma":0.0001387608,"teacher_disagreement_score":0.035737537,"about_ca_system_score_codex":0.00007633833,"about_ca_system_score_gemma":0.000058305774,"threshold_uncertainty_score":0.6298306},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45900413,0.00004707614,0.45129955,0.011177814,0.0019437204,0.0018022619,0.000025492625,0.00073298335,0.07396698],"genre_scores_gemma":[0.9981044,0.0000057065445,0.0009111787,0.0004583373,0.00015148478,0.000061743136,4.888902e-7,0.000019943265,0.00028672587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99744016,0.00007861445,0.0006218472,0.00068742613,0.00068235036,0.0004896103],"domain_scores_gemma":[0.99755245,0.0003856306,0.00057562254,0.00036018543,0.0009802171,0.00014589023],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011523085,0.0003109096,0.00042769668,0.00022192753,0.00037699068,0.00046698152,0.0018855917,0.00012076857,0.000064367145],"category_scores_gemma":[0.00087844854,0.0002586425,0.00022034114,0.00078777317,0.0002877846,0.00076999323,0.00045155705,0.00037543254,0.00023203394],"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.000111266374,0.00031050225,0.001684698,0.0001288305,0.00006706928,0.0000013596236,0.006601499,0.000006792626,0.07153617,0.4598858,0.00047706394,0.45918894],"study_design_scores_gemma":[0.00021456098,0.00058736844,0.0015588982,0.0018437089,0.000055372646,0.00005843647,0.0028634379,0.16568704,0.75146824,0.0730245,0.0016340477,0.0010043676],"about_ca_topic_score_codex":0.00010581528,"about_ca_topic_score_gemma":0.000033303226,"teacher_disagreement_score":0.6799321,"about_ca_system_score_codex":0.0000729503,"about_ca_system_score_gemma":0.00010778329,"threshold_uncertainty_score":0.9999866},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18439879,0.000008708654,0.81130373,0.00010690337,0.0003829674,0.00018303843,4.5739156e-7,0.000051880572,0.0035635123],"genre_scores_gemma":[0.9834474,0.000019136469,0.016316293,0.0000605978,0.00004126408,0.0000028625468,1.5457243e-7,0.000009603967,0.00010269845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986055,0.00001352067,0.0004044587,0.00034708477,0.00038047845,0.00024894997],"domain_scores_gemma":[0.9990512,0.00005866324,0.0003519016,0.0002077402,0.00027598115,0.00005449103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038277882,0.00016640303,0.0001678621,0.0002180476,0.00018727726,0.00031800996,0.0007489745,0.00006891793,0.000020298172],"category_scores_gemma":[0.00026180292,0.00013270894,0.00006400424,0.00074333465,0.00013749026,0.0011384096,0.00038602747,0.00020349835,0.000010053435],"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.000108993416,0.00007414254,0.005148918,0.000071197166,0.000033910088,4.8505007e-7,0.002610425,0.037393425,0.026990753,0.8917172,0.0000076575925,0.035842914],"study_design_scores_gemma":[0.000019534771,0.00017502144,0.0017106273,0.00009155061,0.000018992809,0.000002958873,0.00023905654,0.8585604,0.11533246,0.023696113,0.000005637963,0.00014762896],"about_ca_topic_score_codex":0.00006076634,"about_ca_topic_score_gemma":0.0000036828333,"teacher_disagreement_score":0.8680211,"about_ca_system_score_codex":0.000052301435,"about_ca_system_score_gemma":0.000039555394,"threshold_uncertainty_score":0.5411713},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9281507,0.00018740786,0.01943398,0.041130345,0.0007418452,0.0018195116,0.000015881118,0.00006919323,0.008451121],"genre_scores_gemma":[0.99369526,0.00003161124,0.0046129148,0.00025184616,0.000120113735,0.000114016104,2.195593e-7,0.000012044925,0.0011619801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974605,0.000030195635,0.00082662725,0.0004819787,0.0007963798,0.00040433236],"domain_scores_gemma":[0.9966299,0.00105977,0.0005289364,0.00028548206,0.0013867524,0.0001091595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029265408,0.00019371543,0.00029327185,0.00011317051,0.0005999285,0.0008506442,0.0012554667,0.000076773795,0.0001881357],"category_scores_gemma":[0.0037147428,0.00010081332,0.0001536334,0.00056639273,0.0003891908,0.00030883454,0.0001863323,0.00027347624,0.00010749212],"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.0000758365,0.00016276221,0.0016344785,0.000036312496,0.000052000658,9.329069e-8,0.005456363,0.00041786465,0.053522605,0.6070935,0.002842549,0.3287056],"study_design_scores_gemma":[0.000052623076,0.00018470017,0.0014523687,0.00021866141,0.000040388855,0.0000066741163,0.009397188,0.091032535,0.1111726,0.7852665,0.0009505036,0.00022524629],"about_ca_topic_score_codex":0.00010995864,"about_ca_topic_score_gemma":0.000017332914,"teacher_disagreement_score":0.32848036,"about_ca_system_score_codex":0.000027166414,"about_ca_system_score_gemma":0.00008699684,"threshold_uncertainty_score":0.8202781},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73259175,0.00001854075,0.2634654,0.00059532875,0.0003187709,0.00049284985,0.000023444614,0.000008649913,0.00248526],"genre_scores_gemma":[0.9988491,0.000030201241,0.0004745086,0.00010539337,0.00013695385,0.000040930503,0.0000055066525,0.000011376152,0.00034602202],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987615,0.00001319083,0.00059889205,0.0002506392,0.00015650739,0.0002192931],"domain_scores_gemma":[0.9990396,0.000027735981,0.0004112621,0.00023231738,0.00024581363,0.000043290005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038058692,0.00015520543,0.00020607341,0.00006561954,0.00006662795,0.00005241006,0.00052138953,0.000113009926,0.000016581558],"category_scores_gemma":[0.0001999109,0.0001240989,0.00009057966,0.00019946268,0.00021128656,0.000027802735,0.00018412985,0.00023460486,0.0000032164862],"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.00017872965,0.0003440917,0.0011676621,0.00009117964,0.00003905584,5.7690578e-8,0.00029382476,0.0062466506,0.6981643,0.27130866,0.00022399257,0.02194181],"study_design_scores_gemma":[0.00016749545,0.00062646606,0.002220199,0.0011506388,0.000031867952,0.000006326953,0.00068298,0.19715112,0.7627832,0.034507766,0.0002606086,0.00041129268],"about_ca_topic_score_codex":0.000102712766,"about_ca_topic_score_gemma":0.00011479043,"teacher_disagreement_score":0.26625738,"about_ca_system_score_codex":0.00001559448,"about_ca_system_score_gemma":0.000040279323,"threshold_uncertainty_score":0.5060606},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8149559,0.0000949032,0.02055419,0.0061703627,0.0013620325,0.0016498934,0.00005546546,0.0004119112,0.15474534],"genre_scores_gemma":[0.99765104,0.000030288682,0.0016943027,0.000043974844,0.000041425734,0.000013132485,0.0000029259288,0.000007716109,0.00051520974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99843174,0.000039620463,0.00042282042,0.00020797906,0.00067837577,0.000219485],"domain_scores_gemma":[0.99847895,0.000053297852,0.00038662602,0.00009203162,0.0008836055,0.000105480234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087383523,0.000107773514,0.00018268243,0.000071715614,0.00020353326,0.00004936436,0.00045828606,0.00009170516,0.000083046165],"category_scores_gemma":[0.00031956265,0.00008315827,0.00005982796,0.00045244864,0.0002781678,0.00017923655,0.000031884803,0.00013551298,0.0000149845155],"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.00027176717,0.00072745024,0.010364845,0.00009135274,0.000028536184,2.2501376e-7,0.09828327,0.012283471,0.021889778,0.8447148,0.0014532655,0.009891217],"study_design_scores_gemma":[0.00029763643,0.0006051135,0.003726618,0.0017823396,0.00010246573,7.741738e-7,0.06807771,0.113125585,0.6449884,0.16124326,0.005361481,0.0006885877],"about_ca_topic_score_codex":0.0003281917,"about_ca_topic_score_gemma":0.000115797666,"teacher_disagreement_score":0.68347156,"about_ca_system_score_codex":0.000042669322,"about_ca_system_score_gemma":0.00016394396,"threshold_uncertainty_score":0.3391096},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006709067,0.0000063940206,0.9566517,0.0023153492,0.0005545551,0.00033413456,0.00001144903,0.00016335299,0.033253994],"genre_scores_gemma":[0.99513227,0.000014564376,0.004042749,0.0005718076,0.00004042374,0.000009022696,0.000003999144,0.0000059340164,0.00017923847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984539,0.000017031909,0.00048249288,0.00021644954,0.00063313433,0.00019700137],"domain_scores_gemma":[0.99775755,0.000020095275,0.00039081826,0.00022500042,0.0014922123,0.000114296374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005054731,0.00014981124,0.00015980627,0.00016077675,0.00010433514,0.0004155361,0.00143889,0.000067435205,0.000023218267],"category_scores_gemma":[0.00062594627,0.000113493144,0.00005794935,0.0009507262,0.000120525365,0.0019109725,0.00035339012,0.00011751416,0.00019228598],"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.00001816932,0.000054160584,0.000054905515,0.000009757671,0.0000058199566,6.0033564e-8,0.0015298951,0.000089502544,0.00032818603,0.9706032,0.001079093,0.026227253],"study_design_scores_gemma":[0.00005563045,0.00028522944,0.00009777178,0.00011827523,0.00001208181,0.0000028777908,0.0017645351,0.5950058,0.1973451,0.20188926,0.0031637882,0.000259645],"about_ca_topic_score_codex":0.000035431673,"about_ca_topic_score_gemma":0.000003918887,"teacher_disagreement_score":0.98842317,"about_ca_system_score_codex":0.00005797482,"about_ca_system_score_gemma":0.00019573492,"threshold_uncertainty_score":0.46281162},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25871918,0.000013400423,0.70457226,0.0070369625,0.0007587658,0.00044966687,0.0000057035513,0.00023861146,0.028205475],"genre_scores_gemma":[0.96376,0.00000514875,0.035238758,0.0005759909,0.00009216779,0.000041447234,4.0537745e-7,0.000013756422,0.00027233007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99738616,0.000027599184,0.00066943874,0.0006364792,0.0008278919,0.0004524376],"domain_scores_gemma":[0.9975229,0.00012954549,0.00032080626,0.00041378135,0.0012778972,0.0003350528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008233675,0.00026990662,0.0002853105,0.00018063259,0.00020352805,0.00033018648,0.0023821958,0.00011741636,0.000023026345],"category_scores_gemma":[0.0010137704,0.00021582651,0.000104032035,0.00087834353,0.00018309592,0.00068898266,0.0007033185,0.00037191648,0.00033597712],"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.000031539308,0.0000867831,0.00043526915,0.000012113591,0.0000061195005,5.7267715e-7,0.0030041935,0.00047888808,0.010621854,0.92414165,0.00021274066,0.060968265],"study_design_scores_gemma":[0.000051271494,0.00040981526,0.00034089576,0.00040365872,0.0000108420245,0.000012235468,0.0009128963,0.17372914,0.29989988,0.52355206,0.00019308188,0.00048420325],"about_ca_topic_score_codex":0.000033791646,"about_ca_topic_score_gemma":0.000007888814,"teacher_disagreement_score":0.7050408,"about_ca_system_score_codex":0.000073521456,"about_ca_system_score_gemma":0.0003011077,"threshold_uncertainty_score":0.880115},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9382317,0.00013563347,0.0027945826,0.00021736934,0.00031477204,0.00038385886,0.0000033288811,0.0006227226,0.057296015],"genre_scores_gemma":[0.9981612,0.0004148009,0.0010823782,0.000053464613,0.000035341873,0.000012116258,3.5818852e-7,0.000029166493,0.00021120124],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99892503,0.000010981256,0.00031196655,0.00027026774,0.00020336518,0.00027840742],"domain_scores_gemma":[0.99928075,0.000043455242,0.000114134295,0.00015168861,0.00032004714,0.00008991445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017296463,0.00022549325,0.0002579431,0.00009893517,0.0001412401,0.000063010215,0.0003805007,0.00010870639,0.00016525225],"category_scores_gemma":[0.00016344547,0.0001824598,0.000069816764,0.00022680896,0.00029128464,0.0001318987,0.00013322919,0.00037704097,0.00003439643],"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.00012710948,0.00014178561,0.0032164939,0.00009750216,0.00007459563,0.000005308097,0.006153605,0.00011013591,0.59750456,0.36006683,0.0016199982,0.03088206],"study_design_scores_gemma":[0.000022993821,0.000120919794,0.00040036708,0.00032559055,0.0000281334,0.000012299791,0.0010920964,0.06402979,0.90767837,0.025717353,0.00032036027,0.0002517005],"about_ca_topic_score_codex":0.000047295165,"about_ca_topic_score_gemma":0.000009203469,"teacher_disagreement_score":0.33434948,"about_ca_system_score_codex":0.000017629478,"about_ca_system_score_gemma":0.000016278282,"threshold_uncertainty_score":0.7440495},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2561114,0.000024180703,0.7228876,0.0018085194,0.000986343,0.00043924843,0.0000053242625,0.0002615095,0.017475914],"genre_scores_gemma":[0.986934,0.0000023641066,0.012315202,0.00041066774,0.00014447591,0.000010600712,0.000001167949,0.000018878183,0.00016263421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974204,0.000037195172,0.00073738577,0.00065138924,0.00054165116,0.00061198475],"domain_scores_gemma":[0.99795234,0.00039243544,0.00064368814,0.00040679766,0.0004581304,0.00014659864],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012194939,0.00032567102,0.00040369818,0.00013444037,0.00051263213,0.00043636933,0.0024605365,0.00012531444,0.000019147488],"category_scores_gemma":[0.00048165125,0.00026290235,0.000131867,0.00050540274,0.00018122842,0.0003297691,0.0004956022,0.00047925717,0.00009200595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000162059,0.00029759618,0.0118276905,0.0003788887,0.000073756746,0.0000069462853,0.01163836,0.008472883,0.078366354,0.66741383,0.00097298936,0.22038867],"study_design_scores_gemma":[0.000050309405,0.00035620425,0.0007598115,0.0008727743,0.00001744831,0.000013032242,0.00026266073,0.83980674,0.114759326,0.04243402,0.00029032194,0.00037735104],"about_ca_topic_score_codex":0.000062842126,"about_ca_topic_score_gemma":0.0000043408636,"teacher_disagreement_score":0.8313339,"about_ca_system_score_codex":0.00004076541,"about_ca_system_score_gemma":0.00009720598,"threshold_uncertainty_score":0.9999823},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19310963,0.000023129707,0.7159787,0.045515303,0.0006275824,0.0012293061,0.00007730732,0.00013542076,0.04330367],"genre_scores_gemma":[0.9935412,0.0000011929934,0.0014367108,0.0008290702,0.00007519682,0.000092768656,0.000002314921,0.000011664779,0.004009925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977431,0.000052502823,0.0006810836,0.00054056675,0.00074475753,0.00023794046],"domain_scores_gemma":[0.9956325,0.0010892259,0.00055147696,0.00032132864,0.0023284904,0.00007692974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018987,0.00016051943,0.00023865588,0.00013475593,0.00045515582,0.0002810696,0.00096724194,0.000100244215,0.00056746765],"category_scores_gemma":[0.004490738,0.00011696383,0.00017948388,0.0009745409,0.00023327053,0.00016266656,0.0001201558,0.00018531318,0.00005365947],"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.00014912729,0.000088348446,0.000024949595,0.00000907483,0.000008123837,1.0724893e-7,0.0002519015,0.0026124478,0.029681297,0.95081675,0.0019090617,0.01444883],"study_design_scores_gemma":[0.00002896839,0.00004358851,0.000026758971,0.000058125668,0.000010896337,0.0000014928111,0.004159183,0.0879564,0.29671702,0.6096922,0.0012106993,0.00009464291],"about_ca_topic_score_codex":0.00000561034,"about_ca_topic_score_gemma":0.000006232385,"teacher_disagreement_score":0.80043155,"about_ca_system_score_codex":0.00004748709,"about_ca_system_score_gemma":0.00016463689,"threshold_uncertainty_score":0.6213373},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77167606,0.00046005458,0.0009770776,0.00062989385,0.004770677,0.0012579957,0.000015413969,0.0011735496,0.21903925],"genre_scores_gemma":[0.99931836,0.00001522465,0.000027011878,0.000033710883,0.00014600485,0.00016558364,2.2799058e-7,0.000028314624,0.000265551],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99861044,0.000011085106,0.00044862527,0.00023998514,0.00043296072,0.0002569063],"domain_scores_gemma":[0.9990534,0.000027494409,0.00014870417,0.00016572047,0.00046839504,0.00013628589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003336234,0.0002013488,0.00027188103,0.00010123479,0.0000507851,0.000054884742,0.00057898706,0.00010713674,0.00011388589],"category_scores_gemma":[0.0001937148,0.00015966747,0.00009202197,0.00024745413,0.00010661058,0.00015813684,0.00003890942,0.0002346527,0.00040909502],"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.0005214602,0.00045936074,0.0026531916,0.002571128,0.00028310914,0.000005551055,0.018845575,0.008488421,0.05435102,0.8184891,0.025818696,0.06751339],"study_design_scores_gemma":[0.00021554626,0.0004274976,0.00010671289,0.001451893,0.000086263,0.000020850905,0.022992935,0.4095092,0.542649,0.009549626,0.012062408,0.0009281008],"about_ca_topic_score_codex":0.000046655703,"about_ca_topic_score_gemma":0.000008399647,"teacher_disagreement_score":0.80893946,"about_ca_system_score_codex":0.00033637826,"about_ca_system_score_gemma":0.00007375831,"threshold_uncertainty_score":0.65110505},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43741176,0.000042515498,0.55790377,0.00027514226,0.00032964264,0.00244064,0.000048930586,0.0001259702,0.0014216467],"genre_scores_gemma":[0.9987759,0.000005573522,0.0009822828,0.000010326583,0.000043330198,0.00013232804,0.0000035975786,0.000016615182,0.000030054887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913293,0.0000057690527,0.00040979392,0.0001635464,0.00015882676,0.00012913201],"domain_scores_gemma":[0.9990742,0.000042977215,0.00023335253,0.000079971636,0.00051624014,0.000053237265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019356178,0.00012613148,0.00018960591,0.00007720846,0.000064854954,0.000024736055,0.00017444375,0.0000475997,0.000003855406],"category_scores_gemma":[0.00012876025,0.00011188403,0.000043245145,0.0001297765,0.000057865574,0.00026792256,0.000027987535,0.0000815151,0.0000033169506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014741138,0.000049029397,0.00005356375,0.00010647404,0.000026864913,1.2998832e-8,0.0010646988,0.51599985,0.41733336,0.060380436,0.000018735653,0.0048195673],"study_design_scores_gemma":[0.00010361232,0.00007930046,0.000007528097,0.00005919091,0.000018833936,5.0540865e-7,0.0005287209,0.794338,0.1996178,0.0051370673,0.000029329667,0.00008014502],"about_ca_topic_score_codex":0.000006486275,"about_ca_topic_score_gemma":0.0000064968567,"teacher_disagreement_score":0.5613641,"about_ca_system_score_codex":0.000064816544,"about_ca_system_score_gemma":0.0000133056465,"threshold_uncertainty_score":0.45624983},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9678001,0.000017931856,0.0023368886,0.00080185384,0.0008518853,0.0008928882,0.000015655358,0.00028488078,0.026997952],"genre_scores_gemma":[0.99922633,0.00001493959,0.00010625894,0.00003198925,0.00004757481,0.00016835488,4.710479e-7,0.000015593188,0.00038847828],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987803,0.0000141757455,0.00046544222,0.00023488379,0.00027476254,0.00023041765],"domain_scores_gemma":[0.9990793,0.000064735425,0.0001164236,0.00019328282,0.00046790743,0.0000783763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018798251,0.00015993293,0.00019562205,0.00006119862,0.00010159972,0.00012212184,0.00043587293,0.0000615219,0.00027137637],"category_scores_gemma":[0.00024340989,0.0001226098,0.00009687226,0.0003355209,0.0001503659,0.0002797653,0.00005174577,0.00022250756,0.00025199627],"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.00018481676,0.00031048444,0.0036629722,0.00033090526,0.00021844335,4.1001437e-7,0.0056302254,0.017549096,0.6157352,0.17107795,0.0042632436,0.1810363],"study_design_scores_gemma":[0.000033509084,0.00009314308,0.004691305,0.000092444745,0.000013112379,0.0000016443902,0.0021503025,0.45175967,0.46652362,0.07432208,0.0001321382,0.00018704092],"about_ca_topic_score_codex":0.0001868645,"about_ca_topic_score_gemma":0.000031738222,"teacher_disagreement_score":0.43421057,"about_ca_system_score_codex":0.000053432457,"about_ca_system_score_gemma":0.00002029527,"threshold_uncertainty_score":0.49998823},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03163686,0.000030703755,0.91700494,0.005141978,0.00066307705,0.0016325883,0.00002282687,0.0006484163,0.043218613],"genre_scores_gemma":[0.9638386,0.000015591793,0.03549369,0.00010526028,0.000023726638,0.00015926028,5.912457e-7,0.000010171914,0.00035313427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842376,0.000009967471,0.00045983255,0.0004780089,0.0002809375,0.00034751094],"domain_scores_gemma":[0.99849975,0.00008468141,0.00045224413,0.00034688268,0.0005634374,0.000053016687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048984465,0.00018494684,0.0002007543,0.0001438875,0.0002277559,0.00012118808,0.0020916497,0.00011396048,0.000049236263],"category_scores_gemma":[0.00039876872,0.00014111938,0.00011141961,0.00045101257,0.00021940314,0.0005372854,0.00023866768,0.00018929543,0.000056796584],"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.00004673809,0.00011959026,0.000064586966,0.000010478405,0.0000085169495,4.443264e-8,0.0028291335,4.79537e-7,0.012678356,0.8625808,0.0001301402,0.121531166],"study_design_scores_gemma":[0.000054503125,0.00023750663,0.00092343125,0.00007830931,0.00001014865,9.724092e-7,0.004929273,0.096087605,0.43437472,0.46274015,0.00035298418,0.0002103964],"about_ca_topic_score_codex":0.000008440476,"about_ca_topic_score_gemma":0.0000045388847,"teacher_disagreement_score":0.93220174,"about_ca_system_score_codex":0.000040866347,"about_ca_system_score_gemma":0.0000748836,"threshold_uncertainty_score":0.5754681},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2663228,0.000010527377,0.714918,0.0012591742,0.00042176672,0.00198102,0.000021664604,0.00008149474,0.014983553],"genre_scores_gemma":[0.99294245,0.00001081037,0.005261803,0.00007798489,0.000062119216,0.00016228213,4.7218467e-7,0.000013747229,0.0014683235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99781865,0.000041174946,0.0006914972,0.0005358034,0.0006363511,0.00027652437],"domain_scores_gemma":[0.99724835,0.00031324395,0.00071278465,0.0003240103,0.0013143905,0.000087197586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00187118,0.00019906466,0.0002568729,0.00014416798,0.00042702377,0.00016583754,0.0013564078,0.00008458839,0.00049387803],"category_scores_gemma":[0.0010436778,0.00011730787,0.000116490504,0.00075240765,0.00055675214,0.0003792209,0.00008799453,0.00015358388,0.0001603383],"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.00097356964,0.0002126956,0.00015813694,0.000011753503,0.000022586053,1.5860078e-7,0.001993194,0.00045184305,0.01544532,0.92957634,0.0007621744,0.050392237],"study_design_scores_gemma":[0.00002631034,0.0002808563,0.00017774703,0.000038550883,0.000016842894,0.000003057931,0.0020106155,0.008438182,0.4295395,0.5591857,0.00017637303,0.0001062564],"about_ca_topic_score_codex":0.000019221225,"about_ca_topic_score_gemma":0.0000039128854,"teacher_disagreement_score":0.72661966,"about_ca_system_score_codex":0.000028624643,"about_ca_system_score_gemma":0.00008297316,"threshold_uncertainty_score":0.54076177},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45273265,0.000032908658,0.44049746,0.0011502978,0.00041529402,0.0006177976,0.000001370834,0.0003977781,0.10415444],"genre_scores_gemma":[0.99308527,0.000016568478,0.006229441,0.00018386901,0.0000248131,0.000018091569,1.7686084e-7,0.000015576843,0.00042621643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99835145,0.000025819678,0.00037648602,0.0004458582,0.00045715578,0.00034324682],"domain_scores_gemma":[0.99904096,0.00004659025,0.00016647243,0.00022303799,0.00041785874,0.00010506324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035655982,0.00021274586,0.00021077742,0.00011407682,0.0002426116,0.0001752059,0.0014827903,0.000069806396,0.00018618724],"category_scores_gemma":[0.0001038612,0.00014654592,0.00009586643,0.00054269115,0.00024199508,0.00038833564,0.00013632113,0.0003901128,0.00011779192],"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.00012360934,0.0001273165,0.00052935525,0.00002133993,0.0000240737,0.0000024531007,0.00875402,0.00044280782,0.013475033,0.8947133,0.000008708702,0.08177798],"study_design_scores_gemma":[0.000085987514,0.001063463,0.0006616772,0.00025996723,0.00002330089,0.00003996146,0.0017997125,0.085214004,0.85635215,0.053441796,0.00053809123,0.0005198933],"about_ca_topic_score_codex":0.000030874722,"about_ca_topic_score_gemma":0.000008889242,"teacher_disagreement_score":0.8428771,"about_ca_system_score_codex":0.00002260874,"about_ca_system_score_gemma":0.000066152425,"threshold_uncertainty_score":0.5975969},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22663492,0.00009800899,0.76054776,0.004996546,0.00058076077,0.00091461174,0.000010437061,0.00028214144,0.0059348],"genre_scores_gemma":[0.96263164,0.000016846874,0.0366396,0.00019807408,0.00007114988,0.000018345721,0.0000011927335,0.000013738283,0.00040941275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984916,0.00002116759,0.00040879034,0.00041987735,0.00035562128,0.00030293636],"domain_scores_gemma":[0.99870324,0.00016494017,0.00015911426,0.00012936651,0.0006949882,0.00014833549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075788976,0.0001817616,0.00022543536,0.0001036136,0.00022248777,0.0002601313,0.0008062795,0.00007336175,0.000009524125],"category_scores_gemma":[0.0010663737,0.00014436111,0.0000745369,0.000345961,0.00016946672,0.00042474715,0.00016598475,0.0002993806,0.00001576645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089598856,0.00017634778,0.00032208877,0.000051112667,0.000021051808,5.3793593e-7,0.007670288,0.0008356509,0.022865985,0.60323817,0.000072713396,0.36465648],"study_design_scores_gemma":[0.00014503572,0.0004712437,0.00021268935,0.00017691018,0.000015489664,0.00000832153,0.0035364213,0.8715588,0.079451546,0.042916276,0.0012063871,0.0003009103],"about_ca_topic_score_codex":0.00002057969,"about_ca_topic_score_gemma":0.000004923166,"teacher_disagreement_score":0.8707231,"about_ca_system_score_codex":0.000029023107,"about_ca_system_score_gemma":0.0000875926,"threshold_uncertainty_score":0.58868754},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010173033,0.000022379627,0.9831963,0.0015565385,0.000535936,0.0012552221,0.0000034760117,0.00020951248,0.0030476116],"genre_scores_gemma":[0.8021566,0.000015157759,0.19711404,0.00013994858,0.00008968475,0.000120426135,0.0000015449926,0.000021432868,0.0003411271],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972799,0.000015718548,0.00078193017,0.000583825,0.0007772198,0.00056143664],"domain_scores_gemma":[0.99617153,0.00027961528,0.00060536375,0.00037996622,0.0023754323,0.00018811804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001208441,0.0002930063,0.00034539288,0.00011630851,0.00023918606,0.0004943446,0.002442492,0.0001213989,0.000011362001],"category_scores_gemma":[0.0037626568,0.00022058144,0.00011755698,0.00087434537,0.00029699728,0.00069811003,0.00047201724,0.00025254107,0.00003550281],"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.00044594257,0.00028950942,0.0005631301,0.00045768128,0.000048722846,0.0000011149698,0.0029468378,0.037162516,0.0060991626,0.7679531,0.0005354869,0.18349677],"study_design_scores_gemma":[0.000112991656,0.00062966376,0.0000110410765,0.00041432015,0.00002065934,0.000005686569,0.0006314941,0.74397933,0.19436891,0.05824236,0.0012632294,0.00032029752],"about_ca_topic_score_codex":0.000012285733,"about_ca_topic_score_gemma":0.000006280997,"teacher_disagreement_score":0.7919836,"about_ca_system_score_codex":0.00006259207,"about_ca_system_score_gemma":0.0005112284,"threshold_uncertainty_score":0.899505},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93122774,0.0000036729982,0.064867586,0.0010442453,0.00024554305,0.0006922199,0.000008373342,0.000017065004,0.0018935493],"genre_scores_gemma":[0.9988965,0.0000041735675,0.0009137315,0.0000672913,0.000018484578,0.000019820514,0.0000035808148,0.0000026044113,0.00007385094],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982087,0.000035664765,0.00064274075,0.0003446848,0.00064538344,0.00012283014],"domain_scores_gemma":[0.9972056,0.0003435013,0.0006523765,0.00020100216,0.001534586,0.00006293353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013866007,0.00011313072,0.00022251505,0.00058325473,0.00014144318,0.00057426665,0.00039293309,0.00004729157,0.000092771355],"category_scores_gemma":[0.0025906141,0.000077128134,0.000052180567,0.0019729887,0.00015013959,0.0012645911,0.00025617125,0.000091692214,0.000042165448],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000093176524,0.000036630627,0.0031057533,0.000030985306,0.000056348217,2.387794e-8,0.00562421,0.0005666408,0.032360718,0.06833507,0.0002392776,0.88955116],"study_design_scores_gemma":[0.000048755286,0.00024704752,0.056653038,0.0001782253,0.000108912405,0.0000016601798,0.008176048,0.26612982,0.48047578,0.1875895,0.00019522115,0.00019596517],"about_ca_topic_score_codex":0.00028367355,"about_ca_topic_score_gemma":0.000015872476,"teacher_disagreement_score":0.8893552,"about_ca_system_score_codex":0.000026890813,"about_ca_system_score_gemma":0.000015416688,"threshold_uncertainty_score":0.55376667},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40167776,0.00009375582,0.5213125,0.008002796,0.0009093176,0.0008825828,0.0000044438007,0.00027354644,0.06684337],"genre_scores_gemma":[0.99001724,0.000008519792,0.009623492,0.000099585464,0.000041761494,0.000027363369,3.3511185e-7,0.000009672705,0.00017204044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977459,0.00003105505,0.0006516049,0.0005585828,0.0006590351,0.00035384233],"domain_scores_gemma":[0.99827725,0.00009817504,0.00034122143,0.00034144404,0.00080319843,0.000138719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001050064,0.00019843134,0.0002389431,0.00016953149,0.0000970234,0.00019236033,0.0016554777,0.000105811014,0.000009144811],"category_scores_gemma":[0.0010120134,0.00015647565,0.00008028276,0.0009046077,0.00020281444,0.00077743595,0.00042959698,0.00038828995,0.000045361347],"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.00002312879,0.00009232801,0.00039663492,0.000014396843,0.000003890278,6.6803466e-7,0.0014023072,0.008201533,0.0007536024,0.97551,0.000069383444,0.013532123],"study_design_scores_gemma":[0.00001954573,0.000042026324,0.000056439236,0.00014951461,0.0000023019563,0.0000030785789,0.00016114634,0.47366345,0.010771419,0.51501507,0.0000070287424,0.00010898658],"about_ca_topic_score_codex":0.000088686655,"about_ca_topic_score_gemma":0.00001454442,"teacher_disagreement_score":0.5883395,"about_ca_system_score_codex":0.00008543726,"about_ca_system_score_gemma":0.00027142587,"threshold_uncertainty_score":0.63808924},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93925697,0.000006396607,0.0036140752,0.01031189,0.00018847334,0.00039054186,0.000020361362,0.000051695224,0.046159614],"genre_scores_gemma":[0.9980231,0.00001678685,0.00091477076,0.00055172876,0.00014633297,0.000027369848,7.292592e-7,0.000009701052,0.00030946126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981562,0.000024570216,0.00044910633,0.00043593562,0.00059122295,0.00034297508],"domain_scores_gemma":[0.9986731,0.00021012271,0.0002016805,0.00019590392,0.0004609256,0.00025826387],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006186504,0.0001800919,0.00037572198,0.00015323654,0.00044068648,0.00033465886,0.0009510801,0.00015393457,0.00109363],"category_scores_gemma":[0.0010388792,0.00013154022,0.00014771054,0.0008159258,0.0006773451,0.00032231776,0.00020214307,0.00034181468,0.0000911337],"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.00007677815,0.00014991981,0.005370265,0.000007983854,0.00010714358,4.3452675e-7,0.011132586,0.000033548687,0.0031903957,0.9626482,0.00015265477,0.017130079],"study_design_scores_gemma":[0.000047278205,0.00007781316,0.0032335594,0.00006140398,0.00032199343,4.031623e-7,0.007928542,0.0656396,0.014136328,0.9075521,0.0006513549,0.0003495715],"about_ca_topic_score_codex":0.0009976836,"about_ca_topic_score_gemma":0.0011247216,"teacher_disagreement_score":0.06560606,"about_ca_system_score_codex":0.000022931872,"about_ca_system_score_gemma":0.000081497696,"threshold_uncertainty_score":0.9998195},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73840326,0.000024318902,0.14108838,0.0026041544,0.0005101093,0.0013823486,0.0000683096,0.0004685542,0.11545056],"genre_scores_gemma":[0.98033303,0.0000073055166,0.01945626,0.00011158878,0.000015695568,0.00002431947,9.2679994e-7,0.000007809233,0.000043043903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982788,0.00003365964,0.0006785993,0.0003202945,0.00040368247,0.00028495374],"domain_scores_gemma":[0.99785084,0.00014228639,0.00076375087,0.0005073694,0.0006875698,0.000048196496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009714449,0.00021232957,0.00030634901,0.00011588903,0.00018741927,0.00011891264,0.0041080914,0.000083360756,0.0001311855],"category_scores_gemma":[0.0003945172,0.00013228199,0.00009957528,0.0004991183,0.0013637954,0.00081838877,0.000997765,0.00031923532,0.00007459661],"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.00004701349,0.00010955737,0.0001220379,0.00002831694,0.000014121637,6.797539e-7,0.011103115,0.000002166002,0.02381014,0.92145133,0.000105228195,0.043206263],"study_design_scores_gemma":[0.000015952823,0.0002109505,0.0011112475,0.00018348501,0.0000075741705,0.00001039746,0.00061042927,0.009709506,0.75313926,0.234818,0.000036178193,0.000147007],"about_ca_topic_score_codex":0.000054681936,"about_ca_topic_score_gemma":0.000005301393,"teacher_disagreement_score":0.7293291,"about_ca_system_score_codex":0.000023251907,"about_ca_system_score_gemma":0.000079098136,"threshold_uncertainty_score":0.76339245},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59099764,0.00004453439,0.3455611,0.0051229573,0.0004566552,0.0014978091,0.000008614946,0.000093673225,0.05621707],"genre_scores_gemma":[0.9965972,0.000021654303,0.002916746,0.00014285969,0.000019455652,0.000033667722,4.9777068e-8,0.000007055424,0.00026134952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979937,0.000052864754,0.00069852656,0.00046565256,0.0005648657,0.00022439481],"domain_scores_gemma":[0.99847996,0.00038259733,0.00036309764,0.0002606678,0.00043673397,0.0000769431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025025494,0.0001476043,0.00021638488,0.00020875294,0.00017857463,0.000109816036,0.0013453455,0.00007830571,0.0002922598],"category_scores_gemma":[0.0023831092,0.00009772028,0.00006256032,0.00097597094,0.0004245247,0.000300816,0.00018735649,0.00020947967,0.00013739544],"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.00008434179,0.00014772051,0.00007067755,0.0000024125397,0.0000022928068,1.7936595e-7,0.00449096,0.000011360462,0.014233768,0.9467888,0.000030193154,0.03413731],"study_design_scores_gemma":[0.000014936348,0.00009091041,0.00021950933,0.000027542836,0.0000042641245,0.0000037030647,0.0032052526,0.0045234174,0.3148779,0.6768993,0.000050781207,0.00008248941],"about_ca_topic_score_codex":0.000023690369,"about_ca_topic_score_gemma":0.0000030139058,"teacher_disagreement_score":0.40559956,"about_ca_system_score_codex":0.000017533497,"about_ca_system_score_gemma":0.000051176557,"threshold_uncertainty_score":0.39849174},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027183334,0.0000090677,0.97271335,0.001836529,0.0008908436,0.0005671081,3.6187146e-7,0.00013904391,0.021125387],"genre_scores_gemma":[0.9876659,0.000007756005,0.009073542,0.00029345823,0.00012609469,0.000055533696,0.0000014473269,0.000018299308,0.0027579544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977155,0.00002227625,0.0006261173,0.00046275154,0.0007334446,0.00043995856],"domain_scores_gemma":[0.9979054,0.00010007942,0.0005235491,0.00031937793,0.0010010551,0.00015059367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000985991,0.00024841764,0.00025870668,0.00015213607,0.0002923829,0.00044350408,0.0016055387,0.000109096,0.000030912244],"category_scores_gemma":[0.0007631306,0.00019308597,0.00014284361,0.0004950477,0.0001664303,0.00062548363,0.00037567265,0.00034588893,0.000083347186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009852436,0.00003183675,0.00015768607,0.00003464258,0.000021558102,1.1773948e-7,0.0012295392,0.14841889,0.0028659247,0.83515114,0.0005020636,0.011488109],"study_design_scores_gemma":[0.00006951249,0.00091218215,0.000029221575,0.00011984934,0.000020425487,0.000002113591,0.00041018368,0.85056454,0.0692981,0.07585861,0.0024806494,0.00023461798],"about_ca_topic_score_codex":0.000020046793,"about_ca_topic_score_gemma":0.0000012827753,"teacher_disagreement_score":0.98494756,"about_ca_system_score_codex":0.00011908141,"about_ca_system_score_gemma":0.00017450062,"threshold_uncertainty_score":0.78738177},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34005982,0.000011610793,0.6353715,0.0006354958,0.00029894052,0.0005287522,0.000024139945,0.00006151824,0.023008201],"genre_scores_gemma":[0.77707034,0.0000037565972,0.2227652,0.000022945815,0.000024405814,0.000015218354,3.0738485e-7,0.00001247672,0.00008533663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982131,0.00003320872,0.0007245677,0.0002680465,0.00052284723,0.00023820908],"domain_scores_gemma":[0.9976492,0.00041523346,0.000536809,0.00019943112,0.0010835433,0.00011578824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009424031,0.0001908857,0.0003634397,0.0000798282,0.000059442955,0.00004749621,0.00061791425,0.00009327655,0.000068305526],"category_scores_gemma":[0.0050047813,0.00013512169,0.000088751935,0.00031005125,0.00031619778,0.00018836568,0.00016084309,0.00022102859,0.000018477615],"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.00012843161,0.00016998845,0.000011860777,0.00007431692,0.000015533513,1.3971844e-7,0.0013779214,0.0019350284,0.006650445,0.9601389,0.000092409275,0.029405024],"study_design_scores_gemma":[0.000023565803,0.00011868569,0.0000106993275,0.00013177135,0.000019982563,9.732895e-7,0.00032472686,0.33049732,0.16756988,0.5012224,0.0000024330468,0.00007761175],"about_ca_topic_score_codex":0.000055759843,"about_ca_topic_score_gemma":0.0000016021476,"teacher_disagreement_score":0.45891654,"about_ca_system_score_codex":0.000034633034,"about_ca_system_score_gemma":0.000104667524,"threshold_uncertainty_score":0.59915525},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59079343,0.00003070483,0.4065244,0.00076448417,0.00006349148,0.00072931405,0.00001654654,0.00002902915,0.0010486197],"genre_scores_gemma":[0.99852395,0.0000023316763,0.0011690272,0.00001888358,0.00010606074,0.00006623197,0.000001444118,0.000013562408,0.000098490535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869365,0.000019008736,0.00053714926,0.00026425192,0.00018586326,0.0003000574],"domain_scores_gemma":[0.9986322,0.00008909795,0.00042445573,0.00016290694,0.0006336998,0.00005766413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005992272,0.00018105935,0.00029045562,0.00009072826,0.0001400503,0.000057020763,0.000614259,0.000060406135,0.000017486576],"category_scores_gemma":[0.000087833316,0.00012706814,0.00015997839,0.0005539078,0.00021312821,0.00016493945,0.00016216772,0.00023521182,0.000002089298],"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.0002010643,0.00014581694,0.0014025605,0.000015802927,0.000039253944,3.5173468e-7,0.0024361538,0.03701398,0.0027560606,0.9141153,0.00061675435,0.041256912],"study_design_scores_gemma":[0.000029600556,0.00004325287,0.00009720571,0.000060211147,0.000027889775,0.0000011196558,0.0009178809,0.63865477,0.0030713605,0.3569996,0.0000033206438,0.000093776485],"about_ca_topic_score_codex":0.0017635368,"about_ca_topic_score_gemma":0.0004235369,"teacher_disagreement_score":0.6016408,"about_ca_system_score_codex":0.000071166585,"about_ca_system_score_gemma":0.0001733816,"threshold_uncertainty_score":0.5181688},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7591919,0.000065011765,0.23515935,0.0018537646,0.0010873174,0.0016434361,0.0000121952935,0.00012377083,0.0008633058],"genre_scores_gemma":[0.9964294,0.000011853505,0.0031705552,0.00003664394,0.00017100407,0.00009704104,0.0000025009838,0.00002253253,0.00005851147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973818,0.00004735233,0.0009136789,0.00088363176,0.0003727732,0.00040073856],"domain_scores_gemma":[0.99775904,0.0002474271,0.000873649,0.00019310623,0.0008485288,0.00007826881],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000817749,0.00036469568,0.00050880184,0.00027397182,0.00023913833,0.0008301467,0.0008983043,0.00025767222,0.0000054397883],"category_scores_gemma":[0.00084220717,0.0002852039,0.00013318672,0.00036629316,0.00024117931,0.0003970032,0.00063250697,0.00053168857,0.000002333737],"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.000104792736,0.00015756581,0.0001478979,0.00018919761,0.00003972555,4.925915e-7,0.0026160134,0.00020523826,0.026419854,0.9289057,0.000016355632,0.04119715],"study_design_scores_gemma":[0.00015192812,0.00053320377,0.00017762136,0.0019476569,0.000048419344,0.000006775447,0.000426728,0.7341913,0.09207726,0.16984673,0.000038323084,0.00055405183],"about_ca_topic_score_codex":0.00007508311,"about_ca_topic_score_gemma":0.00012319974,"teacher_disagreement_score":0.75905895,"about_ca_system_score_codex":0.00011893399,"about_ca_system_score_gemma":0.00010462997,"threshold_uncertainty_score":0.99996},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13853109,0.000011290899,0.85518944,0.0011836198,0.0003053932,0.0005758414,0.0000017814656,0.00007557668,0.0041259923],"genre_scores_gemma":[0.97769004,0.000015562853,0.022141838,0.00006088208,0.000018554647,0.000020907668,4.3861672e-7,0.0000048667257,0.00004689153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886733,0.000008127411,0.00047699673,0.0001341648,0.00035047185,0.00016289024],"domain_scores_gemma":[0.9982347,0.00008725259,0.00049082946,0.00015443648,0.0009733203,0.000059484606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006553527,0.0001108877,0.00015994343,0.000107991145,0.00006630219,0.00014764615,0.0007156919,0.000052012576,0.0000024131086],"category_scores_gemma":[0.0008787372,0.00008853296,0.000045148896,0.00026583084,0.00009424186,0.0010252941,0.00018506279,0.000090708985,0.000008641525],"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.00005606384,0.000026863594,0.00031732366,0.00011540536,0.000012242303,1.827589e-8,0.01207865,0.005980539,0.0067431927,0.9480742,0.00008898383,0.026506491],"study_design_scores_gemma":[0.000077787656,0.00054148794,0.00017317613,0.00021225221,0.00001329692,0.0000019831673,0.003100561,0.5186226,0.37611198,0.100685604,0.00027981988,0.0001794471],"about_ca_topic_score_codex":0.000012262567,"about_ca_topic_score_gemma":6.792297e-7,"teacher_disagreement_score":0.8473886,"about_ca_system_score_codex":0.00003061865,"about_ca_system_score_gemma":0.00007329838,"threshold_uncertainty_score":0.3610269},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97003925,0.000009935707,0.0054548983,0.0029642323,0.0008400021,0.00031468214,0.0000069923153,0.0000358947,0.020334108],"genre_scores_gemma":[0.9994566,0.00001224087,0.00013057563,0.00006445697,0.000106553394,0.000025749547,1.7641325e-7,0.0000071412205,0.00019652801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816424,0.00004374956,0.000724186,0.00046932948,0.00038359815,0.00021487499],"domain_scores_gemma":[0.99855566,0.00044408604,0.00040446984,0.0002486724,0.0002696657,0.00007743285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022639262,0.00014125102,0.0002480087,0.00023335138,0.0002887771,0.00023508673,0.00094161415,0.00007954869,0.00033364873],"category_scores_gemma":[0.0019489513,0.00010277527,0.000073702045,0.0005676493,0.0004958289,0.00031061884,0.00018644035,0.00022798307,0.00029052218],"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.000028559538,0.000060874594,0.0010563693,0.0000026932792,0.0000015896156,1.7826173e-8,0.0003870479,0.00023620584,0.0033379032,0.9640715,0.00007502282,0.030742232],"study_design_scores_gemma":[0.000037392594,0.00007809748,0.0011012042,0.000037625352,0.0000043414193,0.0000025049212,0.0018471684,0.028569553,0.039799236,0.9275697,0.0008269593,0.00012624703],"about_ca_topic_score_codex":0.000047213758,"about_ca_topic_score_gemma":0.000019029056,"teacher_disagreement_score":0.036501814,"about_ca_system_score_codex":0.000041828735,"about_ca_system_score_gemma":0.000047623173,"threshold_uncertainty_score":0.41910538},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6673876,0.000058019246,0.27991825,0.027724883,0.0025837019,0.0048868707,0.00002378192,0.00048295633,0.016933944],"genre_scores_gemma":[0.9820925,0.00000621755,0.016857734,0.00031706417,0.00015006556,0.00023083843,7.821885e-7,0.000026336103,0.000318474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9970254,0.000030339395,0.00090826914,0.00076325797,0.00055629696,0.000716465],"domain_scores_gemma":[0.9977096,0.0005109839,0.0005053597,0.0004423242,0.0006951626,0.00013660842],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00087507395,0.00035523655,0.0004301274,0.00033708932,0.00023891682,0.0004988392,0.0028931547,0.0001600284,0.00020530436],"category_scores_gemma":[0.0010478742,0.00028638457,0.00021795444,0.0011046412,0.00031449445,0.0008992278,0.00027119904,0.00037388783,0.0003280713],"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.000060258033,0.00029138377,0.0007683773,0.00008493216,0.000014087692,7.9410387e-7,0.0021517153,0.00064764894,0.14134806,0.79015094,0.001710994,0.06277083],"study_design_scores_gemma":[0.000021804333,0.000154426,0.00012506457,0.00024514543,0.0000046453183,0.0000011832835,0.00030476955,0.42956138,0.43583825,0.13342936,0.0000857057,0.00022825283],"about_ca_topic_score_codex":0.00013589027,"about_ca_topic_score_gemma":0.000016802976,"teacher_disagreement_score":0.65672153,"about_ca_system_score_codex":0.00013233491,"about_ca_system_score_gemma":0.00017172257,"threshold_uncertainty_score":0.9999588},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44958228,0.00009703535,0.520464,0.012337009,0.0007257387,0.0005123089,0.0000074669015,0.00027013355,0.016004039],"genre_scores_gemma":[0.9869663,0.0000154545,0.012316693,0.0003475372,0.000087537635,0.000018968547,0.0000016568872,0.000010076717,0.00023575421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983822,0.000030677416,0.00033502877,0.00051368156,0.00044425935,0.0002941375],"domain_scores_gemma":[0.9983206,0.00007286285,0.0002608247,0.00027475326,0.0009972611,0.00007369516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035096952,0.0001852876,0.00019712884,0.00006645446,0.00029674007,0.0002822063,0.0007888458,0.00007868574,0.000033018765],"category_scores_gemma":[0.0002057618,0.00013237275,0.000063916035,0.0007672808,0.00010664923,0.00039779002,0.00018023209,0.00028421724,0.000039890692],"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.00006469123,0.00016578176,0.00089815893,0.000036386373,0.000029786792,0.0000041087733,0.0033443563,0.001936255,0.28945512,0.657002,0.00066071225,0.046402648],"study_design_scores_gemma":[0.0000230404,0.00014881516,0.000087470675,0.00018485401,0.000010062671,0.0000112182415,0.00018276964,0.17037435,0.8148531,0.013867739,0.00009325913,0.00016337914],"about_ca_topic_score_codex":0.000031967258,"about_ca_topic_score_gemma":0.000015870257,"teacher_disagreement_score":0.64313424,"about_ca_system_score_codex":0.00003987433,"about_ca_system_score_gemma":0.00027836254,"threshold_uncertainty_score":0.5398004},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5082581,0.000020560643,0.48027298,0.006065208,0.00022391757,0.00031376333,0.0000061416836,0.00011461677,0.0047247284],"genre_scores_gemma":[0.98944414,0.000010752663,0.010182542,0.0001620165,0.000055273777,0.000018657425,0.0000010914836,0.000010295908,0.00011524716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972534,0.00009139125,0.00080156355,0.0006991396,0.0006265261,0.00052796124],"domain_scores_gemma":[0.99802345,0.0005008983,0.00040980458,0.00046193693,0.00048171918,0.00012220549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033246512,0.00025422755,0.00043118943,0.00048855355,0.00044313056,0.00039943997,0.0016575445,0.00013582838,0.000043507083],"category_scores_gemma":[0.0008472298,0.00020933765,0.00018730396,0.0016759731,0.00019925143,0.0005330902,0.00044186437,0.00049690274,0.000057562545],"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.00018011098,0.00031252074,0.022397012,0.00017431403,0.000100497324,0.000008376835,0.014911304,0.005340471,0.013151449,0.8644441,0.00006289391,0.078916974],"study_design_scores_gemma":[0.0000642721,0.00019798019,0.0012026364,0.00047335893,0.00006534081,0.000011688833,0.0013038126,0.7828831,0.14322168,0.070096515,0.000036073026,0.00044352197],"about_ca_topic_score_codex":0.0015519321,"about_ca_topic_score_gemma":0.0006043301,"teacher_disagreement_score":0.7943476,"about_ca_system_score_codex":0.00009956063,"about_ca_system_score_gemma":0.000075336815,"threshold_uncertainty_score":0.8536542},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9880039,0.00007981068,0.0025323655,0.0029385076,0.00033270556,0.00029082474,0.000003909969,0.00005825014,0.005759721],"genre_scores_gemma":[0.99951917,0.00010756813,0.00013288647,0.00008625497,0.000049307502,0.00002541115,6.299315e-7,0.000008722004,0.00007004819],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988279,0.000017690905,0.00040547934,0.00022081094,0.0002875761,0.00024056004],"domain_scores_gemma":[0.9992768,0.000090742265,0.00006706189,0.00018256248,0.00033658263,0.000046233952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003371298,0.00013809689,0.00016780604,0.000064552405,0.0001558158,0.00017322759,0.00043834012,0.00006462488,0.00006547904],"category_scores_gemma":[0.00051228766,0.00009203877,0.00008047805,0.0007419736,0.000114469214,0.00016336222,0.0000707237,0.0002884258,0.000028910234],"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.000101367164,0.00010842412,0.0034931037,0.00011608927,0.000059893147,0.0000014794045,0.005299904,0.04411661,0.26909226,0.55627793,0.0005556907,0.12077726],"study_design_scores_gemma":[0.000013209559,0.000026552736,0.0012786789,0.00008421397,0.000011609265,0.0000015673274,0.0019302367,0.104288824,0.8231737,0.068811335,0.00024628648,0.00013375714],"about_ca_topic_score_codex":0.000023219938,"about_ca_topic_score_gemma":0.00037056638,"teacher_disagreement_score":0.55408144,"about_ca_system_score_codex":0.000066445864,"about_ca_system_score_gemma":0.000051540996,"threshold_uncertainty_score":0.3753232},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95110923,0.000016275,0.043417644,0.00083911326,0.0005362923,0.00039734872,0.000008507728,0.00019206473,0.003483544],"genre_scores_gemma":[0.9959262,0.000012968615,0.0037240079,0.000085567444,0.0001021907,0.000032379925,0.0000015322332,0.000013214433,0.00010193972],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99787146,0.000036536698,0.000537347,0.0006729862,0.00048694544,0.00039474067],"domain_scores_gemma":[0.9981994,0.00005138626,0.00050290365,0.00051030936,0.0006146656,0.00012136085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031169545,0.00025114126,0.00032679058,0.000092944356,0.00030905544,0.00086532964,0.0024916905,0.0000975603,0.00014360892],"category_scores_gemma":[0.00009572325,0.0001863416,0.0001373141,0.0005288574,0.00023251658,0.001471417,0.00034454148,0.00023222255,0.00016312186],"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.000047944224,0.00020466157,0.007656783,0.000056173776,0.000037973183,7.78566e-7,0.0063726194,0.00031645945,0.46828038,0.42757827,0.00024610868,0.08920183],"study_design_scores_gemma":[0.000028776476,0.00015090153,0.004804518,0.00024032904,0.00001017207,0.000004986158,0.0039768573,0.45407325,0.5288452,0.0074328585,0.00006652668,0.00036559254],"about_ca_topic_score_codex":0.0013273036,"about_ca_topic_score_gemma":0.000042145413,"teacher_disagreement_score":0.4537568,"about_ca_system_score_codex":0.00005250744,"about_ca_system_score_gemma":0.000043775322,"threshold_uncertainty_score":0.8344394},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4823725,0.000014426749,0.4982082,0.0061339466,0.0011106457,0.0007535176,0.000011320759,0.00027208426,0.011123352],"genre_scores_gemma":[0.98947537,0.000003111574,0.009526094,0.0003623551,0.00013850899,0.000029223133,2.5194572e-7,0.000024115569,0.00044097618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99673593,0.00011229088,0.00083724817,0.00081993156,0.0008834335,0.0006111724],"domain_scores_gemma":[0.99696624,0.00035546892,0.00041526495,0.00071852526,0.0012900366,0.0002544661],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017071516,0.0003640439,0.00037220292,0.00032142902,0.00044701927,0.00049758755,0.003115389,0.00015083648,0.00009780172],"category_scores_gemma":[0.0023616888,0.00029003833,0.00018636842,0.0015479778,0.00032825183,0.00061781355,0.0005820639,0.0004358337,0.00050401373],"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.00029450888,0.0001726308,0.00014329348,0.000015111422,0.000018642431,4.4332032e-7,0.0013287679,0.0025180492,0.16663426,0.68541306,0.00028633422,0.14317489],"study_design_scores_gemma":[0.00002006552,0.0006010137,0.00023055475,0.00026176192,0.000020387346,0.000008942772,0.0012422751,0.22380613,0.67748624,0.095133595,0.0007369466,0.00045207486],"about_ca_topic_score_codex":0.00009060251,"about_ca_topic_score_gemma":0.00003597403,"teacher_disagreement_score":0.59027946,"about_ca_system_score_codex":0.00011582892,"about_ca_system_score_gemma":0.0002363013,"threshold_uncertainty_score":0.9999552},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057640605,0.000034499313,0.92651176,0.0036096072,0.00072507834,0.0004769423,0.000007153717,0.00012489657,0.010869461],"genre_scores_gemma":[0.98173237,0.000011250645,0.017802391,0.00025523928,0.00005774564,0.000022012324,0.0000010263685,0.0000055063892,0.00011247629],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99878025,0.000011067286,0.00041404364,0.0002565244,0.00030762207,0.00023052118],"domain_scores_gemma":[0.99792993,0.00010404227,0.00032898114,0.00021510094,0.0013716974,0.000050255218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038568955,0.00013346235,0.00015932403,0.00008601953,0.00025037484,0.00037559812,0.0006661231,0.00006880932,0.000008394706],"category_scores_gemma":[0.00060642435,0.000109814806,0.00010934996,0.00052893604,0.000085678104,0.0007944549,0.00016212102,0.00014678262,0.000026557262],"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.000021468459,0.00002636294,0.000016281785,0.000024331526,0.000007126972,1.0332956e-7,0.0012616508,0.00019856042,0.015305354,0.80253905,0.00006955596,0.18053013],"study_design_scores_gemma":[0.00002315361,0.00007434205,0.000027918451,0.00019302662,0.0000070632964,0.000004956626,0.000912768,0.17910065,0.71227604,0.10699953,0.00026354275,0.00011702971],"about_ca_topic_score_codex":0.000013037642,"about_ca_topic_score_gemma":0.000004210949,"teacher_disagreement_score":0.92409176,"about_ca_system_score_codex":0.000040518265,"about_ca_system_score_gemma":0.00013966441,"threshold_uncertainty_score":0.44781178},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94735557,0.000010153531,0.050023273,0.00048765916,0.000063044725,0.0005120739,0.000014669655,0.000058183276,0.0014753625],"genre_scores_gemma":[0.9988715,0.00002981875,0.0009444089,0.000049685466,0.000017525595,0.000058966154,0.0000020789928,0.000014637849,0.0000113844235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915564,0.00000365684,0.00029475964,0.00018229337,0.00014581394,0.00021783717],"domain_scores_gemma":[0.99955165,0.000055694094,0.00003176135,0.000073372554,0.00024860108,0.00003893371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003110924,0.00012121707,0.00014860612,0.00011071498,0.000069372036,0.000046315225,0.000183285,0.00005664965,0.000013325918],"category_scores_gemma":[0.000043263753,0.00009617599,0.00003071012,0.00032648895,0.000094430325,0.00015265314,0.000008444047,0.000183415,0.0000023780483],"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.00013209622,0.00012589918,0.007226486,0.0004374307,0.000027233717,7.279546e-8,0.0035333175,0.013165322,0.04134823,0.9076308,0.000004737571,0.02636836],"study_design_scores_gemma":[0.00034132123,0.00055976113,0.007305417,0.00075689855,0.000039875344,0.0000017381915,0.0037340012,0.6057958,0.3400521,0.040799715,0.00016105943,0.00045227984],"about_ca_topic_score_codex":0.000015926325,"about_ca_topic_score_gemma":0.00016940694,"teacher_disagreement_score":0.8668311,"about_ca_system_score_codex":0.000020661071,"about_ca_system_score_gemma":0.00002982748,"threshold_uncertainty_score":0.3921943},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86381674,0.000029867395,0.025600363,0.0013473649,0.0007661207,0.00091714325,0.00007927057,0.000072762436,0.107370384],"genre_scores_gemma":[0.9993944,0.0000028843558,0.00025283644,0.000057691643,0.00011181378,0.00001744578,7.4467675e-7,0.000012439809,0.00014971953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875486,0.000031034408,0.00043205218,0.00022817156,0.00032322324,0.0002306695],"domain_scores_gemma":[0.9985388,0.00010365267,0.00040554142,0.0001627938,0.000685308,0.000103917424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006546039,0.00017080123,0.00029754077,0.000056271067,0.00008800113,0.000056257144,0.00063945435,0.00005712496,0.00012836857],"category_scores_gemma":[0.00011358566,0.00012803498,0.00015473377,0.00027064374,0.0002746053,0.00013735649,0.00008873665,0.00020159288,0.000028876264],"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.00008017062,0.00016107241,0.005647709,0.000016134903,0.000041501535,4.467627e-8,0.001457792,0.00007506021,0.0033925716,0.9789415,0.000060751736,0.010125712],"study_design_scores_gemma":[0.00010419889,0.0002516839,0.00053348724,0.00015797238,0.000044500288,3.2471075e-7,0.003865175,0.017398056,0.115009815,0.86231446,0.00008693205,0.0002333975],"about_ca_topic_score_codex":0.000082215694,"about_ca_topic_score_gemma":0.0000018152587,"teacher_disagreement_score":0.1355777,"about_ca_system_score_codex":0.000023227523,"about_ca_system_score_gemma":0.00014145291,"threshold_uncertainty_score":0.5221115},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6821634,0.000051678937,0.28832746,0.004196588,0.001030259,0.0005544879,0.0000075636167,0.00016297566,0.0235056],"genre_scores_gemma":[0.97952783,0.0000060932903,0.020302651,0.00005251898,0.000035725945,0.0000101281,0.0000010046356,0.00000758482,0.00005646035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982487,0.000031950018,0.000512542,0.00040733747,0.00055377843,0.00024567838],"domain_scores_gemma":[0.9981665,0.00012481622,0.0005020026,0.00037436772,0.00072671357,0.0001055996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009358811,0.0001703651,0.00024356817,0.00013932279,0.000091339476,0.0001238778,0.0016600931,0.0000694512,0.000021012884],"category_scores_gemma":[0.00065304025,0.00012446979,0.00009405311,0.0006010922,0.00023973243,0.00016780783,0.00035553845,0.00023079767,0.00004351112],"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.00011314485,0.0002629792,0.0017916053,0.00006091316,0.000025417507,3.1292348e-7,0.0036500972,0.007772421,0.044904243,0.79401577,0.00015639482,0.1472467],"study_design_scores_gemma":[0.000035580586,0.00020104623,0.0003123296,0.000114671966,0.000010381383,0.000003686107,0.000383082,0.76912755,0.20973013,0.019865999,0.000061496554,0.00015401571],"about_ca_topic_score_codex":0.00009363394,"about_ca_topic_score_gemma":0.0000040124287,"teacher_disagreement_score":0.7741498,"about_ca_system_score_codex":0.000037377285,"about_ca_system_score_gemma":0.00009373601,"threshold_uncertainty_score":0.50757307},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98328686,0.000042373224,0.011064473,0.0031095655,0.00031823988,0.0004336619,0.0000029853238,0.00007764518,0.0016642048],"genre_scores_gemma":[0.99546844,0.000023205994,0.0041919537,0.00010333816,0.00007124467,0.00002620436,1.8861698e-7,0.000012170325,0.0001032371],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983947,0.000041152,0.0004223469,0.0004412246,0.0004197713,0.00028079312],"domain_scores_gemma":[0.9986223,0.00010985451,0.0003458271,0.00029631626,0.00052961725,0.00009608146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072950526,0.00018264027,0.00021448672,0.00013859419,0.00037323716,0.0001523425,0.0014320521,0.000087596345,0.0000086472055],"category_scores_gemma":[0.0009097678,0.00012083997,0.00006509927,0.00068288395,0.00018876672,0.00023011523,0.0005853584,0.0008973835,0.000012374889],"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.00010962082,0.00010284092,0.004119852,0.00018313191,0.000016161095,2.5017098e-7,0.005161127,0.000619045,0.54328036,0.2842499,0.0000028801805,0.16215482],"study_design_scores_gemma":[0.000041394753,0.0002772726,0.012372438,0.00011505258,0.000012374248,0.00002976345,0.0005416581,0.46206456,0.515562,0.008574005,0.0001694413,0.00024001532],"about_ca_topic_score_codex":0.00035705042,"about_ca_topic_score_gemma":0.00009037161,"teacher_disagreement_score":0.46144554,"about_ca_system_score_codex":0.000018112518,"about_ca_system_score_gemma":0.000053252512,"threshold_uncertainty_score":0.4927711},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9837218,0.000045677687,0.00030723284,0.0030318543,0.0001857079,0.0008625699,0.0000022469892,0.00004811009,0.011794815],"genre_scores_gemma":[0.999221,0.00002803429,0.00040970408,0.000050128812,0.000070070026,0.000017840028,0.0000014919138,0.000015800857,0.00018588171],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99831694,0.000025289493,0.00055546453,0.00030711063,0.0005400811,0.00025512016],"domain_scores_gemma":[0.99839675,0.00009669524,0.00048645225,0.00025004215,0.00068356335,0.000086466476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004909874,0.00018914466,0.00029832596,0.00007223041,0.00019276442,0.00016019275,0.00046386247,0.00006469483,0.00059925136],"category_scores_gemma":[0.0011216911,0.00010945856,0.00014046155,0.00036464958,0.0005313411,0.00039723772,0.0002532403,0.00036744753,0.000016978005],"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.00040980804,0.0022662443,0.15413162,0.0020646134,0.0002915479,0.000002197824,0.005255118,0.0005532442,0.5503951,0.19361338,0.0004434433,0.090573676],"study_design_scores_gemma":[0.00017951326,0.0010944403,0.0418596,0.002511052,0.00037803614,0.000006767902,0.018427044,0.30529907,0.57364666,0.05608127,0.000106169435,0.0004103741],"about_ca_topic_score_codex":0.00039496383,"about_ca_topic_score_gemma":0.0000028826364,"teacher_disagreement_score":0.30474585,"about_ca_system_score_codex":0.0000779147,"about_ca_system_score_gemma":0.00016646777,"threshold_uncertainty_score":0.6561382},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18650822,0.000008956674,0.75613725,0.0030566656,0.0008507403,0.001352056,0.000010064482,0.0001324087,0.05194363],"genre_scores_gemma":[0.99391645,0.000012487829,0.005539654,0.00014075321,0.000017554952,0.000038305127,3.721628e-7,0.000008461903,0.00032598583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99826133,0.000028638713,0.0005956435,0.00032820817,0.00050384505,0.00028236173],"domain_scores_gemma":[0.99805975,0.00008896946,0.00044613777,0.00037317394,0.00096488686,0.00006706784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074001896,0.0001766907,0.0001928909,0.00013174812,0.0001948449,0.0001098478,0.0023595537,0.000053899374,0.00006200723],"category_scores_gemma":[0.0005916113,0.00010793279,0.00012456505,0.0006113436,0.00024925996,0.000365405,0.00056395534,0.00025811387,0.00010857425],"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.00012741295,0.00024365683,0.00056590734,0.00009835433,0.00007011541,3.2173608e-7,0.032726455,0.001437542,0.101253144,0.6912452,0.0002044294,0.17202748],"study_design_scores_gemma":[0.00002830307,0.0004660663,0.0007623904,0.00048783515,0.000018650331,0.0000034311938,0.0025532215,0.07005692,0.81681734,0.10843803,0.00013009759,0.00023773308],"about_ca_topic_score_codex":0.00006263695,"about_ca_topic_score_gemma":0.0000065444083,"teacher_disagreement_score":0.8074082,"about_ca_system_score_codex":0.000030769297,"about_ca_system_score_gemma":0.00006437275,"threshold_uncertainty_score":0.44013715},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6705332,0.000092832146,0.24611768,0.041302063,0.00074124464,0.0019848298,0.00015409538,0.00021058213,0.038863502],"genre_scores_gemma":[0.9844996,0.00006305668,0.009699976,0.00014103383,0.000056321613,0.000110130626,0.0000040312702,0.000013862328,0.0054120254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99763787,0.000047709076,0.0008691257,0.00063081074,0.0005883765,0.00022608189],"domain_scores_gemma":[0.9954697,0.0016053802,0.0005138191,0.0004100285,0.0018857309,0.000115363786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015586497,0.00017597876,0.0002689517,0.00014251082,0.0007526469,0.0003386968,0.00083562516,0.00009674935,0.00036656993],"category_scores_gemma":[0.008235646,0.00012602395,0.000155127,0.001012239,0.00041672436,0.00023645266,0.0002431035,0.0002083879,0.00013197215],"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.000054899774,0.00011811917,0.000034121404,0.000005304458,0.0000129900145,1.10505816e-7,0.0011004478,0.0001542613,0.12153014,0.7550879,0.000884487,0.12101721],"study_design_scores_gemma":[0.000041117622,0.000079065656,0.00023430403,0.0001376479,0.000031391046,0.00001507072,0.01203558,0.08341734,0.21575564,0.68416226,0.003894957,0.00019561031],"about_ca_topic_score_codex":0.000011204071,"about_ca_topic_score_gemma":0.000030843396,"teacher_disagreement_score":0.3139664,"about_ca_system_score_codex":0.000041842817,"about_ca_system_score_gemma":0.00012473247,"threshold_uncertainty_score":0.98594326},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45422813,0.00012659084,0.5224752,0.009985635,0.00053886976,0.0007715844,0.000017723478,0.00030995326,0.011546326],"genre_scores_gemma":[0.9868344,0.0000040959508,0.012538113,0.0003569946,0.00006233095,0.000049818736,0.0000020594398,0.000011163989,0.00014100308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846596,0.000030373492,0.0004493263,0.00043546376,0.00029518097,0.00032370535],"domain_scores_gemma":[0.9985828,0.000317818,0.00029276806,0.00022526272,0.00047001036,0.000111362264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042189844,0.0002166825,0.00020746695,0.0001704145,0.00045667327,0.00048644198,0.0010306203,0.00009229673,0.000056019202],"category_scores_gemma":[0.00018713725,0.0001695533,0.00005921011,0.00040929264,0.00016496005,0.0004488924,0.0002061136,0.0003026935,0.000083490384],"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.00001592438,0.0001388401,0.0045846035,0.00008903692,0.000027753596,5.3685784e-7,0.0037657716,0.0064438484,0.056018867,0.89356834,0.0011790715,0.034167416],"study_design_scores_gemma":[0.000041828425,0.00012470377,0.0013794359,0.00036862152,0.000009643745,0.0000042322213,0.0005151574,0.85365075,0.07806844,0.06546268,0.000098154844,0.0002763272],"about_ca_topic_score_codex":0.000081104445,"about_ca_topic_score_gemma":0.000012309327,"teacher_disagreement_score":0.8472069,"about_ca_system_score_codex":0.000034281344,"about_ca_system_score_gemma":0.00011678785,"threshold_uncertainty_score":0.6914183},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3540903,0.0000984738,0.31331673,0.0044728625,0.0014764265,0.003292035,0.0000034059276,0.00041722384,0.32283252],"genre_scores_gemma":[0.98858416,0.000003760148,0.01074178,0.00017802068,0.00007376444,0.00012441912,4.4971745e-7,0.000012796338,0.00028082397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99743426,0.000034622244,0.0005486646,0.0007485004,0.00066124863,0.00057272834],"domain_scores_gemma":[0.9982911,0.000057405075,0.00030318805,0.00034041103,0.00076690345,0.00024102151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012002263,0.00028512866,0.0003533948,0.00019735472,0.00012288315,0.00034399139,0.0025372019,0.0001180061,0.000004757249],"category_scores_gemma":[0.00095190346,0.00019857154,0.00011598371,0.0012375455,0.00016291418,0.00045821496,0.00084956095,0.00037769254,0.0001109474],"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.000059606642,0.00049596507,0.0017180039,0.000027970924,0.000009328275,9.855861e-7,0.007996157,0.00009633578,0.0015219923,0.92749035,0.0000766847,0.0605066],"study_design_scores_gemma":[0.0001504587,0.0010696962,0.0011143745,0.0005093674,0.000019492581,0.000022105261,0.009168935,0.15545502,0.116750136,0.714661,0.0002491351,0.0008302534],"about_ca_topic_score_codex":0.00010533125,"about_ca_topic_score_gemma":0.000044382406,"teacher_disagreement_score":0.6344939,"about_ca_system_score_codex":0.00015965385,"about_ca_system_score_gemma":0.0001851523,"threshold_uncertainty_score":0.8097512},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012409392,0.000048594582,0.9778567,0.003849672,0.0013235665,0.0011227294,0.00004055525,0.00014578318,0.0032030346],"genre_scores_gemma":[0.74357885,0.00005196902,0.25493506,0.00022915845,0.00030515066,0.00024497506,0.0000033573535,0.00002990152,0.00062158966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99624014,0.000025737245,0.0010362953,0.0013451119,0.00069927686,0.0006534617],"domain_scores_gemma":[0.9961873,0.00016222124,0.001105248,0.001171963,0.0012180797,0.00015515226],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011977932,0.0005105379,0.00067591784,0.00016345056,0.0006116684,0.001222425,0.006146485,0.0004221719,0.000011262105],"category_scores_gemma":[0.0011754594,0.00040659352,0.0003343269,0.00013288521,0.00027911295,0.0004067091,0.0033307334,0.0010280877,0.0000140230695],"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.000038799262,0.000121353674,0.000028669952,0.00022553018,0.000041032057,3.1497007e-7,0.0022625427,0.06282789,0.009158833,0.89046365,0.00014926805,0.034682103],"study_design_scores_gemma":[0.000019130877,0.000037241523,0.0000020737823,0.00034442137,0.00001787257,0.0000012042849,0.000017605851,0.5471921,0.02145899,0.43065548,0.000016081693,0.00023780152],"about_ca_topic_score_codex":0.00010773285,"about_ca_topic_score_gemma":0.000026842104,"teacher_disagreement_score":0.73116946,"about_ca_system_score_codex":0.00010274885,"about_ca_system_score_gemma":0.000663186,"threshold_uncertainty_score":0.9998386},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2265878,0.00020762056,0.43988582,0.010017466,0.0015669885,0.005430339,0.000038580194,0.00069444685,0.31557092],"genre_scores_gemma":[0.9922445,0.0003989407,0.006745455,0.000078343604,0.00006965331,0.0000975686,3.57786e-7,0.000019106785,0.00034607612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9971619,0.000056002606,0.0009455652,0.0005864042,0.0007703482,0.0004797534],"domain_scores_gemma":[0.9967962,0.00031136745,0.0005919606,0.00080414367,0.0013853476,0.00011100127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012258895,0.00026490106,0.0003308285,0.00018356534,0.00035081457,0.00014173346,0.0046350528,0.000103635764,0.00045520952],"category_scores_gemma":[0.00047001345,0.00017333159,0.00016194364,0.0014571667,0.00095008715,0.00036499492,0.0007707053,0.0003849118,0.00032675138],"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.000037433274,0.00018974526,0.00017215947,0.0000262773,0.000017407774,3.0149332e-7,0.0035179576,0.000022884573,0.037770826,0.79375535,0.000074669326,0.164415],"study_design_scores_gemma":[0.000008374635,0.00015904498,0.00026856142,0.00010345271,0.000017142449,0.0000049513933,0.0010396907,0.021777306,0.7303827,0.24585634,0.00019457535,0.00018789014],"about_ca_topic_score_codex":0.00023376974,"about_ca_topic_score_gemma":0.000010798685,"teacher_disagreement_score":0.7656567,"about_ca_system_score_codex":0.00006028342,"about_ca_system_score_gemma":0.00016874539,"threshold_uncertainty_score":0.86131585},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016476236,0.000011255723,0.93631244,0.0010414602,0.00045973604,0.00044070967,0.000003259435,0.00013486722,0.059948646],"genre_scores_gemma":[0.8268186,0.000045542223,0.17233098,0.0001370033,0.000043138243,0.000025711106,5.1263794e-7,0.000016257358,0.0005822679],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997757,0.00003709632,0.00061144267,0.0005136392,0.0007129181,0.00036789547],"domain_scores_gemma":[0.99773675,0.000090976435,0.0003743731,0.00044832932,0.0012122148,0.00013734886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000702048,0.00020710172,0.00023715959,0.0002149229,0.00020218712,0.00022427272,0.002748182,0.00008249821,0.00056491507],"category_scores_gemma":[0.0011721766,0.00015760941,0.00009771439,0.0010975214,0.00028341016,0.000469428,0.0005195897,0.00028193483,0.00017908019],"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.00003085946,0.00018143698,0.0000915838,0.000025127407,0.00001329502,9.35389e-7,0.0010920776,0.0016080294,0.00081050367,0.9676749,0.00015518264,0.028316053],"study_design_scores_gemma":[0.000025767898,0.00015656896,0.00011219274,0.00007376375,0.000009086257,0.000005354715,0.00015073891,0.79046035,0.117667295,0.09110788,0.000036037392,0.00019495716],"about_ca_topic_score_codex":0.0000341452,"about_ca_topic_score_gemma":0.0000015702461,"teacher_disagreement_score":0.876567,"about_ca_system_score_codex":0.000039354167,"about_ca_system_score_gemma":0.00011975809,"threshold_uncertainty_score":0.6427125},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7102395,0.00008831095,0.12690634,0.03333016,0.0024494466,0.0036882258,0.00015514623,0.0003099612,0.122832865],"genre_scores_gemma":[0.99561286,0.00012114937,0.0030580028,0.00020990253,0.00007287172,0.000057760866,0.0000014926151,0.00001751135,0.00084847666],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99715924,0.000054243075,0.0008200888,0.0006202602,0.0010431506,0.00030298566],"domain_scores_gemma":[0.99649864,0.0005140081,0.0005733154,0.00027598094,0.002023984,0.000114059585],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014609066,0.00021270399,0.00027045334,0.00023400663,0.0003073452,0.00030291826,0.001026483,0.00010489253,0.0025870698],"category_scores_gemma":[0.004752047,0.00014534405,0.00008152737,0.0008656463,0.00044904804,0.0016901117,0.00021022362,0.0003019008,0.00042098362],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054091285,0.00038174083,0.0022495699,0.000052421816,0.000041205043,6.0258157e-7,0.03112664,0.000021497473,0.017438142,0.115794696,0.0027193686,0.8296332],"study_design_scores_gemma":[0.000061559316,0.00042190778,0.0018012611,0.000093339266,0.000011363541,0.000002557061,0.013104387,0.024836434,0.31950304,0.6378586,0.0020258003,0.0002797013],"about_ca_topic_score_codex":0.00007871849,"about_ca_topic_score_gemma":0.000037966398,"teacher_disagreement_score":0.8293535,"about_ca_system_score_codex":0.000043779346,"about_ca_system_score_gemma":0.000074525575,"threshold_uncertainty_score":0.9983247},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9871877,0.000039168368,0.0007618819,0.00031821307,0.0014840651,0.000378412,0.000056205336,0.00011650113,0.00965786],"genre_scores_gemma":[0.99945277,0.000008840355,0.00020343665,0.000033288583,0.00019136269,0.000030930354,0.000002226192,0.000021727337,0.000055402717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99847996,0.000020949728,0.00042824604,0.00035170236,0.00041039073,0.00030873605],"domain_scores_gemma":[0.9988317,0.00010108118,0.00007304575,0.00020036423,0.00067009946,0.00012369163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022313766,0.00021654804,0.00028826835,0.000086521286,0.000119180535,0.00012363994,0.00056194764,0.00010119201,0.0001700288],"category_scores_gemma":[0.00035703328,0.00017834017,0.00010621811,0.00060449477,0.00017745442,0.00006632999,0.00012806205,0.00027510265,0.00012947594],"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.00015200436,0.00013223369,0.00013853276,0.00009937665,0.00006514175,0.0000016716873,0.0034302452,0.0037927555,0.29396722,0.6911204,0.00021349185,0.006886934],"study_design_scores_gemma":[0.000043821037,0.000068032496,0.00009753028,0.0003326998,0.000017166907,0.000003431503,0.0045440816,0.013863939,0.9102246,0.070550635,0.000051819123,0.00020223498],"about_ca_topic_score_codex":0.00003764513,"about_ca_topic_score_gemma":0.000011660084,"teacher_disagreement_score":0.62056977,"about_ca_system_score_codex":0.000049660077,"about_ca_system_score_gemma":0.0001027262,"threshold_uncertainty_score":0.7272501},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2765002,0.0001743715,0.69839627,0.000939096,0.0005598369,0.00047925694,0.0000044200156,0.00020961076,0.022736922],"genre_scores_gemma":[0.9894584,0.000012697234,0.010159137,0.00016086252,0.00004819849,0.000021367421,7.964019e-7,0.0000076131837,0.00013095177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987925,0.000037090977,0.0003433317,0.00035862823,0.00024956054,0.00021887753],"domain_scores_gemma":[0.99909663,0.00011364586,0.00025733357,0.00019460444,0.0002727063,0.000065063294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008538896,0.00015721892,0.0001468967,0.00011824572,0.00026485897,0.00015493932,0.00086677977,0.000075009666,0.000037622056],"category_scores_gemma":[0.0002544848,0.00012014704,0.000041339717,0.00029045934,0.00013124365,0.00048191624,0.00018593082,0.00020332875,0.000019882216],"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.000041765717,0.000045445682,0.0006595783,0.000017519727,0.000012131119,4.7356642e-7,0.007821449,0.0000448456,0.017789502,0.9299949,0.00010598964,0.0434664],"study_design_scores_gemma":[0.000027067385,0.00018971672,0.0005865553,0.00021436652,0.000013491088,0.000009804214,0.0005668197,0.13267688,0.43363827,0.43180355,0.00003920222,0.00023426906],"about_ca_topic_score_codex":0.000022944309,"about_ca_topic_score_gemma":0.000002624019,"teacher_disagreement_score":0.71295816,"about_ca_system_score_codex":0.000016579543,"about_ca_system_score_gemma":0.000045640372,"threshold_uncertainty_score":0.48994538},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018935987,0.000030403264,0.9877954,0.002177425,0.00020622792,0.00047655407,0.000011631411,0.0000629869,0.0073457346],"genre_scores_gemma":[0.24658589,0.00002846286,0.752303,0.00028794832,0.000056106946,0.000059182254,8.094061e-7,0.000016093069,0.00066252373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99790835,0.000032371245,0.00040529526,0.0006630753,0.00051753625,0.0004733561],"domain_scores_gemma":[0.99759734,0.00013246413,0.00018537094,0.00041157776,0.0015486174,0.00012462375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078341394,0.00023332612,0.00032348392,0.00008323884,0.00026687127,0.00040454252,0.0014534367,0.00010563558,0.000022412458],"category_scores_gemma":[0.00009345582,0.0001609183,0.000119602824,0.00083408057,0.00018758865,0.00047459398,0.00035956234,0.00027667815,0.000007640793],"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.00003011606,0.000121605684,0.000003864721,0.000031108295,0.000024439476,0.0000010425867,0.0005977337,0.00015409318,0.010817959,0.830079,0.000044366607,0.15809466],"study_design_scores_gemma":[0.000034610184,0.000112673544,0.0000020240614,0.00009167406,0.000009928841,0.000009374044,0.00006753757,0.34503907,0.23211795,0.42235896,0.000041783125,0.00011440802],"about_ca_topic_score_codex":0.000028539374,"about_ca_topic_score_gemma":0.0000055566484,"teacher_disagreement_score":0.40772003,"about_ca_system_score_codex":0.000051500636,"about_ca_system_score_gemma":0.00041689043,"threshold_uncertainty_score":0.6562058},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6510102,0.00006729319,0.20803916,0.010605711,0.0024654844,0.0015477425,0.0000063899192,0.00066919887,0.1255888],"genre_scores_gemma":[0.9981402,0.00003144931,0.0008743059,0.00016368179,0.000104008745,0.00004946544,3.412568e-7,0.000011814241,0.00062470546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99800664,0.00003345044,0.00044691688,0.00058048265,0.0004903147,0.0004421701],"domain_scores_gemma":[0.99826294,0.00018590176,0.00037832948,0.00036636752,0.0007053488,0.000101119345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006293319,0.00026070114,0.0002694757,0.000104159866,0.0003113665,0.00035268124,0.0018309507,0.0001264622,0.000047083195],"category_scores_gemma":[0.0008780023,0.00014493412,0.00013463019,0.00048949383,0.0005258701,0.0004989071,0.0003369658,0.00020454104,0.0002644913],"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.0000516995,0.00011491738,0.00028401008,0.000013060243,0.000010525646,4.1609803e-7,0.0013177816,0.0000010340501,0.016900348,0.7782175,0.000038243776,0.2030505],"study_design_scores_gemma":[0.000058135225,0.0004930284,0.00032660895,0.0003183498,0.000009930822,0.0000045423817,0.00030069274,0.005025815,0.45538607,0.5375058,0.00031464003,0.0002563764],"about_ca_topic_score_codex":0.000023912062,"about_ca_topic_score_gemma":0.000020182057,"teacher_disagreement_score":0.43848574,"about_ca_system_score_codex":0.0000863783,"about_ca_system_score_gemma":0.00012360663,"threshold_uncertainty_score":0.5910242},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4039633,0.000005617022,0.5903889,0.004283138,0.00063200924,0.00045557867,0.0000017176334,0.00006333456,0.00020640694],"genre_scores_gemma":[0.9926512,0.000007059806,0.006783692,0.00018384015,0.000261935,0.00006962319,9.940254e-7,0.000008803581,0.000032819666],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832153,0.000042573407,0.00042076546,0.00057900714,0.00035585286,0.00028024608],"domain_scores_gemma":[0.9981098,0.000041636435,0.00042478202,0.00079438067,0.0005083551,0.00012105067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009462133,0.00016907696,0.0001625585,0.00008898678,0.0006118687,0.000593917,0.0025875075,0.00008323483,0.0000040721025],"category_scores_gemma":[0.0007189938,0.00013958859,0.00006231225,0.000176177,0.00011191122,0.0008041844,0.00046443395,0.00019969956,0.000024826484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001773291,0.00010432909,0.00022803257,0.0000069719754,0.000003982524,1.871357e-7,0.0011820606,0.010403849,0.10134946,0.366076,0.000048660244,0.5204192],"study_design_scores_gemma":[0.000018832474,0.0001651938,0.0011827666,0.000039618182,0.000004047732,0.0000012471012,0.000047933278,0.9146518,0.07581438,0.007888355,0.00004040901,0.0001453985],"about_ca_topic_score_codex":0.00011575974,"about_ca_topic_score_gemma":0.00007541651,"teacher_disagreement_score":0.90424794,"about_ca_system_score_codex":0.00006755932,"about_ca_system_score_gemma":0.00004696631,"threshold_uncertainty_score":0.5727155},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9119802,0.000021863008,0.07892159,0.0023434607,0.0005683894,0.00031090478,0.0000020904577,0.00025432292,0.005597146],"genre_scores_gemma":[0.99627346,0.0000066027874,0.0032014258,0.00008833435,0.000108465036,0.000009374979,1.8453355e-7,0.000021580921,0.0002905835],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99750054,0.000030441464,0.00065541535,0.0006426115,0.0006738713,0.00049712864],"domain_scores_gemma":[0.997943,0.00013928642,0.00046114103,0.00049094117,0.00079521886,0.00017045326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007665655,0.00031924847,0.00033482403,0.00021144358,0.0004875089,0.00039669135,0.002047914,0.00012350854,0.000032981272],"category_scores_gemma":[0.00058055646,0.00019317381,0.00016013137,0.00070321356,0.0003980187,0.0006285068,0.0005973148,0.0002656083,0.00006119805],"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.00001180801,0.000066748114,0.0007392489,0.000024396584,0.0000144892,8.2261516e-7,0.0033962622,0.00002640015,0.48373872,0.37866843,0.00012943521,0.13318324],"study_design_scores_gemma":[0.000045275236,0.00015010798,0.00028447862,0.0006542101,0.000010851628,0.0000062874774,0.00080890104,0.0065635154,0.83387554,0.15710117,0.00016818066,0.0003314948],"about_ca_topic_score_codex":0.00012875153,"about_ca_topic_score_gemma":0.00001468322,"teacher_disagreement_score":0.3501368,"about_ca_system_score_codex":0.00014283747,"about_ca_system_score_gemma":0.00012400647,"threshold_uncertainty_score":0.78773993},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89493454,0.00009485382,0.07400604,0.0061377496,0.0003700072,0.0009214151,0.000004358397,0.00009956167,0.023431491],"genre_scores_gemma":[0.9934513,0.000060633785,0.006200618,0.000053008287,0.000023888211,0.000018723951,5.077943e-8,0.000006599468,0.00018515435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982314,0.000027173399,0.0005560204,0.0005321406,0.00031067478,0.0003426089],"domain_scores_gemma":[0.9984778,0.00023841776,0.00032482276,0.00030287995,0.00058028905,0.00007576088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007775808,0.00020327853,0.00032479252,0.00012824428,0.00012491293,0.00009718169,0.001330707,0.00010238624,0.00002645073],"category_scores_gemma":[0.0012675462,0.000117950876,0.000078847894,0.00069031434,0.00054803945,0.00040987047,0.00051084004,0.00016203462,0.00001819435],"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.00004175349,0.00017740077,0.0058103274,0.000065615954,0.000006807973,3.8293425e-7,0.001715656,0.0000038203707,0.012345081,0.9442359,0.000013063311,0.035584148],"study_design_scores_gemma":[0.00009301819,0.0002807127,0.0048375553,0.0005597915,0.0000074195787,0.000006563779,0.00018384698,0.0074498393,0.10927175,0.8769895,0.00008934006,0.00023068227],"about_ca_topic_score_codex":0.000070393064,"about_ca_topic_score_gemma":0.00023341499,"teacher_disagreement_score":0.0985168,"about_ca_system_score_codex":0.00006623236,"about_ca_system_score_gemma":0.00017165113,"threshold_uncertainty_score":0.4809897},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7839294,0.00004639138,0.19687848,0.00541062,0.00058213907,0.0010813029,0.0000064788906,0.00016549091,0.011899685],"genre_scores_gemma":[0.9934225,0.000020550684,0.005561407,0.00014668274,0.000067287096,0.000015501406,2.125425e-7,0.000014778687,0.0007510732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9977452,0.000020630647,0.000513066,0.0006800494,0.0006074886,0.00043352952],"domain_scores_gemma":[0.9976023,0.00014025532,0.0004907027,0.00042998267,0.0011061289,0.00023063924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004422538,0.000298869,0.0003874047,0.00016987906,0.00015895595,0.000118176016,0.0018916198,0.000103146755,0.000051769708],"category_scores_gemma":[0.00065266405,0.00015532564,0.000119301636,0.0008141036,0.00039315442,0.0005101144,0.00046197406,0.00018062498,0.00023976977],"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.0002779316,0.00017260632,0.0027282767,0.000037290087,0.000032173964,0.0000011813435,0.005210314,0.000013198198,0.24413717,0.6483723,0.000579172,0.09843842],"study_design_scores_gemma":[0.00007978817,0.0008892497,0.0017290129,0.0007328895,0.000018525814,0.00000721376,0.0004858882,0.0014848212,0.9241857,0.06990049,0.00018147068,0.0003049715],"about_ca_topic_score_codex":0.000054345157,"about_ca_topic_score_gemma":0.000051865085,"teacher_disagreement_score":0.6800485,"about_ca_system_score_codex":0.000070839844,"about_ca_system_score_gemma":0.0003675121,"threshold_uncertainty_score":0.6333996},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95508456,0.00001077567,0.03820223,0.0016852074,0.00023885803,0.0005694512,0.000018413702,0.000034470726,0.004156009],"genre_scores_gemma":[0.998194,0.00000613593,0.0012623108,0.00008033612,0.000052920124,0.000017240242,2.5813333e-7,0.000013139693,0.0003736515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974839,0.000032404332,0.0010028983,0.0005360132,0.0005638421,0.00038095334],"domain_scores_gemma":[0.99631387,0.001281359,0.00066832354,0.0003062511,0.001357885,0.000072290386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019469104,0.00020135146,0.0003481434,0.00021386897,0.00019796427,0.00028632328,0.0013863697,0.00010060729,0.00015941852],"category_scores_gemma":[0.0029395898,0.00011331602,0.00013715288,0.00086857285,0.00052223844,0.0005511537,0.00023550929,0.00015670176,0.00008566491],"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.00014198534,0.00005709804,0.00037700872,0.0000069480493,0.000005382186,1.037442e-7,0.001010945,0.00012793134,0.2266883,0.7192172,0.000067953755,0.052299142],"study_design_scores_gemma":[0.000053339096,0.00008128965,0.000364301,0.0002538966,0.000008509461,0.0000024702658,0.0056860535,0.05277873,0.14843994,0.79208803,0.0000919532,0.00015149258],"about_ca_topic_score_codex":0.00002606479,"about_ca_topic_score_gemma":0.000023363555,"teacher_disagreement_score":0.07824836,"about_ca_system_score_codex":0.00005198911,"about_ca_system_score_gemma":0.00016308625,"threshold_uncertainty_score":0.46208933},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85264885,0.000056472112,0.112879924,0.016620409,0.0018414397,0.0011192494,0.000025107734,0.00030515873,0.014503412],"genre_scores_gemma":[0.9979913,0.000077473655,0.0013161589,0.00019191798,0.00009292572,0.00003441671,3.147197e-7,0.00001761824,0.00027782194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9969249,0.000051735457,0.00095860416,0.00076564786,0.00074771006,0.0005514365],"domain_scores_gemma":[0.99789155,0.00025311898,0.00052394276,0.000498144,0.00072381756,0.00010944799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007104711,0.00032312024,0.0003596664,0.00027109202,0.00013676952,0.0002526426,0.0027797853,0.00017300023,0.0002103666],"category_scores_gemma":[0.0010389428,0.00020740535,0.000172407,0.0009013716,0.0005991509,0.0010802558,0.0005548243,0.0002890858,0.00021607151],"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.000106868385,0.0001919407,0.0018869457,0.000023587172,0.000014557911,0.0000016868013,0.003276812,0.00004454564,0.039644364,0.8576077,0.0003234873,0.09687746],"study_design_scores_gemma":[0.000033249475,0.00015895783,0.00029389234,0.00039610692,0.000006734084,0.0000056688514,0.00050648145,0.020568207,0.6761466,0.30137733,0.00022488085,0.0002818599],"about_ca_topic_score_codex":0.000085560554,"about_ca_topic_score_gemma":0.00009380904,"teacher_disagreement_score":0.63650227,"about_ca_system_score_codex":0.00015506525,"about_ca_system_score_gemma":0.00017393101,"threshold_uncertainty_score":0.8457745},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9602744,0.000003890955,0.035901956,0.0007987401,0.00004157248,0.0003394339,0.000004632373,0.000048891667,0.0025864723],"genre_scores_gemma":[0.9990512,0.0000073875426,0.0005085347,0.000044538174,0.0000779537,0.0000819928,9.955468e-7,0.000017964308,0.00020943882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983962,0.00001886122,0.00049139775,0.00040625155,0.0003046845,0.0003825662],"domain_scores_gemma":[0.99891585,0.000070999544,0.00039175423,0.00017764916,0.00039546227,0.000048263926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019277103,0.0002262884,0.00028110167,0.000117443305,0.00017764865,0.00009040187,0.0007504935,0.000056304136,0.00023505333],"category_scores_gemma":[0.000035462526,0.00013835506,0.00008887175,0.00072848063,0.00038543507,0.00032775744,0.00017139952,0.00018624132,0.000012658389],"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.00029513368,0.00030330376,0.1034171,0.000014644131,0.0000434746,4.6760817e-7,0.0019705587,0.0011888753,0.03530624,0.75337857,0.00013474976,0.10394688],"study_design_scores_gemma":[0.00036532112,0.00056935917,0.044842824,0.002285583,0.00012334589,0.0000028254126,0.005208365,0.15572809,0.47281492,0.31578285,0.00047781286,0.0017987178],"about_ca_topic_score_codex":0.00008403532,"about_ca_topic_score_gemma":0.00004537347,"teacher_disagreement_score":0.43759575,"about_ca_system_score_codex":0.00005805642,"about_ca_system_score_gemma":0.000050796516,"threshold_uncertainty_score":0.5641955},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8615132,0.00011620188,0.08702477,0.009456955,0.0014797574,0.0011594293,0.0001385683,0.000100464174,0.039010674],"genre_scores_gemma":[0.99732023,0.000018133416,0.0010792348,0.00029372776,0.00018262563,0.000019165705,1.5911945e-7,0.00002121712,0.0010655134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981936,0.000015809477,0.0008391892,0.00045571246,0.00012310427,0.0003725463],"domain_scores_gemma":[0.9986173,0.00010834776,0.0006349567,0.00031942216,0.00022573609,0.00009425982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015115754,0.00020590384,0.00036447117,0.00017022532,0.00023032949,0.00013058864,0.0011434997,0.00008644373,0.0003285342],"category_scores_gemma":[0.0006814447,0.0001199825,0.00016827595,0.000566285,0.00023115656,0.00018722742,0.00019157398,0.00016058174,0.00051403797],"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.000029230638,0.000047699246,0.0013414581,0.0000118758035,0.000026535941,2.0064822e-7,0.0006676317,0.000047290265,0.010283879,0.9731331,0.000099353754,0.01431176],"study_design_scores_gemma":[0.00005811506,0.00019798485,0.0008279775,0.0005041424,0.00002247395,0.00001097816,0.0010916202,0.022915915,0.20098065,0.7712195,0.0016981447,0.00047249167],"about_ca_topic_score_codex":0.00016977944,"about_ca_topic_score_gemma":0.0000057814136,"teacher_disagreement_score":0.20191358,"about_ca_system_score_codex":0.00007385335,"about_ca_system_score_gemma":0.00003152379,"threshold_uncertainty_score":0.66070896},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90095913,0.0015586156,0.037163135,0.054821257,0.0013552498,0.0009746506,0.000016398004,0.0013031785,0.0018484123],"genre_scores_gemma":[0.98297197,0.00007961243,0.016233893,0.00018579236,0.00006432823,0.00003758819,4.6669868e-7,0.00001661039,0.0004097638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99778265,0.00002054488,0.0005752095,0.00070155354,0.0004883603,0.00043168862],"domain_scores_gemma":[0.99843717,0.00011594088,0.00040788375,0.0005549726,0.0004116734,0.000072364666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041316185,0.00028272587,0.00033015147,0.00039812524,0.00013707885,0.0003640146,0.003740477,0.00022853784,0.0000563446],"category_scores_gemma":[0.0004501759,0.00016884472,0.00008444518,0.0010397282,0.00038913102,0.0013610881,0.0007572167,0.00036842132,0.0000739361],"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.000016477372,0.000060715265,0.00022240051,0.000009191469,0.000004345192,0.0000024544197,0.00080007705,8.98287e-8,0.39961842,0.554002,0.00012411388,0.0451397],"study_design_scores_gemma":[0.000025627278,0.00006333192,0.00007009136,0.0006327675,0.0000030358633,0.0000018865403,0.00024771702,0.00015380002,0.5907167,0.40787783,0.000049203078,0.00015797057],"about_ca_topic_score_codex":0.00014725943,"about_ca_topic_score_gemma":0.00007297744,"teacher_disagreement_score":0.1910983,"about_ca_system_score_codex":0.000104554805,"about_ca_system_score_gemma":0.00007468995,"threshold_uncertainty_score":0.6950799},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4967199,0.00009439351,0.4087276,0.08086792,0.0052038813,0.0019645786,0.00031290943,0.001637983,0.0044708485],"genre_scores_gemma":[0.9971096,0.00006870769,0.001993906,0.00035509918,0.00013386534,0.000022779772,0.000015368292,0.000029438546,0.00027125477],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99649745,0.00020107711,0.0007961747,0.0011558053,0.0008125578,0.00053695886],"domain_scores_gemma":[0.99714214,0.0002526367,0.0005852782,0.00095098955,0.0008558843,0.00021304762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001390428,0.0003403451,0.00034471706,0.00019499415,0.00042213954,0.00033614895,0.0043154154,0.00016558396,0.00006152777],"category_scores_gemma":[0.0015841624,0.00021908726,0.00007309309,0.0006312937,0.00021353712,0.0012895665,0.0009314172,0.00084077904,0.00007461609],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000208149,0.00019751044,0.005290178,0.00010023382,0.000017422632,0.0000011022165,0.0014286159,0.000060169725,0.03522217,0.16081542,0.0004009813,0.79625803],"study_design_scores_gemma":[0.00023932532,0.0044881376,0.0027515623,0.0043597263,0.000030390092,0.00002807755,0.0017317812,0.76133144,0.1875604,0.031858668,0.004480714,0.0011398041],"about_ca_topic_score_codex":0.00038735982,"about_ca_topic_score_gemma":0.000033377408,"teacher_disagreement_score":0.7951183,"about_ca_system_score_codex":0.00014831568,"about_ca_system_score_gemma":0.00015837072,"threshold_uncertainty_score":0.89341193},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008150147,0.00020695863,0.9673262,0.001568533,0.0008743625,0.00054271985,0.00002061436,0.00006822223,0.021242194],"genre_scores_gemma":[0.9518378,0.0002863595,0.0473761,0.00007530652,0.00016721089,0.000052546122,9.4420506e-7,0.000024963327,0.00017878479],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9958607,0.000044563047,0.00083431375,0.0013736676,0.0012658373,0.00062093546],"domain_scores_gemma":[0.9931119,0.00011214033,0.00188724,0.0012366507,0.003487456,0.00016462176],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011003213,0.0005685074,0.0007814652,0.00035102194,0.0007401468,0.0011826225,0.0074888663,0.00019941405,0.000016662532],"category_scores_gemma":[0.00050538464,0.0003927813,0.00023327983,0.0006405084,0.002329285,0.001343597,0.0032903193,0.00061714917,0.0000041597527],"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.000101343256,0.00014908513,0.00003630507,0.00008529524,0.00007953532,0.000001607435,0.0020717126,0.05133182,0.09037136,0.78072655,0.000086552274,0.074958794],"study_design_scores_gemma":[0.000018193858,0.00011196013,0.00002232895,0.00043754492,0.000023613973,0.0000019169606,0.00016444143,0.2996957,0.4903858,0.20887452,0.0000074072527,0.00025658042],"about_ca_topic_score_codex":0.00033063156,"about_ca_topic_score_gemma":0.000041276802,"teacher_disagreement_score":0.9436876,"about_ca_system_score_codex":0.00010041355,"about_ca_system_score_gemma":0.00093109865,"threshold_uncertainty_score":0.99985427},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9095419,0.000023804358,0.057340037,0.0027723322,0.0010928836,0.0012289372,0.0003706741,0.00006966305,0.02755979],"genre_scores_gemma":[0.9966729,0.000044677905,0.0026201014,0.000035652054,0.00017817714,0.00007346291,0.000009849831,0.000021543989,0.00034357907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99792755,0.000015019871,0.00060526445,0.0006854231,0.00038040822,0.00038636415],"domain_scores_gemma":[0.998217,0.000116122814,0.00066863414,0.00037325863,0.00047553776,0.00014946495],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003373069,0.0003978614,0.00060245406,0.000060936152,0.00028297398,0.00029022893,0.001303918,0.00022449213,0.00065211585],"category_scores_gemma":[0.00022728997,0.00029153962,0.00020517148,0.000069157664,0.0004908596,0.00009497929,0.0007289033,0.00089566835,0.00002483953],"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.0001004076,0.0001684348,0.0013634218,0.00006789746,0.000055388875,5.984821e-7,0.00025072816,0.00004249976,0.0017008713,0.9721594,0.000047212998,0.024043137],"study_design_scores_gemma":[0.00006040423,0.0001726434,0.0017659641,0.00049683626,0.000114910974,6.068231e-7,0.0002989963,0.05662094,0.030246047,0.9096971,0.00009099441,0.00043456943],"about_ca_topic_score_codex":0.0001710865,"about_ca_topic_score_gemma":0.0000022360596,"teacher_disagreement_score":0.087131076,"about_ca_system_score_codex":0.000023257318,"about_ca_system_score_gemma":0.00015061552,"threshold_uncertainty_score":0.9999537},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073035033,0.00017258969,0.9086833,0.033075627,0.005435375,0.0016989451,0.000009606189,0.0003039365,0.04331713],"genre_scores_gemma":[0.99204695,0.00024813705,0.005288757,0.00016774499,0.00023107816,0.00007133481,0.0000010539674,0.000025646283,0.0019193174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967235,0.000039706545,0.00080997933,0.0007982968,0.0010542844,0.00057425426],"domain_scores_gemma":[0.9955984,0.00029004214,0.0013161151,0.001578888,0.001104034,0.000112518304],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010185513,0.00045527614,0.00041405484,0.00012523892,0.0011558637,0.002453403,0.011235673,0.00028001046,0.000017859074],"category_scores_gemma":[0.0018895321,0.00028414765,0.00030858774,0.00021315833,0.000880312,0.00025833846,0.004104813,0.0017720071,0.00012406838],"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.000022882536,0.00003127514,0.00002810786,0.00010487055,0.000037917154,6.2559826e-7,0.0009051112,0.030802201,0.0009967545,0.91139054,0.00023199664,0.055447694],"study_design_scores_gemma":[0.000017589595,0.000118296186,0.00009237354,0.0008913585,0.000028917695,0.0000058086157,0.0001584817,0.3900288,0.040965777,0.56627595,0.0010250609,0.0003915443],"about_ca_topic_score_codex":0.000046281297,"about_ca_topic_score_gemma":0.00000970352,"teacher_disagreement_score":0.9847434,"about_ca_system_score_codex":0.00008922501,"about_ca_system_score_gemma":0.00034294865,"threshold_uncertainty_score":0.9999611},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1727315,0.000010773231,0.8199783,0.004427736,0.0005490725,0.00077266694,0.000006116506,0.00019495345,0.0013289026],"genre_scores_gemma":[0.98606735,0.000033840566,0.0135101285,0.00012133132,0.000059253936,0.000027590482,1.437204e-7,0.000015707203,0.00016462167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981822,0.00004584455,0.0005244793,0.0005264436,0.00039815163,0.00032288488],"domain_scores_gemma":[0.99889094,0.0001164099,0.00033690315,0.00028044352,0.00025614208,0.00011917444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095452444,0.00022487644,0.00025097525,0.0001979665,0.00023519728,0.0003389548,0.0011630057,0.00008029854,0.000040441482],"category_scores_gemma":[0.00017306331,0.00014445769,0.0000643739,0.00038563285,0.000062024155,0.00067393924,0.00068881246,0.00013967825,0.000034933564],"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.000021019318,0.00005883633,0.0008982012,0.000027319173,0.000016445718,2.975536e-7,0.0009441081,0.000004969417,0.3362598,0.57718664,0.0001859943,0.08439637],"study_design_scores_gemma":[0.00006359365,0.0004194816,0.0003201273,0.0008486886,0.00001723708,0.000010074299,0.00047518412,0.012873335,0.90382963,0.0797167,0.00094253174,0.00048338677],"about_ca_topic_score_codex":0.000059867638,"about_ca_topic_score_gemma":0.0000053825356,"teacher_disagreement_score":0.8133359,"about_ca_system_score_codex":0.0001283295,"about_ca_system_score_gemma":0.000028514027,"threshold_uncertainty_score":0.5890814},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43042028,0.000035788406,0.55948085,0.0060537877,0.0010968128,0.0015058495,0.0000248762,0.00025038744,0.0011313743],"genre_scores_gemma":[0.98843443,0.000027370907,0.010564873,0.00029182518,0.00012374646,0.00015388358,2.0626983e-7,0.000028584345,0.0003751011],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9967978,0.00003632219,0.0010017077,0.00084157614,0.0006854634,0.0006371058],"domain_scores_gemma":[0.9966174,0.0008479226,0.00067823665,0.0005584087,0.0011709032,0.00012714422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007554198,0.0003775292,0.00042957952,0.00021022573,0.00036638457,0.00035474703,0.0025252514,0.0001627419,0.00006034215],"category_scores_gemma":[0.0018831415,0.00023959891,0.00030758666,0.0005635166,0.00039739552,0.00088801805,0.00045285505,0.00018924358,0.00011307483],"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.00033521923,0.00019835673,0.00042604844,0.00006167339,0.00004746514,8.0170736e-7,0.0026773908,0.0023401892,0.160584,0.41564623,0.00018511366,0.4174975],"study_design_scores_gemma":[0.000050694252,0.00032828635,0.00012728125,0.0003886841,0.000020242063,0.0000020551606,0.0003235725,0.37834993,0.5162484,0.10339798,0.00040437738,0.00035851594],"about_ca_topic_score_codex":0.000056709305,"about_ca_topic_score_gemma":0.00001794675,"teacher_disagreement_score":0.55801415,"about_ca_system_score_codex":0.0001234171,"about_ca_system_score_gemma":0.00011454087,"threshold_uncertainty_score":0.97705597},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37573984,0.00003413936,0.61026764,0.007537376,0.0013090415,0.0004875852,0.0000028422264,0.00052656,0.0040949564],"genre_scores_gemma":[0.99778426,0.00000680707,0.0015853491,0.00018579228,0.00020783496,0.000026043956,3.9062996e-7,0.000017341665,0.0001861834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980831,0.00014822259,0.0005114373,0.00035859467,0.00044752113,0.00045110803],"domain_scores_gemma":[0.998587,0.0001828563,0.0004404617,0.00027978848,0.00043038625,0.00007948395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012523893,0.00023569823,0.00028661118,0.0000988454,0.0008872422,0.00022796524,0.0018658115,0.00013007339,0.0000148593535],"category_scores_gemma":[0.00023083364,0.0001562202,0.0001453863,0.00048257216,0.00023903191,0.00030297626,0.0003287326,0.00044825792,0.00007316218],"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.00010782597,0.00020866578,0.0016230715,0.00009696399,0.000033905922,0.0000014020998,0.0043166815,0.00147682,0.237694,0.5422228,0.0002746471,0.21194324],"study_design_scores_gemma":[0.00009586729,0.0006150464,0.000255389,0.0012666814,0.000015297896,0.000016490314,0.0003385762,0.09671213,0.8008106,0.09819543,0.0010734744,0.0006050598],"about_ca_topic_score_codex":0.0001022067,"about_ca_topic_score_gemma":0.000017757875,"teacher_disagreement_score":0.62204444,"about_ca_system_score_codex":0.00008772282,"about_ca_system_score_gemma":0.00006219764,"threshold_uncertainty_score":0.682404},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003757413,0.0000026726243,0.9878541,0.0032237184,0.00021403855,0.00058865704,0.0000037683974,0.00014534633,0.0042102556],"genre_scores_gemma":[0.98266035,0.000006642977,0.015428684,0.0003287807,0.000050821145,0.000085713305,0.0000022042395,0.000019692805,0.0014171265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99755865,0.000016650014,0.0006833859,0.000527366,0.00073768693,0.00047626309],"domain_scores_gemma":[0.99753714,0.00032600955,0.00064633467,0.0003198538,0.0010589344,0.000111754685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006103294,0.00027617297,0.00029313882,0.00015950903,0.0003531101,0.00023034927,0.0020653019,0.00010074925,0.000072016504],"category_scores_gemma":[0.00065304874,0.00018234573,0.00019025887,0.0003160739,0.00031564396,0.000517995,0.0003098639,0.00023300864,0.00005734609],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054356664,0.000027682021,0.00004065334,0.000030355064,0.00001245331,6.996357e-8,0.0002689673,0.3903491,0.032653775,0.5725426,0.00015392138,0.003866043],"study_design_scores_gemma":[0.00008381339,0.0002312618,0.000008996112,0.00020236692,0.000009429312,5.947544e-7,0.000051376293,0.6683707,0.28102285,0.049671315,0.00016787573,0.00017942287],"about_ca_topic_score_codex":0.0000045705474,"about_ca_topic_score_gemma":8.138613e-7,"teacher_disagreement_score":0.97890294,"about_ca_system_score_codex":0.00010407024,"about_ca_system_score_gemma":0.00017329371,"threshold_uncertainty_score":0.7435843},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052715372,0.000026015054,0.9309703,0.0049928864,0.0015511092,0.0036130236,0.000005715631,0.00014902472,0.00597654],"genre_scores_gemma":[0.9783582,0.000022006609,0.02074696,0.0001591899,0.00023172075,0.00036495933,0.000001278266,0.000012055687,0.00010360561],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9973369,0.00004171338,0.0009614051,0.00052002165,0.00070475915,0.00043517293],"domain_scores_gemma":[0.99697256,0.000107940614,0.0006292965,0.0004348203,0.0017625208,0.00009287131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001985988,0.00026550965,0.00027552512,0.00035923102,0.00021488623,0.00033479003,0.0017878521,0.00016477605,0.00007120514],"category_scores_gemma":[0.0016280038,0.00022155998,0.00012914572,0.0012533251,0.0003177236,0.0018435927,0.00025672597,0.0002634795,0.00011445848],"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.00012505139,0.000087811946,0.000055838853,0.000033505585,0.000009238966,5.6542902e-8,0.0042681033,0.00017827234,0.104088604,0.57494885,0.0005209068,0.31568375],"study_design_scores_gemma":[0.000026030511,0.00030623874,0.00007513958,0.00019754624,0.000008967183,0.000004768973,0.00041387024,0.11004433,0.6350054,0.25340188,0.00034498598,0.00017083628],"about_ca_topic_score_codex":0.00018523447,"about_ca_topic_score_gemma":0.000029502908,"teacher_disagreement_score":0.92564285,"about_ca_system_score_codex":0.00022075443,"about_ca_system_score_gemma":0.00041334316,"threshold_uncertainty_score":0.9034954},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22892168,0.00010772539,0.72364587,0.024949377,0.0018566372,0.0015312986,0.000015590736,0.00047578893,0.018496035],"genre_scores_gemma":[0.9960629,0.000042655745,0.002293762,0.00024690392,0.00017387782,0.00006689973,1.6596717e-7,0.000021744521,0.0010910954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99704486,0.00004704429,0.00072634895,0.0009018254,0.0007705789,0.0005093235],"domain_scores_gemma":[0.9971674,0.00031299787,0.00065004535,0.0005084132,0.001256093,0.00010501459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084179494,0.00033895051,0.00041568553,0.00015982438,0.00028570407,0.00029037546,0.0022554395,0.000100243335,0.00013970802],"category_scores_gemma":[0.00096576376,0.00021084529,0.00023083232,0.00080375874,0.0004878902,0.0012966538,0.00061307574,0.00027772936,0.00029683983],"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.000054967375,0.00013791925,0.00027707216,0.000041308453,0.000041088322,8.24234e-7,0.005735147,0.0000027175136,0.13080591,0.63014716,0.00017541356,0.23258047],"study_design_scores_gemma":[0.000053083306,0.00012714897,0.00007430364,0.00080957625,0.000013369642,0.000019944886,0.0011996813,0.0015706376,0.8371018,0.1578346,0.00086974003,0.0003261047],"about_ca_topic_score_codex":0.00006727963,"about_ca_topic_score_gemma":0.000011135969,"teacher_disagreement_score":0.7671412,"about_ca_system_score_codex":0.00015862846,"about_ca_system_score_gemma":0.00015233459,"threshold_uncertainty_score":0.8598021},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8518982,0.000063119754,0.07869113,0.025589906,0.0021572665,0.0025389534,0.000026183818,0.0009882257,0.038046997],"genre_scores_gemma":[0.985335,0.000081532446,0.013554321,0.0001981838,0.00006482717,0.00009968394,2.9232208e-7,0.000010816831,0.00065537804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983054,0.000021370106,0.00044114236,0.00047880088,0.00040022054,0.00035309096],"domain_scores_gemma":[0.9986436,0.0000927892,0.00028224709,0.0003208597,0.00055720063,0.00010329851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032208758,0.00020053545,0.00020525085,0.00013943609,0.00019755363,0.0001808697,0.0017096889,0.00009494239,0.00014814339],"category_scores_gemma":[0.00038175884,0.00010867547,0.00013598058,0.0005435754,0.00021896679,0.0005372091,0.00034930944,0.0001304886,0.00039259339],"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.000029904042,0.00014338603,0.00008375299,0.000013313528,0.000008050117,2.1686058e-7,0.0002114499,0.0000023357004,0.18626675,0.4335905,0.00040549831,0.37924486],"study_design_scores_gemma":[0.000052801086,0.00018680048,0.00009899085,0.00032850294,0.000006621934,0.000002877759,0.000083653205,0.007087995,0.87252563,0.11852713,0.00090352417,0.00019548213],"about_ca_topic_score_codex":0.000020558819,"about_ca_topic_score_gemma":0.000006217709,"teacher_disagreement_score":0.68625885,"about_ca_system_score_codex":0.00003223292,"about_ca_system_score_gemma":0.00006561324,"threshold_uncertainty_score":0.50461245},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3610793,0.00010231491,0.63341695,0.0010690377,0.00025545852,0.00038858101,0.000038077218,0.00040198964,0.0032482753],"genre_scores_gemma":[0.9913201,0.0002666698,0.008237827,0.00004498114,0.000043000608,0.000008838832,0.000001448108,0.000016463666,0.00006071212],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989432,0.000008612583,0.0003553798,0.0002646152,0.00021563943,0.00021254718],"domain_scores_gemma":[0.9991963,0.00005702011,0.00012430147,0.00016516003,0.00038731124,0.00006992384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012206348,0.00019280394,0.00028539498,0.00018045082,0.00007859895,0.000055097917,0.0003437091,0.00007894154,0.00006479145],"category_scores_gemma":[0.000053016596,0.00012269111,0.00009258848,0.000531964,0.0002271045,0.00012654583,0.00008327597,0.00012494077,0.000005384101],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034792337,0.00039521043,0.0016220254,0.000068017885,0.0011541843,0.0000062364443,0.0017954732,0.05508217,0.24184379,0.32467303,0.00033959176,0.37267235],"study_design_scores_gemma":[0.000026013387,0.00008855875,0.00021643523,0.00018081423,0.000109179266,0.0000030979518,0.00018574583,0.65737313,0.33265692,0.008932079,0.000044137716,0.00018387928],"about_ca_topic_score_codex":0.000030299276,"about_ca_topic_score_gemma":0.000015594354,"teacher_disagreement_score":0.63024074,"about_ca_system_score_codex":0.000032237982,"about_ca_system_score_gemma":0.000014892221,"threshold_uncertainty_score":0.50031984},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07726159,0.000011922971,0.9155826,0.0022491922,0.0013528161,0.0006403895,0.000010504745,0.0001362975,0.0027547076],"genre_scores_gemma":[0.90244,0.000034702356,0.096994005,0.000102403814,0.00010947709,0.000061010247,4.53861e-7,0.000015520813,0.0002424225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978335,0.000034510682,0.0006399674,0.00059076736,0.00047215284,0.00042911898],"domain_scores_gemma":[0.99806446,0.00024990877,0.00051012816,0.0004269795,0.0006523883,0.000096159485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095630885,0.0002378123,0.00025891772,0.00014617687,0.00028305926,0.00019183244,0.0022749824,0.000109177556,0.000054271546],"category_scores_gemma":[0.0012450583,0.00015256373,0.00016210899,0.00045838693,0.0002553274,0.0008173132,0.00029485158,0.00017495757,0.000088174216],"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.00011547469,0.000062601815,0.000049497365,0.0000328668,0.000010042331,1.1592117e-7,0.0007277313,0.0000041067387,0.11859793,0.7277162,0.00009584659,0.15258756],"study_design_scores_gemma":[0.000058519872,0.00021710721,0.0001055122,0.0002576196,0.0000099522995,0.0000029706584,0.00007432081,0.041505847,0.6860037,0.27127227,0.00027175352,0.00022048186],"about_ca_topic_score_codex":0.000011479913,"about_ca_topic_score_gemma":0.0000026936204,"teacher_disagreement_score":0.82517844,"about_ca_system_score_codex":0.00008354054,"about_ca_system_score_gemma":0.0000905465,"threshold_uncertainty_score":0.6221369},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6130912,0.0002411726,0.041309487,0.053687487,0.0049477625,0.0016941164,0.00012265418,0.00030018628,0.28460595],"genre_scores_gemma":[0.9952952,0.00011788487,0.00049514166,0.0004423533,0.00007272774,0.000029437586,5.5815957e-7,0.000012589298,0.0035340916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99625427,0.000085075386,0.0012869474,0.0008221805,0.0010969711,0.0004545511],"domain_scores_gemma":[0.99640554,0.00058239786,0.0007626267,0.00065228844,0.001467608,0.00012953745],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003403233,0.00027303214,0.00046902406,0.000339419,0.00021238868,0.00029542917,0.0039449385,0.00014020933,0.0006065754],"category_scores_gemma":[0.004784199,0.00014291599,0.00022946877,0.0010939527,0.00091946364,0.00058847794,0.00091201026,0.00025368755,0.0009550352],"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.000096179545,0.00011822587,0.00020273529,0.000012083352,0.000012839349,2.992087e-7,0.00092349347,5.052157e-7,0.007129192,0.63792074,0.0010518255,0.3525319],"study_design_scores_gemma":[0.00005629063,0.00021186736,0.0005757938,0.00039880225,0.000014600143,0.0000020876823,0.0016737246,0.00054066227,0.13959004,0.84625286,0.01045547,0.00022782334],"about_ca_topic_score_codex":0.000037087608,"about_ca_topic_score_gemma":0.00020538311,"teacher_disagreement_score":0.38220406,"about_ca_system_score_codex":0.00006561022,"about_ca_system_score_gemma":0.0001303933,"threshold_uncertainty_score":0.99982285},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68006444,0.000045829765,0.24491453,0.027318984,0.00065292086,0.0010238544,0.00004270905,0.00015956498,0.04577716],"genre_scores_gemma":[0.99325496,0.000011808802,0.0008208484,0.00009907108,0.000050744253,0.000034059634,1.3357224e-7,0.000007274938,0.0057211146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99778366,0.000030847143,0.0005838286,0.00048187096,0.0009253174,0.00019448057],"domain_scores_gemma":[0.9977936,0.00021775285,0.00040981677,0.00021364703,0.0012712306,0.00009396043],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012447445,0.00015187514,0.00020460389,0.00013646716,0.00029682115,0.00021468425,0.00082621654,0.00007289267,0.0012161073],"category_scores_gemma":[0.0012224831,0.000078133744,0.00008282125,0.0007086998,0.00035923294,0.00034725605,0.00014978157,0.000112979455,0.00023444617],"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.000035828016,0.000040625993,0.00007202077,0.000001214286,0.000006803532,2.6924408e-8,0.00014936458,0.0000028286304,0.30778918,0.6525104,0.0002535638,0.039138168],"study_design_scores_gemma":[0.000012580356,0.000051615374,0.0000937847,0.000019796093,0.0000059715344,0.0000022429697,0.00089209655,0.00038886207,0.50878274,0.4894106,0.00027622297,0.00006346801],"about_ca_topic_score_codex":0.000011714283,"about_ca_topic_score_gemma":0.0000058862056,"teacher_disagreement_score":0.3131905,"about_ca_system_score_codex":0.00002510799,"about_ca_system_score_gemma":0.000052568652,"threshold_uncertainty_score":0.9996969},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002767079,0.0000030389506,0.9829641,0.010808942,0.0002661455,0.0006789451,0.000011033695,0.00010722509,0.0023934883],"genre_scores_gemma":[0.9546933,0.0000147783285,0.04487992,0.00020172681,0.000034513945,0.000055414177,7.389007e-7,0.000010499859,0.00010907966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844974,0.000015159267,0.00045182282,0.00041251964,0.00038316587,0.0002876032],"domain_scores_gemma":[0.99805456,0.00019173534,0.00028286086,0.0002119412,0.0011878115,0.00007109886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005703148,0.00016538308,0.00016986177,0.00013899132,0.00020156689,0.00020701542,0.0008928007,0.000081622835,0.00013169581],"category_scores_gemma":[0.00031463194,0.000105729334,0.00010319199,0.00042457273,0.00032417945,0.00040378122,0.000099824254,0.000100491336,0.000021815988],"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.00003402828,0.00006672291,0.0003451669,0.000037217203,0.000008328897,5.236103e-8,0.00020349855,0.015364145,0.017795054,0.8062575,0.000052927917,0.15983538],"study_design_scores_gemma":[0.00008003117,0.00013953897,0.000049678547,0.00023060286,0.000006009735,0.0000018526267,0.00008490822,0.63407105,0.3420971,0.022995539,0.0000809323,0.00016276946],"about_ca_topic_score_codex":0.000007839892,"about_ca_topic_score_gemma":0.000004548899,"teacher_disagreement_score":0.95192623,"about_ca_system_score_codex":0.000063223444,"about_ca_system_score_gemma":0.00020743567,"threshold_uncertainty_score":0.43115172},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7832317,0.0000715432,0.07143381,0.11273804,0.00093330385,0.0011924455,0.000029203085,0.00019656314,0.030173382],"genre_scores_gemma":[0.99639624,0.000009349719,0.0017000155,0.0014579259,0.000053974843,0.00003054595,9.142517e-8,0.000007691949,0.0003441822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980909,0.00004421857,0.00034602542,0.00045603496,0.00066772714,0.0003950428],"domain_scores_gemma":[0.99884677,0.00034160694,0.00013689735,0.00031738685,0.00029085804,0.00006650975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001311191,0.0001779067,0.00017863221,0.00018124912,0.00021085923,0.00022706794,0.0025211743,0.00007118169,0.00007079051],"category_scores_gemma":[0.00026978608,0.00009203697,0.00008631912,0.0008682668,0.00014704447,0.00028507158,0.00027307644,0.00018762155,0.00013698389],"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.00009982967,0.00013412288,0.0039797802,0.000029622792,0.000014971459,0.0000014510118,0.01479202,0.00005570277,0.040743455,0.88065225,0.0027242252,0.056772556],"study_design_scores_gemma":[0.00006280274,0.00032927992,0.0010857433,0.0010690829,0.000008338406,0.000015780353,0.0015764819,0.014476056,0.79835415,0.18161668,0.001047258,0.00035833078],"about_ca_topic_score_codex":0.00011463087,"about_ca_topic_score_gemma":0.00003159972,"teacher_disagreement_score":0.75761074,"about_ca_system_score_codex":0.000044942197,"about_ca_system_score_gemma":0.00010487598,"threshold_uncertainty_score":0.4685011},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48687565,0.00002023771,0.48284304,0.02539999,0.0006141007,0.0009570786,0.00002536413,0.00010738526,0.0031571628],"genre_scores_gemma":[0.9984255,0.000041396026,0.0011009169,0.00016690836,0.00003347398,0.000027272241,3.555659e-7,0.000010860738,0.0001933466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99805504,0.00006599096,0.0004639586,0.00041662384,0.00067338516,0.0003250297],"domain_scores_gemma":[0.99699265,0.0014355425,0.000397039,0.00044226565,0.00066625874,0.000066238994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001228895,0.00020631099,0.0002665586,0.00011853438,0.0003445598,0.00026021112,0.002017995,0.00007843399,0.00006034654],"category_scores_gemma":[0.00089065864,0.00010332744,0.00010499605,0.00047057142,0.0003145694,0.0007790511,0.00029620813,0.00021893957,0.00008786137],"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.00025250582,0.00012548502,0.00078688085,0.000035158864,0.000020308766,5.0599886e-7,0.002234016,0.000296582,0.028314171,0.9401253,0.0002213724,0.027587712],"study_design_scores_gemma":[0.00013660485,0.00043670172,0.00040172407,0.0015993576,0.000015595997,0.0000033346735,0.00051480584,0.058178417,0.754146,0.18421601,0.000084110594,0.00026738475],"about_ca_topic_score_codex":0.00011245239,"about_ca_topic_score_gemma":0.0000130808085,"teacher_disagreement_score":0.75590926,"about_ca_system_score_codex":0.00003324925,"about_ca_system_score_gemma":0.000095602656,"threshold_uncertainty_score":0.42135707},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9209496,0.00018616192,0.015175185,0.058345363,0.00061355205,0.0030833161,0.0000755711,0.000119409706,0.0014518617],"genre_scores_gemma":[0.9991415,0.00024562885,0.0000913751,0.0001575964,0.00003876702,0.00025742996,9.6083916e-8,0.0000096440435,0.000057970698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989819,0.00001753466,0.00032065692,0.0002974769,0.00023134911,0.000151078],"domain_scores_gemma":[0.99832547,0.0008470917,0.00034383108,0.00015589914,0.00027137852,0.00005632611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029966512,0.00010910868,0.00011373582,0.000054690434,0.00021341754,0.000053674583,0.000385729,0.000031170923,0.000032819666],"category_scores_gemma":[0.0036684757,0.000055900615,0.0000661958,0.00021478266,0.0005259331,0.0001506152,0.000065600005,0.000062699764,0.0000077777495],"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.000098058015,0.00005769234,0.00053093553,0.000022056181,0.000004338326,2.1825517e-8,0.00017074024,0.0000013789287,0.41596702,0.4199533,0.00004348438,0.163151],"study_design_scores_gemma":[0.000026023325,0.000074353826,0.002242078,0.00016843881,0.000041661868,8.575854e-7,0.00021947901,0.0041235248,0.93010515,0.06276074,0.00016125108,0.00007643311],"about_ca_topic_score_codex":0.000005683163,"about_ca_topic_score_gemma":0.0000022251938,"teacher_disagreement_score":0.51413816,"about_ca_system_score_codex":0.000011717583,"about_ca_system_score_gemma":0.0000385263,"threshold_uncertainty_score":0.4391773},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46665877,0.000012275532,0.5306,0.000902877,0.00031451462,0.00057108625,0.0000128575875,0.000077638004,0.00084999617],"genre_scores_gemma":[0.9972928,0.0000058564433,0.0019533585,0.00004826093,0.00017485912,0.00007523827,0.000003345946,0.000013913295,0.00043234133],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984657,0.000026138552,0.0004563102,0.00040642428,0.00033276295,0.0003126462],"domain_scores_gemma":[0.99840087,0.00010836389,0.00042314664,0.00012800818,0.0008791112,0.00006050931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004948642,0.00018116976,0.00024305716,0.00012489955,0.000286941,0.00013441108,0.000451531,0.00009991779,0.0005560221],"category_scores_gemma":[0.0006568448,0.00010973418,0.00017221092,0.0005194118,0.0003002647,0.00035543297,0.0000815482,0.00012628466,0.000021709058],"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.000210376,0.000028714547,0.0002753859,0.000018810428,0.00002798434,6.864618e-8,0.00014877199,0.0036336537,0.882379,0.10675852,0.000028471379,0.006490271],"study_design_scores_gemma":[0.000055657703,0.00025891763,0.0003666515,0.00007540164,0.00011918642,9.55857e-7,0.0002519772,0.22413336,0.7473161,0.027157418,0.00006277186,0.0002015691],"about_ca_topic_score_codex":0.00001404796,"about_ca_topic_score_gemma":0.00002139414,"teacher_disagreement_score":0.53063405,"about_ca_system_score_codex":0.000051140752,"about_ca_system_score_gemma":0.000032063377,"threshold_uncertainty_score":0.60880524},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9799203,0.00002349101,0.0011618834,0.0099468175,0.0010233955,0.00042764688,0.000006340409,0.000036348145,0.0074537373],"genre_scores_gemma":[0.9947354,0.00012779274,0.00012359444,0.00029999393,0.000041874406,0.000027991406,2.2443895e-7,0.0000093955505,0.0046337405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99663645,0.00003156423,0.0012125188,0.00046956757,0.0012971958,0.00035270472],"domain_scores_gemma":[0.99784875,0.00035012205,0.0005744102,0.000338937,0.00079978065,0.00008800063],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0019914894,0.00022600553,0.00031331377,0.00046268658,0.00010262515,0.00078941067,0.0023400388,0.000087100205,0.0014864514],"category_scores_gemma":[0.0014856772,0.00011560278,0.00014450472,0.0010292834,0.000365411,0.0023805697,0.00045331402,0.00019056049,0.0012093249],"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.0002818853,0.00018670823,0.006964001,0.000011611383,0.000011218771,6.365745e-7,0.002949557,0.00001770229,0.025259726,0.4923905,0.0018177908,0.47010866],"study_design_scores_gemma":[0.00007752337,0.00020841195,0.0071119457,0.0007954123,0.000014175005,0.0000020024077,0.017797705,0.0016842876,0.73640186,0.23130623,0.004216919,0.00038351092],"about_ca_topic_score_codex":0.0000254417,"about_ca_topic_score_gemma":0.000083065665,"teacher_disagreement_score":0.7111422,"about_ca_system_score_codex":0.00007215756,"about_ca_system_score_gemma":0.00005474171,"threshold_uncertainty_score":0.99956834},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012607996,0.0000028436332,0.9835864,0.0017836102,0.00041868936,0.00057612034,0.0000026109285,0.00010477019,0.0009169755],"genre_scores_gemma":[0.99323547,0.000012420516,0.0056190887,0.00009665315,0.000083088904,0.00003433677,0.0000016794393,0.00001497579,0.00090231455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980616,0.000013598271,0.0005930647,0.00040148018,0.0005621952,0.0003680709],"domain_scores_gemma":[0.99828655,0.00019583918,0.0005468812,0.00023607185,0.00065781106,0.00007686178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003944895,0.00021545205,0.00021452978,0.00012814271,0.00023809688,0.00015928,0.001477672,0.000075640295,0.00005373303],"category_scores_gemma":[0.0010918921,0.00013637112,0.00010944462,0.00034544905,0.00015070481,0.0005138253,0.00037882983,0.00017566053,0.000041592586],"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.000069922025,0.00006269114,0.00014443624,0.000035598503,0.000023655126,6.847533e-8,0.0005541049,0.0644859,0.103589475,0.77155375,0.00006285529,0.059417542],"study_design_scores_gemma":[0.00011310153,0.0007565454,0.00012688103,0.00041335687,0.00001742981,0.0000016181891,0.00024217642,0.651472,0.32003206,0.026295858,0.00022431424,0.00030468457],"about_ca_topic_score_codex":0.000008888307,"about_ca_topic_score_gemma":0.0000017259965,"teacher_disagreement_score":0.9806274,"about_ca_system_score_codex":0.00011732917,"about_ca_system_score_gemma":0.000082070845,"threshold_uncertainty_score":0.55610526},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011903266,0.000049324444,0.901636,0.077273786,0.00038393168,0.00038044667,0.00022469835,0.00016854338,0.007979988],"genre_scores_gemma":[0.9937305,0.00023428244,0.004815435,0.0002451944,0.00007906739,0.000027031461,5.3861754e-7,0.000009252024,0.00085873285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977029,0.000020610518,0.00058451085,0.00070474553,0.000712069,0.00027519313],"domain_scores_gemma":[0.9973636,0.0005670997,0.00041265544,0.0010142346,0.00055802916,0.00008436417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014362583,0.00016837432,0.00022906323,0.00021811912,0.00022014052,0.0002592933,0.004356899,0.00011607664,0.00008538786],"category_scores_gemma":[0.005412601,0.0000827887,0.000045480992,0.00098267,0.0006297573,0.0003603778,0.0016218589,0.00011167283,0.000121080484],"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.0000131874895,0.000019818497,0.000011096018,9.1701054e-7,0.0000026840685,4.0714465e-8,0.000022068007,3.3428836e-7,0.054943707,0.5141483,0.001018665,0.4298192],"study_design_scores_gemma":[0.000012576229,0.000059720325,0.0000393976,0.000042902197,0.000004967503,0.0000022700444,0.00033386284,0.001625747,0.3092905,0.685647,0.002848723,0.00009231815],"about_ca_topic_score_codex":0.000070422626,"about_ca_topic_score_gemma":0.000022121967,"teacher_disagreement_score":0.9818272,"about_ca_system_score_codex":0.000022032373,"about_ca_system_score_gemma":0.00010938482,"threshold_uncertainty_score":0.8096275},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055346284,0.000062558836,0.92996305,0.0068631712,0.00109779,0.00029634763,0.000003089133,0.00018710067,0.006180629],"genre_scores_gemma":[0.99118876,0.00013805013,0.0077788597,0.00026219964,0.00014171992,0.000019782296,1.2546727e-7,0.000015427351,0.00045505274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99739474,0.000022423817,0.00065659836,0.00078574667,0.00062280585,0.00051766186],"domain_scores_gemma":[0.9977675,0.00022095488,0.00036166565,0.0006258576,0.0008724552,0.0001515502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075682066,0.0002909527,0.00030490092,0.00013006375,0.00022952943,0.00027439938,0.0031848513,0.00011860402,0.00008371244],"category_scores_gemma":[0.00064458523,0.00016620226,0.0001519831,0.00073051825,0.0003298963,0.0006330748,0.0006136597,0.00028846512,0.00021950359],"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.000036441026,0.00005972623,0.000113615635,0.000006080508,0.0000066800676,3.5127783e-7,0.000143895,0.000077810364,0.019292105,0.60625726,0.0003857029,0.37362033],"study_design_scores_gemma":[0.000046174995,0.00019666788,0.0002452577,0.0006367456,0.0000109100265,0.000009266388,0.00006353351,0.101022154,0.39032063,0.5068229,0.00024235569,0.00038345146],"about_ca_topic_score_codex":0.000020388055,"about_ca_topic_score_gemma":0.000007528779,"teacher_disagreement_score":0.9358425,"about_ca_system_score_codex":0.000054509284,"about_ca_system_score_gemma":0.00011011095,"threshold_uncertainty_score":0.67775315},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6302345,0.000034379707,0.1788789,0.06572531,0.0012779601,0.0014066673,0.000016323394,0.00039405355,0.12203193],"genre_scores_gemma":[0.990851,0.000008754215,0.007546291,0.0004478192,0.00009113433,0.000012726066,3.3206024e-7,0.000012011717,0.0010299253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99811476,0.000026960062,0.000337842,0.00046850723,0.00067735853,0.00037454636],"domain_scores_gemma":[0.9979866,0.00011456937,0.00042365515,0.00053684076,0.0008120526,0.00012626681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007019489,0.00020104519,0.0002358775,0.0001413031,0.0009840993,0.0008361246,0.0028433674,0.00007197766,0.00007756378],"category_scores_gemma":[0.00070105493,0.00013660504,0.00006711851,0.00030165236,0.0005572603,0.00069452537,0.0005709074,0.00039805044,0.0001255101],"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.000068389054,0.00006576577,0.00024624984,0.000012539396,0.000014864263,9.2766606e-7,0.00084392395,0.00019379547,0.008998481,0.9154179,0.000053731168,0.07408344],"study_design_scores_gemma":[0.00019597738,0.00060808077,0.0048144297,0.0005864232,0.000017769527,0.000024589437,0.0012703293,0.1577706,0.50494456,0.3287628,0.00040646727,0.00059794093],"about_ca_topic_score_codex":0.00044231053,"about_ca_topic_score_gemma":0.000026286607,"teacher_disagreement_score":0.5866551,"about_ca_system_score_codex":0.000041722866,"about_ca_system_score_gemma":0.00031833025,"threshold_uncertainty_score":0.80627686},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9775901,0.000010535686,0.0049123373,0.0143756885,0.000092160735,0.0005816255,0.000038512575,0.00010088501,0.0022981707],"genre_scores_gemma":[0.9979038,0.00001532763,0.0014160214,0.00009056591,0.000046451583,0.000058866906,6.2126884e-7,0.000019257805,0.0004490876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986349,0.000027051414,0.00042333503,0.00035961406,0.00031623343,0.0002389186],"domain_scores_gemma":[0.99846756,0.00036256647,0.00039234644,0.00022153324,0.0004553413,0.000100673955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022574012,0.00021682975,0.00027085756,0.00008275903,0.00023378595,0.000075750424,0.00043365,0.000085259795,0.00011943726],"category_scores_gemma":[0.00051759614,0.00011832013,0.00009151225,0.00020049221,0.00051115954,0.0001350016,0.00011152266,0.00015985883,0.000042328124],"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.00020536486,0.00032017147,0.0012868651,0.00006367483,0.0000125728875,3.165784e-7,0.00090858317,0.0000016164345,0.18658437,0.78333503,0.00051972247,0.026761688],"study_design_scores_gemma":[0.000086671826,0.00012871038,0.0009785038,0.000675075,0.00003322972,0.0000027564693,0.0010641874,0.0036869461,0.7629997,0.23004876,0.00010333298,0.00019210255],"about_ca_topic_score_codex":0.000019102585,"about_ca_topic_score_gemma":0.000020080486,"teacher_disagreement_score":0.57641536,"about_ca_system_score_codex":0.000034151482,"about_ca_system_score_gemma":0.000029787041,"threshold_uncertainty_score":0.4824955},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78533465,0.000046481342,0.17429902,0.011815888,0.0010224306,0.0006492566,0.00000831941,0.0003107241,0.026513254],"genre_scores_gemma":[0.9963181,0.000009898394,0.002979367,0.00015484534,0.00007399027,0.000018208373,4.82553e-8,0.000014303531,0.00043121795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978171,0.00003005572,0.0005332376,0.00059674296,0.0005731987,0.00044966937],"domain_scores_gemma":[0.9978605,0.00020763786,0.00041339584,0.00044701036,0.00095299643,0.00011844943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065879815,0.00025357868,0.00027692542,0.00014470636,0.0003211391,0.00027355098,0.0017350707,0.00009130444,0.00004519776],"category_scores_gemma":[0.0006375012,0.00014564769,0.00012789453,0.0009555883,0.00038067324,0.00018715921,0.00043314556,0.00018917485,0.00014387266],"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.000030601957,0.00008211755,0.0001122267,0.000014361054,0.000011704092,7.0789883e-7,0.0014223355,0.00021395505,0.21550496,0.69178617,0.00015802371,0.090662844],"study_design_scores_gemma":[0.000048579157,0.00015403512,0.00017385636,0.0005848453,0.0000094734,0.0000080604195,0.0005984091,0.04029527,0.91122276,0.04639388,0.0002249296,0.0002859288],"about_ca_topic_score_codex":0.000013327009,"about_ca_topic_score_gemma":0.000003443478,"teacher_disagreement_score":0.69571775,"about_ca_system_score_codex":0.000078138044,"about_ca_system_score_gemma":0.00013673623,"threshold_uncertainty_score":0.59393406},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9638435,0.000019144813,0.013756033,0.007243987,0.00047441022,0.00024283763,0.000004351155,0.00003989463,0.0143757975],"genre_scores_gemma":[0.998542,0.000022505701,0.001124663,0.000041308656,0.000068585316,0.000008869259,4.794023e-7,0.000005049115,0.00018653968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984912,0.000011607807,0.00041671988,0.0003725348,0.00046752425,0.00024039001],"domain_scores_gemma":[0.9988372,0.000079352685,0.00048257585,0.00035152092,0.0002005341,0.00004881955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055760593,0.0001475519,0.0002391019,0.00013074135,0.0003511449,0.00066088856,0.0025514036,0.000057040965,0.00004775436],"category_scores_gemma":[0.0004054856,0.00011272429,0.00010522851,0.00019764745,0.00023357492,0.0009125438,0.00061957806,0.00018583369,0.00003526956],"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.000011592445,0.000047457535,0.09184756,0.0000151472605,0.000022928405,5.575682e-7,0.0015814498,0.000052907562,0.006838004,0.87381405,0.000044765544,0.025723562],"study_design_scores_gemma":[0.000089272595,0.00009888723,0.14633964,0.00042150717,0.000024900963,0.0000012770776,0.0013033312,0.060576078,0.58521,0.20541237,0.000090647685,0.0004320786],"about_ca_topic_score_codex":0.000133655,"about_ca_topic_score_gemma":0.00004083862,"teacher_disagreement_score":0.6684017,"about_ca_system_score_codex":0.000034137913,"about_ca_system_score_gemma":0.000060602484,"threshold_uncertainty_score":0.6372963},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18498671,0.000019302553,0.8061517,0.0009264852,0.00077964796,0.0019732658,0.000007182832,0.00006658245,0.005089107],"genre_scores_gemma":[0.8815126,0.0000022160868,0.11811413,0.00006981583,0.00010873516,0.00014593203,6.1997343e-7,0.000011729678,0.000034244462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975374,0.00011205297,0.00079090154,0.0005666017,0.0006975083,0.00029557617],"domain_scores_gemma":[0.99601936,0.0001723426,0.0005766864,0.0005644841,0.0025841345,0.00008300849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048539625,0.00019287986,0.00036712675,0.00013499222,0.00019985466,0.00040131345,0.0037603532,0.000093933086,0.000037017122],"category_scores_gemma":[0.0007927412,0.0001483833,0.000086963926,0.0004986056,0.00018142129,0.0007952574,0.00050357747,0.00011600813,0.000013481101],"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.000028462471,0.00010974131,0.000032074928,0.000069030706,0.000015538455,1.9927262e-8,0.0024982058,0.00024830375,0.04483236,0.8040802,0.000031675627,0.14805438],"study_design_scores_gemma":[0.00005149189,0.00023219423,0.000028790491,0.00015152156,0.000020631765,0.0000013292149,0.0003998284,0.60065305,0.13540557,0.26293665,0.000015810432,0.00010313508],"about_ca_topic_score_codex":0.00020164592,"about_ca_topic_score_gemma":0.000028577455,"teacher_disagreement_score":0.6965259,"about_ca_system_score_codex":0.000069033056,"about_ca_system_score_gemma":0.00027842028,"threshold_uncertainty_score":0.69877344},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028911573,0.0000072342227,0.97949034,0.0010362939,0.0006558921,0.00041586993,4.0186242e-7,0.00020009733,0.015302712],"genre_scores_gemma":[0.9133315,0.000024136189,0.08332956,0.0002385959,0.00013481174,0.000019888645,5.478779e-7,0.000019633459,0.002901307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99726117,0.000029451421,0.0007430391,0.00058646506,0.0008140761,0.0005658161],"domain_scores_gemma":[0.9975198,0.000087060966,0.00064876553,0.00045446932,0.0011587479,0.00013117744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007418666,0.000309026,0.0002912106,0.00019480371,0.000495519,0.00041521236,0.0028599845,0.00012095671,0.00012575167],"category_scores_gemma":[0.000633862,0.00024228597,0.00014116598,0.00089949113,0.0005071139,0.0005502939,0.0009153195,0.00055079133,0.0004037424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052892916,0.00014796873,0.00039828022,0.0000670603,0.00006339402,0.0000014758173,0.004897086,0.028348925,0.029426862,0.7260391,0.00029887757,0.21025805],"study_design_scores_gemma":[0.00004546647,0.0004822668,0.00007046048,0.00017876511,0.000010132586,0.0000042981364,0.0004791254,0.8288441,0.16619682,0.0026358375,0.0008069917,0.0002457839],"about_ca_topic_score_codex":0.00005174801,"about_ca_topic_score_gemma":0.0000038250487,"teacher_disagreement_score":0.9104404,"about_ca_system_score_codex":0.000091223235,"about_ca_system_score_gemma":0.00012227043,"threshold_uncertainty_score":0.9880135},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3420498,0.00009251417,0.63061535,0.0012145216,0.0015144177,0.0015054845,0.00021635696,0.0008957493,0.021895768],"genre_scores_gemma":[0.99724066,0.00004314706,0.0024797723,0.000009966583,0.000089635,0.00001721625,0.0000067871147,0.000016587936,0.00009623363],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990809,0.0000030751733,0.00027840093,0.0002762402,0.00018301743,0.00017835923],"domain_scores_gemma":[0.99868083,0.00004000327,0.00022108067,0.0006982006,0.00032455174,0.00003533557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001693821,0.00014419486,0.00022576965,0.00010653702,0.0002626375,0.00026579123,0.0016509492,0.00007221841,0.000032770222],"category_scores_gemma":[0.00037615013,0.000116134506,0.00009719763,0.0001775706,0.00011043561,0.0002966182,0.000221218,0.00011007569,0.000007708563],"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.00016450805,0.00015686463,0.0026417458,0.00012352421,0.0006811397,4.7426408e-7,0.0012495127,0.0027770682,0.47415695,0.43140155,0.0038112157,0.08283547],"study_design_scores_gemma":[0.000011504279,0.000028330915,0.0003406531,0.000059711194,0.00011448664,2.567468e-7,0.00013306654,0.31399915,0.6476088,0.037348684,0.00022536544,0.00012994626],"about_ca_topic_score_codex":0.000045595905,"about_ca_topic_score_gemma":0.00002525156,"teacher_disagreement_score":0.6551908,"about_ca_system_score_codex":0.00002119875,"about_ca_system_score_gemma":0.000014710552,"threshold_uncertainty_score":0.47358277},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07966634,0.000014318169,0.912864,0.0040588784,0.0004544891,0.0003777137,0.000007569011,0.000054768283,0.0025019224],"genre_scores_gemma":[0.9805498,0.000109067434,0.018845955,0.00010292701,0.000050241273,0.00003131237,4.1954792e-7,0.000009406275,0.00030087057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871236,0.000008609003,0.0003362002,0.00043882563,0.00025110148,0.00025291287],"domain_scores_gemma":[0.99839234,0.000054237888,0.000491461,0.00036996964,0.0006120459,0.00007996772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004135352,0.00017222672,0.00018726157,0.00007091468,0.00065074494,0.0008486864,0.0015676029,0.00005386104,0.000014963423],"category_scores_gemma":[0.00038290006,0.00013332916,0.00006579987,0.00008539462,0.00023741779,0.0008545278,0.0003061534,0.00016788312,0.000011493364],"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.00007742668,0.00007983086,0.000109098546,0.00006302319,0.000014098923,2.3051209e-7,0.00058944465,0.0012421776,0.0106125,0.7176135,0.00016724174,0.26943138],"study_design_scores_gemma":[0.00002583225,0.00011035604,0.00009586079,0.00008991689,0.0000069353605,0.0000027571919,0.000033963173,0.5655491,0.24402118,0.18990259,0.00003530056,0.00012622132],"about_ca_topic_score_codex":0.000030319572,"about_ca_topic_score_gemma":0.0000061646415,"teacher_disagreement_score":0.90088344,"about_ca_system_score_codex":0.000023588733,"about_ca_system_score_gemma":0.00006773343,"threshold_uncertainty_score":0.81839025},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3323093,0.000088341236,0.56075805,0.07851659,0.0005860975,0.0037861052,0.000023502771,0.00013583382,0.023796191],"genre_scores_gemma":[0.99417514,0.00010208346,0.005384892,0.000078397825,0.000033193348,0.00004583065,3.5178775e-7,0.0000076292936,0.00017246934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980693,0.000065549524,0.00046785478,0.00043914828,0.0006398093,0.00031833092],"domain_scores_gemma":[0.9983843,0.00019616746,0.0002681482,0.000489649,0.0005776251,0.00008413809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001627176,0.00016229878,0.00025779475,0.00011958607,0.0005549934,0.0009025902,0.0025750813,0.00006136632,0.000032318872],"category_scores_gemma":[0.0010639278,0.000096306016,0.00006341063,0.00032169328,0.001025835,0.00046176597,0.0004931852,0.00039784002,0.000022215298],"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.0001861459,0.00022112766,0.00005297657,0.00005228181,0.000008637615,0.0000013858831,0.003131335,0.00021049798,0.002605572,0.87081313,0.000032995595,0.122683935],"study_design_scores_gemma":[0.00034491814,0.00012465441,0.00046103267,0.00015422751,0.0000073694823,0.0000063516673,0.00031071357,0.8539197,0.034317788,0.11019044,0.000021231352,0.00014159988],"about_ca_topic_score_codex":0.00013759195,"about_ca_topic_score_gemma":0.000016162367,"teacher_disagreement_score":0.85370916,"about_ca_system_score_codex":0.000029699437,"about_ca_system_score_gemma":0.00009067506,"threshold_uncertainty_score":0.8703698},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5216956,0.000012526364,0.47008538,0.0022456672,0.00016294868,0.00025568157,0.0000032839482,0.000085879845,0.005453001],"genre_scores_gemma":[0.9906761,0.000008922135,0.0090648895,0.000083276456,0.00003104239,0.000021770893,5.132884e-7,0.0000098572555,0.00010364763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978609,0.000015914098,0.0005000788,0.0006506623,0.0005971993,0.00037526237],"domain_scores_gemma":[0.9972777,0.00008791777,0.0008378211,0.0008718543,0.00081511406,0.00010963468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005781068,0.0002585245,0.0003532056,0.00016799652,0.0005939822,0.0007753682,0.002882686,0.00009223031,0.00003725734],"category_scores_gemma":[0.00030799385,0.00017246553,0.00017009627,0.0006478187,0.00042152806,0.00036373961,0.00033987657,0.00027455532,0.000040981966],"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.000106036925,0.00025132098,0.019880053,0.000034788267,0.00019921408,0.0000015825218,0.0011598656,0.0071537807,0.010683126,0.9069561,0.00002065518,0.05355353],"study_design_scores_gemma":[0.00002715662,0.00014356647,0.0071228086,0.0000992233,0.00008619495,0.0000028947613,0.00007230464,0.8071073,0.111070864,0.07400847,0.000004039562,0.00025517298],"about_ca_topic_score_codex":0.00010941518,"about_ca_topic_score_gemma":0.00006982473,"teacher_disagreement_score":0.83294755,"about_ca_system_score_codex":0.000037576923,"about_ca_system_score_gemma":0.00007790766,"threshold_uncertainty_score":0.7476893},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63879126,0.00005272848,0.048725996,0.0066824043,0.0030190507,0.0016107301,0.00001935252,0.00016284171,0.30093563],"genre_scores_gemma":[0.99897724,0.000022089003,0.00044642994,0.00005487242,0.00030049717,0.000026044208,5.474283e-7,0.0000072004723,0.00016510196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982492,0.000023936598,0.00053721113,0.00022136915,0.0006140163,0.0003542661],"domain_scores_gemma":[0.99755365,0.00008545322,0.00093471364,0.00021385813,0.0011364259,0.000075918346],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0009241739,0.00014562589,0.00020486838,0.00007700424,0.0042396244,0.0005132285,0.0010241993,0.00010446272,0.00010323045],"category_scores_gemma":[0.0012685179,0.00012115788,0.0001286792,0.00018866318,0.001412686,0.00057420717,0.00025545887,0.00021197383,0.000024461926],"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.000026751557,0.000047311867,0.010300369,0.000015718271,0.00002935096,1.263124e-7,0.008628761,0.00045542206,0.0007672608,0.9719276,0.00002825725,0.007773106],"study_design_scores_gemma":[0.00016182837,0.00020914686,0.035701536,0.0015807783,0.00016764792,0.000009884313,0.0727769,0.5124603,0.02128408,0.3539348,0.00057138695,0.001141712],"about_ca_topic_score_codex":0.0050585447,"about_ca_topic_score_gemma":0.0013751249,"teacher_disagreement_score":0.61799276,"about_ca_system_score_codex":0.00007763896,"about_ca_system_score_gemma":0.00011154937,"threshold_uncertainty_score":0.9970567},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5627076,0.000045654513,0.37774986,0.0014633324,0.0011659584,0.0030386571,0.000049805865,0.00077992165,0.052999184],"genre_scores_gemma":[0.9935859,0.000019516618,0.0061432915,0.000029802552,0.0000768666,0.000055561373,0.0000017674455,0.000021129043,0.00006615395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991309,0.000004385015,0.00029100673,0.00020647346,0.00017977455,0.00018746275],"domain_scores_gemma":[0.998979,0.000035233697,0.00025703537,0.0002236614,0.00046995538,0.00003513904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013346052,0.00016396385,0.0001988171,0.000058792328,0.00029822375,0.00020651238,0.0006269687,0.00008456389,0.00001270977],"category_scores_gemma":[0.00015190388,0.0001360507,0.00007968693,0.00006285186,0.0001853543,0.00026956212,0.000080146674,0.00013641438,0.000009100742],"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.0003255996,0.000118908894,0.00026777148,0.00013150468,0.00006453245,3.372937e-7,0.0012263719,0.0030252417,0.38245472,0.5386233,0.0008109096,0.072950825],"study_design_scores_gemma":[0.000019625139,0.00006139843,0.00012840616,0.00015182338,0.000010759384,7.4693776e-7,0.000071670394,0.3827431,0.5718558,0.04481684,0.0000385273,0.00010130003],"about_ca_topic_score_codex":0.00001082164,"about_ca_topic_score_gemma":0.000002839586,"teacher_disagreement_score":0.49380642,"about_ca_system_score_codex":0.00003052489,"about_ca_system_score_gemma":0.000016298598,"threshold_uncertainty_score":0.55479866},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57081026,0.000020811953,0.3578767,0.0010628802,0.0006528016,0.0021512592,0.000086886845,0.0007872616,0.066551134],"genre_scores_gemma":[0.997232,0.00001957565,0.0025709576,0.000032172124,0.000057157664,0.000045949946,0.0000028612815,0.000014340731,0.000024964895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99916553,0.0000029699665,0.00028712707,0.00013328831,0.00021860088,0.00019247376],"domain_scores_gemma":[0.9988946,0.00004322728,0.0002856397,0.00020498023,0.0005339067,0.000037679805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016209496,0.00015752064,0.00019703094,0.00007301141,0.0003113293,0.0002678287,0.00054936303,0.00007012374,0.0000133504545],"category_scores_gemma":[0.00016889385,0.0001184738,0.00005634647,0.00005677792,0.00021402625,0.0005756022,0.000052596402,0.00015437469,0.0000151528275],"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.0011558894,0.00010529757,0.0012350638,0.00038906024,0.00017972935,6.288732e-7,0.0033253063,0.011026009,0.26268706,0.6437753,0.0036325268,0.07248812],"study_design_scores_gemma":[0.000034264067,0.00015483727,0.00034111287,0.00031974842,0.000018924813,0.0000024182998,0.00037145233,0.2913343,0.6869814,0.01997289,0.0003318306,0.00013684551],"about_ca_topic_score_codex":0.000022822353,"about_ca_topic_score_gemma":0.0000044064477,"teacher_disagreement_score":0.6238024,"about_ca_system_score_codex":0.00003779526,"about_ca_system_score_gemma":0.000021092605,"threshold_uncertainty_score":0.4831221},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95910037,0.000026289777,0.014432193,0.0029785174,0.0004641366,0.0005276212,0.0000028780446,0.00018321625,0.02228476],"genre_scores_gemma":[0.9944703,0.000010215895,0.0047513857,0.00026154894,0.00009427654,0.000021509413,2.1408447e-7,0.000019627834,0.00037090332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99740726,0.00003454659,0.0006119899,0.0007453341,0.00067327474,0.0005276014],"domain_scores_gemma":[0.9965451,0.00012936546,0.0010563849,0.0011189984,0.0010111409,0.00013905163],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009963021,0.00032959835,0.0004330478,0.00010288389,0.0013557508,0.0012105044,0.0030806847,0.00011095285,0.000018778393],"category_scores_gemma":[0.0004815404,0.00022690599,0.00014031985,0.00030114825,0.00069518905,0.0009115567,0.00062462647,0.00040682056,0.000050045815],"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.00019079626,0.00027418352,0.0044209883,0.00017834404,0.00006840908,0.00000606702,0.0038128316,0.00060628797,0.10168912,0.709237,0.00016403246,0.17935193],"study_design_scores_gemma":[0.00009547677,0.00038727635,0.0066559305,0.0009526199,0.000032298776,0.000029604857,0.0017728251,0.03497813,0.9210269,0.03301634,0.00038531277,0.0006672948],"about_ca_topic_score_codex":0.00039865932,"about_ca_topic_score_gemma":0.00011968371,"teacher_disagreement_score":0.8193378,"about_ca_system_score_codex":0.000053262578,"about_ca_system_score_gemma":0.00016252125,"threshold_uncertainty_score":0.9999443},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.929774,0.000016380834,0.05635506,0.0045567323,0.0022043802,0.0018338471,0.00001938881,0.0000636745,0.0051765377],"genre_scores_gemma":[0.9953001,0.0000066967245,0.00461343,0.000023652181,0.000025935908,0.00001067975,2.3080902e-7,0.0000069439307,0.000012335088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99827415,0.000021839722,0.000682575,0.0003189301,0.0004750269,0.00022747197],"domain_scores_gemma":[0.99762577,0.000055044206,0.0011799508,0.00044932737,0.0006491239,0.00004079919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043314244,0.00017011775,0.00028217165,0.00009035254,0.00023094632,0.00018556177,0.0020516205,0.000103649356,0.00001209928],"category_scores_gemma":[0.0005005587,0.00011655442,0.00011123654,0.00023549722,0.0007478646,0.00050418533,0.00043530832,0.00029453894,6.554969e-7],"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.000027553024,0.00009137236,0.0031081233,0.00008831423,0.000012778151,1.4229813e-7,0.005435238,0.0026957027,0.06390702,0.80618745,0.0000030903434,0.11844323],"study_design_scores_gemma":[0.00010791505,0.000083082894,0.0012337948,0.00059717265,0.00000964801,0.0000020928694,0.0011817749,0.28113496,0.52948844,0.18598792,0.0000057176308,0.00016749692],"about_ca_topic_score_codex":0.000072175535,"about_ca_topic_score_gemma":0.000047575322,"teacher_disagreement_score":0.6201995,"about_ca_system_score_codex":0.000034795346,"about_ca_system_score_gemma":0.00016751845,"threshold_uncertainty_score":0.47529516},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17483777,0.000042912903,0.6031104,0.118424445,0.006617785,0.003007478,0.00046086806,0.001069312,0.09242905],"genre_scores_gemma":[0.9917719,0.000033101056,0.007479994,0.00023831498,0.0002908714,0.000022567187,0.000007146315,0.000013701264,0.00014241647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99799925,0.000026785729,0.00058817596,0.00069086376,0.0003937842,0.00030115922],"domain_scores_gemma":[0.9973861,0.00007379422,0.000873811,0.0011319385,0.00046320792,0.00007114744],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0008173776,0.00022539546,0.000314231,0.000072889685,0.0008529305,0.0008824013,0.00700459,0.00013044452,0.000083651015],"category_scores_gemma":[0.00035316407,0.00017665351,0.00009326412,0.00015655851,0.00022030283,0.001416337,0.0019430387,0.00031177528,0.00007839998],"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.000041023042,0.00021313154,0.00042807535,0.00003689635,0.000039358045,5.919016e-7,0.0011202325,6.0690496e-7,0.02848026,0.69844246,0.0058790003,0.26531836],"study_design_scores_gemma":[0.00006017058,0.00013296776,0.0006907852,0.0002856013,0.000018811848,0.0000016160266,0.00027468117,0.07629843,0.7817715,0.13380039,0.0062678186,0.00039726763],"about_ca_topic_score_codex":0.00049018656,"about_ca_topic_score_gemma":0.00006884264,"teacher_disagreement_score":0.8169341,"about_ca_system_score_codex":0.00004154313,"about_ca_system_score_gemma":0.00008712381,"threshold_uncertainty_score":0.99836797},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96052766,0.000013215773,0.00595635,0.0074944543,0.000121205754,0.0010476621,0.000048822603,0.00004740595,0.024743203],"genre_scores_gemma":[0.9979891,0.0000067283077,0.00052011426,0.00006978244,0.00007553688,0.000047667418,0.0000012617083,0.000013457153,0.0012763432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997605,0.000032497188,0.00061461754,0.00062326377,0.00083207054,0.00029254527],"domain_scores_gemma":[0.99613875,0.00053146016,0.0012861941,0.00080735836,0.001133438,0.00010277748],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012515715,0.00021953823,0.0003529519,0.00014850745,0.0008346699,0.0013298049,0.0026620422,0.00008145538,0.00014495284],"category_scores_gemma":[0.0026909413,0.00012873019,0.00015563586,0.00039885897,0.0010368271,0.00048989896,0.00012936143,0.00020373386,0.0000361251],"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.0006940257,0.00009353506,0.0019956362,0.000015836447,0.00002845398,1.8516764e-7,0.0015949083,0.00053905783,0.026363375,0.9146495,0.001126672,0.052898824],"study_design_scores_gemma":[0.00005660271,0.00023625343,0.004585047,0.000096755466,0.000024681576,0.0000032200817,0.007833352,0.00327162,0.26382712,0.7193102,0.00058980193,0.00016532079],"about_ca_topic_score_codex":0.000057835205,"about_ca_topic_score_gemma":0.00006664492,"teacher_disagreement_score":0.23746374,"about_ca_system_score_codex":0.000016080403,"about_ca_system_score_gemma":0.000078687466,"threshold_uncertainty_score":0.9997069},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8973411,0.00035247058,0.053429246,0.04016059,0.0003268481,0.0042462572,0.00029176223,0.000043440083,0.0038082963],"genre_scores_gemma":[0.9985431,0.00014151567,0.00007242695,0.00038163064,0.00010171565,0.00022665638,0.000010334308,0.000014811346,0.0005078512],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808943,0.000016172135,0.000505963,0.00038362434,0.0006806167,0.00032418172],"domain_scores_gemma":[0.9964876,0.00033141216,0.00056667917,0.0003073652,0.002138786,0.00016816033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086412946,0.00018918514,0.00045086333,0.0002001691,0.0005713506,0.00012146709,0.00052592787,0.000037556598,0.0001751913],"category_scores_gemma":[0.0020273104,0.00011486499,0.00046400548,0.00027120055,0.0006969193,0.00015233373,0.00016776001,0.0002274245,0.000011041711],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.098106384,0.0041090935,0.077321544,0.0011716237,0.014481328,0.0000069440857,0.003786805,0.0011100143,0.046746336,0.2454595,0.0016359432,0.5060645],"study_design_scores_gemma":[0.0006091893,0.00046096224,0.08659536,0.00040369277,0.0058259517,0.000001173085,0.0007782688,0.7420292,0.14796695,0.015114906,0.00002654003,0.0001878171],"about_ca_topic_score_codex":0.00005546126,"about_ca_topic_score_gemma":0.000011414212,"teacher_disagreement_score":0.7409192,"about_ca_system_score_codex":0.00002826861,"about_ca_system_score_gemma":0.00032475428,"threshold_uncertainty_score":0.4684058},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9795552,0.000016773705,0.0049779257,0.00024651363,0.00028479038,0.00034147952,0.0000034803872,0.0003311592,0.014242663],"genre_scores_gemma":[0.9992795,0.00016474533,0.00035891365,0.000014423017,0.000034904893,0.000012015368,0.0000012786147,0.00002895847,0.00010528214],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987334,0.000010013198,0.0004508671,0.00024592382,0.00025768075,0.0003021228],"domain_scores_gemma":[0.9992101,0.000033167365,0.0002143342,0.0002452533,0.0002591506,0.000037949678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002923657,0.00020655649,0.00027788477,0.00018815527,0.00033444195,0.00022863995,0.00087961205,0.00017104893,0.00008990419],"category_scores_gemma":[0.0006219651,0.00017674948,0.00006706156,0.00029298486,0.00027219942,0.00035806122,0.00016381749,0.00031258352,0.00004544991],"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.00014904002,0.00014720556,0.048293747,0.0004257975,0.00005591331,0.0000031809618,0.0036449768,0.08896416,0.642706,0.15093556,0.00018324734,0.06449121],"study_design_scores_gemma":[0.000030496285,0.000028539556,0.0004734465,0.00024170309,0.0000074655923,9.848259e-7,0.00058471365,0.551622,0.43962324,0.0072097178,0.000026007696,0.0001516888],"about_ca_topic_score_codex":0.000138336,"about_ca_topic_score_gemma":0.000021633623,"teacher_disagreement_score":0.46265784,"about_ca_system_score_codex":0.000086163185,"about_ca_system_score_gemma":0.00003456789,"threshold_uncertainty_score":0.72076344},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.123186596,0.000050898463,0.7546152,0.11236661,0.000677992,0.0056169764,0.00021087997,0.00008323662,0.0031916462],"genre_scores_gemma":[0.9838477,0.000024918274,0.015300979,0.0000563149,0.000057731755,0.00036568707,4.862067e-7,0.000010219877,0.00033598958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859643,0.000017196968,0.00040755048,0.00027361754,0.00045600423,0.00024922797],"domain_scores_gemma":[0.9954675,0.0017932032,0.000740462,0.0002782035,0.0016910767,0.000029557297],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0014460406,0.00013369854,0.00019690994,0.000049568367,0.0017151553,0.00015802635,0.0018885713,0.00010756475,0.000010200973],"category_scores_gemma":[0.0034618473,0.000077973506,0.00016508094,0.00012000172,0.002035434,0.00025922377,0.00013383165,0.00017758325,0.0000017133264],"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.00013349236,0.00007692232,0.00021584805,0.000022383329,0.0000338056,6.0577676e-9,0.009673118,0.0017501306,0.0006027313,0.90016323,0.0003382254,0.08699011],"study_design_scores_gemma":[0.000054969463,0.0002713647,0.0014414183,0.000100167614,0.000042265805,1.0453219e-7,0.015566469,0.43376675,0.0060045077,0.542562,0.00010416951,0.00008581307],"about_ca_topic_score_codex":0.0004917537,"about_ca_topic_score_gemma":0.0009767406,"teacher_disagreement_score":0.8606611,"about_ca_system_score_codex":0.00005534739,"about_ca_system_score_gemma":0.00037511162,"threshold_uncertainty_score":0.9995845},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09098196,0.0000118964535,0.8882673,0.005985187,0.0006839925,0.00076199503,0.000008348266,0.000109535795,0.013189806],"genre_scores_gemma":[0.9602384,0.000014223479,0.038896333,0.00016017015,0.00009820502,0.000054700915,0.0000018707013,0.000013163025,0.0005229571],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835366,0.000019943926,0.0004684036,0.00045002092,0.00041881323,0.0002891452],"domain_scores_gemma":[0.99801034,0.000091561415,0.00068839465,0.00043447327,0.0006901588,0.00008507253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061522244,0.00019389232,0.00022568738,0.00009100002,0.00084746775,0.00080124853,0.001953581,0.000085146385,0.000029610314],"category_scores_gemma":[0.00073411636,0.00015498053,0.00014078153,0.00017380496,0.00021536209,0.0007534702,0.000237187,0.00015930904,0.000036511374],"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.00007694187,0.000042718457,0.00017198831,0.000023733477,0.000010374035,1.208995e-7,0.0024591626,0.0005171899,0.028322505,0.86044896,0.0000536454,0.10787267],"study_design_scores_gemma":[0.00011403024,0.00012411764,0.0012112001,0.000115886134,0.000009847875,0.000001572981,0.0008664812,0.6891104,0.068615146,0.23902562,0.00057796686,0.000227753],"about_ca_topic_score_codex":0.00003781412,"about_ca_topic_score_gemma":0.000017859258,"teacher_disagreement_score":0.86925644,"about_ca_system_score_codex":0.000042293796,"about_ca_system_score_gemma":0.00008156241,"threshold_uncertainty_score":0.7726458},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87501466,0.000034414898,0.09679161,0.0028765362,0.00047887562,0.0004521655,0.000002313043,0.00009947967,0.024249928],"genre_scores_gemma":[0.9931929,0.00004466545,0.0064801974,0.000062846215,0.000022499366,0.000017302033,1.5652108e-7,0.00000665343,0.00017274548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985177,0.000016418166,0.00040080678,0.0004481845,0.00027899008,0.00033789946],"domain_scores_gemma":[0.9988541,0.00007566392,0.00039596285,0.00036437836,0.00022355115,0.00008635584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066776684,0.00018190096,0.00024196108,0.0000706849,0.00041728865,0.0008410546,0.001858519,0.000075174445,0.000015717585],"category_scores_gemma":[0.0008988735,0.00013282124,0.000054560693,0.00015258284,0.0003134295,0.00085401087,0.00072997354,0.000245555,0.000026468544],"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.000041928022,0.00010487665,0.0042963796,0.000042629912,0.0000066696625,0.0000025555405,0.0029055085,0.0002023358,0.015009708,0.9040291,0.000020286987,0.07333808],"study_design_scores_gemma":[0.000058386966,0.00016622651,0.014131184,0.00027062712,0.000005415571,0.000005497918,0.00016381782,0.37681127,0.16507812,0.4430157,0.00005552857,0.00023823386],"about_ca_topic_score_codex":0.00010738146,"about_ca_topic_score_gemma":0.00012493004,"teacher_disagreement_score":0.46101335,"about_ca_system_score_codex":0.000035837656,"about_ca_system_score_gemma":0.000065933855,"threshold_uncertainty_score":0.81103086},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9262111,0.0000911676,0.044326317,0.004059232,0.00048148472,0.0006856394,0.000014965614,0.00018792065,0.02394213],"genre_scores_gemma":[0.993945,0.000016505628,0.0054909247,0.00019917966,0.00005731434,0.000019468049,4.864436e-7,0.000015465033,0.00025563216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981135,0.000013942747,0.00045334484,0.0005831107,0.00044056046,0.00039550124],"domain_scores_gemma":[0.9979834,0.00023386512,0.0008045743,0.00052497425,0.00032623336,0.0001269394],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00061682035,0.00029641387,0.00032983808,0.00012449932,0.00083818677,0.0012035967,0.002206123,0.000105398634,0.000015560814],"category_scores_gemma":[0.00046643076,0.00020768061,0.00006195664,0.00018308654,0.00048121827,0.0008408743,0.00045128842,0.000389178,0.000017855187],"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.000957502,0.00043754786,0.0821475,0.00060342636,0.00017822775,0.000060462684,0.022854233,0.0013200813,0.029017393,0.62918186,0.0006180932,0.23262368],"study_design_scores_gemma":[0.00031816828,0.0021342784,0.043870095,0.0049322275,0.00008816364,0.000055155204,0.001253443,0.62357396,0.1450791,0.17674038,0.00046178998,0.0014932217],"about_ca_topic_score_codex":0.00007146729,"about_ca_topic_score_gemma":0.000008974448,"teacher_disagreement_score":0.6222539,"about_ca_system_score_codex":0.000016379152,"about_ca_system_score_gemma":0.00013402982,"threshold_uncertainty_score":0.9998332},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8940745,0.000008805054,0.0839854,0.0043614293,0.0016388032,0.00057538657,0.0000020085183,0.00007622281,0.015277458],"genre_scores_gemma":[0.9992236,0.000022677083,0.00042796443,0.00003137256,0.00007911984,0.000020906076,3.2031335e-7,0.000005304161,0.00018873041],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99870676,0.000016266771,0.00040722702,0.00032243476,0.00035997454,0.00018733427],"domain_scores_gemma":[0.99857277,0.000042663953,0.00067247084,0.0003522486,0.00032234602,0.000037477468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006187327,0.00013134333,0.0001545646,0.00010731305,0.00038283694,0.000468151,0.0011955036,0.00008582295,0.000022671893],"category_scores_gemma":[0.00045566107,0.00010078217,0.00006374981,0.00015792905,0.00011523207,0.0012571173,0.00015945824,0.00018856327,0.00006511651],"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.000029214518,0.000076230186,0.0009986426,0.000024672085,0.000004269912,2.1563847e-7,0.0012615813,0.00007688011,0.07889758,0.827708,0.000020134728,0.09090257],"study_design_scores_gemma":[0.0000429576,0.00006981504,0.030600084,0.00019901569,0.0000050918266,0.0000024746894,0.0005371136,0.13646182,0.6903932,0.14147499,0.00004524428,0.00016819926],"about_ca_topic_score_codex":0.00039214696,"about_ca_topic_score_gemma":0.00020702773,"teacher_disagreement_score":0.686233,"about_ca_system_score_codex":0.00006903777,"about_ca_system_score_gemma":0.000046746263,"threshold_uncertainty_score":0.45143908},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56271434,0.00012705565,0.2638744,0.020529626,0.004588694,0.0018548681,0.000008494451,0.0007573134,0.14554518],"genre_scores_gemma":[0.988738,0.000031472966,0.01048179,0.00022998196,0.00015831474,0.00002013513,1.7793514e-7,0.000015583151,0.00032452503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980026,0.000048526606,0.0005021336,0.00042279158,0.00047353603,0.00055045215],"domain_scores_gemma":[0.9969682,0.00017992903,0.00086134695,0.0013502191,0.00052517507,0.00011514026],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009223125,0.00026260415,0.00030599968,0.000063042186,0.0022225755,0.000862438,0.008760423,0.000105977015,0.00002512496],"category_scores_gemma":[0.0009485787,0.00020326865,0.00015330511,0.00034576538,0.00050182873,0.0013013349,0.0027729436,0.0009041574,0.000033434415],"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.000034549546,0.00007893779,0.0009864944,0.000030628555,0.000015531421,6.9239104e-7,0.0007696782,0.0018216589,0.0054738563,0.93328565,0.00060028123,0.05690203],"study_design_scores_gemma":[0.000026612426,0.0001305293,0.0017254134,0.0004520589,0.000009113089,0.000004940029,0.0002023415,0.22725996,0.090092905,0.6796217,0.00018740272,0.00028700763],"about_ca_topic_score_codex":0.00008734123,"about_ca_topic_score_gemma":0.000042738382,"teacher_disagreement_score":0.42602366,"about_ca_system_score_codex":0.000034090088,"about_ca_system_score_gemma":0.000043901302,"threshold_uncertainty_score":0.99907637},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.091626644,0.000007805562,0.8956637,0.0071245506,0.0007617421,0.00068927224,0.0000214106,0.00011043494,0.003994473],"genre_scores_gemma":[0.9650316,0.000008383333,0.034521054,0.00011415869,0.00011173632,0.00005342911,5.1572346e-7,0.000011584878,0.0001475318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99814767,0.0000070791557,0.0004905668,0.00058075396,0.00036766028,0.00040625152],"domain_scores_gemma":[0.9975216,0.00017295741,0.0007152311,0.0006511871,0.0008471799,0.0000918759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005512952,0.00022037045,0.00028041558,0.00007052679,0.0008290961,0.00086062064,0.0040791472,0.000092904345,0.000014667882],"category_scores_gemma":[0.0020811271,0.00017161982,0.00015649044,0.00016964467,0.00028179327,0.0007420554,0.00072478375,0.00024322484,0.000020332402],"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.00004094635,0.00004550161,0.00015359053,0.000030465093,0.000013739948,1.2384817e-7,0.000854276,0.00012881168,0.009086064,0.8988455,0.00007020081,0.09073081],"study_design_scores_gemma":[0.000040320752,0.000075159216,0.00031415583,0.00022325471,0.000010324865,0.0000015119684,0.00029188642,0.26153672,0.26519522,0.47193566,0.00016722232,0.00020856921],"about_ca_topic_score_codex":0.000056042212,"about_ca_topic_score_gemma":0.0000112538255,"teacher_disagreement_score":0.873405,"about_ca_system_score_codex":0.000053718366,"about_ca_system_score_gemma":0.000086668726,"threshold_uncertainty_score":0.8298985},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30117732,0.000012627473,0.65804005,0.0110083325,0.00055700156,0.00074331654,0.0000035989574,0.00020981852,0.028247923],"genre_scores_gemma":[0.97716,0.000014829233,0.022312919,0.00016758149,0.00004821101,0.000029706775,7.0833886e-7,0.000014302635,0.0002517809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99806553,0.000033511304,0.00043987978,0.0005122117,0.00062885176,0.00032002677],"domain_scores_gemma":[0.9979809,0.00007363888,0.00077375193,0.0005594192,0.0005101893,0.000102089674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007800834,0.00022517762,0.00023649687,0.0001168138,0.0008117011,0.0009809994,0.0023220722,0.00009409693,0.00004834684],"category_scores_gemma":[0.0004032297,0.00016306707,0.00008728104,0.00027485375,0.000316964,0.0011070332,0.00027996537,0.00032862273,0.00012377602],"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.0001394952,0.00007817901,0.00057314296,0.000018358674,0.00002028165,0.0000010890349,0.004708686,0.0002636398,0.009523825,0.94748557,0.000013096043,0.037174612],"study_design_scores_gemma":[0.0003242975,0.0006844813,0.030474061,0.0006286687,0.000039235438,0.000011960466,0.0028050519,0.38012266,0.08413083,0.4995685,0.00049181626,0.0007184538],"about_ca_topic_score_codex":0.000092470196,"about_ca_topic_score_gemma":0.000048273367,"teacher_disagreement_score":0.67598265,"about_ca_system_score_codex":0.000047347174,"about_ca_system_score_gemma":0.00013017544,"threshold_uncertainty_score":0.94598},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73979837,0.00007809824,0.062190287,0.057474524,0.009397989,0.0019523692,0.000015868816,0.00060931593,0.1284832],"genre_scores_gemma":[0.99641585,0.0001194197,0.0022468574,0.00021362997,0.00006032374,0.000014891236,3.6592908e-7,0.000008969498,0.00091970863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99835163,0.000007778731,0.0004324346,0.00046358744,0.0004585197,0.000286071],"domain_scores_gemma":[0.99801666,0.000053995984,0.0006747627,0.0006071179,0.00054459576,0.00010288248],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00038663304,0.00019610798,0.00020344702,0.000089490684,0.0007736001,0.0015554728,0.0024278243,0.00009530692,0.000322468],"category_scores_gemma":[0.00044187641,0.00015335137,0.00012361498,0.00015350059,0.00040122384,0.0019691086,0.0005980022,0.0002271128,0.00021547837],"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.00005153498,0.00008223574,0.00044389704,0.000019596111,0.000013192041,8.2407695e-7,0.00081170327,0.00004035315,0.02237197,0.67783695,0.000231442,0.2980963],"study_design_scores_gemma":[0.00007736797,0.00014824628,0.02339295,0.00039467,0.000017191374,0.000016261309,0.0007112198,0.06299443,0.79662377,0.11464499,0.00051362993,0.00046525444],"about_ca_topic_score_codex":0.00003037626,"about_ca_topic_score_gemma":0.000044572622,"teacher_disagreement_score":0.7742518,"about_ca_system_score_codex":0.0000636047,"about_ca_system_score_gemma":0.00008386823,"threshold_uncertainty_score":0.999481},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8858337,0.000008308073,0.096992224,0.001016284,0.00016277841,0.0006738413,0.000007268336,0.000032923057,0.0152727235],"genre_scores_gemma":[0.9977972,0.0000046780347,0.0017348559,0.00003090914,0.0001883049,0.000059916616,0.000001010067,0.0000121774565,0.00017093585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987809,0.000005721639,0.00039434448,0.00032934797,0.00019309296,0.00029656017],"domain_scores_gemma":[0.99889046,0.000034109937,0.0005248018,0.00026713146,0.00022304845,0.000060427166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032678546,0.00018648703,0.0003047308,0.00006211204,0.0006253849,0.00040466446,0.00073405355,0.000031446067,0.000042008352],"category_scores_gemma":[0.00004153824,0.00015132058,0.00013821253,0.00006306218,0.00022696213,0.00019702455,0.00061927445,0.00015432753,0.0000025875963],"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.00017805574,0.00013516318,0.05114303,0.00008990726,0.00014180258,9.1775746e-8,0.00097096927,0.0006812729,0.026833095,0.77696013,0.00020343381,0.14266308],"study_design_scores_gemma":[0.00007962541,0.00009309259,0.0050830483,0.00041116602,0.000058608603,4.74064e-7,0.0008060301,0.77592546,0.06368938,0.15343265,0.000123188,0.00029729668],"about_ca_topic_score_codex":0.00040635112,"about_ca_topic_score_gemma":0.00005763542,"teacher_disagreement_score":0.7752442,"about_ca_system_score_codex":0.000028134098,"about_ca_system_score_gemma":0.000020919753,"threshold_uncertainty_score":0.6170674},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9861711,0.000003320028,0.007061303,0.003011729,0.0005025753,0.0004934692,0.000007309267,0.00013567969,0.002613495],"genre_scores_gemma":[0.99815387,0.00002023758,0.0010790848,0.00036506905,0.00012127365,0.0000100715315,3.0174567e-7,0.00003734849,0.00021275374],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99770933,0.000025218027,0.0005017603,0.000704127,0.0006103811,0.00044915194],"domain_scores_gemma":[0.9984215,0.00008055767,0.00062022463,0.00036178034,0.000398984,0.00011693534],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00037386958,0.0002888963,0.0002775808,0.00020352773,0.0013600491,0.0010453966,0.001559822,0.00010431381,0.000021784876],"category_scores_gemma":[0.0025567745,0.00023380642,0.00011293707,0.00041024992,0.00017942803,0.0007773551,0.000455112,0.00044211137,0.000027125543],"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.000076808385,0.00008626514,0.00037834543,0.000033027456,0.0000043678174,9.19576e-7,0.0009206947,0.004224335,0.91516244,0.035892785,0.000015257086,0.043204773],"study_design_scores_gemma":[0.00002265874,0.000057991092,0.00068694167,0.0001532997,0.000015454285,0.000005150084,0.00012670452,0.45413318,0.5178455,0.026768595,0.000009583374,0.00017495369],"about_ca_topic_score_codex":0.00012782912,"about_ca_topic_score_gemma":0.000012994679,"teacher_disagreement_score":0.44990885,"about_ca_system_score_codex":0.00011013379,"about_ca_system_score_gemma":0.000068966285,"threshold_uncertainty_score":0.9999916},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18390933,0.000107700886,0.79643774,0.003046196,0.0024825276,0.00078322453,0.000025197358,0.00029257633,0.012915496],"genre_scores_gemma":[0.9828087,0.00003861426,0.016585976,0.00006311487,0.00022218187,0.000022520797,0.0000017762077,0.000022040475,0.00023506065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968235,0.00006184967,0.0008971671,0.000884976,0.000897789,0.00043475415],"domain_scores_gemma":[0.9963377,0.00026297037,0.0013817701,0.0006024282,0.001308943,0.0001061676],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010565982,0.0004191868,0.0005840354,0.00025674643,0.00023701394,0.00030067758,0.004286104,0.00026399508,0.00009818826],"category_scores_gemma":[0.0018492695,0.00031260008,0.00031383795,0.0005647873,0.00052649766,0.000091285176,0.0027316976,0.0013888979,0.000046053916],"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.00004469099,0.00022968819,0.0003355911,0.0002895691,0.000048260878,4.1770878e-7,0.0030996094,0.0071829865,0.007811511,0.90129125,0.0001592135,0.07950721],"study_design_scores_gemma":[0.000015833955,0.00021928216,0.00012429665,0.0007420127,0.000018568118,0.0000020564835,0.00014038837,0.642589,0.24477637,0.110974014,0.00012381929,0.00027438064],"about_ca_topic_score_codex":0.00024012175,"about_ca_topic_score_gemma":0.0000012287818,"teacher_disagreement_score":0.7988994,"about_ca_system_score_codex":0.000045260495,"about_ca_system_score_gemma":0.0002256694,"threshold_uncertainty_score":0.9999326},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005450459,0.000008330595,0.98826694,0.0013231328,0.001499216,0.0015036094,0.000019475929,0.000088300134,0.0018405325],"genre_scores_gemma":[0.47757077,0.0000018035402,0.5219958,0.000037032503,0.00011288354,0.00018896279,9.2107825e-7,0.000015558675,0.00007629507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978592,0.0000398242,0.000505863,0.0007318153,0.00032743585,0.00053588167],"domain_scores_gemma":[0.99626344,0.0009997499,0.0007033346,0.0007901825,0.0010893517,0.0001539235],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.00190471,0.00026259656,0.00036288306,0.00010051966,0.0010278559,0.0008696013,0.0045793727,0.00010374858,0.0000040106756],"category_scores_gemma":[0.009088306,0.00020753068,0.00016592845,0.00013362052,0.0004098762,0.0006931859,0.00047261443,0.00023526211,0.000009333739],"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.00032261264,0.00013484103,0.000030047668,0.0001436352,0.00002993603,3.527854e-7,0.0017386036,0.0005633825,0.014834199,0.70413053,0.00004808075,0.27802378],"study_design_scores_gemma":[0.00007814166,0.0007880373,0.00006184359,0.00012479832,0.000019865309,0.000002267477,0.00014103245,0.6027743,0.105723225,0.29005107,0.000048454873,0.00018691867],"about_ca_topic_score_codex":0.000023232049,"about_ca_topic_score_gemma":0.000003384636,"teacher_disagreement_score":0.60221094,"about_ca_system_score_codex":0.000062056424,"about_ca_system_score_gemma":0.00023007029,"threshold_uncertainty_score":0.9992586},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21513568,0.00010075106,0.76095796,0.0067518526,0.004996997,0.0031287025,0.00003376331,0.0006004414,0.008293852],"genre_scores_gemma":[0.9655205,0.00006661731,0.033075515,0.00015918666,0.0006624339,0.00011388128,0.000005397573,0.000056280474,0.00034019668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99599206,0.000082439736,0.000983534,0.0014744462,0.00079067226,0.0006768731],"domain_scores_gemma":[0.99633443,0.00041006444,0.0009732538,0.0006431207,0.0014585617,0.00018057272],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014166706,0.0006500835,0.0008075365,0.00027460704,0.0006238185,0.00077193946,0.0041612266,0.00051662896,0.00007175614],"category_scores_gemma":[0.0025321834,0.00054729334,0.00033592767,0.00045619847,0.00068072625,0.00047653556,0.004103677,0.0015939422,0.000031123713],"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.00067647884,0.00025351156,0.0015244052,0.0010225554,0.00020418024,0.0000018014304,0.010985242,0.0067005125,0.01895647,0.83266413,0.00048063957,0.12653004],"study_design_scores_gemma":[0.00012169627,0.0003399148,0.000055247885,0.0007064181,0.00006642601,0.0000039004804,0.00059525867,0.77879465,0.04704812,0.17145577,0.00023627222,0.00057630416],"about_ca_topic_score_codex":0.000092814465,"about_ca_topic_score_gemma":0.000008231287,"teacher_disagreement_score":0.77209413,"about_ca_system_score_codex":0.00011358518,"about_ca_system_score_gemma":0.00035703875,"threshold_uncertainty_score":0.99969786},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56552285,0.000037676025,0.4254,0.0039040986,0.0015422634,0.00031753545,0.000018744506,0.00014169507,0.0031151588],"genre_scores_gemma":[0.96598434,0.0000040999967,0.033039346,0.00031990398,0.0005519626,0.000005078831,0.0000043472696,0.000010070888,0.00008082623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802595,0.00001841064,0.0004694653,0.00073376764,0.00046299698,0.00028941355],"domain_scores_gemma":[0.998072,0.000050248338,0.0003131811,0.0008351255,0.0006591603,0.00007027096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033017792,0.00019468233,0.00019578522,0.00007358601,0.00026016834,0.00038468197,0.0040249736,0.00008731255,0.00013269154],"category_scores_gemma":[0.00042296876,0.00014837096,0.00003802797,0.00046425362,0.00020269587,0.00079140125,0.0010653501,0.0002432792,0.00008662424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003520734,0.000052636922,0.00061976205,0.000009274385,0.000022491606,6.573599e-7,0.002713913,0.00042959163,0.21735547,0.5551839,0.0009287565,0.22264834],"study_design_scores_gemma":[0.000015764212,0.000059901435,0.0001871766,0.000047808768,0.000006850312,0.0000017684915,0.00013018752,0.71313685,0.232249,0.053895913,0.0001332885,0.00013549694],"about_ca_topic_score_codex":0.00012916571,"about_ca_topic_score_gemma":0.00004491219,"teacher_disagreement_score":0.7127072,"about_ca_system_score_codex":0.000025089259,"about_ca_system_score_gemma":0.00008585754,"threshold_uncertainty_score":0.7479469},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05731665,0.000008991417,0.9303127,0.004541708,0.0006322532,0.0010817879,0.000005283614,0.00030709518,0.005793556],"genre_scores_gemma":[0.95041555,0.000046020992,0.047986742,0.00035821187,0.0002666632,0.000097014716,0.0000070203464,0.00003618588,0.00078659214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965002,0.00005936492,0.00086694275,0.0010379114,0.0010438627,0.0004917292],"domain_scores_gemma":[0.9955813,0.00009027215,0.0012935002,0.0006882527,0.0021982754,0.00014834493],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008671142,0.00046927633,0.00042186605,0.00023477753,0.0006097288,0.0015406145,0.0032089157,0.00028800638,0.00012115606],"category_scores_gemma":[0.00037800558,0.00037326428,0.00014343894,0.00042899925,0.00041288187,0.00088696345,0.0015116056,0.0013639517,0.00012466597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010894105,0.00011757605,0.00023558144,0.00015579461,0.00006817714,9.0614867e-7,0.008787661,0.25789633,0.004465611,0.68249977,0.00016149317,0.045502126],"study_design_scores_gemma":[0.00003025495,0.00047730748,0.000056163495,0.00084728625,0.000035941783,0.0000069071066,0.00043722457,0.8798712,0.0885994,0.029027946,0.00019375504,0.00041660696],"about_ca_topic_score_codex":0.00006138556,"about_ca_topic_score_gemma":0.000010981727,"teacher_disagreement_score":0.8930989,"about_ca_system_score_codex":0.00014099227,"about_ca_system_score_gemma":0.0003264886,"threshold_uncertainty_score":0.9998719},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067699202,0.0000063123193,0.95107377,0.0052902084,0.00077959034,0.00037902506,1.1122048e-7,0.00018674672,0.03551434],"genre_scores_gemma":[0.99274653,0.000020350386,0.004614619,0.0009793142,0.00010769012,0.000015974907,3.7427887e-7,0.000016671764,0.0014984788],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997621,0.000022334594,0.0005475839,0.0004922792,0.000811318,0.0005054875],"domain_scores_gemma":[0.99818,0.000085795255,0.00056999887,0.0004080477,0.0006502195,0.00010594401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005631779,0.0002654556,0.00024587108,0.0001622093,0.00040626965,0.0004135727,0.0027048115,0.00009179958,0.00022886187],"category_scores_gemma":[0.00032171656,0.00020448735,0.0001248941,0.00061548135,0.00047306227,0.00057485513,0.0007581514,0.00042762328,0.000534609],"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.000051348154,0.00004301838,0.0006511355,0.000044953467,0.00003394356,5.7290583e-7,0.003763529,0.06442562,0.012574565,0.8939208,0.0004977569,0.023992777],"study_design_scores_gemma":[0.000025838795,0.00038955838,0.00010516312,0.00015642493,0.0000094888255,0.0000038560347,0.0005007188,0.7046347,0.28184244,0.011422211,0.0006802078,0.00022934817],"about_ca_topic_score_codex":0.000024732883,"about_ca_topic_score_gemma":0.0000028973368,"teacher_disagreement_score":0.9859766,"about_ca_system_score_codex":0.00007581721,"about_ca_system_score_gemma":0.000063968604,"threshold_uncertainty_score":0.83387524},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001886128,0.000022523722,0.991195,0.0008923027,0.00068853097,0.00083632953,0.00003348969,0.0001370417,0.00430866],"genre_scores_gemma":[0.5722018,0.000024834806,0.42737386,0.00011487742,0.00008358025,0.000058627622,0.000003893861,0.000026336109,0.00011222343],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965137,0.00003610701,0.0012027869,0.0009784002,0.0008665343,0.00040245184],"domain_scores_gemma":[0.9933183,0.000120952616,0.0019542244,0.0006911539,0.0038073903,0.000107958884],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006798929,0.00046108133,0.0005866154,0.00029847014,0.0001954306,0.0002289899,0.0030358105,0.00029679955,0.000041337855],"category_scores_gemma":[0.0006474223,0.00038864554,0.00025125517,0.0006634233,0.0006157025,0.00042517277,0.001145951,0.00066478073,0.000026362284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009461639,0.0004973527,0.000024591614,0.00031990607,0.00006606221,6.9588674e-7,0.0027543588,0.17893034,0.023270011,0.30642298,0.00010000995,0.48751906],"study_design_scores_gemma":[0.000024004787,0.000076748336,0.0000043388286,0.00031889835,0.00001196775,4.779589e-7,0.00006958513,0.51965564,0.38120463,0.09843856,0.0000043684995,0.00019073903],"about_ca_topic_score_codex":0.000028377744,"about_ca_topic_score_gemma":0.0000028069971,"teacher_disagreement_score":0.57031566,"about_ca_system_score_codex":0.00013317862,"about_ca_system_score_gemma":0.00055856287,"threshold_uncertainty_score":0.99985653},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028875975,0.000019015908,0.95364326,0.0021354312,0.0024083264,0.0013101685,0.0000031353331,0.00037407817,0.011230612],"genre_scores_gemma":[0.95145917,0.00021004352,0.044846985,0.00020101767,0.0010630108,0.00006539036,0.000009995584,0.000061250175,0.0020831102],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946806,0.0001629085,0.0015959427,0.0012856486,0.0014260653,0.0008488584],"domain_scores_gemma":[0.99421424,0.00012403956,0.0024411078,0.00077461766,0.0022157247,0.00023028087],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0015566082,0.0007570882,0.0007915881,0.00069817284,0.0010895123,0.001105429,0.0033956107,0.0005023198,0.00014281283],"category_scores_gemma":[0.0027660204,0.0006747153,0.00045246162,0.0010836174,0.0007594664,0.00071306044,0.0048322575,0.0026956056,0.00018947787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004092481,0.00004081823,0.000059270304,0.00009855376,0.00007909249,8.5668006e-7,0.003590338,0.75167763,0.009525106,0.23333484,0.00009474572,0.0014578057],"study_design_scores_gemma":[0.000064389926,0.0004121511,0.000018788776,0.0009610763,0.000063346204,0.000006433413,0.0007516318,0.8895832,0.08529224,0.022009436,0.0002297254,0.00060758664],"about_ca_topic_score_codex":0.00028476262,"about_ca_topic_score_gemma":0.000006758771,"teacher_disagreement_score":0.9225832,"about_ca_system_score_codex":0.00069591624,"about_ca_system_score_gemma":0.0011371516,"threshold_uncertainty_score":0.9999315},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79100204,0.00000525676,0.17647173,0.0035431995,0.00019374285,0.00041501375,0.0000040059776,0.00023350051,0.028131524],"genre_scores_gemma":[0.9699196,0.0000021134451,0.029276734,0.0003045298,0.00015818322,0.00005089476,9.2074714e-7,0.000015317819,0.00027166284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998299,0.000020432397,0.00035550268,0.0005274765,0.00045578732,0.00034180543],"domain_scores_gemma":[0.99832207,0.00007173513,0.0003638454,0.00030944988,0.0008377718,0.00009513875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003468585,0.00020679974,0.00019636878,0.000115263145,0.00044811118,0.0003173928,0.0015250774,0.0000685353,0.00011888668],"category_scores_gemma":[0.00026408088,0.00014790824,0.000063082094,0.0007622186,0.0004312138,0.00038601315,0.00031948692,0.00032974847,0.00019896084],"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.000035144552,0.000084464875,0.001604464,0.000009754689,0.000014368564,2.925658e-7,0.0011574526,0.00013477761,0.04061963,0.9385958,0.00009859842,0.017645305],"study_design_scores_gemma":[0.000045152156,0.00045746396,0.004813696,0.00023803361,0.000013917366,0.000015832587,0.0002458824,0.5578782,0.3977966,0.037987515,0.00020962139,0.00029805608],"about_ca_topic_score_codex":0.0001916777,"about_ca_topic_score_gemma":0.000018149167,"teacher_disagreement_score":0.90060824,"about_ca_system_score_codex":0.000039281756,"about_ca_system_score_gemma":0.00010518274,"threshold_uncertainty_score":0.6031523},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1082753,0.000068850095,0.78447723,0.011785535,0.0021351806,0.0023730972,0.000011680162,0.0009096369,0.08996349],"genre_scores_gemma":[0.9850879,0.00019719741,0.011664413,0.0001608974,0.0002458176,0.00006515523,0.000002286085,0.000040088977,0.002536261],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99657613,0.000048335478,0.0007042829,0.0009864842,0.0010588504,0.0006258874],"domain_scores_gemma":[0.99625325,0.00011965679,0.001370828,0.0008168916,0.0012930613,0.00014628434],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073680846,0.0005456244,0.00052180514,0.00041443398,0.00043966572,0.0009923832,0.0050824364,0.0003023357,0.00006177164],"category_scores_gemma":[0.00065817457,0.00039698093,0.00020673072,0.0007827334,0.0007774841,0.00044949754,0.003203654,0.0016097924,0.0001785267],"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.000086273016,0.00013074471,0.0009257648,0.00029123278,0.00010810654,0.0000024939848,0.004523757,0.11448748,0.0019456807,0.8203344,0.00023332701,0.05693074],"study_design_scores_gemma":[0.000048819158,0.00092284055,0.00040179002,0.0022279301,0.00006123115,0.000018127026,0.0006152476,0.759514,0.14358646,0.09104863,0.00068861584,0.00086634356],"about_ca_topic_score_codex":0.00007003221,"about_ca_topic_score_gemma":0.000005577178,"teacher_disagreement_score":0.8768126,"about_ca_system_score_codex":0.00016081869,"about_ca_system_score_gemma":0.00056348904,"threshold_uncertainty_score":0.9998482},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9542006,0.000008246396,0.0035142829,0.004469786,0.0011556916,0.001088068,0.00002311765,0.0001241459,0.03541603],"genre_scores_gemma":[0.9972461,0.0000057367647,0.00029827794,0.00025191627,0.00044755332,0.00014971277,0.0000067424253,0.000017701312,0.0015762927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986567,0.000043414268,0.0003313166,0.00038220393,0.0003200995,0.0002662811],"domain_scores_gemma":[0.99862945,0.00013558137,0.0003827885,0.00013900807,0.0006570024,0.000056157398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047553203,0.00018199485,0.0001593307,0.00008180796,0.00046905983,0.00010131344,0.00038126734,0.0001223924,0.0006652993],"category_scores_gemma":[0.00032492777,0.000103030376,0.00008095147,0.00022972075,0.000491634,0.00013382403,0.00003861416,0.00031685588,0.000118344],"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.0060108667,0.0006517878,0.004325443,0.00008327168,0.00011061557,7.198265e-7,0.017114336,0.00006975036,0.081812076,0.767183,0.010480043,0.11215811],"study_design_scores_gemma":[0.000110809844,0.0031011086,0.00089462916,0.00055871345,0.000037508376,0.000007822184,0.0067702807,0.0019049494,0.95334905,0.031166432,0.001887701,0.00021098946],"about_ca_topic_score_codex":0.000041813288,"about_ca_topic_score_gemma":0.000040436713,"teacher_disagreement_score":0.87153697,"about_ca_system_score_codex":0.0000230583,"about_ca_system_score_gemma":0.00004445655,"threshold_uncertainty_score":0.72845614},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79632866,0.000023142447,0.19860643,0.00007507866,0.0013568461,0.00063338154,0.0000132879495,0.0001740885,0.002789064],"genre_scores_gemma":[0.99202305,0.000020174426,0.0069094794,0.00005021714,0.0008949339,0.000036807924,0.0000029754312,0.0000455212,0.000016822669],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848866,0.0000087868575,0.00049063493,0.00029805518,0.00022006291,0.0004937714],"domain_scores_gemma":[0.9989994,0.00008084713,0.00018328136,0.00013711485,0.0005275436,0.000071773626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040303468,0.00026217158,0.00027103693,0.00011868146,0.0002732086,0.00012626658,0.00046878427,0.00015010564,0.000064219814],"category_scores_gemma":[0.00014351438,0.00022041678,0.00012484462,0.00031470423,0.0002428875,0.00022077537,0.000031113865,0.00026436077,0.000020603984],"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.00052302814,0.000086270644,0.00012397405,0.00032650353,0.00013706458,9.4508636e-7,0.0061316667,0.10368049,0.4464661,0.03758932,0.00072641106,0.40420824],"study_design_scores_gemma":[0.000038482533,0.00013157562,0.000014878711,0.00029874066,0.00002482866,0.0000042910606,0.0013734478,0.57121366,0.40781856,0.018717166,0.000121172096,0.0002432261],"about_ca_topic_score_codex":0.0000075860985,"about_ca_topic_score_gemma":0.000009868051,"teacher_disagreement_score":0.46753314,"about_ca_system_score_codex":0.000099505385,"about_ca_system_score_gemma":0.000027665414,"threshold_uncertainty_score":0.8988335},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02488411,0.000012457192,0.9654538,0.0030685535,0.0003036953,0.0002916451,0.0000022780828,0.0001315275,0.005851929],"genre_scores_gemma":[0.96000224,0.0000066938023,0.038966283,0.000292673,0.0001337768,0.000039288036,5.796812e-7,0.000013938122,0.00054455054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981377,0.000015361027,0.0004976756,0.0005377775,0.00042550772,0.00038597433],"domain_scores_gemma":[0.9979419,0.00011626582,0.00032992664,0.00024620915,0.0012701461,0.00009554365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005503447,0.00021174537,0.00021931996,0.00010636755,0.00043519965,0.0002126527,0.001572655,0.00011446458,0.000024101015],"category_scores_gemma":[0.00058111927,0.00016650047,0.00013627962,0.00044394142,0.0003272577,0.000479374,0.00029078565,0.00034953427,0.00005819137],"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.000055588243,0.000048839145,0.00005869267,0.0000149173175,0.000007655414,6.3969104e-8,0.0014383758,0.0039202445,0.008381072,0.93440944,0.000087406894,0.0515777],"study_design_scores_gemma":[0.000019835521,0.00019417668,0.000021618791,0.000052295247,0.0000062762724,0.0000024409003,0.00007221034,0.6876705,0.036117114,0.27567688,0.000028433169,0.00013817137],"about_ca_topic_score_codex":0.000009356382,"about_ca_topic_score_gemma":0.0000073424126,"teacher_disagreement_score":0.9351181,"about_ca_system_score_codex":0.00003647106,"about_ca_system_score_gemma":0.000109130444,"threshold_uncertainty_score":0.6789692},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4573435,0.000034707038,0.35890314,0.0038826196,0.001877028,0.0027400847,0.000011621107,0.0006272962,0.17458001],"genre_scores_gemma":[0.9849361,0.00003463114,0.013827325,0.00009675688,0.00013597046,0.000045964494,0.0000020928974,0.000033441687,0.0008876964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99654645,0.000035464367,0.0009042252,0.0009723003,0.0009535032,0.0005880751],"domain_scores_gemma":[0.9971122,0.00013842672,0.0010588022,0.00074740173,0.0008363621,0.00010680342],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008758117,0.00048851507,0.00057314034,0.0003273028,0.00015693175,0.0005769467,0.0047214846,0.00030140986,0.00007432872],"category_scores_gemma":[0.0003439134,0.00036245873,0.00012500412,0.00072079105,0.00048782167,0.0003766768,0.0024130053,0.0011536097,0.00020622728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004978377,0.0003570329,0.005956042,0.00058447936,0.00015008924,0.000015855256,0.014921249,0.29104063,0.017318456,0.6516342,0.0008849665,0.016639164],"study_design_scores_gemma":[0.000057198133,0.00065760873,0.00084692106,0.0035509355,0.000027123177,0.000008986933,0.0002936314,0.8190357,0.109047025,0.0656613,0.00006820319,0.00074536394],"about_ca_topic_score_codex":0.000097759854,"about_ca_topic_score_gemma":0.000005166384,"teacher_disagreement_score":0.5859729,"about_ca_system_score_codex":0.00015258523,"about_ca_system_score_gemma":0.0003738673,"threshold_uncertainty_score":0.99988276},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087997586,0.000007005984,0.90240365,0.004838376,0.00066452334,0.00045301655,0.000008739039,0.00012663878,0.0035004544],"genre_scores_gemma":[0.9867323,0.000009409728,0.012452218,0.00034566125,0.00019831673,0.000031635365,7.6307106e-7,0.0000116146775,0.00021808335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980768,0.000017312766,0.000527994,0.0005352496,0.00044728292,0.00039539035],"domain_scores_gemma":[0.99745184,0.000119097094,0.00034383096,0.00036562886,0.0016179752,0.00010164215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007153665,0.00022213784,0.00024654166,0.00009233095,0.00033152133,0.00028553186,0.0017808209,0.00012504033,0.000026513599],"category_scores_gemma":[0.0006074856,0.0001692669,0.00012459324,0.00050377316,0.00039157347,0.0004128852,0.00029259725,0.00020518378,0.00008349698],"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.000045549885,0.000089823516,0.000035473917,0.000028052007,0.00001154346,8.459091e-8,0.0015124549,0.00001608543,0.02870974,0.9186717,0.0002966821,0.05058277],"study_design_scores_gemma":[0.000024597115,0.00029574631,0.000068860136,0.00009181435,0.0000124242915,0.0000022295828,0.0001606633,0.29379824,0.4463622,0.25889906,0.00010814356,0.00017603842],"about_ca_topic_score_codex":0.00004471573,"about_ca_topic_score_gemma":0.0000255667,"teacher_disagreement_score":0.8987347,"about_ca_system_score_codex":0.00004596649,"about_ca_system_score_gemma":0.00015510425,"threshold_uncertainty_score":0.6902504},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033042174,0.000009361038,0.8841439,0.0036911722,0.0009435476,0.00037958624,6.8508535e-7,0.00029143158,0.07749815],"genre_scores_gemma":[0.9830374,0.000021750846,0.014765478,0.0001603324,0.00014188081,0.000011519464,2.4886117e-7,0.000012404492,0.0018489453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816865,0.00002197638,0.00047133994,0.00042218855,0.0005373764,0.00037848522],"domain_scores_gemma":[0.9981746,0.00008199643,0.0003903506,0.0003300728,0.00093786506,0.00008510109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005351925,0.00019435275,0.00019004261,0.00013934128,0.0004487199,0.00035655362,0.0023496705,0.00008458081,0.00014748459],"category_scores_gemma":[0.00069240987,0.00015094013,0.00010200113,0.0008133183,0.00046669465,0.00048161563,0.0005800494,0.00043004265,0.0004858063],"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.000013918204,0.000039119885,0.0002612524,0.000013209303,0.000011797434,1.8431498e-7,0.0012944478,0.02105871,0.010646724,0.9502605,0.0001778029,0.016222313],"study_design_scores_gemma":[0.000021382968,0.0005521205,0.00022085007,0.0001644001,0.000010145202,0.000005008787,0.0004898432,0.74445695,0.2190859,0.034125376,0.0006282575,0.0002397504],"about_ca_topic_score_codex":0.000015999636,"about_ca_topic_score_gemma":0.0000027949372,"teacher_disagreement_score":0.9499953,"about_ca_system_score_codex":0.000046063004,"about_ca_system_score_gemma":0.00008280168,"threshold_uncertainty_score":0.6244219},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9742509,0.00012023552,0.01886896,0.0008817779,0.0006051221,0.0007858882,0.000017565222,0.00016779233,0.004301766],"genre_scores_gemma":[0.99631923,0.0001560636,0.0021088475,0.000048593192,0.0007584422,0.000050464543,0.0000026141515,0.000023738201,0.00053200836],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982362,0.000022547829,0.00046396925,0.00045508004,0.0005011822,0.00032104552],"domain_scores_gemma":[0.9979117,0.0000788299,0.00023622863,0.00025923125,0.001401812,0.000112188056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008531984,0.00019901853,0.0004001065,0.00012177338,0.00040027327,0.000068180205,0.00031002035,0.00012317809,0.00006237933],"category_scores_gemma":[0.0014522651,0.00014868207,0.0005564796,0.0004980019,0.00035479575,0.00012695137,0.00006943107,0.0003775101,0.00005922511],"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.0014024132,0.00048756492,0.073236875,0.00058868836,0.0016381225,0.0000018041934,0.0045441254,0.0011149219,0.41122162,0.025009142,0.00047201428,0.48028272],"study_design_scores_gemma":[0.00013503015,0.0012133451,0.0010210817,0.0007321463,0.0008854966,0.000010999186,0.0018180159,0.19204909,0.7890638,0.011473187,0.0013523771,0.0002454275],"about_ca_topic_score_codex":0.00010397309,"about_ca_topic_score_gemma":0.0000043324585,"teacher_disagreement_score":0.4800373,"about_ca_system_score_codex":0.00006336461,"about_ca_system_score_gemma":0.00008408833,"threshold_uncertainty_score":0.60630786},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51374507,0.0000073955243,0.47704065,0.0018570744,0.0007326149,0.00055844145,0.0000019149697,0.00028273748,0.005774115],"genre_scores_gemma":[0.9840576,0.000007480431,0.015200186,0.00020664549,0.00024468542,0.000029774972,8.650421e-7,0.000019722189,0.00023306074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997702,0.000059528484,0.0005181702,0.00073087314,0.0005443375,0.00044505924],"domain_scores_gemma":[0.9978035,0.000042937816,0.00031470374,0.00034886616,0.0013214226,0.00016855303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008343527,0.00029830198,0.00029556075,0.00024300891,0.00032102197,0.00032570283,0.001403856,0.00012153597,0.00008978651],"category_scores_gemma":[0.0003073739,0.00023202198,0.00009663654,0.0008935451,0.000368528,0.00056086126,0.00041477432,0.00038653408,0.00011285937],"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.000265723,0.00019048783,0.0010973533,0.000074431635,0.000036949237,0.0000014759652,0.012404871,0.00075629546,0.100461945,0.78599393,0.00015374727,0.098562784],"study_design_scores_gemma":[0.00014682268,0.001689412,0.0025822397,0.00097278436,0.0000398706,0.000016588461,0.0014882971,0.63420427,0.3162391,0.040762313,0.001112606,0.00074571685],"about_ca_topic_score_codex":0.0002572299,"about_ca_topic_score_gemma":0.0000880629,"teacher_disagreement_score":0.7452316,"about_ca_system_score_codex":0.000104022285,"about_ca_system_score_gemma":0.00017228922,"threshold_uncertainty_score":0.9461582},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07177303,0.0000027333674,0.8979242,0.00075180485,0.00018853693,0.0003874348,3.1287902e-7,0.00019169992,0.028780257],"genre_scores_gemma":[0.9857633,0.000011830829,0.012814465,0.00021879829,0.00008696041,0.000019117806,5.425423e-7,0.000020128065,0.0010648469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99762726,0.000022349252,0.00051016465,0.00055790367,0.00078634947,0.0004959923],"domain_scores_gemma":[0.99784404,0.00005032175,0.00048475323,0.0004785731,0.0010055223,0.00013676153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006178284,0.00028589682,0.00025426605,0.00014233761,0.00043425127,0.0004012135,0.002322532,0.000088751076,0.00006357094],"category_scores_gemma":[0.0002529796,0.00019589302,0.00007799167,0.0006369992,0.00046897755,0.0008655668,0.0004624169,0.0004461812,0.000113566486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010915814,0.000046621455,0.0002238433,0.000021494923,0.000019203962,3.2551537e-7,0.0025828872,0.33014968,0.013248186,0.6426756,0.000040552586,0.010882449],"study_design_scores_gemma":[0.00003037527,0.001582703,0.000026090662,0.00012568457,0.000010270008,0.0000037391187,0.000281171,0.7899683,0.19710149,0.0106105115,0.0000431454,0.00021650002],"about_ca_topic_score_codex":0.000026475056,"about_ca_topic_score_gemma":0.0000061474884,"teacher_disagreement_score":0.91399026,"about_ca_system_score_codex":0.00006588811,"about_ca_system_score_gemma":0.00016103178,"threshold_uncertainty_score":0.79882854},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9701198,0.00006376702,0.022176905,0.0014568472,0.00035929133,0.0003735309,0.000002422045,0.00010642316,0.0053410674],"genre_scores_gemma":[0.99423546,0.000008297917,0.005408931,0.00017047324,0.0000770771,0.000022130627,2.438742e-7,0.000010145093,0.000067219065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99832004,0.000022354507,0.00047511148,0.0004832103,0.0003185523,0.0003807275],"domain_scores_gemma":[0.9989883,0.00016167742,0.00026203928,0.00022292587,0.00028287715,0.000082214756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006085955,0.00020160539,0.00024065402,0.00019124016,0.0002546878,0.00026162303,0.0010558763,0.00009517592,0.00002494101],"category_scores_gemma":[0.00031674295,0.00016107704,0.000046162066,0.0005855675,0.00027737822,0.00038429827,0.0003272363,0.0003346548,0.00002808665],"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.0002349901,0.00018391415,0.07264901,0.00008928016,0.000015544558,0.000006645628,0.014961103,0.00013253947,0.055799488,0.6645204,0.00023877108,0.19116835],"study_design_scores_gemma":[0.00010459057,0.00091015757,0.010420433,0.0016404849,0.00002182252,0.000023593751,0.0015700456,0.17162673,0.7223635,0.090569824,0.000110921486,0.0006379453],"about_ca_topic_score_codex":0.000113605834,"about_ca_topic_score_gemma":0.000026252266,"teacher_disagreement_score":0.666564,"about_ca_system_score_codex":0.000034380486,"about_ca_system_score_gemma":0.000060028935,"threshold_uncertainty_score":0.6568531},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1671273,0.000029022432,0.82892686,0.0014900465,0.0012715663,0.0006163694,0.0000051096486,0.00009213739,0.0004416029],"genre_scores_gemma":[0.98014814,0.0000120731665,0.018937679,0.00045487215,0.00036749485,0.000029530514,5.605842e-7,0.000018477602,0.000031178213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972126,0.000027654687,0.00080654066,0.0008231609,0.00050056505,0.0006295045],"domain_scores_gemma":[0.9971613,0.00011106193,0.00044295675,0.00048256703,0.001663422,0.00013866955],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00078089366,0.0003243527,0.00037622623,0.000117923926,0.000493976,0.0003560415,0.0024012527,0.00014500637,0.000019243475],"category_scores_gemma":[0.0004879066,0.00026406095,0.00019760268,0.0005213235,0.00031188913,0.00059736613,0.00059482513,0.00027118783,0.000009112234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020671003,0.00020699852,0.00018449336,0.000084591506,0.000035307556,6.294221e-7,0.0023696194,0.032596655,0.018410672,0.7598952,0.00012011154,0.18588904],"study_design_scores_gemma":[0.000041482926,0.00019805935,0.0000033053784,0.00020456035,0.000016694261,0.0000052952637,0.00037747945,0.8828585,0.06436967,0.051650528,0.00001956853,0.00025481678],"about_ca_topic_score_codex":0.00012442059,"about_ca_topic_score_gemma":0.00004631489,"teacher_disagreement_score":0.85026187,"about_ca_system_score_codex":0.00009435174,"about_ca_system_score_gemma":0.000115185256,"threshold_uncertainty_score":0.99998116},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5884693,0.00013491319,0.33818334,0.004048571,0.0022438185,0.0010645296,0.000010701934,0.00037524008,0.065469526],"genre_scores_gemma":[0.9862224,0.000023561071,0.013260227,0.00013749802,0.00012861981,0.000009861112,1.5433672e-7,0.000012124559,0.00020559582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982331,0.000022560538,0.00055985944,0.00046566062,0.00036655564,0.00035230524],"domain_scores_gemma":[0.99785,0.0001958462,0.00041523718,0.00037953662,0.0010673385,0.00009203934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034734985,0.00020741836,0.0002846007,0.00015559673,0.0001726313,0.00008184958,0.0023318047,0.0000834343,0.000056469686],"category_scores_gemma":[0.00048930215,0.00015283309,0.00012846998,0.0010695801,0.0007338247,0.00037891394,0.00059091806,0.0002831628,0.00006483876],"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.000060620237,0.00011806706,0.00011673617,0.000028652901,0.000011114278,2.4166326e-7,0.00092438154,0.00004798103,0.06392356,0.8321697,0.00017735374,0.102421604],"study_design_scores_gemma":[0.000021610722,0.0003640095,0.00011526597,0.0002658602,0.0000075062967,0.0000033061551,0.00009939999,0.13069183,0.64405364,0.22397003,0.00023412911,0.00017344637],"about_ca_topic_score_codex":0.000007968331,"about_ca_topic_score_gemma":0.000008747622,"teacher_disagreement_score":0.60819966,"about_ca_system_score_codex":0.00002186925,"about_ca_system_score_gemma":0.0000883875,"threshold_uncertainty_score":0.6232352},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39439225,0.000019582616,0.59808964,0.000915773,0.0012434963,0.00066801865,0.000008831114,0.00007062002,0.004591797],"genre_scores_gemma":[0.9953309,0.000005228466,0.0030626135,0.000064151056,0.00082055794,0.000055252644,0.0000027192993,0.000019388199,0.00063917506],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861336,0.000033259657,0.0004204849,0.00037236966,0.00014563964,0.00041489053],"domain_scores_gemma":[0.9987261,0.00011601735,0.00033489382,0.00012580235,0.00061313,0.000084046376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005108653,0.0001994973,0.00024110035,0.000032644537,0.00051020324,0.00012845972,0.00045212838,0.00007814907,0.00016902521],"category_scores_gemma":[0.00008002713,0.00015225558,0.00018505503,0.00027202122,0.00047540487,0.00017629172,0.00012729056,0.00035141868,0.000016196014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002585874,0.00010159274,0.0012485121,0.000014625139,0.00002907889,1.558304e-8,0.0007010548,0.0032153227,0.022562096,0.19864732,0.00026047317,0.7729613],"study_design_scores_gemma":[0.000041970365,0.00021584297,0.00011154502,0.00004941478,0.00001372172,6.764968e-7,0.00087741617,0.79187584,0.17936254,0.02692933,0.00036357102,0.0001581408],"about_ca_topic_score_codex":0.000036175006,"about_ca_topic_score_gemma":0.0000034476013,"teacher_disagreement_score":0.7886605,"about_ca_system_score_codex":0.000018531578,"about_ca_system_score_gemma":0.00001627271,"threshold_uncertainty_score":0.62088025},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03644428,0.000041293275,0.95894164,0.0021828935,0.0004389692,0.00077310234,0.000009552135,0.00016246442,0.0010058174],"genre_scores_gemma":[0.90492654,0.000002583691,0.0944624,0.0002934413,0.0001453011,0.000063016916,0.0000013363526,0.000016021651,0.0000893769],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982598,0.00001565553,0.000451277,0.00051948085,0.0003099167,0.00044390155],"domain_scores_gemma":[0.9981401,0.00027683488,0.00036128407,0.00023831899,0.0008670809,0.000116396564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006650915,0.00024473656,0.00025792592,0.00012619434,0.00039457128,0.00030441352,0.0011699111,0.00010558714,0.000012705257],"category_scores_gemma":[0.0006517829,0.0001900077,0.00008378375,0.00046493896,0.0004383784,0.00023498508,0.00021483615,0.00027840916,0.000020003874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060753856,0.00034329752,0.0033020633,0.00035681765,0.000061158986,0.0000022927718,0.0072691655,0.001985913,0.009667315,0.58436877,0.0014465591,0.39058912],"study_design_scores_gemma":[0.00006296512,0.0008960976,0.000057477217,0.0004799003,0.00001948664,0.000005123249,0.00029824695,0.8205997,0.15998504,0.015197345,0.002100763,0.00029789718],"about_ca_topic_score_codex":0.000017478398,"about_ca_topic_score_gemma":0.0000018298883,"teacher_disagreement_score":0.86848223,"about_ca_system_score_codex":0.0000272722,"about_ca_system_score_gemma":0.00013672592,"threshold_uncertainty_score":0.774829},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027966488,0.000025383768,0.966827,0.0009000074,0.0004776618,0.00060014805,0.000006573217,0.00006256971,0.003134174],"genre_scores_gemma":[0.48944035,0.000010314227,0.51027906,0.000072392,0.00008548869,0.00003546178,2.4736104e-7,0.000008734401,0.00006791942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980319,0.00004252079,0.0007099122,0.00046614325,0.00043706517,0.0003124615],"domain_scores_gemma":[0.9966972,0.00024370936,0.000815922,0.0003733331,0.0018121866,0.000057669757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017394008,0.00019642312,0.00030076038,0.0001474906,0.00021833708,0.0001418783,0.0020396283,0.00010475424,0.00003032759],"category_scores_gemma":[0.0018938361,0.00015024026,0.00011416436,0.0010169571,0.00027823175,0.0005436336,0.00030202052,0.00016902511,0.000026413554],"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.000059784667,0.0000606011,0.000070630245,0.0000748889,0.000013182369,2.4142045e-8,0.002192733,0.00002125089,0.091103084,0.70198315,0.0000559596,0.2043647],"study_design_scores_gemma":[0.000019467097,0.00031827556,0.000088418914,0.00013984261,0.000011490697,0.0000020537436,0.00024704201,0.24454114,0.64604825,0.10830647,0.00015700926,0.00012057905],"about_ca_topic_score_codex":0.000045833,"about_ca_topic_score_gemma":0.000008289138,"teacher_disagreement_score":0.5936767,"about_ca_system_score_codex":0.000038510017,"about_ca_system_score_gemma":0.00011150935,"threshold_uncertainty_score":0.61266196},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8833275,0.000034973287,0.06063426,0.017618963,0.0034809345,0.00089045975,0.000064195454,0.00012308225,0.033825636],"genre_scores_gemma":[0.97902244,0.000010180099,0.017379668,0.0006693776,0.0003975545,0.000024359628,3.9857258e-7,0.000014604915,0.0024814208],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99652624,0.000041646363,0.00087548344,0.0006986742,0.0013509309,0.0005070142],"domain_scores_gemma":[0.99551654,0.00024515754,0.0005198378,0.00043967454,0.0030465855,0.00023218838],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0021160648,0.00023039026,0.00035754588,0.00032325403,0.0004903308,0.00048447624,0.0021097916,0.0000987287,0.00063579],"category_scores_gemma":[0.00532637,0.00015432615,0.00016457323,0.0019200309,0.00045480338,0.00025895215,0.00033473028,0.00027458253,0.0020840592],"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.0003269747,0.00040623,0.00076424866,0.0000068343775,0.00007353012,0.0000011818931,0.005219575,0.00018570494,0.09660148,0.3160953,0.01043232,0.5698866],"study_design_scores_gemma":[0.000042626074,0.00046210716,0.00048515497,0.00015942196,0.000022687376,0.0000053426215,0.0018289421,0.026943438,0.6097608,0.3582017,0.0018184554,0.00026930223],"about_ca_topic_score_codex":0.00005400847,"about_ca_topic_score_gemma":0.000019020197,"teacher_disagreement_score":0.56961733,"about_ca_system_score_codex":0.00006029255,"about_ca_system_score_gemma":0.00014354319,"threshold_uncertainty_score":0.9986929},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80316436,0.000085999025,0.06381041,0.015109466,0.003198803,0.0018244138,0.000016514456,0.0007020938,0.11208794],"genre_scores_gemma":[0.99366254,0.000030270785,0.0041467897,0.00038241397,0.0003096557,0.000039509658,2.219255e-7,0.000029255818,0.0013993285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9959613,0.000054086515,0.0009865299,0.0009815783,0.0011904938,0.0008260092],"domain_scores_gemma":[0.9962238,0.00017579687,0.00044591998,0.0008650411,0.002068144,0.00022130032],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001022585,0.0004263512,0.0004422614,0.00029662464,0.0005047992,0.00049941614,0.005126747,0.00017889493,0.00025353458],"category_scores_gemma":[0.0006569158,0.0003266885,0.00024244205,0.0015748829,0.001364372,0.0008271318,0.0011118259,0.0005366791,0.000884965],"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.00012978062,0.00027806175,0.00023199077,0.000032917065,0.000042861502,0.0000020309344,0.005519118,0.000091744536,0.08020449,0.62158525,0.00093263993,0.29094914],"study_design_scores_gemma":[0.000021952435,0.00046534816,0.000166007,0.00017922267,0.000013265954,0.000007797496,0.0013711278,0.10342936,0.83660036,0.057178225,0.00023590737,0.00033142068],"about_ca_topic_score_codex":0.00027634331,"about_ca_topic_score_gemma":0.000115340365,"teacher_disagreement_score":0.7563959,"about_ca_system_score_codex":0.00011871979,"about_ca_system_score_gemma":0.00021156277,"threshold_uncertainty_score":0.9999185},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8959755,0.00001292048,0.04902251,0.00024666748,0.001190372,0.00049767067,0.000025777967,0.00034550074,0.052683093],"genre_scores_gemma":[0.99896014,0.000022509808,0.00039398117,0.000025093794,0.00021892141,0.000036380374,0.0000011829721,0.000022144031,0.00031963765],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879956,0.000008403974,0.00042511252,0.00025064935,0.0002744627,0.00024178634],"domain_scores_gemma":[0.9991571,0.00007189326,0.00015086627,0.00014061606,0.000411359,0.00006819773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019403489,0.00016654878,0.00019591357,0.000091713795,0.00021729297,0.00012577174,0.0004045604,0.00006820095,0.00016217481],"category_scores_gemma":[0.00021407743,0.00013689912,0.000080210404,0.00034321134,0.00018112866,0.000204169,0.000060888062,0.00031366025,0.00018827125],"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.00044156227,0.000113191425,0.0015143511,0.000099267585,0.00025561385,5.897426e-7,0.020723136,0.05050226,0.7593247,0.027555075,0.0004520515,0.13901818],"study_design_scores_gemma":[0.000029441493,0.00014813131,0.0003081167,0.00014623988,0.000013606353,8.8943176e-7,0.0029463952,0.59193414,0.38855177,0.015557214,0.00022881805,0.00013523341],"about_ca_topic_score_codex":0.00018907602,"about_ca_topic_score_gemma":0.000056650297,"teacher_disagreement_score":0.5414319,"about_ca_system_score_codex":0.000052575273,"about_ca_system_score_gemma":0.000023240518,"threshold_uncertainty_score":0.5582584},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4454862,0.00000712561,0.53244734,0.0024533,0.00047841723,0.00037528473,0.0000014817083,0.00016326987,0.018587602],"genre_scores_gemma":[0.9170074,0.000004510851,0.08244504,0.00017505352,0.00020053792,0.000011896638,7.000211e-8,0.000011907141,0.00014358171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980638,0.000012242665,0.0004169405,0.0005814329,0.0004980472,0.00042754284],"domain_scores_gemma":[0.99839354,0.00009609993,0.0003224656,0.00035932322,0.00073665055,0.00009191889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038500607,0.00022606768,0.00023524193,0.00011975663,0.00029066394,0.0003185602,0.001980631,0.000066057095,0.000062317566],"category_scores_gemma":[0.0002721651,0.00015581584,0.000073562594,0.0006949486,0.0004040624,0.000535963,0.00036863005,0.00030279456,0.00007574364],"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.00006510675,0.00005201106,0.00022649026,0.000015912401,0.000016776416,4.4061093e-7,0.0035866792,0.00016763767,0.020474574,0.9234439,0.000019086203,0.05193137],"study_design_scores_gemma":[0.000028613073,0.00026681146,0.00017007135,0.00030635347,0.000008872261,0.000008050985,0.00077752664,0.18481176,0.60345024,0.20989126,0.00004324682,0.00023721388],"about_ca_topic_score_codex":0.000049748665,"about_ca_topic_score_gemma":0.000027081498,"teacher_disagreement_score":0.71355265,"about_ca_system_score_codex":0.000056864897,"about_ca_system_score_gemma":0.000109663866,"threshold_uncertainty_score":0.63539857},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9953895,0.000031151696,0.000112164416,0.0008217917,0.00037420684,0.00044491928,0.00002472699,0.000044839617,0.0027566566],"genre_scores_gemma":[0.99895805,0.00004176189,0.00004890054,0.000105040875,0.00023988295,0.000026448262,0.000003483881,0.000024499755,0.0005519164],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.997643,0.00008966977,0.0005559301,0.00052232837,0.0005676708,0.000621389],"domain_scores_gemma":[0.99858505,0.00014646731,0.00036429043,0.00016148057,0.0005202141,0.00022251866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058874267,0.00024855667,0.00031757838,0.00016803079,0.00050665624,0.00013530593,0.0006905037,0.0001334071,0.00044484288],"category_scores_gemma":[0.00041495496,0.00018954123,0.00005731028,0.00036195165,0.00073533866,0.00013806377,0.0003487852,0.0006122233,0.00009634642],"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.000105147206,0.0001321479,0.7187806,0.000076116434,0.000030084935,3.0680303e-7,0.005571428,1.2985862e-7,0.0011146879,0.023434501,0.000023682009,0.25073117],"study_design_scores_gemma":[0.00017705932,0.0040729274,0.8746734,0.000839742,0.000052772073,0.0000023718746,0.008980452,0.0015817427,0.09387142,0.01469101,0.0004876077,0.0005694962],"about_ca_topic_score_codex":0.001098143,"about_ca_topic_score_gemma":0.0001039692,"teacher_disagreement_score":0.25016168,"about_ca_system_score_codex":0.00006461304,"about_ca_system_score_gemma":0.000053343396,"threshold_uncertainty_score":0.7729267},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70758307,0.0000033850185,0.28609997,0.0011907662,0.00017365933,0.00030758756,5.2252045e-7,0.00014891716,0.004492107],"genre_scores_gemma":[0.98879683,7.539192e-7,0.010918125,0.00008588975,0.000113805494,0.00002940811,2.606652e-7,0.000011854098,0.00004307351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851984,0.000022525352,0.00033682238,0.0004463032,0.00041873645,0.0002557656],"domain_scores_gemma":[0.99847484,0.00012206714,0.00034500993,0.00027647725,0.00071719586,0.00006441605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003300525,0.0001734391,0.00014728431,0.00012977043,0.00052536797,0.00024097446,0.0012342015,0.000070833674,0.000036297966],"category_scores_gemma":[0.00039237415,0.00012170277,0.000053967367,0.0008920235,0.000351119,0.00041022213,0.00020622494,0.00035095247,0.00010620495],"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.000070174035,0.00003736128,0.006326217,0.000013566597,0.000010668618,1.0275799e-7,0.0016823472,0.00013805514,0.03518647,0.8257719,0.0000029282814,0.13076018],"study_design_scores_gemma":[0.000033537108,0.000329199,0.025375286,0.00007713203,0.000010973158,0.00001023555,0.00016731124,0.5554467,0.30689523,0.111442305,0.000016813652,0.00019530783],"about_ca_topic_score_codex":0.00011944346,"about_ca_topic_score_gemma":0.00006991549,"teacher_disagreement_score":0.71432966,"about_ca_system_score_codex":0.000046638495,"about_ca_system_score_gemma":0.000051265102,"threshold_uncertainty_score":0.4962895},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9084294,0.000077855155,0.08452052,0.00070940354,0.0002521311,0.0013317759,0.000005812342,0.00010500922,0.0045681233],"genre_scores_gemma":[0.9911845,0.00013644248,0.006946734,0.0006782095,0.00053216435,0.00019372557,0.00003329188,0.00005438326,0.00024056982],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9974149,0.000031522875,0.00062985555,0.0011227798,0.00033503212,0.0004658964],"domain_scores_gemma":[0.9978584,0.000013390963,0.00035152343,0.00062441704,0.0009484598,0.0002037835],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059331924,0.00043406777,0.0004363623,0.0001814135,0.00020245086,0.00025919257,0.0017127934,0.00044507845,0.000076964825],"category_scores_gemma":[0.00036794387,0.00038850744,0.0002062019,0.0003109749,0.00022945661,0.000010795645,0.0017801018,0.00054873794,0.00005502275],"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.0003031851,0.00012697805,0.00010531575,0.000028597611,0.000044180877,1.6152121e-7,0.0009603684,0.002695617,0.9768539,0.00092780404,0.0014644683,0.01648943],"study_design_scores_gemma":[0.000014379969,0.0006114728,0.00005386069,0.00017109969,0.000034888115,0.0000010944757,0.0005987938,0.01226586,0.98247147,0.002196048,0.0011385245,0.00044253332],"about_ca_topic_score_codex":0.000122040125,"about_ca_topic_score_gemma":0.00010497388,"teacher_disagreement_score":0.08275511,"about_ca_system_score_codex":0.000064612985,"about_ca_system_score_gemma":0.00008144803,"threshold_uncertainty_score":0.9998567},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04613931,0.00030110832,0.9292779,0.010598608,0.0029553245,0.0016216136,0.000015901722,0.00037308573,0.008717125],"genre_scores_gemma":[0.9454822,0.0008916643,0.052778274,0.00027392726,0.00026323614,0.000087892324,0.0000010221694,0.000045113262,0.0001766576],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99646276,0.00006766571,0.00070961856,0.0011980998,0.00092828245,0.00063355867],"domain_scores_gemma":[0.99681807,0.00026577382,0.0010101625,0.0007354099,0.0009988345,0.00017177868],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001230205,0.0004757962,0.0005104835,0.0002759078,0.00041004163,0.0020442447,0.0032901643,0.00028513547,0.00003359215],"category_scores_gemma":[0.0006699455,0.00039109087,0.00014512244,0.00051066576,0.0009767865,0.0017262867,0.0055122557,0.0012122025,0.00003663872],"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.00026910976,0.0002717251,0.000098393604,0.0011733447,0.00013923609,0.000010407366,0.011773998,0.002900906,0.012449869,0.4435882,0.00012704536,0.5271978],"study_design_scores_gemma":[0.00004346682,0.00023098651,0.00010822178,0.005028245,0.000027182414,0.00002844481,0.0043228916,0.61763394,0.11135696,0.26040462,0.00012270885,0.0006923238],"about_ca_topic_score_codex":0.000040263265,"about_ca_topic_score_gemma":0.000017390068,"teacher_disagreement_score":0.8993429,"about_ca_system_score_codex":0.00016490053,"about_ca_system_score_gemma":0.00018691285,"threshold_uncertainty_score":0.9998541},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026870077,0.000066124565,0.93324876,0.0022751559,0.0006769328,0.00049756496,0.00001308588,0.00041520796,0.03593707],"genre_scores_gemma":[0.9599594,0.00006597967,0.03923522,0.00041776508,0.0001477834,0.000009878241,4.4091175e-7,0.0000106764555,0.00015286569],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.997781,0.000014830515,0.00052240887,0.00071751256,0.00053014327,0.00043412662],"domain_scores_gemma":[0.9976798,0.000059041864,0.0003798676,0.0007544181,0.0010232538,0.00010358272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046611944,0.0002499207,0.00026564408,0.00007230301,0.00026988448,0.00024089443,0.0044566845,0.00009322268,0.000046549947],"category_scores_gemma":[0.0007319018,0.00018906085,0.00009469577,0.0010477479,0.00043887712,0.0011648631,0.0012984878,0.000250693,0.00013139438],"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.00005458997,0.00006445296,0.000079823585,0.000013620845,0.000007966363,6.652943e-7,0.0002262959,0.0000048787724,0.019840015,0.5815178,0.00014882108,0.39804104],"study_design_scores_gemma":[0.00002032269,0.00026757835,0.00010144796,0.00015397788,0.0000053934937,0.0000067533933,0.00008022523,0.020376502,0.670571,0.307629,0.00059438864,0.0001933814],"about_ca_topic_score_codex":0.000017793793,"about_ca_topic_score_gemma":0.000006898766,"teacher_disagreement_score":0.9330893,"about_ca_system_score_codex":0.00006833418,"about_ca_system_score_gemma":0.00010926253,"threshold_uncertainty_score":0.82817024},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79033947,0.0000062882095,0.0079030525,0.011542511,0.0009258621,0.0021306707,0.00004353541,0.00013942554,0.18696918],"genre_scores_gemma":[0.99821836,0.0000064250626,0.0004881863,0.0006880909,0.00026269568,0.000049603535,0.0000013782101,0.000010295232,0.0002749785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99852586,0.000007843736,0.00040922296,0.00027751242,0.00044638643,0.0003331521],"domain_scores_gemma":[0.9986909,0.00005728584,0.00026771094,0.0001207912,0.0007602977,0.00010300598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008188557,0.00014146337,0.00015219743,0.00003617965,0.00064851326,0.00035432036,0.00071337575,0.000099879886,0.00009869166],"category_scores_gemma":[0.00027682635,0.00011293037,0.00007514408,0.00029882698,0.0003363685,0.0014896266,0.00006050717,0.00012325097,0.000057684883],"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.00018184999,0.00009756885,0.00007830227,0.00004446546,0.000005237744,1.457267e-8,0.00874328,0.0000033215113,0.0025243491,0.6663181,0.000050707305,0.3219528],"study_design_scores_gemma":[0.00010822396,0.0012822502,0.00014098878,0.00033110954,0.00003963068,6.860984e-7,0.03212455,0.030016543,0.57077736,0.3525426,0.012132165,0.0005039065],"about_ca_topic_score_codex":0.0002612987,"about_ca_topic_score_gemma":0.0012196606,"teacher_disagreement_score":0.568253,"about_ca_system_score_codex":0.00010494443,"about_ca_system_score_gemma":0.0001524025,"threshold_uncertainty_score":0.49879053},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94317424,0.00002936103,0.04625537,0.0014651484,0.0018700483,0.00078354665,0.000044444267,0.00071574346,0.0056621],"genre_scores_gemma":[0.9876683,0.0000026335654,0.011472158,0.000087754575,0.00036821127,0.00004307652,0.000001307954,0.000024605524,0.00033198216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9967399,0.00004377184,0.0010803794,0.0007521197,0.00088349625,0.00050031446],"domain_scores_gemma":[0.99238926,0.00063168054,0.0006987756,0.00056521094,0.0055634202,0.00015164688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034620264,0.00026015972,0.00045432698,0.00038128128,0.00071992114,0.0007657585,0.0023797692,0.00014162484,0.000115839015],"category_scores_gemma":[0.0068198172,0.00017111177,0.00019855819,0.0019137854,0.00057411933,0.0004179431,0.00015759491,0.00018084605,0.0004221128],"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.0004935127,0.00041587974,0.0019229571,0.00009008755,0.000072290655,4.1868674e-7,0.0018480474,0.00066953077,0.1948991,0.7351452,0.001128061,0.06331489],"study_design_scores_gemma":[0.000056856803,0.00040062866,0.0009243893,0.00029202257,0.000066266795,0.000009380229,0.00284813,0.33078402,0.575803,0.0882059,0.00030411652,0.0003053235],"about_ca_topic_score_codex":0.00008759189,"about_ca_topic_score_gemma":0.000039496153,"teacher_disagreement_score":0.64693934,"about_ca_system_score_codex":0.00004549775,"about_ca_system_score_gemma":0.00020475133,"threshold_uncertainty_score":0.8164451},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20617233,0.00007100871,0.7130998,0.032897566,0.004669081,0.0021966537,0.0006628459,0.0012388667,0.03899186],"genre_scores_gemma":[0.98926854,0.000006596666,0.010086912,0.0002470355,0.0001733579,0.000012795057,0.00002412841,0.000010729479,0.00016993197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857736,0.000018526463,0.0002787441,0.00051700056,0.00035141196,0.0002569593],"domain_scores_gemma":[0.99854887,0.000068689216,0.000272571,0.00053476205,0.00047987496,0.000095245654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040198752,0.00019075705,0.0001680247,0.00012215352,0.00018552909,0.00032878947,0.0022578286,0.000080811784,0.00006529215],"category_scores_gemma":[0.0004920113,0.00014401246,0.00004888028,0.00041832618,0.00017054654,0.0009603527,0.00039850356,0.00039351307,0.00018930504],"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.00008615603,0.0001238139,0.00017805301,0.000029803128,0.000018976452,4.7849966e-7,0.0021071846,0.000032997534,0.09274387,0.78834736,0.003562625,0.11276869],"study_design_scores_gemma":[0.000031330204,0.00045409187,0.00079571514,0.00018889921,0.000012696936,0.000008989622,0.0002745637,0.5362067,0.43750408,0.015889654,0.00831449,0.00031875572],"about_ca_topic_score_codex":0.00004763179,"about_ca_topic_score_gemma":0.000014046051,"teacher_disagreement_score":0.7830962,"about_ca_system_score_codex":0.0000388774,"about_ca_system_score_gemma":0.000058571328,"threshold_uncertainty_score":0.5872658},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47821793,0.00008128081,0.48023245,0.027961498,0.0012393586,0.0014443996,0.000096214266,0.00017657837,0.010550297],"genre_scores_gemma":[0.9933143,0.000034964276,0.005906825,0.0006322519,0.00005263921,0.000017839877,0.0000015051595,0.000007136995,0.000032489927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985029,0.00002996813,0.00041976845,0.00043407033,0.00034738114,0.00026591925],"domain_scores_gemma":[0.99900484,0.00006857837,0.00016946308,0.00028834888,0.00040111798,0.000067641486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006392052,0.00017395352,0.00018512935,0.000100641126,0.0001925282,0.0002845177,0.0012912847,0.00006559857,0.000056538116],"category_scores_gemma":[0.000248101,0.00011016967,0.000049794457,0.0004257846,0.00038003686,0.0006871814,0.00038502784,0.00022702312,0.000046358928],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001321558,0.0002528644,0.0001759591,0.0000397613,0.000026645157,0.0000017960353,0.01061661,0.00049549266,0.010628304,0.5653155,0.00047063007,0.41184428],"study_design_scores_gemma":[0.000035597328,0.00004908147,0.000056261528,0.00005911738,0.0000059784497,0.000006044065,0.00077086926,0.87896305,0.05744814,0.06243799,0.00004159706,0.00012629379],"about_ca_topic_score_codex":0.00016860222,"about_ca_topic_score_gemma":0.00009860878,"teacher_disagreement_score":0.87846756,"about_ca_system_score_codex":0.000025746967,"about_ca_system_score_gemma":0.00006156102,"threshold_uncertainty_score":0.44925886},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27637854,0.000048537484,0.6973296,0.008403928,0.0013456981,0.0016619249,0.000010167522,0.00051734643,0.014304261],"genre_scores_gemma":[0.9632074,0.000025469275,0.035521537,0.0005305604,0.00027896932,0.00011819181,0.0000010773199,0.000049739763,0.00026701443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99455065,0.00006187656,0.0013654185,0.0014170457,0.0014330058,0.0011720115],"domain_scores_gemma":[0.995389,0.00024379039,0.00094096735,0.0009781204,0.0022116557,0.00023650563],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012581706,0.000648593,0.00056954223,0.00047935714,0.0009819557,0.0009464029,0.004399784,0.00021980485,0.0002304902],"category_scores_gemma":[0.0006545499,0.00049697876,0.00020948287,0.002852066,0.0015396987,0.0019592482,0.0008136844,0.0006265243,0.0004472836],"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.00019497676,0.0002554425,0.00006705917,0.000048580216,0.000031724776,0.0000033393937,0.0031921885,0.00024691375,0.07466657,0.8231274,0.00007474635,0.09809104],"study_design_scores_gemma":[0.000014591117,0.0006523155,0.00003748903,0.00031852335,0.00002066317,0.000017029026,0.0028473963,0.05874887,0.64226043,0.29449618,0.00016556308,0.00042093624],"about_ca_topic_score_codex":0.00020957823,"about_ca_topic_score_gemma":0.000072326126,"teacher_disagreement_score":0.6868289,"about_ca_system_score_codex":0.00022755092,"about_ca_system_score_gemma":0.00030447822,"threshold_uncertainty_score":0.9997482},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96303594,0.000057656303,0.019314967,0.0003643518,0.000038606402,0.00027072808,0.0000012571959,0.000049149032,0.01686734],"genre_scores_gemma":[0.9950387,0.00005964313,0.0039596763,0.00010070982,0.00014805282,0.000016478542,0.0000033047495,0.00001876933,0.0006546923],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988559,0.000018036,0.00028426055,0.00038857872,0.00020831596,0.0002449188],"domain_scores_gemma":[0.9987047,0.000012152005,0.00023126011,0.00019049812,0.0008181768,0.000043220436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030547916,0.00017312037,0.00016227156,0.000060669066,0.00022775943,0.00010354656,0.00048593056,0.00008900097,0.00007024346],"category_scores_gemma":[0.000346418,0.0001262477,0.00008018298,0.00024728512,0.0005372028,0.000017836837,0.0001773391,0.00018084921,0.000024439894],"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.00013224369,0.000046038665,0.0010473247,0.000012533087,0.00002027535,1.4382022e-7,0.00018362045,0.000013447862,0.98654836,0.0018922664,0.00028485438,0.00981887],"study_design_scores_gemma":[0.000019813351,0.00062073325,0.00011099525,0.00007980366,0.000025125508,0.0000043421333,0.0005571846,0.0026107978,0.99423206,0.0010672134,0.00051274034,0.00015918998],"about_ca_topic_score_codex":0.000044459728,"about_ca_topic_score_gemma":0.00004657059,"teacher_disagreement_score":0.03200273,"about_ca_system_score_codex":0.000015648013,"about_ca_system_score_gemma":0.000039205624,"threshold_uncertainty_score":0.5148232},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6709713,0.000013144959,0.00091102306,0.004418179,0.00080726156,0.00047009866,0.000025967942,0.00006988145,0.3223132],"genre_scores_gemma":[0.99866194,0.000019711084,0.00014956598,0.00017593209,0.0003915223,0.0000039985666,6.2570604e-7,0.000009632852,0.0005870463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981058,0.00006062403,0.0005511514,0.00022960304,0.000670212,0.00038258362],"domain_scores_gemma":[0.99777275,0.00027223027,0.0005057034,0.000107089116,0.0011877983,0.0001544241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010254185,0.0001761299,0.00027344696,0.0001656899,0.000532137,0.00011273767,0.000784723,0.00014054272,0.00074610417],"category_scores_gemma":[0.0023513136,0.00013207832,0.00012097638,0.0006816284,0.0021161716,0.00032848725,0.000101724625,0.00022855513,0.00031833773],"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.00016195772,0.0001248892,0.000026378868,0.00002031432,0.000009736331,4.6170424e-8,0.23064427,0.0000011861309,0.00148218,0.65011144,0.0013553204,0.11606227],"study_design_scores_gemma":[0.00011123321,0.0006529165,0.0005902387,0.0004937119,0.00003786395,5.768242e-7,0.39038262,0.0029263115,0.48592556,0.114968605,0.0034964122,0.00041398278],"about_ca_topic_score_codex":0.00018154862,"about_ca_topic_score_gemma":0.0005764945,"teacher_disagreement_score":0.53514284,"about_ca_system_score_codex":0.000075160104,"about_ca_system_score_gemma":0.00032308997,"threshold_uncertainty_score":0.8169318},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1708442,0.000027931403,0.7227837,0.00990305,0.0016723032,0.00075762405,0.000004969006,0.00015777916,0.09384845],"genre_scores_gemma":[0.9716377,0.000010175843,0.027757194,0.0002981427,0.00015484226,0.00001429901,1.2261246e-7,0.0000089970745,0.000118527234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824584,0.000031389183,0.0004712938,0.00048321288,0.0003559202,0.00041234025],"domain_scores_gemma":[0.9989521,0.00007523048,0.00024668305,0.00026934958,0.00038058712,0.00007607193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070570136,0.00019853248,0.00025321165,0.0001488294,0.0001836609,0.00020267536,0.0017207613,0.00007621268,0.00008324029],"category_scores_gemma":[0.00029574241,0.00014977361,0.00009312413,0.0008640681,0.0004625154,0.00047497725,0.00029696716,0.00022788468,0.00010409978],"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.000050857445,0.000110089735,0.00019630301,0.000010132323,0.000012897672,0.0000010969533,0.009266371,0.00041865627,0.038621485,0.8068381,0.00024902914,0.14422497],"study_design_scores_gemma":[0.000046193953,0.0002810648,0.00040355782,0.00024639093,0.0000058016763,0.0000040032855,0.0022351216,0.35143647,0.33226818,0.31222355,0.0005397728,0.00030989439],"about_ca_topic_score_codex":0.00005782591,"about_ca_topic_score_gemma":0.00008160253,"teacher_disagreement_score":0.8007935,"about_ca_system_score_codex":0.00004346349,"about_ca_system_score_gemma":0.00011110509,"threshold_uncertainty_score":0.610759},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67392707,0.000065720684,0.26658392,0.016534893,0.0036775249,0.0044207145,0.00015533381,0.00019590375,0.034438908],"genre_scores_gemma":[0.9959992,0.000020311907,0.001545956,0.00030731971,0.00030620827,0.00009903599,9.3286326e-7,0.000021535401,0.0016995086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955236,0.000041292948,0.0009455759,0.00086451817,0.0020711813,0.00055388187],"domain_scores_gemma":[0.9924998,0.0015658992,0.00062970934,0.00047508764,0.004678448,0.0001510564],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0025239051,0.00027116746,0.00037601352,0.00043981406,0.00058570673,0.00055771845,0.0022753403,0.00013129329,0.00051056116],"category_scores_gemma":[0.012488029,0.00017653136,0.0002215828,0.0013947401,0.0013574731,0.0005461868,0.00021616813,0.000317042,0.0006867611],"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.0011760405,0.0002417044,0.0002648122,0.00002440372,0.000026667574,4.2717312e-7,0.0021270914,0.00010402781,0.037582852,0.7951377,0.0038931232,0.15942118],"study_design_scores_gemma":[0.000046106743,0.00071693497,0.00034288154,0.000107451415,0.0000067087103,0.0000017424587,0.0012102727,0.011951301,0.39998594,0.5846598,0.00081483444,0.00015600365],"about_ca_topic_score_codex":0.000021036643,"about_ca_topic_score_gemma":0.000033761888,"teacher_disagreement_score":0.3624031,"about_ca_system_score_codex":0.00006789115,"about_ca_system_score_gemma":0.00016830303,"threshold_uncertainty_score":0.9958302},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38448495,0.000022756942,0.5675637,0.010567482,0.00093839807,0.001428908,0.000059317652,0.0002381413,0.034696348],"genre_scores_gemma":[0.9934393,0.000008695694,0.005851989,0.00014779139,0.00016004598,0.000029685769,0.000002505104,0.000010396698,0.0003495708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988107,0.000012556748,0.00031945368,0.00024865454,0.00034533336,0.00026327075],"domain_scores_gemma":[0.9986232,0.00010515065,0.00021435232,0.00007788726,0.0009169198,0.00006251744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004818063,0.000115555384,0.0001439423,0.00007039888,0.0006327298,0.00011869802,0.00046319148,0.00008073368,0.00011153457],"category_scores_gemma":[0.00035994765,0.00009431431,0.00008821227,0.0003889023,0.0006056052,0.00017213989,0.000007181788,0.00009583516,0.000012331265],"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.00041445854,0.00010865571,0.0011301616,0.000049768027,0.000012633848,8.76603e-8,0.01834439,0.002956948,0.005276799,0.95540464,0.00025886606,0.016042596],"study_design_scores_gemma":[0.00020120211,0.0008675968,0.0014342017,0.00086830434,0.00010720739,3.2956066e-7,0.021536916,0.12693386,0.7829555,0.05536712,0.009013365,0.00071436417],"about_ca_topic_score_codex":0.00012117887,"about_ca_topic_score_gemma":0.00024866936,"teacher_disagreement_score":0.9000375,"about_ca_system_score_codex":0.00003558912,"about_ca_system_score_gemma":0.0001583319,"threshold_uncertainty_score":0.48665097},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23894861,0.000008517053,0.6005392,0.035307996,0.0029312787,0.0019216391,0.000030197665,0.0006378889,0.11967468],"genre_scores_gemma":[0.9896143,0.000012624588,0.009837016,0.0002633691,0.00010684818,0.00002036829,8.3952864e-7,0.000007917269,0.00013671312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99815375,0.000029147637,0.00056894904,0.0005401988,0.00046039082,0.00024755736],"domain_scores_gemma":[0.99810416,0.00015379026,0.0003917059,0.00039136823,0.00087990693,0.000079092504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048418442,0.00018540253,0.00017370362,0.0001312065,0.00033104548,0.00023921952,0.001068191,0.00008403924,0.00008758015],"category_scores_gemma":[0.0009612726,0.00014601652,0.00008214108,0.0005839043,0.0003887427,0.00074717123,0.00024528147,0.00021887843,0.00017421118],"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.00029876386,0.00013351135,0.000316263,0.000015675087,0.0000098377905,2.3837549e-7,0.0035506636,0.0005273896,0.0065850792,0.8256629,0.00045200187,0.16244769],"study_design_scores_gemma":[0.00007442755,0.0013874805,0.002302111,0.0002919771,0.00000991155,0.0000038006297,0.00067313906,0.43258455,0.43391228,0.12828219,0.0001573425,0.00032082025],"about_ca_topic_score_codex":0.000021518777,"about_ca_topic_score_gemma":0.000021383072,"teacher_disagreement_score":0.75066566,"about_ca_system_score_codex":0.000060198447,"about_ca_system_score_gemma":0.00010503753,"threshold_uncertainty_score":0.5954381},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9429899,0.000004266847,0.03300688,0.0056887474,0.00021728191,0.0005761942,0.000009396846,0.000016865944,0.017490486],"genre_scores_gemma":[0.9989092,0.000005409193,0.00026815428,0.0003460355,0.000046274763,0.000033935583,3.0857572e-7,0.000007788428,0.00038292597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977848,0.00005714678,0.0007025892,0.00034496773,0.000921034,0.000189496],"domain_scores_gemma":[0.99705297,0.00086933834,0.000744397,0.00036265078,0.00091806945,0.000052588483],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001420157,0.00014770741,0.00020790366,0.000109856526,0.00035023573,0.00021121997,0.0014152018,0.00006292623,0.0016466965],"category_scores_gemma":[0.0012753905,0.00007804074,0.00012005838,0.000840976,0.0006656034,0.00032686413,0.00016441438,0.00021890628,0.00047681195],"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.000026236525,0.00011157162,0.00006911651,0.0000039589368,0.000006100109,8.92426e-9,0.0003435589,0.00045003576,0.061339878,0.934176,0.00015298724,0.0033205505],"study_design_scores_gemma":[0.000010562404,0.000053763186,0.0006323602,0.00008163775,0.0000075915978,0.0000011154652,0.0037859478,0.01996362,0.15927105,0.816066,0.00004638459,0.00007991665],"about_ca_topic_score_codex":0.00007451912,"about_ca_topic_score_gemma":0.000004170991,"teacher_disagreement_score":0.11810994,"about_ca_system_score_codex":0.000032915017,"about_ca_system_score_gemma":0.000042548683,"threshold_uncertainty_score":0.9992659},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006363585,0.000009933099,0.938601,0.04882531,0.00054034294,0.0011330531,0.0000041485923,0.0001760032,0.0043466114],"genre_scores_gemma":[0.9930834,0.000023799888,0.005789479,0.00065925263,0.00011878196,0.0001288228,0.000005418257,0.000023637584,0.00016738851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99698186,0.00005143351,0.0006421657,0.0007949288,0.0012166532,0.00031295995],"domain_scores_gemma":[0.996449,0.00019206475,0.0012938791,0.0007315352,0.0012549061,0.00007859176],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005463233,0.0003702988,0.00035458224,0.00011383109,0.00029764738,0.0010688864,0.0041848803,0.00016334778,0.000026636793],"category_scores_gemma":[0.00048557605,0.0002238458,0.00014506278,0.0007660489,0.0003729519,0.00054973527,0.0010939064,0.00097639405,0.00006619743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016578713,0.000066209876,0.0001943477,0.00019039765,0.000052236417,0.0000010628042,0.003490627,0.42010674,0.0043995474,0.5628826,0.00070147135,0.0077489377],"study_design_scores_gemma":[0.000031294476,0.0002203018,0.000078850564,0.00038916696,0.000036236946,8.5455974e-7,0.00055672554,0.78131336,0.18029362,0.03669108,0.00011665215,0.00027187532],"about_ca_topic_score_codex":0.00006937898,"about_ca_topic_score_gemma":0.0000131550505,"teacher_disagreement_score":0.98671985,"about_ca_system_score_codex":0.00008591529,"about_ca_system_score_gemma":0.0003782121,"threshold_uncertainty_score":0.9999681},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032561705,0.000046916124,0.9373361,0.010068002,0.0021430645,0.0020648434,0.000047049394,0.00032517232,0.015407163],"genre_scores_gemma":[0.9914502,0.000059901722,0.0069031403,0.00018025126,0.00014084754,0.00014046968,0.000018696895,0.000027662976,0.0010788115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970931,0.00005355831,0.000707877,0.0011060569,0.00063198706,0.00040742653],"domain_scores_gemma":[0.99647677,0.00038678892,0.0012065903,0.00064352946,0.001194826,0.00009152557],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00091288483,0.00042688256,0.0004920933,0.0002191906,0.00026896741,0.00047585065,0.0034215068,0.00025863783,0.00003249178],"category_scores_gemma":[0.002209996,0.00032365724,0.00026336362,0.00040069662,0.00017263567,0.00023716659,0.001129086,0.0014530995,0.00016554775],"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.00006510402,0.00014690499,0.00011887417,0.00018691526,0.000029640443,1.2894252e-7,0.0012568976,0.013471132,0.0017610149,0.9304497,0.0003940258,0.05211964],"study_design_scores_gemma":[0.0000349206,0.0005014383,0.00006534676,0.0006907271,0.000022295124,9.62029e-7,0.00041874466,0.7623204,0.035320178,0.19982636,0.000460164,0.00033843747],"about_ca_topic_score_codex":0.00007466094,"about_ca_topic_score_gemma":0.000006889492,"teacher_disagreement_score":0.95888853,"about_ca_system_score_codex":0.00008514239,"about_ca_system_score_gemma":0.00024933947,"threshold_uncertainty_score":0.99992156},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34144136,0.00039710142,0.5257224,0.009145908,0.0059675053,0.0063924836,0.0002000778,0.0011623048,0.109570846],"genre_scores_gemma":[0.99268293,0.00013559053,0.0057914983,0.00040048736,0.00018375016,0.000096052674,0.000003385112,0.00006356956,0.0006427302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99382883,0.000055388256,0.0015178182,0.0018694826,0.0015186418,0.0012098603],"domain_scores_gemma":[0.9932286,0.00031369095,0.0018071999,0.0014741446,0.0029354405,0.00024088129],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011352838,0.00096922554,0.0010994407,0.0003921857,0.0003655034,0.0012759491,0.006948959,0.0005656976,0.00027277527],"category_scores_gemma":[0.00068716565,0.0007044164,0.00041492571,0.0008358329,0.0013683249,0.0008238161,0.0033635285,0.0019893725,0.00041650215],"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.00011575521,0.00031600334,0.00051544356,0.00029250397,0.00011518855,0.00000675384,0.0034212896,0.0019201159,0.004533004,0.8970601,0.0003483351,0.09135549],"study_design_scores_gemma":[0.000051723546,0.0006025835,0.00029280616,0.002725563,0.00007548551,0.00003314531,0.004039483,0.21017675,0.38852152,0.39204288,0.0001689897,0.0012690475],"about_ca_topic_score_codex":0.0001063042,"about_ca_topic_score_gemma":0.00006371525,"teacher_disagreement_score":0.6512416,"about_ca_system_score_codex":0.00018787784,"about_ca_system_score_gemma":0.001031921,"threshold_uncertainty_score":0.9997608},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013309464,0.000018061432,0.90318394,0.0035880157,0.0026206367,0.001847124,0.0000025249208,0.0003556055,0.07507465],"genre_scores_gemma":[0.9926826,0.000079191006,0.0034848906,0.00015376382,0.00009335329,0.00006719714,0.000007644338,0.000034144417,0.003397232],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957383,0.000034623416,0.0013392993,0.0010168257,0.0012931849,0.00057774043],"domain_scores_gemma":[0.9954885,0.00022496025,0.0018846971,0.0010480142,0.0012239559,0.00012985097],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000852802,0.00052958546,0.00059132656,0.00029915242,0.0003212537,0.0007946454,0.004906607,0.0003288576,0.00019018787],"category_scores_gemma":[0.00078860443,0.00044743135,0.00034644053,0.00056744245,0.00027419618,0.00046254677,0.0034070187,0.001962822,0.0004462048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003972487,0.00006284066,0.00035442662,0.0001889727,0.00005980782,6.188363e-7,0.00122924,0.695423,0.0038342243,0.2926874,0.00020609068,0.0059136744],"study_design_scores_gemma":[0.000046193283,0.00028451133,0.00043152564,0.0007196451,0.00003418831,0.000001834422,0.0002739636,0.8684066,0.081821375,0.04739388,0.00010723467,0.00047904698],"about_ca_topic_score_codex":0.00011279629,"about_ca_topic_score_gemma":0.0000019637125,"teacher_disagreement_score":0.9793731,"about_ca_system_score_codex":0.00016538371,"about_ca_system_score_gemma":0.00031302567,"threshold_uncertainty_score":0.99979776},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021054123,0.00007590742,0.9737866,0.0001824504,0.0016921017,0.0009765002,0.0000012751955,0.0002030477,0.0020280061],"genre_scores_gemma":[0.70968884,0.00012886096,0.2898347,0.00004385391,0.00008830566,0.00003660474,0.000005426242,0.00003667031,0.00013672592],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99560934,0.00011291444,0.0013316681,0.0011675789,0.0011991124,0.00057938707],"domain_scores_gemma":[0.99523544,0.00019825272,0.0023041528,0.0007635556,0.0013709598,0.00012763166],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0022068047,0.0005710909,0.0006262591,0.00038359227,0.0005217074,0.0011079998,0.0037007222,0.00043560704,0.000053849613],"category_scores_gemma":[0.0028250457,0.0004834818,0.00027512285,0.0007892134,0.00023588835,0.00080469955,0.0032785404,0.0016265713,0.0000332516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007442547,0.00005694258,0.00028399093,0.00016972882,0.000022223303,2.4885776e-7,0.0011012788,0.78681475,0.0061529693,0.1491147,0.000002649218,0.05620611],"study_design_scores_gemma":[0.000036047688,0.00022914425,0.0000148085965,0.0006535763,0.000035832694,0.0000042179004,0.00019877641,0.87351876,0.10511003,0.019735236,0.000029222116,0.000434346],"about_ca_topic_score_codex":0.00021394073,"about_ca_topic_score_gemma":0.000009056039,"teacher_disagreement_score":0.68863475,"about_ca_system_score_codex":0.0003542169,"about_ca_system_score_gemma":0.0002860747,"threshold_uncertainty_score":0.99992895},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3311834,0.0000512027,0.515138,0.017922012,0.0027162684,0.0016977271,0.00001464085,0.0004031312,0.13087365],"genre_scores_gemma":[0.9935583,0.00002005828,0.0045048944,0.00014820846,0.000048859485,0.0000073228434,0.000002548161,0.000010097112,0.0016997444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982797,0.000024108153,0.0005129222,0.00045621346,0.00051766285,0.00020941744],"domain_scores_gemma":[0.9981741,0.00007522299,0.0005461858,0.00048469508,0.000661285,0.00005852024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055411895,0.0001638984,0.00022068812,0.000119270466,0.000085213615,0.00012659506,0.0019993202,0.00009675505,0.00009262513],"category_scores_gemma":[0.0005136003,0.00012598226,0.00008714118,0.0005025837,0.00009998667,0.00042772535,0.00034821455,0.0002511619,0.00047918063],"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.00003261459,0.00006171255,0.0005906293,0.000045761015,0.0000075519592,8.619432e-8,0.0006860977,0.00007808337,0.078852,0.89188975,0.000054713273,0.027701022],"study_design_scores_gemma":[0.00004123158,0.0003605091,0.00059478433,0.00027820547,0.000011723391,0.0000022411218,0.0002725825,0.25107524,0.6250774,0.12112559,0.00093156705,0.00022888991],"about_ca_topic_score_codex":0.000038995433,"about_ca_topic_score_gemma":0.0000044696453,"teacher_disagreement_score":0.7707641,"about_ca_system_score_codex":0.000025699917,"about_ca_system_score_gemma":0.00011223692,"threshold_uncertainty_score":0.6159057},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8068361,0.000007464449,0.18262063,0.006686264,0.00021389048,0.0012101762,0.0000076920505,0.00009591871,0.002321842],"genre_scores_gemma":[0.9749306,0.0000032081969,0.02439341,0.00025317853,0.00003751437,0.00003596656,8.660089e-7,0.00001114255,0.00033415388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986644,0.000011911237,0.00033367737,0.0004887627,0.00028533884,0.0002159507],"domain_scores_gemma":[0.9987778,0.0001916451,0.00022036974,0.0002936944,0.0004355276,0.000080935424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047352925,0.00015866087,0.00018219177,0.00012449877,0.00013665984,0.00022116306,0.0010796664,0.0000724551,0.00002521988],"category_scores_gemma":[0.0007166441,0.00011846361,0.00006216276,0.0003865473,0.00007435679,0.00027875978,0.00029993404,0.000213129,0.00013030382],"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.00006673208,0.000053095628,0.00024812066,0.000027048727,0.0000037392824,1.9054447e-8,0.0023592515,0.000044132295,0.29089308,0.5551559,0.00004714804,0.15110177],"study_design_scores_gemma":[0.000051873827,0.00034293876,0.0039037785,0.00017722328,0.0000061652863,0.0000016711381,0.00043795464,0.530439,0.4277703,0.036570136,0.00011049203,0.00018847571],"about_ca_topic_score_codex":0.000071697,"about_ca_topic_score_gemma":0.000005881065,"teacher_disagreement_score":0.53039485,"about_ca_system_score_codex":0.000031686155,"about_ca_system_score_gemma":0.000037544683,"threshold_uncertainty_score":0.4830806},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86264366,0.0000661172,0.11929554,0.002297729,0.00041035112,0.00080948183,0.0000054882894,0.00013205229,0.014339599],"genre_scores_gemma":[0.9862711,0.00001845053,0.012906412,0.00027854074,0.00007901863,0.000011152555,5.778601e-7,0.000010087372,0.00042469107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827,0.000012831466,0.00041179854,0.0005812659,0.0003950799,0.0003290253],"domain_scores_gemma":[0.9990262,0.00013165217,0.00025418098,0.00024343035,0.00019254847,0.00015198758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035264407,0.00021763908,0.000266354,0.00016755203,0.00013367529,0.0004621699,0.00143367,0.0000661023,0.000023871864],"category_scores_gemma":[0.00013168369,0.00016421861,0.000070044785,0.0006450482,0.000075080396,0.00045688346,0.0005679017,0.00017663006,0.00013870052],"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.00003099152,0.000065984925,0.00065953686,0.000054243712,0.000011861005,1.0207585e-7,0.003405934,0.000104327926,0.015420079,0.8888046,0.00016489309,0.091277406],"study_design_scores_gemma":[0.00018777867,0.00085077266,0.006839602,0.0009883832,0.000037642163,0.00003739364,0.0025617066,0.22738951,0.23913911,0.5191102,0.0017481154,0.0011097853],"about_ca_topic_score_codex":0.0001867493,"about_ca_topic_score_gemma":0.0000106128455,"teacher_disagreement_score":0.36969444,"about_ca_system_score_codex":0.00004039577,"about_ca_system_score_gemma":0.00010978006,"threshold_uncertainty_score":0.669664},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21426412,0.00014918484,0.7729701,0.0021113527,0.0038643796,0.0013828682,0.00006578408,0.00024182061,0.00495043],"genre_scores_gemma":[0.9644926,0.00004845378,0.034859728,0.00017028852,0.00018290113,0.000026937418,0.000002552496,0.000034152283,0.00018235385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956919,0.000054386128,0.0014023543,0.0011824458,0.0009909663,0.00067793304],"domain_scores_gemma":[0.99583447,0.0001639431,0.0018697086,0.00094913057,0.0010181617,0.00016459293],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007436462,0.00064320856,0.0009156638,0.00022602102,0.00015284207,0.00049893983,0.00570748,0.0005254085,0.00008041715],"category_scores_gemma":[0.0003412925,0.00050042785,0.00038213888,0.00055799395,0.00036734395,0.0003226484,0.0026040908,0.0015091426,0.000029518813],"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.00009823315,0.000109339344,0.0002985265,0.00040238086,0.000117483396,9.139137e-7,0.004016077,0.045942735,0.009394713,0.9238942,0.00032381568,0.015401577],"study_design_scores_gemma":[0.000025683634,0.00019436896,0.00010498814,0.0011529172,0.00003580631,0.000004175155,0.0001881156,0.467555,0.16778877,0.3624552,0.000013915449,0.0004810766],"about_ca_topic_score_codex":0.0001049677,"about_ca_topic_score_gemma":0.000010127518,"teacher_disagreement_score":0.7502285,"about_ca_system_score_codex":0.00008368736,"about_ca_system_score_gemma":0.0005218895,"threshold_uncertainty_score":0.9997447},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08843809,0.000016220698,0.90465426,0.0024136545,0.0009767178,0.00089770043,0.00009299288,0.00015284742,0.0023574962],"genre_scores_gemma":[0.930002,0.000014618247,0.069434084,0.0002309735,0.00011399373,0.00010346433,0.000010626774,0.000025410673,0.00006486827],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968884,0.00001936216,0.00071584235,0.0011171291,0.0008279592,0.0004312867],"domain_scores_gemma":[0.99680364,0.00022131849,0.0008676388,0.00095959345,0.0010239929,0.00012379131],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005541931,0.0004416422,0.00048011862,0.00017705496,0.00019543673,0.0008694128,0.004303524,0.00023368718,0.000049240665],"category_scores_gemma":[0.00022881477,0.0003139701,0.00018202845,0.00047906023,0.0004311245,0.0002562104,0.0015698293,0.00072853384,0.00009397972],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050179162,0.00025951816,0.0006269278,0.00015711157,0.000048258436,0.0000017374166,0.000829327,0.0016266926,0.0017425009,0.16489884,0.0004105968,0.8293483],"study_design_scores_gemma":[0.00007978545,0.0003240939,0.00024437634,0.0025947436,0.000052887197,0.000007177709,0.00042487553,0.82047576,0.1257348,0.049204495,0.00016500439,0.0006919697],"about_ca_topic_score_codex":0.000093850795,"about_ca_topic_score_gemma":0.000029274046,"teacher_disagreement_score":0.8415639,"about_ca_system_score_codex":0.00007091615,"about_ca_system_score_gemma":0.00061415916,"threshold_uncertainty_score":0.9999312},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042958935,0.00001892043,0.9752009,0.015676107,0.00045050864,0.0013334067,0.000009326154,0.00021349851,0.0028014558],"genre_scores_gemma":[0.97923416,0.000011650992,0.01948824,0.0006276444,0.0003543056,0.00019271324,0.0000013199469,0.00002115235,0.00006884135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979175,0.00002021852,0.00058187416,0.0006753888,0.000415534,0.00038950026],"domain_scores_gemma":[0.99788505,0.00062692806,0.00047540362,0.0003175827,0.0005438528,0.0001512071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035932986,0.00025777257,0.00032735185,0.0000756148,0.00034907673,0.00022942932,0.0027546363,0.000108605476,0.000037894613],"category_scores_gemma":[0.0024708176,0.00021574172,0.00017809156,0.0006948321,0.00022794912,0.00040819537,0.00059002166,0.0003839545,0.000100547615],"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.00005948552,0.00008195358,0.00018409014,0.00008777487,0.000022782428,3.8632345e-7,0.0014039178,0.0033435083,0.004981951,0.93356425,0.00026927984,0.056000594],"study_design_scores_gemma":[0.00012506406,0.00040156566,0.00014077923,0.00014250123,0.000060017,0.0000038920753,0.0004933852,0.75931865,0.092204854,0.1442252,0.0024013387,0.00048279177],"about_ca_topic_score_codex":0.000021917242,"about_ca_topic_score_gemma":0.0000037262175,"teacher_disagreement_score":0.9749382,"about_ca_system_score_codex":0.000056123612,"about_ca_system_score_gemma":0.00017459613,"threshold_uncertainty_score":0.8797692},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061810516,0.0000026235334,0.9267079,0.0007961463,0.0003764446,0.0011402614,0.000002701255,0.000093234135,0.009070151],"genre_scores_gemma":[0.99310946,0.000042335676,0.005459989,0.00010909012,0.000021450538,0.000045084733,0.0000029050036,0.000012194609,0.0011975142],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981782,0.000022534325,0.0006107399,0.00034268477,0.0005123499,0.00033351217],"domain_scores_gemma":[0.99813354,0.00018852488,0.00065649464,0.00021636541,0.0007445381,0.000060560677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006410653,0.00019628352,0.00021881767,0.00014075091,0.00029370553,0.00025748948,0.0009659635,0.000059526476,0.000041893698],"category_scores_gemma":[0.00031823863,0.0001587961,0.0001353337,0.00042540094,0.00009269619,0.00072195265,0.0001405887,0.00032601823,0.00015310949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007758974,0.00002987522,0.0003372649,0.0000628662,0.000029532894,4.643773e-8,0.0047455337,0.5037624,0.012391637,0.45759544,0.000044901943,0.02092291],"study_design_scores_gemma":[0.00006371517,0.00041050417,0.00012894906,0.00010411192,0.000012728799,7.7157216e-7,0.00081430445,0.71645415,0.26820076,0.013516904,0.00013527443,0.00015786513],"about_ca_topic_score_codex":0.00002552277,"about_ca_topic_score_gemma":0.0000025163488,"teacher_disagreement_score":0.9312989,"about_ca_system_score_codex":0.00008194862,"about_ca_system_score_gemma":0.00008090899,"threshold_uncertainty_score":0.6475517},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2898013,0.0010239761,0.6149903,0.027892826,0.018955944,0.023749126,0.009547911,0.0006231183,0.01341551],"genre_scores_gemma":[0.9871867,0.00013226953,0.006116076,0.000147526,0.000507541,0.00035541737,0.000020265885,0.000057513582,0.005476735],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9921551,0.00007572273,0.0021186417,0.0016397663,0.0033263299,0.0006844362],"domain_scores_gemma":[0.98896617,0.0014206644,0.0019428385,0.0010186762,0.006472613,0.00017905165],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0039114133,0.0005879289,0.0013650166,0.0005219295,0.00024844555,0.00074997696,0.00497557,0.00046367405,0.00049631984],"category_scores_gemma":[0.008964201,0.00036616955,0.0010549938,0.0007940918,0.0006503559,0.00037696082,0.0020518492,0.001373971,0.00021150165],"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.003716139,0.0030428884,0.0011940867,0.0010586936,0.0032991776,0.0000022897532,0.0044194665,0.03718725,0.024908766,0.32306662,0.019614412,0.5784902],"study_design_scores_gemma":[0.00008243765,0.0004641557,0.00031415335,0.00033204307,0.0004660518,0.0000026498385,0.0015359374,0.18128598,0.15838513,0.65405273,0.0026038326,0.00047492218],"about_ca_topic_score_codex":0.00004064166,"about_ca_topic_score_gemma":0.000028906401,"teacher_disagreement_score":0.6973854,"about_ca_system_score_codex":0.0001659041,"about_ca_system_score_gemma":0.0005016752,"threshold_uncertainty_score":0.999879},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29850793,0.00002580493,0.6928432,0.0024846732,0.0005801849,0.0013050224,0.0000036138379,0.00022839084,0.0040211705],"genre_scores_gemma":[0.99556595,0.000011469515,0.0038471827,0.000302767,0.0000876709,0.000059876747,8.608943e-7,0.000015716303,0.000108524895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980865,0.000021952397,0.0004339651,0.00059678167,0.00048495288,0.00037585874],"domain_scores_gemma":[0.99839705,0.00013422134,0.00037131814,0.00040638226,0.0005997326,0.00009126859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023587281,0.00024263251,0.00024026391,0.00009264709,0.00022415952,0.00017603599,0.001638676,0.000087031825,0.00005152497],"category_scores_gemma":[0.00007021213,0.00017314294,0.00008606212,0.0009712808,0.00021157684,0.00056337053,0.0003048131,0.00039240433,0.00007182622],"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.00018990441,0.00012177218,0.0008317025,0.000021312502,0.00002174002,5.5527045e-7,0.00027350153,0.03407411,0.06778325,0.84191614,0.000019269064,0.05474675],"study_design_scores_gemma":[0.00005124718,0.0003083528,0.0009591773,0.00007108893,0.000008871953,0.000013421557,0.000058639514,0.83593214,0.13215156,0.030194573,0.000031764488,0.00021914675],"about_ca_topic_score_codex":0.00003225662,"about_ca_topic_score_gemma":0.000039566108,"teacher_disagreement_score":0.81172156,"about_ca_system_score_codex":0.000060161885,"about_ca_system_score_gemma":0.0000819387,"threshold_uncertainty_score":0.7060564},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2506095,0.00012256292,0.6177581,0.06000352,0.010571875,0.008645813,0.00003829271,0.00095233135,0.051298037],"genre_scores_gemma":[0.99184096,0.00001816347,0.0072629745,0.0003726705,0.00014144382,0.00010913595,0.0000018643688,0.000012634664,0.00024014145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982026,0.00003177632,0.0006096493,0.00050409394,0.00026087285,0.00039096683],"domain_scores_gemma":[0.9985164,0.00019309972,0.00043353642,0.00029054764,0.0004900978,0.00007632974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008067072,0.00020962684,0.00031735122,0.000083187006,0.00016642245,0.0002648042,0.0015215623,0.00009789089,0.00006900774],"category_scores_gemma":[0.00013859363,0.00015269975,0.00016586867,0.0003869992,0.000071344526,0.00040970097,0.0003072871,0.00027802205,0.0000400746],"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.000049512942,0.000059996928,0.00033803232,0.000039364662,0.000010194928,2.745337e-8,0.00030593443,0.000012327905,0.0020534801,0.7213786,0.001613954,0.27413854],"study_design_scores_gemma":[0.00010960804,0.0010678224,0.0002785401,0.00045171392,0.000013597772,0.000007359575,0.00034431103,0.37671274,0.1794321,0.4305022,0.010602715,0.0004772709],"about_ca_topic_score_codex":0.000030253408,"about_ca_topic_score_gemma":0.0000133807935,"teacher_disagreement_score":0.7412315,"about_ca_system_score_codex":0.000049387385,"about_ca_system_score_gemma":0.00005649093,"threshold_uncertainty_score":0.6226915},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6130919,0.00007288432,0.30886468,0.0122281,0.0020679329,0.0010542198,0.000007397337,0.00039435815,0.062218517],"genre_scores_gemma":[0.9945647,0.000044032135,0.0037735084,0.0005588728,0.000068460206,0.000020819733,4.428961e-7,0.0000140285,0.00095513836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99766064,0.00002926476,0.0006107899,0.000643446,0.0005992617,0.0004565907],"domain_scores_gemma":[0.99819475,0.00015647859,0.00035708817,0.0005292254,0.0006396845,0.00012278577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006744041,0.00028486561,0.0003753715,0.00013124205,0.00016214229,0.00035563798,0.0028937052,0.0001707103,0.00018643761],"category_scores_gemma":[0.00028059035,0.00021057777,0.00018293115,0.00066747866,0.00017910721,0.00051096996,0.00049923,0.00050982944,0.00039070257],"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.00013451514,0.00012032625,0.00059337734,0.0000553556,0.000022131766,8.931121e-7,0.0010948132,0.00013086507,0.015401307,0.9156723,0.00032473417,0.06644939],"study_design_scores_gemma":[0.00015124727,0.00035740202,0.00025084268,0.00048222995,0.000018388653,0.000013331907,0.00026945648,0.31242454,0.33709764,0.34816667,0.00023488465,0.00053336093],"about_ca_topic_score_codex":0.000046182293,"about_ca_topic_score_gemma":0.000005703624,"teacher_disagreement_score":0.5675056,"about_ca_system_score_codex":0.00003601533,"about_ca_system_score_gemma":0.00012968578,"threshold_uncertainty_score":0.85871124},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9081999,0.000030584706,0.08416204,0.0017631493,0.00029680942,0.0003739217,0.0000029600726,0.00011056227,0.0050600795],"genre_scores_gemma":[0.9810563,0.000003706705,0.018154783,0.0005097279,0.000068914,0.0000062226113,3.94117e-7,0.0000131448405,0.000186809],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981132,0.000016112679,0.00039872612,0.0005403549,0.0005899812,0.0003416273],"domain_scores_gemma":[0.9985612,0.00008029026,0.00038201505,0.00028704587,0.00060517277,0.0000843009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028034832,0.0002524145,0.00029210545,0.00014858351,0.0001955656,0.00038613103,0.0017296463,0.000091290574,0.00014974616],"category_scores_gemma":[0.0002151054,0.00014593627,0.00006966416,0.001514045,0.0001390691,0.000499989,0.00029042762,0.0003541549,0.000056198478],"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.000090801695,0.00011746832,0.0039575575,0.000107902495,0.000036431262,0.0000014433876,0.00167709,0.0013606411,0.50666904,0.3706569,0.00014850247,0.11517623],"study_design_scores_gemma":[0.00005703647,0.00026265447,0.00040913658,0.0002520594,0.000011112635,0.000015052545,0.0001869952,0.30474102,0.6432887,0.05038795,0.00004324124,0.00034510074],"about_ca_topic_score_codex":0.000014718387,"about_ca_topic_score_gemma":0.000003868117,"teacher_disagreement_score":0.32026896,"about_ca_system_score_codex":0.00003450991,"about_ca_system_score_gemma":0.00013390795,"threshold_uncertainty_score":0.59511083},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77710557,0.0000036523516,0.22111449,0.0006512537,0.00022921183,0.0003950856,0.000004072017,0.000057967947,0.00043871556],"genre_scores_gemma":[0.9844991,0.0000025783022,0.01519428,0.00012854386,0.000021978685,0.000013608727,3.7784665e-7,0.000015048685,0.00012449967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774647,0.000020146828,0.0005909862,0.00058134494,0.0006909674,0.000370113],"domain_scores_gemma":[0.9979513,0.00014808818,0.0005387199,0.00055972615,0.0007200019,0.00008215311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037692898,0.00024596616,0.0003406528,0.00015552783,0.00008347814,0.00022272137,0.0018203083,0.000078329984,0.00005745216],"category_scores_gemma":[0.00014700495,0.0001727552,0.000116519455,0.00058082753,0.0001354302,0.0003423304,0.0003339452,0.00026493074,0.000034314915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029971727,0.0005044544,0.022478504,0.00036402125,0.00005095387,0.0000015839844,0.0033020666,0.1280815,0.11595599,0.669313,0.000014011941,0.059634175],"study_design_scores_gemma":[0.000042235115,0.00015548876,0.00071258156,0.0005657837,0.000008175223,0.0000012228237,0.0002475378,0.61507183,0.38133052,0.001685054,0.000010617149,0.00016898663],"about_ca_topic_score_codex":0.00009908598,"about_ca_topic_score_gemma":0.000013239281,"teacher_disagreement_score":0.66762793,"about_ca_system_score_codex":0.000046674104,"about_ca_system_score_gemma":0.00013336806,"threshold_uncertainty_score":0.7044752},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7500858,0.00006481406,0.16516678,0.012095991,0.0026266163,0.0040352186,0.00007632999,0.0023503108,0.06349817],"genre_scores_gemma":[0.9942238,0.0000068064624,0.0047272416,0.00007052354,0.00003098897,0.000030707834,0.0000014868065,0.000009519193,0.0008989597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998607,0.00000882788,0.0004276884,0.00039588663,0.0002927848,0.00026780303],"domain_scores_gemma":[0.99855846,0.00009150792,0.00034719348,0.00025350743,0.00069011806,0.000059199447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003836167,0.00015836807,0.00023152726,0.00012751113,0.00019542787,0.00021795486,0.001139953,0.00007586123,0.00010824774],"category_scores_gemma":[0.00020311525,0.0001182634,0.00017122355,0.0006731384,0.00011401667,0.00042948517,0.000185246,0.00013375671,0.0001810112],"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.000034256544,0.00007071846,0.00017786381,0.000029052415,0.000029314073,4.5250633e-8,0.0003508757,0.0007457464,0.03714492,0.9430491,0.0004386181,0.017929545],"study_design_scores_gemma":[0.00002607188,0.00024148558,0.00027120308,0.00011201191,0.000019213187,0.0000023116756,0.00012311118,0.8745065,0.05983962,0.064531535,0.00018654922,0.0001404398],"about_ca_topic_score_codex":0.000016002392,"about_ca_topic_score_gemma":0.0000023707696,"teacher_disagreement_score":0.8785175,"about_ca_system_score_codex":0.000026851121,"about_ca_system_score_gemma":0.00005267766,"threshold_uncertainty_score":0.48226413},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91468316,0.000011286321,0.07494012,0.0028194138,0.00049791863,0.0013128524,0.0000040448685,0.00013285625,0.005598332],"genre_scores_gemma":[0.99291927,0.000013350238,0.006227185,0.00007490868,0.000018289875,0.000036026333,0.0000011602259,0.000014585773,0.00069524266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815464,0.00006734266,0.0004529796,0.0005970314,0.00045258584,0.0002754451],"domain_scores_gemma":[0.9978727,0.00028860162,0.0005416084,0.00025536615,0.00096221984,0.00007952028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028816142,0.00020548413,0.00026655555,0.00016015767,0.00033302195,0.00020273562,0.0007204336,0.00009390016,0.00004475345],"category_scores_gemma":[0.0010261186,0.000164543,0.000063579995,0.00078202906,0.00015476097,0.00040376966,0.00034911733,0.00047960892,0.000047376318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004129128,0.00030668714,0.03683027,0.00033044379,0.0001089523,0.0000012506656,0.07653489,0.0063249716,0.19914408,0.45665163,0.000041856492,0.22331204],"study_design_scores_gemma":[0.000066149034,0.00065153773,0.008542723,0.00021426179,0.000011684088,0.0000042804904,0.0024428377,0.812302,0.08014751,0.09534829,0.00001469853,0.00025401122],"about_ca_topic_score_codex":0.00017836371,"about_ca_topic_score_gemma":0.000015935017,"teacher_disagreement_score":0.80597705,"about_ca_system_score_codex":0.00011140193,"about_ca_system_score_gemma":0.0001361754,"threshold_uncertainty_score":0.6709869},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99193406,0.000009201681,0.003732287,0.00082556135,0.0004389342,0.00061187526,0.000009249541,0.0003132726,0.0021255733],"genre_scores_gemma":[0.99823946,0.00000720331,0.0010600536,0.000307168,0.000059178827,0.000017877433,2.992527e-7,0.00004153668,0.00026721388],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99827236,0.000008059749,0.0005039359,0.0004102864,0.00031462385,0.0004907642],"domain_scores_gemma":[0.9991084,0.000065517306,0.00010836992,0.00030651662,0.0002752602,0.00013593295],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00033577782,0.00026612057,0.00034225636,0.00020772518,0.00012970272,0.000095720265,0.0010065449,0.00019731074,0.00014720765],"category_scores_gemma":[0.00023064253,0.00023521364,0.00010359521,0.0006009845,0.00010749787,0.00017929699,0.00027728328,0.00042209873,0.0010176632],"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.000086796106,0.000056278885,0.0020720216,0.000094944815,0.00003622422,7.8375126e-7,0.0014045519,0.03580067,0.8770632,0.04478036,0.00009258707,0.038511567],"study_design_scores_gemma":[0.000031755604,0.00015412853,0.001627439,0.00024297115,0.00002411371,0.0000030879012,0.00076459727,0.10612856,0.88450027,0.005757319,0.00040531714,0.0003604635],"about_ca_topic_score_codex":0.000028501217,"about_ca_topic_score_gemma":0.000014055107,"teacher_disagreement_score":0.07032789,"about_ca_system_score_codex":0.00011736085,"about_ca_system_score_gemma":0.00004224098,"threshold_uncertainty_score":0.99976015},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7924701,0.000071374634,0.15864421,0.003715886,0.0020228794,0.00086070254,0.000007907073,0.0002830852,0.04192385],"genre_scores_gemma":[0.98655885,0.000014666912,0.012247398,0.00015941728,0.000080021295,0.000012149897,5.869715e-7,0.000012412552,0.00091451104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978079,0.000024187508,0.000441023,0.0005695037,0.0007253528,0.00043201828],"domain_scores_gemma":[0.9985007,0.00027261925,0.00025283598,0.00032071833,0.0005523526,0.00010079308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009940048,0.00021704938,0.00025429734,0.0003190671,0.0002507843,0.00034639024,0.0020160875,0.000105618084,0.000108044],"category_scores_gemma":[0.00023560433,0.00016739905,0.00012647241,0.0015998553,0.00010557346,0.00047721443,0.00040109982,0.00054273277,0.0004579665],"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.000072603754,0.0002524646,0.0076487805,0.00012952113,0.000049252216,0.0000014496493,0.002988624,0.0031820654,0.055391945,0.71692455,0.0004780873,0.21288069],"study_design_scores_gemma":[0.00004027114,0.00029286885,0.00095346896,0.000305212,0.000007810548,0.000010979608,0.0003132514,0.61399096,0.3429158,0.040654425,0.0001898496,0.0003250962],"about_ca_topic_score_codex":0.000112415924,"about_ca_topic_score_gemma":0.0000015286665,"teacher_disagreement_score":0.6762701,"about_ca_system_score_codex":0.000058109512,"about_ca_system_score_gemma":0.0001676779,"threshold_uncertainty_score":0.6826335},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9934001,0.000040326024,0.0013486226,0.0022020282,0.00018578686,0.0004979267,0.000015421158,0.000020218818,0.0022895932],"genre_scores_gemma":[0.9986663,0.00004481131,0.00062360085,0.00006459908,0.000057925492,0.000016757314,6.365495e-7,0.000012176433,0.00051320443],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967798,0.000034674395,0.0008355797,0.00062617793,0.0013375552,0.00038620929],"domain_scores_gemma":[0.997282,0.0009888215,0.0003749671,0.00031715448,0.000936763,0.00010026662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020395285,0.0001862796,0.00037369432,0.0003770996,0.00015713742,0.00030355316,0.0014423375,0.000097261385,0.00023195767],"category_scores_gemma":[0.0034397643,0.00012905367,0.000071877475,0.0014828673,0.00026465073,0.00060394674,0.000451759,0.00045637882,0.00021273727],"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.00013463755,0.00014030901,0.46263266,0.00003936654,0.000021020212,6.9641635e-7,0.0038469143,0.0028548585,0.008324088,0.12992945,0.00013842194,0.39193758],"study_design_scores_gemma":[0.00010353817,0.00020020166,0.26919535,0.00035229864,0.00000885749,0.000002189592,0.005174913,0.034589425,0.12629099,0.5634787,0.0002654003,0.00033811067],"about_ca_topic_score_codex":0.00009205228,"about_ca_topic_score_gemma":0.000036710047,"teacher_disagreement_score":0.43354926,"about_ca_system_score_codex":0.000055549008,"about_ca_system_score_gemma":0.00008415789,"threshold_uncertainty_score":0.5262656},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9282173,0.000068400586,0.06253228,0.0009787332,0.00068434956,0.0004216522,0.000004640115,0.00014558982,0.006947064],"genre_scores_gemma":[0.9838595,0.0000015353502,0.015774358,0.0001390344,0.00003808221,0.0000057853285,4.88345e-7,0.000013418413,0.00016781394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979546,0.000024959732,0.00051645155,0.0005298517,0.00053782103,0.00043629954],"domain_scores_gemma":[0.9986036,0.00014172294,0.00044815234,0.000329346,0.00038652253,0.0000906818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078360405,0.0002468823,0.00029908743,0.00016647903,0.00022774728,0.00029456377,0.0017548843,0.00007986322,0.0000660776],"category_scores_gemma":[0.00015048083,0.00018352778,0.00012618568,0.0006848094,0.00012479143,0.00022604155,0.00039408755,0.0003498861,0.00012930905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010486517,0.00019301791,0.010333936,0.00014721691,0.000051673207,0.0000027303984,0.0053921686,0.07555766,0.10696742,0.7833944,0.00013937565,0.017715523],"study_design_scores_gemma":[0.000028373985,0.0001429468,0.00012374349,0.00047296888,0.000011217618,0.000007702699,0.0005007596,0.7821532,0.19336104,0.022879783,0.000071569935,0.00024666832],"about_ca_topic_score_codex":0.00006942359,"about_ca_topic_score_gemma":7.998336e-7,"teacher_disagreement_score":0.7605146,"about_ca_system_score_codex":0.00004693354,"about_ca_system_score_gemma":0.00013094896,"threshold_uncertainty_score":0.74840456},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052012995,0.00020684587,0.89728534,0.007098137,0.0033010852,0.0010720982,0.0000036701094,0.00017188561,0.03884794],"genre_scores_gemma":[0.99375266,0.00003916188,0.0051041218,0.0002998049,0.00021183578,0.00001421767,5.745822e-7,0.0000106807865,0.0005669548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980356,0.000028091774,0.00045441824,0.0006092565,0.00046623906,0.00040640382],"domain_scores_gemma":[0.99837947,0.000106406005,0.00031841773,0.0004026298,0.0007068363,0.00008624022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004941234,0.00023427916,0.00028134353,0.000083716855,0.0001870873,0.0002441445,0.0019682222,0.0000762555,0.00020456559],"category_scores_gemma":[0.00020911294,0.00017272244,0.00015445183,0.0006254741,0.00022494547,0.0005356713,0.0004416258,0.0002960167,0.0002611312],"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.00004444125,0.000102376594,0.00073634647,0.000015522639,0.00002764064,2.653708e-7,0.0002758364,0.013451215,0.018509736,0.9252744,0.0005541391,0.041008133],"study_design_scores_gemma":[0.000027884083,0.00011324748,0.00060340355,0.000081990016,0.0000090252615,0.000003300059,0.00012179996,0.8072956,0.14664705,0.044575512,0.00028628716,0.00023486187],"about_ca_topic_score_codex":0.000026367761,"about_ca_topic_score_gemma":0.000007073896,"teacher_disagreement_score":0.9417397,"about_ca_system_score_codex":0.000042975957,"about_ca_system_score_gemma":0.00008031709,"threshold_uncertainty_score":0.70434165},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5681112,0.00004277847,0.41609126,0.008587705,0.0020022152,0.0013932257,0.000009776704,0.00026168727,0.0035001722],"genre_scores_gemma":[0.9925345,0.0000075048956,0.006627433,0.00021596998,0.00012607145,0.0000447963,7.669404e-7,0.00001427885,0.00042865222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831665,0.000020289875,0.00038292634,0.00048972626,0.0004212237,0.0003691767],"domain_scores_gemma":[0.99847513,0.0001924306,0.0003127195,0.0004611713,0.00048376012,0.0000747774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071753596,0.00020423281,0.00021232828,0.00007063349,0.00036061383,0.0005520703,0.0028504375,0.000070255875,0.0000797212],"category_scores_gemma":[0.00024308557,0.00012368028,0.00013112405,0.0003763687,0.0001766715,0.00042456842,0.0002485112,0.00029915286,0.00011537249],"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.00007826151,0.0001230133,0.00028983937,0.000038463975,0.000021710395,1.6702148e-7,0.0011793489,0.00096311374,0.053921863,0.774143,0.00015182323,0.16908944],"study_design_scores_gemma":[0.000040132272,0.00033321642,0.00023634719,0.0000658419,0.0000121558605,0.0000034649047,0.00023715674,0.7997209,0.14152978,0.05724448,0.00040089825,0.0001756616],"about_ca_topic_score_codex":0.000078458936,"about_ca_topic_score_gemma":0.0000070819656,"teacher_disagreement_score":0.79875773,"about_ca_system_score_codex":0.000020903972,"about_ca_system_score_gemma":0.00008176247,"threshold_uncertainty_score":0.5323627},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9793505,0.000057909474,0.002213227,0.007245466,0.0007338808,0.00051618554,0.0000030389062,0.00009541913,0.00978435],"genre_scores_gemma":[0.9976504,0.000046693887,0.0013382608,0.0005099524,0.000026187583,0.000015042413,3.5126172e-7,0.0000065941285,0.00040652152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99854404,0.00002058356,0.00029458522,0.0004961408,0.0003163871,0.000328291],"domain_scores_gemma":[0.9989038,0.00033354305,0.00020541958,0.0002936081,0.0002051774,0.000058412883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000309511,0.00020571069,0.00028156932,0.00014876584,0.000103746424,0.00026855431,0.0009974639,0.00014909057,0.0000289197],"category_scores_gemma":[0.0006460429,0.00014118981,0.00006828403,0.0005104305,0.0001848047,0.00033322087,0.00023843751,0.0004461076,0.00005581479],"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.00010990732,0.00015685035,0.0028179404,0.000029366833,0.000010229963,0.0000010732198,0.00069422595,0.00008535427,0.012380055,0.96725625,0.000302776,0.016156001],"study_design_scores_gemma":[0.00015219426,0.0010703036,0.020071857,0.00050731085,0.000019579946,0.000022245344,0.0014662688,0.06537053,0.515948,0.3944809,0.00034515376,0.0005456717],"about_ca_topic_score_codex":0.000055156546,"about_ca_topic_score_gemma":0.000028173967,"teacher_disagreement_score":0.5727753,"about_ca_system_score_codex":0.000027000633,"about_ca_system_score_gemma":0.00005161054,"threshold_uncertainty_score":0.57575536},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94760174,0.00003090697,0.040135313,0.0025176103,0.0003493294,0.0010553275,0.0000018988522,0.00020736433,0.008100499],"genre_scores_gemma":[0.99400467,0.000011770413,0.0052502314,0.00017300356,0.000042336553,0.000042938485,5.0342703e-7,0.000029704508,0.00044484495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99645877,0.000069004716,0.0007923724,0.0009262566,0.001011993,0.00074158754],"domain_scores_gemma":[0.99775887,0.00033401797,0.00037739318,0.0005468231,0.00085389626,0.00012898206],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001130356,0.0003751452,0.00048584514,0.0004442265,0.00017495191,0.00043048756,0.0029405379,0.00015057129,0.000105004925],"category_scores_gemma":[0.00047283695,0.00027466842,0.00015399882,0.0018489327,0.00035823867,0.0007384504,0.00045074546,0.00087300135,0.00024562204],"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.0004778474,0.0004196602,0.035685334,0.00023143842,0.000029774726,0.0000061337632,0.0058983755,0.016381737,0.13501658,0.45570803,0.000023362294,0.3501217],"study_design_scores_gemma":[0.000052191004,0.0005021255,0.0005166485,0.00031998777,0.0000064141495,0.0000029350663,0.0018714999,0.44127873,0.54923886,0.0058633657,0.000036855705,0.0003103977],"about_ca_topic_score_codex":0.0004056739,"about_ca_topic_score_gemma":0.00006803295,"teacher_disagreement_score":0.44984466,"about_ca_system_score_codex":0.00013731174,"about_ca_system_score_gemma":0.0004244349,"threshold_uncertainty_score":0.99997056},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24750818,0.000038264825,0.7468648,0.0013332089,0.0005528827,0.0012465795,0.000006476399,0.00010540068,0.0023442137],"genre_scores_gemma":[0.97426295,0.000047891634,0.025144042,0.000113871436,0.00008453166,0.000109716115,0.0000013702593,0.000016994763,0.00021864979],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798894,0.0000090113235,0.000536863,0.00061374105,0.00043086827,0.00042059016],"domain_scores_gemma":[0.99777913,0.00016066426,0.00045763337,0.0004073245,0.0011096018,0.0000856597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031857716,0.00024944803,0.00026990328,0.00009675825,0.00025127566,0.00023285292,0.0022480027,0.00008663996,0.00001403916],"category_scores_gemma":[0.00015318554,0.00019427945,0.000109205204,0.0008740587,0.000113225215,0.00059449766,0.0004326508,0.00031337002,0.000054958236],"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.000051154173,0.0000678707,0.00022314498,0.00008662284,0.000012037126,1.2803059e-7,0.00090893166,0.005660053,0.030485885,0.830523,0.000037260535,0.13194388],"study_design_scores_gemma":[0.000029383185,0.00016451106,0.000101200116,0.00025869065,0.000008482634,0.000002971969,0.00013889009,0.58770967,0.31767723,0.0936505,0.000033093787,0.0002253621],"about_ca_topic_score_codex":0.0000077635805,"about_ca_topic_score_gemma":0.0000063841535,"teacher_disagreement_score":0.73687255,"about_ca_system_score_codex":0.000057479614,"about_ca_system_score_gemma":0.00012643095,"threshold_uncertainty_score":0.79224855},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6530927,0.000043174627,0.33623493,0.0023219578,0.0009844954,0.00070850516,0.000020009771,0.00026415085,0.0063300836],"genre_scores_gemma":[0.9904477,0.0000072084313,0.008992058,0.00026429843,0.00006400919,0.0000102759395,0.0000017244653,0.00001744253,0.00019527611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99720854,0.00004017319,0.0005799333,0.00073276757,0.0009760837,0.00046253428],"domain_scores_gemma":[0.997506,0.00030555905,0.0005865782,0.0003509906,0.0011166178,0.00013424185],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005395535,0.0003303878,0.00033823278,0.00018801146,0.0003351224,0.00034892993,0.0021550783,0.00019939659,0.00018451648],"category_scores_gemma":[0.00074658555,0.00024616404,0.00013798082,0.00068616087,0.00029277994,0.000546814,0.0003440539,0.00084549293,0.000110498906],"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.000055578705,0.00012043583,0.0042175744,0.000057124405,0.000013926998,0.0000014833986,0.00049644546,0.00709064,0.13171287,0.84531665,0.000057755453,0.010859526],"study_design_scores_gemma":[0.00004410966,0.00024085242,0.0005912275,0.0004230655,0.000009944091,0.000010695935,0.00021510193,0.49785608,0.30478597,0.19550815,0.000020100668,0.00029470967],"about_ca_topic_score_codex":0.00005737052,"about_ca_topic_score_gemma":0.0000030836675,"teacher_disagreement_score":0.64980847,"about_ca_system_score_codex":0.0000828139,"about_ca_system_score_gemma":0.000430847,"threshold_uncertainty_score":0.99999905},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95687765,0.000018936445,0.03266268,0.0012119958,0.0003056921,0.0005051432,0.0000022442935,0.000074860545,0.0083408],"genre_scores_gemma":[0.98475707,0.000010617858,0.014674157,0.00011898848,0.000030185493,0.000013524517,2.3166398e-7,0.0000146683105,0.00038055237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99778485,0.000017286979,0.00061644864,0.0005668141,0.0006667458,0.00034782247],"domain_scores_gemma":[0.997796,0.00010606991,0.0007786496,0.00050989696,0.0007324705,0.00007689001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000547224,0.00024161708,0.00039661155,0.000166175,0.000094324845,0.0001540425,0.0023275993,0.000091139846,0.000044519984],"category_scores_gemma":[0.00020889031,0.00016558828,0.000095011375,0.0007941381,0.00017971254,0.00055280107,0.00045477517,0.00035373872,0.000049620776],"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.00011580585,0.000114443515,0.0022195159,0.000111140886,0.00002478872,6.38895e-7,0.0027046818,0.00036384197,0.09617044,0.8573362,0.000019202515,0.040819306],"study_design_scores_gemma":[0.00010599879,0.00042713984,0.00032993915,0.0011010314,0.000019604544,0.000011125139,0.0009557258,0.22026138,0.69214916,0.084196754,0.00006261075,0.00037954352],"about_ca_topic_score_codex":0.000051459836,"about_ca_topic_score_gemma":0.000007910535,"teacher_disagreement_score":0.7731394,"about_ca_system_score_codex":0.00003841095,"about_ca_system_score_gemma":0.00012965432,"threshold_uncertainty_score":0.6752494},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6051303,0.00002754132,0.3813776,0.0035508196,0.00073549733,0.0010751211,0.000005601571,0.00012501203,0.007972495],"genre_scores_gemma":[0.9895657,0.0000020098237,0.00994067,0.00014937889,0.00007898578,0.00003121562,5.307613e-7,0.000011711729,0.00021983898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985023,0.000013674907,0.0003834377,0.00042713835,0.0003098743,0.0003635322],"domain_scores_gemma":[0.99890447,0.0002360255,0.00028589042,0.00022716104,0.00029000742,0.00005645198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046061687,0.0001867879,0.0002624969,0.00018154936,0.00011132633,0.00015815432,0.0013762082,0.00007311651,0.000014044519],"category_scores_gemma":[0.0004417554,0.00014222284,0.00009447114,0.0005062504,0.00010312753,0.00028571178,0.0002465566,0.00033733604,0.000047342728],"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.00012313196,0.00017635309,0.0011760837,0.00005604514,0.00001702704,4.6059105e-7,0.0077767572,0.012786822,0.016908407,0.9208343,0.000022589667,0.040122043],"study_design_scores_gemma":[0.00006105392,0.00027377866,0.00049000897,0.00026473397,0.000004814098,0.000003309367,0.0010563189,0.8806535,0.04134133,0.07559466,0.00005525101,0.00020124562],"about_ca_topic_score_codex":0.00008095622,"about_ca_topic_score_gemma":0.000008685588,"teacher_disagreement_score":0.8678667,"about_ca_system_score_codex":0.000044838354,"about_ca_system_score_gemma":0.00006885958,"threshold_uncertainty_score":0.5799679},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9246645,0.000034052107,0.00038223813,0.0010947912,0.00051306916,0.0006164574,0.000022619824,0.000020565018,0.072651684],"genre_scores_gemma":[0.998573,0.000011335673,0.000035723966,0.00014903826,0.000040210918,0.000021739841,3.4266512e-7,0.000015455418,0.0011531281],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839705,0.000015065815,0.0008027677,0.0003724048,0.00013025697,0.00028247785],"domain_scores_gemma":[0.99831915,0.00026947618,0.0008547194,0.00032948403,0.0001852444,0.00004194199],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014651922,0.00018219688,0.00038844897,0.00012771862,0.000112595706,0.00007214428,0.0011529641,0.00008901149,0.00087283057],"category_scores_gemma":[0.0007629261,0.00012458453,0.0001709806,0.0004219735,0.00028371887,0.000106667474,0.00011863194,0.00028301275,0.0012497167],"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.000081217506,0.00011920831,0.0012118999,0.00004444927,0.000015859072,4.50023e-8,0.00093237736,0.00018927535,0.004152385,0.9923905,0.00007320994,0.0007895514],"study_design_scores_gemma":[0.00006957186,0.0006202926,0.0006738438,0.00043257882,0.000009471025,0.0000023297289,0.0017248299,0.018256757,0.33489904,0.6426309,0.00035707123,0.00032336972],"about_ca_topic_score_codex":0.000037756632,"about_ca_topic_score_gemma":0.0000012830284,"teacher_disagreement_score":0.34975967,"about_ca_system_score_codex":0.000033015185,"about_ca_system_score_gemma":0.000025961104,"threshold_uncertainty_score":0.99952793},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90482324,0.000087157496,0.020594476,0.0014391611,0.0012539693,0.00055780716,0.0000053230888,0.0001788135,0.07106005],"genre_scores_gemma":[0.9905836,0.000006658773,0.008611096,0.00018461987,0.00005260752,0.000008693952,8.0173743e-7,0.0000119832475,0.0005399657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99812424,0.00002075585,0.00059080566,0.00044201847,0.00049616036,0.00032600845],"domain_scores_gemma":[0.9984529,0.0001588244,0.00060743256,0.000327246,0.00037441327,0.00007915622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005219006,0.0002172152,0.0003183426,0.00017623369,0.00013706075,0.0001238101,0.0014874801,0.00009704944,0.00012555938],"category_scores_gemma":[0.000091767826,0.00017448746,0.0001371077,0.0006820423,0.00012533316,0.00048424807,0.00020350833,0.00038030875,0.000107063264],"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.0001950927,0.00018602428,0.008726689,0.00024636064,0.000062058214,0.000002189306,0.0057065818,0.002854747,0.1951284,0.763301,0.00040887648,0.02318199],"study_design_scores_gemma":[0.000059487775,0.00022006709,0.0007373125,0.0006567584,0.0000138944115,0.000010624802,0.00048154258,0.08641644,0.81642324,0.094546355,0.00012994019,0.0003043372],"about_ca_topic_score_codex":0.00011753718,"about_ca_topic_score_gemma":0.000004405782,"teacher_disagreement_score":0.66875464,"about_ca_system_score_codex":0.00003184197,"about_ca_system_score_gemma":0.00012915007,"threshold_uncertainty_score":0.7115392},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19083075,0.00007689239,0.7963022,0.0004879771,0.0031841013,0.0011932163,0.000012124895,0.00015969925,0.0077530523],"genre_scores_gemma":[0.9673936,0.00006082719,0.03216751,0.00010337556,0.0001474144,0.000039730916,0.000001914443,0.000019297211,0.00006634624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99711055,0.000028030778,0.0011789533,0.00078773266,0.00038957328,0.0005051905],"domain_scores_gemma":[0.9965575,0.00008753682,0.0013273229,0.00084893446,0.001075166,0.00010354115],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00083299354,0.00048230393,0.0005477583,0.0004009457,0.00021418065,0.001021397,0.004179674,0.00036188067,0.00003133459],"category_scores_gemma":[0.00015424799,0.0004123984,0.0002980715,0.00047053566,0.00019124009,0.0013433786,0.0031276545,0.0010095423,0.00011732228],"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.00005280698,0.00012074668,0.000070345974,0.0005970346,0.000062598105,1.3081349e-7,0.0034520538,0.017926997,0.021425303,0.8584682,0.000120651195,0.09770316],"study_design_scores_gemma":[0.0000285914,0.000048569465,0.000015071513,0.00071856723,0.000018296061,0.0000031003535,0.00044136468,0.86449534,0.061365705,0.07234046,0.00012539064,0.00039952243],"about_ca_topic_score_codex":0.00013164378,"about_ca_topic_score_gemma":0.000006243603,"teacher_disagreement_score":0.84656835,"about_ca_system_score_codex":0.00024247616,"about_ca_system_score_gemma":0.0004388377,"threshold_uncertainty_score":0.9998328},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.950375,0.0000064281976,0.006188695,0.003839937,0.0012443574,0.0012457331,0.000009993021,0.000072551964,0.037017263],"genre_scores_gemma":[0.9935337,0.0000051167217,0.0017576808,0.0006047065,0.00009198252,0.000023004537,3.0739983e-7,0.000023973367,0.003959539],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99486405,0.0000893909,0.0012500039,0.0009796915,0.002305246,0.0005116278],"domain_scores_gemma":[0.99448806,0.0013302312,0.0007260963,0.0005423135,0.0027082649,0.00020504434],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0036416417,0.00030509147,0.0005654796,0.000476561,0.00025228242,0.00072168413,0.0025075083,0.00012894934,0.0017503104],"category_scores_gemma":[0.012831819,0.00020464318,0.00023525266,0.001717942,0.00021877656,0.0004342933,0.0007863184,0.00053125515,0.007069965],"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.0007445591,0.00013713681,0.003429189,0.000015287778,0.000021189235,0.0000017426061,0.0073838346,0.0016143911,0.3134778,0.22043622,0.0012044249,0.4515342],"study_design_scores_gemma":[0.00010489618,0.00046384812,0.0032366733,0.0005019607,0.000017640461,0.000011407468,0.016536832,0.0706882,0.76860195,0.13298392,0.0062540527,0.00059863663],"about_ca_topic_score_codex":0.00003260044,"about_ca_topic_score_gemma":0.000011832207,"teacher_disagreement_score":0.4551241,"about_ca_system_score_codex":0.00006999481,"about_ca_system_score_gemma":0.00009779931,"threshold_uncertainty_score":0.9991622},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1106259,0.000034756304,0.8640958,0.005654097,0.007569303,0.0021188678,0.000006628574,0.00028256953,0.00961207],"genre_scores_gemma":[0.99217254,0.000007693912,0.007013809,0.0001934209,0.0002730627,0.000035753863,9.741456e-7,0.000020116644,0.00028263463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977558,0.000027891974,0.0005696166,0.0006606144,0.00049230387,0.00049372803],"domain_scores_gemma":[0.9981507,0.00024476886,0.0005220218,0.00040983944,0.00058012793,0.00009254286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065875566,0.00027868865,0.00034483013,0.00011384484,0.00022275928,0.00025328406,0.0027714975,0.00013230146,0.00007588472],"category_scores_gemma":[0.0005758736,0.0002159488,0.00022437007,0.00053967,0.00016619144,0.00054166553,0.0006411093,0.00050561223,0.000057238332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021176145,0.00007920106,0.0005745001,0.000039489503,0.000018164523,1.8801174e-7,0.0005703072,0.015237933,0.0019791909,0.88556194,0.00015030173,0.09557702],"study_design_scores_gemma":[0.00007917265,0.0003834461,0.00007015093,0.000110144974,0.000013653507,0.0000023641544,0.00019356555,0.9440637,0.014004852,0.040596116,0.00023104614,0.00025173704],"about_ca_topic_score_codex":0.000017451164,"about_ca_topic_score_gemma":0.0000036613924,"teacher_disagreement_score":0.9288258,"about_ca_system_score_codex":0.00006705541,"about_ca_system_score_gemma":0.0000775971,"threshold_uncertainty_score":0.8806137},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2774019,0.000045161858,0.71852607,0.0011798999,0.000571569,0.0010056621,0.0000075382986,0.00023938155,0.0010228324],"genre_scores_gemma":[0.86628896,0.000005551945,0.13340136,0.00008190286,0.000034369517,0.000035527173,0.000001319211,0.00000811232,0.000142911],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99879164,0.000010519768,0.0004583339,0.00028797667,0.00027375264,0.00017778757],"domain_scores_gemma":[0.99838835,0.000070336464,0.0005027415,0.00021838439,0.0007925307,0.00002768465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038009067,0.00013106917,0.00019064818,0.00012970934,0.00010788383,0.00014650756,0.0010124153,0.00007936548,0.000024216692],"category_scores_gemma":[0.00034198453,0.00009919285,0.00008760271,0.0004381882,0.00006928171,0.00057959685,0.0001567442,0.00013738377,0.000009580724],"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.000009545165,0.00004561058,0.00014594979,0.00010728501,0.000005715663,1.646115e-8,0.0005508651,0.000049532176,0.45313805,0.49398062,0.000051893323,0.051914934],"study_design_scores_gemma":[0.000011852452,0.00008754427,0.00003303835,0.00019181945,0.0000055735954,9.0780844e-7,0.00006529764,0.40407333,0.5352324,0.060209915,0.000012907856,0.00007540253],"about_ca_topic_score_codex":0.000012430185,"about_ca_topic_score_gemma":0.0000017537931,"teacher_disagreement_score":0.58888704,"about_ca_system_score_codex":0.000036440724,"about_ca_system_score_gemma":0.00006226301,"threshold_uncertainty_score":0.4044967},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73442066,0.000099995144,0.00033970468,0.001032185,0.0009530822,0.00047608255,0.000022418759,0.0000550786,0.2626008],"genre_scores_gemma":[0.99554926,0.000020131045,0.0001813169,0.00019906998,0.000080905964,0.00001617036,7.237368e-7,0.00001951481,0.003932883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983414,0.000008131017,0.000803832,0.00044210587,0.0001031728,0.00030139156],"domain_scores_gemma":[0.99866927,0.00007403061,0.00072908314,0.00028263897,0.00018887932,0.000056098226],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009676964,0.00019384234,0.00042947303,0.00012730728,0.0001169023,0.00016513075,0.0008998071,0.00011010998,0.00068972283],"category_scores_gemma":[0.0003936663,0.00016521201,0.00015420085,0.00033290725,0.00022140803,0.00024039939,0.00015769589,0.0002615999,0.0024051527],"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.00006129675,0.00007007694,0.011296776,0.000082147344,0.000018657518,6.540257e-8,0.0006985686,0.0000146218135,0.003756086,0.9817874,0.00008514955,0.0021291503],"study_design_scores_gemma":[0.00005609375,0.00021883806,0.004682333,0.0002789853,0.000007671872,0.0000030834499,0.0007023067,0.002816373,0.10324589,0.88480645,0.0028126875,0.00036929385],"about_ca_topic_score_codex":0.000068008216,"about_ca_topic_score_gemma":0.0000032869145,"teacher_disagreement_score":0.26112866,"about_ca_system_score_codex":0.000052331237,"about_ca_system_score_gemma":0.000032945663,"threshold_uncertainty_score":0.9983716},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5583579,0.000014546519,0.42861202,0.00045642562,0.00015600449,0.00042825894,0.000002577864,0.00005624675,0.011916034],"genre_scores_gemma":[0.9984943,0.000013227751,0.0010736854,0.000027234431,0.00000814152,0.000007750928,0.0000027792655,0.0000031571894,0.0003697247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983263,0.000020290658,0.0005444512,0.00033409498,0.00055564387,0.00021924448],"domain_scores_gemma":[0.9983392,0.00014280873,0.0006018691,0.00021486511,0.0006465844,0.000054673827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033591336,0.00016131134,0.0004066781,0.00023226651,0.000106768064,0.00011288147,0.0009235543,0.00005440448,0.000117020645],"category_scores_gemma":[0.00019314254,0.0001248806,0.0001229727,0.0013216117,0.00020878772,0.00027833277,0.00039871436,0.0002454377,0.000023454157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003833142,0.00003322822,0.0051836385,0.00002521669,0.00018196943,6.440613e-8,0.0024830317,0.1878407,0.01686059,0.78656137,0.000009007363,0.00078282953],"study_design_scores_gemma":[0.000030606545,0.0002628663,0.0035148042,0.0000872216,0.000073052775,5.882295e-7,0.00088406075,0.8796436,0.11286916,0.0024662497,0.000027476903,0.00014032319],"about_ca_topic_score_codex":0.000025371923,"about_ca_topic_score_gemma":0.0000015246237,"teacher_disagreement_score":0.78409517,"about_ca_system_score_codex":0.000041018295,"about_ca_system_score_gemma":0.000056392266,"threshold_uncertainty_score":0.50924826},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89097023,0.0000036308827,0.001766829,0.00042836968,0.000091220194,0.00033171705,0.000002595999,0.00007665907,0.10632877],"genre_scores_gemma":[0.99672383,0.0000042077068,0.00046056192,0.000030939427,0.000094544775,0.000019394607,0.000001663978,0.000016935766,0.0026479268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99871004,0.000015087593,0.00037037185,0.00032019362,0.00029104613,0.00029329164],"domain_scores_gemma":[0.99905,0.000058980004,0.00032205274,0.00018922199,0.0003224753,0.00005724048],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00026404054,0.00018533267,0.00027558146,0.00008397682,0.00017684541,0.00010097313,0.0006850878,0.00004000686,0.0019730588],"category_scores_gemma":[0.000035968053,0.00013755565,0.00017438641,0.00039613608,0.00012885928,0.0001198865,0.00027613575,0.00037970094,0.0002975859],"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.000036367815,0.00014675269,0.06218997,0.000012109998,0.000038837567,3.3673842e-8,0.00052336307,0.0001441259,0.08239282,0.8078027,0.00019001114,0.046522908],"study_design_scores_gemma":[0.000047742953,0.000282411,0.0017837246,0.00038841224,0.000071403134,6.7051843e-7,0.0025921708,0.07397978,0.587723,0.331585,0.0010748795,0.00047079343],"about_ca_topic_score_codex":0.00009065286,"about_ca_topic_score_gemma":0.000002710499,"teacher_disagreement_score":0.5053302,"about_ca_system_score_codex":0.000018505989,"about_ca_system_score_gemma":0.000041285715,"threshold_uncertainty_score":0.9989393},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46698532,0.00007908941,0.5174003,0.0042900993,0.0024745893,0.0023635386,0.000014238,0.00035847063,0.0060343253],"genre_scores_gemma":[0.9927219,0.000012204109,0.0065459223,0.0002750764,0.000101870675,0.00005328134,0.0000012684496,0.00001899115,0.00026948677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775124,0.000027452268,0.00059178926,0.0007034892,0.00037681824,0.0005492104],"domain_scores_gemma":[0.99790996,0.00033794326,0.0004169527,0.00042255808,0.00079608784,0.000116468815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056295947,0.00028756898,0.0003705773,0.00013932717,0.00024319626,0.00021194837,0.002027852,0.00010550171,0.00003278854],"category_scores_gemma":[0.0003182032,0.00022296137,0.00021508402,0.00074411725,0.00020910063,0.00066776917,0.00044324782,0.00035753244,0.000086497574],"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.00011966418,0.00014481768,0.00034729234,0.000096415024,0.00001294722,2.0176267e-7,0.0007304174,0.0016110439,0.04563826,0.8937081,0.0002145856,0.057376243],"study_design_scores_gemma":[0.000063701365,0.00026948197,0.0001020877,0.00017632199,0.000008479627,0.0000042430474,0.00023210194,0.68294716,0.18585253,0.1299115,0.00018550485,0.0002468813],"about_ca_topic_score_codex":0.000008513103,"about_ca_topic_score_gemma":0.00000806906,"teacher_disagreement_score":0.7637966,"about_ca_system_score_codex":0.00006910216,"about_ca_system_score_gemma":0.00006345418,"threshold_uncertainty_score":0.9092101},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8573007,0.00003727442,0.13751484,0.002425926,0.00018712548,0.0013467899,0.000007238001,0.00015116239,0.00102896],"genre_scores_gemma":[0.93381774,0.000002097466,0.065635785,0.00016215531,0.00010006758,0.000105672516,0.0000017563666,0.000019283778,0.00015544456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983677,0.000019935886,0.00039385614,0.00057648454,0.00026854454,0.00037342537],"domain_scores_gemma":[0.9983289,0.00043412542,0.00036787518,0.0002925555,0.00046461227,0.00011188141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005729635,0.00019895098,0.00022995826,0.00009954707,0.0003312401,0.00046053668,0.0009828554,0.00005268254,0.0000249389],"category_scores_gemma":[0.0013231403,0.00016691319,0.000080423015,0.00047190176,0.000068480156,0.00030939028,0.0003710881,0.00023778758,0.00006728993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007693418,0.000083542385,0.0017490707,0.00018632917,0.0000296945,0.0000020077225,0.010834585,0.003596854,0.32986972,0.5658741,0.00006019247,0.08763698],"study_design_scores_gemma":[0.000118150754,0.00028286263,0.0016854458,0.00088587176,0.000030502817,0.000022024009,0.0055292123,0.8895777,0.07674012,0.02454995,0.000052551124,0.0005256294],"about_ca_topic_score_codex":0.00016071224,"about_ca_topic_score_gemma":0.000008769976,"teacher_disagreement_score":0.88598084,"about_ca_system_score_codex":0.00004695094,"about_ca_system_score_gemma":0.000037915946,"threshold_uncertainty_score":0.6806522},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99294424,0.000076384065,0.0006572996,0.0048385323,0.00011885555,0.0009493288,0.0000066511698,0.00010640335,0.000302306],"genre_scores_gemma":[0.99769044,0.00020239658,0.0012087079,0.00017119684,0.00003955486,0.000086592954,0.000003711048,0.00001550094,0.00058188936],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99857235,0.00001268519,0.00048641584,0.00039272153,0.000339556,0.00019628063],"domain_scores_gemma":[0.9982683,0.0003454514,0.0003090338,0.00017392157,0.0008300973,0.00007319339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004000607,0.0001647592,0.00028790868,0.00011984761,0.00011454012,0.0001306132,0.0002462738,0.000065280656,0.000075024975],"category_scores_gemma":[0.0013047692,0.00012245134,0.000118197946,0.00036523232,0.00014689047,0.00022055455,0.000053450643,0.00012785007,0.00005766431],"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.00047713684,0.00018259273,0.03906025,0.0005101505,0.00006457373,5.0182564e-7,0.00090180145,0.000045622208,0.8864638,0.008403681,0.00016556903,0.063724294],"study_design_scores_gemma":[0.00005774168,0.00029380212,0.0031142356,0.0008559197,0.00015799524,0.0000058129363,0.0010840436,0.36826774,0.6234313,0.0025820031,0.000022663462,0.00012672145],"about_ca_topic_score_codex":0.0000480927,"about_ca_topic_score_gemma":0.0000028076954,"teacher_disagreement_score":0.36822212,"about_ca_system_score_codex":0.000045212342,"about_ca_system_score_gemma":0.000045865163,"threshold_uncertainty_score":0.49934205},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3383378,0.00009507726,0.65230244,0.0032416906,0.00033972214,0.0017549741,0.0000026156376,0.0004234654,0.0035022083],"genre_scores_gemma":[0.95671874,0.000055885786,0.042508524,0.00012452745,0.000020864727,0.000055822064,0.0000012704076,0.000023208358,0.0004911727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981298,0.000056021727,0.00044384124,0.0005868403,0.00035405194,0.00042944835],"domain_scores_gemma":[0.99777603,0.0003846444,0.0006520398,0.0004023417,0.00071055285,0.000074416406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069661526,0.00025879644,0.00030152337,0.00011066435,0.00045557838,0.00030504496,0.002110622,0.00009456437,0.000011406952],"category_scores_gemma":[0.0003578583,0.00019123734,0.000105854655,0.00071775774,0.00026586215,0.0008660517,0.0003974428,0.00071931863,0.000030345194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016877685,0.00011195977,0.002449661,0.00009990965,0.000028630207,4.5687455e-7,0.0026556863,0.014326004,0.15985008,0.64075285,0.000016087119,0.1795399],"study_design_scores_gemma":[0.00009944697,0.00059693016,0.00028286345,0.00065954204,0.000014278654,0.000006276796,0.001034025,0.77342856,0.18741563,0.035784043,0.00030488413,0.00037351678],"about_ca_topic_score_codex":0.000015247118,"about_ca_topic_score_gemma":0.000008474228,"teacher_disagreement_score":0.7591026,"about_ca_system_score_codex":0.00005424958,"about_ca_system_score_gemma":0.00006644644,"threshold_uncertainty_score":0.7798433},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9907441,0.000050804858,0.0025927224,0.0031720065,0.00010961768,0.000490924,0.0000022458582,0.000034560955,0.0028030253],"genre_scores_gemma":[0.9982071,0.00004650597,0.001599677,0.00004230697,0.000009652391,0.000025334228,9.493911e-8,0.000006743546,0.00006257125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99831754,0.000018075689,0.000655249,0.00036844666,0.00035621197,0.0002844759],"domain_scores_gemma":[0.9981524,0.00022012247,0.0006118326,0.00049780676,0.0004846795,0.000033157434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087687105,0.00015229524,0.0002812882,0.00017301568,0.00011379833,0.00004929212,0.002618838,0.00012318183,0.000009756217],"category_scores_gemma":[0.00027688066,0.0001031287,0.00008146037,0.0012540639,0.00041327233,0.00015190507,0.0005103174,0.00033317407,0.000009339297],"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.00003083571,0.00012072355,0.0045824586,0.000051653096,0.000011842897,1.2520742e-7,0.0017487603,0.000102713435,0.060168207,0.91230816,0.000033507316,0.020840995],"study_design_scores_gemma":[0.00004577066,0.00021524157,0.0015082426,0.00032335153,0.0000066303305,0.0000042995557,0.0019232733,0.09527026,0.79391944,0.10650098,0.00011892201,0.0001635959],"about_ca_topic_score_codex":0.000047569334,"about_ca_topic_score_gemma":0.000027035123,"teacher_disagreement_score":0.8058072,"about_ca_system_score_codex":0.000025878095,"about_ca_system_score_gemma":0.00009436403,"threshold_uncertainty_score":0.48664963},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70962685,0.00054216397,0.26752913,0.0022491508,0.005512907,0.004607567,0.00022008202,0.0006037643,0.009108386],"genre_scores_gemma":[0.9916355,0.00005865801,0.007797657,0.00014442178,0.00016154141,0.000016229813,0.000007712116,0.00003420213,0.00014407832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842554,0.000010905537,0.0005404147,0.00030609567,0.00031034867,0.00040668296],"domain_scores_gemma":[0.9988236,0.00013867338,0.0001667968,0.00022666807,0.0005644444,0.00007981404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032501345,0.00024509474,0.00031589836,0.00006453215,0.00012566718,0.000097942146,0.00062657945,0.00013089964,0.00014421181],"category_scores_gemma":[0.00035116824,0.00020662339,0.00014445584,0.00033661033,0.00020841627,0.00013610783,0.00007475957,0.00025745976,0.00005366148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031510578,0.00012080754,0.001368896,0.00043666104,0.00009424793,3.8385994e-7,0.00044084634,0.3910931,0.040543366,0.54501534,0.0011533456,0.019417882],"study_design_scores_gemma":[0.00010537133,0.00014269091,0.00019155143,0.00020536674,0.000027701333,0.0000034139177,0.00017582526,0.94601166,0.041257855,0.011375492,0.00024914127,0.00025391488],"about_ca_topic_score_codex":0.000012977463,"about_ca_topic_score_gemma":0.000012292719,"teacher_disagreement_score":0.5549186,"about_ca_system_score_codex":0.00006498609,"about_ca_system_score_gemma":0.00006364241,"threshold_uncertainty_score":0.84258574},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16530441,0.000041820796,0.8187475,0.0070948075,0.0026452465,0.0026851657,0.000020777972,0.00031764334,0.003142637],"genre_scores_gemma":[0.9576051,0.00005031639,0.040544175,0.00049063336,0.00018696504,0.00023337292,0.0000025999782,0.00003828485,0.00084854505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956889,0.000040931387,0.0010418565,0.0016332739,0.00089573744,0.0006993006],"domain_scores_gemma":[0.9960502,0.00025384757,0.00090150785,0.0010046579,0.0016029378,0.00018687188],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012060978,0.000555349,0.0006748598,0.00029533444,0.00027709384,0.0006272402,0.005716505,0.00037895568,0.00001805702],"category_scores_gemma":[0.0014177788,0.0004663106,0.00032765046,0.00054051186,0.00017222791,0.00043870986,0.0031876566,0.0012348329,0.00013077522],"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.000090257694,0.00009739738,0.00017932305,0.0005494128,0.000030847666,9.032179e-7,0.0035793134,0.04403901,0.11899213,0.7031503,0.00019612441,0.12909502],"study_design_scores_gemma":[0.00002466421,0.00022227791,0.00001923639,0.0015056604,0.00001758473,0.0000039460438,0.00031645654,0.5735959,0.24832204,0.17522627,0.00023086002,0.0005151174],"about_ca_topic_score_codex":0.00014184834,"about_ca_topic_score_gemma":0.000009160693,"teacher_disagreement_score":0.7923007,"about_ca_system_score_codex":0.00022267639,"about_ca_system_score_gemma":0.000615804,"threshold_uncertainty_score":0.99977887},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04823957,0.000009028117,0.9461122,0.0030022797,0.00053264294,0.00073096534,0.0000059145714,0.000050588143,0.0013167745],"genre_scores_gemma":[0.8752626,0.00000419185,0.12403619,0.00034162262,0.00018135292,0.00004750509,0.0000010182661,0.000013368743,0.000112129295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984256,0.000019727397,0.00033783691,0.00051783526,0.00038157948,0.00031740274],"domain_scores_gemma":[0.9984597,0.00012012966,0.00031012282,0.00032003576,0.00072388793,0.00006611654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035490762,0.00021399888,0.00024435984,0.00008030657,0.00018964327,0.0003175579,0.0011383014,0.00009653439,0.00007111147],"category_scores_gemma":[0.00018037725,0.00014621517,0.00012054526,0.00045122355,0.0001283453,0.00037458824,0.0001099184,0.0001842027,0.000042658765],"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.00012687568,0.00011131958,0.00016512965,0.000032555443,0.000023584993,1.8591935e-7,0.0003343349,0.0056393524,0.19394441,0.77634394,0.00010862202,0.023169685],"study_design_scores_gemma":[0.000032512722,0.00027906412,0.000016169315,0.00010670998,0.000009899062,7.806798e-7,0.00005691799,0.42329374,0.5460674,0.029935848,0.00007066738,0.00013024006],"about_ca_topic_score_codex":0.000018515078,"about_ca_topic_score_gemma":0.00000968909,"teacher_disagreement_score":0.827023,"about_ca_system_score_codex":0.00003738265,"about_ca_system_score_gemma":0.00015175006,"threshold_uncertainty_score":0.59624815},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03941091,0.000084361396,0.90882593,0.0119161075,0.0011446109,0.00047153208,0.000004925069,0.00030434076,0.037837286],"genre_scores_gemma":[0.9476122,0.0000515104,0.05074677,0.0002648389,0.00007486903,0.00002321172,3.4855518e-7,0.000016518989,0.0012097036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99777925,0.000023803761,0.00045730863,0.0005935858,0.00069283694,0.0004531937],"domain_scores_gemma":[0.9979678,0.00010448811,0.00020790893,0.0004883183,0.0011153328,0.0001161632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034886855,0.0002010141,0.00024243353,0.000108912,0.00022135703,0.00032181974,0.002284887,0.00008052471,0.00008754115],"category_scores_gemma":[0.00043629753,0.00016006414,0.00011589815,0.0011196337,0.00020211872,0.00064210367,0.0013977872,0.00039294816,0.00011868485],"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.000024436898,0.00012183981,0.00003490793,0.000053280528,0.000016896085,0.0000060453463,0.0007185063,0.00014123516,0.105526514,0.6342413,0.000057670186,0.2590574],"study_design_scores_gemma":[0.000020416477,0.00006248121,0.0000497162,0.00014410654,0.000002970654,0.00001971321,0.00021840403,0.27829772,0.62283,0.09798437,0.0002148005,0.00015530715],"about_ca_topic_score_codex":0.000013063249,"about_ca_topic_score_gemma":0.0000063374023,"teacher_disagreement_score":0.90820134,"about_ca_system_score_codex":0.000071125396,"about_ca_system_score_gemma":0.00016696787,"threshold_uncertainty_score":0.65272266},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9666739,0.000048139955,0.0096385125,0.0015505471,0.0017593898,0.0014752155,0.000014654574,0.00004449437,0.018795116],"genre_scores_gemma":[0.9981618,0.00011870909,0.00066755066,0.00014772206,0.00010438167,0.00006996493,0.0000024871476,0.000037811802,0.00068957655],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9926531,0.0001355228,0.0024998768,0.0014950067,0.002634376,0.00058211753],"domain_scores_gemma":[0.9931783,0.0019114647,0.0023186097,0.0012940064,0.0011910219,0.000106595326],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.006432599,0.0005972717,0.000975492,0.00052357704,0.0003518675,0.0017145923,0.00672311,0.0004889012,0.00042953965],"category_scores_gemma":[0.007977975,0.00031541672,0.00045819633,0.0009147881,0.0007209711,0.00031111555,0.0033709155,0.0025917199,0.0003759669],"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.00067745615,0.0003692552,0.0038507695,0.00008876982,0.000034551085,0.00000147039,0.01800542,0.11312904,0.0011756105,0.34261313,0.00034783554,0.5197067],"study_design_scores_gemma":[0.000038147766,0.00015662974,0.0004345086,0.0008904648,0.000024224617,0.0000030491456,0.0035576832,0.17285325,0.0048193266,0.8166537,0.00019811797,0.00037089185],"about_ca_topic_score_codex":0.00012097959,"about_ca_topic_score_gemma":0.000033307315,"teacher_disagreement_score":0.5193358,"about_ca_system_score_codex":0.00026961116,"about_ca_system_score_gemma":0.00037408265,"threshold_uncertainty_score":0.9999298},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92282635,0.000016982234,0.011266039,0.0018162362,0.0033538945,0.0028143288,0.0000511078,0.00013906957,0.057715964],"genre_scores_gemma":[0.9941456,0.000001599423,0.0036662014,0.00024470073,0.0001894398,0.00014216304,7.528132e-7,0.000033451684,0.0015761302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99457324,0.00010087148,0.0016818715,0.0010036416,0.0020537153,0.0005866828],"domain_scores_gemma":[0.9931996,0.0021208343,0.001291524,0.0006891428,0.0025283296,0.00017056432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068964316,0.00036704002,0.0006842544,0.0003370649,0.00031401336,0.00044897222,0.0027118688,0.00017922606,0.00039540997],"category_scores_gemma":[0.007820297,0.00024416056,0.00036611877,0.0012420424,0.00036170208,0.00032035136,0.00025287393,0.0003294737,0.0005843486],"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.0007395467,0.00014181987,0.0011176476,0.00010065024,0.00003174576,2.398846e-7,0.0013348188,0.00019070569,0.04429769,0.8344231,0.0010301208,0.116591915],"study_design_scores_gemma":[0.000049060105,0.00049632945,0.00031014826,0.00031488432,0.000033480806,0.0000071348813,0.0047674524,0.05661912,0.44732243,0.48887658,0.0008643068,0.00033908983],"about_ca_topic_score_codex":0.00002038416,"about_ca_topic_score_gemma":0.000009078874,"teacher_disagreement_score":0.40302473,"about_ca_system_score_codex":0.00014358033,"about_ca_system_score_gemma":0.00022813337,"threshold_uncertainty_score":0.9956579},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7668454,0.00029404374,0.14826034,0.034404505,0.0021723944,0.0013915927,0.000026308642,0.0002227383,0.046382662],"genre_scores_gemma":[0.9970125,0.000027398593,0.0018534414,0.00037341626,0.00013095114,0.000027883183,4.3173216e-7,0.000019058425,0.00055490364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958597,0.00007258288,0.001150895,0.0006560107,0.001687967,0.00057288987],"domain_scores_gemma":[0.9959341,0.0012189045,0.0008780183,0.0005329557,0.0012972418,0.00013874713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006095417,0.0002788139,0.00038573632,0.00012689462,0.00094903837,0.00092864607,0.0026868698,0.000114462564,0.00023909313],"category_scores_gemma":[0.006539699,0.00015125595,0.0002542889,0.0010600332,0.00045094616,0.00030824213,0.00031754465,0.00056798576,0.0002592531],"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.00005975161,0.00018681619,0.0017286774,0.000014123385,0.000037432666,1.5299162e-7,0.002782484,0.000769748,0.050124332,0.5751255,0.0024404146,0.36673057],"study_design_scores_gemma":[0.000042676536,0.00015153529,0.0003487019,0.00035969896,0.000041521074,0.000005064247,0.002981109,0.18841012,0.1313747,0.6747609,0.0012368645,0.00028713836],"about_ca_topic_score_codex":0.00011489353,"about_ca_topic_score_gemma":0.000054213637,"teacher_disagreement_score":0.36644343,"about_ca_system_score_codex":0.000053047534,"about_ca_system_score_gemma":0.000105331164,"threshold_uncertainty_score":0.89549553},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007921827,0.0010692613,0.9221212,0.051166955,0.0013051624,0.001953214,0.000035448815,0.0014782603,0.012948629],"genre_scores_gemma":[0.8182124,0.000085036656,0.18104514,0.00037129497,0.00014249123,0.000055785844,0.0000022707045,0.000025108824,0.000060464252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99689406,0.000029148237,0.00078450725,0.001022127,0.00089435565,0.0003758177],"domain_scores_gemma":[0.9975122,0.00008098429,0.000800531,0.00058455934,0.0009002752,0.000121440215],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045439656,0.0004253428,0.00052838767,0.000192779,0.00017181048,0.000677874,0.005262684,0.00037369516,0.00004995192],"category_scores_gemma":[0.00035772263,0.00035421987,0.00027040255,0.00058496674,0.00027189346,0.00044260715,0.0017837388,0.001445229,0.00007400499],"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.000040164978,0.00010941181,0.000008824273,0.0002709623,0.000026277485,5.826889e-7,0.0021979257,0.00001905652,0.06514989,0.7185449,0.00012531586,0.21350671],"study_design_scores_gemma":[0.000009511561,0.00007367852,0.000010107701,0.00052020483,0.000020441174,0.0000013286957,0.0000484668,0.02593651,0.42376482,0.5493074,0.000048397636,0.0002590928],"about_ca_topic_score_codex":0.000052545493,"about_ca_topic_score_gemma":0.000006617777,"teacher_disagreement_score":0.8102906,"about_ca_system_score_codex":0.00008041415,"about_ca_system_score_gemma":0.00024732875,"threshold_uncertainty_score":0.999891},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9440321,0.00010103324,0.02795945,0.009899613,0.0041876747,0.0025813254,0.00013223228,0.0003225813,0.010784006],"genre_scores_gemma":[0.992158,0.00007915072,0.005562159,0.00053135084,0.00038525785,0.0000761145,0.000008045854,0.00006310697,0.0011368387],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99624175,0.00006383353,0.00078305136,0.0015212806,0.0007367071,0.00065339776],"domain_scores_gemma":[0.99689454,0.0010050741,0.00092027505,0.00045346678,0.00058844284,0.00013822189],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00051643816,0.00061106106,0.0007515997,0.00021874046,0.00031538933,0.0007359718,0.0030722057,0.00044645695,0.00012961432],"category_scores_gemma":[0.0028426603,0.00047123243,0.00044478528,0.00031465426,0.0004571507,0.00022177579,0.0016638687,0.002322158,0.00010711101],"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.00065043935,0.00024134365,0.00042406123,0.00042540132,0.00005512517,0.0000025205502,0.002851287,0.0023406819,0.7889078,0.08773525,0.0008371998,0.11552886],"study_design_scores_gemma":[0.00004375319,0.00015087867,0.00004669713,0.0008404012,0.00003555665,0.0000041636395,0.00025678962,0.20346022,0.670836,0.123560846,0.0003826759,0.00038208146],"about_ca_topic_score_codex":0.00005275596,"about_ca_topic_score_gemma":0.000011268951,"teacher_disagreement_score":0.20111953,"about_ca_system_score_codex":0.000093600494,"about_ca_system_score_gemma":0.0001872045,"threshold_uncertainty_score":0.9999795},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023625594,0.00017277898,0.730734,0.08297158,0.0059037637,0.002461612,0.000044071716,0.0011779879,0.15290864],"genre_scores_gemma":[0.98271006,0.000073152376,0.015618182,0.00089200586,0.00018785204,0.00004625597,0.0000021462777,0.00002943618,0.00044091104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965512,0.000047914942,0.0009299219,0.0010976287,0.0009145848,0.00045872093],"domain_scores_gemma":[0.9971644,0.0001226914,0.0010715107,0.0006161021,0.0008221992,0.00020305152],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00067642,0.00046943096,0.00057583913,0.00019816041,0.00024293446,0.00086477253,0.005185047,0.00027753884,0.00013977061],"category_scores_gemma":[0.00062805077,0.00037705048,0.0003354713,0.00073968834,0.00028111806,0.00032672513,0.0029551492,0.0014151651,0.00039381135],"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.000035247598,0.0000773487,0.000038470673,0.00011139254,0.000040640294,0.0000012987376,0.002612627,0.0004014581,0.008495034,0.93940264,0.00035935102,0.048424464],"study_design_scores_gemma":[0.00003407767,0.00015626379,0.00023986431,0.00056045596,0.000037931655,0.0000035791772,0.0004469541,0.25541788,0.13887785,0.6023599,0.0012865242,0.0005787059],"about_ca_topic_score_codex":0.000052450985,"about_ca_topic_score_gemma":0.0000037956381,"teacher_disagreement_score":0.95908445,"about_ca_system_score_codex":0.00007077114,"about_ca_system_score_gemma":0.00033125092,"threshold_uncertainty_score":0.99986815},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87801725,0.000095961266,0.002038459,0.06707262,0.0011291315,0.0012309136,0.00010897856,0.00019971447,0.050106958],"genre_scores_gemma":[0.99788463,0.0009911997,0.00016643904,0.00023403596,0.00024401383,0.000028605155,0.0000090713065,0.000029968502,0.0004120562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973612,0.00009455661,0.0005658151,0.0006402215,0.000890634,0.00044756127],"domain_scores_gemma":[0.9976533,0.00029317677,0.0008458777,0.0001177889,0.00088954053,0.00020033974],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011508112,0.00033015365,0.00042636006,0.000090219444,0.0010404286,0.001081832,0.0010019029,0.00042312438,0.00005762208],"category_scores_gemma":[0.004666082,0.00028843564,0.00014913038,0.00022683534,0.0009305204,0.00048128184,0.0008715489,0.001745724,0.000007553731],"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.00006477689,0.00011546823,0.0017045629,0.00049290713,0.00006387601,7.367554e-7,0.14360493,0.00004181791,0.011460842,0.76207304,0.00025697882,0.08012003],"study_design_scores_gemma":[0.00006767975,0.00044552973,0.0009989981,0.0033193647,0.00016466842,5.367085e-7,0.28117934,0.013063746,0.06372866,0.6353049,0.0006032059,0.0011233786],"about_ca_topic_score_codex":0.0031108053,"about_ca_topic_score_gemma":0.00045616544,"teacher_disagreement_score":0.13757439,"about_ca_system_score_codex":0.00015507624,"about_ca_system_score_gemma":0.0002549927,"threshold_uncertainty_score":0.9999568},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014749168,0.000023820508,0.99135786,0.004614535,0.00015947263,0.0014773158,0.0000122568135,0.0003143719,0.0005654544],"genre_scores_gemma":[0.544778,0.000008323692,0.45458,0.0003852181,0.00003636239,0.00015816723,0.0000013234086,0.000027736938,0.000024862025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970382,0.00010935122,0.0007075926,0.0011417719,0.0006391233,0.00036400315],"domain_scores_gemma":[0.9964182,0.0006337003,0.0009819008,0.00055280543,0.0012156143,0.00019782527],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013031573,0.00047261582,0.00059330644,0.000253195,0.000262311,0.0004891256,0.0028298427,0.0001870464,0.000020157944],"category_scores_gemma":[0.0050161947,0.0003662496,0.00009281573,0.0007787906,0.00025114088,0.00025427624,0.0018503706,0.0009888936,0.000003933205],"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.00023722049,0.00004139923,0.000030488438,0.000072882816,0.00004420416,3.8751406e-7,0.0031269323,0.27948678,0.0012149139,0.7087638,0.000016890795,0.006964142],"study_design_scores_gemma":[0.00005252474,0.00037625062,0.000029236822,0.00054810685,0.00004244668,0.000005202968,0.00038445444,0.6475975,0.011842293,0.33878148,0.0000024097276,0.00033809769],"about_ca_topic_score_codex":0.0000146584625,"about_ca_topic_score_gemma":0.000002385696,"teacher_disagreement_score":0.5433031,"about_ca_system_score_codex":0.000078051584,"about_ca_system_score_gemma":0.00020438849,"threshold_uncertainty_score":0.99987894},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2173591,0.00009385895,0.6622522,0.0058342605,0.002623829,0.0010584504,0.0000066941366,0.00044441663,0.11032721],"genre_scores_gemma":[0.9292302,0.000016909982,0.070229426,0.00016116399,0.000060301954,0.00003270776,2.1589415e-7,0.00001046721,0.00025858503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980928,0.000038136015,0.00049367076,0.00044540243,0.00060411874,0.00032591354],"domain_scores_gemma":[0.99800736,0.000064598615,0.00037677176,0.00050483126,0.0009177888,0.0001286381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001276514,0.00020571145,0.00022679806,0.00011449173,0.00014260162,0.0002685717,0.0028288893,0.00009428862,0.000016781254],"category_scores_gemma":[0.001188309,0.00014958484,0.00009294915,0.0007387875,0.00035426757,0.0007866631,0.0005025539,0.00027500535,0.0002022017],"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.000037540758,0.000057994926,0.000083541214,0.000011808573,0.0000060317825,1.2584306e-7,0.0017176806,0.000066583234,0.0074119265,0.94021976,0.0000987545,0.05028827],"study_design_scores_gemma":[0.000014892213,0.00012636233,0.00010196002,0.000046926252,0.0000043364666,0.0000033652761,0.00046396133,0.083300985,0.39523605,0.5204158,0.00015526004,0.0001301065],"about_ca_topic_score_codex":0.000023012775,"about_ca_topic_score_gemma":0.0000027021244,"teacher_disagreement_score":0.71187115,"about_ca_system_score_codex":0.00008009443,"about_ca_system_score_gemma":0.00015587361,"threshold_uncertainty_score":0.6099893},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78583604,0.000054731925,0.19083683,0.018410578,0.00039528383,0.0015649137,0.000025010298,0.00010408042,0.0027725394],"genre_scores_gemma":[0.98720616,0.000026059392,0.011980619,0.00054499035,0.000060697403,0.00007865176,0.0000023095915,0.0000084766625,0.00009200672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987839,0.000032695898,0.0003267389,0.00033770298,0.00028851797,0.00023043886],"domain_scores_gemma":[0.9985271,0.00019998942,0.00027880515,0.00014500362,0.00078238605,0.00006671496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040227995,0.00017406749,0.0002199844,0.00009161175,0.00039617307,0.00047185417,0.00079225824,0.00007245347,0.000070901224],"category_scores_gemma":[0.00018599512,0.000106827414,0.00013404133,0.0003697944,0.00044563235,0.0005623029,0.00018621437,0.00019143145,0.000035898458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034567266,0.00034655433,0.00012768558,0.00018093098,0.00016461246,3.4991328e-7,0.0051400424,0.0018936455,0.17291139,0.499686,0.0012865152,0.3179166],"study_design_scores_gemma":[0.00012886937,0.000058956386,0.00020232302,0.0001740935,0.000044446737,0.000010228653,0.0013834558,0.66891253,0.2069428,0.121919505,0.000013547163,0.00020925904],"about_ca_topic_score_codex":0.00009027967,"about_ca_topic_score_gemma":0.000012443276,"teacher_disagreement_score":0.6670189,"about_ca_system_score_codex":0.000022888424,"about_ca_system_score_gemma":0.000046713834,"threshold_uncertainty_score":0.4550101},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5445858,0.000025871535,0.4371518,0.0060637607,0.0005370657,0.0008112809,0.00007990389,0.00021866454,0.010525864],"genre_scores_gemma":[0.99623185,0.000034144028,0.0026778367,0.0002780721,0.00003640514,0.000018616232,0.0000018723372,0.000012139817,0.00070903427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978736,0.000014301869,0.00044610072,0.00058221474,0.00068818143,0.00039562173],"domain_scores_gemma":[0.99852085,0.000066205495,0.0001560351,0.000310856,0.0008363122,0.00010972419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030434784,0.0002681892,0.00036410618,0.00021676479,0.00016636318,0.00029218209,0.0016726884,0.00010015866,0.0004284595],"category_scores_gemma":[0.000081637125,0.00018067639,0.00017499938,0.0014137507,0.0001844651,0.0005993465,0.0001595394,0.00031599915,0.0003468901],"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.00023265976,0.00044661178,0.0034699142,0.00012253744,0.00014062812,0.0000019187614,0.0022361572,0.00057230575,0.040959746,0.56358457,0.00024736137,0.38798562],"study_design_scores_gemma":[0.00014001604,0.00045969107,0.0005405563,0.00046127304,0.000039894647,0.0000082807255,0.0010922096,0.16132191,0.81288797,0.022038965,0.000427491,0.0005817722],"about_ca_topic_score_codex":0.00002365005,"about_ca_topic_score_gemma":0.000030156634,"teacher_disagreement_score":0.7719282,"about_ca_system_score_codex":0.000043715947,"about_ca_system_score_gemma":0.0001207133,"threshold_uncertainty_score":0.73677695},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7590183,0.000018560535,0.0028955105,0.021283211,0.0066660466,0.0011406824,0.000021013817,0.00033910523,0.20861755],"genre_scores_gemma":[0.99626607,0.000012473722,0.00043686246,0.0017062982,0.0010052497,0.00002155041,9.716187e-8,0.000018168852,0.0005332524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979552,0.000029224786,0.00040426236,0.0006081609,0.00056275376,0.0004403686],"domain_scores_gemma":[0.9978256,0.001070117,0.0003171682,0.00021379755,0.0005042687,0.00006903011],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.00047503904,0.00022376214,0.0002464378,0.00007886091,0.0006280702,0.000118496704,0.0009128494,0.000081420425,0.0003154804],"category_scores_gemma":[0.009934508,0.00016944794,0.00012607178,0.0007519141,0.0010200099,0.00026940127,0.00039762506,0.00028867484,0.00038365234],"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.00031734872,0.000087156805,0.00022059966,0.0000147904775,0.000011447726,4.0174876e-7,0.000701826,0.00011282114,0.22235249,0.7607573,0.0040625837,0.011361185],"study_design_scores_gemma":[0.000028402277,0.00030666697,0.00010445307,0.00012213085,0.000012935471,0.000004833255,0.00033589665,0.013871533,0.8111447,0.1725553,0.0013229271,0.00019024115],"about_ca_topic_score_codex":0.000020134277,"about_ca_topic_score_gemma":0.000016163465,"teacher_disagreement_score":0.5887922,"about_ca_system_score_codex":0.000055566055,"about_ca_system_score_gemma":0.00006948925,"threshold_uncertainty_score":0.9984052},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41940162,0.000004246828,0.5598478,0.012025181,0.00016078963,0.00045070003,0.0000055291875,0.00019175436,0.007912401],"genre_scores_gemma":[0.9397037,0.0000053680865,0.059681393,0.00012390992,0.000044168894,0.0000516675,2.2681293e-7,0.000012731348,0.00037681323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983716,0.000019788291,0.00037575953,0.00048888184,0.00043419888,0.00030976994],"domain_scores_gemma":[0.9985126,0.000085418695,0.00031647604,0.00040079077,0.0005941935,0.000090521266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029578526,0.0001885012,0.00016542443,0.00010004875,0.0002923767,0.00025871216,0.001541168,0.00004763782,0.00007672366],"category_scores_gemma":[0.0002455769,0.00010537715,0.000069664595,0.0005313052,0.00027996392,0.00049385347,0.00033214886,0.00018287599,0.00024103536],"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.000009600783,0.00008342704,0.00082551775,0.000007732024,0.000011061228,2.0665328e-7,0.00027406486,0.00001889268,0.4297092,0.53327614,0.000053587206,0.035730597],"study_design_scores_gemma":[0.00006760168,0.00015672507,0.0021499684,0.0003224641,0.00001953539,0.000011883723,0.0001509321,0.12559877,0.8098933,0.061212502,0.00009694558,0.00031935828],"about_ca_topic_score_codex":0.00006174154,"about_ca_topic_score_gemma":0.0000068983745,"teacher_disagreement_score":0.5203021,"about_ca_system_score_codex":0.000047101697,"about_ca_system_score_gemma":0.00006829986,"threshold_uncertainty_score":0.42971554},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06049748,0.000019102883,0.9095155,0.0033638102,0.0006481271,0.0022204758,0.0000016571538,0.000059554943,0.023674292],"genre_scores_gemma":[0.9978248,0.00002319853,0.0011099054,0.00006512476,0.000016103855,0.00004986652,3.9907246e-7,0.000007289918,0.0009033142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807966,0.000030543728,0.0007682811,0.00032934351,0.00047086034,0.00032128964],"domain_scores_gemma":[0.9977136,0.0005579638,0.00065431214,0.00039155033,0.0006429854,0.000039544466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012102897,0.00014831629,0.0002478248,0.00009228829,0.00018148782,0.0001422239,0.001715291,0.000059047903,0.000039132643],"category_scores_gemma":[0.0011602845,0.000100669364,0.000107167056,0.0004649673,0.00020995806,0.00028815467,0.00025534444,0.00029133016,0.000025859043],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014201146,0.00004345335,0.0049972795,0.000058407073,0.000019965464,6.240522e-8,0.001250829,0.17861748,0.009504087,0.7957736,0.00007729853,0.009515489],"study_design_scores_gemma":[0.000083124825,0.00026416863,0.0008704393,0.00011744119,0.0000069685866,4.5689671e-7,0.0006582504,0.9182219,0.060416024,0.019062702,0.00019671941,0.00010182951],"about_ca_topic_score_codex":0.000046709636,"about_ca_topic_score_gemma":0.000008056903,"teacher_disagreement_score":0.9373273,"about_ca_system_score_codex":0.00003296167,"about_ca_system_score_gemma":0.00010116275,"threshold_uncertainty_score":0.41051775},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14780328,0.000019027782,0.8457384,0.0015723428,0.00081906747,0.00083102117,0.0000015390798,0.00011815181,0.003097164],"genre_scores_gemma":[0.99374574,0.000010033425,0.0052447203,0.00032737356,0.000086098764,0.000049240527,5.781226e-7,0.000016668691,0.00051956065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978374,0.00002073931,0.0005870392,0.0006516112,0.00040931583,0.00049385877],"domain_scores_gemma":[0.99827856,0.00021170254,0.00040548522,0.00035519514,0.0006543714,0.000094713985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006534018,0.00024933647,0.0003613667,0.0000890796,0.0001982083,0.000261608,0.0022607998,0.00012374936,0.00004077971],"category_scores_gemma":[0.00029080495,0.00019491347,0.00017745791,0.00040671512,0.00019173436,0.00048453978,0.00041708522,0.00044566617,0.00004800053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009372917,0.000047313108,0.00037504785,0.000050974762,0.000014269418,2.8815967e-7,0.0009600315,0.023888865,0.018683802,0.7849715,0.000038226197,0.170876],"study_design_scores_gemma":[0.000063190346,0.00023181624,0.000027273634,0.00013416036,0.0000070120705,0.000003856957,0.00045633712,0.91808134,0.05290932,0.02777752,0.00009506576,0.00021312574],"about_ca_topic_score_codex":0.00004217475,"about_ca_topic_score_gemma":0.000004664814,"teacher_disagreement_score":0.89419246,"about_ca_system_score_codex":0.000054972214,"about_ca_system_score_gemma":0.00007703328,"threshold_uncertainty_score":0.7948341},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03267565,0.000012624405,0.9510278,0.0046155257,0.00076948537,0.0013479983,6.678984e-7,0.00011805446,0.009432181],"genre_scores_gemma":[0.99332064,0.000019806439,0.003917509,0.00025307294,0.00007235236,0.000055326927,9.875596e-7,0.000015391839,0.0023448975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979764,0.00002322944,0.00054139073,0.0004356984,0.00061173714,0.00041153302],"domain_scores_gemma":[0.9982339,0.0002019663,0.0005587248,0.00041570695,0.0005355528,0.000054156808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007923636,0.00023100215,0.00024002662,0.00010022958,0.00034133167,0.00036336004,0.00238043,0.00008854191,0.000053228378],"category_scores_gemma":[0.00048940064,0.00014297225,0.00017424916,0.0004605703,0.00016005024,0.00032165032,0.00044651335,0.00049446826,0.00015220208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035547746,0.00001652103,0.0001252654,0.00004546625,0.000014285829,3.752374e-8,0.0011677832,0.3084116,0.012518495,0.6661253,0.000076014476,0.01146369],"study_design_scores_gemma":[0.00004721397,0.00051692943,0.00009017536,0.00018142993,0.000012907912,0.0000026545717,0.00058644015,0.8548919,0.11236616,0.029375156,0.0017203332,0.00020872305],"about_ca_topic_score_codex":0.000017383121,"about_ca_topic_score_gemma":0.0000020699338,"teacher_disagreement_score":0.960645,"about_ca_system_score_codex":0.00005225942,"about_ca_system_score_gemma":0.00008114483,"threshold_uncertainty_score":0.5830239},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064276695,0.000005809146,0.9277467,0.0012201745,0.0003583681,0.0014246105,0.000005737993,0.00012343917,0.004838426],"genre_scores_gemma":[0.9608443,0.0000059073272,0.037344243,0.00021505896,0.00007306519,0.000048627295,0.0000010729088,0.00002445065,0.0014433122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976074,0.000025236875,0.00047635526,0.00061718345,0.00071783015,0.00055598107],"domain_scores_gemma":[0.9975915,0.000210815,0.00037565656,0.0005044559,0.0011830928,0.00013446786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006857785,0.00027926525,0.0003939899,0.00012826623,0.00018278799,0.00044396814,0.0024860615,0.00011225832,0.0000463225],"category_scores_gemma":[0.00014752871,0.0001945699,0.00011284882,0.0004453006,0.00020823473,0.000698142,0.00021186301,0.00034347558,0.00010359009],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031232825,0.00021618044,0.00093894365,0.00008843421,0.00007446129,8.213211e-7,0.0022431181,0.010883067,0.06846494,0.5930616,0.00010975635,0.3236063],"study_design_scores_gemma":[0.0001593472,0.0015899207,0.00011454044,0.00012477815,0.0000156546,0.0000046527894,0.0005415235,0.74914074,0.24340855,0.0044930424,0.00015643585,0.0002508112],"about_ca_topic_score_codex":0.000022187118,"about_ca_topic_score_gemma":0.0000051948996,"teacher_disagreement_score":0.8965676,"about_ca_system_score_codex":0.00005500747,"about_ca_system_score_gemma":0.00016807442,"threshold_uncertainty_score":0.793433},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046526514,0.000032752134,0.94426477,0.0037660568,0.00086191203,0.00079524954,0.000008538918,0.0001395863,0.0036046046],"genre_scores_gemma":[0.9938371,0.000019019286,0.0053013302,0.00040790855,0.000098014374,0.00007150712,0.000002892842,0.000015839803,0.00024635537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978023,0.000022884255,0.00060288614,0.000668283,0.0004499489,0.0004536532],"domain_scores_gemma":[0.9980284,0.00015636037,0.00036619283,0.00040622053,0.0009257179,0.000117127725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005351412,0.0002652009,0.0002934298,0.00012923105,0.00022289717,0.00028474192,0.0020646637,0.00015921533,0.000053057858],"category_scores_gemma":[0.00014505243,0.00021082016,0.00020456054,0.00062556774,0.00020004415,0.0005047424,0.00021076699,0.00033506445,0.00004295702],"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.00006765809,0.00009060655,0.0004763681,0.000036938276,0.000014240068,6.5233955e-8,0.00024923423,0.0025638856,0.017553393,0.9477912,0.00019037334,0.030966029],"study_design_scores_gemma":[0.000046099158,0.00017466508,0.00023050758,0.000094170806,0.000009444419,0.000002749361,0.00014131155,0.8241533,0.019902037,0.15500219,0.00002998992,0.00021353105],"about_ca_topic_score_codex":0.000015971375,"about_ca_topic_score_gemma":0.0000035222693,"teacher_disagreement_score":0.9473106,"about_ca_system_score_codex":0.000046737594,"about_ca_system_score_gemma":0.000108089844,"threshold_uncertainty_score":0.8596996},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25652713,0.00004170351,0.72419477,0.0017595207,0.0011542249,0.002330416,0.000021981828,0.00030366066,0.0136665795],"genre_scores_gemma":[0.98971754,0.00003841852,0.009788186,0.000030539657,0.00029866432,0.00004246224,0.0000024570013,0.000029209408,0.000052526815],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879664,0.0000104496185,0.0003886457,0.00034738804,0.0001884372,0.00026846596],"domain_scores_gemma":[0.9987295,0.00007443906,0.00015664693,0.0001776116,0.0007989745,0.0000627979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028382154,0.00020343771,0.00019896706,0.000088455476,0.00017939613,0.00015427535,0.00031146253,0.000111420806,0.000009129717],"category_scores_gemma":[0.00028533643,0.00016935907,0.00007127393,0.00027974462,0.00061282347,0.00030820924,0.000039075392,0.0001794232,0.0000080552745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017962274,0.000050823048,0.0000085521615,0.000077082936,0.000031037966,6.713828e-8,0.0012705376,0.007355765,0.4994994,0.4724113,0.00036414733,0.018751632],"study_design_scores_gemma":[0.000030467452,0.00009926455,0.000059109207,0.000061958104,0.000023238632,0.0000015272634,0.00033716753,0.71031046,0.17552507,0.11340822,0.0000107870765,0.00013273062],"about_ca_topic_score_codex":0.0000063406933,"about_ca_topic_score_gemma":0.000009402443,"teacher_disagreement_score":0.7331904,"about_ca_system_score_codex":0.00007157326,"about_ca_system_score_gemma":0.00003262032,"threshold_uncertainty_score":0.69062626},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49266478,0.000020752752,0.49426618,0.007618262,0.0005577222,0.0011997179,0.000010393796,0.00014385398,0.0035183262],"genre_scores_gemma":[0.94739157,0.000006679099,0.05211529,0.00015780999,0.0001088852,0.000038521946,3.518354e-7,0.00001788279,0.00016302601],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977745,0.000022093744,0.00040870823,0.00071586616,0.0006123757,0.00046644954],"domain_scores_gemma":[0.9979771,0.00039039168,0.00023557252,0.00028729226,0.0010237145,0.000085951484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057255995,0.00023048467,0.00032039912,0.000111139874,0.00023293446,0.0002216351,0.0019453173,0.0001039522,0.000023086986],"category_scores_gemma":[0.0003606007,0.00016614138,0.00011132175,0.00040647358,0.00025837828,0.00042287138,0.00034383414,0.00046490456,0.000051045456],"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.00013341683,0.00008689519,0.000093759096,0.000046002522,0.000016681837,3.148934e-7,0.010965697,0.00020985026,0.031457216,0.94064873,0.000012691717,0.016328761],"study_design_scores_gemma":[0.00019749411,0.00031130115,0.00032588918,0.00032330205,0.000014497768,0.0000074064337,0.00567353,0.39732978,0.24897656,0.34634465,0.00004634459,0.00044924888],"about_ca_topic_score_codex":0.000042110332,"about_ca_topic_score_gemma":0.000026433157,"teacher_disagreement_score":0.5943041,"about_ca_system_score_codex":0.00009869122,"about_ca_system_score_gemma":0.00018600229,"threshold_uncertainty_score":0.6775049},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94480896,0.000010154151,0.010743246,0.0027123503,0.0002916981,0.0006985455,0.0000012453957,0.00031822515,0.040415574],"genre_scores_gemma":[0.99394995,0.000024922483,0.004562963,0.00010330288,0.000048853926,0.000020093561,0.000001072522,0.00001288101,0.0012759645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983978,0.000028852292,0.00033888404,0.00048654852,0.0004868073,0.00026105382],"domain_scores_gemma":[0.9986709,0.00010889221,0.0003373414,0.00024417057,0.0005717635,0.000066938184],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00029909896,0.00018590136,0.00021814516,0.00014583797,0.00019178142,0.0003406111,0.00090289954,0.00007034081,0.0002776748],"category_scores_gemma":[0.00013345807,0.00013479346,0.0000854717,0.0006139651,0.00008329297,0.00085559813,0.00016840397,0.00029934538,0.0010215566],"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.00016220906,0.00034883193,0.0025643979,0.00014913603,0.000077319826,0.0000015422137,0.005339805,0.0004529482,0.2695869,0.6061917,0.00022330054,0.114901915],"study_design_scores_gemma":[0.00007304839,0.0003800163,0.00027597407,0.00026103406,0.000019283354,0.000008438049,0.0007683164,0.23912631,0.72803205,0.030484082,0.00029551244,0.00027595018],"about_ca_topic_score_codex":0.000018246075,"about_ca_topic_score_gemma":0.0000027711483,"teacher_disagreement_score":0.5757076,"about_ca_system_score_codex":0.000039516348,"about_ca_system_score_gemma":0.000072536925,"threshold_uncertainty_score":0.9997563},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41134802,0.00012566154,0.5048404,0.01615683,0.006042202,0.0024545742,0.0000117451345,0.0011338714,0.057886694],"genre_scores_gemma":[0.9931258,0.000041124575,0.005236852,0.0009000125,0.00019313398,0.000025342984,6.7303307e-7,0.000026761058,0.00045027776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970735,0.00003327473,0.0006453972,0.0008865638,0.00066787854,0.0006934074],"domain_scores_gemma":[0.99773264,0.00016968325,0.00051189,0.00069184747,0.0007585818,0.00013532896],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045295293,0.00038500477,0.0003620001,0.00018874588,0.000443421,0.0003136184,0.0032411828,0.00016702016,0.000071642535],"category_scores_gemma":[0.00026871898,0.00029362913,0.00017651274,0.0013616725,0.00089090347,0.00060270826,0.00056551583,0.0006223216,0.0002938427],"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.00018743798,0.0001490439,0.00006108017,0.000012357246,0.00002127385,0.0000015162984,0.0005158018,0.00090290525,0.0071715848,0.9271912,0.0007101653,0.06307565],"study_design_scores_gemma":[0.000041902465,0.0008457993,0.00019713315,0.00032031216,0.000012122326,0.0000075504545,0.00014622844,0.57313174,0.07987756,0.3447128,0.00031022937,0.00039660468],"about_ca_topic_score_codex":0.000015145694,"about_ca_topic_score_gemma":0.00003436308,"teacher_disagreement_score":0.5824784,"about_ca_system_score_codex":0.00008331666,"about_ca_system_score_gemma":0.00007254721,"threshold_uncertainty_score":0.9999516},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9490434,0.00000950978,0.00068507186,0.0001749496,0.00006398191,0.0004972554,0.0000029777773,0.000025738262,0.049497113],"genre_scores_gemma":[0.998702,0.000012799678,0.0009157883,0.000036360907,0.000011123113,0.000013535469,4.789944e-7,0.000014391534,0.00029355436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983928,0.000019650359,0.00062284427,0.0002848241,0.00042351612,0.00025635224],"domain_scores_gemma":[0.99826247,0.0006684001,0.00040188615,0.000089681285,0.0005313417,0.00004623103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051417656,0.00018516916,0.00040411038,0.0001096369,0.00005251782,0.00003065099,0.00041245454,0.00008224961,0.0005759454],"category_scores_gemma":[0.0022083202,0.00013777398,0.00011128356,0.0004183174,0.00018453828,0.00013530937,0.0002101311,0.00033400313,0.00017990635],"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.0002556212,0.00065326504,0.014283441,0.0003732557,0.00003260698,6.027125e-7,0.0027669417,0.000004129438,0.03178224,0.90005606,0.000007952001,0.04978387],"study_design_scores_gemma":[0.00006319472,0.0001700535,0.003169219,0.0010025938,0.000016904201,0.000001587433,0.0037271595,0.0011571347,0.45031008,0.54021937,0.0000017441812,0.00016098842],"about_ca_topic_score_codex":0.000020855645,"about_ca_topic_score_gemma":0.000020500087,"teacher_disagreement_score":0.41852784,"about_ca_system_score_codex":0.00003654203,"about_ca_system_score_gemma":0.000035428555,"threshold_uncertainty_score":0.6306198},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9626175,0.0001331722,0.0102304965,0.0014490846,0.0011107156,0.0013284144,0.0000515515,0.000029171886,0.02304986],"genre_scores_gemma":[0.998968,0.000021562859,0.00013895199,0.0000545465,0.00006017282,0.000047192276,0.0000010071911,0.00001350853,0.0006950515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987469,0.0000070010447,0.00069090776,0.00027922052,0.00007825245,0.00019774766],"domain_scores_gemma":[0.9985231,0.00020338467,0.00082930183,0.00023402374,0.0001850359,0.000025128991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014722651,0.0001282537,0.0003053155,0.00009114571,0.000102783226,0.00006620518,0.00085678714,0.000079195706,0.00013776688],"category_scores_gemma":[0.00035425337,0.00009230182,0.00014038003,0.00030501344,0.00015420326,0.00015561159,0.000082193576,0.000133071,0.00014140746],"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.00006543544,0.00006757846,0.005036468,0.00011848609,0.000024930432,4.8722373e-9,0.0008611195,0.000055589793,0.005804931,0.9844006,0.000033191765,0.003531715],"study_design_scores_gemma":[0.0000756695,0.00032595103,0.0026019167,0.0002402319,0.000015654501,8.886179e-7,0.0019831748,0.017081559,0.18467736,0.7919696,0.00081116933,0.00021684107],"about_ca_topic_score_codex":0.000083691964,"about_ca_topic_score_gemma":0.000006723172,"teacher_disagreement_score":0.19243096,"about_ca_system_score_codex":0.000023902445,"about_ca_system_score_gemma":0.000017231881,"threshold_uncertainty_score":0.3763959},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.337202,0.000010886082,0.5782211,0.005296431,0.0009853629,0.00085883396,0.0000014378462,0.00036154792,0.07706239],"genre_scores_gemma":[0.9913886,0.000010982248,0.0036365362,0.00009060701,0.000032972563,0.000016238164,5.559536e-7,0.0000133669955,0.004810124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984579,0.000017764738,0.00037740683,0.00041441704,0.00041972625,0.00031276868],"domain_scores_gemma":[0.99857885,0.00009389195,0.00035653228,0.0003414048,0.0005571645,0.00007218471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031376389,0.00019457588,0.00019828371,0.00014490272,0.00022433167,0.00032489793,0.0016187768,0.00006620943,0.00017606634],"category_scores_gemma":[0.00019707208,0.0001354933,0.00008458374,0.0007240108,0.00017972334,0.0005339525,0.00038261237,0.000531202,0.00070914475],"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.000032567634,0.00005120982,0.0017173226,0.00002653954,0.000021732865,2.250435e-7,0.00071966165,0.05698576,0.010909812,0.92159534,0.00006322992,0.00787659],"study_design_scores_gemma":[0.00008864138,0.0019217582,0.001057388,0.0006805283,0.000031433203,0.000019427198,0.0027163362,0.8456983,0.129827,0.01577777,0.0016058594,0.0005755506],"about_ca_topic_score_codex":0.000013112953,"about_ca_topic_score_gemma":0.0000043285286,"teacher_disagreement_score":0.90581757,"about_ca_system_score_codex":0.000047524612,"about_ca_system_score_gemma":0.00008564916,"threshold_uncertainty_score":0.9114858},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9664036,0.00005767077,0.0054774336,0.0037216432,0.0005209751,0.0010491571,0.000004559172,0.0000872149,0.022677723],"genre_scores_gemma":[0.99803656,0.00003140704,0.0012262395,0.00028195977,0.000057992536,0.000043738914,1.8417946e-7,0.00001966172,0.00030223018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9967088,0.00007050739,0.0010697702,0.0006337622,0.000934547,0.0005825835],"domain_scores_gemma":[0.99739337,0.00043578082,0.0007067047,0.00073618785,0.00066242256,0.000065538115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016420825,0.0003081082,0.0004544157,0.00023564816,0.00011837927,0.00022925959,0.004555824,0.00014973218,0.00010737265],"category_scores_gemma":[0.00065931486,0.00019887388,0.00020121537,0.0014535412,0.00043122383,0.00065565057,0.0005267638,0.00051463174,0.00018053524],"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.000059711776,0.00025396413,0.016097583,0.000080647114,0.000017219101,8.6029013e-7,0.010610839,0.0004378068,0.036219615,0.9102638,0.00006283637,0.025895132],"study_design_scores_gemma":[0.00003597534,0.0004333485,0.0015977757,0.00062325684,0.000013978736,0.000008272648,0.0066370205,0.12911727,0.5814155,0.2796667,0.00012767866,0.00032325037],"about_ca_topic_score_codex":0.00043309736,"about_ca_topic_score_gemma":0.0000990289,"teacher_disagreement_score":0.6305971,"about_ca_system_score_codex":0.00006430052,"about_ca_system_score_gemma":0.00017136175,"threshold_uncertainty_score":0.8465931},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8414786,0.000058234105,0.14726685,0.0073310803,0.0005762739,0.0017155545,0.000015774453,0.00007097235,0.0014866587],"genre_scores_gemma":[0.99430096,0.000016559034,0.0053090947,0.0001870286,0.000040014453,0.000050725335,2.2613578e-7,0.000011938384,0.00008347114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978183,0.000029115545,0.000751736,0.0005675113,0.0005184671,0.00031489195],"domain_scores_gemma":[0.9965507,0.0012147179,0.0005181205,0.00048535614,0.0011659754,0.000065128435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012604435,0.00022487469,0.00034090344,0.0000793414,0.00014859406,0.00016675524,0.001950337,0.00009972156,0.000074714924],"category_scores_gemma":[0.0009170098,0.00014107265,0.00017122045,0.00046865823,0.0008375499,0.00039722314,0.00044696746,0.0002579865,0.000029349965],"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.00010301133,0.0001805403,0.0039244145,0.00009686119,0.00002665786,3.3408977e-8,0.0025354654,0.00091980083,0.012686998,0.89233065,0.00004085763,0.0871547],"study_design_scores_gemma":[0.00002270668,0.00023978032,0.0025013094,0.00008082612,0.000013391086,0.0000016248448,0.0007488876,0.33875838,0.20074473,0.4566299,0.00010707738,0.00015138007],"about_ca_topic_score_codex":0.000085975844,"about_ca_topic_score_gemma":0.000015850108,"teacher_disagreement_score":0.43570074,"about_ca_system_score_codex":0.000041128973,"about_ca_system_score_gemma":0.00014041325,"threshold_uncertainty_score":0.5752776},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0837506,0.000006485173,0.9087619,0.0036279242,0.00039736787,0.0008601114,0.00003057668,0.0000687273,0.0024963187],"genre_scores_gemma":[0.9642988,0.0000033714355,0.03521958,0.0000822773,0.00005461204,0.00004487507,0.0000073116335,0.0000087311655,0.0002804337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983319,0.000016508387,0.00043697548,0.0004070351,0.00055709813,0.00025045825],"domain_scores_gemma":[0.9978919,0.00023938734,0.0006310204,0.0002160461,0.0009676555,0.000053963187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004424577,0.00018737385,0.00024792668,0.00012744997,0.00012655433,0.00014015684,0.0011503265,0.00006537069,0.00011200912],"category_scores_gemma":[0.00023505816,0.00013406525,0.00009662032,0.00037473367,0.00014930162,0.00052651536,0.00014324648,0.0002109609,0.00004405112],"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.00010529452,0.00010701652,0.00087011396,0.00009908839,0.000024298022,6.341569e-8,0.0005397278,0.0023730004,0.010786529,0.97853065,0.000049836286,0.0065143974],"study_design_scores_gemma":[0.00011284879,0.0004629932,0.0008914975,0.00019929252,0.0000142356885,0.0000022410381,0.00018582476,0.6696907,0.114035904,0.21407488,0.00012784358,0.00020172728],"about_ca_topic_score_codex":0.000021371205,"about_ca_topic_score_gemma":0.000001693586,"teacher_disagreement_score":0.8805482,"about_ca_system_score_codex":0.00003249876,"about_ca_system_score_gemma":0.00018475633,"threshold_uncertainty_score":0.54670227},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9655834,0.0000882989,0.019659344,0.0038388623,0.00072969566,0.00038376846,0.0000030170352,0.00009093161,0.009622691],"genre_scores_gemma":[0.99535507,0.00004946083,0.0039202357,0.00032434386,0.000031407028,0.000017111606,2.736335e-7,0.000007846644,0.00029424872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99815124,0.00001834419,0.00053547247,0.00047861162,0.0004998692,0.00031643943],"domain_scores_gemma":[0.9985897,0.00015577712,0.00027247085,0.0002691973,0.00066358526,0.00004928556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066226226,0.00019674201,0.00029397808,0.00012307557,0.000086036955,0.00016246234,0.0016373199,0.00007768488,0.00004275322],"category_scores_gemma":[0.00042504465,0.00014797715,0.00007399867,0.00062673294,0.00015120137,0.00056413084,0.0003649916,0.00033004655,0.00015220742],"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.000025949112,0.00006241682,0.0023249998,0.000032144973,0.000011075523,2.833307e-7,0.0017667984,0.00037006047,0.010421614,0.973746,0.00006732143,0.011171355],"study_design_scores_gemma":[0.00006269184,0.00026278393,0.002467906,0.0010511114,0.000007386219,0.0000058248015,0.0017223557,0.36725083,0.19002952,0.436663,0.00007097796,0.00040559677],"about_ca_topic_score_codex":0.000027207276,"about_ca_topic_score_gemma":0.000011283653,"teacher_disagreement_score":0.53708297,"about_ca_system_score_codex":0.000071972616,"about_ca_system_score_gemma":0.00012950768,"threshold_uncertainty_score":0.60343325},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9837905,0.000033180288,0.0041649286,0.0027718374,0.00032692548,0.00036287803,0.000001916832,0.000058448102,0.00848939],"genre_scores_gemma":[0.99872607,0.000016657666,0.00034394336,0.0006538064,0.00013567362,0.000012450596,0.0000043485375,0.000015008543,0.00009204594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852234,0.000004581199,0.00050119986,0.00034876092,0.0003766679,0.00024643657],"domain_scores_gemma":[0.9987271,0.00005168855,0.00048918795,0.0001206924,0.00060078513,0.000010579524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000407297,0.00018142538,0.00024299668,0.00036917257,0.00014275256,0.00029269906,0.000529576,0.00011128887,0.00024600138],"category_scores_gemma":[0.00020756554,0.00014609336,0.00008664021,0.0012637526,0.00008600254,0.00081838336,0.00014582029,0.00039895138,0.00025782853],"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.00009780275,0.0003102251,0.038335733,0.0002570056,0.00003871321,3.71393e-7,0.0012498245,0.0074069733,0.017027093,0.8626674,0.00007519645,0.072533704],"study_design_scores_gemma":[0.0001176147,0.000028702376,0.0035233092,0.0009497976,0.00006848667,6.0613604e-7,0.00807936,0.72631973,0.03858661,0.22169943,0.0001707332,0.00045562693],"about_ca_topic_score_codex":0.0003400997,"about_ca_topic_score_gemma":0.000040369065,"teacher_disagreement_score":0.7189127,"about_ca_system_score_codex":0.0000391656,"about_ca_system_score_gemma":0.00002634082,"threshold_uncertainty_score":0.5957514},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3886133,0.00002947134,0.59319794,0.013086135,0.00033248536,0.0014446127,0.000010579667,0.00011144394,0.0031740502],"genre_scores_gemma":[0.98970044,0.00003504703,0.009451468,0.00026254708,0.000022894792,0.000040989245,0.0000013287288,0.0000075978114,0.0004777115],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99860847,0.000013353853,0.00035100125,0.0004928832,0.0002931537,0.00024114457],"domain_scores_gemma":[0.99859923,0.00005724451,0.0002661771,0.00022986822,0.0007633934,0.000084059786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037104185,0.00014584504,0.00021593628,0.00012988641,0.00015488193,0.0003994576,0.0008720908,0.00006840958,0.000039479943],"category_scores_gemma":[0.0002551446,0.00011747556,0.00008526719,0.00065467646,0.000068976806,0.00054645265,0.00021451776,0.00011738352,0.0001013814],"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.000060572882,0.00013607963,0.0001670322,0.000100592624,0.000023461602,4.32017e-8,0.0009349097,0.000060997943,0.46447963,0.40047958,0.00007908592,0.133478],"study_design_scores_gemma":[0.000041441337,0.00013766483,0.00030596135,0.00017703367,0.000015243036,8.258307e-7,0.00038137496,0.30832905,0.66546047,0.024880847,0.000104540464,0.00016554486],"about_ca_topic_score_codex":0.000014897631,"about_ca_topic_score_gemma":0.000006076162,"teacher_disagreement_score":0.6010871,"about_ca_system_score_codex":0.00003087976,"about_ca_system_score_gemma":0.000080356185,"threshold_uncertainty_score":0.4790514},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8682224,0.00001232676,0.10522026,0.0008297437,0.0010010148,0.0006072019,0.000033462617,0.00003526843,0.024038326],"genre_scores_gemma":[0.9945452,0.000007128079,0.0025991742,0.00006763849,0.000044773282,0.000014396308,4.6172616e-7,0.000012765935,0.0027084455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9968422,0.00007619676,0.0009725431,0.0004999957,0.0013089268,0.0003001474],"domain_scores_gemma":[0.99649346,0.00065342756,0.00078930444,0.0003275187,0.0016644811,0.00007178204],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0032805698,0.000186319,0.0004280615,0.00025846768,0.00016321307,0.00010667762,0.0013738669,0.0001263367,0.002090523],"category_scores_gemma":[0.004384399,0.0001297513,0.00024462075,0.0014924544,0.00031262691,0.0002926368,0.000091004185,0.00026557696,0.0001660508],"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.00075585407,0.00044226446,0.007495038,0.00007368337,0.0000202474,1.5334984e-7,0.009857056,0.0002926985,0.14950262,0.64218396,0.00033388534,0.18904254],"study_design_scores_gemma":[0.00010441166,0.0002890272,0.0038256517,0.0001825965,0.00003157873,0.000003831425,0.0044721663,0.043188877,0.5945635,0.3524591,0.00061868277,0.00026059325],"about_ca_topic_score_codex":0.000024599965,"about_ca_topic_score_gemma":0.000020641002,"teacher_disagreement_score":0.44506085,"about_ca_system_score_codex":0.000035316654,"about_ca_system_score_gemma":0.00017934489,"threshold_uncertainty_score":0.9988217},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9818029,0.000018399982,0.011687379,0.0019582366,0.00060126145,0.00051664055,0.0000027888598,0.00017667319,0.0032357238],"genre_scores_gemma":[0.99553704,0.00014091238,0.0029382033,0.00013960866,0.00008580242,0.000029412015,0.0000014353725,0.00001913093,0.0011084524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9975901,0.00004092258,0.00062114355,0.0007024945,0.00053836504,0.000506965],"domain_scores_gemma":[0.99840206,0.00010552032,0.0004883971,0.00034251207,0.00054110686,0.00012043434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007831174,0.0002786658,0.0003025479,0.0001383841,0.0005048313,0.000566551,0.0011654432,0.00015442696,0.00025510314],"category_scores_gemma":[0.00022832645,0.00023152637,0.00013066002,0.0005921879,0.0002646615,0.0013261356,0.0003948942,0.0005691891,0.0007409099],"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.00009915438,0.00016099594,0.0039530885,0.000070599825,0.000022162876,6.7433666e-7,0.0056265667,0.00079590356,0.38342085,0.4265767,0.00009409468,0.1791792],"study_design_scores_gemma":[0.00007210971,0.0006687409,0.0043333652,0.00023188266,0.000018560173,0.00002869029,0.01406656,0.23235717,0.6539393,0.092583105,0.0010668713,0.0006336279],"about_ca_topic_score_codex":0.000327845,"about_ca_topic_score_gemma":0.00006795768,"teacher_disagreement_score":0.3339936,"about_ca_system_score_codex":0.00009714271,"about_ca_system_score_gemma":0.0000792706,"threshold_uncertainty_score":0.9523145},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9848087,0.0011330729,0.009831235,0.0009932874,0.00018374303,0.00092533143,0.000007829628,0.0001886039,0.0019281877],"genre_scores_gemma":[0.9876462,0.00066691876,0.011476765,0.000016756463,0.000017362085,0.00009498447,0.000001551662,0.000015094482,0.000064370746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917924,0.000010832974,0.0003217917,0.00019025253,0.00013263203,0.0001652622],"domain_scores_gemma":[0.9993259,0.00011626956,0.00009610056,0.000263638,0.00015763607,0.00004046578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031832093,0.00013679694,0.00016879405,0.00006423106,0.000100092,0.000083030856,0.00041869012,0.00006849248,0.000014190779],"category_scores_gemma":[0.00016494146,0.00011204159,0.000025310559,0.00019343998,0.00014314926,0.00010736164,0.00012564969,0.00018046667,0.000014474223],"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.000020451784,0.00004920925,0.00558703,0.00042809028,0.00004346254,3.940058e-8,0.0013057956,0.01004318,0.17254175,0.7890778,0.00012355742,0.020779628],"study_design_scores_gemma":[0.00009165281,0.000095704236,0.004958812,0.0011558239,0.00004447533,0.000013264366,0.0035246518,0.60143685,0.34945843,0.036453594,0.0022642973,0.0005024636],"about_ca_topic_score_codex":0.00001319972,"about_ca_topic_score_gemma":0.0000018469949,"teacher_disagreement_score":0.7526242,"about_ca_system_score_codex":0.000025952668,"about_ca_system_score_gemma":0.00001544153,"threshold_uncertainty_score":0.45689237},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09707777,0.000010837694,0.8979569,0.0013847962,0.0005479711,0.00071763166,0.0000022439706,0.000098918434,0.002202922],"genre_scores_gemma":[0.91236776,0.000009692471,0.086990625,0.00011811488,0.000057840087,0.000036493075,5.2009506e-7,0.00001279338,0.0004061461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998368,0.00001320926,0.00042725643,0.0005368814,0.00034326522,0.00031137472],"domain_scores_gemma":[0.998358,0.00024832255,0.00042729496,0.00027299282,0.00063491514,0.000058477992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044763397,0.00018258339,0.00022120686,0.00010001189,0.00016971011,0.00024215035,0.0014306655,0.00013079031,0.00003729186],"category_scores_gemma":[0.0009030392,0.00014753632,0.00011393904,0.0003732543,0.00007558598,0.0004800978,0.0002581698,0.0004054276,0.000117654025],"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.000035100085,0.000075684446,0.0006786372,0.000043371623,0.0000115284065,6.223606e-8,0.001760293,0.0014756948,0.042416804,0.8988907,0.00000781784,0.054604355],"study_design_scores_gemma":[0.000034519315,0.00014385286,0.00028387405,0.00023647913,0.0000071009053,9.833836e-7,0.0006524849,0.628559,0.17197911,0.19779783,0.00011656013,0.00018819755],"about_ca_topic_score_codex":0.00002401584,"about_ca_topic_score_gemma":0.000003122487,"teacher_disagreement_score":0.81529003,"about_ca_system_score_codex":0.00004878836,"about_ca_system_score_gemma":0.000082094295,"threshold_uncertainty_score":0.6016357},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078770146,0.00005993628,0.8727182,0.021771451,0.0009473327,0.0016711743,0.000019083118,0.0011086799,0.02293396],"genre_scores_gemma":[0.98404574,0.00005395805,0.015218273,0.00026495778,0.00012475431,0.00013107684,5.1630536e-7,0.000020120306,0.00014058227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99766135,0.000017146642,0.000704679,0.00085104705,0.00046021238,0.0003055534],"domain_scores_gemma":[0.9978381,0.0000669325,0.0008222619,0.00057237124,0.0005989506,0.000101381454],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032370945,0.00034084579,0.00039341324,0.00014385377,0.00028487714,0.00049774814,0.0037077924,0.00022554556,0.00003175565],"category_scores_gemma":[0.00027112584,0.00027735057,0.00026067955,0.00066255324,0.00022581256,0.00019570182,0.0025302733,0.0009058228,0.00008278502],"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.0000125899915,0.00006454757,0.00005352874,0.00014165118,0.000021850552,4.0007757e-7,0.000772881,0.000052147487,0.030706573,0.8997338,0.00015141377,0.06828864],"study_design_scores_gemma":[0.000005740292,0.000081602986,0.000061138606,0.00024145286,0.000014714978,0.0000033650344,0.0001611836,0.0776983,0.52042,0.40095502,0.00012685616,0.00023057789],"about_ca_topic_score_codex":0.00006364026,"about_ca_topic_score_gemma":0.0000067085484,"teacher_disagreement_score":0.90527564,"about_ca_system_score_codex":0.000057727273,"about_ca_system_score_gemma":0.00014721492,"threshold_uncertainty_score":0.9999679},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012528596,0.00004284571,0.985694,0.003555175,0.001568726,0.0018294469,0.0000048999123,0.00032335534,0.0057286774],"genre_scores_gemma":[0.81601405,0.00010357286,0.18140551,0.00020816048,0.00020149088,0.00026031476,0.000010822883,0.000056134177,0.001739939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99509823,0.00010157329,0.0015632721,0.0014257146,0.0009765446,0.00083464367],"domain_scores_gemma":[0.9949678,0.00047034703,0.002048054,0.00083178043,0.0014419977,0.00023999937],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0016072018,0.0007546841,0.0009873573,0.00024469825,0.00047110103,0.0010354853,0.0061047943,0.0004161808,0.000057048095],"category_scores_gemma":[0.0025149002,0.0006222615,0.00048353252,0.00068382896,0.0003196237,0.00035644288,0.004362912,0.0019671516,0.000049655457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014377727,0.00007317523,0.00014988845,0.0007220321,0.00010695253,4.861316e-7,0.0020765923,0.1817575,0.019545717,0.7056936,0.00025892098,0.08947136],"study_design_scores_gemma":[0.000043723987,0.000754941,0.000022151646,0.00061996485,0.00004665912,0.0000011078426,0.00023710214,0.719583,0.17616093,0.10118958,0.00082466815,0.0005161667],"about_ca_topic_score_codex":0.00007736299,"about_ca_topic_score_gemma":0.000002304761,"teacher_disagreement_score":0.8147612,"about_ca_system_score_codex":0.00021024363,"about_ca_system_score_gemma":0.0005084838,"threshold_uncertainty_score":0.9996229},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026604127,0.00006107363,0.96632326,0.0010355134,0.0007650839,0.00069865404,0.0000061655232,0.00016263651,0.0043434855],"genre_scores_gemma":[0.9547352,0.00012701021,0.044524524,0.00012867409,0.00007668362,0.000066492925,0.000010110199,0.00003510881,0.00029615138],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950778,0.000056840698,0.0014677821,0.0013456775,0.001311992,0.0007399079],"domain_scores_gemma":[0.9958242,0.00034567807,0.0014696491,0.0012602955,0.00097078516,0.00012938531],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010049127,0.0006026833,0.0007198311,0.00034647665,0.00025905189,0.0012349851,0.006937353,0.00035493658,0.00008003823],"category_scores_gemma":[0.0036945636,0.00053576415,0.0002971207,0.00076006044,0.0002785183,0.0005825539,0.0079594115,0.0022027288,0.000021215697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002481621,0.000072572795,0.0002966763,0.00013457432,0.000022126731,0.0000015397076,0.0027717804,0.90246224,0.008960551,0.07695018,0.000023631243,0.008279298],"study_design_scores_gemma":[0.00004771079,0.00010262488,0.000052804036,0.0009298519,0.000020297903,6.7806747e-7,0.0005437651,0.84065604,0.11447941,0.04271866,0.000004452451,0.000443702],"about_ca_topic_score_codex":0.0013683721,"about_ca_topic_score_gemma":0.000037265276,"teacher_disagreement_score":0.9281311,"about_ca_system_score_codex":0.00027688526,"about_ca_system_score_gemma":0.0006024126,"threshold_uncertainty_score":0.9998018},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9328175,0.00017807317,0.052717716,0.0067097303,0.0020007282,0.0015671672,0.00004219326,0.00020210253,0.0037647875],"genre_scores_gemma":[0.995317,0.0000624622,0.0042322963,0.00019125477,0.00010809973,0.000045669974,0.0000013094616,0.0000175044,0.000024426969],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9971159,0.00004836281,0.0010791415,0.0008380885,0.00056351186,0.00035500093],"domain_scores_gemma":[0.9976076,0.00012898064,0.0010394052,0.00050076767,0.0006276517,0.00009560957],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046525893,0.00039186777,0.0006313434,0.00030149173,0.00009437232,0.00022757995,0.0033105353,0.00032540632,0.000058591948],"category_scores_gemma":[0.00034345814,0.0003305431,0.00026606658,0.0008720931,0.00033291357,0.00023070969,0.001661868,0.0009543079,0.000020793908],"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.00078618235,0.0009811312,0.00087734294,0.001947254,0.00008313914,0.000004605568,0.007585846,0.003185771,0.2646718,0.37213704,0.00035173356,0.34738815],"study_design_scores_gemma":[0.000034861354,0.00024442558,0.00013529505,0.0010447602,0.000011915484,0.0000010727883,0.00015508205,0.23178029,0.68097585,0.085308224,0.000053886914,0.00025432158],"about_ca_topic_score_codex":0.00017943123,"about_ca_topic_score_gemma":0.00011209717,"teacher_disagreement_score":0.41630405,"about_ca_system_score_codex":0.000087372246,"about_ca_system_score_gemma":0.0003310683,"threshold_uncertainty_score":0.99991465},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009524936,0.000035974113,0.9629599,0.008237336,0.001479892,0.0008963352,0.0000069333846,0.00032264236,0.016536066],"genre_scores_gemma":[0.94680613,0.000062307394,0.051615562,0.000680158,0.00017083088,0.000046333258,0.0000049986816,0.000037814254,0.00057584106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963106,0.000041907042,0.0010432305,0.0010081279,0.0011132886,0.0004828514],"domain_scores_gemma":[0.99716735,0.00010976982,0.0012309863,0.0007080095,0.00062598457,0.00015789288],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005726881,0.0005061956,0.00053917535,0.00018579369,0.00022803893,0.0008937802,0.0045723678,0.00031388665,0.000079620455],"category_scores_gemma":[0.0007823629,0.0004283333,0.0002832534,0.0005868204,0.00025636103,0.00045702103,0.0031674397,0.0012103901,0.00020692818],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002339379,0.0000447695,0.000053029973,0.00018233008,0.000040427618,8.8064724e-7,0.0013427328,0.30253616,0.007771146,0.66599303,0.0005688923,0.0214432],"study_design_scores_gemma":[0.000018263225,0.00009716012,0.00006341063,0.00053689035,0.000026330508,0.0000017911638,0.000047739817,0.75027096,0.106623076,0.14182374,0.0001589209,0.000331731],"about_ca_topic_score_codex":0.00007476129,"about_ca_topic_score_gemma":0.0000013720143,"teacher_disagreement_score":0.9372812,"about_ca_system_score_codex":0.00015207169,"about_ca_system_score_gemma":0.00028356438,"threshold_uncertainty_score":0.99981683},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056226975,0.000012073915,0.9754496,0.0044341916,0.0021134329,0.003874668,0.000009597954,0.0002918209,0.008191884],"genre_scores_gemma":[0.97700083,0.000027780992,0.020726256,0.0006656739,0.00033717437,0.00092459685,0.0000068254367,0.00005205327,0.00025882895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952569,0.000028997107,0.0014495973,0.0015927956,0.0009583769,0.000713356],"domain_scores_gemma":[0.9959396,0.00023854966,0.0013970599,0.0006348868,0.0015313993,0.00025847345],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00070545636,0.0006790772,0.0007336997,0.0003337243,0.00039482457,0.0007753831,0.0046708444,0.0003232534,0.00006249258],"category_scores_gemma":[0.0011696329,0.00059675437,0.0003853615,0.0007258655,0.00020440386,0.00038512537,0.003566586,0.0013420423,0.00017917328],"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.0005093945,0.00021159608,0.00001828821,0.0003223693,0.00015912298,6.3660065e-7,0.012436532,0.059450444,0.07273891,0.54838246,0.000656368,0.3051139],"study_design_scores_gemma":[0.000019868052,0.0004047145,0.000007454544,0.00029947513,0.000028111584,5.9540326e-7,0.0011468161,0.44959614,0.4280668,0.119796835,0.0002530443,0.0003801598],"about_ca_topic_score_codex":0.00008776887,"about_ca_topic_score_gemma":0.000013444082,"teacher_disagreement_score":0.9713781,"about_ca_system_score_codex":0.00034461965,"about_ca_system_score_gemma":0.00025591275,"threshold_uncertainty_score":0.9996484},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0082567725,0.000010377584,0.9580546,0.03197071,0.000043347674,0.0012055796,0.00007256174,0.000067859764,0.00031819128],"genre_scores_gemma":[0.9731855,0.000042579257,0.026394555,0.00010266199,0.000019126885,0.00021367402,0.000028648145,0.000010567905,0.0000027012184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979925,0.00012823928,0.00073229364,0.0004698808,0.00047222292,0.00020483272],"domain_scores_gemma":[0.99460894,0.0028817635,0.0010300147,0.0005797817,0.0008405991,0.00005891419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009787721,0.00023253297,0.00041270946,0.0001163424,0.00041652346,0.00032805544,0.002031564,0.00011005166,0.000026632782],"category_scores_gemma":[0.0034082485,0.00013371253,0.00021159695,0.00078062713,0.0008811556,0.00011161616,0.0014927704,0.00070243696,0.000001247866],"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.00003675801,0.000053788688,0.0003479222,0.00003433613,0.00016313914,2.5444237e-8,0.0014353162,0.0006537785,0.00017555557,0.99453586,0.00003290034,0.0025306311],"study_design_scores_gemma":[0.000015954765,0.000118404096,0.00055811787,0.00009700931,0.00023457123,2.7901993e-7,0.0004734165,0.4162273,0.019819621,0.56235343,0.0000042143324,0.00009764512],"about_ca_topic_score_codex":0.000030805826,"about_ca_topic_score_gemma":0.0000062225286,"teacher_disagreement_score":0.9649287,"about_ca_system_score_codex":0.00003313709,"about_ca_system_score_gemma":0.00007434003,"threshold_uncertainty_score":0.5452639},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008763066,0.000023621373,0.9846414,0.004031447,0.0006177685,0.0012382864,0.000027358285,0.00008598296,0.0005710805],"genre_scores_gemma":[0.73416096,0.000029798472,0.265427,0.00013074678,0.00006533396,0.00011209013,0.000010863543,0.000019218944,0.000043974822],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978335,0.000024965942,0.0006422551,0.00077052426,0.00041893352,0.00030980454],"domain_scores_gemma":[0.9986025,0.00012159966,0.0006681137,0.00021607595,0.00030529022,0.00008642852],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057655305,0.00028835694,0.00038342597,0.00016968894,0.000113139344,0.00034599085,0.0013339536,0.00017514682,0.000010848878],"category_scores_gemma":[0.00051022356,0.0002548697,0.00008994565,0.00030577,0.000099715886,0.00025918684,0.0007224333,0.00041722492,0.0000091383645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023925466,0.00044322707,0.0014396993,0.0010144798,0.000097705546,0.0000040883265,0.015171855,0.6205302,0.0229878,0.2860368,0.0005905544,0.05144435],"study_design_scores_gemma":[0.000038033635,0.00012532517,0.00012584381,0.00067356776,0.000011224548,9.013789e-7,0.00015734341,0.90135854,0.029323725,0.067958504,0.0000042057327,0.00022280632],"about_ca_topic_score_codex":0.00002231739,"about_ca_topic_score_gemma":5.2936605e-7,"teacher_disagreement_score":0.7253979,"about_ca_system_score_codex":0.00010802993,"about_ca_system_score_gemma":0.00014298926,"threshold_uncertainty_score":0.99999034},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64199907,0.000028716166,0.31083214,0.03665344,0.0014045441,0.0019056746,0.00006167123,0.00039810475,0.0067166733],"genre_scores_gemma":[0.9964754,0.0000074682116,0.0028061564,0.00039482655,0.00017949774,0.000048908172,0.0000028485388,0.000018306682,0.000066587876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99773234,0.000026455555,0.00084624893,0.0005530751,0.00047196908,0.0003699289],"domain_scores_gemma":[0.9975227,0.00024315181,0.00073852815,0.00025286656,0.0011152409,0.00012749805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038819565,0.00024346876,0.00038386654,0.00010502724,0.00033332358,0.00018784887,0.0023992935,0.00010807001,0.0000732035],"category_scores_gemma":[0.0010828387,0.00020637245,0.00023211015,0.0007184888,0.00022758155,0.00050982466,0.00052661577,0.000393466,0.00006552494],"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.00006572851,0.00014976432,0.00041508392,0.00009567091,0.00003137269,3.204589e-7,0.0030173208,0.0002597184,0.2205196,0.76278245,0.00044847262,0.012214506],"study_design_scores_gemma":[0.00003325406,0.0005912257,0.00018452936,0.00015397572,0.00002425645,0.00000134425,0.0010273972,0.11060696,0.7844906,0.102372244,0.00029118906,0.0002230204],"about_ca_topic_score_codex":0.000053945172,"about_ca_topic_score_gemma":0.000014439367,"teacher_disagreement_score":0.66041017,"about_ca_system_score_codex":0.000037895243,"about_ca_system_score_gemma":0.000084168154,"threshold_uncertainty_score":0.8415624},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024541972,0.0000996498,0.9566507,0.009567027,0.002547788,0.0019458837,0.000048680788,0.00040426385,0.004194071],"genre_scores_gemma":[0.93313855,0.000056620393,0.065570615,0.0004675411,0.0004586005,0.00020472243,0.0000037102589,0.000047694928,0.00005192969],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9957724,0.00008008013,0.0011916755,0.0014793376,0.00078659994,0.0006898727],"domain_scores_gemma":[0.9959847,0.00052176835,0.001161266,0.00072112866,0.0014425032,0.00016864244],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017866432,0.0005897102,0.00088013796,0.00017823468,0.000383636,0.0010428355,0.004962381,0.0003512675,0.000026410917],"category_scores_gemma":[0.0026419628,0.00050122757,0.0004758166,0.00069484906,0.00024245246,0.00050966494,0.0019052315,0.0011280307,0.00003458188],"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.0002123733,0.00020293929,0.0005752379,0.0009873081,0.00010438869,0.000002210582,0.0038168554,0.0008205207,0.05239099,0.5854112,0.00019039174,0.3552856],"study_design_scores_gemma":[0.00005356669,0.00016151977,0.00026863252,0.001016145,0.000027952823,0.0000025553786,0.00020797206,0.18571775,0.42599353,0.38599125,0.00008565031,0.00047348914],"about_ca_topic_score_codex":0.0001725096,"about_ca_topic_score_gemma":0.000028663488,"teacher_disagreement_score":0.9085966,"about_ca_system_score_codex":0.00009387685,"about_ca_system_score_gemma":0.0004820579,"threshold_uncertainty_score":0.99999416},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59937805,0.00012143867,0.32527453,0.063808285,0.00036203445,0.0012798291,0.000012386027,0.0005745835,0.00918886],"genre_scores_gemma":[0.9789645,0.000010937305,0.019870466,0.0009012374,0.00007143112,0.000028316164,6.8788455e-7,0.000013995098,0.0001384266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826586,0.000022314412,0.0004116957,0.00053969125,0.0004524514,0.00030801096],"domain_scores_gemma":[0.9988306,0.00012398686,0.00036171242,0.00018283117,0.00035388177,0.0001469805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000324908,0.000227324,0.00026833644,0.000060550126,0.00026563028,0.00034518502,0.0012914609,0.00006473522,0.000015808726],"category_scores_gemma":[0.0003728126,0.00015658578,0.00005210431,0.0005069307,0.00018870733,0.00043241004,0.00035308112,0.00043194505,0.00002472065],"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.00011916818,0.00013623145,0.008282047,0.00020628772,0.000049992985,0.0000052026658,0.024028707,0.002712151,0.029287506,0.8788712,0.00049868436,0.055802815],"study_design_scores_gemma":[0.00011297718,0.0011940452,0.0031637955,0.0008125676,0.000028782582,0.000020091898,0.0011203693,0.7949023,0.08577616,0.11149394,0.0008011711,0.0005737561],"about_ca_topic_score_codex":0.000058631977,"about_ca_topic_score_gemma":0.0000024079468,"teacher_disagreement_score":0.7921902,"about_ca_system_score_codex":0.000017100996,"about_ca_system_score_gemma":0.000092862676,"threshold_uncertainty_score":0.6385383},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21450812,0.00013049264,0.75335586,0.015138959,0.000203721,0.0007038414,4.110332e-7,0.00029885527,0.015659746],"genre_scores_gemma":[0.9981596,0.000020799012,0.0009390392,0.00063313876,0.000057540856,0.000018308096,8.1509467e-7,0.000010165214,0.00016063584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982561,0.000024586241,0.0005084299,0.00045812986,0.000449444,0.00030329434],"domain_scores_gemma":[0.99909824,0.00003249428,0.00032246727,0.00015727321,0.0002980765,0.00009145927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036978614,0.00018242365,0.0002132897,0.000100924255,0.00018437246,0.00025990128,0.0013063031,0.00006561915,0.000018135102],"category_scores_gemma":[0.00024745514,0.00015152832,0.00007414019,0.0007394302,0.00008277583,0.0004619189,0.0003277576,0.00036894725,0.000034189394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017423007,0.00016802776,0.0011493599,0.00016346204,0.000017982511,0.0000022297113,0.0110388985,0.13246652,0.16781822,0.34394157,0.00012723666,0.34293228],"study_design_scores_gemma":[0.00003164673,0.00016313508,0.000039294606,0.0001596051,0.00000518215,0.0000016273701,0.00066636386,0.8790953,0.114730045,0.004829537,0.00011761585,0.00016061436],"about_ca_topic_score_codex":0.0001064356,"about_ca_topic_score_gemma":0.000011856051,"teacher_disagreement_score":0.7836514,"about_ca_system_score_codex":0.00005830531,"about_ca_system_score_gemma":0.00006904559,"threshold_uncertainty_score":0.61791456},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49452373,0.00019215856,0.09530562,0.36626762,0.0008656693,0.0021666377,0.00002435295,0.0009862642,0.03966792],"genre_scores_gemma":[0.9964774,0.000026783036,0.0017725197,0.0014561178,0.00015463654,0.000026781558,2.5839756e-7,0.000008257478,0.00007723889],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985866,0.000008233459,0.00035943353,0.00043599002,0.00035460293,0.00025514752],"domain_scores_gemma":[0.9989052,0.00007141428,0.00023448348,0.00019757621,0.00047497146,0.000116400675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011589763,0.00016086087,0.0001708949,0.000032382883,0.00018468949,0.00024370126,0.0022222819,0.000047422895,0.00003073276],"category_scores_gemma":[0.00028668196,0.00011399315,0.00006179177,0.0010005056,0.00016296296,0.00036841544,0.0003997872,0.00024446237,0.00007760934],"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.000025821135,0.000063787054,0.00010065738,0.00005050647,0.000005828758,3.7433512e-7,0.00087161985,0.000174931,0.022784568,0.93311876,0.0013495603,0.0414536],"study_design_scores_gemma":[0.000025578463,0.00027895175,0.00014689105,0.000096023876,0.000010794581,0.000004649415,0.00028402565,0.14987841,0.72124505,0.12682581,0.0009133022,0.00029050035],"about_ca_topic_score_codex":0.0000074893005,"about_ca_topic_score_gemma":0.0000029594075,"teacher_disagreement_score":0.80629295,"about_ca_system_score_codex":0.000009257715,"about_ca_system_score_gemma":0.00007750388,"threshold_uncertainty_score":0.46485057},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057448275,0.00004036211,0.92678696,0.01338469,0.00016980017,0.0011468884,0.0000061763785,0.0002633901,0.00075345836],"genre_scores_gemma":[0.84936005,0.00007043176,0.1497129,0.0006970186,0.000045969035,0.00007814391,0.000001931451,0.000013861658,0.000019675226],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99833006,0.000021723808,0.00049510325,0.00057320343,0.00029306926,0.00028683315],"domain_scores_gemma":[0.9986676,0.00007892066,0.00029345078,0.00019356747,0.00067100715,0.00009543193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036022512,0.00023677095,0.00026757288,0.00008931406,0.00022409731,0.00045601913,0.0010594822,0.00006493368,0.00001790279],"category_scores_gemma":[0.00027086653,0.0001974108,0.00008623284,0.0004149905,0.00016750827,0.0010980631,0.00035769245,0.0001843761,0.000028125956],"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.00006446272,0.00008947264,0.000024250101,0.00016721388,0.000012624434,5.633872e-7,0.0025455835,0.0000025813379,0.77997,0.13620734,0.00039444907,0.080521494],"study_design_scores_gemma":[0.000060510705,0.00019377074,0.000082438724,0.00016008888,0.000012741228,0.000002200108,0.00011772882,0.17338951,0.8087638,0.016922545,0.00010281518,0.00019186178],"about_ca_topic_score_codex":0.00000963413,"about_ca_topic_score_gemma":0.0000015792973,"teacher_disagreement_score":0.7919118,"about_ca_system_score_codex":0.000042952553,"about_ca_system_score_gemma":0.00005244975,"threshold_uncertainty_score":0.8050179},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09301202,0.000044492273,0.8447145,0.01657512,0.0006738597,0.0010375346,9.867364e-7,0.0007990287,0.043142408],"genre_scores_gemma":[0.9899594,0.000013864466,0.008531108,0.0009920988,0.00014533504,0.000022212345,0.0000016884725,0.000023142205,0.00031112676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975694,0.0000843303,0.00055495696,0.0006870252,0.00061575836,0.0004885602],"domain_scores_gemma":[0.9984531,0.000100086385,0.00048574866,0.00016989885,0.00052989414,0.00026128587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005109262,0.00026946256,0.00030759576,0.00010646969,0.00045638112,0.0005001758,0.0016445965,0.00010669771,0.000034040153],"category_scores_gemma":[0.0013906833,0.00022686948,0.00012744422,0.0019604473,0.0001431929,0.00043887785,0.00040976956,0.0007978081,0.00013686501],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014011312,0.00007225812,0.0007206688,0.000041326442,0.000021588636,6.7120635e-7,0.0075391065,0.16578342,0.021527974,0.75022113,0.00030292672,0.053628806],"study_design_scores_gemma":[0.000046368732,0.00035555198,0.0004023911,0.00009383408,0.000010109027,0.0000027763672,0.001522238,0.9750769,0.01684616,0.0039094863,0.0014449442,0.00028920604],"about_ca_topic_score_codex":0.000011085961,"about_ca_topic_score_gemma":9.0583836e-7,"teacher_disagreement_score":0.8969474,"about_ca_system_score_codex":0.000040759292,"about_ca_system_score_gemma":0.00008232509,"threshold_uncertainty_score":0.9251469},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19800867,0.000028487917,0.78625053,0.0072156442,0.00041733036,0.00041468078,0.0000018049061,0.00017217416,0.0074906973],"genre_scores_gemma":[0.98619837,0.000017136068,0.013145599,0.00037488664,0.00012401782,0.000013776939,6.776012e-7,0.000009971387,0.00011559777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982672,0.0000127762205,0.00041120208,0.0004777876,0.0005464356,0.00028464716],"domain_scores_gemma":[0.99896336,0.00005067443,0.00032699396,0.00018239679,0.0003776303,0.00009896671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029670374,0.00017249529,0.00018726682,0.000049814193,0.00021157373,0.00010546836,0.0009100707,0.00008313825,0.00007631947],"category_scores_gemma":[0.00008934597,0.00013133264,0.000079609614,0.0006573777,0.00013503454,0.00069743255,0.000098861856,0.00035944494,0.000037820093],"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.00011132582,0.00004484908,0.0044182404,0.000029094463,0.00001724484,8.299237e-7,0.0006860206,0.014660363,0.0076895994,0.96658313,0.00012688371,0.005632429],"study_design_scores_gemma":[0.000073435935,0.00034661757,0.006594048,0.00031067152,0.000031247964,0.000011075223,0.00028404777,0.7726421,0.051014826,0.16786471,0.0004320413,0.00039517687],"about_ca_topic_score_codex":0.000050108563,"about_ca_topic_score_gemma":0.000010234123,"teacher_disagreement_score":0.7987184,"about_ca_system_score_codex":0.000036492274,"about_ca_system_score_gemma":0.00010722981,"threshold_uncertainty_score":0.53555894},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021720776,0.000009693939,0.96562815,0.00984924,0.00022881788,0.00036461846,0.0000030006042,0.000095920564,0.002099813],"genre_scores_gemma":[0.9089815,0.0000020823115,0.089932084,0.0009608495,0.000064308835,0.00002008208,7.116264e-7,0.000010763256,0.00002759387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825436,0.000038278235,0.00045553097,0.00049230334,0.0005032391,0.0002562729],"domain_scores_gemma":[0.99874336,0.00011129945,0.0003402007,0.00021835447,0.00045073635,0.00013604837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043586091,0.00020436611,0.00023317516,0.00007726208,0.00015119865,0.00019286091,0.0013043097,0.00009140958,0.00005228297],"category_scores_gemma":[0.00036446485,0.00016104504,0.00011334058,0.0006249572,0.00012219862,0.00036567872,0.00016823971,0.00024331237,0.000037017013],"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.000063969586,0.000062713276,0.000016760523,0.000037326266,0.00000879068,1.9873725e-7,0.0012241033,0.0027900266,0.032738,0.8988946,0.00012577565,0.06403774],"study_design_scores_gemma":[0.000028830664,0.000097638476,0.000029279887,0.000059838698,0.00001068073,5.4367445e-7,0.0000694871,0.62101215,0.21565779,0.16290484,0.000005943407,0.00012295153],"about_ca_topic_score_codex":0.00001137122,"about_ca_topic_score_gemma":0.0000022547797,"teacher_disagreement_score":0.88726074,"about_ca_system_score_codex":0.00003188051,"about_ca_system_score_gemma":0.00010401427,"threshold_uncertainty_score":0.6567226},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8595357,0.00016574613,0.088969864,0.0070059407,0.0011150024,0.0010340089,0.000022211625,0.0020536003,0.04009793],"genre_scores_gemma":[0.997065,0.000029459401,0.0024340628,0.00030849825,0.00011184924,0.0000111957115,7.0322653e-7,0.00002779571,0.000011439232],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99890035,0.0000055612218,0.0003360318,0.00025266403,0.000249242,0.0002561452],"domain_scores_gemma":[0.99938035,0.000042860098,0.000102898885,0.00013828767,0.00024364331,0.00009193383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010611062,0.00019840548,0.00021442755,0.000061118786,0.00008496706,0.00008922117,0.0006263398,0.00007478776,0.00006154091],"category_scores_gemma":[0.0001275022,0.0001627942,0.00010515152,0.00037083283,0.00013207445,0.000095904325,0.00007164071,0.0002777905,0.000037941016],"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.0002481574,0.00013594322,0.00077883014,0.00023924648,0.000070705304,0.0000029829118,0.0015508068,0.028326627,0.7385439,0.14750938,0.0041541285,0.07843928],"study_design_scores_gemma":[0.000011964652,0.000060655468,0.000028783845,0.000156297,0.000011238803,6.6159026e-7,0.00015306231,0.30801508,0.6850677,0.006159402,0.00019065102,0.0001445045],"about_ca_topic_score_codex":0.000011222728,"about_ca_topic_score_gemma":0.0000027291592,"teacher_disagreement_score":0.27968848,"about_ca_system_score_codex":0.000025816767,"about_ca_system_score_gemma":0.000021542062,"threshold_uncertainty_score":0.66385543},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036601955,0.00001327931,0.9821104,0.012807078,0.00021854209,0.00054113124,0.000025413825,0.00013155512,0.00049240724],"genre_scores_gemma":[0.72876924,0.000009771146,0.27024642,0.0006690028,0.00014509562,0.000056650195,0.000012167246,0.00001844483,0.000073220705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798673,0.000042801472,0.0005314521,0.0006654637,0.00044025027,0.00033328912],"domain_scores_gemma":[0.99828994,0.00015252816,0.000444361,0.00029988503,0.00065929163,0.00015400072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072984106,0.00023017365,0.00027982853,0.0000924912,0.0003173409,0.00024202732,0.0015820377,0.00009582492,0.000039861727],"category_scores_gemma":[0.0010667756,0.00016850191,0.00012797758,0.0006706772,0.00006568674,0.0004076669,0.0003197799,0.00029771237,0.000030286277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005553021,0.0004480322,0.00020717141,0.00027412004,0.000035070207,3.9705452e-7,0.009144139,0.032797907,0.056177333,0.7698917,0.0010478245,0.129421],"study_design_scores_gemma":[0.0000717121,0.00029833041,0.000021376347,0.00014279915,0.000017936662,0.0000018441505,0.0005666272,0.9461736,0.046940956,0.0052792924,0.00030143358,0.00018409763],"about_ca_topic_score_codex":0.000017528819,"about_ca_topic_score_gemma":0.000003530983,"teacher_disagreement_score":0.9133757,"about_ca_system_score_codex":0.000034848093,"about_ca_system_score_gemma":0.00009503067,"threshold_uncertainty_score":0.68713087},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64631724,0.000012462479,0.33428097,0.015695488,0.00033977663,0.00082182104,0.000006264641,0.0005114207,0.0020145755],"genre_scores_gemma":[0.98953754,0.000002609703,0.009994906,0.00024569192,0.00012593191,0.000039683793,4.95618e-7,0.000015357668,0.000037793667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9974722,0.00003052154,0.00047252447,0.0006509584,0.0009496046,0.0004241743],"domain_scores_gemma":[0.99823564,0.0004140151,0.00017529671,0.00023469658,0.0006909115,0.0002494101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000703748,0.00020991369,0.00023832162,0.00010496035,0.00023761968,0.00026388586,0.0020440272,0.000075205884,0.00013758575],"category_scores_gemma":[0.0044151596,0.0001735541,0.000097873795,0.0010893227,0.00018373202,0.00039758158,0.0007961943,0.00064368156,0.00016167901],"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.0001478788,0.00020336294,0.047379307,0.00025082892,0.000048309288,0.0000028494394,0.008484197,0.0051283385,0.24201253,0.4634197,0.0001767194,0.23274598],"study_design_scores_gemma":[0.000032200864,0.000607653,0.008330597,0.00019274633,0.000008150264,0.0000071420377,0.00026459136,0.39354634,0.573145,0.02343267,0.00010602204,0.00032688584],"about_ca_topic_score_codex":0.000042504777,"about_ca_topic_score_gemma":0.0000025306372,"teacher_disagreement_score":0.43998703,"about_ca_system_score_codex":0.00007631064,"about_ca_system_score_gemma":0.0001389328,"threshold_uncertainty_score":0.7077331},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9621522,0.00003773089,0.015651546,0.014861102,0.00036424038,0.0008920852,0.000004313952,0.00019009942,0.0058466876],"genre_scores_gemma":[0.99636406,0.000040039064,0.0029452266,0.00037441327,0.000093358234,0.000037610273,1.8693396e-7,0.000023592182,0.00012149705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9967723,0.000054829765,0.00073891116,0.0008744354,0.00094265724,0.0006168689],"domain_scores_gemma":[0.9982061,0.0001540546,0.00038940503,0.00037475428,0.0006651433,0.0002105762],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053828297,0.00035921173,0.00045587806,0.00021108174,0.0001837481,0.000450014,0.0028326556,0.00013151907,0.000036122456],"category_scores_gemma":[0.00048401926,0.0002636396,0.0001283965,0.0016472199,0.00048411387,0.0008977421,0.00048159328,0.0006313548,0.0001348214],"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.00058899284,0.00044933418,0.008594979,0.00010992552,0.00005331714,0.000010677733,0.017430076,0.004253126,0.050166704,0.7345434,0.00019246072,0.18360706],"study_design_scores_gemma":[0.000056190525,0.0009146956,0.0011481651,0.000333282,0.000016953103,0.000007894726,0.004727217,0.28862953,0.6813947,0.022229169,0.00010807014,0.00043414906],"about_ca_topic_score_codex":0.00036322145,"about_ca_topic_score_gemma":0.00016446305,"teacher_disagreement_score":0.7123142,"about_ca_system_score_codex":0.00009675231,"about_ca_system_score_gemma":0.00015631391,"threshold_uncertainty_score":0.9999816},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45475894,0.00004910193,0.52437955,0.016180305,0.0003641286,0.0019292756,0.000015299664,0.0001820053,0.0021413898],"genre_scores_gemma":[0.99204934,0.000016517042,0.006960157,0.0006773854,0.00012233846,0.00007890046,0.0000021063368,0.000012094101,0.000081149796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816114,0.000023761058,0.00043297993,0.00074766914,0.00034958776,0.0002848737],"domain_scores_gemma":[0.99873996,0.00011839992,0.0003852394,0.00027107407,0.00035113154,0.00013417064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004508262,0.00021342188,0.00027124057,0.00006396905,0.00026463493,0.0002934941,0.0009752268,0.000066964916,0.000007097356],"category_scores_gemma":[0.00016941813,0.00016504408,0.000116403746,0.00043200716,0.000108133914,0.00036657666,0.00021987941,0.00018601348,0.000013193507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019145661,0.00013919907,0.0002302739,0.000028657056,0.000040392046,1.4227052e-7,0.0030465773,0.005963414,0.030629307,0.85089296,0.000407281,0.10843033],"study_design_scores_gemma":[0.000040276434,0.00037445067,0.00041843907,0.00005599356,0.00002251402,5.9734225e-7,0.00032533283,0.8932208,0.083315484,0.022040244,0.00002188742,0.00016402383],"about_ca_topic_score_codex":0.0000072149683,"about_ca_topic_score_gemma":0.0000025529255,"teacher_disagreement_score":0.88725734,"about_ca_system_score_codex":0.000033664764,"about_ca_system_score_gemma":0.00003059525,"threshold_uncertainty_score":0.67303026},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25411996,0.00024653468,0.7087392,0.033220395,0.0003676021,0.0024060681,0.00002330964,0.00032794892,0.00054893375],"genre_scores_gemma":[0.9742775,0.000038179875,0.024823902,0.0006273979,0.00009003533,0.00009003784,0.0000010503531,0.000022435826,0.000029482],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978807,0.00003625052,0.00052085315,0.00071263855,0.0004447643,0.00040476723],"domain_scores_gemma":[0.9981833,0.00015771408,0.00040121723,0.00020098445,0.00084445166,0.00021232787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057496806,0.00026090405,0.00036301897,0.00008588565,0.00040094266,0.00023454223,0.001072975,0.00012882185,0.0000052357677],"category_scores_gemma":[0.00143949,0.00020300945,0.000082033286,0.0006793124,0.00017307325,0.00042754342,0.00027819758,0.0003853469,0.000004046906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008951921,0.0001035843,0.0058299555,0.0064983554,0.000046145382,8.2182004e-7,0.019895764,0.014731486,0.022033276,0.87347305,0.0001372599,0.056355122],"study_design_scores_gemma":[0.00007089408,0.0006397827,0.00005485692,0.0003639028,0.000017499617,0.00000513754,0.00034137123,0.9330314,0.032908116,0.032372918,0.000024826428,0.00016930878],"about_ca_topic_score_codex":0.00008620215,"about_ca_topic_score_gemma":0.0000131223,"teacher_disagreement_score":0.9182999,"about_ca_system_score_codex":0.000063215215,"about_ca_system_score_gemma":0.00028575663,"threshold_uncertainty_score":0.82784855},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031353723,0.000049340124,0.88381666,0.07606008,0.0008698027,0.0018680226,0.00010631442,0.00049237674,0.005383696],"genre_scores_gemma":[0.97262824,0.00003836573,0.026897095,0.00023477613,0.00005787928,0.00003773192,0.000009349051,0.000009065433,0.00008748028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998278,0.000009456557,0.00060080073,0.0005517531,0.00036969164,0.00019026123],"domain_scores_gemma":[0.9981022,0.00010927951,0.0006415391,0.00054805813,0.00054439215,0.000054572316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033476995,0.00015705635,0.00020904327,0.00008331267,0.00011694455,0.00016238258,0.003697287,0.00008678984,0.000021872773],"category_scores_gemma":[0.00080690125,0.00012397082,0.00007277098,0.0004992922,0.00016579634,0.0007066545,0.0005505591,0.00014412182,0.00004941087],"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.000046216213,0.000091143425,0.000081012426,0.00005556144,0.0000111957925,2.5982251e-8,0.00082752254,0.000003800869,0.13462147,0.7711114,0.00088696065,0.09226366],"study_design_scores_gemma":[0.000043998098,0.00022864918,0.00011539773,0.000057215108,0.000015448823,2.0860813e-7,0.0011850446,0.26047254,0.6817673,0.054617226,0.0013524736,0.00014453878],"about_ca_topic_score_codex":0.0000058039,"about_ca_topic_score_gemma":0.0000032331393,"teacher_disagreement_score":0.9412745,"about_ca_system_score_codex":0.000023352373,"about_ca_system_score_gemma":0.00008345805,"threshold_uncertainty_score":0.6870541},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30929998,0.000016958838,0.6337877,0.018104194,0.0007944689,0.0009863869,0.000021839061,0.0004959946,0.036492474],"genre_scores_gemma":[0.99209166,0.0000046379437,0.006639812,0.0010554587,0.0001246465,0.000022133285,0.0000055448586,0.000009745004,0.00004634995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99841076,0.000017291908,0.0004639672,0.00041821576,0.0004650575,0.00022468457],"domain_scores_gemma":[0.9988544,0.00005030006,0.00032399123,0.00015496588,0.00049757643,0.000118750824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017444784,0.00018469215,0.00019173135,0.00008947925,0.0003169694,0.00026514597,0.0010916285,0.0000710167,0.00016512805],"category_scores_gemma":[0.00011270016,0.00015527954,0.000101465994,0.00043855334,0.0001065818,0.00064696785,0.00021481347,0.00025788968,0.00034959274],"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.000030453752,0.00015433958,0.00004568325,0.000041198535,0.000015097797,8.0371996e-7,0.0015405373,0.000121859855,0.20437878,0.70790136,0.0005111883,0.0852587],"study_design_scores_gemma":[0.00004055364,0.00025291578,0.00019192585,0.000114511604,0.000012342525,0.0000062414197,0.00013305363,0.2036898,0.6262075,0.16902162,0.00011184934,0.00021768555],"about_ca_topic_score_codex":0.0000149111775,"about_ca_topic_score_gemma":0.0000033246274,"teacher_disagreement_score":0.6827917,"about_ca_system_score_codex":0.000035264806,"about_ca_system_score_gemma":0.000040253995,"threshold_uncertainty_score":0.6332116},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18265764,0.000092994145,0.76306874,0.04481866,0.00073440775,0.0013282538,0.000019516749,0.00039415725,0.0068856217],"genre_scores_gemma":[0.9780357,0.000015493406,0.017399779,0.0043482296,0.00015573086,0.000021197084,8.1265887e-7,0.000012957137,0.000010125078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997659,0.00006718196,0.0005332736,0.0007326664,0.00057660794,0.00043126725],"domain_scores_gemma":[0.99840176,0.00030570448,0.00043356596,0.0003003288,0.00035488597,0.00020377508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052028557,0.00030190876,0.00035410246,0.000051875595,0.00035838547,0.00030135497,0.0016609802,0.00010296263,0.000022361106],"category_scores_gemma":[0.0004268435,0.0002328518,0.00011064001,0.00094222405,0.00037200048,0.00042645133,0.00055731885,0.0005621373,0.000015092387],"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.00013778244,0.0000888348,0.0017315738,0.000038890546,0.00001733725,0.0000012729583,0.0012663152,0.019943275,0.002371599,0.9234718,0.00026037495,0.05067092],"study_design_scores_gemma":[0.000039943672,0.00028865825,0.0007550798,0.00011485831,0.000009639659,0.0000012159317,0.00010134411,0.79250103,0.053754415,0.15210538,0.00007810074,0.00025033497],"about_ca_topic_score_codex":0.000007902811,"about_ca_topic_score_gemma":0.0000068961,"teacher_disagreement_score":0.795378,"about_ca_system_score_codex":0.00003010661,"about_ca_system_score_gemma":0.000051263585,"threshold_uncertainty_score":0.9495421},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9198922,0.000009468646,0.040979497,0.023924708,0.00030145713,0.0005431303,0.000052930773,0.00007878478,0.014217832],"genre_scores_gemma":[0.99865055,0.0000058795804,0.00050829037,0.00014884253,0.0000850575,0.000028217059,0.0000013280531,0.00001024053,0.00056160596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980395,0.000030946772,0.0008649728,0.00043799583,0.00046149216,0.00016508151],"domain_scores_gemma":[0.99731725,0.00024490283,0.00085055304,0.00027251279,0.0011909205,0.0001238849],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006989324,0.00016487451,0.00026637694,0.00014239771,0.00022486113,0.0001423233,0.0011140486,0.0000730295,0.00092183624],"category_scores_gemma":[0.0012649363,0.00010428781,0.00013856549,0.0012235554,0.0006067765,0.000392366,0.00015114802,0.000328476,0.00039243608],"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.00032184683,0.00018460628,0.00066457666,0.000013681739,0.000020809097,1.2648766e-7,0.00085675553,0.00024104644,0.05243895,0.92088574,0.000831913,0.023539944],"study_design_scores_gemma":[0.000060709055,0.0007097697,0.0011873043,0.00017222733,0.000048744605,0.00000993631,0.017187688,0.00699633,0.5970111,0.37360534,0.0027400353,0.00027080232],"about_ca_topic_score_codex":0.000021887283,"about_ca_topic_score_gemma":0.000049009584,"teacher_disagreement_score":0.54728043,"about_ca_system_score_codex":0.000019839687,"about_ca_system_score_gemma":0.00007818604,"threshold_uncertainty_score":0.9999915},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005794753,0.0000144201995,0.96375597,0.024974266,0.00085816847,0.0010092445,0.000007323793,0.0002674698,0.0033183664],"genre_scores_gemma":[0.99345833,0.000016240027,0.005125931,0.0010852834,0.00017440038,0.000088218774,0.0000023353919,0.000013495053,0.000035789337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983723,0.000025172729,0.00057551597,0.00048561022,0.00023777712,0.00030363127],"domain_scores_gemma":[0.9987525,0.00007203337,0.00043415578,0.00018665948,0.0004469769,0.00010770172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042950196,0.00020761463,0.00026103607,0.00007648141,0.00019949734,0.0002795996,0.0015216646,0.000091721406,0.000036501355],"category_scores_gemma":[0.0001447483,0.00016056588,0.00017724458,0.00051545544,0.00009039924,0.00046794105,0.00031449055,0.00023251658,0.000006673853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012721619,0.000109376626,0.00006774259,0.00008722474,0.00003939016,2.6602308e-7,0.0012491737,0.00023188813,0.0153923435,0.6103715,0.0041183103,0.3682056],"study_design_scores_gemma":[0.00004310848,0.0003435011,0.000015196774,0.00006232846,0.000011059866,0.0000024266062,0.0002186723,0.6632116,0.29575574,0.039693028,0.00044653882,0.00019682023],"about_ca_topic_score_codex":0.000030158784,"about_ca_topic_score_gemma":0.000004627584,"teacher_disagreement_score":0.98766357,"about_ca_system_score_codex":0.000029733947,"about_ca_system_score_gemma":0.00003406579,"threshold_uncertainty_score":0.6547686},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86866343,0.00044307843,0.0799493,0.011460756,0.0014708957,0.0019549706,0.000011102863,0.00040077246,0.035645675],"genre_scores_gemma":[0.99538404,0.0000091802885,0.0038537234,0.00029566174,0.000079315476,0.000025272442,2.8945843e-7,0.00001095508,0.00034155053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983583,0.000030037536,0.0003938265,0.00044571617,0.00047637214,0.0002957154],"domain_scores_gemma":[0.998505,0.00006137673,0.00051871873,0.00031325957,0.00051275495,0.00008892304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003310337,0.00020997529,0.00027513952,0.000054210188,0.00013124358,0.000069476395,0.0022365293,0.00008517436,0.000038531878],"category_scores_gemma":[0.00044319613,0.00012037461,0.0001196882,0.0005591026,0.00048512494,0.00026900994,0.00046248568,0.00031630375,0.00002557866],"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.00011697583,0.00018691225,0.00040188924,0.00012943544,0.00002925428,0.0000013748702,0.021615898,0.00003117231,0.07262078,0.8183868,0.0004486805,0.08603083],"study_design_scores_gemma":[0.000101329475,0.00070994865,0.0011564497,0.00038687894,0.000046436126,0.000010983188,0.0033832446,0.01947359,0.96074337,0.012953456,0.0006446692,0.0003896332],"about_ca_topic_score_codex":0.0001147659,"about_ca_topic_score_gemma":0.000029505238,"teacher_disagreement_score":0.8881226,"about_ca_system_score_codex":0.000086255364,"about_ca_system_score_gemma":0.00023181406,"threshold_uncertainty_score":0.4908734},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42903727,0.000024672332,0.55172753,0.013250897,0.0005013533,0.00043984386,0.0000018320296,0.00020162408,0.0048149833],"genre_scores_gemma":[0.9826547,0.000013340866,0.016256612,0.0008931572,0.00012773878,0.000010045717,1.7150504e-7,0.000011371972,0.000032852306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796116,0.000016033864,0.00055323716,0.00057028764,0.0005455469,0.00035372563],"domain_scores_gemma":[0.9988475,0.000039965667,0.0003540141,0.0002460995,0.00037628695,0.0001361665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003524292,0.00020908579,0.00023699165,0.000072167066,0.00020774806,0.00035411277,0.0016659085,0.00006677601,0.00006620182],"category_scores_gemma":[0.00025966277,0.00017144723,0.00011514467,0.000557971,0.00011003573,0.0006995485,0.000536228,0.00028510182,0.00007109181],"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.000023175351,0.000036845868,0.00018921657,0.00004830493,0.000011839377,8.017245e-7,0.0041439473,0.0017559156,0.083819024,0.87887764,0.000054090913,0.031039191],"study_design_scores_gemma":[0.000018930397,0.000063256564,0.000017580061,0.00013115663,0.000008240836,0.0000028885,0.00038273126,0.5638609,0.35302454,0.08224939,0.00008116686,0.00015924504],"about_ca_topic_score_codex":0.00004616785,"about_ca_topic_score_gemma":0.0000015844192,"teacher_disagreement_score":0.79662824,"about_ca_system_score_codex":0.00007270229,"about_ca_system_score_gemma":0.000094127565,"threshold_uncertainty_score":0.6991415},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040863153,0.000014945705,0.9447226,0.008965997,0.00023330071,0.00063224265,5.9612665e-7,0.00017758003,0.004389584],"genre_scores_gemma":[0.9840041,0.000020659454,0.014470018,0.0011232096,0.00015110512,0.00004759048,5.684328e-7,0.00002176043,0.00016103059],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968345,0.000054087388,0.0007194381,0.0008870241,0.0009270662,0.0005778439],"domain_scores_gemma":[0.99823034,0.00009831986,0.00030871746,0.00050564547,0.000566394,0.00029060675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078063895,0.00033143567,0.00032412476,0.000090277514,0.0004329654,0.00047841485,0.0037633267,0.000093593786,0.000020252743],"category_scores_gemma":[0.0004337294,0.00022500986,0.00014248186,0.0008507233,0.0001942066,0.0006248336,0.000813761,0.00075375446,0.00007623785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060286908,0.000095641684,0.0000543571,0.00005931375,0.000016043648,4.967342e-7,0.014796954,0.5179493,0.010825054,0.41939566,0.00003671072,0.036710184],"study_design_scores_gemma":[0.000022658674,0.00028121466,0.000005043535,0.00009746562,0.0000120673685,0.0000037683765,0.0027392574,0.94402814,0.03641832,0.015960505,0.00016926977,0.0002622972],"about_ca_topic_score_codex":0.00011138437,"about_ca_topic_score_gemma":0.0000022320398,"teacher_disagreement_score":0.9431409,"about_ca_system_score_codex":0.0000642684,"about_ca_system_score_gemma":0.000109964596,"threshold_uncertainty_score":0.91756356},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017304372,0.0000109909715,0.9580839,0.009865763,0.0004312019,0.0007850098,0.000004362897,0.00022946556,0.013284899],"genre_scores_gemma":[0.968988,0.000009587442,0.029961081,0.00057589525,0.00015798803,0.000043584696,0.0000022118522,0.000016474274,0.0002451937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998084,0.000036440524,0.00053956214,0.0005567504,0.00045223915,0.00033102208],"domain_scores_gemma":[0.9985335,0.00015059057,0.00048744178,0.00014468138,0.00053430855,0.00014947071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005792981,0.00020992332,0.00024354023,0.00008725714,0.0003570092,0.00030988047,0.0011563996,0.00010356772,0.000051675866],"category_scores_gemma":[0.0012096264,0.00017650465,0.00015025285,0.0005401844,0.00019220468,0.0004420323,0.00017994441,0.00038865788,0.00014180667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013677047,0.00007458447,0.00013650532,0.00003309081,0.000014205519,2.4951544e-7,0.004810017,0.0002529714,0.07549817,0.84532034,0.00022544745,0.073497646],"study_design_scores_gemma":[0.00016768495,0.0003994336,0.0004317245,0.000071197195,0.000011799924,0.0000021044348,0.003860395,0.87617415,0.09724208,0.014290226,0.007052367,0.00029686364],"about_ca_topic_score_codex":0.0000058259257,"about_ca_topic_score_gemma":0.0000020537188,"teacher_disagreement_score":0.95168364,"about_ca_system_score_codex":0.00004162031,"about_ca_system_score_gemma":0.00011869009,"threshold_uncertainty_score":0.71976507},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5245655,0.000065986176,0.2618753,0.097255364,0.0025141553,0.0026387875,0.00006122586,0.0011619705,0.1098617],"genre_scores_gemma":[0.9934105,0.00003008285,0.0048418106,0.0014026689,0.00018539868,0.00003448122,7.475557e-7,0.00001818126,0.000076090844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9973996,0.000031308933,0.0007067482,0.0007318095,0.00068611203,0.0004443823],"domain_scores_gemma":[0.9979082,0.00014882065,0.000500016,0.00031456,0.00092301413,0.00020539721],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00031343434,0.00029910737,0.00032647315,0.00010379763,0.00023386194,0.00029650307,0.0029524574,0.00013161759,0.00020680382],"category_scores_gemma":[0.0011276295,0.00023613726,0.00019583615,0.0011180118,0.0003964539,0.000877773,0.0006015139,0.00049038744,0.00089333684],"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.00012354755,0.00011740314,0.00006140228,0.000028260924,0.000020277921,0.0000010651647,0.0042545716,0.00004159363,0.061220765,0.54580367,0.00040635432,0.38792112],"study_design_scores_gemma":[0.000012842619,0.0002679179,0.000060303268,0.00009491499,0.000010337008,0.0000030076924,0.0010082239,0.044622317,0.7496775,0.2037681,0.00023411609,0.00024041881],"about_ca_topic_score_codex":0.0000332538,"about_ca_topic_score_gemma":0.000006427142,"teacher_disagreement_score":0.6884567,"about_ca_system_score_codex":0.0000557404,"about_ca_system_score_gemma":0.00012485893,"threshold_uncertainty_score":0.9998846},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065136604,0.000009148551,0.8744043,0.04392438,0.0005110115,0.0011697492,0.0000062761083,0.0008001513,0.014038382],"genre_scores_gemma":[0.98903304,0.00001785805,0.010420854,0.00036384384,0.0000759408,0.00003580011,0.0000013815825,0.000012192924,0.000039100105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99844867,0.000030388725,0.0004943694,0.0004583609,0.00035619887,0.00021202168],"domain_scores_gemma":[0.9986795,0.000037283353,0.00048247466,0.00018661634,0.00052444625,0.00008963171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033164673,0.0001889178,0.00021932235,0.000073644995,0.0001755089,0.00028292206,0.0010473239,0.00008280485,0.000052613294],"category_scores_gemma":[0.000065186585,0.00013347344,0.000088577915,0.00058267784,0.000059822058,0.0006849419,0.00022077975,0.00024506653,0.000049580292],"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.00009533121,0.00014218691,0.0017029989,0.000090706286,0.000048438094,5.9322235e-7,0.0021101867,0.000014182478,0.023059253,0.9251842,0.00072093395,0.046830986],"study_design_scores_gemma":[0.00017594281,0.0011486458,0.0013934401,0.00050569983,0.000051002622,0.000015126086,0.00087019836,0.30286318,0.62273437,0.067543924,0.0019986401,0.0006997854],"about_ca_topic_score_codex":0.00005364203,"about_ca_topic_score_gemma":0.0000071061118,"teacher_disagreement_score":0.92389643,"about_ca_system_score_codex":0.00004831428,"about_ca_system_score_gemma":0.000071558854,"threshold_uncertainty_score":0.54428893},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037718892,0.000023864814,0.94647914,0.01339174,0.00026029465,0.001467639,0.000004490745,0.00015426593,0.00049968506],"genre_scores_gemma":[0.9661045,0.000008962849,0.032326583,0.00095282507,0.00026676556,0.00030717603,0.0000035972141,0.000017521532,0.0000120744635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980345,0.000032866283,0.0005435964,0.000695923,0.00034898042,0.00034414284],"domain_scores_gemma":[0.9982093,0.00012410781,0.0004155723,0.00029191494,0.00081189594,0.00014719866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032932972,0.00025516062,0.0002613881,0.000083009945,0.0003818216,0.0003085366,0.0017517329,0.00009285558,0.000016468892],"category_scores_gemma":[0.0006803833,0.00020149919,0.00016484164,0.0009198263,0.00021385193,0.00031304845,0.00026435664,0.0003379356,0.000014334292],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042926175,0.00008360852,0.00018317168,0.000034107437,0.000015510646,9.5151385e-8,0.0011725444,0.064152814,0.026919916,0.8618849,0.00010876514,0.045401655],"study_design_scores_gemma":[0.00003516171,0.00023208659,0.00015586261,0.000022560132,0.000014504512,0.0000011983878,0.000058872272,0.88915527,0.04297586,0.06714015,0.000016717131,0.00019174989],"about_ca_topic_score_codex":0.000039739658,"about_ca_topic_score_gemma":0.000014013362,"teacher_disagreement_score":0.9283856,"about_ca_system_score_codex":0.000029529043,"about_ca_system_score_gemma":0.000053004875,"threshold_uncertainty_score":0.82168984},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3202744,0.00017854033,0.64290315,0.028623026,0.0005717995,0.002220978,0.000032906915,0.00017124912,0.005023919],"genre_scores_gemma":[0.9985968,0.000009927445,0.000757017,0.00048902404,0.000075708434,0.00004855534,0.0000022171687,0.000011347968,0.0000094121],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99677557,0.00016518775,0.0012305406,0.00058663276,0.0006880831,0.000554015],"domain_scores_gemma":[0.9957877,0.00080142013,0.0010070694,0.00031484253,0.001963934,0.00012502556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013711016,0.00031023973,0.00048739277,0.00013071374,0.00039564373,0.0002830683,0.003249119,0.00013198965,0.00002691109],"category_scores_gemma":[0.0029638666,0.00021832553,0.00012794702,0.0032113947,0.000712688,0.00092542253,0.000971822,0.00093428243,0.00002026337],"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.00010834236,0.000097815006,0.00069595175,0.000025030888,0.00003470471,0.0000012322286,0.026032664,0.013353751,0.006190253,0.9390389,0.000043888667,0.014377521],"study_design_scores_gemma":[0.00003013324,0.0002450914,0.00019062785,0.00018384683,0.0000150412225,0.0000026139767,0.0063023083,0.6871855,0.2809607,0.024695951,0.000012723262,0.00017540196],"about_ca_topic_score_codex":0.00006045923,"about_ca_topic_score_gemma":0.000043824195,"teacher_disagreement_score":0.9143429,"about_ca_system_score_codex":0.000087690016,"about_ca_system_score_gemma":0.00014694556,"threshold_uncertainty_score":0.89030564},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17996942,0.000046293477,0.5546765,0.21481405,0.00055262836,0.0011324703,0.0000030033632,0.0016176259,0.047188047],"genre_scores_gemma":[0.9939347,0.000032745593,0.005321213,0.00043982675,0.000036748803,0.000018384326,3.7630986e-7,0.000006623999,0.0002094028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985246,0.000019001516,0.00041325245,0.00043585288,0.00040078806,0.00020650937],"domain_scores_gemma":[0.99897784,0.00007783066,0.00033458273,0.00021629123,0.00032115105,0.00007232505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001920345,0.00013751735,0.00017297173,0.00007638296,0.00017262007,0.00027199817,0.0020009694,0.000073416006,0.000047793565],"category_scores_gemma":[0.0010329868,0.00010412136,0.00008494287,0.00079663546,0.00020216826,0.00044780405,0.0005097288,0.00036024937,0.00011868737],"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.000026913416,0.000029889577,0.00029923153,0.000012790945,0.000005528343,1.6985574e-7,0.0012363849,0.00005562789,0.05239802,0.78513056,0.00017521919,0.16062966],"study_design_scores_gemma":[0.000029561355,0.00024361552,0.0003520388,0.000050386538,0.0000055226615,0.0000012816474,0.0009552988,0.13245107,0.66681755,0.19829297,0.0006295937,0.00017112271],"about_ca_topic_score_codex":0.000006251417,"about_ca_topic_score_gemma":6.2262217e-7,"teacher_disagreement_score":0.81396526,"about_ca_system_score_codex":0.000019551648,"about_ca_system_score_gemma":0.000046743873,"threshold_uncertainty_score":0.4245946},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17551073,0.00005622128,0.7937316,0.025028655,0.00062420755,0.0020883814,0.000090753376,0.00013834627,0.0027311493],"genre_scores_gemma":[0.96672034,0.000006644138,0.032449704,0.0002701282,0.0001757899,0.000054404274,8.6565603e-7,0.00002804875,0.0002940756],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950144,0.00009815078,0.00095662,0.0009893375,0.002415556,0.00052592746],"domain_scores_gemma":[0.99441415,0.0009850941,0.00073506,0.00054573285,0.0030323057,0.00028762937],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0017925984,0.00031398423,0.00049817073,0.0002763185,0.00032007266,0.00027500038,0.0031707427,0.00009347224,0.00024334437],"category_scores_gemma":[0.017167436,0.0001817467,0.00016230154,0.0028182974,0.0008412708,0.00018011683,0.0006937419,0.00066524814,0.00013276975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034421203,0.0013792845,0.00016860898,0.00009254401,0.0001295858,0.0000064017822,0.0160391,0.094659306,0.031865418,0.27051637,0.0016802677,0.58002096],"study_design_scores_gemma":[0.0001253846,0.0015066745,0.00017281638,0.00020181085,0.000032140717,0.000012800653,0.011170292,0.5936064,0.17277318,0.21976218,0.00024518854,0.00039112612],"about_ca_topic_score_codex":0.00002779113,"about_ca_topic_score_gemma":0.000020339292,"teacher_disagreement_score":0.79120964,"about_ca_system_score_codex":0.00009238192,"about_ca_system_score_gemma":0.00024114522,"threshold_uncertainty_score":0.9911114},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9250865,0.00016235086,0.0033445954,0.05275259,0.0011034018,0.00080507185,0.00020760173,0.00013920877,0.016398698],"genre_scores_gemma":[0.9985998,0.00003576976,0.000073159536,0.0006764961,0.00029473018,0.0000247348,0.0000017700103,0.00001961922,0.00027389303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982171,0.000018193809,0.0009150728,0.0004499919,0.000111397,0.0002882684],"domain_scores_gemma":[0.9986419,0.0001482289,0.00076666294,0.00021213193,0.00014137341,0.00008971977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068756787,0.00020302905,0.00039278262,0.00006036165,0.00022742302,0.000168424,0.0010179166,0.00010013665,0.00036181218],"category_scores_gemma":[0.0012178266,0.0001458819,0.00016574521,0.0004484908,0.00019821958,0.00013167264,0.00012620396,0.0003815283,0.00037508694],"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.00010343058,0.000050385235,0.013500344,0.00003814827,0.000040989766,1.2888454e-7,0.0040722145,0.000041072613,0.004091947,0.97442687,0.00021776398,0.0034167154],"study_design_scores_gemma":[0.00006901874,0.0002688741,0.002465602,0.00013526861,0.000020536998,0.000001539149,0.0023010024,0.02553938,0.0844977,0.8823952,0.0019610475,0.0003448355],"about_ca_topic_score_codex":0.00053232035,"about_ca_topic_score_gemma":0.000041731582,"teacher_disagreement_score":0.09203166,"about_ca_system_score_codex":0.00004675004,"about_ca_system_score_gemma":0.000024544794,"threshold_uncertainty_score":0.5948891},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42714646,0.00006550354,0.5609885,0.0067683784,0.00031995302,0.0007060154,0.0000018430668,0.00013219604,0.0038711869],"genre_scores_gemma":[0.9955352,0.000013592622,0.003754855,0.00013800149,0.00010425123,0.000038747912,3.1591264e-7,0.00001399886,0.000401061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800605,0.000034964058,0.00050224306,0.0005704494,0.00056475186,0.00032151962],"domain_scores_gemma":[0.998804,0.00008067536,0.00030891277,0.00013667536,0.0005687996,0.0001009369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037614506,0.00022209645,0.00027119604,0.00011209855,0.00017282335,0.00023100627,0.0013402648,0.000060888226,0.000018018416],"category_scores_gemma":[0.0003533239,0.00016128003,0.000072824965,0.00061078457,0.00009143498,0.00042991937,0.00029296207,0.00058254885,0.00004452946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108197935,0.00024392684,0.009411515,0.000063004,0.000033479046,0.0000014106848,0.024471367,0.10276864,0.012385179,0.8411382,0.000009201567,0.009365871],"study_design_scores_gemma":[0.000053030915,0.0004140629,0.00087123073,0.00053229183,0.000007221599,0.0000029167174,0.004714152,0.9630285,0.026578888,0.0034644015,0.0000913324,0.00024200126],"about_ca_topic_score_codex":0.00006851744,"about_ca_topic_score_gemma":0.000008573265,"teacher_disagreement_score":0.86025983,"about_ca_system_score_codex":0.000074163385,"about_ca_system_score_gemma":0.0001517007,"threshold_uncertainty_score":0.65768087},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003314025,0.000013926431,0.9685884,0.024609173,0.00013458137,0.0006019513,0.0000027323508,0.00015280697,0.0025823896],"genre_scores_gemma":[0.97425467,0.000016058662,0.025158208,0.000365343,0.00006301748,0.000054932196,0.0000037137024,0.000011024464,0.000073058654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845284,0.000031015286,0.00046947954,0.0005217739,0.00027072013,0.00025417042],"domain_scores_gemma":[0.9989103,0.00013922006,0.00035016905,0.00017162833,0.00034850108,0.00008019325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047385928,0.00016559318,0.00020587773,0.0000897283,0.00015667052,0.00020940341,0.0013000582,0.00007842221,0.000036106416],"category_scores_gemma":[0.0022808837,0.0001300199,0.00006855256,0.0006804576,0.00010075002,0.0003619701,0.00019252083,0.00032937297,0.000021105598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073839365,0.00006760152,0.0006425793,0.00010387608,0.000004542464,1.7252144e-7,0.0013695424,0.029016228,0.0052129314,0.8961311,0.000077649805,0.067299925],"study_design_scores_gemma":[0.000036312867,0.0002195185,0.00013750188,0.000084189145,0.0000055162186,7.7349273e-7,0.00015702755,0.93569833,0.011887033,0.051420096,0.00020915376,0.00014454707],"about_ca_topic_score_codex":0.0000138568175,"about_ca_topic_score_gemma":0.0000038950643,"teacher_disagreement_score":0.9709406,"about_ca_system_score_codex":0.000035295394,"about_ca_system_score_gemma":0.0000875227,"threshold_uncertainty_score":0.5302058},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09308951,0.000069899186,0.85121626,0.039714374,0.0024470538,0.0035339654,0.00014882398,0.000319023,0.009461112],"genre_scores_gemma":[0.9963988,0.0000083577615,0.0019401257,0.00040937957,0.00046304258,0.00004746302,0.0000017718356,0.00003664723,0.0006943809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9932614,0.000079290476,0.0014040279,0.0012645954,0.0032479595,0.00074272935],"domain_scores_gemma":[0.9946414,0.0011215553,0.0007771945,0.000520891,0.002527823,0.00041112152],"candidate_categories":["metaresearch","metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0016902316,0.00042500775,0.00066283945,0.00024230653,0.0004461524,0.000673947,0.0036119923,0.00019033819,0.0013521131],"category_scores_gemma":[0.013773177,0.00028781875,0.00028186146,0.0023130532,0.0012301783,0.0006436964,0.00080375216,0.00081844046,0.001071697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029020074,0.0009754285,0.00016390703,0.0001519095,0.00018298064,0.000009917344,0.0076117557,0.37013766,0.019619571,0.43383425,0.006590581,0.15782005],"study_design_scores_gemma":[0.00016210169,0.0006208702,0.00014871228,0.00012456972,0.00003567132,0.000007014631,0.0038535995,0.5632754,0.03220922,0.39874128,0.00034406214,0.00047750672],"about_ca_topic_score_codex":0.00002751723,"about_ca_topic_score_gemma":0.000018828312,"teacher_disagreement_score":0.90330935,"about_ca_system_score_codex":0.0001503396,"about_ca_system_score_gemma":0.0003875942,"threshold_uncertainty_score":0.9999574},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065579385,0.000027781305,0.9076002,0.013889269,0.00047476325,0.00071614457,0.0000034347197,0.00026603616,0.011442969],"genre_scores_gemma":[0.99252486,0.000018425444,0.0059352955,0.001148378,0.0001421615,0.000015665339,5.9966794e-7,0.000011794126,0.00020283228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830407,0.000025446274,0.00038374486,0.00048451076,0.00042212047,0.00038013372],"domain_scores_gemma":[0.99894243,0.00015231934,0.00017150147,0.0001336924,0.00044964708,0.00015038246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049412047,0.00019402608,0.00025602884,0.000045973553,0.0009867039,0.00018813285,0.0017431495,0.000080268444,0.000069632515],"category_scores_gemma":[0.00048317932,0.00016115855,0.00017630722,0.00062368193,0.00014671113,0.00037977938,0.0006636597,0.00038477714,0.000052035637],"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.00013791546,0.000043669934,0.0007684461,0.000045524444,0.000020057147,3.428773e-7,0.008983558,0.003171059,0.0075344434,0.9411345,0.00029979672,0.037860684],"study_design_scores_gemma":[0.00016321143,0.0009035384,0.0006608364,0.00020169909,0.000040870797,0.0000027805556,0.0023907404,0.7556307,0.12298446,0.110278636,0.006122415,0.0006201272],"about_ca_topic_score_codex":0.000012439291,"about_ca_topic_score_gemma":0.0000035198468,"teacher_disagreement_score":0.92694545,"about_ca_system_score_codex":0.00002419424,"about_ca_system_score_gemma":0.000059710426,"threshold_uncertainty_score":0.75890285},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9803373,0.00005760133,0.0032956712,0.0023798996,0.0002454727,0.00032254777,0.000019280313,0.000018042343,0.013324181],"genre_scores_gemma":[0.9998292,0.000016915728,0.00003303224,0.00007368647,0.000014962784,0.0000069192697,5.5693107e-7,0.0000033517538,0.000021408869],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868935,0.000011760689,0.0009096778,0.00015726792,0.00007640744,0.00015554548],"domain_scores_gemma":[0.9987997,0.00009494503,0.0007435665,0.00011548004,0.000215469,0.00003086573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013076387,0.000095113086,0.00021773847,0.00006796756,0.00010275646,0.00008830458,0.00048329888,0.000056333276,0.00003358994],"category_scores_gemma":[0.0016574088,0.00007381714,0.0000593865,0.0004626382,0.00014447654,0.00035462377,0.000071847724,0.00017208444,0.00011982835],"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.00008335906,0.000023604387,0.005326897,0.00007411937,0.000006587519,1.699476e-8,0.007024623,0.00020999537,0.0014318769,0.9812822,0.000021525506,0.004515229],"study_design_scores_gemma":[0.00013248346,0.00038168285,0.008513707,0.00056515355,0.000009128604,0.0000015695557,0.019355308,0.06394298,0.3353428,0.56949437,0.0017566447,0.0005041754],"about_ca_topic_score_codex":0.00010779516,"about_ca_topic_score_gemma":0.000006611793,"teacher_disagreement_score":0.4117878,"about_ca_system_score_codex":0.00003500316,"about_ca_system_score_gemma":0.00002289643,"threshold_uncertainty_score":0.30101752},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054830927,0.00010766185,0.936061,0.0074568717,0.0004771652,0.00054060307,0.0000064515584,0.000057186546,0.0004621282],"genre_scores_gemma":[0.9791396,0.00001946837,0.019614156,0.0008984662,0.0002705731,0.000035299512,8.6273303e-7,0.00001645482,0.0000050756703],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758816,0.00012834568,0.0007163594,0.0006540252,0.0005040825,0.00040900518],"domain_scores_gemma":[0.99752575,0.00025003756,0.000646897,0.00034792637,0.0010854496,0.00014395996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049790996,0.00034416438,0.00044467114,0.000058496462,0.00080569106,0.00076150487,0.0019281792,0.00008418249,0.000034989927],"category_scores_gemma":[0.0005294094,0.00021688285,0.00016817718,0.0007991151,0.001137454,0.000576995,0.00048443652,0.00041250227,0.00000585303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010520103,0.00009684417,0.00006608712,0.000015009732,0.00005589935,6.4457515e-7,0.022316221,0.47982317,0.050572284,0.42085177,0.000046744815,0.026050135],"study_design_scores_gemma":[0.000024185716,0.00022332337,0.000028524539,0.000033377608,0.000015604888,0.0000012009334,0.0028144582,0.6799683,0.30864087,0.008066021,0.000020045294,0.00016413533],"about_ca_topic_score_codex":0.00003180871,"about_ca_topic_score_gemma":0.00002456533,"teacher_disagreement_score":0.9243087,"about_ca_system_score_codex":0.000033965738,"about_ca_system_score_gemma":0.00012712376,"threshold_uncertainty_score":0.8844226},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036144935,0.000018185814,0.939642,0.022609537,0.00019394903,0.00075206347,0.000016134882,0.00017476674,0.0004484175],"genre_scores_gemma":[0.9795436,0.00000457793,0.019533372,0.00060305314,0.00015424869,0.00010068441,0.0000014993028,0.000018265684,0.000040665964],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982549,0.000011701234,0.00037739085,0.0005055133,0.00049860607,0.00035190425],"domain_scores_gemma":[0.99879694,0.00024206346,0.00012633057,0.00021808178,0.000474627,0.00014196972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031362276,0.00020614485,0.00022177777,0.000102732105,0.00014122258,0.00020135772,0.001751309,0.000086240274,0.000023156068],"category_scores_gemma":[0.0010295131,0.0001568569,0.00016106931,0.0006628483,0.0001223808,0.0002031606,0.00007002766,0.00027423055,0.000023187418],"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.00019887189,0.00013290791,0.00018268231,0.00018447087,0.000027758439,5.255069e-7,0.0028014167,0.0050296984,0.46830535,0.29806465,0.0008297429,0.22424191],"study_design_scores_gemma":[0.000044415032,0.000293637,0.000046773133,0.000040833133,0.0000058734104,5.98926e-7,0.000034406763,0.3645267,0.62860155,0.0058954074,0.0003755529,0.00013428468],"about_ca_topic_score_codex":0.0000067241203,"about_ca_topic_score_gemma":0.0000132520945,"teacher_disagreement_score":0.9433987,"about_ca_system_score_codex":0.000035530767,"about_ca_system_score_gemma":0.00015300096,"threshold_uncertainty_score":0.6396439},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6668225,0.000031366148,0.3187821,0.009777927,0.0006015523,0.00061337475,0.0000066336243,0.00016200884,0.003202555],"genre_scores_gemma":[0.9828137,0.000033237688,0.016442092,0.0005314452,0.00006047098,0.000024361016,6.594346e-7,0.000009024788,0.00008499334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980869,0.00002567684,0.00057676766,0.0005382863,0.0004441371,0.00032818408],"domain_scores_gemma":[0.9990373,0.000053020623,0.0002770819,0.00019662589,0.0003422846,0.00009364079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043514415,0.00019289808,0.00023945843,0.00012146869,0.00011817722,0.00030827775,0.0016100698,0.000072123854,0.0000739305],"category_scores_gemma":[0.0004815212,0.0001682903,0.00009207448,0.00053547445,0.00011267352,0.00078336924,0.0004997496,0.00034467148,0.00010109002],"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.000120909805,0.00033206548,0.004745659,0.0002794524,0.0000396318,0.000004437419,0.031777356,0.0005605086,0.07775555,0.49455553,0.00013164734,0.38969725],"study_design_scores_gemma":[0.000096417716,0.00008972857,0.00061257556,0.0003361855,0.000009013851,0.0000023283674,0.0018309738,0.42785707,0.44730738,0.121474996,0.000054521824,0.0003288109],"about_ca_topic_score_codex":0.00017043257,"about_ca_topic_score_gemma":0.000030488867,"teacher_disagreement_score":0.42729658,"about_ca_system_score_codex":0.00006529487,"about_ca_system_score_gemma":0.000082490944,"threshold_uncertainty_score":0.6862679},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15719093,0.000067821224,0.8213138,0.018161928,0.0006619019,0.000990135,0.0000048987745,0.00038226935,0.0012263213],"genre_scores_gemma":[0.96812624,0.000039337036,0.030503519,0.0010866601,0.00015658437,0.00002912308,6.268437e-7,0.000019587986,0.0000383004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975576,0.000031811713,0.00051967637,0.00073816907,0.0006049341,0.000547848],"domain_scores_gemma":[0.9985725,0.00010224569,0.00032750375,0.00030580626,0.000454162,0.00023777764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002181491,0.00030641776,0.00031991687,0.00007086475,0.0002692723,0.00022950035,0.0021382247,0.000094243595,0.00002099354],"category_scores_gemma":[0.00018108856,0.00021383139,0.00016115255,0.0014068887,0.00041281257,0.0005429893,0.00045702895,0.00059845415,0.000049116545],"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.00024498842,0.00021438288,0.0020345463,0.00007340454,0.000043436605,0.000005303037,0.0010142623,0.0025278286,0.03741798,0.9134746,0.00032563158,0.042623606],"study_design_scores_gemma":[0.00021073996,0.0016043846,0.0041034,0.00080093415,0.000059280697,0.000024390118,0.0004523215,0.64607286,0.109974295,0.23534933,0.00029861665,0.0010494248],"about_ca_topic_score_codex":0.000005988029,"about_ca_topic_score_gemma":0.0000063696334,"teacher_disagreement_score":0.8109353,"about_ca_system_score_codex":0.000026557871,"about_ca_system_score_gemma":0.000054743185,"threshold_uncertainty_score":0.87197906},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034580253,0.000020905249,0.9071784,0.04434573,0.00019636874,0.00045984908,0.000002573933,0.00034337808,0.012872552],"genre_scores_gemma":[0.9852633,0.000004700887,0.013017108,0.0015617799,0.00009869202,0.000029870022,4.665084e-7,0.0000099586305,0.000014162095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982907,0.000023242414,0.0004141617,0.00056282204,0.00039322753,0.00031580692],"domain_scores_gemma":[0.99860084,0.000091414586,0.00037965484,0.00033166027,0.00043148475,0.000164952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022883079,0.00020513176,0.00021587963,0.000034749886,0.00023130803,0.0002463126,0.0025872597,0.00008656694,0.000022786237],"category_scores_gemma":[0.0006992504,0.00016426256,0.00012084574,0.0011328578,0.0001860894,0.00021320881,0.00036162866,0.00038282893,0.00008412056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032536605,0.000054127868,0.0029196795,0.000015783433,0.000006911227,4.5836208e-7,0.00027878897,0.006987311,0.0009589098,0.93941456,0.00019219915,0.049138762],"study_design_scores_gemma":[0.000024660538,0.00010974645,0.0014949437,0.000097861215,0.000007534641,0.0000023107102,0.000063746156,0.9589363,0.013455164,0.02550786,0.00012261029,0.00017730244],"about_ca_topic_score_codex":0.000105393745,"about_ca_topic_score_gemma":0.0000033420963,"teacher_disagreement_score":0.95194894,"about_ca_system_score_codex":0.000049884246,"about_ca_system_score_gemma":0.00010996423,"threshold_uncertainty_score":0.66984326},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91104263,0.000011034841,0.014521196,0.025342887,0.00029998284,0.00068555627,0.00005806315,0.000053232696,0.047985427],"genre_scores_gemma":[0.99898463,0.0000123467225,0.00049101235,0.00026280488,0.00004252145,0.000009816721,6.867062e-7,0.0000057471148,0.00019040838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979752,0.000046199308,0.00069612195,0.0004115651,0.0007307597,0.00014019306],"domain_scores_gemma":[0.996716,0.000865897,0.00068051537,0.0002586336,0.0013857738,0.000093136725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007433022,0.00013161924,0.00026195674,0.000076650984,0.0001906708,0.000103424645,0.001159125,0.000051358613,0.00033515014],"category_scores_gemma":[0.0069117583,0.00008557806,0.00011649458,0.0012616636,0.00061021344,0.00019557787,0.00016100933,0.00020638271,0.00033302227],"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.00025226217,0.000121281635,0.00071269507,0.000007315874,0.000009834535,2.9809335e-8,0.00303408,0.00045217163,0.017333377,0.96100026,0.00032617955,0.01675049],"study_design_scores_gemma":[0.000017078424,0.0002943986,0.0009597536,0.000045590947,0.000010509116,1.6885657e-7,0.0071356297,0.012201433,0.4311487,0.5474785,0.00060903816,0.00009922002],"about_ca_topic_score_codex":0.000010295604,"about_ca_topic_score_gemma":0.0000052435757,"teacher_disagreement_score":0.41381532,"about_ca_system_score_codex":0.000015626967,"about_ca_system_score_gemma":0.000064735206,"threshold_uncertainty_score":0.82745194},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008488407,0.000012492219,0.9680168,0.019300504,0.0003241603,0.0006362228,0.00005685246,0.0001439345,0.0030205972],"genre_scores_gemma":[0.918912,0.0000150237265,0.07939017,0.0014207999,0.00011328478,0.000046199548,0.0000044300295,0.000013753567,0.00008433865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984505,0.000010234589,0.00043607547,0.0004745362,0.0003178128,0.00031080062],"domain_scores_gemma":[0.998759,0.00015975705,0.000280577,0.0001753037,0.0004842107,0.0001411616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028347585,0.000189442,0.0002347017,0.00006084646,0.00021741088,0.00021194495,0.0014897945,0.00007486794,0.00019635094],"category_scores_gemma":[0.0008186056,0.00014296494,0.00014468064,0.00042565993,0.000098432865,0.0004275755,0.0003210586,0.00020867187,0.00008139029],"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.00036972994,0.00018047729,0.00032987577,0.0001696591,0.00003560649,5.1639034e-7,0.0032396277,0.0004669845,0.10568303,0.5767834,0.004843443,0.30789763],"study_design_scores_gemma":[0.000059086327,0.00041994924,0.000065252905,0.0001354837,0.000013157904,0.0000017194342,0.0003348118,0.4005199,0.5644923,0.03226091,0.0014557634,0.00024169382],"about_ca_topic_score_codex":0.000027276536,"about_ca_topic_score_gemma":0.000004319859,"teacher_disagreement_score":0.9104236,"about_ca_system_score_codex":0.000014118597,"about_ca_system_score_gemma":0.00006268762,"threshold_uncertainty_score":0.5829941},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.611513,0.00030984735,0.37476665,0.0073012793,0.00040482613,0.0040358016,0.000064441,0.00012215729,0.0014819866],"genre_scores_gemma":[0.9852248,0.000055697892,0.014453242,0.00013090679,0.00005859437,0.00004349674,0.000009558417,0.000012030037,0.000011708649],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99876124,0.000016782997,0.0003896853,0.00028252628,0.00040039935,0.00014934612],"domain_scores_gemma":[0.9988158,0.00006166169,0.00023576568,0.00008008093,0.0007060914,0.00010064545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034881334,0.00014565988,0.00027826705,0.000039496746,0.00009704917,0.000030077432,0.00011134329,0.000055023134,0.000019379038],"category_scores_gemma":[0.0010742417,0.000104836414,0.00013245238,0.0001693243,0.00016121326,0.00014555517,0.000044197484,0.000100696365,0.0000037553305],"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.002800368,0.0007784997,0.010031131,0.0017084659,0.00024245205,3.2646255e-7,0.004926546,0.0019108533,0.48296335,0.07305556,0.00051772094,0.42106473],"study_design_scores_gemma":[0.00022585539,0.0007338973,0.00408143,0.00077226234,0.00022528827,0.0000017521222,0.001321745,0.36584693,0.6242072,0.0024333887,0.000016770657,0.0001334708],"about_ca_topic_score_codex":0.000007936209,"about_ca_topic_score_gemma":0.0000038690523,"teacher_disagreement_score":0.42093125,"about_ca_system_score_codex":0.000028849396,"about_ca_system_score_gemma":0.00005505585,"threshold_uncertainty_score":0.42751047},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24261178,0.000041886433,0.7339831,0.020910218,0.00030828113,0.0010830485,0.00003282682,0.00019775369,0.00083107],"genre_scores_gemma":[0.92104554,0.000013813689,0.077816434,0.0009700486,0.0000743319,0.000039654034,0.0000010760491,0.00001389655,0.000025202271],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804735,0.000023801027,0.00047247013,0.0006024726,0.00043085698,0.00042302904],"domain_scores_gemma":[0.9985587,0.00019549699,0.00023331947,0.00020306365,0.00059275347,0.00021665722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051321706,0.00023247015,0.0003218141,0.000085236934,0.00019804,0.0002922964,0.001363092,0.00009354241,0.000016718612],"category_scores_gemma":[0.0005235474,0.00018624119,0.000103170656,0.0004555607,0.0005734224,0.00023208161,0.00025462045,0.00024700025,0.000029382247],"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.00025317253,0.00011037671,0.0003117731,0.00015387431,0.000037658625,0.0000016924009,0.0033481214,0.0028115886,0.18542899,0.73438805,0.00043567587,0.07271901],"study_design_scores_gemma":[0.00007206715,0.00024159101,0.000058372905,0.00006969643,0.000008472745,0.0000020974906,0.00011514047,0.5405444,0.45590565,0.0027619025,0.00007331885,0.00014730153],"about_ca_topic_score_codex":0.000011215089,"about_ca_topic_score_gemma":4.0933003e-7,"teacher_disagreement_score":0.73162615,"about_ca_system_score_codex":0.000020603175,"about_ca_system_score_gemma":0.00017296585,"threshold_uncertainty_score":0.7594695},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43648985,0.00025187302,0.3937884,0.12352434,0.0014170979,0.0017155727,0.000036191617,0.00089535286,0.041881327],"genre_scores_gemma":[0.9916532,0.000027677605,0.0074642915,0.00069561723,0.00007222519,0.000015691041,5.6923074e-7,0.000008514205,0.000062195366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986422,0.000012190034,0.00034405256,0.0004169358,0.00024999227,0.00033459588],"domain_scores_gemma":[0.9989777,0.00017193393,0.00022895659,0.00016806905,0.00036023598,0.00009309034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024211538,0.00017614731,0.00028732064,0.00006539908,0.00012331155,0.00013163438,0.0017697196,0.00010021939,0.00003076357],"category_scores_gemma":[0.001018901,0.00013267432,0.000110806,0.00038904682,0.00017926456,0.00037380145,0.00025776576,0.0001874206,0.000026237014],"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.00011278597,0.000056648107,0.00024226028,0.00007918555,0.000024174205,0.0000017931175,0.0032631827,0.000031830976,0.056979936,0.8990436,0.0003510218,0.03981356],"study_design_scores_gemma":[0.00008460067,0.00050544087,0.00045399836,0.00011850753,0.000022460354,0.000005707531,0.004027246,0.11466424,0.8355686,0.04342627,0.0008048855,0.00031805856],"about_ca_topic_score_codex":0.000099469355,"about_ca_topic_score_gemma":0.000030632113,"teacher_disagreement_score":0.85561734,"about_ca_system_score_codex":0.000026615338,"about_ca_system_score_gemma":0.00012756904,"threshold_uncertainty_score":0.54103017},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06873279,0.00035503408,0.889538,0.02904356,0.00036402175,0.0013811324,0.0000071689274,0.0016898415,0.008888447],"genre_scores_gemma":[0.97540617,0.000016709748,0.023721848,0.0006751475,0.000064608044,0.00001997027,0.0000013099242,0.000016412585,0.00007779886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979891,0.000027274811,0.0005152051,0.0005461811,0.00059775624,0.0003244689],"domain_scores_gemma":[0.9987988,0.000070122376,0.00039479954,0.00020383304,0.00041420746,0.00011822517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003094911,0.00027182206,0.0002693858,0.00010612718,0.00021367193,0.00029409752,0.0020246813,0.00011122767,0.000022977996],"category_scores_gemma":[0.0004412306,0.00019723632,0.00013310357,0.00079056545,0.00012647355,0.0008407751,0.00023709032,0.0006823653,0.000017975502],"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.00011503861,0.000042851345,0.00002326509,0.000066213746,0.000009188113,9.394425e-7,0.003821531,0.004046966,0.05626677,0.747224,0.000042626954,0.18834066],"study_design_scores_gemma":[0.000023840854,0.00030671124,0.0000033863203,0.00011503598,0.000005933233,0.00000192762,0.000087557695,0.690174,0.25884962,0.05025624,0.000012783491,0.0001629754],"about_ca_topic_score_codex":0.000037524293,"about_ca_topic_score_gemma":0.0000018685653,"teacher_disagreement_score":0.90667343,"about_ca_system_score_codex":0.000032074327,"about_ca_system_score_gemma":0.000050463277,"threshold_uncertainty_score":0.8043064},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22239812,0.0000914336,0.76792485,0.006467239,0.00030554715,0.00066092634,0.000003980229,0.00019152544,0.0019563644],"genre_scores_gemma":[0.982198,0.000011839791,0.017227361,0.00034365113,0.000112880094,0.00003387922,2.5218762e-7,0.00001268402,0.000059468868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983278,0.0000218122,0.00042198927,0.0005946538,0.00031218491,0.0003215583],"domain_scores_gemma":[0.9988009,0.00020071433,0.0002928596,0.00014246245,0.00043599503,0.00012710325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039873624,0.00020623965,0.0002725948,0.000065428605,0.00028312413,0.0001974255,0.0010020674,0.00007734024,0.000004955955],"category_scores_gemma":[0.0010575758,0.00016580021,0.00008850532,0.00033704785,0.00014592487,0.00040695164,0.0004269585,0.0003715677,0.0000082587585],"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.00020051902,0.0000478626,0.0012008242,0.00007932937,0.00003130506,8.346688e-7,0.018069515,0.0029520572,0.021260114,0.870444,0.00008534608,0.08562827],"study_design_scores_gemma":[0.00004720608,0.00040687737,0.0001265088,0.00016250933,0.000012287159,0.0000016801101,0.0018546553,0.8909321,0.08022455,0.025840018,0.00018551668,0.0002060739],"about_ca_topic_score_codex":0.000028835271,"about_ca_topic_score_gemma":0.0000022864126,"teacher_disagreement_score":0.88798004,"about_ca_system_score_codex":0.000023284594,"about_ca_system_score_gemma":0.00005345184,"threshold_uncertainty_score":0.6761136},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044641957,0.000016888085,0.88955826,0.027725834,0.00033013267,0.0006474149,6.381695e-7,0.00041349127,0.036665395],"genre_scores_gemma":[0.9898702,0.000010710578,0.0090144295,0.0007051555,0.000104576284,0.000015196059,3.5180256e-7,0.000017350942,0.00026205654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99786294,0.000028393612,0.0004552583,0.0005565387,0.0007350211,0.00036182348],"domain_scores_gemma":[0.99855554,0.000090095324,0.00045458146,0.00023959386,0.00051580823,0.00014437397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037554654,0.00025440913,0.00028369832,0.000072143586,0.00029255854,0.00024964692,0.0022329763,0.00007438039,0.00008798148],"category_scores_gemma":[0.0009574544,0.00017373933,0.00009541365,0.00082577777,0.00021680306,0.0005000687,0.00063826016,0.0006888905,0.000075464384],"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.000201974,0.00004143079,0.0005577088,0.000059183694,0.00003050019,0.000002074113,0.0063264417,0.048335083,0.0126929395,0.89673257,0.00010393372,0.034916166],"study_design_scores_gemma":[0.0000665672,0.00078827154,0.00009183104,0.00020812354,0.000018119352,0.0000055464725,0.0010922228,0.83274597,0.15342389,0.010628396,0.0005876504,0.00034341493],"about_ca_topic_score_codex":0.000024667232,"about_ca_topic_score_gemma":0.0000014993861,"teacher_disagreement_score":0.9452282,"about_ca_system_score_codex":0.000046199635,"about_ca_system_score_gemma":0.00012103673,"threshold_uncertainty_score":0.7084884},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022428172,0.000007308977,0.88604474,0.047707748,0.00029546765,0.00071675197,0.000010888697,0.00037910123,0.04240981],"genre_scores_gemma":[0.9947759,0.0000140422335,0.0042700735,0.00054384256,0.00008995204,0.000023341925,5.208475e-7,0.0000075546304,0.00027475125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987588,0.000016389586,0.00031280756,0.00040925774,0.00031776438,0.00018501155],"domain_scores_gemma":[0.9989525,0.00004802468,0.00028153652,0.00017817438,0.00044599402,0.00009378156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016188281,0.0001528091,0.00015808044,0.00006143869,0.00021003993,0.00014221008,0.0014210155,0.00007483038,0.00005318418],"category_scores_gemma":[0.00018006958,0.000119587625,0.00010583091,0.0006546553,0.00019535417,0.00045219206,0.0003196608,0.0002430193,0.000064099615],"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.000024896912,0.0000445548,0.000012710463,0.0000092312275,0.000006320602,1.3321062e-7,0.0015721652,0.000019631694,0.024975233,0.9383988,0.0003228653,0.03461351],"study_design_scores_gemma":[0.000033701763,0.0003452396,0.000120866825,0.00004739632,0.000015198834,0.0000016470719,0.0013655936,0.17040691,0.6409893,0.18492317,0.0015295431,0.0002214177],"about_ca_topic_score_codex":0.000018531655,"about_ca_topic_score_gemma":0.000002324541,"teacher_disagreement_score":0.97234774,"about_ca_system_score_codex":0.000049963513,"about_ca_system_score_gemma":0.0000714619,"threshold_uncertainty_score":0.4876642},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9793294,0.000021085323,0.015601261,0.0004044032,0.000037103015,0.00022178002,0.000004096309,0.000039650185,0.004341194],"genre_scores_gemma":[0.9994901,0.000014199182,0.00034832105,0.000027457634,0.00008230077,0.000009948534,2.7344774e-7,0.000009888194,0.000017539505],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989854,0.000009100256,0.00038490747,0.00025768374,0.00019270927,0.0001701984],"domain_scores_gemma":[0.99918216,0.00003977476,0.00032058,0.00010025126,0.00029414904,0.000063082945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016471729,0.00013960703,0.00024297742,0.00006768013,0.00009723774,0.0000522708,0.0003396763,0.000030164609,0.00008002374],"category_scores_gemma":[0.00004735006,0.00011342926,0.00011387436,0.00046531355,0.00019508235,0.00010571468,0.00016851102,0.00017956174,0.0000056059125],"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.00009796739,0.0000752775,0.0119790705,0.00004751817,0.00004875612,6.4326464e-8,0.00094231794,0.00003174449,0.5375299,0.23942788,0.000022030717,0.2097975],"study_design_scores_gemma":[0.000015323678,0.000113494134,0.00043239997,0.000106266205,0.000035412,2.3213777e-7,0.00094213174,0.015682483,0.924435,0.058102455,0.000025003183,0.00010977909],"about_ca_topic_score_codex":0.00010972667,"about_ca_topic_score_gemma":0.000007518393,"teacher_disagreement_score":0.38690516,"about_ca_system_score_codex":0.000006958459,"about_ca_system_score_gemma":0.000017865257,"threshold_uncertainty_score":0.46255112},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48253635,0.000030238623,0.5024101,0.008624053,0.00024340421,0.00034867003,0.000010442095,0.00012929644,0.0056674685],"genre_scores_gemma":[0.9856229,0.000016934591,0.014125351,0.00015875573,0.000037051057,0.000008026858,6.8126775e-7,0.000007330511,0.000023014418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980707,0.000021770284,0.00059956824,0.00048660886,0.0005968879,0.00022443236],"domain_scores_gemma":[0.9982841,0.0002065254,0.00051128195,0.00033848043,0.0005454806,0.0001141246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003998864,0.00018120554,0.0002623382,0.00009416018,0.00011720486,0.00013275382,0.0023435785,0.00007146547,0.00005082191],"category_scores_gemma":[0.001669609,0.00013100571,0.00010610134,0.000828559,0.00021320328,0.0001721267,0.00052210846,0.00028343097,0.00007713691],"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.0000901627,0.00009854845,0.00050693314,0.000035599016,0.000007580137,1.9718523e-7,0.0019055047,0.0040258863,0.06377737,0.7786028,0.00008358368,0.15086585],"study_design_scores_gemma":[0.000030789724,0.00028153125,0.0011471994,0.0001498418,0.000007970924,0.0000010394997,0.00028805397,0.7192427,0.2680939,0.0104806665,0.00012694435,0.00014936448],"about_ca_topic_score_codex":0.000024398327,"about_ca_topic_score_gemma":0.000002458497,"teacher_disagreement_score":0.76812214,"about_ca_system_score_codex":0.000017573619,"about_ca_system_score_gemma":0.00009463113,"threshold_uncertainty_score":0.53422576},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37565985,0.000054408876,0.4983231,0.096530795,0.001373588,0.0012428198,0.0000035452156,0.0022392236,0.024572657],"genre_scores_gemma":[0.99564767,0.000025660283,0.003589393,0.0002927013,0.000048131627,0.000028129514,3.4010674e-7,0.000009615615,0.00035834295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99849266,0.000014587533,0.0003436798,0.00046380714,0.0004247311,0.00026056118],"domain_scores_gemma":[0.99890774,0.00006181883,0.00034998276,0.00019382162,0.00040850413,0.00007814398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019670793,0.00018065966,0.00019266007,0.00006815733,0.00022928882,0.0002881696,0.0015125892,0.000082893835,0.00004232773],"category_scores_gemma":[0.0004644689,0.00012606548,0.000041900832,0.0008986824,0.00023178634,0.00050343643,0.00030398,0.00041241583,0.00012578603],"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.000091803806,0.00011202434,0.0008126945,0.000019625646,0.00001346318,4.0061207e-7,0.0015033431,0.00007222029,0.051627457,0.7457023,0.0005376262,0.199507],"study_design_scores_gemma":[0.000055584784,0.0006459429,0.000113075934,0.000081060665,0.000009863948,0.0000025897975,0.0011630473,0.23511957,0.7455462,0.016302891,0.00075246557,0.00020769634],"about_ca_topic_score_codex":0.000014953189,"about_ca_topic_score_gemma":0.000002389584,"teacher_disagreement_score":0.72939944,"about_ca_system_score_codex":0.000028070463,"about_ca_system_score_gemma":0.000071899776,"threshold_uncertainty_score":0.5140801},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16906773,0.0000633033,0.8161278,0.008970762,0.00067605556,0.0010985547,0.0000039082183,0.00022496242,0.0037669218],"genre_scores_gemma":[0.99768585,0.000049514292,0.0016327407,0.00035684195,0.0001593234,0.000029738387,0.0000014547942,0.000013564109,0.0000709827],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99766904,0.000050969666,0.0006661885,0.00057923933,0.00072264124,0.0003119212],"domain_scores_gemma":[0.99846214,0.0001006082,0.00040562416,0.00025999994,0.00062191195,0.00014968587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006594174,0.0002237923,0.00029800943,0.00009859859,0.00028376983,0.00034046284,0.0015096962,0.00010195624,0.000054071756],"category_scores_gemma":[0.00038489146,0.00016620875,0.00012622711,0.00061696686,0.0000991865,0.0009946058,0.0003873798,0.00020856397,0.00020674222],"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.00024624894,0.00010888414,0.0009818983,0.00012219646,0.000024166538,9.184303e-7,0.0111748595,0.0006278165,0.72800577,0.1806965,0.0004277882,0.07758294],"study_design_scores_gemma":[0.00007658694,0.00009758722,0.0001401792,0.00014734318,0.000006710515,0.0000016471163,0.0004069708,0.37408507,0.6210046,0.00373164,0.00014987939,0.00015179999],"about_ca_topic_score_codex":0.00006452523,"about_ca_topic_score_gemma":0.0000043476102,"teacher_disagreement_score":0.8286181,"about_ca_system_score_codex":0.000042472377,"about_ca_system_score_gemma":0.00006109732,"threshold_uncertainty_score":0.67777956},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32947853,0.000102706625,0.37757987,0.09654629,0.0013037972,0.0013119717,0.00000631809,0.001238675,0.19243184],"genre_scores_gemma":[0.9939589,0.000014200859,0.004402552,0.0010149677,0.00011222902,0.000008539853,3.349897e-7,0.000011884389,0.00047642255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99816084,0.000035254,0.00046985009,0.0004714927,0.00054669194,0.00031586643],"domain_scores_gemma":[0.9987586,0.00011091884,0.0003678181,0.00015363566,0.00046016177,0.00014887252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043542116,0.00018754488,0.00023961745,0.000069490816,0.00024785296,0.0003315926,0.001754811,0.000072943396,0.00012018398],"category_scores_gemma":[0.0012020089,0.0001490678,0.0000998429,0.0006706677,0.00019164133,0.00042504276,0.0004095258,0.0005300545,0.00026901925],"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.00005299094,0.000037290763,0.00027549718,0.000019115232,0.000010539827,8.657245e-7,0.0053105177,0.00029665587,0.03716529,0.88523096,0.00033901748,0.07126127],"study_design_scores_gemma":[0.00011397435,0.0007971079,0.0006825771,0.00021134772,0.000019025048,0.000007623984,0.0054222886,0.34496045,0.5812761,0.059253648,0.006654328,0.0006015165],"about_ca_topic_score_codex":0.000009954993,"about_ca_topic_score_gemma":0.0000014248642,"teacher_disagreement_score":0.8259773,"about_ca_system_score_codex":0.000019254041,"about_ca_system_score_gemma":0.00008459418,"threshold_uncertainty_score":0.60788083},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3402278,0.00012128868,0.6147052,0.027777385,0.0008773186,0.0016878819,0.0000067911615,0.00027097168,0.014325339],"genre_scores_gemma":[0.9958395,0.00006210208,0.0034104823,0.0003979541,0.00016491042,0.000010334711,4.612966e-7,0.000016611979,0.00009769368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997791,0.00007490234,0.0005937507,0.0006573114,0.00048644954,0.00039661254],"domain_scores_gemma":[0.99897313,0.00010551388,0.00017699946,0.00020389927,0.00040191473,0.00013856863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000524663,0.00027787947,0.00045444275,0.00009568889,0.00018119384,0.00027618656,0.001523875,0.00011212732,0.00013304774],"category_scores_gemma":[0.0007036166,0.0002135235,0.00015589836,0.00089143956,0.00018246988,0.00056939345,0.00028563017,0.00052524474,0.00007527615],"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.00072322256,0.00030804338,0.002502823,0.00012122004,0.000050625094,0.000004944583,0.017313834,0.0070945593,0.2594021,0.40607426,0.00045028146,0.3059541],"study_design_scores_gemma":[0.00017875798,0.0005201756,0.00020011747,0.0003479485,0.000019967298,0.0000017273156,0.0016920827,0.5780625,0.41288784,0.004533151,0.0011498044,0.00040594162],"about_ca_topic_score_codex":0.000060401395,"about_ca_topic_score_gemma":0.00001252196,"teacher_disagreement_score":0.65561163,"about_ca_system_score_codex":0.000035752775,"about_ca_system_score_gemma":0.00008981391,"threshold_uncertainty_score":0.87072355},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00933352,0.000028853201,0.97399676,0.013569232,0.00029202775,0.00047303227,0.000013225768,0.00014812342,0.0021452347],"genre_scores_gemma":[0.9412356,0.000018244727,0.057331845,0.0010019016,0.00016090646,0.00004960788,9.2576124e-7,0.000017678409,0.00018326099],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980079,0.000014271734,0.00049329293,0.0006175735,0.00043200635,0.00043494045],"domain_scores_gemma":[0.99851114,0.00007936669,0.00032249696,0.000247647,0.00066594244,0.00017340206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031707186,0.00025647116,0.00031810705,0.00007340188,0.00023744455,0.00036541288,0.0021743784,0.00009787132,0.00004065484],"category_scores_gemma":[0.0002495792,0.00019789966,0.00016540411,0.00057537114,0.00015037594,0.0004117586,0.00039130056,0.0002662643,0.00005523496],"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.000029501492,0.000078539226,0.000019240904,0.000060740287,0.000016702088,2.9515346e-7,0.0011299194,0.000024128589,0.017749293,0.71942675,0.0005390808,0.26092577],"study_design_scores_gemma":[0.000032417604,0.00021352693,0.0000145584845,0.0001288058,0.000011933117,0.000002012034,0.00015930162,0.5664351,0.29549548,0.13713704,0.00017337684,0.00019644067],"about_ca_topic_score_codex":0.000016038504,"about_ca_topic_score_gemma":0.0000012215975,"teacher_disagreement_score":0.9319021,"about_ca_system_score_codex":0.000027661748,"about_ca_system_score_gemma":0.000083384984,"threshold_uncertainty_score":0.80701137},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5126265,0.00047160682,0.33356667,0.0668943,0.0061820117,0.004601665,0.00040121327,0.0003471127,0.07490888],"genre_scores_gemma":[0.98846763,0.000040711224,0.003575751,0.00020399505,0.00020609226,0.00007118012,0.0000020092418,0.000022930542,0.007409673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99555326,0.000043139888,0.0010089343,0.000864114,0.0019774763,0.0005530899],"domain_scores_gemma":[0.99242824,0.001290812,0.000530731,0.000559453,0.0050273496,0.00016339506],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.002345155,0.0002457535,0.00046403927,0.00020765544,0.00039275436,0.0006097171,0.002219153,0.00013989968,0.0008648851],"category_scores_gemma":[0.017821671,0.00016440346,0.0002832372,0.0016564315,0.00055834407,0.00045035323,0.0004687545,0.00037273808,0.00024704228],"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.00057834515,0.00040058186,0.00056281773,0.0000616773,0.000053056036,0.000003949553,0.0018593792,0.00027218423,0.10824461,0.5520921,0.007949475,0.32792184],"study_design_scores_gemma":[0.000040955343,0.000122062236,0.0001418722,0.00006603694,0.000007583715,0.000005285976,0.0017012287,0.012444984,0.5155847,0.46692565,0.0028156023,0.00014401945],"about_ca_topic_score_codex":0.00000960653,"about_ca_topic_score_gemma":0.000029407849,"teacher_disagreement_score":0.47584113,"about_ca_system_score_codex":0.00007430318,"about_ca_system_score_gemma":0.00037184835,"threshold_uncertainty_score":0.99045163},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8833695,0.000116787756,0.09436721,0.016943075,0.0006657866,0.0005915137,0.0000132463865,0.00018367266,0.003749183],"genre_scores_gemma":[0.99096596,0.00013797205,0.008030923,0.00040949965,0.00012432785,0.000040944742,0.000004666215,0.000022892584,0.00026282846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9969807,0.00008043748,0.0006768173,0.0010884866,0.0007092045,0.00046435677],"domain_scores_gemma":[0.99784654,0.00019749568,0.0004286264,0.00073728495,0.0006187272,0.00017130778],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009793458,0.00038540206,0.0004983865,0.0002906524,0.00036424334,0.0021097134,0.002869545,0.00020855623,0.000024015211],"category_scores_gemma":[0.0010435834,0.00031883587,0.00015957953,0.0006479735,0.00025145715,0.0003994556,0.0032592232,0.0012007222,0.000036649097],"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.000047292953,0.00010330943,0.0013136921,0.0003101681,0.000046909565,8.36729e-7,0.012780907,0.0009581202,0.12815093,0.4856405,0.00006086058,0.37058648],"study_design_scores_gemma":[0.00006533174,0.0004218067,0.014182754,0.0034575735,0.000063859974,0.000025780257,0.003424157,0.24245746,0.6094867,0.12444105,0.0005636814,0.0014098338],"about_ca_topic_score_codex":0.0006800983,"about_ca_topic_score_gemma":0.00009902393,"teacher_disagreement_score":0.4813358,"about_ca_system_score_codex":0.00006378072,"about_ca_system_score_gemma":0.00022612803,"threshold_uncertainty_score":0.9999264},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16505735,0.00042033265,0.81137276,0.006668165,0.005541338,0.0011786143,0.00006625815,0.00021013174,0.009485082],"genre_scores_gemma":[0.96320444,0.00022225367,0.035362285,0.00027980015,0.0006658244,0.000047229092,0.000013583719,0.000024314071,0.00018025041],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9966683,0.00008050452,0.0008304151,0.0012259192,0.00075483375,0.00044007233],"domain_scores_gemma":[0.9966932,0.000106467785,0.00083130226,0.00076993916,0.001474719,0.00012438082],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00046239377,0.0004855549,0.0005844802,0.00014023107,0.00025741648,0.0014970733,0.003142291,0.0003016012,0.00018121178],"category_scores_gemma":[0.00053781405,0.00039019107,0.0003491772,0.00062091294,0.00022170375,0.00056382146,0.0023767098,0.0007968653,0.00006782011],"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.00006464015,0.0006388584,0.00017355017,0.000107799715,0.00025028267,0.000008829995,0.0051079863,0.0057706414,0.56045836,0.28510582,0.0033242097,0.13898899],"study_design_scores_gemma":[0.000020454978,0.000043596618,0.00013625118,0.00027789344,0.000038471564,0.0000011205552,0.00022540626,0.32911658,0.6315696,0.03816768,0.00005643466,0.00034650296],"about_ca_topic_score_codex":0.0003407852,"about_ca_topic_score_gemma":0.000052051895,"teacher_disagreement_score":0.79814714,"about_ca_system_score_codex":0.00010262721,"about_ca_system_score_gemma":0.00035542468,"threshold_uncertainty_score":0.999855},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7988324,0.00046436526,0.1356309,0.017819762,0.0011409448,0.0004200779,0.000015379932,0.00035307626,0.04532308],"genre_scores_gemma":[0.9852023,0.000040420266,0.014026893,0.00037054846,0.000056837056,0.0000059674303,5.218966e-7,0.0000081089465,0.00028840956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99858075,0.000020635149,0.0003552062,0.00044434005,0.00029832104,0.00030073483],"domain_scores_gemma":[0.9989849,0.00012295021,0.00021635095,0.00022290237,0.00037322525,0.00007970838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004494214,0.00016252989,0.00019088623,0.000065279884,0.0002895102,0.00034391638,0.0008550909,0.00007132769,0.000022493197],"category_scores_gemma":[0.00032732764,0.00013042906,0.00006109645,0.0004451968,0.00011552443,0.000284574,0.00041822833,0.00026594198,0.000017224062],"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.000009834254,0.000035277335,0.0014114309,0.00004473805,0.000011728376,0.00000297042,0.002051866,0.000097680386,0.072699465,0.8716061,0.00018487142,0.051844027],"study_design_scores_gemma":[0.000024776711,0.00007551574,0.0002712816,0.00044409794,0.000010824791,0.000033659926,0.00071698753,0.10032501,0.7861642,0.11135806,0.00032443582,0.00025110252],"about_ca_topic_score_codex":0.000032051954,"about_ca_topic_score_gemma":0.000008287654,"teacher_disagreement_score":0.76024806,"about_ca_system_score_codex":0.000017914495,"about_ca_system_score_gemma":0.00010188235,"threshold_uncertainty_score":0.5318743},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8244484,0.000030446798,0.098300375,0.008044005,0.005740753,0.0011898027,0.000003947783,0.00041340495,0.061828848],"genre_scores_gemma":[0.9971461,0.000017469183,0.00085785595,0.00020623466,0.000059319034,0.000019040323,3.4091164e-7,0.000009955112,0.0016836601],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99807197,0.000022326289,0.0005025859,0.00051921036,0.0005761951,0.00030768407],"domain_scores_gemma":[0.9986638,0.00007794011,0.0003732141,0.0003258252,0.0004787808,0.00008048336],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00041107633,0.00019543538,0.0002037451,0.00015858097,0.00017203098,0.00024487023,0.0013893424,0.000105370156,0.00025535055],"category_scores_gemma":[0.0001994815,0.00014858413,0.0001428193,0.00066002714,0.00011747336,0.0007217946,0.0002222947,0.00031588296,0.0012522374],"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.000029009734,0.00015995024,0.0005393268,0.00004003904,0.0000072770204,2.536428e-7,0.000382001,0.000042323525,0.13908327,0.81629616,0.00018097067,0.043239437],"study_design_scores_gemma":[0.000055455406,0.000586852,0.0024731501,0.0002742974,0.000014114337,0.000013273677,0.0006052055,0.10426015,0.7007202,0.18971089,0.0009073773,0.00037906528],"about_ca_topic_score_codex":0.000024177216,"about_ca_topic_score_gemma":0.000005564772,"teacher_disagreement_score":0.62658525,"about_ca_system_score_codex":0.000056574576,"about_ca_system_score_gemma":0.00006351733,"threshold_uncertainty_score":0.9995254},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004494737,0.00001650323,0.9883503,0.0021135719,0.00061803637,0.00050903537,0.0000010005011,0.00009588645,0.0038009402],"genre_scores_gemma":[0.94082123,0.000044906898,0.058896657,0.000074008196,0.000031683518,0.000034114746,0.0000022463023,0.0000074295913,0.00008774458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875665,0.000017208462,0.00040858984,0.00034435053,0.00026020088,0.00021300367],"domain_scores_gemma":[0.9985519,0.000114930146,0.00030243816,0.00010312987,0.00086213776,0.00006543025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003616845,0.00014066562,0.00017666238,0.000058443202,0.00030779932,0.0003552356,0.00030706136,0.000069015296,0.00003847718],"category_scores_gemma":[0.00062630285,0.00012548729,0.00006652033,0.00035373025,0.00017244303,0.00030157884,0.00018621491,0.00017975252,0.0000020109758],"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.000021546035,0.0000386939,0.00020491095,0.000032506916,0.000012046351,2.0671611e-7,0.0006026276,0.011562902,0.0030441203,0.8797358,0.000007985888,0.1047366],"study_design_scores_gemma":[0.00012080141,0.00019816968,0.000021383717,0.00016328857,0.000014354829,0.00001038676,0.0011190147,0.83533067,0.13532117,0.027287813,0.00022807324,0.0001848817],"about_ca_topic_score_codex":0.0000043152054,"about_ca_topic_score_gemma":0.0000013100126,"teacher_disagreement_score":0.93632644,"about_ca_system_score_codex":0.00003453405,"about_ca_system_score_gemma":0.0001297115,"threshold_uncertainty_score":0.5117223},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.529206,0.000184306,0.4035455,0.021733567,0.0026209843,0.00089664024,0.000010133258,0.0005244241,0.041278444],"genre_scores_gemma":[0.9924958,0.000058825553,0.0063728224,0.00044615412,0.00007398003,0.000017046212,5.3648125e-7,0.000011885587,0.0005229515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99807435,0.000017938393,0.00047531037,0.000593324,0.00046484877,0.00037421254],"domain_scores_gemma":[0.99824595,0.00007668713,0.00032094208,0.00042315075,0.00084240676,0.00009085799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022328664,0.0002070019,0.00023235513,0.00007643337,0.00019562879,0.00023368576,0.001714467,0.00008766354,0.00004617824],"category_scores_gemma":[0.0002464733,0.0001634245,0.00017210795,0.0011004851,0.00017390244,0.000530435,0.00059414795,0.0003312223,0.00008733246],"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.000011997713,0.0000731129,0.00025838686,0.000013774947,0.000008662031,0.0000014773046,0.00013760262,0.000073281735,0.12706457,0.81710744,0.00014571982,0.055103965],"study_design_scores_gemma":[0.000021052098,0.000072967334,0.00089735724,0.00013971837,0.000007899193,0.000018233972,0.00016248065,0.032613575,0.54315084,0.42256945,0.00014691475,0.00019952828],"about_ca_topic_score_codex":0.000007722242,"about_ca_topic_score_gemma":0.000007379945,"teacher_disagreement_score":0.4632898,"about_ca_system_score_codex":0.000034344255,"about_ca_system_score_gemma":0.000072573064,"threshold_uncertainty_score":0.66642576},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08707643,0.0001897362,0.80588144,0.031765807,0.0035257179,0.00093363936,0.000017048931,0.00036536268,0.070244834],"genre_scores_gemma":[0.97668445,0.00012249695,0.02144131,0.00058327767,0.00015869334,0.000018626484,9.044829e-7,0.000014026628,0.00097618485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9975791,0.000068046604,0.00060611544,0.0007157437,0.00058996375,0.0004410416],"domain_scores_gemma":[0.9973959,0.00016751228,0.0003858165,0.00052449724,0.0013998529,0.00012647687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047892777,0.00028712876,0.00037973886,0.00009052933,0.00029133027,0.00045947699,0.0020680935,0.00012115769,0.0002595115],"category_scores_gemma":[0.0012193634,0.00022138338,0.0002221652,0.0010034752,0.00024921075,0.0006001612,0.00074227265,0.00032823786,0.00011896049],"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.00003508691,0.00012003146,0.00007057427,0.000014109833,0.000029752444,0.0000022320053,0.00051195425,0.0008293392,0.12366705,0.8137296,0.00030651505,0.06068377],"study_design_scores_gemma":[0.00005296192,0.00009040345,0.0001245643,0.00011094632,0.000017820697,0.000005047539,0.00021712449,0.084349014,0.7583438,0.15573314,0.00068589224,0.0002692593],"about_ca_topic_score_codex":0.000039499715,"about_ca_topic_score_gemma":0.000019490612,"teacher_disagreement_score":0.889608,"about_ca_system_score_codex":0.000045511893,"about_ca_system_score_gemma":0.00033516347,"threshold_uncertainty_score":0.9027752},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5331361,0.0015153432,0.11028863,0.20703916,0.013506117,0.005283055,0.0011940757,0.00038175657,0.12765571],"genre_scores_gemma":[0.9904558,0.00013444576,0.0054019047,0.002625657,0.0005135964,0.00015392297,0.000019396697,0.000044626697,0.00065066764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9935446,0.00007202698,0.0045830845,0.00105513,0.00029870853,0.00044649845],"domain_scores_gemma":[0.99355084,0.00040278453,0.0046505085,0.0005580716,0.0006938686,0.00014394672],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0070250994,0.00039219603,0.0012314346,0.00029747048,0.00024351578,0.00047852297,0.001489998,0.000409922,0.0012042626],"category_scores_gemma":[0.005439787,0.00042780035,0.00035693037,0.00030152831,0.00021228622,0.0003490567,0.0009927939,0.0008512402,0.00061713305],"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.000030394973,0.00017645684,0.0016010071,0.0008355129,0.00010194867,2.8226242e-7,0.003412212,0.0018688262,0.00017789092,0.989417,0.001452048,0.00092640746],"study_design_scores_gemma":[0.00007879816,0.0001014865,0.0029919287,0.0020480743,0.000032361713,0.0000057548564,0.0047579426,0.21414533,0.004642757,0.7692164,0.0010199385,0.0009592099],"about_ca_topic_score_codex":0.00052964827,"about_ca_topic_score_gemma":0.00009885088,"teacher_disagreement_score":0.45731965,"about_ca_system_score_codex":0.00044529783,"about_ca_system_score_gemma":0.00045530984,"threshold_uncertainty_score":0.9998174},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38811037,0.000450732,0.09959622,0.15811953,0.002306028,0.00264303,0.000021474296,0.0015883778,0.34716424],"genre_scores_gemma":[0.993845,0.00007679791,0.0042870007,0.001564916,0.000106212865,0.000013114482,6.130738e-7,0.0000126403975,0.00009372462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774885,0.00001739874,0.00062223704,0.000599512,0.0006213185,0.00039068214],"domain_scores_gemma":[0.9986943,0.00006883675,0.00043325385,0.00024104043,0.00039632787,0.0001662317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041711042,0.0002623541,0.00030965172,0.00006510605,0.00025199467,0.00037691533,0.002880088,0.00009250708,0.00015611987],"category_scores_gemma":[0.00046261985,0.00018173872,0.00015465998,0.000636245,0.00017555407,0.00034007363,0.0007283596,0.0005272546,0.00028086975],"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.000037335347,0.00015062556,0.00069155334,0.000045227847,0.000020229421,0.0000031717739,0.0028806052,0.0006404923,0.020740898,0.9217238,0.00047501316,0.052591037],"study_design_scores_gemma":[0.00012944371,0.0012228248,0.0023287176,0.00026150994,0.000035626712,0.000018164897,0.0012398333,0.42873576,0.30858544,0.2535195,0.0029619008,0.0009612767],"about_ca_topic_score_codex":0.000041649273,"about_ca_topic_score_gemma":0.0000034315358,"teacher_disagreement_score":0.6682043,"about_ca_system_score_codex":0.000031632047,"about_ca_system_score_gemma":0.00006279256,"threshold_uncertainty_score":0.74110895},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8050479,0.000026649135,0.15628237,0.020969434,0.00083987863,0.000938406,0.0000018249576,0.00031480167,0.015578734],"genre_scores_gemma":[0.9923219,0.00001064316,0.00722742,0.00026917114,0.000117571595,0.000014874073,5.128365e-7,0.000014606275,0.00002326849],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769706,0.000055016702,0.0007002364,0.0005668417,0.00063188863,0.0003489705],"domain_scores_gemma":[0.99845165,0.0003044755,0.0006297451,0.00015511707,0.00035724207,0.00010174097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070214685,0.00024134814,0.00030976057,0.00012420451,0.0002300141,0.0002753059,0.0018909406,0.00009606235,0.000042732983],"category_scores_gemma":[0.0026178733,0.00020550432,0.000103860126,0.0009034889,0.00017652047,0.0007753667,0.0006188279,0.000877484,0.000056118082],"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.00012722002,0.00012874817,0.0054750824,0.000060878425,0.000018806188,0.0000024710002,0.02554505,0.03462404,0.031241948,0.8396338,0.000021517804,0.063120425],"study_design_scores_gemma":[0.00018608724,0.0004185473,0.0075583244,0.00040521228,0.000015169422,0.0000018995104,0.009537008,0.8018759,0.1189604,0.06044278,0.00008430545,0.0005143891],"about_ca_topic_score_codex":0.000052614298,"about_ca_topic_score_gemma":0.000009766663,"teacher_disagreement_score":0.779191,"about_ca_system_score_codex":0.00006820116,"about_ca_system_score_gemma":0.000090660724,"threshold_uncertainty_score":0.8380223},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005761429,0.00017432873,0.94314647,0.041971467,0.0007637886,0.0013842935,0.000027986103,0.00013703575,0.006633227],"genre_scores_gemma":[0.97173345,0.000056653753,0.024919732,0.0024002402,0.00054828316,0.00007433776,0.0000014728392,0.000019139532,0.00024667368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981575,0.00002329525,0.00037934395,0.0005927853,0.0003793312,0.00046774693],"domain_scores_gemma":[0.99899876,0.00010791862,0.00015124494,0.0002260684,0.00036189315,0.00015412451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034317467,0.00026823007,0.00033337245,0.000035151737,0.0002674731,0.00025481734,0.0016437012,0.000107393724,0.00006850661],"category_scores_gemma":[0.0001336652,0.00019926706,0.00020396971,0.0005524691,0.00013441303,0.0003863396,0.00020424044,0.00024035707,0.000028930255],"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.0002648066,0.00014549495,0.000058836653,0.00011135374,0.00007778044,8.7169e-7,0.0032914674,0.0025428163,0.058710143,0.8598967,0.014098534,0.060801174],"study_design_scores_gemma":[0.00007120716,0.0005304261,0.00004048599,0.0001505123,0.000032951506,0.0000015105014,0.00034966102,0.32075173,0.611549,0.060379334,0.005786216,0.00035692702],"about_ca_topic_score_codex":0.000012243456,"about_ca_topic_score_gemma":0.0000056970875,"teacher_disagreement_score":0.96597207,"about_ca_system_score_codex":0.000024421837,"about_ca_system_score_gemma":0.00006962633,"threshold_uncertainty_score":0.8125875},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6214411,0.00004163709,0.35769552,0.01531948,0.0005689714,0.0011728468,0.000018605131,0.00016769941,0.0035741313],"genre_scores_gemma":[0.99312377,0.000011594311,0.0062720026,0.00027436155,0.00010616937,0.000037829435,0.0000030201734,0.000009274341,0.00016194886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976426,0.000011709586,0.00071199617,0.0006720427,0.0006423257,0.00031933788],"domain_scores_gemma":[0.99845046,0.00007109619,0.00053907215,0.00025186967,0.0005518984,0.0001356042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045289547,0.00022670742,0.0003959415,0.00018888975,0.00021834276,0.00036688682,0.0016199074,0.000072116025,0.00016477866],"category_scores_gemma":[0.00012733371,0.00017678535,0.00054721517,0.0012575326,0.00008753425,0.00036615835,0.00032391722,0.00016363659,0.00011095578],"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.00024674326,0.00092161953,0.012409371,0.0001126039,0.0013089717,9.0723114e-7,0.0043989867,0.0035174612,0.14740065,0.7651372,0.0011294846,0.063416],"study_design_scores_gemma":[0.00008554263,0.00018723767,0.004153647,0.00004354576,0.00023818827,2.7100532e-7,0.00054031704,0.7420909,0.2475837,0.00470138,0.000117811076,0.0002574975],"about_ca_topic_score_codex":0.000021134181,"about_ca_topic_score_gemma":0.0000032293317,"teacher_disagreement_score":0.7604358,"about_ca_system_score_codex":0.00003974589,"about_ca_system_score_gemma":0.000046590794,"threshold_uncertainty_score":0.7209097},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027196914,0.000014778496,0.95092744,0.012099633,0.00029918473,0.000542942,0.000013408639,0.00015095828,0.008754751],"genre_scores_gemma":[0.98148704,0.000010732578,0.01745175,0.00082919706,0.0001397345,0.000020410676,0.0000022140155,0.0000125084935,0.00004643268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975456,0.000022998907,0.00058175036,0.0006248738,0.0008680197,0.00035673304],"domain_scores_gemma":[0.99823403,0.00009839251,0.00039570392,0.00024244672,0.0008169852,0.00021245699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000305,0.00026374593,0.00029648462,0.00008998615,0.00020874738,0.00027053972,0.0019771184,0.00007541461,0.00013909895],"category_scores_gemma":[0.00016042034,0.00018815236,0.00012075176,0.00079634535,0.0003007046,0.00044620622,0.00030303866,0.00027919086,0.00022888476],"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.00014251948,0.00009457545,0.00018001282,0.000052081246,0.000026721975,0.0000013902348,0.002206868,0.014438423,0.0052661872,0.96983844,0.00025321584,0.0074995896],"study_design_scores_gemma":[0.00003615589,0.00031750283,0.000076196106,0.0001454079,0.000009121129,0.000009848245,0.00059953355,0.8394087,0.09610301,0.06285871,0.00018177289,0.0002540322],"about_ca_topic_score_codex":0.000053108215,"about_ca_topic_score_gemma":0.000003810492,"teacher_disagreement_score":0.9542901,"about_ca_system_score_codex":0.000051349754,"about_ca_system_score_gemma":0.00020248747,"threshold_uncertainty_score":0.7672631},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050133266,0.000005290742,0.9422735,0.005427125,0.00024650336,0.00058350863,0.000003913014,0.00017006794,0.001156833],"genre_scores_gemma":[0.9816331,0.000019835703,0.017764982,0.00039418475,0.00010716084,0.000030706746,0.0000022055797,0.000015741145,0.000032033164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998196,0.00005260892,0.0005601949,0.0006040061,0.0003220936,0.00026508552],"domain_scores_gemma":[0.99854195,0.00019408972,0.00043651566,0.00012842382,0.00057154405,0.00012747836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000530056,0.00023023497,0.0002454752,0.00011906105,0.00041468497,0.0005320133,0.0006978222,0.000094064126,0.000047010664],"category_scores_gemma":[0.0016061378,0.00019824896,0.00008452315,0.00032267426,0.00017620121,0.0010914302,0.00023540002,0.00037364854,0.00001444459],"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.00008482234,0.00004935993,0.0002302422,0.000027982864,0.000009005961,1.1610778e-7,0.004068836,0.00056052074,0.019761847,0.7143612,0.000010449002,0.2608356],"study_design_scores_gemma":[0.0000212567,0.000461746,0.00007824175,0.000095331554,0.000013686673,0.0000033554961,0.0025663772,0.7543561,0.1836418,0.058389682,0.00013164333,0.00024075563],"about_ca_topic_score_codex":0.000013039745,"about_ca_topic_score_gemma":0.0000075559683,"teacher_disagreement_score":0.9314999,"about_ca_system_score_codex":0.00003861718,"about_ca_system_score_gemma":0.00007415498,"threshold_uncertainty_score":0.8084358},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88356006,0.000081459926,0.0006442126,0.023160838,0.000506021,0.0009686849,0.00002629868,0.000088781206,0.090963624],"genre_scores_gemma":[0.99905133,0.00009607997,0.0000321879,0.00024838743,0.00044188075,0.00002080905,8.157214e-7,0.000009542986,0.000098937366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.9981538,0.000028400758,0.00060323445,0.00029176855,0.00061853434,0.0003042343],"domain_scores_gemma":[0.99888927,0.00007846716,0.00044408385,0.0000598215,0.00043593653,0.00009240235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006098945,0.00014930523,0.00031477222,0.00006481325,0.00031578052,0.000097061646,0.0008496833,0.00023497161,0.00034660244],"category_scores_gemma":[0.00045053972,0.000122984,0.00014286935,0.0006085752,0.0006667655,0.00024788303,0.00010566985,0.00052754814,0.0000141083],"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.00043385432,0.00027095643,0.014362243,0.000053396598,0.00003331955,6.664732e-7,0.044069532,0.00015322967,0.005156349,0.9018613,0.00029264827,0.033312514],"study_design_scores_gemma":[0.0015955826,0.001685786,0.20730698,0.0017036479,0.00041397125,0.0000019825634,0.28842875,0.14395587,0.11261788,0.23175514,0.008357316,0.0021770855],"about_ca_topic_score_codex":0.00038716674,"about_ca_topic_score_gemma":0.000110082445,"teacher_disagreement_score":0.6701062,"about_ca_system_score_codex":0.00005513086,"about_ca_system_score_gemma":0.00013056946,"threshold_uncertainty_score":0.5015142},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7214613,0.00007680805,0.23647545,0.03707185,0.00062750495,0.000833151,0.000035169684,0.00031008842,0.0031087014],"genre_scores_gemma":[0.97147214,0.0000896541,0.027060946,0.0010988805,0.00015141649,0.000049914554,0.0000026580537,0.000028561348,0.000045810986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99657243,0.000046918638,0.00097342394,0.0010905489,0.00073351973,0.0005831444],"domain_scores_gemma":[0.9976664,0.0002881578,0.000585449,0.00044998812,0.0007104042,0.000299601],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005135915,0.00038622308,0.00043025787,0.00013393469,0.0007476867,0.00091195863,0.0021732822,0.00014022358,0.00009698142],"category_scores_gemma":[0.0010588598,0.00033366607,0.00014908993,0.0009103239,0.00048240137,0.001334387,0.0008710848,0.00053610955,0.00012801902],"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.00008925709,0.000100184516,0.0007236928,0.00004170634,0.000047533817,0.000008176293,0.016405918,0.00034522332,0.44985667,0.5029858,0.00087783515,0.028518014],"study_design_scores_gemma":[0.000038598562,0.00018670877,0.00012506185,0.00015826395,0.000022034317,0.0000053805393,0.0046794326,0.32036433,0.610562,0.063403614,0.000097344106,0.00035722458],"about_ca_topic_score_codex":0.00030845724,"about_ca_topic_score_gemma":0.00004998404,"teacher_disagreement_score":0.43958217,"about_ca_system_score_codex":0.00009786113,"about_ca_system_score_gemma":0.0001272032,"threshold_uncertainty_score":0.99991155},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94009584,0.000038469952,0.00007457207,0.00591112,0.00024223163,0.00062401476,0.0000011105902,0.00006253291,0.052950077],"genre_scores_gemma":[0.9990365,0.00012499599,0.00022689525,0.00026019043,0.00006450739,0.000035761757,3.2148213e-7,0.0000118098815,0.00023900578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99826324,0.000017973623,0.0005996135,0.00034459928,0.0004049895,0.0003696106],"domain_scores_gemma":[0.999203,0.000051099632,0.00035725796,0.000068932524,0.0002040337,0.00011562794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000575339,0.00016972308,0.00025417702,0.000058102636,0.00038975087,0.00013981323,0.0007469287,0.000070884715,0.0002192485],"category_scores_gemma":[0.0005337362,0.00015034317,0.000094314404,0.0003178538,0.00037099328,0.00022521333,0.00029619358,0.0003686322,0.00013180872],"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.00016881956,0.0004672879,0.059142932,0.000065155684,0.000036240537,0.0000024728438,0.2366213,0.0028360332,0.124857455,0.5539769,0.00010240983,0.021723019],"study_design_scores_gemma":[0.00020724216,0.00052910676,0.008276389,0.00055350043,0.000034838515,4.3399987e-7,0.3136771,0.013272213,0.6561402,0.0049952893,0.0014379424,0.0008757433],"about_ca_topic_score_codex":0.00095627306,"about_ca_topic_score_gemma":0.0002971337,"teacher_disagreement_score":0.5489816,"about_ca_system_score_codex":0.00019915686,"about_ca_system_score_gemma":0.0000797503,"threshold_uncertainty_score":0.6130817},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1944182,0.00015099175,0.71391404,0.01386758,0.00048774047,0.0009163309,0.0000051505144,0.0005192694,0.0757207],"genre_scores_gemma":[0.9954933,0.000019211197,0.0033203857,0.0010426665,0.0000679034,0.00000657376,0.0000016050499,0.00001462594,0.00003370804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978888,0.000029639941,0.0006518142,0.00048377132,0.0005832619,0.0003626917],"domain_scores_gemma":[0.9984586,0.00012213903,0.00045860827,0.00030746075,0.00047511066,0.00017805272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000325615,0.00025079813,0.00026600496,0.0000758573,0.00030916074,0.0005783369,0.0033417658,0.00007820898,0.00019807524],"category_scores_gemma":[0.0003194075,0.00020618476,0.00015490981,0.0007633327,0.00026691274,0.0006214303,0.001015145,0.0006047866,0.000064780026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004178425,0.00016494676,0.00041432798,0.00003057251,0.000021201517,0.0000015165442,0.002838313,0.033295274,0.008927354,0.83489835,0.000026577598,0.11933977],"study_design_scores_gemma":[0.000017972672,0.00013201787,0.00085791893,0.00007038146,0.0000070805672,0.0000064044525,0.0013057945,0.9750589,0.015121974,0.0070401058,0.00014373657,0.00023771147],"about_ca_topic_score_codex":0.00002196575,"about_ca_topic_score_gemma":0.000005394345,"teacher_disagreement_score":0.94176364,"about_ca_system_score_codex":0.00004599389,"about_ca_system_score_gemma":0.000044095206,"threshold_uncertainty_score":0.84079707},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20368125,0.000037039175,0.7873009,0.0052365335,0.00037973214,0.0013182779,0.0000024659223,0.00026088353,0.001782959],"genre_scores_gemma":[0.9500755,0.000003976981,0.049165215,0.0004432042,0.00011109618,0.0000506297,2.353329e-7,0.000017308783,0.00013281645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99802625,0.000020475116,0.00064627966,0.00052699103,0.00036672666,0.0004132733],"domain_scores_gemma":[0.9988163,0.000055151322,0.00037889066,0.00014364923,0.00051802286,0.00008797892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005904136,0.00023514692,0.00032676492,0.00011443385,0.000189897,0.00026313064,0.0013255702,0.00010084406,0.000008263482],"category_scores_gemma":[0.00040441361,0.00019392367,0.000111596884,0.00052020256,0.00008692405,0.00040516967,0.00033097013,0.00035750036,0.000014471198],"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.00005511724,0.000052447594,0.0008472066,0.000094970965,0.000012539618,0.0000010136447,0.007408816,0.00028217843,0.053383067,0.88859624,0.00002227006,0.049244136],"study_design_scores_gemma":[0.000033403205,0.00020866348,0.00012120696,0.0007487488,0.000005749361,0.0000042523143,0.0010054952,0.1660098,0.8122712,0.01744717,0.0018154396,0.0003288656],"about_ca_topic_score_codex":0.000048601378,"about_ca_topic_score_gemma":0.0000048584907,"teacher_disagreement_score":0.87114906,"about_ca_system_score_codex":0.00012659784,"about_ca_system_score_gemma":0.00021027002,"threshold_uncertainty_score":0.79079777},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55751723,0.000015662808,0.42407992,0.013593252,0.00027281969,0.0009360551,0.000005160762,0.00034426397,0.0032356174],"genre_scores_gemma":[0.9925161,0.0000058506143,0.00655402,0.00057927973,0.0001390671,0.00010257591,0.0000010969552,0.000021444073,0.00008054553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979155,0.000023447845,0.00056082295,0.00067386014,0.00042775396,0.00039860889],"domain_scores_gemma":[0.998218,0.00025572712,0.0004752457,0.00019382872,0.00069721515,0.00015998163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004929177,0.00024581904,0.00028822024,0.0000954405,0.0005195398,0.00053651305,0.0021467234,0.00009639983,0.000046319627],"category_scores_gemma":[0.0014379509,0.00020375618,0.00019457379,0.00076088606,0.0002626716,0.00043415144,0.00042780134,0.00052934326,0.00011171502],"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.00007289013,0.00007099651,0.0023766377,0.000051350413,0.00001519859,1.1964683e-7,0.0023694024,0.0005097835,0.037758682,0.86463726,0.000036110003,0.09210156],"study_design_scores_gemma":[0.00009037555,0.0006694672,0.0016886799,0.00010553945,0.000014994856,0.0000028125457,0.00080733706,0.7202037,0.18559375,0.089998044,0.00045905024,0.0003662363],"about_ca_topic_score_codex":0.000079482066,"about_ca_topic_score_gemma":0.0000031709365,"teacher_disagreement_score":0.77463925,"about_ca_system_score_codex":0.000037180143,"about_ca_system_score_gemma":0.00007875161,"threshold_uncertainty_score":0.8308936},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92222214,0.000050913008,0.03706769,0.03377851,0.00020967892,0.00074117986,0.0000040818895,0.00015973109,0.0057660528],"genre_scores_gemma":[0.99411505,0.000058240144,0.0052108327,0.00048509848,0.000029671508,0.000030497784,3.3479623e-7,0.000013340587,0.00005695278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979034,0.000020603195,0.00061103026,0.00064171525,0.00047891875,0.0003443309],"domain_scores_gemma":[0.9989036,0.00008903398,0.00035533318,0.00023204283,0.0002963893,0.00012362227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032431955,0.00025485124,0.00028601018,0.00014033145,0.000114033326,0.00023081813,0.0012417858,0.00008640209,0.000048504426],"category_scores_gemma":[0.00021933188,0.00018178971,0.00005324856,0.0008214539,0.00034003472,0.0005429131,0.00030720583,0.0003823619,0.000044923094],"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.00028415408,0.00023664189,0.0016705838,0.000098166776,0.000026127384,0.000004993274,0.012311764,0.00022443554,0.08014189,0.554608,0.000086538224,0.35030672],"study_design_scores_gemma":[0.00005369976,0.0007507368,0.0021256048,0.00039908616,0.000014091315,0.000011085678,0.0030575686,0.3735901,0.5311064,0.088142335,0.00029784345,0.00045143088],"about_ca_topic_score_codex":0.000090808186,"about_ca_topic_score_gemma":0.00010215893,"teacher_disagreement_score":0.46646565,"about_ca_system_score_codex":0.000057294405,"about_ca_system_score_gemma":0.00008081025,"threshold_uncertainty_score":0.7413169},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95338213,0.00010770855,0.004625291,0.03449479,0.00013302296,0.00069826696,0.000017570152,0.00012742638,0.006413775],"genre_scores_gemma":[0.99822146,0.000019753925,0.00025221537,0.001319718,0.00006952025,0.0000234745,0.000014284668,0.000011773112,0.00006782983],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987177,0.0000110343235,0.00036226658,0.00033922977,0.000406175,0.00016358934],"domain_scores_gemma":[0.9990001,0.00006584023,0.0002414684,0.00009821188,0.00047462995,0.00011976649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013073618,0.000164197,0.0003098198,0.00012259634,0.0001196773,0.000049025006,0.00016340154,0.00006746848,0.0008331349],"category_scores_gemma":[0.0003679013,0.00011502884,0.00030949016,0.0009208349,0.000105713385,0.000056349632,0.00003865837,0.0002246339,0.00010602572],"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.0021903182,0.0020485548,0.61784947,0.00029132277,0.0019363117,0.0000048853226,0.0020124323,0.014092736,0.17779644,0.144203,0.0007376109,0.03683691],"study_design_scores_gemma":[0.00016251858,0.00068576436,0.054673444,0.00012182734,0.0012645749,0.0000020912876,0.0004196734,0.32282117,0.61670434,0.0025598558,0.00036845813,0.0002162808],"about_ca_topic_score_codex":0.000043584056,"about_ca_topic_score_gemma":0.000005960387,"teacher_disagreement_score":0.56317604,"about_ca_system_score_codex":0.000050007584,"about_ca_system_score_gemma":0.000073363626,"threshold_uncertainty_score":0.91222435},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010694921,0.000019807581,0.97793627,0.013848586,0.00035406178,0.00060375896,0.0000049641167,0.00015492164,0.0060081575],"genre_scores_gemma":[0.7663791,0.00008538384,0.23237292,0.0007069408,0.00017550305,0.00004948697,0.0000014558722,0.000029194556,0.00019998889],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99706656,0.000019083132,0.0007261878,0.00069501175,0.0010764844,0.00041667162],"domain_scores_gemma":[0.99727994,0.00012309667,0.000482211,0.00033449417,0.0015524185,0.00022785379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005401275,0.00025838337,0.00029210802,0.0001274414,0.00028775423,0.0005923372,0.0029277524,0.00010183676,0.00034965595],"category_scores_gemma":[0.0015194351,0.00020452599,0.00010564374,0.0014165909,0.00019828079,0.0006211873,0.0008095377,0.00041155628,0.00014499624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010409842,0.0005834834,0.00024304944,0.00026556975,0.00007381561,0.0000048724687,0.006024017,0.1483153,0.0107072,0.6007214,0.0007670431,0.2321901],"study_design_scores_gemma":[0.000042842483,0.00014573227,0.00006858723,0.00005571666,0.0000084968415,0.0000019483205,0.00027902238,0.9424273,0.05417609,0.0024910069,0.00009226672,0.00021099157],"about_ca_topic_score_codex":0.00003523381,"about_ca_topic_score_gemma":0.0000020332,"teacher_disagreement_score":0.794112,"about_ca_system_score_codex":0.000056309862,"about_ca_system_score_gemma":0.0001686163,"threshold_uncertainty_score":0.8340328},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9936495,0.000073239025,0.0009970794,0.0039622723,0.00023336879,0.00035674332,0.00004190718,0.00001888215,0.0006670514],"genre_scores_gemma":[0.99702716,0.000027241194,0.002264174,0.0002990337,0.00028761648,0.00004571132,0.000013166901,0.000011370814,0.000024537998],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986571,0.000012021463,0.00046144731,0.00040497226,0.00024727656,0.0002171976],"domain_scores_gemma":[0.9992286,0.00004696465,0.00027314574,0.00009114999,0.00026931803,0.000090820475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036136858,0.00016405269,0.00019962662,0.000058690493,0.00007970611,0.00006381259,0.00046702253,0.00024622135,0.00000901034],"category_scores_gemma":[0.0016151294,0.00012037979,0.00008706272,0.00033597052,0.00031665878,0.000008730455,0.00015937792,0.00025796378,0.0000028925654],"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.0004970553,0.00023607379,0.0048155603,0.0001375493,0.000040740837,0.0000011505286,0.0043077166,0.000020447182,0.87930936,0.0093331365,0.0008418634,0.10045934],"study_design_scores_gemma":[0.00022311353,0.002170268,0.004414234,0.0007851612,0.000027601754,0.0000053736567,0.00974148,0.0053123226,0.96591747,0.008949421,0.0020796433,0.0003739113],"about_ca_topic_score_codex":0.0000070922465,"about_ca_topic_score_gemma":0.0000065842423,"teacher_disagreement_score":0.10008542,"about_ca_system_score_codex":0.000015980515,"about_ca_system_score_gemma":0.00007937641,"threshold_uncertainty_score":0.49089453},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83871174,0.000102479775,0.0052321907,0.0008724029,0.00071836595,0.00053265487,0.000007765064,0.0005251395,0.15329725],"genre_scores_gemma":[0.9988927,0.00012984787,0.00053230335,0.00022181503,0.00010303036,0.000018837489,0.0000011311789,0.000035683985,0.000064632775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984364,0.00000606542,0.00049419544,0.00032372828,0.00035072523,0.0003888702],"domain_scores_gemma":[0.99937063,0.00002969856,0.000113942566,0.00015831421,0.0001531236,0.0001742621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021406137,0.00026506046,0.00023717755,0.00010153802,0.00014400347,0.00011539654,0.0008726474,0.000087930326,0.0002023415],"category_scores_gemma":[0.00007735621,0.00021175285,0.00010343671,0.00062381395,0.00008311974,0.00026804532,0.00011767659,0.00040422988,0.00012329327],"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.00014757986,0.0001423312,0.00015094383,0.00024273113,0.000101667036,0.0000027399356,0.004863363,0.009759173,0.07917509,0.7500253,0.0006188406,0.15477028],"study_design_scores_gemma":[0.000027657969,0.0003540101,0.000060674785,0.0002008371,0.000029244939,0.00000327943,0.0017919273,0.16132373,0.80598885,0.02839777,0.0014372615,0.00038476792],"about_ca_topic_score_codex":0.000005996859,"about_ca_topic_score_gemma":0.0000032990047,"teacher_disagreement_score":0.72681373,"about_ca_system_score_codex":0.000046027024,"about_ca_system_score_gemma":0.00001518201,"threshold_uncertainty_score":0.86350304},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91680664,0.0001018397,0.0021661406,0.055165846,0.0012749267,0.00082721206,0.00006481252,0.00010471355,0.02348785],"genre_scores_gemma":[0.99850893,0.0000456805,0.00041112286,0.00054604054,0.0001888764,0.000021000928,2.2609531e-7,0.000017487991,0.00026064852],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963551,0.000047562477,0.0010893755,0.0008132106,0.001277875,0.00041686237],"domain_scores_gemma":[0.9958635,0.0009783811,0.00079949445,0.00046215826,0.0016932171,0.00020324944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017056427,0.00027663657,0.000413564,0.00010643197,0.0005859942,0.0010336731,0.0036107048,0.00010594042,0.0004293543],"category_scores_gemma":[0.006951491,0.00015138266,0.00031281283,0.0009908192,0.0007296146,0.00035483946,0.0005340935,0.0005023928,0.0007287892],"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.00037781178,0.00012696054,0.0003458594,0.0000041233156,0.000024511912,0.0000021053215,0.004612477,0.00008862796,0.00669829,0.43806705,0.007056583,0.54259557],"study_design_scores_gemma":[0.000042185497,0.0003583009,0.0001834903,0.000069275615,0.000024349212,0.0000057849943,0.03136262,0.024070734,0.04897419,0.89057815,0.0040459265,0.00028496518],"about_ca_topic_score_codex":0.00005583301,"about_ca_topic_score_gemma":0.000030080117,"teacher_disagreement_score":0.54231066,"about_ca_system_score_codex":0.00008557426,"about_ca_system_score_gemma":0.00015541258,"threshold_uncertainty_score":0.9967733},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042333324,0.000053857468,0.95142424,0.0021254402,0.0007201293,0.0006231348,0.000019721801,0.00017197913,0.002528193],"genre_scores_gemma":[0.9090283,0.00005803486,0.09017361,0.00021275884,0.00016234275,0.00010663435,0.000008046521,0.000031121144,0.0002191542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99662834,0.00003182465,0.0009314982,0.0010871516,0.00079121755,0.00052997685],"domain_scores_gemma":[0.99588555,0.00018304413,0.0009260267,0.00043598234,0.002455175,0.00011419739],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009627863,0.00046180835,0.000552854,0.0001483141,0.0005109373,0.0012889652,0.0028993383,0.0003376281,0.0000115560815],"category_scores_gemma":[0.00095302967,0.00040231462,0.0003400392,0.00034605913,0.00022129617,0.0003731314,0.0017202772,0.001483963,0.000008362084],"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.000038393053,0.00015275882,0.00003497574,0.00045365412,0.000041638792,5.8708673e-7,0.0021617613,0.07621888,0.015468536,0.87571794,0.00007381683,0.029637031],"study_design_scores_gemma":[0.00001646702,0.00007021477,0.0000047803023,0.00093566824,0.00002390724,0.000003244404,0.00018756212,0.6431093,0.061772037,0.29358366,0.00000572565,0.0002873824],"about_ca_topic_score_codex":0.00002820988,"about_ca_topic_score_gemma":0.0000048561365,"teacher_disagreement_score":0.866695,"about_ca_system_score_codex":0.00009963123,"about_ca_system_score_gemma":0.0007568531,"threshold_uncertainty_score":0.9998429},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9558188,0.00048526647,0.0006326147,0.009081913,0.0016675539,0.0007539596,0.00025619112,0.00010011437,0.031203628],"genre_scores_gemma":[0.99817795,0.00015388208,0.00023845093,0.00017088115,0.00030905023,0.000063682666,0.000011255793,0.00005516392,0.0008196953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99671006,0.000031980853,0.0014497337,0.0011182299,0.0001941601,0.000495859],"domain_scores_gemma":[0.99731505,0.00008176097,0.0017063662,0.0003994189,0.00038853707,0.00010888221],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014825403,0.0005253992,0.0011011433,0.00021806567,0.0004895259,0.0006757455,0.0014962626,0.000523989,0.00046122668],"category_scores_gemma":[0.0005941229,0.00051495316,0.00035333773,0.0003231371,0.00049462664,0.00023426327,0.0012788762,0.0010950478,0.00009855962],"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.00007072576,0.00012968082,0.0020108665,0.00060699636,0.000089264875,0.0000012257742,0.004798166,0.000021344384,0.0009836978,0.98659027,0.000094623894,0.0046031643],"study_design_scores_gemma":[0.00011757641,0.00014507769,0.0038779948,0.0013989846,0.00007438497,0.000018638832,0.0075794677,0.0041250773,0.03695145,0.94180703,0.0025240502,0.0013802554],"about_ca_topic_score_codex":0.00045377063,"about_ca_topic_score_gemma":0.000034999444,"teacher_disagreement_score":0.0447832,"about_ca_system_score_codex":0.00009400576,"about_ca_system_score_gemma":0.00007323648,"threshold_uncertainty_score":0.9997302},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7828608,0.00009177559,0.19300753,0.0026574354,0.0013617201,0.0018800043,0.000108999004,0.004457322,0.0135743935],"genre_scores_gemma":[0.9951273,0.00003900913,0.0044571264,0.0000910333,0.00007833104,0.00006727267,0.000019128296,0.00003329902,0.00008746179],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986243,0.000009922687,0.0004827324,0.00031830248,0.0002450709,0.00031965136],"domain_scores_gemma":[0.99904615,0.000073311,0.0001454747,0.00015723935,0.0005073496,0.000070455695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022873633,0.00023678847,0.00025735656,0.00014972966,0.0001434617,0.00011719087,0.00043337484,0.000111685455,0.000057874237],"category_scores_gemma":[0.00029491875,0.00020424715,0.00015748462,0.0005661488,0.00012364823,0.00012466041,0.00007063956,0.000279938,0.000008777488],"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.00051308546,0.00038098096,0.00009184753,0.0010543272,0.00028654892,0.0000053752524,0.0029153766,0.029908506,0.097731754,0.31322902,0.022539746,0.53134346],"study_design_scores_gemma":[0.000087389504,0.00021000311,0.000042411866,0.00037889692,0.000054850847,0.000010349413,0.0009041597,0.43615198,0.54185104,0.016833311,0.0031209753,0.00035462674],"about_ca_topic_score_codex":0.0000048540746,"about_ca_topic_score_gemma":0.00008618015,"teacher_disagreement_score":0.5309888,"about_ca_system_score_codex":0.000035767505,"about_ca_system_score_gemma":0.000040678642,"threshold_uncertainty_score":0.8328957},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95796424,0.000074256175,0.002401357,0.008063294,0.0005451342,0.00049224304,0.000040827053,0.000040211587,0.030378435],"genre_scores_gemma":[0.9971941,0.000010464098,0.00030640498,0.00032421414,0.00010831222,0.00004261675,0.0000013528374,0.000017048482,0.0019954648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983243,0.000019833735,0.0007255887,0.00047515376,0.000150953,0.0003041786],"domain_scores_gemma":[0.9986278,0.00009577307,0.00058135827,0.00031353254,0.0003054764,0.00007609915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014950712,0.00018382208,0.0003323611,0.000084497166,0.00027710552,0.00022704543,0.0007908175,0.00007153903,0.00029448583],"category_scores_gemma":[0.00090393703,0.00012409964,0.000107804015,0.0007013229,0.00016777248,0.00016480582,0.00019416896,0.00028584496,0.0003293366],"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.00006392554,0.00007535005,0.015272127,0.000057150322,0.00003065776,4.5377763e-7,0.0020249502,0.00006236265,0.00140487,0.9773942,0.00013187362,0.0034820556],"study_design_scores_gemma":[0.00013970546,0.0006195543,0.027451394,0.0011923575,0.000046682388,0.000049812865,0.01018715,0.0038898208,0.396409,0.55022967,0.008753796,0.0010310392],"about_ca_topic_score_codex":0.000066220535,"about_ca_topic_score_gemma":0.000036384714,"teacher_disagreement_score":0.42716455,"about_ca_system_score_codex":0.000049305327,"about_ca_system_score_gemma":0.000068736714,"threshold_uncertainty_score":0.50606364},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9530084,0.00011747002,0.03959532,0.00025511038,0.0016201707,0.00072905084,0.00018937838,0.0000952857,0.0043898136],"genre_scores_gemma":[0.99308217,0.000038785503,0.006282136,0.000011223349,0.00043438267,0.0000810679,0.000003151519,0.000038603666,0.000028481736],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985024,0.000016408143,0.00043197622,0.00036168532,0.0003543116,0.00033324037],"domain_scores_gemma":[0.9984633,0.00033045944,0.00019572055,0.0001817194,0.0007568302,0.00007201456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017249651,0.00026533837,0.0004419579,0.000053358475,0.00011927899,0.000068074434,0.00037313,0.00010075258,0.00003800703],"category_scores_gemma":[0.00038582174,0.00020914592,0.00017702732,0.00038793337,0.00022486527,0.00019539666,0.00011674535,0.0001972125,0.000006897088],"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.00054786255,0.00012853483,0.0044648545,0.00023445724,0.00063215155,0.0000049046666,0.002938279,0.0103478255,0.88242877,0.074826315,0.00026497344,0.023181073],"study_design_scores_gemma":[0.000046973222,0.00010488845,0.00019341144,0.0004956144,0.00013540061,0.0000014206328,0.0028535144,0.0046683312,0.9722868,0.018960696,0.000018676215,0.00023422578],"about_ca_topic_score_codex":0.00005339295,"about_ca_topic_score_gemma":0.000035433182,"teacher_disagreement_score":0.089858085,"about_ca_system_score_codex":0.00007516408,"about_ca_system_score_gemma":0.00008065568,"threshold_uncertainty_score":0.8528723},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31771746,0.00017163901,0.66964996,0.004306404,0.0011868393,0.0011818967,0.000014704743,0.00027727793,0.0054937955],"genre_scores_gemma":[0.976676,0.000056416502,0.02280969,0.00015614257,0.00006044444,0.000040421295,0.0000010447968,0.000018572622,0.00018129412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978869,0.000025013249,0.00067106506,0.000601068,0.0003605714,0.00045539316],"domain_scores_gemma":[0.99753636,0.00029466982,0.0005201087,0.00032217818,0.0012299517,0.00009674401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004273824,0.00024518656,0.00041249904,0.00012263953,0.00022439127,0.00012711814,0.0015871756,0.00011024882,0.00001999958],"category_scores_gemma":[0.0008843141,0.00020308357,0.00027682236,0.0011229285,0.0002497361,0.00035715755,0.0003607503,0.0003930716,0.0000033267781],"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.00005126948,0.00005989534,0.00011893822,0.00006257864,0.000021363463,4.4123365e-7,0.001789458,0.00051526516,0.35249233,0.5363854,0.00002248447,0.10848057],"study_design_scores_gemma":[0.00004864394,0.00021016572,0.00004593157,0.00019647401,0.00001280261,0.000004765016,0.001052029,0.22038768,0.6262359,0.15154931,0.000073301075,0.00018299883],"about_ca_topic_score_codex":0.0000067825426,"about_ca_topic_score_gemma":0.0000078967705,"teacher_disagreement_score":0.6589585,"about_ca_system_score_codex":0.000021122454,"about_ca_system_score_gemma":0.0001424169,"threshold_uncertainty_score":0.82815075},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00858897,0.000050650564,0.9754525,0.0050887833,0.0014760841,0.0005081023,0.00000928054,0.00021242496,0.008613239],"genre_scores_gemma":[0.94456744,0.000109597975,0.054509558,0.00016634636,0.00012486272,0.00006633877,0.000011084125,0.000023780669,0.0004209727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99683285,0.00006482463,0.00084189407,0.0011185583,0.0007409112,0.00040098178],"domain_scores_gemma":[0.99672055,0.000085229556,0.0010547894,0.0008068796,0.0012176682,0.00011489103],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00068626483,0.00042856464,0.00047798853,0.00018152938,0.0002506119,0.0010994608,0.0037491277,0.00028770772,0.00012254855],"category_scores_gemma":[0.000558448,0.00034468944,0.00025134417,0.0006977504,0.00026002384,0.0005405046,0.0021281717,0.0012502145,0.000027424523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063071406,0.0003623914,0.00028169464,0.00046810805,0.00010921791,0.0000031854931,0.0054779416,0.11697537,0.044868518,0.56884265,0.00016866771,0.2623792],"study_design_scores_gemma":[0.000013259989,0.0000687697,0.0000474958,0.00079379056,0.000021693031,0.000006208229,0.0002592224,0.89706457,0.06147345,0.03989432,0.000022853765,0.00033437574],"about_ca_topic_score_codex":0.00014684178,"about_ca_topic_score_gemma":0.0000064380324,"teacher_disagreement_score":0.9359785,"about_ca_system_score_codex":0.000117507996,"about_ca_system_score_gemma":0.00030170914,"threshold_uncertainty_score":0.9999375},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85574645,0.00015370402,0.11111159,0.029572284,0.0009180958,0.0013223874,0.000008899878,0.00018246076,0.0009841148],"genre_scores_gemma":[0.99681,0.000036807003,0.0023921293,0.00048275685,0.000049855014,0.00012859571,6.299486e-7,0.000012151979,0.00008703284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983103,0.000034442877,0.00032229166,0.0005643009,0.00037853635,0.00039010355],"domain_scores_gemma":[0.9990908,0.00011548366,0.000263304,0.00031294455,0.00013089018,0.0000865749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035881778,0.00019853101,0.00021988059,0.00013088333,0.0003077725,0.00016176594,0.001604697,0.000038558734,0.000018937557],"category_scores_gemma":[0.00008737955,0.000170951,0.000060683422,0.0010062122,0.00020494222,0.0003666359,0.001062804,0.0005055804,0.0000041146986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008441964,0.00025320536,0.0015179346,0.000021529448,0.00000835221,0.000004273066,0.0019063606,0.06309442,0.0060808742,0.71593434,0.00047804817,0.21061628],"study_design_scores_gemma":[0.000030569172,0.00013880433,0.00068652804,0.000029366745,0.0000042713436,0.000017319338,0.00028884,0.9319219,0.008229821,0.058332246,0.00013357455,0.00018674733],"about_ca_topic_score_codex":0.0000100668285,"about_ca_topic_score_gemma":0.000017926583,"teacher_disagreement_score":0.86882746,"about_ca_system_score_codex":0.00006658185,"about_ca_system_score_gemma":0.000027267952,"threshold_uncertainty_score":0.6971179},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24701434,0.00006614348,0.743725,0.004866353,0.0011956206,0.00088343705,0.000007856547,0.00022456283,0.0020166629],"genre_scores_gemma":[0.97232425,0.00004874789,0.026582977,0.00034077122,0.00024569672,0.00006297263,0.000013710375,0.000031706808,0.00034918543],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996574,0.000058796944,0.00082757795,0.001175957,0.00091610174,0.00044760326],"domain_scores_gemma":[0.9966417,0.00008456184,0.00096559315,0.0006623455,0.0015184649,0.0001273328],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00034739642,0.0005094295,0.00059611,0.00019875736,0.0003015314,0.0011986085,0.00235746,0.00020731584,0.00015122895],"category_scores_gemma":[0.00031498203,0.0003796163,0.00021790764,0.0005077359,0.000267325,0.00086894387,0.0017078854,0.00087711273,0.00004250768],"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.00018892092,0.00046317614,0.00012271393,0.00018469316,0.00008587663,0.000007684525,0.0025118813,0.003461598,0.49808598,0.13674292,0.0003275555,0.357817],"study_design_scores_gemma":[0.00004102756,0.00016321821,0.00007063515,0.00050348963,0.000027705477,0.000011570949,0.00015789692,0.6746132,0.3115718,0.012463923,0.000021614725,0.00035396474],"about_ca_topic_score_codex":0.000045289667,"about_ca_topic_score_gemma":0.0000058644546,"teacher_disagreement_score":0.7253099,"about_ca_system_score_codex":0.000102528975,"about_ca_system_score_gemma":0.00026624708,"threshold_uncertainty_score":0.9998656},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7813497,0.000024537247,0.000089720714,0.082430035,0.0013006885,0.0009483741,0.0000487516,0.000059181046,0.133749],"genre_scores_gemma":[0.9980232,0.000059449354,0.00004075446,0.00064966205,0.00012717438,0.000042080414,4.2221384e-7,0.0000132802425,0.0010439579],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99763066,0.00012836773,0.00043019254,0.00026727904,0.0011811714,0.00036235974],"domain_scores_gemma":[0.99776787,0.0005700774,0.00049482286,0.0001929861,0.00088993396,0.00008432552],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0028595168,0.00015281505,0.00023830621,0.000085325715,0.0015089652,0.00013778993,0.0016257389,0.000094117124,0.0009922797],"category_scores_gemma":[0.0026113112,0.000105709405,0.00015551096,0.0006949864,0.0011985577,0.0001746589,0.0002630906,0.0007361336,0.000023742856],"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.000068596804,0.0001566153,0.000060965343,0.0000089713685,0.00001572707,2.5448728e-7,0.017941484,0.000029105275,0.0026215934,0.96904945,0.0009901628,0.009057058],"study_design_scores_gemma":[0.000025724003,0.00038711942,0.00012827526,0.00009706456,0.00002311655,5.7730966e-7,0.05907952,0.00066136965,0.049624182,0.8886585,0.001116938,0.00019759976],"about_ca_topic_score_codex":0.0018686244,"about_ca_topic_score_gemma":0.00026111968,"teacher_disagreement_score":0.21667351,"about_ca_system_score_codex":0.00011327375,"about_ca_system_score_gemma":0.00041338982,"threshold_uncertainty_score":0.99992096},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31207407,0.0015985084,0.46871248,0.15664928,0.010725164,0.003482906,0.00013445737,0.0048593436,0.04176379],"genre_scores_gemma":[0.93559897,0.00044852466,0.0634199,0.00015075965,0.00008851777,0.00006435244,0.00000798599,0.000033504442,0.0001874701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959038,0.00005937857,0.0009415086,0.0014816346,0.0010014287,0.0006122319],"domain_scores_gemma":[0.99263155,0.00019015644,0.0011164353,0.0048251823,0.0011299177,0.00010675533],"candidate_categories":["metaresearch","metaepi_narrow","open_science","research_integrity"],"consensus_categories":["open_science"],"category_scores_codex":[0.0009933219,0.00056040805,0.0006913129,0.00028756945,0.00029318628,0.0010305565,0.053805795,0.000511218,0.000098039294],"category_scores_gemma":[0.024833782,0.00045941022,0.0003086106,0.000986433,0.000610653,0.00053850724,0.16961527,0.0026664224,0.00006625222],"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.00007700247,0.00059103407,0.0012737276,0.0009682644,0.00019632211,0.000019587707,0.0019963705,0.00047553776,0.041668836,0.73280174,0.007592175,0.2123394],"study_design_scores_gemma":[0.000012588632,0.00006888956,0.000042235868,0.00081019173,0.000017559807,0.00000895936,0.000260928,0.25688645,0.29567307,0.44574413,0.000112290676,0.0003626927],"about_ca_topic_score_codex":0.0001690818,"about_ca_topic_score_gemma":0.000019243938,"teacher_disagreement_score":0.6235249,"about_ca_system_score_codex":0.00015159139,"about_ca_system_score_gemma":0.0003590916,"threshold_uncertainty_score":0.9997858},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6692301,0.000028135892,0.31806535,0.011324037,0.00046300283,0.00020142645,0.0000014785335,0.000052502583,0.00063397014],"genre_scores_gemma":[0.993459,0.00003359957,0.005478972,0.00045857835,0.000116225936,0.000019691175,4.4308413e-7,0.000009250608,0.0004242475],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99836427,0.00006209838,0.00038554732,0.00057018874,0.0003582616,0.00025965134],"domain_scores_gemma":[0.9988793,0.00012071677,0.00017458394,0.0002471207,0.00048537244,0.00009290197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064600894,0.00016969524,0.00020889723,0.000088855304,0.00023729971,0.0003671762,0.00072977925,0.000067037145,0.00004484967],"category_scores_gemma":[0.00067985937,0.0001373838,0.00006195616,0.00042885754,0.000092752314,0.0004469828,0.00037317627,0.00024553412,0.00003097588],"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.00020369515,0.00008839821,0.0006042843,0.00003544375,0.000018213694,0.0000032253715,0.007337601,0.002272465,0.49017873,0.13013813,0.000100479956,0.36901933],"study_design_scores_gemma":[0.000031768916,0.00013835556,0.0003331461,0.00014016202,0.000008299526,0.0000112083735,0.00055672775,0.3653117,0.61305994,0.019958293,0.00022360332,0.00022678278],"about_ca_topic_score_codex":0.000029176206,"about_ca_topic_score_gemma":0.000026866404,"teacher_disagreement_score":0.36879253,"about_ca_system_score_codex":0.00003455117,"about_ca_system_score_gemma":0.00010095629,"threshold_uncertainty_score":0.5602349},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04457466,0.000048090908,0.8827012,0.01805729,0.0004930494,0.00056287064,0.0000071117233,0.00026150266,0.05329421],"genre_scores_gemma":[0.9713092,0.000043806573,0.027870968,0.0002902481,0.000035455363,0.000019741401,5.3202996e-7,0.000008074278,0.00042199864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854255,0.000017777978,0.00032855954,0.00038199543,0.00046230078,0.00026680608],"domain_scores_gemma":[0.99807787,0.000070724374,0.00018787799,0.00026606742,0.0013004673,0.00009701169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002847879,0.00013781163,0.00016632809,0.00007428898,0.0002355691,0.00035275333,0.0009942831,0.000056707548,0.00012410097],"category_scores_gemma":[0.00031416037,0.000096175434,0.000066201,0.00084630976,0.0001757265,0.0004756218,0.0002251411,0.0002819826,0.000045540382],"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.000018870085,0.00013823186,0.00024434229,0.000017135515,0.000016909557,0.0000012019112,0.0006471755,0.0026193208,0.012345261,0.9704829,0.000040791143,0.013427855],"study_design_scores_gemma":[0.00005032174,0.00018119962,0.00024196884,0.00025693668,0.0000107647165,0.000020618818,0.00048710333,0.53445816,0.4149162,0.048987463,0.00019607249,0.00019321755],"about_ca_topic_score_codex":0.000012003637,"about_ca_topic_score_gemma":0.000011983053,"teacher_disagreement_score":0.9267345,"about_ca_system_score_codex":0.000027167176,"about_ca_system_score_gemma":0.0002583063,"threshold_uncertainty_score":0.39219207},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3714171,0.0002921396,0.58106154,0.017340468,0.0022294475,0.0030670327,0.0002940631,0.00027956866,0.024018634],"genre_scores_gemma":[0.9874324,0.0001317736,0.0101515185,0.00017261057,0.000070737675,0.000022108747,0.0000021091394,0.000023475459,0.0019932736],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9948213,0.000083299776,0.0011029703,0.00091815635,0.0024430219,0.00063125207],"domain_scores_gemma":[0.99388355,0.00068332365,0.0005697558,0.00053720525,0.004070977,0.00025518864],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016736067,0.0003089238,0.0005287943,0.00018767978,0.0003664207,0.0003509172,0.001861379,0.00012443149,0.0023116304],"category_scores_gemma":[0.007015855,0.00018734946,0.00018847488,0.0017599905,0.0013132184,0.00038904027,0.00044824762,0.0005330491,0.00047234475],"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.0024336996,0.001747181,0.0051852996,0.000087914275,0.00020339455,0.00006496065,0.004172777,0.0035897011,0.10736001,0.25284672,0.0010552262,0.62125313],"study_design_scores_gemma":[0.0002780351,0.00029457986,0.0012876366,0.00031340207,0.000025691576,0.000046888,0.004934984,0.047415335,0.8890674,0.053895634,0.002007994,0.00043241112],"about_ca_topic_score_codex":0.000014012012,"about_ca_topic_score_gemma":0.00005515578,"teacher_disagreement_score":0.7817074,"about_ca_system_score_codex":0.0000958323,"about_ca_system_score_gemma":0.00048482773,"threshold_uncertainty_score":0.99860036},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028739685,0.000028325003,0.943043,0.013110702,0.0007565086,0.00060629804,0.0000042532547,0.00013948852,0.01357177],"genre_scores_gemma":[0.95132405,0.000033279168,0.045512103,0.0002571035,0.00009010803,0.000062140876,0.0000022804086,0.0000137144225,0.0027052462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99812603,0.000014332333,0.0005498489,0.0006083623,0.0004033109,0.0002981094],"domain_scores_gemma":[0.99770653,0.00008027904,0.0003598252,0.00047487346,0.0013133164,0.00006518644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046889044,0.00017121065,0.00021075594,0.000085593616,0.00022406799,0.0003056851,0.0013127417,0.00011376822,0.000035857334],"category_scores_gemma":[0.0006021843,0.00014599574,0.00011616933,0.0006705938,0.000095540156,0.00044600165,0.000263325,0.00017780454,0.00003592954],"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.000016585513,0.000067039255,0.00006891284,0.000040399867,0.0000070968194,1.6706876e-7,0.00048620068,0.00012221848,0.09778082,0.85987645,0.00016157897,0.041372497],"study_design_scores_gemma":[0.000023406263,0.00004078071,0.000087000524,0.00010206617,0.000008009385,0.0000025019092,0.00035224942,0.3036117,0.4261465,0.2690599,0.0004453054,0.000120596145],"about_ca_topic_score_codex":0.000008313697,"about_ca_topic_score_gemma":0.00000393226,"teacher_disagreement_score":0.92258435,"about_ca_system_score_codex":0.00006111784,"about_ca_system_score_gemma":0.00018864292,"threshold_uncertainty_score":0.59535336},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056137502,0.000024151437,0.93643034,0.0014897069,0.0004947946,0.00037678296,0.0000016249144,0.00010172073,0.004943405],"genre_scores_gemma":[0.9700843,0.000008704552,0.027623937,0.000052217976,0.00009778247,0.000036657926,7.3764954e-7,0.000009324704,0.002086348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868494,0.000013308087,0.0004127607,0.00043167645,0.00021638884,0.00024091853],"domain_scores_gemma":[0.9983043,0.0000788015,0.00022997495,0.00021099896,0.0011220233,0.000053898184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003462805,0.00014724236,0.00017295641,0.00006720752,0.00018863696,0.00019145207,0.0007669693,0.00008719387,0.00002961366],"category_scores_gemma":[0.0007373811,0.00012169783,0.00011169194,0.0004792538,0.000062717685,0.0003357686,0.00020727872,0.00016795419,0.000026944275],"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.000017546454,0.000058109075,0.00014396598,0.000039885785,0.000009140077,5.042872e-8,0.001075811,0.00047510248,0.06448464,0.8663863,0.000055130684,0.06725433],"study_design_scores_gemma":[0.000023985767,0.0000366949,0.000052305673,0.00006201561,0.0000056270833,0.0000020273349,0.00014261654,0.5958485,0.38325432,0.02031871,0.00015749475,0.00009571602],"about_ca_topic_score_codex":0.000013869095,"about_ca_topic_score_gemma":0.000016787732,"teacher_disagreement_score":0.9139468,"about_ca_system_score_codex":0.00006146718,"about_ca_system_score_gemma":0.00013485343,"threshold_uncertainty_score":0.49626935},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036886945,0.000030731124,0.9456621,0.011662337,0.0004428109,0.00035294707,0.000009181567,0.0001289058,0.0048240833],"genre_scores_gemma":[0.9098672,0.000024226403,0.08937024,0.00033033543,0.000061806444,0.00003504182,0.0000046646924,0.000010045715,0.00029640962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855316,0.000021634942,0.00042236355,0.0004633231,0.00029790797,0.0002416314],"domain_scores_gemma":[0.99823654,0.00016366385,0.00033479073,0.00031912353,0.0008902765,0.00005559104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000473397,0.000144886,0.00017586211,0.00006987953,0.00022815543,0.00034706696,0.0010089695,0.00006610847,0.000041285923],"category_scores_gemma":[0.0014798183,0.000114221315,0.00009622862,0.00048234998,0.000086474145,0.0004134176,0.00023781248,0.0001802924,0.00002356141],"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.0000266924,0.00007897191,0.00020528417,0.000045351106,0.000010492491,1.7074431e-7,0.0005851674,0.002379783,0.038215816,0.8589799,0.00018801223,0.09928438],"study_design_scores_gemma":[0.000021539125,0.00007037447,0.000046712554,0.000076073426,0.00000869656,0.0000019733468,0.00023257673,0.57742774,0.37876928,0.042821232,0.00040115567,0.00012265374],"about_ca_topic_score_codex":0.000010063037,"about_ca_topic_score_gemma":0.0000037655886,"teacher_disagreement_score":0.8729803,"about_ca_system_score_codex":0.000026607093,"about_ca_system_score_gemma":0.00010291038,"threshold_uncertainty_score":0.465781},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8166216,0.000059511465,0.17023566,0.01001228,0.00054168684,0.00033347975,0.000008296669,0.00011199837,0.0020755082],"genre_scores_gemma":[0.99032825,0.000011338763,0.008983578,0.00031966792,0.0000810987,0.00001535793,0.0000017128128,0.00001008121,0.00024888446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99817663,0.00005787039,0.00040045785,0.00052613846,0.0005780497,0.00026082018],"domain_scores_gemma":[0.9977289,0.00009570881,0.00023111385,0.00037957603,0.0014842681,0.00008042674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034853243,0.0001861871,0.00020172274,0.00006811358,0.00023990539,0.00026524955,0.00093475817,0.00007799757,0.0000474273],"category_scores_gemma":[0.00024005487,0.00013979695,0.000079800964,0.0004656487,0.0001731219,0.00029203546,0.00029116235,0.0002462718,0.00003269251],"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.00028923593,0.00017768813,0.00087639777,0.00005717416,0.000033802855,0.000013038827,0.006754624,0.0025838714,0.18963589,0.7507481,0.00033116492,0.04849904],"study_design_scores_gemma":[0.00005709256,0.00019766937,0.0004624253,0.00023111343,0.00001130408,0.000048093236,0.0012608843,0.20646836,0.7842898,0.006600105,0.00012674561,0.00024641448],"about_ca_topic_score_codex":0.00002168473,"about_ca_topic_score_gemma":0.000029752493,"teacher_disagreement_score":0.74414796,"about_ca_system_score_codex":0.00007957715,"about_ca_system_score_gemma":0.0003555549,"threshold_uncertainty_score":0.5700754},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11292034,0.00018152014,0.7341576,0.032209273,0.0016744698,0.0016968511,0.000062688974,0.0004355884,0.11666165],"genre_scores_gemma":[0.9683263,0.000018775456,0.030988181,0.00017338103,0.000033850793,0.0000148500285,0.0000024382687,0.00000706581,0.0004351888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983589,0.000018749304,0.00046298504,0.00041549487,0.00049509807,0.0002487464],"domain_scores_gemma":[0.9984299,0.000052608037,0.00035021562,0.00037779807,0.0007404424,0.00004903528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046088017,0.00014787001,0.00020895121,0.00010609676,0.00010244833,0.00018597889,0.0016590952,0.000053042597,0.000050733666],"category_scores_gemma":[0.00022808254,0.000117036376,0.00010724803,0.00091197086,0.00017591906,0.00045911493,0.0005178251,0.00015866697,0.000043152846],"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.000020149662,0.00017857995,0.000118612865,0.00007900325,0.000011592774,9.0267133e-7,0.00022781662,0.00007428183,0.030007843,0.9105967,0.00034857684,0.058335934],"study_design_scores_gemma":[0.000036256366,0.00012813631,0.00019842216,0.00028237212,0.00001336874,0.0000014477458,0.00020979135,0.12493897,0.7482799,0.12522769,0.0005249335,0.00015865477],"about_ca_topic_score_codex":0.00002521447,"about_ca_topic_score_gemma":0.00001083512,"teacher_disagreement_score":0.8554059,"about_ca_system_score_codex":0.000024740073,"about_ca_system_score_gemma":0.00013943342,"threshold_uncertainty_score":0.4772605},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.636625,0.0000608244,0.35747632,0.0013548122,0.00037641902,0.00018125078,0.0000019929257,0.00006748278,0.0038559118],"genre_scores_gemma":[0.96502995,0.000015013868,0.03468015,0.00006620808,0.000051032246,0.0000038537346,2.6106306e-7,0.000011007982,0.00014252812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998058,0.00003267618,0.00057352724,0.0004927668,0.0005386092,0.0003044039],"domain_scores_gemma":[0.99833316,0.00007434746,0.00037841254,0.00035502182,0.0007886844,0.00007037914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032092302,0.0001970277,0.0003090884,0.00010468575,0.00016303717,0.00016124669,0.00146208,0.00008534503,0.00006713067],"category_scores_gemma":[0.0004937228,0.00015383238,0.00014421857,0.0006336926,0.00021573564,0.00037475713,0.0005223974,0.00033715938,0.0000055318264],"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.000014971321,0.00006465799,0.000497757,0.0000495811,0.000017348135,0.0000011701432,0.0023520286,0.0048473855,0.18109113,0.75541127,0.000005444424,0.055647247],"study_design_scores_gemma":[0.000019483754,0.000037999424,0.00012687396,0.000142783,0.000011055906,0.0000061989263,0.0010366777,0.4922849,0.42532948,0.08088329,0.0000078213425,0.000113442155],"about_ca_topic_score_codex":0.00006177033,"about_ca_topic_score_gemma":0.000010852174,"teacher_disagreement_score":0.674528,"about_ca_system_score_codex":0.00003618408,"about_ca_system_score_gemma":0.00026391697,"threshold_uncertainty_score":0.6273102},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96602684,0.00007796525,0.03167985,0.00013922183,0.00017501517,0.00029046822,0.000005432125,0.00009089064,0.0015143267],"genre_scores_gemma":[0.99564314,0.000049173603,0.004175196,0.000051483767,0.00002866609,0.000016069826,0.0000022402985,0.00001796363,0.000016086582],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989339,0.000006853919,0.0004085323,0.00023548119,0.00021052147,0.00020472107],"domain_scores_gemma":[0.99930197,0.000030553365,0.00011358012,0.00017253021,0.0003361596,0.000045177894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000085236185,0.00015225993,0.0002457331,0.00007565448,0.00004062117,0.0000612366,0.00035173303,0.000081212886,0.000016608992],"category_scores_gemma":[0.00005346498,0.00013462997,0.000050586,0.00041703176,0.00004526587,0.00013538996,0.0001568653,0.00019996168,0.0000015907729],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007826859,0.00006511962,0.00027921033,0.000017286276,0.0000073569336,2.9431897e-7,0.0004064252,0.73874193,0.23382056,0.01539575,0.00004096385,0.011146853],"study_design_scores_gemma":[0.000015777176,0.000021761443,0.000108207605,0.0003887169,0.0000045490647,3.6334683e-7,0.000066612476,0.5101828,0.48537058,0.003767795,0.0000020050197,0.00007085311],"about_ca_topic_score_codex":0.000065343214,"about_ca_topic_score_gemma":0.000027646387,"teacher_disagreement_score":0.25155002,"about_ca_system_score_codex":0.000032959186,"about_ca_system_score_gemma":0.000022579225,"threshold_uncertainty_score":0.5490051},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8850184,0.00017208185,0.090266764,0.007207516,0.001352825,0.00055723346,0.000021032,0.00013335395,0.0152707705],"genre_scores_gemma":[0.9954897,0.000057270354,0.003969042,0.00013369178,0.00004841315,0.000010936069,9.137906e-7,0.00000992653,0.0002800814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9976421,0.000045743112,0.0008342406,0.0005651655,0.000621594,0.00029114724],"domain_scores_gemma":[0.9973163,0.00021433657,0.00052610796,0.0003760864,0.0014699841,0.000097180084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005518949,0.00022165492,0.0003387361,0.00010424752,0.00018194968,0.00019736834,0.0013052839,0.0001346455,0.00016668912],"category_scores_gemma":[0.00086441345,0.00017893533,0.00012864442,0.0008044226,0.00059016823,0.0005102159,0.00060458755,0.00031506203,0.000035839614],"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.00003191981,0.00014123789,0.0006645146,0.000030026486,0.000022947108,0.0000014498273,0.0015851359,0.00007534167,0.13215119,0.8437922,0.00007529101,0.021428723],"study_design_scores_gemma":[0.00001528805,0.000065900735,0.00043501728,0.0001295927,0.000012834539,0.000012158253,0.00037777898,0.030988818,0.7675764,0.20017721,0.000058605274,0.00015040221],"about_ca_topic_score_codex":0.000053696764,"about_ca_topic_score_gemma":0.0000250052,"teacher_disagreement_score":0.643615,"about_ca_system_score_codex":0.00003737089,"about_ca_system_score_gemma":0.00025892272,"threshold_uncertainty_score":0.7296771},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031030276,0.000044236487,0.98887414,0.0035980437,0.002327574,0.0010126937,0.00023927026,0.00019301518,0.00060802215],"genre_scores_gemma":[0.9108136,0.000119745,0.087872334,0.00014971397,0.00042291885,0.00025942427,0.0001507257,0.000024959852,0.00018655253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973805,0.00003246941,0.0007882739,0.0008772756,0.0004911574,0.00043032464],"domain_scores_gemma":[0.99714833,0.00013441865,0.00073389587,0.00045018242,0.0014173015,0.00011587303],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004475192,0.00037238558,0.00042481007,0.00008559656,0.00044057312,0.0009058063,0.0015658581,0.0002773205,0.000082394305],"category_scores_gemma":[0.00038616813,0.00032572277,0.0003364029,0.00060516596,0.0002595233,0.00041755257,0.0010029342,0.00063054246,0.000007125225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005767901,0.00028070324,0.00026543823,0.00020152063,0.000117601354,0.0000010906225,0.0009144939,0.1565433,0.00040896836,0.5109928,0.0025996848,0.3276167],"study_design_scores_gemma":[0.00003241516,0.000090236696,0.0006339673,0.00039829794,0.000051228042,0.0000066551906,0.00020204544,0.95342815,0.005250408,0.039465953,0.0001308825,0.0003097735],"about_ca_topic_score_codex":0.000052543965,"about_ca_topic_score_gemma":0.000030563166,"teacher_disagreement_score":0.9077106,"about_ca_system_score_codex":0.00012413287,"about_ca_system_score_gemma":0.00030126833,"threshold_uncertainty_score":0.9999195},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6189232,0.000233085,0.19014141,0.122595064,0.003122493,0.0015321891,0.00016631091,0.0023244235,0.0609618],"genre_scores_gemma":[0.97865653,0.00010118789,0.020146407,0.0003755619,0.000064589374,0.000017769471,0.00001267764,0.000022480375,0.00060277915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9965976,0.0000440237,0.00063433003,0.0013129563,0.00085260527,0.00055847183],"domain_scores_gemma":[0.99389577,0.00026718507,0.00049354904,0.0041348604,0.0011065798,0.00010203955],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0009821209,0.0003329558,0.00038047324,0.00013855255,0.0005498006,0.0012365462,0.032907113,0.00019673281,0.00015598508],"category_scores_gemma":[0.03257003,0.00027130297,0.00010334301,0.0012449002,0.0005617495,0.0010373694,0.047248676,0.0009448074,0.00023833443],"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.00024847873,0.0006531125,0.0020253642,0.00015665976,0.000117192016,0.00002412628,0.0008478214,0.000109791115,0.17843592,0.6304137,0.02205699,0.16491081],"study_design_scores_gemma":[0.000051965828,0.0001417107,0.0001948033,0.0002858,0.000008706699,0.000011897258,0.0003484535,0.29272828,0.5431193,0.16216952,0.0006557659,0.00028377242],"about_ca_topic_score_codex":0.000038135542,"about_ca_topic_score_gemma":0.000010322413,"teacher_disagreement_score":0.4682442,"about_ca_system_score_codex":0.00008588683,"about_ca_system_score_gemma":0.00030501597,"threshold_uncertainty_score":0.9999739},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0594367,0.00006915782,0.9341389,0.0036304027,0.00021105015,0.00027189308,0.0000045241954,0.000055411845,0.0021819428],"genre_scores_gemma":[0.98609453,0.00003889509,0.013473891,0.00018202091,0.000052397707,0.000019894878,5.3675444e-7,0.000010443975,0.00012741213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859685,0.000008770118,0.00035682635,0.0004606801,0.00028122411,0.00029563432],"domain_scores_gemma":[0.99925476,0.00006515359,0.000112336806,0.0002035671,0.00029404412,0.00007010682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031598654,0.0001615788,0.0002007499,0.00006344691,0.00021472272,0.00024514442,0.00066455215,0.000071110924,0.00001614027],"category_scores_gemma":[0.00010624296,0.00013223731,0.00009345069,0.00025660743,0.00007396936,0.00036651973,0.00013943731,0.00017085682,0.000003190488],"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.00001924734,0.000033890872,0.00002918288,0.00008476495,0.000015367368,5.7097634e-7,0.0033659486,0.000697986,0.03404621,0.9244113,0.000011395406,0.03728416],"study_design_scores_gemma":[0.00003266312,0.000039774804,0.0000010698146,0.00013366283,0.000010158827,0.000004423679,0.003967937,0.6312702,0.2204279,0.14398062,0.000009824511,0.000121770754],"about_ca_topic_score_codex":0.000015726719,"about_ca_topic_score_gemma":0.000017026381,"teacher_disagreement_score":0.9266578,"about_ca_system_score_codex":0.00006246805,"about_ca_system_score_gemma":0.00010117531,"threshold_uncertainty_score":0.5392481},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30007103,0.00001864015,0.6943529,0.002961408,0.00025102543,0.000382507,0.0000018190123,0.000084006155,0.0018766423],"genre_scores_gemma":[0.96881425,0.000009130716,0.03032062,0.00014555348,0.000102521924,0.00005308087,0.0000020889215,0.000012021952,0.0005407175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982929,0.000025532203,0.0004541541,0.0005498551,0.00037651628,0.00030101376],"domain_scores_gemma":[0.9981703,0.00015452036,0.00030274416,0.00025952264,0.0010488112,0.0000641117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038259925,0.000163637,0.00021808004,0.00007344825,0.00039644563,0.0003725564,0.0007166122,0.00005505682,0.00001885838],"category_scores_gemma":[0.00070923456,0.00013047815,0.000082584585,0.0004498283,0.00011495325,0.00041656962,0.00018147218,0.00022693278,0.0000054712946],"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.00003624072,0.00008161885,0.00042858347,0.000042627882,0.00003743608,0.0000011118121,0.008680462,0.006309694,0.15170668,0.7539288,0.00004612219,0.078700654],"study_design_scores_gemma":[0.000047823905,0.00012905819,0.000054954875,0.00019816199,0.000016033802,0.000010898259,0.002755524,0.598484,0.38182813,0.016284827,0.000046011635,0.000144571],"about_ca_topic_score_codex":0.000025772366,"about_ca_topic_score_gemma":0.000036312176,"teacher_disagreement_score":0.73764396,"about_ca_system_score_codex":0.000035710927,"about_ca_system_score_gemma":0.00022181448,"threshold_uncertainty_score":0.53207445},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05475348,0.000029343833,0.8946324,0.010190126,0.00038560043,0.0004826482,0.0000023229773,0.00023126429,0.03929281],"genre_scores_gemma":[0.98322034,0.000023057386,0.015366871,0.00040376408,0.00007933892,0.000016566384,0.0000011581399,0.00001498072,0.0008738977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99801266,0.00002512185,0.00049694185,0.0004675861,0.0006163224,0.0003813361],"domain_scores_gemma":[0.99808264,0.00009105094,0.00042468755,0.0004299217,0.0008891513,0.00008257645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003355165,0.0002292444,0.00026105775,0.0001382842,0.00026123674,0.00071418384,0.0014857013,0.0000733031,0.000037828202],"category_scores_gemma":[0.00042767354,0.00016739278,0.00008342806,0.0010215257,0.00020532978,0.00065760995,0.00049597415,0.00032851324,0.00004412198],"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.000023928356,0.00006564477,0.00050281716,0.000056044,0.0000199446,0.0000018230029,0.0017463339,0.011428122,0.021778071,0.94376254,0.00007548477,0.02053924],"study_design_scores_gemma":[0.000031679578,0.00016410468,0.00017402173,0.0003138223,0.000010184348,0.000018537934,0.00038159036,0.46851817,0.49532336,0.03469945,0.00014162951,0.00022345406],"about_ca_topic_score_codex":0.000029145422,"about_ca_topic_score_gemma":0.0000082182505,"teacher_disagreement_score":0.9284669,"about_ca_system_score_codex":0.000067743924,"about_ca_system_score_gemma":0.00027602114,"threshold_uncertainty_score":0.6886891},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27118668,0.00008619171,0.7112715,0.0028558655,0.0006279883,0.00067594025,0.000008337037,0.00028789733,0.012999555],"genre_scores_gemma":[0.97858495,0.00012043451,0.020683195,0.00015408064,0.00009732499,0.00010635537,0.000001821415,0.000018150728,0.00023371371],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99747795,0.00004310593,0.0004988885,0.0010097706,0.0005682238,0.00040205012],"domain_scores_gemma":[0.9970733,0.00010708561,0.0006767132,0.00046701363,0.0016151511,0.000060754788],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033055438,0.00045648048,0.00060208054,0.000101629485,0.00043283193,0.000431136,0.0024394682,0.00031402093,0.000014454269],"category_scores_gemma":[0.00024490632,0.00032535451,0.00018444512,0.000517434,0.00071083556,0.00039719432,0.002910497,0.0017555067,0.0000098842165],"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.000041092033,0.00015248933,0.00009638048,0.00007376216,0.00013171963,0.0000025565967,0.01836648,0.009131457,0.0017701202,0.92219573,0.000026353102,0.048011888],"study_design_scores_gemma":[0.000026699388,0.00020232258,0.000042404296,0.0005999534,0.000030341596,0.000003650684,0.0034963572,0.38670617,0.15197709,0.45652923,0.0000079976435,0.00037778475],"about_ca_topic_score_codex":0.00007364901,"about_ca_topic_score_gemma":0.000026619868,"teacher_disagreement_score":0.70739824,"about_ca_system_score_codex":0.000080244914,"about_ca_system_score_gemma":0.00031398117,"threshold_uncertainty_score":0.99991983},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15897724,0.00013854378,0.78097063,0.044714607,0.00431093,0.002649602,0.00006365814,0.00033300323,0.007841812],"genre_scores_gemma":[0.984163,0.00007141113,0.011368944,0.0026433663,0.00018973164,0.00013603702,0.000002496785,0.000018986571,0.0014060606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970023,0.00007508096,0.000804289,0.00091795344,0.0006524864,0.0005478896],"domain_scores_gemma":[0.99483067,0.00045126583,0.0005060356,0.0006950467,0.0033652885,0.00015171248],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00062792306,0.00037531374,0.00047748003,0.000089837835,0.00076424726,0.0015822126,0.0027418444,0.00013395344,0.00011729496],"category_scores_gemma":[0.0005306515,0.00023810893,0.00016650285,0.00085739914,0.00041138977,0.0016168305,0.0005898537,0.00051922817,0.00004105818],"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.00014368763,0.00043766812,0.000053072185,0.00007296237,0.000059743314,0.0000011316748,0.013434309,0.0008416687,0.012854459,0.945792,0.0047306437,0.021578658],"study_design_scores_gemma":[0.00011182733,0.00049147673,0.000027118209,0.0007764627,0.000057414065,0.000012860653,0.023740308,0.6707511,0.19745347,0.1026309,0.0034280687,0.0005190196],"about_ca_topic_score_codex":0.0001332753,"about_ca_topic_score_gemma":0.001004773,"teacher_disagreement_score":0.8431611,"about_ca_system_score_codex":0.00007338214,"about_ca_system_score_gemma":0.0004570909,"threshold_uncertainty_score":0.99945426},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20184778,0.00016206803,0.36942816,0.0300783,0.0028589254,0.0013524595,0.000008491949,0.0005198134,0.39374402],"genre_scores_gemma":[0.9941267,0.00006880577,0.005127198,0.00019668453,0.00005169022,0.00004182159,8.3966125e-7,0.000009306302,0.00037699527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982891,0.000044337106,0.0006223839,0.00052145234,0.00022746323,0.00029526997],"domain_scores_gemma":[0.99859196,0.000088857065,0.0002850446,0.00031320166,0.0006597528,0.0000611861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062552886,0.0001801197,0.00027742836,0.00014898072,0.000101309925,0.00024896304,0.0012681084,0.00010222687,0.00008918812],"category_scores_gemma":[0.00025919953,0.00015178884,0.00010397638,0.000958393,0.000067002824,0.00048120902,0.00047313038,0.0002864768,0.000055338533],"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.000010979925,0.00015306722,0.00022538808,0.00003929788,0.000007399224,6.0066526e-7,0.0015320748,0.0000021567093,0.048307564,0.6795357,0.00035555806,0.26983026],"study_design_scores_gemma":[0.00002817562,0.00007726769,0.0003024256,0.0002682084,0.0000028348773,0.000005471812,0.00045724082,0.011675144,0.8547197,0.13151306,0.00077272154,0.00017772903],"about_ca_topic_score_codex":0.000051951298,"about_ca_topic_score_gemma":0.00009156544,"teacher_disagreement_score":0.80641216,"about_ca_system_score_codex":0.000082825216,"about_ca_system_score_gemma":0.00014494862,"threshold_uncertainty_score":0.61897695},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9775849,0.000034918237,0.008650092,0.008302797,0.00005452301,0.0004911268,0.000017613567,0.00004074212,0.0048232637],"genre_scores_gemma":[0.9931313,0.00013221087,0.006363695,0.00017082127,0.000018123821,0.00004012635,0.0000028689744,0.000010459695,0.00013041362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989139,0.000007524073,0.00044870484,0.00024849596,0.00023041929,0.00015098561],"domain_scores_gemma":[0.9990799,0.000019844445,0.00022526014,0.00017848086,0.0004596929,0.000036852212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013565486,0.00010548678,0.0002273869,0.000063928084,0.000037430582,0.000015133538,0.00021004272,0.000036049085,0.000107616965],"category_scores_gemma":[0.00012570787,0.00008535823,0.00007809166,0.0005240973,0.00012726382,0.00007336144,0.00007336391,0.00015292925,0.0000029419184],"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.00006469527,0.0001375367,0.0040551363,0.00006826394,0.0000059828635,8.899268e-7,0.00032928743,0.0000066374696,0.47390798,0.49597,0.000045705805,0.02540788],"study_design_scores_gemma":[0.000057667046,0.00006788637,0.003546345,0.00019702171,0.000017102497,0.000004498926,0.0011505735,0.0010003406,0.92776704,0.06596928,0.00015117276,0.000071082024],"about_ca_topic_score_codex":0.00006901653,"about_ca_topic_score_gemma":0.0000373951,"teacher_disagreement_score":0.45385906,"about_ca_system_score_codex":0.000042552947,"about_ca_system_score_gemma":0.00011974365,"threshold_uncertainty_score":0.34808078},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7249392,0.000065236454,0.1720841,0.0051154187,0.00040245146,0.0018597445,0.000004251178,0.00033947767,0.09519008],"genre_scores_gemma":[0.9967409,0.000008033162,0.0018120251,0.00038639276,0.00017451256,0.000059451762,0.000009413223,0.000026649694,0.00078266993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978699,0.000021844036,0.00084359426,0.00047302363,0.00046253862,0.00032906453],"domain_scores_gemma":[0.99592096,0.00016149698,0.0012918807,0.00020585569,0.0024006031,0.00001919162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014570553,0.0002375965,0.00045095212,0.0001565095,0.00033752384,0.00018496298,0.00068694074,0.00008857107,0.00011506005],"category_scores_gemma":[0.0034794847,0.00020038328,0.00023218186,0.0011506918,0.0001413839,0.0005941422,0.00038564825,0.00035211703,0.0000183989],"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.0003059784,0.00013681587,0.0006823018,0.00096621213,0.00005862582,1.1764519e-7,0.00046590093,0.048939437,0.09831902,0.8444606,0.000016958053,0.005648042],"study_design_scores_gemma":[0.00009912363,0.000058759462,0.000051686184,0.00037790654,0.00014109712,7.7546423e-7,0.008907069,0.48850223,0.37618834,0.12457386,0.0007098441,0.00038931586],"about_ca_topic_score_codex":0.00013916883,"about_ca_topic_score_gemma":0.000019606785,"teacher_disagreement_score":0.7198867,"about_ca_system_score_codex":0.000042084823,"about_ca_system_score_gemma":0.000066024615,"threshold_uncertainty_score":0.81713927},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99359995,0.000054877164,0.0020247523,0.0005714671,0.00022446907,0.00024440413,0.000011406207,0.000052174586,0.0032164787],"genre_scores_gemma":[0.99602896,0.00004009121,0.0036096487,0.00006654024,0.00006477587,4.1088538e-7,0.0000032263004,0.000023498947,0.0001628257],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810565,0.000044285393,0.00043898658,0.0006344774,0.00044605994,0.0003305677],"domain_scores_gemma":[0.9989696,0.00014164453,0.0003467978,0.00035415147,0.000096046715,0.000091729766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076258153,0.00020835618,0.00025936204,0.000028973793,0.0003627721,0.00017006903,0.00067949854,0.000086320375,0.0001375289],"category_scores_gemma":[0.001527557,0.0001724056,0.00004484948,0.00042817454,0.00028833706,0.0003753589,0.0014033482,0.0003998488,0.000041007806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008893296,0.00007871604,0.1048448,0.00019967575,0.000039392886,0.000011644221,0.0018312773,0.0011625369,0.35266387,0.0020168456,0.00006371032,0.53699857],"study_design_scores_gemma":[0.00002185808,0.0000503141,0.00093190314,0.00037285005,0.000024893827,0.00005235718,0.00046446937,0.89669615,0.09802174,0.003069587,0.00012739205,0.0001664999],"about_ca_topic_score_codex":0.0019055767,"about_ca_topic_score_gemma":0.00063544215,"teacher_disagreement_score":0.8955336,"about_ca_system_score_codex":0.0000744681,"about_ca_system_score_gemma":0.000032458796,"threshold_uncertainty_score":0.7030496},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81544775,0.000065969245,0.17262118,0.0046527754,0.00024428783,0.0014104175,0.000018948249,0.0003862332,0.0051524336],"genre_scores_gemma":[0.9951707,0.000038684786,0.0041635754,0.00009473364,0.000050916617,0.00039143316,0.000008298593,0.000026956915,0.000054680113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981877,0.000018296672,0.00062362436,0.0005437035,0.00029026446,0.00033640364],"domain_scores_gemma":[0.99899405,0.00007718351,0.00018264898,0.00032777246,0.00034164166,0.000076697426],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033562045,0.00030384376,0.0004072457,0.00017084803,0.00013523865,0.00013301319,0.0008186716,0.00037319475,0.000062741674],"category_scores_gemma":[0.00009556217,0.00026654595,0.00009155103,0.00045311236,0.0004046092,0.00011149738,0.0004213732,0.0011728663,0.000019921265],"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.000072720395,0.00021694227,0.0012446907,0.00022784722,0.0000829273,0.0000010244082,0.0018774007,0.05345229,0.022044566,0.88218796,0.00003348033,0.038558166],"study_design_scores_gemma":[0.00008330975,0.0001402097,0.010157043,0.0014265535,0.00006371428,0.00001085426,0.0021145595,0.22675729,0.3463593,0.41169658,0.00019245336,0.0009981309],"about_ca_topic_score_codex":0.000047554156,"about_ca_topic_score_gemma":0.00035227285,"teacher_disagreement_score":0.47049135,"about_ca_system_score_codex":0.00027671133,"about_ca_system_score_gemma":0.00029060064,"threshold_uncertainty_score":0.99997866},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18407321,0.00012552245,0.7916111,0.0092219375,0.0007236637,0.00034893636,0.0000065728323,0.00017458876,0.013714516],"genre_scores_gemma":[0.99056584,0.000014879384,0.00847979,0.00016959148,0.000053184755,0.000010221655,0.0000025108545,0.000011651302,0.00069231255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985214,0.000034321398,0.00034055862,0.0005014382,0.00035313418,0.00024914884],"domain_scores_gemma":[0.998612,0.00014638387,0.00027279154,0.00022482012,0.0006457041,0.00009833711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003505324,0.00019509532,0.00020853213,0.0000904593,0.0003139204,0.00042160298,0.0006349404,0.00008585895,0.000045611447],"category_scores_gemma":[0.00029879282,0.0001588456,0.00009637892,0.00059271214,0.00017330224,0.00034523246,0.00024728317,0.0003024831,0.00004134967],"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.000026629928,0.00011603178,0.0011322035,0.000081318685,0.000014537069,0.0000015127006,0.0014763196,0.00015853408,0.064169034,0.7478313,0.00007824117,0.18491435],"study_design_scores_gemma":[0.00009744433,0.0001367238,0.009997787,0.0005331121,0.000029586563,0.000019640349,0.0012054568,0.7499199,0.10469611,0.13211519,0.00076160074,0.00048744777],"about_ca_topic_score_codex":0.000010294667,"about_ca_topic_score_gemma":0.000020916577,"teacher_disagreement_score":0.8064926,"about_ca_system_score_codex":0.000038431743,"about_ca_system_score_gemma":0.00010248658,"threshold_uncertainty_score":0.64775354},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17847331,0.0006672072,0.74376005,0.016524032,0.006482808,0.0019101036,0.000053555603,0.00061859656,0.051510338],"genre_scores_gemma":[0.98932976,0.0002460786,0.009448705,0.00034136727,0.00021380771,0.00008251294,0.0000021891426,0.000029176083,0.0003064352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99574006,0.00007099133,0.00094749744,0.0015675208,0.0010491342,0.0006248282],"domain_scores_gemma":[0.9948768,0.000103466584,0.0009050059,0.0009388121,0.0029743076,0.00020161385],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00068256404,0.00061984715,0.0007124814,0.00022744923,0.00027676654,0.0012044794,0.0049983333,0.00040588347,0.000086079905],"category_scores_gemma":[0.00062776555,0.0005045508,0.00043890288,0.0007898541,0.00048736366,0.00043597963,0.004020597,0.0017066471,0.000070871385],"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.000033415294,0.00031406843,0.000042592863,0.00011739237,0.000079661986,0.0000030958072,0.00695748,0.00034886267,0.007019292,0.9687102,0.00019566726,0.016178316],"study_design_scores_gemma":[0.000035207555,0.00019311147,0.00015037165,0.0018429459,0.000058971003,0.000011738973,0.004811823,0.15688474,0.20957352,0.6256059,0.000038914357,0.0007927504],"about_ca_topic_score_codex":0.0003360856,"about_ca_topic_score_gemma":0.000033565633,"teacher_disagreement_score":0.8108564,"about_ca_system_score_codex":0.00029955833,"about_ca_system_score_gemma":0.00090034923,"threshold_uncertainty_score":0.9998324},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11767061,0.0002723778,0.5485516,0.088036336,0.00212472,0.0017890168,0.000019482195,0.0006838129,0.24085203],"genre_scores_gemma":[0.99178976,0.0002425677,0.0041885185,0.0013987412,0.00020650326,0.00001734412,5.683319e-7,0.000018098015,0.0021379085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99758285,0.00004077296,0.0005688279,0.0006314793,0.00067971885,0.00049634645],"domain_scores_gemma":[0.9978811,0.00026948258,0.00034584076,0.00051212806,0.0008358033,0.00015564832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041922487,0.00028821718,0.0003397127,0.00022324189,0.00027315307,0.00058293436,0.001742806,0.00010928893,0.00006527623],"category_scores_gemma":[0.003357226,0.00023572409,0.000112133675,0.0012559044,0.00034562414,0.00044806467,0.00071199454,0.00042913455,0.00010760384],"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.000027233616,0.000068349334,0.000059841113,0.000049783015,0.000017991153,0.0000021322521,0.00085644546,0.0012596492,0.01703515,0.9495255,0.00008077407,0.031017167],"study_design_scores_gemma":[0.00012247088,0.0004073449,0.00045913164,0.0006618314,0.000022020466,0.00003741721,0.00042273986,0.22510956,0.5230493,0.24702008,0.0021306123,0.0005575013],"about_ca_topic_score_codex":0.00005235013,"about_ca_topic_score_gemma":0.0000034440277,"teacher_disagreement_score":0.87411916,"about_ca_system_score_codex":0.00010338892,"about_ca_system_score_gemma":0.0005669993,"threshold_uncertainty_score":0.96125495},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05571116,0.0000633569,0.9059023,0.015615534,0.0036529226,0.0014215622,0.000024037832,0.00037411,0.017234962],"genre_scores_gemma":[0.9893325,0.0001282937,0.007306213,0.00025478165,0.000153774,0.000093699666,0.0000059996773,0.000036961403,0.0026877928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963326,0.00005284521,0.0008017552,0.0011696497,0.001046528,0.00059665943],"domain_scores_gemma":[0.99529064,0.00012153169,0.0015338406,0.0011686273,0.001717315,0.00016806145],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.00049038435,0.00060678733,0.0006643537,0.00025534292,0.00036779972,0.0025167111,0.0055483845,0.00042182434,0.0000692743],"category_scores_gemma":[0.0007517709,0.00048638496,0.00043460366,0.0005008172,0.0003354616,0.00063922274,0.004000958,0.0016391806,0.00004560231],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006652023,0.0005364755,0.00060507515,0.00065064407,0.00034856735,0.000007825822,0.014489085,0.14426711,0.014783339,0.786023,0.0015455832,0.036676772],"study_design_scores_gemma":[0.000038806676,0.00015402395,0.00033166344,0.0016176982,0.00006816451,0.000007401172,0.003357694,0.7408228,0.18178494,0.07070894,0.00033385793,0.00077398657],"about_ca_topic_score_codex":0.00005976595,"about_ca_topic_score_gemma":0.000015530059,"teacher_disagreement_score":0.93362135,"about_ca_system_score_codex":0.00018255612,"about_ca_system_score_gemma":0.00034111732,"threshold_uncertainty_score":0.9998321},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9352038,0.00012721815,0.046108805,0.0042301845,0.00092799135,0.0010183527,0.000028909286,0.000047180358,0.012307571],"genre_scores_gemma":[0.9637797,0.00016793088,0.034077007,0.00033065322,0.00027214197,0.000048184716,0.0000025773086,0.000027913864,0.0012939168],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99808776,0.000017281469,0.00048040872,0.0006465349,0.00029704015,0.00047096767],"domain_scores_gemma":[0.9987883,0.00003975609,0.00022482862,0.00035198682,0.0004030274,0.00019211162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005561235,0.00030889123,0.00036728146,0.00009880666,0.00017912836,0.0002439909,0.0010766439,0.00015318765,0.0003735142],"category_scores_gemma":[0.0007108631,0.0002299658,0.00019738937,0.00025197337,0.00021075501,0.000020478978,0.00049547787,0.0003382984,0.000054423108],"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.0002820967,0.00010389009,0.000627585,0.000020181189,0.0000658958,1.984777e-7,0.00038587188,0.0001255082,0.9059396,0.08136943,0.00070424535,0.010375531],"study_design_scores_gemma":[0.00006450419,0.00041477056,0.00025588114,0.000050086528,0.00002807053,0.000006387757,0.00019521752,0.0010444924,0.9694235,0.024832405,0.0034159722,0.00026876453],"about_ca_topic_score_codex":0.000092730406,"about_ca_topic_score_gemma":0.00018806061,"teacher_disagreement_score":0.06348389,"about_ca_system_score_codex":0.000014176759,"about_ca_system_score_gemma":0.00010350376,"threshold_uncertainty_score":0.9377733},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6828698,0.00007065718,0.2780267,0.0062607722,0.000872138,0.0016860821,0.00022977717,0.000110615845,0.029873438],"genre_scores_gemma":[0.9952162,0.00000669693,0.0042160098,0.00014065001,0.000043085623,0.000083095285,0.000009623545,0.0000138864625,0.00027076495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988294,0.000019368417,0.00043624095,0.00027816615,0.00019952381,0.00023730256],"domain_scores_gemma":[0.99828,0.0001665974,0.00032881324,0.00023864498,0.0009247882,0.0000611562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025194712,0.00016573578,0.00022311762,0.00004127238,0.00032082107,0.00017325938,0.00060139195,0.000051133473,0.0001417634],"category_scores_gemma":[0.00020042187,0.0001429866,0.0001640516,0.00024370114,0.00020978201,0.00010883452,0.00013417004,0.00019475237,0.000015970625],"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.000022640648,0.00021778267,0.0032632549,0.00003853828,0.0000203041,6.3243775e-8,0.0004843762,0.00022144835,0.010042823,0.9670624,0.000024765239,0.018601576],"study_design_scores_gemma":[0.0001372037,0.00009193401,0.001007391,0.00053164776,0.000052700587,2.6647368e-7,0.0030177166,0.37726086,0.36057726,0.25650346,0.00042133892,0.00039820833],"about_ca_topic_score_codex":0.000056737525,"about_ca_topic_score_gemma":0.000009915144,"teacher_disagreement_score":0.71055895,"about_ca_system_score_codex":0.000030088031,"about_ca_system_score_gemma":0.00021495715,"threshold_uncertainty_score":0.58308244},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014044585,0.0000156288,0.968721,0.0066535817,0.0022637658,0.0010896685,0.000014905915,0.00018452694,0.0070123826],"genre_scores_gemma":[0.97773206,0.0000030203319,0.02117667,0.00019856558,0.00012821892,0.00015335849,0.000002525304,0.000019823874,0.0005857444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977149,0.0000528584,0.0005729151,0.00059545186,0.00069834833,0.00036556108],"domain_scores_gemma":[0.99811506,0.00019819134,0.0006064422,0.00037716902,0.0006373384,0.00006581205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009912502,0.00022021504,0.00028058764,0.00016512729,0.0009755346,0.00017727066,0.0027879893,0.000068858404,0.00011306382],"category_scores_gemma":[0.00094326,0.0001946458,0.00017697398,0.0008950974,0.00021855939,0.00043826157,0.001077867,0.0004327527,0.0000065248196],"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.000122041216,0.00010024268,0.00006807801,0.000027204855,0.0000151668555,3.2404543e-7,0.00074196386,0.037205473,0.0046943435,0.936445,0.0001809863,0.020399157],"study_design_scores_gemma":[0.00009780833,0.00030322766,0.000041255233,0.000046060788,0.000023889475,0.00000848476,0.0009213639,0.7352179,0.0419441,0.22057198,0.00053904456,0.00028483744],"about_ca_topic_score_codex":0.000018419565,"about_ca_topic_score_gemma":0.0000022917445,"teacher_disagreement_score":0.9636875,"about_ca_system_score_codex":0.000119597826,"about_ca_system_score_gemma":0.00021770615,"threshold_uncertainty_score":0.79374254},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9258071,0.00034219446,0.0036583904,0.0028158664,0.0023272212,0.00078075525,0.00011854306,0.00011898518,0.06403092],"genre_scores_gemma":[0.9966709,0.000114004855,0.0012465706,0.00020596774,0.00026598008,0.00006560138,0.000008060448,0.000054156415,0.0013687842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964112,0.000025842215,0.0017423062,0.0011008069,0.00020854133,0.0005113026],"domain_scores_gemma":[0.99651855,0.00013142306,0.002132141,0.00059488154,0.0005024511,0.000120546974],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017000654,0.0004849473,0.0011164099,0.00025096856,0.0002178028,0.0007088087,0.0021068742,0.00046322503,0.0007012167],"category_scores_gemma":[0.001244421,0.00048066108,0.0004662903,0.00039886552,0.00033405572,0.00024878787,0.0011816113,0.001264313,0.00038464318],"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.000075780656,0.00023437983,0.00079888786,0.00038444228,0.00010840002,8.3457996e-7,0.0032034938,0.00048103667,0.002552085,0.99043083,0.00010600871,0.0016238355],"study_design_scores_gemma":[0.000053038388,0.00013204184,0.0005521881,0.0024975552,0.000045179648,0.0000063074267,0.0025621206,0.013225698,0.1229686,0.85687625,0.00022932861,0.00085168006],"about_ca_topic_score_codex":0.00044542734,"about_ca_topic_score_gemma":0.00001582168,"teacher_disagreement_score":0.13355455,"about_ca_system_score_codex":0.000116845426,"about_ca_system_score_gemma":0.00012013736,"threshold_uncertainty_score":0.9997645},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58954304,0.00015909287,0.263576,0.049648307,0.001336215,0.0014878943,0.000024949786,0.00068104436,0.09354345],"genre_scores_gemma":[0.98968256,0.00007035759,0.008412877,0.0005429143,0.00015261964,0.000029334391,6.391614e-7,0.000027109649,0.0010815724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99639124,0.000055484386,0.00081326044,0.00090680335,0.0011200894,0.00071311404],"domain_scores_gemma":[0.99616194,0.0002431601,0.00034911264,0.0007923947,0.0022783864,0.00017500565],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005992016,0.00037593677,0.00043783142,0.00025306412,0.00035733194,0.0005907809,0.00323388,0.00013007787,0.00012633721],"category_scores_gemma":[0.0011395446,0.00026941308,0.00017741848,0.002251618,0.0007386869,0.0005879559,0.0008253752,0.00052627147,0.00025979357],"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.00004951785,0.0001972223,0.00036564018,0.00004543289,0.000029273238,0.000009219056,0.0017430778,0.00028603623,0.03799427,0.9172198,0.00016679398,0.04189369],"study_design_scores_gemma":[0.000020103924,0.00019757528,0.0001690441,0.00027926848,0.000012352827,0.000056268666,0.0010150038,0.028356053,0.77579725,0.19369893,0.000102508486,0.00029566817],"about_ca_topic_score_codex":0.0001668363,"about_ca_topic_score_gemma":0.000054662793,"teacher_disagreement_score":0.737803,"about_ca_system_score_codex":0.0000984507,"about_ca_system_score_gemma":0.00078883674,"threshold_uncertainty_score":0.9999758},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16189797,0.00017880929,0.8344278,0.001747547,0.0005404727,0.0004731307,0.0000047568424,0.000048399994,0.0006811478],"genre_scores_gemma":[0.97754544,0.00003652843,0.021642832,0.00012728637,0.000109198074,0.000093942304,0.0000017283259,0.000012930468,0.00043010496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997435,0.000039815306,0.0008583343,0.00076769217,0.00045591782,0.0004432473],"domain_scores_gemma":[0.9979899,0.0001625131,0.0003966597,0.00042838472,0.0009252593,0.000097293654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007723136,0.0002503915,0.00048927736,0.0002466987,0.00017453743,0.00049771246,0.0015429818,0.000101863705,0.000036185946],"category_scores_gemma":[0.0005891995,0.00020298063,0.0002984933,0.0015401888,0.00014583692,0.00034844672,0.00035942087,0.00024713785,0.000013144493],"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.00003232034,0.00016243936,0.0009998037,0.00008538388,0.00010762896,0.0000013907608,0.0038341153,0.026991135,0.021481683,0.92338324,0.000019055467,0.022901794],"study_design_scores_gemma":[0.000039257833,0.000042722735,0.00006281579,0.00015004608,0.00005534224,0.0000031436543,0.003274812,0.8861895,0.097709805,0.01221484,0.00004314508,0.000214572],"about_ca_topic_score_codex":0.0000914394,"about_ca_topic_score_gemma":0.00009881627,"teacher_disagreement_score":0.9111684,"about_ca_system_score_codex":0.000112826434,"about_ca_system_score_gemma":0.0001833577,"threshold_uncertainty_score":0.827731},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002238207,0.00004566529,0.9888329,0.004716193,0.00089587405,0.0006928556,0.000012690938,0.00010646295,0.0024591899],"genre_scores_gemma":[0.80840605,0.000017057575,0.19049114,0.0006424779,0.000074944204,0.00012930618,0.0000022301037,0.000012872462,0.00022391639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982009,0.000016981568,0.00047311926,0.00043895585,0.00048024103,0.00038979697],"domain_scores_gemma":[0.9988563,0.000100159894,0.00029904777,0.00023957842,0.00043149217,0.00007339637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062294037,0.00017956173,0.0002123553,0.00009288925,0.000752243,0.00015783652,0.0015122234,0.0000331094,0.00010755842],"category_scores_gemma":[0.00020112036,0.00015199305,0.00013078497,0.0007042865,0.00014723079,0.00055143307,0.00026973197,0.00026666597,0.00002552937],"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.00007811806,0.00009074852,0.000045082197,0.000023434048,0.000008412503,1.4421266e-7,0.0005419244,0.013541007,0.0068905596,0.55483615,0.00088412885,0.4230603],"study_design_scores_gemma":[0.000037209993,0.00014255082,0.000028475322,0.000056388788,0.000006593293,0.0000038024582,0.00019084795,0.73510665,0.054843158,0.20841372,0.0010292785,0.00014134558],"about_ca_topic_score_codex":0.000009739554,"about_ca_topic_score_gemma":0.0000022354554,"teacher_disagreement_score":0.80616784,"about_ca_system_score_codex":0.00007996793,"about_ca_system_score_gemma":0.00011191477,"threshold_uncertainty_score":0.6198097},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053518906,0.000025870091,0.9437989,0.0012778385,0.00021430677,0.00070033583,0.000010788555,0.00016690651,0.00028614613],"genre_scores_gemma":[0.96636087,0.000011360315,0.0332676,0.0001672818,0.000023566134,0.000109635694,0.0000015991546,0.000017062823,0.000040999854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99766153,0.000032759355,0.00053399324,0.00063705177,0.0007529074,0.0003817559],"domain_scores_gemma":[0.9983855,0.00016692621,0.0004597007,0.0003262706,0.0005336916,0.00012790857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004844858,0.0002801089,0.00031918194,0.00023935638,0.0005172051,0.00020855715,0.0016700901,0.000043917367,0.00004283382],"category_scores_gemma":[0.00027882593,0.0002117124,0.00006704214,0.00095045625,0.0003541992,0.00030150588,0.00094403053,0.00043104234,0.0000033094236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031876232,0.0005484012,0.00021519203,0.00004781359,0.000034089553,0.0000017045884,0.0033911886,0.11385759,0.004021682,0.80402255,0.000032242042,0.0735088],"study_design_scores_gemma":[0.00012950123,0.00061331753,0.00011717618,0.00019268139,0.000024093457,0.00003659646,0.00085427787,0.9244642,0.020721922,0.05252336,0.0000051437364,0.0003177179],"about_ca_topic_score_codex":0.000042352454,"about_ca_topic_score_gemma":0.000008768707,"teacher_disagreement_score":0.912842,"about_ca_system_score_codex":0.00009809906,"about_ca_system_score_gemma":0.000105585605,"threshold_uncertainty_score":0.8633381},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03704292,0.0000029813411,0.95712763,0.001463551,0.00018524933,0.00054694584,0.0000013044051,0.00014930878,0.0034801029],"genre_scores_gemma":[0.99562156,0.0000023378516,0.0033778893,0.00036586422,0.00001925195,0.00011741691,0.000002808745,0.000019191091,0.00047368807],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972706,0.00004160403,0.0005912123,0.0005050915,0.00115396,0.00043752146],"domain_scores_gemma":[0.998147,0.000090743946,0.0007406122,0.00036778775,0.0005671874,0.000086673404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055293244,0.00026545074,0.00027754466,0.00019476424,0.00072619546,0.00021000477,0.0018235629,0.00004680949,0.000100701705],"category_scores_gemma":[0.00017383682,0.00020429914,0.00011307263,0.0007932207,0.00014559805,0.00033186813,0.00049781904,0.00063250377,0.000015845671],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010499733,0.00004678458,0.00036179318,0.000014014278,0.000014922531,2.1926395e-7,0.0003722357,0.62460357,0.0070026047,0.36588094,0.000019889818,0.0015779913],"study_design_scores_gemma":[0.00012468887,0.0007809984,0.00008664717,0.000057972367,0.000021199881,0.000002063063,0.00021099768,0.9391222,0.054885328,0.0044011064,0.000076492965,0.00023029659],"about_ca_topic_score_codex":0.000022665394,"about_ca_topic_score_gemma":0.0000012349301,"teacher_disagreement_score":0.95857865,"about_ca_system_score_codex":0.00016792052,"about_ca_system_score_gemma":0.00018050984,"threshold_uncertainty_score":0.8331077},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052774996,0.00004523312,0.9426493,0.0018718442,0.000215736,0.0008355762,0.0000018287008,0.000092194365,0.0015132756],"genre_scores_gemma":[0.9435814,0.000022504371,0.056042966,0.000070955815,0.000022890476,0.00007468246,0.0000028593813,0.0000057207108,0.00017603517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987914,0.00002959286,0.00042111575,0.00026335492,0.00031298777,0.00018152983],"domain_scores_gemma":[0.9979359,0.00011377476,0.000580815,0.00010725378,0.0012064644,0.00005578311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044955383,0.00013791361,0.00021238285,0.00009487271,0.0003231468,0.00047024136,0.00023876828,0.000067334404,0.000015629863],"category_scores_gemma":[0.0011530309,0.000101638594,0.00006772443,0.00031777145,0.00009964734,0.0012895834,0.000090034315,0.00025679264,0.000012090478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005555683,0.0001630739,0.00046347486,0.000113726244,0.00005076901,0.0000011192234,0.0067088315,0.003218075,0.033126988,0.67413163,0.000018180132,0.28144857],"study_design_scores_gemma":[0.00036310442,0.00020698358,0.000885315,0.00015503618,0.000019474655,0.00001671192,0.0016057787,0.92436945,0.06357725,0.008405274,0.00024664262,0.0001489997],"about_ca_topic_score_codex":0.0000053045237,"about_ca_topic_score_gemma":0.0000037270538,"teacher_disagreement_score":0.92115134,"about_ca_system_score_codex":0.000034033394,"about_ca_system_score_gemma":0.000104309125,"threshold_uncertainty_score":0.45345482},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16636308,0.000079342855,0.8287936,0.002912509,0.00077367807,0.0004325374,0.0000035323644,0.00007534155,0.0005663981],"genre_scores_gemma":[0.9667634,0.000028491126,0.032657985,0.00018998036,0.0000883669,0.00004585449,0.0000023095615,0.00001393741,0.00020968885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978885,0.000026906193,0.0006500647,0.0006108388,0.00045306742,0.00037061947],"domain_scores_gemma":[0.9981245,0.00013147281,0.00038179153,0.00037456572,0.000923597,0.00006409708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079816417,0.00019186952,0.00025734323,0.000060367573,0.0003515742,0.000489325,0.0009557944,0.000076425415,0.000014823243],"category_scores_gemma":[0.00042415655,0.00017054223,0.00015351809,0.0003567275,0.00010652294,0.00084719365,0.00026772957,0.00022097393,0.000023088294],"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.000045251916,0.00007116642,0.00024928947,0.000056134984,0.00002011531,0.0000010787037,0.0011172382,0.009258967,0.016610697,0.85391736,0.00003615501,0.118616536],"study_design_scores_gemma":[0.000033384622,0.00004866018,0.00006358928,0.00017335766,0.000008804393,0.000005891732,0.00028537647,0.43641928,0.112071455,0.4506993,0.000062698324,0.00012820109],"about_ca_topic_score_codex":0.000013254588,"about_ca_topic_score_gemma":0.000027613441,"teacher_disagreement_score":0.8004003,"about_ca_system_score_codex":0.00009246643,"about_ca_system_score_gemma":0.00014306803,"threshold_uncertainty_score":0.695451},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5475321,0.000023258752,0.43568656,0.0030204211,0.0002472858,0.0002335579,0.0000037005332,0.000038106828,0.013215028],"genre_scores_gemma":[0.98903906,0.000018376573,0.010704801,0.0000871324,0.000016203136,0.000011744399,4.2386742e-7,0.0000064903834,0.000115761795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839324,0.0000273957,0.0005326843,0.00042231072,0.00040876542,0.000215594],"domain_scores_gemma":[0.99866974,0.00011319949,0.00027798882,0.0002804962,0.0006153131,0.000043235083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036855062,0.0001367428,0.00022019276,0.0001541386,0.00009085114,0.00008200672,0.00084541156,0.000078361685,0.00002143742],"category_scores_gemma":[0.00032070145,0.00011741787,0.00010605928,0.00069468725,0.000100515594,0.0005837509,0.00027260146,0.00028140703,0.000015138547],"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.000013837666,0.00013223504,0.00008785241,0.000020120675,0.0000068443983,7.7356316e-7,0.0010835443,0.006166717,0.03712082,0.9466375,0.0000064395617,0.0087233195],"study_design_scores_gemma":[0.000015772794,0.00004472786,0.00010045806,0.0003478789,0.0000037048244,0.0000016778254,0.000246479,0.41803125,0.15797144,0.42316815,7.20224e-7,0.000067752575],"about_ca_topic_score_codex":0.000028896393,"about_ca_topic_score_gemma":0.000010359772,"teacher_disagreement_score":0.5234693,"about_ca_system_score_codex":0.000059313694,"about_ca_system_score_gemma":0.00009499663,"threshold_uncertainty_score":0.47881618},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021530306,0.000027275342,0.96374094,0.003364764,0.00067976967,0.0003908589,0.0000029960443,0.00008772525,0.010175361],"genre_scores_gemma":[0.989066,0.00005957983,0.010194625,0.00024191299,0.0001953524,0.000025129037,0.00000538462,0.000009546521,0.00020246043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818,0.0000710362,0.0004955384,0.00042371565,0.0005135965,0.00031613343],"domain_scores_gemma":[0.9978329,0.00011332483,0.0004762832,0.00026584705,0.0012256709,0.000085955035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002957174,0.00022920547,0.00026942894,0.00008070426,0.00037079447,0.00054160185,0.00078011834,0.00008585998,0.000065361724],"category_scores_gemma":[0.0004478748,0.00016740896,0.00011352632,0.0009198543,0.00017754662,0.0015271701,0.0002585352,0.0003317597,0.000028967865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040240353,0.00022329121,0.0012926621,0.000035685985,0.00014176591,0.000004915986,0.0055068,0.19776718,0.03620306,0.5903208,0.0006401333,0.16746128],"study_design_scores_gemma":[0.00006925251,0.00015270493,0.00023050705,0.00010021422,0.00002135463,0.0000059106083,0.0011859479,0.55729187,0.43357718,0.007005924,0.00015977747,0.00019937906],"about_ca_topic_score_codex":0.000035556583,"about_ca_topic_score_gemma":0.000021905393,"teacher_disagreement_score":0.9675357,"about_ca_system_score_codex":0.000054464537,"about_ca_system_score_gemma":0.00014892449,"threshold_uncertainty_score":0.68267393},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043654285,0.00027332403,0.8440613,0.02098462,0.0024022067,0.0014005036,0.000017434488,0.00036721505,0.08683907],"genre_scores_gemma":[0.85798055,0.00021461537,0.1393615,0.00052114186,0.00012794066,0.0000446739,0.0000010961885,0.000021577393,0.0017269284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9967118,0.000036466077,0.00081543636,0.0007402569,0.0012163661,0.0004796836],"domain_scores_gemma":[0.99647355,0.00014310748,0.00037101473,0.0005984921,0.0022414252,0.00017241231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006503672,0.0002526453,0.00032258543,0.00014789327,0.00022735423,0.0005847248,0.0029390207,0.00010611568,0.00057036435],"category_scores_gemma":[0.0010951065,0.00019682334,0.00015161502,0.0012209206,0.0002554827,0.0002959721,0.00096232875,0.0003846207,0.0003069057],"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.000010835925,0.0004228841,0.00017878035,0.00005145954,0.00003700983,0.000014766063,0.0007403513,0.00094479223,0.020653864,0.8545587,0.00071996887,0.121666566],"study_design_scores_gemma":[0.0000636901,0.00013599018,0.0022351786,0.00014822584,0.000017000079,0.000045439094,0.0004461119,0.29767922,0.53621614,0.16226296,0.00035678147,0.00039324886],"about_ca_topic_score_codex":0.000020359812,"about_ca_topic_score_gemma":0.0000034046554,"teacher_disagreement_score":0.8143262,"about_ca_system_score_codex":0.00007066318,"about_ca_system_score_gemma":0.0003243401,"threshold_uncertainty_score":0.80262226},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52279574,0.000049240327,0.46400487,0.008082308,0.0002974596,0.00089653104,0.000027772812,0.000057074383,0.0037890289],"genre_scores_gemma":[0.9655903,0.000052667012,0.03328377,0.00007295092,0.000045425728,0.00009355496,0.0000037862278,0.000014852656,0.000842721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978839,0.00004053758,0.00046327175,0.0006232001,0.00054974685,0.0004392998],"domain_scores_gemma":[0.9978004,0.00036914763,0.00016887381,0.00025201886,0.0012835461,0.00012597852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009428575,0.00018437095,0.00025584048,0.0002625182,0.000660958,0.0006338028,0.00082851085,0.00006732184,0.000068098976],"category_scores_gemma":[0.000869561,0.0001494502,0.000057716894,0.0013431932,0.0003167513,0.00049704366,0.00042777936,0.000396943,0.0000142497665],"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.00010478548,0.0003874511,0.0021489451,0.00014582017,0.000029370218,0.000005681484,0.0029650417,0.008130536,0.015114023,0.96523166,0.00016383234,0.0055728294],"study_design_scores_gemma":[0.00012644127,0.00031345675,0.0004913938,0.00033767163,0.000015525988,0.000032264626,0.0027974902,0.8680571,0.11972037,0.007752941,0.00010472468,0.00025062478],"about_ca_topic_score_codex":0.000058932575,"about_ca_topic_score_gemma":0.00006554861,"teacher_disagreement_score":0.95747876,"about_ca_system_score_codex":0.000078369085,"about_ca_system_score_gemma":0.00030789984,"threshold_uncertainty_score":0.61117744},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1370701,0.00013506506,0.69167817,0.051468935,0.0016838891,0.0007093548,0.000017183402,0.0005820683,0.11665525],"genre_scores_gemma":[0.9847802,0.000010503684,0.014430208,0.0003598349,0.00004702553,0.00001152932,0.0000017231371,0.0000076082724,0.00035138873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983699,0.000031132564,0.00040969136,0.00048566048,0.00047249126,0.00023112392],"domain_scores_gemma":[0.9981799,0.00021461087,0.00031147682,0.00044458229,0.0007798727,0.0000695593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005284098,0.00014641426,0.00016642957,0.000077915254,0.00021793242,0.00032554558,0.0015497211,0.00006480842,0.00008448169],"category_scores_gemma":[0.0019245293,0.00011156456,0.000090893416,0.0007406824,0.00010549753,0.00028606938,0.00032223028,0.00029053172,0.0001112156],"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.000013351021,0.0000737556,0.00044505205,0.0000231271,0.000004344892,6.0564304e-7,0.00023904575,0.000109642744,0.05433329,0.75616455,0.00017899879,0.18841425],"study_design_scores_gemma":[0.000023007253,0.000071380346,0.0011856746,0.00022354232,0.000006698728,0.000003627467,0.0001729556,0.3145382,0.60958916,0.07310906,0.0009024307,0.0001742091],"about_ca_topic_score_codex":0.00001694697,"about_ca_topic_score_gemma":0.000005431306,"teacher_disagreement_score":0.8477101,"about_ca_system_score_codex":0.000028002036,"about_ca_system_score_gemma":0.00019975976,"threshold_uncertainty_score":0.45494705},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48851073,0.000014885322,0.49281034,0.003680272,0.00046690245,0.00026255188,0.0000032031232,0.00010887544,0.01414225],"genre_scores_gemma":[0.9855833,0.00002044263,0.014041899,0.00025016253,0.000024504068,0.0000060066636,6.465206e-7,0.00000530249,0.00006772417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983438,0.0000260717,0.0004778917,0.000338508,0.00051855715,0.00029515222],"domain_scores_gemma":[0.9986626,0.00008698904,0.00033173178,0.00027722967,0.0005836858,0.000057755322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054270675,0.00017259143,0.00022233855,0.00016107627,0.00029539605,0.00023241807,0.0015863164,0.000101628495,0.000021576723],"category_scores_gemma":[0.001038655,0.00015080674,0.00008122849,0.00084095204,0.00010795262,0.001615345,0.0019155097,0.00045420014,0.000033606524],"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.000027391829,0.00007461213,0.0021579124,0.000041517334,0.000007649981,0.0000012339219,0.0065516806,0.04395501,0.006608524,0.89679736,0.00003567826,0.043741427],"study_design_scores_gemma":[0.00003455048,0.00002737979,0.000536027,0.00017695563,0.00000511642,0.00000297892,0.00088827714,0.73430586,0.121792994,0.14204851,0.00001452943,0.00016681178],"about_ca_topic_score_codex":0.000091382426,"about_ca_topic_score_gemma":0.000028701847,"teacher_disagreement_score":0.7547489,"about_ca_system_score_codex":0.00009039568,"about_ca_system_score_gemma":0.00017425072,"threshold_uncertainty_score":0.614972},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8877514,0.00007527275,0.09011878,0.007072154,0.0007233932,0.0009308718,0.0000097752945,0.00021988395,0.013098479],"genre_scores_gemma":[0.99575835,0.000027605134,0.0028304958,0.00034173756,0.00009427409,0.000070382644,9.1328735e-7,0.000020536747,0.0008556795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9967614,0.00007836583,0.0007027224,0.0009298248,0.0009018593,0.0006258619],"domain_scores_gemma":[0.99636024,0.00030822272,0.00050770066,0.00081163086,0.0018829093,0.0001292941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092842145,0.00036945048,0.00038333746,0.000110920526,0.00093733135,0.0005679989,0.0024027708,0.00010969731,0.00015801609],"category_scores_gemma":[0.0006320352,0.00022424723,0.00020479536,0.0018436854,0.0008940058,0.0009805316,0.0005116646,0.0006794858,0.00012459586],"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.00022150917,0.00048978144,0.0016237207,0.00010751965,0.000078507626,0.0000038046724,0.010585544,0.0005951197,0.0824873,0.8154067,0.00014290315,0.088257596],"study_design_scores_gemma":[0.00004283535,0.00036214164,0.0009551792,0.00017913844,0.000036397287,0.000035467503,0.00900376,0.11242361,0.856837,0.01964371,0.00013984108,0.00034093516],"about_ca_topic_score_codex":0.00015834313,"about_ca_topic_score_gemma":0.000120093115,"teacher_disagreement_score":0.79576296,"about_ca_system_score_codex":0.00014724964,"about_ca_system_score_gemma":0.00054943445,"threshold_uncertainty_score":0.9144536},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011749725,0.000052508807,0.98173696,0.0035472827,0.000515784,0.00033814186,0.0000021872124,0.00008307366,0.0019743294],"genre_scores_gemma":[0.79851824,0.000034128847,0.20077269,0.0003230782,0.000072493836,0.000034842804,0.0000017562749,0.000010375075,0.00023237798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847007,0.0000145791455,0.0004301745,0.00045549643,0.00032051824,0.00030915084],"domain_scores_gemma":[0.9983818,0.00008248325,0.0003023381,0.00027795843,0.0008860078,0.00006944548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003564721,0.00016315098,0.00019822839,0.00005156048,0.00025392044,0.000261323,0.0008712293,0.000055897766,0.000018424469],"category_scores_gemma":[0.00048479871,0.00013363476,0.00014521915,0.0005774145,0.00008744139,0.00059254444,0.0002591206,0.00015649763,0.000033150787],"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.000019689114,0.00006643331,0.00021624335,0.000030221074,0.000008060015,3.9299437e-7,0.00019853731,0.0007627652,0.019705225,0.54542774,0.00024242084,0.43332225],"study_design_scores_gemma":[0.000023748646,0.0000464128,0.00019976131,0.00015653616,0.000007257831,0.0000029379169,0.00011711965,0.55614114,0.18628702,0.2567221,0.00018502485,0.00011096671],"about_ca_topic_score_codex":0.0000074356954,"about_ca_topic_score_gemma":0.0000066652037,"teacher_disagreement_score":0.78676856,"about_ca_system_score_codex":0.000035562633,"about_ca_system_score_gemma":0.000083593746,"threshold_uncertainty_score":0.54494673},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10530077,0.000031632488,0.86381954,0.015503036,0.00060436834,0.00054381206,0.0000092697355,0.00018226363,0.014005307],"genre_scores_gemma":[0.94147784,0.000008803424,0.057411097,0.00047052023,0.00006168244,0.00003858489,0.0000014531767,0.000012282252,0.0005177243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970369,0.00009639694,0.00065984565,0.00090015377,0.00082565064,0.000481105],"domain_scores_gemma":[0.9976261,0.0001513512,0.00027148117,0.00061986264,0.0010846354,0.00024657114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008774413,0.00025121885,0.00045412098,0.00027730473,0.00024108913,0.00030809027,0.0024944574,0.00010795333,0.000055980203],"category_scores_gemma":[0.0013115635,0.00019817444,0.0002939472,0.0033459808,0.00013546814,0.00018579002,0.0009898044,0.0006064449,0.00007662467],"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.00002782306,0.00040769664,0.0032397206,0.000061159946,0.00008982873,0.00000152367,0.0028294376,0.0026479608,0.0043036477,0.95302033,0.000041424628,0.033329424],"study_design_scores_gemma":[0.00004354808,0.00017079193,0.007941472,0.00011975362,0.00007919367,0.00000944412,0.0009064836,0.86959434,0.09024257,0.030182384,0.00025976487,0.00045023],"about_ca_topic_score_codex":0.00012518378,"about_ca_topic_score_gemma":0.00005232722,"teacher_disagreement_score":0.922838,"about_ca_system_score_codex":0.00007007382,"about_ca_system_score_gemma":0.00022807499,"threshold_uncertainty_score":0.80813193},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9054127,0.00008943012,0.002101881,0.010748479,0.0010308508,0.0007941841,0.000017244558,0.00014409228,0.07966114],"genre_scores_gemma":[0.9982531,0.000053434047,0.00037685767,0.000032164065,0.00003870515,0.00002467974,0.0000011964709,0.000007566062,0.001212274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.9986154,0.000049927996,0.000358164,0.00016455616,0.0006005429,0.0002114336],"domain_scores_gemma":[0.9989437,0.00012432752,0.0004041702,0.00007647802,0.0004128781,0.00003847411],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0011459383,0.00008377044,0.0001214578,0.000058012312,0.0018367801,0.00008264647,0.0007002086,0.000034720942,0.00020192127],"category_scores_gemma":[0.00049375946,0.000060749757,0.000080311176,0.00054347137,0.0004349295,0.00011962973,0.00006211825,0.00029972402,0.0000039500674],"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.000089743655,0.00004775951,0.0024869477,0.000011598212,0.000011533439,1.1614412e-7,0.04036379,0.015721582,0.0022984655,0.9175592,0.0000711464,0.02133813],"study_design_scores_gemma":[0.00013480497,0.0011927478,0.0026465312,0.00039674874,0.00011364978,0.000003093629,0.6150132,0.07351031,0.12765397,0.15730384,0.02130077,0.0007303378],"about_ca_topic_score_codex":0.00021205946,"about_ca_topic_score_gemma":0.00008768214,"teacher_disagreement_score":0.76025534,"about_ca_system_score_codex":0.000042328553,"about_ca_system_score_gemma":0.00013839574,"threshold_uncertainty_score":0.99946266},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015443086,0.000045774876,0.96846646,0.0036253282,0.00047575196,0.00023160444,0.0000024062674,0.000056951667,0.011652634],"genre_scores_gemma":[0.98883766,0.00001982722,0.01058836,0.00016496073,0.0000662411,0.000014187049,0.0000011107609,0.0000061906358,0.00030143835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826366,0.000042890675,0.00047275584,0.0005263139,0.00042343506,0.0002709643],"domain_scores_gemma":[0.9980637,0.00014818257,0.0002784477,0.00035194776,0.0010741644,0.00008359936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035555224,0.00017315858,0.00029698154,0.00010575849,0.00020002191,0.00028457245,0.0010676814,0.000080535356,0.00015906729],"category_scores_gemma":[0.00082273106,0.00013116725,0.0002305603,0.0019097303,0.00017842032,0.00032755715,0.00032947102,0.00021618925,0.000045763874],"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.00001987014,0.00016152742,0.0005347864,0.000013918798,0.00012238047,0.0000013966309,0.00061609334,0.027594913,0.01107683,0.9178565,0.00007947186,0.041922312],"study_design_scores_gemma":[0.000013814817,0.000048680402,0.0008030129,0.00003520601,0.000099868266,0.0000023282041,0.00014890856,0.7979424,0.1343734,0.06632992,0.000053704953,0.00014877555],"about_ca_topic_score_codex":0.000035751957,"about_ca_topic_score_gemma":0.000099347715,"teacher_disagreement_score":0.9733946,"about_ca_system_score_codex":0.000050612176,"about_ca_system_score_gemma":0.00017050642,"threshold_uncertainty_score":0.5348846},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64439213,0.000100474805,0.32644603,0.021349167,0.0039044595,0.0010585646,0.000016699812,0.000252746,0.002479745],"genre_scores_gemma":[0.98904455,0.000022783259,0.009976565,0.00046367157,0.0003660434,0.000020746944,0.000004819222,0.000010126281,0.0000906926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831474,0.00002725774,0.0004738782,0.00047327153,0.0003577758,0.00035305743],"domain_scores_gemma":[0.99802965,0.00019583953,0.0003495484,0.00019602569,0.0011583224,0.00007064215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040774187,0.00017023619,0.00020871552,0.000046713736,0.00034085746,0.0002779648,0.0008921389,0.000082386505,0.000030622596],"category_scores_gemma":[0.00030615428,0.00013503713,0.00017013118,0.000621433,0.000106494,0.00036680128,0.00028242124,0.00021086163,0.000019240726],"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.00007084498,0.00011752068,0.00019361831,0.000060835686,0.000022132155,0.0000011154492,0.0003558285,0.005172943,0.013157298,0.82201785,0.0009578687,0.15787216],"study_design_scores_gemma":[0.00003620112,0.00010898712,0.00020569407,0.00015912215,0.000008127681,0.000007718789,0.000107631065,0.6560749,0.08861737,0.25443524,0.000098031494,0.00014099076],"about_ca_topic_score_codex":0.000009113779,"about_ca_topic_score_gemma":0.0000059259205,"teacher_disagreement_score":0.650902,"about_ca_system_score_codex":0.000031164825,"about_ca_system_score_gemma":0.00009848328,"threshold_uncertainty_score":0.55066544},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021459255,0.000024619645,0.96976036,0.004656594,0.0007923857,0.0003478597,0.0000116410265,0.00009340987,0.002853901],"genre_scores_gemma":[0.99299955,0.000020868592,0.0061336625,0.0005185938,0.00009436458,0.000015629957,0.000003889655,0.000009635177,0.00020380892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985793,0.000015748752,0.00041374314,0.00042567268,0.00029568956,0.00026980077],"domain_scores_gemma":[0.99825525,0.00007723008,0.00030626892,0.00024941436,0.0010397655,0.00007208112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029105286,0.00015973944,0.0002021315,0.00008866966,0.00020413796,0.00036219571,0.0011653297,0.000068255256,0.000028567407],"category_scores_gemma":[0.00036450516,0.00012872527,0.00012839875,0.00087553007,0.00014096244,0.0004992969,0.00030891437,0.00018407086,0.000006633879],"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.000013554253,0.000081129736,0.00024619637,0.00001862767,0.000013418143,4.0148188e-7,0.00037864147,0.00046844207,0.0023568263,0.9525849,0.00034392325,0.04349394],"study_design_scores_gemma":[0.000025832273,0.00006813325,0.000051328818,0.00006859461,0.000010450025,0.0000025332695,0.00045455125,0.7264542,0.15275605,0.119737625,0.00021538333,0.00015529316],"about_ca_topic_score_codex":0.000013370393,"about_ca_topic_score_gemma":0.000011172982,"teacher_disagreement_score":0.9715403,"about_ca_system_score_codex":0.000018811526,"about_ca_system_score_gemma":0.00009339412,"threshold_uncertainty_score":0.52492636},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008194929,0.00010054442,0.97571874,0.008698101,0.00060231984,0.00081285305,0.0000053922267,0.00018512673,0.005681976],"genre_scores_gemma":[0.8994915,0.000064395055,0.0981005,0.00080238713,0.0002904938,0.00019491116,0.0000021224685,0.00002487612,0.0010288341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980339,0.000014437479,0.0004990406,0.0006509791,0.00031086107,0.00049078034],"domain_scores_gemma":[0.99782956,0.0002475919,0.00038453867,0.0004760882,0.0009634201,0.00009879961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003597766,0.00020958247,0.00025492822,0.000048986276,0.0003976085,0.00024707912,0.0016576175,0.00008248169,0.000020136888],"category_scores_gemma":[0.00046256892,0.00017837746,0.00014098249,0.0010622651,0.00013856651,0.0004337675,0.00047168505,0.00025840188,0.000029203266],"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.000037846272,0.00007212619,0.00002582078,0.000029593231,0.000014441189,4.71783e-7,0.0005619352,0.0066347546,0.012732546,0.94872814,0.00080133526,0.030360973],"study_design_scores_gemma":[0.00002460764,0.000085760454,0.000016429049,0.000120884346,0.000008971165,0.000006294314,0.00015936226,0.4083788,0.2786322,0.31143993,0.0009504916,0.0001762656],"about_ca_topic_score_codex":0.000004565074,"about_ca_topic_score_gemma":0.000011217622,"teacher_disagreement_score":0.89129657,"about_ca_system_score_codex":0.000047756777,"about_ca_system_score_gemma":0.00010234533,"threshold_uncertainty_score":0.72740215},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9788633,0.00010078941,0.017322894,0.0011514539,0.00039081473,0.00045086988,0.000007636626,0.00005957786,0.0016526546],"genre_scores_gemma":[0.9982734,0.00002917786,0.0012630492,0.000042884905,0.000072603274,0.00012670575,0.000002417638,0.000020880909,0.00016891662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985248,0.000020143172,0.00050801114,0.00042495315,0.00023323906,0.0002888894],"domain_scores_gemma":[0.9987052,0.00015480687,0.0002927355,0.00014668547,0.0006643481,0.000036220874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038471547,0.00017225485,0.00024827055,0.00007534445,0.00025111428,0.00011819223,0.0004051828,0.00011198921,0.0000907143],"category_scores_gemma":[0.0014890926,0.00014865473,0.00011640794,0.0003927342,0.0001455592,0.00017272944,0.00020463756,0.00034749243,0.00003204339],"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.0003548401,0.00023552008,0.010346173,0.00022604357,0.000017062228,0.0000020795553,0.0046228506,0.000045812365,0.395341,0.50304466,0.0000102061185,0.08575377],"study_design_scores_gemma":[0.000086695836,0.0006094841,0.06445375,0.0006314671,0.00008303314,0.000016574608,0.026139501,0.010344931,0.70154387,0.19544953,0.00008696298,0.0005541863],"about_ca_topic_score_codex":0.00005973367,"about_ca_topic_score_gemma":0.000032707867,"teacher_disagreement_score":0.3075951,"about_ca_system_score_codex":0.00006133123,"about_ca_system_score_gemma":0.000050502334,"threshold_uncertainty_score":0.60619634},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5441351,0.000022895721,0.34242004,0.010900001,0.0019446871,0.00050112896,0.0000068949957,0.0004270357,0.09964224],"genre_scores_gemma":[0.99419475,0.0000063132666,0.0049748537,0.00024903353,0.00020148746,0.0000056575755,5.797578e-7,0.000019455903,0.00034784497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99766237,0.000051867934,0.00038519048,0.0007120658,0.0007598451,0.0004286871],"domain_scores_gemma":[0.99816906,0.00019504067,0.00034077707,0.0004228652,0.00077041687,0.00010180775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035279657,0.00028518075,0.0003427156,0.000116337884,0.00028925802,0.00037312528,0.0020273388,0.000102630205,0.00006213855],"category_scores_gemma":[0.0009753923,0.00023387988,0.00020785355,0.00096946146,0.00025060886,0.0005556295,0.000688204,0.0006584766,0.00008777976],"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.000048162292,0.00030329925,0.00006930325,0.000022412281,0.000019309675,0.0000067792166,0.002329865,0.002116908,0.05537481,0.80186194,0.00005092544,0.13779627],"study_design_scores_gemma":[0.000048730788,0.00029430282,0.00018159224,0.00026673987,0.000017698532,0.000010560005,0.0009929086,0.14542681,0.79188794,0.06035459,0.00021265566,0.00030546528],"about_ca_topic_score_codex":0.00002739791,"about_ca_topic_score_gemma":0.000007141579,"teacher_disagreement_score":0.74150735,"about_ca_system_score_codex":0.00012646324,"about_ca_system_score_gemma":0.00022612406,"threshold_uncertainty_score":0.95373446},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9916594,0.000035931436,0.0023635386,0.00072627526,0.0000808711,0.0001742696,0.00004073857,0.00006110929,0.0048578396],"genre_scores_gemma":[0.99928564,0.0000707282,0.0004830536,0.000046640514,0.000008626913,0.000012756239,0.0000057648854,0.000008198121,0.00007861282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99901664,0.0000057814837,0.00046980914,0.00017713993,0.00019955305,0.00013104538],"domain_scores_gemma":[0.9990558,0.00004297153,0.000106385945,0.00013414497,0.0006240989,0.000036622972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001591556,0.000114389106,0.0002540846,0.00016764792,0.000051938598,0.000028803044,0.00022465452,0.00005111816,0.00022405708],"category_scores_gemma":[0.000060054605,0.00009854546,0.000105342144,0.0012849288,0.00030686278,0.00008271159,0.000029571924,0.00014091899,0.0000050150566],"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.000012590861,0.00007153693,0.0019396913,0.00015808018,0.00020959487,1.4966103e-7,0.00199026,0.0018861989,0.073501825,0.9135934,0.000010098094,0.006626575],"study_design_scores_gemma":[0.000050698356,0.000079515914,0.019276885,0.00023309325,0.00061175035,0.0000018656008,0.0027513409,0.15685908,0.65386087,0.16585223,0.00011861077,0.000304038],"about_ca_topic_score_codex":0.00007696276,"about_ca_topic_score_gemma":0.00025783267,"teacher_disagreement_score":0.74774116,"about_ca_system_score_codex":0.000015068421,"about_ca_system_score_gemma":0.00003276915,"threshold_uncertainty_score":0.40185672},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88683283,0.0000115681705,0.10665699,0.003626307,0.00073589507,0.0006601021,0.000040686595,0.000106884436,0.0013287127],"genre_scores_gemma":[0.9977804,0.000005406603,0.00053148763,0.001288604,0.00016682436,0.000051770377,0.0000026747734,0.0000340782,0.00013876367],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.997675,0.00004166085,0.00054822245,0.0007384937,0.0004666981,0.0005299136],"domain_scores_gemma":[0.9982804,0.00042484488,0.00041051934,0.00027546118,0.0004941432,0.00011461256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025787757,0.00032879185,0.0003819952,0.000085413616,0.0003379277,0.0003948122,0.0010577004,0.000113182345,0.000105018735],"category_scores_gemma":[0.00041018781,0.00023690175,0.00017259704,0.0003703082,0.00032361073,0.00022944693,0.00020615247,0.0004316231,0.000008553548],"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.0023487564,0.0012673611,0.011618957,0.00058379554,0.00006599194,0.00003304656,0.0030111657,0.04740516,0.48692608,0.18440638,0.0004592042,0.26187408],"study_design_scores_gemma":[0.000056161218,0.00029536994,0.00019388566,0.00026227537,0.000015619302,0.000009152726,0.0002057039,0.42077166,0.5758455,0.0021109697,0.0000474897,0.00018622464],"about_ca_topic_score_codex":0.000057772253,"about_ca_topic_score_gemma":0.0001249191,"teacher_disagreement_score":0.3733665,"about_ca_system_score_codex":0.00003725217,"about_ca_system_score_gemma":0.00008655916,"threshold_uncertainty_score":0.9660573},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88648117,0.00049294246,0.10538757,0.0020509781,0.0009782441,0.00069344376,0.000010009195,0.000065703905,0.0038399205],"genre_scores_gemma":[0.9982168,0.00011141465,0.0013645795,0.00005748153,0.00003569209,0.000017680333,3.1936452e-7,0.0000066341217,0.00018939152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981871,0.0000333592,0.0006058533,0.0004303069,0.00051613466,0.00022721721],"domain_scores_gemma":[0.99830055,0.000078177836,0.00047696434,0.00031431208,0.0007543172,0.0000756757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053218275,0.00016207993,0.0002973182,0.00007104776,0.00010486935,0.00016191734,0.000839194,0.000071254166,0.000020460911],"category_scores_gemma":[0.00025907304,0.00012534318,0.000076250224,0.00037276003,0.00014531623,0.00033103148,0.00037196378,0.00012728582,0.000012215421],"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.000010913768,0.000080617625,0.00053981045,0.00015676119,0.000016021479,7.621662e-7,0.0009975464,0.000064100495,0.17524816,0.8164026,0.00002778216,0.0064549237],"study_design_scores_gemma":[0.000046039993,0.00013748325,0.0011657282,0.00063720916,0.000014624347,0.00001327913,0.0012069859,0.133378,0.83739537,0.02573786,0.00007999897,0.00018741173],"about_ca_topic_score_codex":0.00007940963,"about_ca_topic_score_gemma":0.0000047553967,"teacher_disagreement_score":0.79066473,"about_ca_system_score_codex":0.000034106844,"about_ca_system_score_gemma":0.000086081105,"threshold_uncertainty_score":0.5111347},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96133316,0.000039968494,0.0002829647,0.011537122,0.0003385011,0.0006661694,0.000017505512,0.000067313646,0.025717298],"genre_scores_gemma":[0.99833626,0.00007142404,0.00034220083,0.0005800078,0.000054943586,0.000026651729,0.000015360447,0.000012016572,0.0005611101],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99873054,0.000011604912,0.00036209633,0.00027040942,0.00042654344,0.00019878591],"domain_scores_gemma":[0.99913,0.000023260714,0.00012890341,0.00010771775,0.00051132304,0.00009881193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024802767,0.0001288267,0.00020477622,0.00011658794,0.000051890074,0.00006491896,0.00021448801,0.00008681956,0.00042579393],"category_scores_gemma":[0.00031143823,0.00010095195,0.00007124078,0.0006730241,0.00013119036,0.00012101506,0.00005172174,0.0002458064,0.00005258694],"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.0005463878,0.0016696037,0.046054117,0.0010657368,0.00007318238,0.00002161802,0.009239903,0.0000033301224,0.11105957,0.5574829,0.00024662694,0.27253705],"study_design_scores_gemma":[0.00018225283,0.00019795806,0.01588026,0.0012221109,0.00006057338,0.00003159981,0.0021727076,0.00074593123,0.95867807,0.02031719,0.00033932162,0.00017202113],"about_ca_topic_score_codex":0.000022232623,"about_ca_topic_score_gemma":0.00003860403,"teacher_disagreement_score":0.8476185,"about_ca_system_score_codex":0.000032798125,"about_ca_system_score_gemma":0.00019122462,"threshold_uncertainty_score":0.4662145},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23299459,0.00008826919,0.7512802,0.010305778,0.0009874367,0.0012318,0.00001031597,0.000098950106,0.003002667],"genre_scores_gemma":[0.98166007,0.000031441024,0.017603466,0.00020286729,0.000054934462,0.00014131924,0.0000016937364,0.000017264152,0.00028696362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9973035,0.00003545971,0.00091713696,0.00069964485,0.0005412109,0.0005030845],"domain_scores_gemma":[0.9976192,0.00039842582,0.00040811216,0.0004295634,0.0010418601,0.00010285634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087184424,0.00027728197,0.00040362575,0.00019775187,0.00024655784,0.0005122896,0.0017613709,0.00013486714,0.000051392504],"category_scores_gemma":[0.001947526,0.00022950437,0.00019711998,0.00093711464,0.00033805464,0.0006356087,0.0004019622,0.00027846405,0.00006189335],"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.00017039714,0.00026262138,0.00061593455,0.00006805934,0.000015524505,0.0000022134993,0.002033339,0.0025413567,0.039247062,0.820271,0.00018388349,0.13458858],"study_design_scores_gemma":[0.000044332377,0.00007341795,0.0001854222,0.00018702923,0.000006112461,0.0000040748755,0.0002798657,0.27611178,0.48204854,0.24083374,0.000079043704,0.00014665512],"about_ca_topic_score_codex":0.00006382984,"about_ca_topic_score_gemma":0.00027453393,"teacher_disagreement_score":0.74866545,"about_ca_system_score_codex":0.00009544789,"about_ca_system_score_gemma":0.00025703292,"threshold_uncertainty_score":0.9358916},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040818825,0.000061960316,0.98997605,0.0021145004,0.0010826669,0.00088128325,0.000009980072,0.00018209346,0.0016095641],"genre_scores_gemma":[0.94700396,0.00002134054,0.05232482,0.00017001558,0.000071686605,0.00021843062,0.0000018016599,0.000021071097,0.00016686722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978012,0.000022388016,0.00066559995,0.00066026795,0.00041294534,0.00043763526],"domain_scores_gemma":[0.9973258,0.00017115328,0.00042590572,0.00044200438,0.0015112244,0.00012395474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004506637,0.00026090108,0.00032738378,0.00013722651,0.00024909148,0.00034786898,0.001507938,0.000100192345,0.000027345852],"category_scores_gemma":[0.0005261689,0.00021571513,0.00016146398,0.0006587485,0.00015978063,0.00028082132,0.00036923133,0.00019883459,0.000017544946],"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.000026908929,0.00024921037,0.000025713132,0.000067889974,0.000020631227,2.5616086e-7,0.0007950195,0.0017566994,0.006427264,0.9709616,0.00045284495,0.01921598],"study_design_scores_gemma":[0.000061253835,0.00028829518,0.000028534227,0.00043788485,0.00002773675,0.000019433317,0.000774284,0.5965352,0.26351857,0.137863,0.00010139744,0.00034440096],"about_ca_topic_score_codex":0.000016745169,"about_ca_topic_score_gemma":0.000006287926,"teacher_disagreement_score":0.94292206,"about_ca_system_score_codex":0.00014089006,"about_ca_system_score_gemma":0.00017312229,"threshold_uncertainty_score":0.8796607},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0762993,0.000112603,0.8901395,0.016332982,0.0008555255,0.0004895889,0.0000035356813,0.00025430013,0.015512652],"genre_scores_gemma":[0.9942475,0.000045473094,0.004141366,0.0007839262,0.00002571672,0.000013767442,0.0000019323895,0.00000741046,0.00073291134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836546,0.000048840873,0.00048273118,0.00029607295,0.0005101024,0.00029679146],"domain_scores_gemma":[0.9984548,0.00013511228,0.0004008763,0.00023814914,0.0007075618,0.00006349706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067515834,0.00017054412,0.00016779514,0.00007233454,0.0004975229,0.0007092057,0.0013040601,0.000060930994,0.00008028224],"category_scores_gemma":[0.0009369909,0.000117977135,0.000097998476,0.0007306117,0.00014923225,0.00093788817,0.000371968,0.0005034826,0.00017681169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025491825,0.00013566461,0.00063623156,0.00006514104,0.000035206078,0.000001079375,0.017510712,0.0019897632,0.12328183,0.5835493,0.0008031395,0.2719664],"study_design_scores_gemma":[0.0000652416,0.00006711928,0.0004848241,0.00018980107,0.000012924269,0.000014436583,0.006532048,0.69330496,0.2792606,0.012597746,0.007186706,0.00028359995],"about_ca_topic_score_codex":0.00003164995,"about_ca_topic_score_gemma":0.00000436104,"teacher_disagreement_score":0.9179482,"about_ca_system_score_codex":0.00003650834,"about_ca_system_score_gemma":0.00011016469,"threshold_uncertainty_score":0.6838887},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08670893,0.000090245674,0.90129775,0.0032204215,0.0007852597,0.00026228107,0.000005699639,0.00013257198,0.0074968347],"genre_scores_gemma":[0.86467534,0.00005754509,0.13427913,0.0003102119,0.00010385877,0.000008617986,9.3528007e-7,0.000015351223,0.00054897927],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99773544,0.00010053276,0.0005876125,0.0006014256,0.0005276624,0.0004473501],"domain_scores_gemma":[0.99756277,0.00013180487,0.00036755088,0.00039738306,0.0014377692,0.00010269734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008580584,0.00023646705,0.00032323573,0.00015162711,0.00048617486,0.000535469,0.0012984381,0.00011028072,0.000094768075],"category_scores_gemma":[0.0009910589,0.00020008774,0.00019732301,0.0011255378,0.00031510138,0.00067056954,0.00053071155,0.00035109834,0.00006183845],"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.000025538848,0.00006026425,0.000015481857,0.000017852195,0.000011934303,0.0000025683694,0.00042837174,0.000122011596,0.53759485,0.45244512,0.00007206405,0.009203954],"study_design_scores_gemma":[0.00004976719,0.00003857178,0.0000343562,0.00013795518,0.000017766044,0.00002199136,0.00020521514,0.2747695,0.62467366,0.09980578,0.00007471661,0.00017069012],"about_ca_topic_score_codex":0.00008041989,"about_ca_topic_score_gemma":0.000006356797,"teacher_disagreement_score":0.77796644,"about_ca_system_score_codex":0.00009757947,"about_ca_system_score_gemma":0.00028950968,"threshold_uncertainty_score":0.8159341},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38146427,0.000053801166,0.5445686,0.011153074,0.0025854337,0.00093636755,0.0000021194119,0.00089878106,0.05833757],"genre_scores_gemma":[0.99597335,0.000051573807,0.0022951989,0.00020664971,0.000049659797,0.000020580665,0.0000010076249,0.000009037793,0.001392937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981166,0.000032431733,0.00051069434,0.0004706531,0.0005802249,0.0002894013],"domain_scores_gemma":[0.99833125,0.0000358591,0.00027338043,0.00025212014,0.0010230023,0.000084375126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036582584,0.00017997404,0.00019817911,0.00009898937,0.0003455842,0.00031595957,0.0009879849,0.00007868001,0.00016323762],"category_scores_gemma":[0.00020615017,0.00014632907,0.00017288973,0.000857225,0.00007520835,0.00046151615,0.00037938435,0.00031399497,0.00018946189],"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.00001947579,0.00021355436,0.0005259958,0.000083956875,0.000029232866,0.0000015740724,0.0012001237,0.00033791873,0.07576063,0.8728415,0.00008048598,0.048905548],"study_design_scores_gemma":[0.000048886348,0.00022041867,0.00034819552,0.00016742869,0.000015475358,0.0000124948365,0.0011697479,0.50622785,0.4687518,0.022377772,0.00041380734,0.0002461484],"about_ca_topic_score_codex":0.000010934853,"about_ca_topic_score_gemma":0.0000044005965,"teacher_disagreement_score":0.85046375,"about_ca_system_score_codex":0.000056851444,"about_ca_system_score_gemma":0.0001079224,"threshold_uncertainty_score":0.59671265},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74573827,0.00006848683,0.17465293,0.011875859,0.0012496592,0.00078937906,0.000015408208,0.00048660793,0.06512337],"genre_scores_gemma":[0.9861624,0.000019406942,0.012182285,0.0004503662,0.00011414251,0.000008949052,0.0000035565183,0.000016501579,0.0010423958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.997712,0.000055228258,0.000502348,0.0005952836,0.00074380246,0.00039130423],"domain_scores_gemma":[0.9982449,0.00012854922,0.00041770254,0.0002394463,0.0008489077,0.00012054167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004706404,0.00024432474,0.00029194256,0.00009852899,0.00031687616,0.00039233823,0.0012258093,0.00008789093,0.0001726643],"category_scores_gemma":[0.00061073893,0.00018851507,0.00011830606,0.00075097795,0.00024318398,0.0005103247,0.0004346994,0.00059359486,0.000068380694],"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.0001254132,0.00026138226,0.0006061259,0.000021398559,0.000038208993,0.0000058163273,0.0021359287,0.00093086006,0.062208537,0.8917853,0.00007670672,0.041804284],"study_design_scores_gemma":[0.00029857137,0.0007603991,0.0011979451,0.0005024036,0.000044189605,0.000051817664,0.009219522,0.35332868,0.60834837,0.022446586,0.003146592,0.00065492006],"about_ca_topic_score_codex":0.000037794038,"about_ca_topic_score_gemma":0.000031407228,"teacher_disagreement_score":0.86933875,"about_ca_system_score_codex":0.00006177743,"about_ca_system_score_gemma":0.00026455728,"threshold_uncertainty_score":0.76874214},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94233006,0.00041484347,0.00043042714,0.0025288991,0.0008107525,0.0003112634,0.000064169806,0.000059604332,0.05304998],"genre_scores_gemma":[0.99738747,0.000073219984,0.0002024455,0.00027900148,0.00007599111,0.000020541298,0.000002932217,0.000020737716,0.0019376645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99813044,0.000017077293,0.00091836386,0.0004926574,0.0001102811,0.00033117423],"domain_scores_gemma":[0.99839985,0.00013619263,0.00088917103,0.00025310845,0.00025779565,0.00006389706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085357105,0.00020145575,0.0004025932,0.0000836603,0.00021548892,0.00017835984,0.0007141047,0.000105532585,0.00052183616],"category_scores_gemma":[0.0015210997,0.0001882012,0.00015764132,0.00048337784,0.00016757609,0.00025844254,0.00018432118,0.00028004433,0.0004941268],"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.00005207426,0.00019678523,0.0020698423,0.00008414162,0.000047874437,8.528027e-7,0.0010412155,0.000017386987,0.046834674,0.942417,0.0008969115,0.006341235],"study_design_scores_gemma":[0.00008414427,0.00010546731,0.00029878772,0.00048891467,0.000012287366,0.0000071150357,0.0015245109,0.005016932,0.6417965,0.3483453,0.0019375418,0.00038248114],"about_ca_topic_score_codex":0.000054489283,"about_ca_topic_score_gemma":0.0000027545054,"teacher_disagreement_score":0.5949618,"about_ca_system_score_codex":0.000049209244,"about_ca_system_score_gemma":0.000035645407,"threshold_uncertainty_score":0.7674622},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069398643,0.00018661984,0.9792245,0.0016861907,0.0003968963,0.00022913152,0.0000016416961,0.00023297641,0.011102156],"genre_scores_gemma":[0.9795412,0.00013936624,0.019291637,0.00047087233,0.000102474034,0.000013551369,6.135079e-7,0.000013112389,0.00042718305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99815243,0.000023481252,0.00047146453,0.0005428544,0.000430423,0.00037936715],"domain_scores_gemma":[0.9981318,0.00010439252,0.0003171619,0.00032504348,0.0010278237,0.00009378414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031446095,0.00021512748,0.00027269867,0.00006428992,0.00021425614,0.00030602815,0.001494797,0.00010302793,0.00006550039],"category_scores_gemma":[0.0007234496,0.00016962519,0.00014185336,0.0010100069,0.0002464567,0.00063179375,0.0006466276,0.00039182036,0.000024886249],"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.000016702363,0.0000818997,0.000067295965,0.000009372002,0.00000927158,0.0000028238733,0.00030967232,0.000056254958,0.01873501,0.7776561,0.00020646105,0.20284918],"study_design_scores_gemma":[0.00001612135,0.00012474769,0.000066845714,0.00020639187,0.000006486905,0.0000126080395,0.00022551784,0.056472823,0.851179,0.09119037,0.00031154478,0.00018752206],"about_ca_topic_score_codex":0.000008554967,"about_ca_topic_score_gemma":0.0000019091276,"teacher_disagreement_score":0.97260135,"about_ca_system_score_codex":0.000041386556,"about_ca_system_score_gemma":0.00012212919,"threshold_uncertainty_score":0.6917114},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30445293,0.000063430045,0.66626066,0.019140683,0.00094010076,0.00069456716,0.0000048827856,0.0008400093,0.0076027587],"genre_scores_gemma":[0.97547746,0.00003268821,0.023583593,0.0000898899,0.000039990726,0.00003237016,0.0000012443007,0.000009598521,0.0007331548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99830437,0.000023577064,0.0003902352,0.00050990307,0.0004855984,0.00028631455],"domain_scores_gemma":[0.9984859,0.00006956291,0.0003642217,0.00030144033,0.00072376867,0.00005509768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027698945,0.0001876937,0.00020018635,0.00008590614,0.0002744646,0.00035134458,0.0012288534,0.00009977919,0.000048818416],"category_scores_gemma":[0.00064599136,0.00013663077,0.000052040505,0.000814484,0.00026409753,0.00059368,0.0003741348,0.0003448763,0.00007303154],"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.000044779797,0.00024866685,0.00050237327,0.0000141610735,0.000015021634,8.245527e-7,0.0006942032,0.000039607374,0.06533845,0.76845604,0.000043122945,0.16460274],"study_design_scores_gemma":[0.00012745742,0.00021684563,0.00023994074,0.000106704014,0.000014471455,0.0000041426692,0.0011564563,0.19049065,0.7783468,0.028877212,0.00020441775,0.00021494132],"about_ca_topic_score_codex":0.000016916536,"about_ca_topic_score_gemma":0.000013490618,"teacher_disagreement_score":0.73957884,"about_ca_system_score_codex":0.000045344237,"about_ca_system_score_gemma":0.00015440836,"threshold_uncertainty_score":0.55716413},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36713538,0.00006850487,0.6266354,0.0020517525,0.00024919095,0.0004544033,0.0000049514133,0.00009041807,0.0033100185],"genre_scores_gemma":[0.99462485,0.000017295406,0.005021783,0.0001399628,0.00003982352,0.000044435797,0.0000034886398,0.000012776728,0.00009559561],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978317,0.00006549127,0.00055813824,0.00070208544,0.00045408393,0.00038850008],"domain_scores_gemma":[0.99746066,0.00029876377,0.0005102009,0.00024362878,0.001372568,0.000114155264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036890796,0.00027126283,0.00029383687,0.00012782897,0.00053381635,0.00046979357,0.00077611284,0.00009316934,0.000029435927],"category_scores_gemma":[0.00041806174,0.00021292569,0.00007441936,0.0012839695,0.00034733606,0.0013605179,0.00035521892,0.00050008885,0.000008924519],"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.00020016963,0.0002970682,0.004368684,0.000034230572,0.00009552368,0.0000028445706,0.008341777,0.00859357,0.04474688,0.90679157,0.000092778464,0.026434915],"study_design_scores_gemma":[0.000022316985,0.00018731624,0.00044995043,0.00015006633,0.000014284393,0.0000147499,0.0018066074,0.6587944,0.31815982,0.020177346,0.0000141226665,0.00020902132],"about_ca_topic_score_codex":0.000044771143,"about_ca_topic_score_gemma":0.000060720635,"teacher_disagreement_score":0.8866142,"about_ca_system_score_codex":0.00009900025,"about_ca_system_score_gemma":0.0000801118,"threshold_uncertainty_score":0.8682858},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9933477,0.000010036179,0.0036581538,0.0009248428,0.0011113104,0.00056498597,0.000050956616,0.00018678208,0.00014525287],"genre_scores_gemma":[0.99500126,0.000010658076,0.0046013333,0.00008310349,0.00008146172,0.000051738676,0.000009461583,0.00001517677,0.00014581464],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998055,0.000052102525,0.0005535253,0.00055972044,0.00046516978,0.0003144903],"domain_scores_gemma":[0.9984834,0.00010734162,0.00046914018,0.00016856947,0.0007028163,0.00006870072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007892689,0.0002098269,0.00026014048,0.00007363829,0.00038653973,0.00036583783,0.00040179348,0.00009536894,0.00029159288],"category_scores_gemma":[0.0006411604,0.00016452375,0.00007263225,0.00026007788,0.00022165387,0.00035988432,0.0001777348,0.00012527537,0.00002395321],"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.0000868923,0.000026301546,0.00021649472,0.00013444533,0.000005740554,2.5686532e-7,0.0004169087,0.0006155468,0.89036113,0.10720175,0.000043761538,0.00089075865],"study_design_scores_gemma":[0.00005294367,0.0001099701,0.0007313839,0.00013734824,0.000023618197,0.000006898135,0.00044232875,0.31875017,0.61179966,0.067830004,0.000004017896,0.00011165583],"about_ca_topic_score_codex":0.00006776344,"about_ca_topic_score_gemma":0.000022870878,"teacher_disagreement_score":0.31813464,"about_ca_system_score_codex":0.000062951,"about_ca_system_score_gemma":0.00008567149,"threshold_uncertainty_score":0.67090833},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11387255,0.000057446567,0.86625713,0.011830116,0.0006104794,0.0006800652,0.0000041546004,0.0002191642,0.0064689005],"genre_scores_gemma":[0.93858767,0.000008178519,0.060620118,0.0004062097,0.00014454032,0.00008765005,0.0000010034705,0.000013370155,0.00013128936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983254,0.000019656272,0.00045491394,0.00053245586,0.00030562317,0.0003619149],"domain_scores_gemma":[0.9981371,0.00024165456,0.00034563165,0.00036065298,0.00084406557,0.00007086856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005272002,0.00017141282,0.00022081556,0.00005674926,0.00042681306,0.00032030005,0.0013835336,0.000060039845,0.000028826347],"category_scores_gemma":[0.000799697,0.00014717624,0.00013837757,0.0007704102,0.000109865345,0.00026799922,0.00037462235,0.00027486248,0.000050537543],"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.0000095158985,0.000053936747,0.00060846796,0.000038916805,0.000012076385,2.2537624e-7,0.00042664786,0.0016709277,0.022265848,0.9482062,0.00011727778,0.026589952],"study_design_scores_gemma":[0.000029043766,0.000060251863,0.0011989865,0.0002655203,0.00001541216,0.000009451949,0.00017505401,0.52085954,0.12729722,0.3495454,0.00033278042,0.00021138364],"about_ca_topic_score_codex":0.00007888712,"about_ca_topic_score_gemma":0.000019156994,"teacher_disagreement_score":0.8247151,"about_ca_system_score_codex":0.00003957254,"about_ca_system_score_gemma":0.00011676428,"threshold_uncertainty_score":0.6001673},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9373576,0.000076677,0.06102918,0.00037095151,0.00038354422,0.00050260685,0.000006435411,0.000008491599,0.0002644916],"genre_scores_gemma":[0.9976502,0.000086613174,0.0010021575,0.000058641082,0.00012374976,0.00008450271,0.000014739724,0.000014066809,0.00096535095],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990848,0.000008656231,0.00029504814,0.000290841,0.000114764356,0.00020593486],"domain_scores_gemma":[0.99928784,0.000057267684,0.00014264848,0.00008236915,0.00040112503,0.000028726736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002640311,0.000119043245,0.00015040394,0.000034755634,0.00012212583,0.00009303196,0.00019292787,0.00007509128,0.000026164314],"category_scores_gemma":[0.0010456956,0.000100790785,0.000102332226,0.0000884942,0.000039422113,0.000020728832,0.00006997212,0.000098387456,0.0000012317915],"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.00029217394,0.000043926517,0.00011463816,0.00007885659,0.000014401917,5.3839035e-8,0.00021236725,0.0017319644,0.9795726,0.01220935,0.00003174876,0.005697901],"study_design_scores_gemma":[0.00007708619,0.00019580734,0.000011675322,0.00014713466,0.000011969423,5.9411906e-7,0.0014546291,0.02119871,0.9711199,0.005186909,0.0004747735,0.00012083836],"about_ca_topic_score_codex":0.000016009204,"about_ca_topic_score_gemma":0.00004673253,"teacher_disagreement_score":0.060292557,"about_ca_system_score_codex":0.000021668695,"about_ca_system_score_gemma":0.00008030762,"threshold_uncertainty_score":0.4110129},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6106017,0.00016131224,0.009757882,0.0025607462,0.0008392303,0.0004902608,0.00020758266,0.000043483255,0.3753378],"genre_scores_gemma":[0.99686193,0.000017333461,0.0006075077,0.00007629445,0.000030503743,0.000020148622,0.0000010800142,0.000010714934,0.0023744602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986448,0.000016058199,0.0007577879,0.00030894048,0.000093795185,0.00017858756],"domain_scores_gemma":[0.99826443,0.00031290017,0.0006295222,0.00020719708,0.0005385835,0.000047373305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007571694,0.00012388498,0.00034021132,0.00016136702,0.00013952596,0.00005586997,0.00047971404,0.00007735077,0.0008590845],"category_scores_gemma":[0.0024070581,0.000114662405,0.00015228972,0.00072649267,0.00017927677,0.00009651053,0.00007421342,0.0001547745,0.00009446596],"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.000058871385,0.0001731011,0.002274797,0.000027453752,0.000023175568,2.4735664e-7,0.00063105545,0.00006669341,0.004277242,0.99104846,0.000292374,0.0011265373],"study_design_scores_gemma":[0.00005150249,0.00009764231,0.0017528236,0.00029947175,0.000009934754,0.000002097963,0.0013657607,0.010892779,0.36201018,0.6229882,0.00036019782,0.0001693972],"about_ca_topic_score_codex":0.000031095242,"about_ca_topic_score_gemma":0.000014850523,"teacher_disagreement_score":0.38626027,"about_ca_system_score_codex":0.000052725987,"about_ca_system_score_gemma":0.00012101621,"threshold_uncertainty_score":0.94063723},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47062021,0.00004714664,0.4662575,0.024155257,0.002177689,0.0007209244,0.000009848091,0.00040667973,0.035604756],"genre_scores_gemma":[0.9883451,0.000009838811,0.010519093,0.0009701639,0.000040795014,0.000015475267,3.3605008e-7,0.000010987817,0.000088223635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772865,0.000026659542,0.00051856827,0.0006925143,0.00062735355,0.00040627772],"domain_scores_gemma":[0.9982283,0.00013479186,0.00026072143,0.00050791766,0.00075798866,0.000110297246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037643782,0.0002440434,0.00025843654,0.00012312211,0.0002045265,0.0003133841,0.0017204139,0.000080980564,0.00007377887],"category_scores_gemma":[0.00056516577,0.00019676163,0.00015961884,0.0007656903,0.00024287144,0.00028378447,0.0003689066,0.00039654394,0.00003729182],"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.00002037909,0.00012198031,0.0002968908,0.00003360733,0.0000074170393,0.000004867053,0.00037591034,0.0025309098,0.035756595,0.8870895,0.000025186968,0.07373674],"study_design_scores_gemma":[0.000025478786,0.00007715449,0.000083199695,0.000198485,0.0000048456873,0.00000887938,0.00029967373,0.5990647,0.33664668,0.063394964,0.000027540902,0.0001683755],"about_ca_topic_score_codex":0.000023736187,"about_ca_topic_score_gemma":0.000008925923,"teacher_disagreement_score":0.8236945,"about_ca_system_score_codex":0.000041597345,"about_ca_system_score_gemma":0.00019721364,"threshold_uncertainty_score":0.8023706},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022485467,0.000092566086,0.95222294,0.0119867055,0.0010960924,0.0010912998,0.000011992917,0.0002555456,0.010757366],"genre_scores_gemma":[0.9387173,0.000036136717,0.06082832,0.00015402699,0.00006348981,0.00008432513,0.0000014855971,0.000015230265,0.00009969406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979965,0.000040887622,0.0009000124,0.00053964526,0.00022436831,0.00029859],"domain_scores_gemma":[0.99711066,0.00027906508,0.00079326326,0.00034610316,0.0014065403,0.000064376814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010184208,0.00023519999,0.00047630802,0.00012689251,0.00017981221,0.00022685627,0.0012570884,0.00008714037,0.00007732239],"category_scores_gemma":[0.00044798528,0.00017449149,0.00033186187,0.0005480597,0.0000591535,0.00055695826,0.00039957085,0.00020605621,0.000007841105],"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.000020909181,0.0001998956,0.000051670242,0.00017816492,0.00019992361,2.2638974e-7,0.00086508156,0.0000030583933,0.10885642,0.81469774,0.0004065463,0.07452035],"study_design_scores_gemma":[0.000024311948,0.00014005865,0.0000076082274,0.00015470623,0.00007758747,0.000010067902,0.0002231149,0.03849685,0.8289935,0.13098899,0.0007198253,0.00016338515],"about_ca_topic_score_codex":0.000037469512,"about_ca_topic_score_gemma":0.000024096307,"teacher_disagreement_score":0.9162318,"about_ca_system_score_codex":0.00004322075,"about_ca_system_score_gemma":0.00009479926,"threshold_uncertainty_score":0.71155566},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074801244,0.00007116903,0.91762626,0.0040823175,0.0008408411,0.00044760056,0.0000029638818,0.00009854466,0.0020290788],"genre_scores_gemma":[0.9279388,0.000013092458,0.071482375,0.00029545886,0.00015456542,0.000018171293,7.26197e-7,0.000018275447,0.000078518955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772877,0.00003792615,0.0005685839,0.0007272288,0.00047207807,0.00046543454],"domain_scores_gemma":[0.99801576,0.00044303597,0.00043235603,0.00029451228,0.00069610024,0.0001182402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091062224,0.00027117098,0.00036281845,0.00008465762,0.00036166463,0.00041473424,0.0013600155,0.0001327504,0.000023211724],"category_scores_gemma":[0.0008747,0.00022177884,0.00014938497,0.00053300103,0.00015745757,0.00023562934,0.00066156255,0.0005617409,0.0000028920754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005373647,0.0000896285,0.00007060615,0.000056692334,0.000028527518,0.0000028501029,0.0054705627,0.08088097,0.008814466,0.6179663,0.0000314012,0.28653428],"study_design_scores_gemma":[0.000057002253,0.00009345836,0.00037914276,0.00014120132,0.000021196634,0.000024831623,0.0017808037,0.94249195,0.030691426,0.02401382,0.000070727256,0.00023445449],"about_ca_topic_score_codex":0.00001505586,"about_ca_topic_score_gemma":0.000008361566,"teacher_disagreement_score":0.86161095,"about_ca_system_score_codex":0.000043805365,"about_ca_system_score_gemma":0.00010664436,"threshold_uncertainty_score":0.9043879},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23855321,0.00019050964,0.7117201,0.0075109326,0.0017494849,0.0018202879,0.000026286985,0.00020690083,0.03822231],"genre_scores_gemma":[0.97880024,0.00006819311,0.020360159,0.00015786644,0.000092061186,0.000053096963,9.1517995e-7,0.000009379489,0.00045811108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982654,0.000017795035,0.00045788733,0.0006045485,0.00030189686,0.00035250338],"domain_scores_gemma":[0.9979211,0.00030987483,0.00025209217,0.00032489395,0.001078968,0.00011308588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008074746,0.00021595057,0.00035491094,0.00005812631,0.0002746634,0.00032717176,0.0010689921,0.00010251444,0.000031423413],"category_scores_gemma":[0.0011934153,0.00015569467,0.00015161363,0.00042998843,0.00028180247,0.00036897563,0.00047127734,0.00019780522,0.000023442775],"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.000075812575,0.00015217188,0.00056807516,0.000110555186,0.000020851108,6.365488e-7,0.0021199957,0.0000070897895,0.014994445,0.8174117,0.00018857468,0.16435006],"study_design_scores_gemma":[0.00014271976,0.00018831513,0.0005413156,0.00013318195,0.00001793494,0.000011225486,0.00048539293,0.15817249,0.4696881,0.3700325,0.00034199638,0.0002448498],"about_ca_topic_score_codex":0.000019883078,"about_ca_topic_score_gemma":0.000024966015,"teacher_disagreement_score":0.740247,"about_ca_system_score_codex":0.00003682199,"about_ca_system_score_gemma":0.0001778472,"threshold_uncertainty_score":0.63490444},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70417064,0.0002277509,0.2379847,0.016079217,0.0011152112,0.0006260085,0.000012872271,0.00013003915,0.039653547],"genre_scores_gemma":[0.99604475,0.0000406641,0.0032620989,0.00033858043,0.00004344714,0.00001571702,2.4728405e-7,0.000008862143,0.00024562518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981619,0.000029787174,0.0004983538,0.00044939556,0.00059070543,0.0002698575],"domain_scores_gemma":[0.99822176,0.00021167735,0.0003249493,0.00055995263,0.00062653614,0.00005514087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051470846,0.00017868963,0.00023605367,0.000063552456,0.00012917297,0.00013714192,0.0020227968,0.0000677048,0.00007445806],"category_scores_gemma":[0.0006189284,0.00011311191,0.00014023557,0.0004974843,0.00015601599,0.00023364036,0.0005009451,0.00031232164,0.000033694785],"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.000016541446,0.00010260046,0.000009180014,0.000025487388,0.00000992739,6.00273e-7,0.0022862912,0.0005605461,0.021547759,0.924757,0.00010456293,0.050579526],"study_design_scores_gemma":[0.000011835534,0.00006511924,0.000009637326,0.00020390107,0.000005225384,0.000002155483,0.0006382797,0.21593285,0.466358,0.31666666,0.000015077535,0.00009126271],"about_ca_topic_score_codex":0.00002798689,"about_ca_topic_score_gemma":0.000009656372,"teacher_disagreement_score":0.60809034,"about_ca_system_score_codex":0.000032743992,"about_ca_system_score_gemma":0.00014439569,"threshold_uncertainty_score":0.46125698},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95649624,0.000035615536,0.018426541,0.0030588114,0.0006799619,0.00036695137,0.000077578086,0.00004890831,0.020809393],"genre_scores_gemma":[0.9972218,0.000040889325,0.000825391,0.00006657062,0.000032961783,0.000023452738,0.000002332601,0.000006769156,0.0017797993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99698126,0.000064637075,0.0012727802,0.0006018341,0.0008507266,0.00022873373],"domain_scores_gemma":[0.995463,0.0004794421,0.000796367,0.00048272312,0.0027022476,0.00007621455],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017358153,0.0001607589,0.00047149824,0.00057181827,0.00018331608,0.000112533475,0.0011398207,0.00009672936,0.002186403],"category_scores_gemma":[0.00451543,0.00011981151,0.00028352524,0.0076349904,0.00046615803,0.00026546826,0.00021536477,0.00025492438,0.00017666236],"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.00008628195,0.00034383382,0.006983592,0.000012159387,0.00014109472,8.438621e-7,0.001494817,0.0025615548,0.110006854,0.8440984,0.00022370188,0.034046907],"study_design_scores_gemma":[0.000028878594,0.000052175717,0.0046229055,0.00009465596,0.00013447867,0.000003205631,0.005477208,0.11590979,0.63866895,0.23446894,0.00034346376,0.00019535095],"about_ca_topic_score_codex":0.00007540927,"about_ca_topic_score_gemma":0.000084178464,"teacher_disagreement_score":0.60962945,"about_ca_system_score_codex":0.000038855324,"about_ca_system_score_gemma":0.00013080843,"threshold_uncertainty_score":0.9987257},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20963939,0.00045746643,0.7688997,0.017276473,0.0012150637,0.0006519268,0.000016595699,0.00025835098,0.0015850291],"genre_scores_gemma":[0.98584056,0.000069032314,0.012889733,0.00083533645,0.0001749539,0.000040541996,0.0000060716357,0.000020167055,0.00012360043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969751,0.0000664304,0.00071170065,0.00090830016,0.0007022741,0.00063617865],"domain_scores_gemma":[0.99670744,0.00041777935,0.0005220295,0.00044471177,0.001758145,0.00014987565],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065515464,0.00037461676,0.00038960075,0.00012324091,0.000707953,0.0006219423,0.0012947635,0.00022474295,0.00003889968],"category_scores_gemma":[0.00094216526,0.00032973243,0.00016595202,0.0013363635,0.00048320877,0.0009986233,0.00052273896,0.000651224,0.00002117827],"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.000068618436,0.00014739524,0.0011531389,0.00004759352,0.000024031828,0.000004770991,0.001099685,0.016853468,0.017270807,0.93466574,0.00013767023,0.028527074],"study_design_scores_gemma":[0.00003783215,0.00010447489,0.000277967,0.00026913034,0.000016400754,0.000022719763,0.0006555146,0.6088154,0.335962,0.053360213,0.00018626977,0.00029209006],"about_ca_topic_score_codex":0.000054728396,"about_ca_topic_score_gemma":0.00003373188,"teacher_disagreement_score":0.8813055,"about_ca_system_score_codex":0.000119527096,"about_ca_system_score_gemma":0.0002739488,"threshold_uncertainty_score":0.9999155},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18387698,0.000034617096,0.80889714,0.0017355017,0.00065007,0.0005232054,0.000004276403,0.00015298252,0.004125229],"genre_scores_gemma":[0.91663355,0.0000312621,0.082759425,0.00027265167,0.000093369985,0.000019079604,0.0000013149308,0.000014462749,0.00017488304],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99761575,0.00003197614,0.0006156334,0.0006850544,0.0006527063,0.00039887408],"domain_scores_gemma":[0.9974863,0.000055798348,0.00045637385,0.0004926689,0.0014367858,0.000072064846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026348187,0.0002563116,0.00028613294,0.000111105066,0.0002202702,0.00045814062,0.001508651,0.00009008128,0.00023545037],"category_scores_gemma":[0.0004595182,0.00021138792,0.00012126332,0.0008355455,0.00021764416,0.0008643211,0.0005407383,0.00029065766,0.000030696545],"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.000019203006,0.0001005834,0.000056310022,0.000034579647,0.000014366134,0.0000024024475,0.00062182517,0.000029790388,0.8214142,0.14503632,0.000076683384,0.032593764],"study_design_scores_gemma":[0.000024850619,0.00005522643,0.000073169016,0.00017572982,0.0000123234395,0.000009150109,0.00030013695,0.101639636,0.8363397,0.06116218,0.000017614064,0.00019024427],"about_ca_topic_score_codex":0.000025043542,"about_ca_topic_score_gemma":0.0000103652255,"teacher_disagreement_score":0.73275656,"about_ca_system_score_codex":0.00010148229,"about_ca_system_score_gemma":0.00014006882,"threshold_uncertainty_score":0.86201495},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49264446,0.0002226256,0.3666535,0.016012175,0.00217433,0.00441309,0.000043373308,0.0012977528,0.11653867],"genre_scores_gemma":[0.97691333,0.00007347654,0.021359535,0.0001335715,0.00012522808,0.00016743313,0.0000018757762,0.000029247854,0.0011962767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99673396,0.000040753814,0.0010055905,0.0008621622,0.00067594036,0.0006816139],"domain_scores_gemma":[0.9962788,0.00034200473,0.00057326385,0.0006375901,0.002022233,0.00014610852],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000680002,0.00038561044,0.0004899302,0.00013656248,0.00031749668,0.0011500429,0.0027055794,0.00016704494,0.0001515115],"category_scores_gemma":[0.0007179759,0.000305893,0.00029913947,0.0010417264,0.0005024665,0.0009916045,0.00046318362,0.0002972643,0.00018559383],"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.000033831242,0.00018987212,0.000024462128,0.00008339365,0.000026660537,0.0000014385423,0.0013855553,0.00018406591,0.089127816,0.80783784,0.00027037054,0.10083468],"study_design_scores_gemma":[0.000014673172,0.00021562801,0.000024570676,0.00015833716,0.000015611284,0.000007675954,0.0024409445,0.06302207,0.4751258,0.45860365,0.0001348069,0.00023623918],"about_ca_topic_score_codex":0.000046525627,"about_ca_topic_score_gemma":0.000029382054,"teacher_disagreement_score":0.48426887,"about_ca_system_score_codex":0.00006647228,"about_ca_system_score_gemma":0.00066915987,"threshold_uncertainty_score":0.9999393},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56827736,0.00009105004,0.3762353,0.009979032,0.0017707297,0.00039091764,0.0000048032516,0.00026254676,0.042988244],"genre_scores_gemma":[0.9787753,0.000019146324,0.02043881,0.00039067198,0.000086047934,0.000009217806,2.9579311e-7,0.00000957627,0.00027091167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980091,0.000022826658,0.0005253415,0.00060130836,0.00045293226,0.00038850133],"domain_scores_gemma":[0.99844533,0.00010874583,0.00024881557,0.00037882128,0.0007240042,0.00009428006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004387881,0.000189921,0.00026536218,0.000096496144,0.0001759508,0.00020809082,0.0017067959,0.000094727846,0.000070455084],"category_scores_gemma":[0.0007491615,0.00015712736,0.00013467655,0.00061265705,0.00017395077,0.0003165197,0.00044968913,0.00033152505,0.000041263294],"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.0000088457355,0.000059944156,0.000098155506,0.000017302458,0.000012403856,0.000002783275,0.0047529014,0.0003014136,0.04540423,0.7605159,0.000021733531,0.18880433],"study_design_scores_gemma":[0.000026277463,0.000054104596,0.000059401762,0.00012363054,0.000008045209,0.000017673583,0.0024760768,0.2505508,0.59044933,0.15591335,0.0001261502,0.00019511822],"about_ca_topic_score_codex":0.00002738474,"about_ca_topic_score_gemma":0.000024595927,"teacher_disagreement_score":0.6046026,"about_ca_system_score_codex":0.000037200985,"about_ca_system_score_gemma":0.0002898224,"threshold_uncertainty_score":0.6407468},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34267715,0.000118568045,0.65028226,0.0017752607,0.00058283116,0.0004441869,0.0000017117835,0.00005221098,0.0040657907],"genre_scores_gemma":[0.9932143,0.000072942734,0.006441728,0.00007504772,0.00004527537,0.000049343256,1.3632001e-7,0.000009152495,0.000092076225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985238,0.000015617261,0.00047466104,0.0004963211,0.00019643745,0.00029318107],"domain_scores_gemma":[0.99896556,0.00017177363,0.00014553603,0.00017132642,0.0004872889,0.000058498492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005045063,0.00016280341,0.00022127379,0.000131655,0.00014595319,0.00018559057,0.0005856947,0.00008216607,0.000011347701],"category_scores_gemma":[0.0004064645,0.00013636096,0.000083655985,0.00044614516,0.00007549227,0.00042590196,0.00012789539,0.0002444478,0.0000054384077],"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.00003420704,0.00009748689,0.000112304566,0.0001280077,0.000010031826,5.152621e-7,0.0038933607,0.00012939541,0.30064246,0.47133857,0.0000021003084,0.22361158],"study_design_scores_gemma":[0.000031510823,0.00005710853,0.00006224894,0.00024561826,0.000006780107,0.0000072014236,0.0010008807,0.3495351,0.60124415,0.047652554,0.000038797145,0.0001180104],"about_ca_topic_score_codex":0.000028510289,"about_ca_topic_score_gemma":0.00011586285,"teacher_disagreement_score":0.65053713,"about_ca_system_score_codex":0.00006747433,"about_ca_system_score_gemma":0.00009770325,"threshold_uncertainty_score":0.5560639},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10536665,0.00006145634,0.8494557,0.0013262271,0.001280114,0.00052117516,6.008367e-7,0.00023787768,0.041750215],"genre_scores_gemma":[0.99030316,0.00007767408,0.007880482,0.00018566275,0.00007822754,0.0000110824385,8.4209967e-7,0.000023228291,0.0014396287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99644375,0.000028589438,0.0009917694,0.0006930002,0.0012228182,0.00062009157],"domain_scores_gemma":[0.99722934,0.00012678244,0.0008073674,0.0004971907,0.0012017406,0.00013756315],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00074304285,0.00034158633,0.00036606344,0.00016042356,0.0005145564,0.00072554545,0.0023429208,0.00013522673,0.00021444829],"category_scores_gemma":[0.0007625604,0.00029577606,0.00020985836,0.00082428,0.00017934912,0.0007608246,0.001268049,0.000777412,0.00013240999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018312294,0.0001022205,0.0009582368,0.000085213185,0.00004984361,0.000006326128,0.002353576,0.36555412,0.10511229,0.5135895,0.0000470513,0.012123292],"study_design_scores_gemma":[0.000045514007,0.00014610114,0.00033518646,0.00047463624,0.000024288272,0.000017092872,0.0009487725,0.56889176,0.41472834,0.013875921,0.00014777391,0.00036459867],"about_ca_topic_score_codex":0.00004215307,"about_ca_topic_score_gemma":0.000003149584,"teacher_disagreement_score":0.8849365,"about_ca_system_score_codex":0.00016768188,"about_ca_system_score_gemma":0.00030983603,"threshold_uncertainty_score":0.99994946},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033302265,0.00001536462,0.9891918,0.00389961,0.00010824633,0.00032264373,0.0000052401956,0.00007511109,0.0030517625],"genre_scores_gemma":[0.73211324,0.000019358098,0.26742914,0.00023604528,0.000046124904,0.000057559213,0.000002930419,0.000009513364,0.00008607742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986232,0.0000122205865,0.0003909744,0.0004526983,0.0002904881,0.00023041734],"domain_scores_gemma":[0.9977658,0.00027821364,0.0002991345,0.00022927283,0.0013562384,0.00007137488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022194975,0.00015645806,0.00018425912,0.000061755185,0.00028368397,0.00030085558,0.00086225674,0.000075267366,0.000021191818],"category_scores_gemma":[0.00036402623,0.00014151,0.00013365364,0.0006940455,0.000120280085,0.00024244693,0.00023023401,0.0002462126,0.000013828445],"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.000010770758,0.00006762285,0.000009731677,0.000015916157,0.000008266719,6.6890486e-8,0.0004896672,0.21761854,0.0030427128,0.75125945,0.000008720557,0.027468538],"study_design_scores_gemma":[0.000013848548,0.0000239587,0.0000075625235,0.000039302897,0.0000058027545,0.0000011779433,0.000092637696,0.5267027,0.03512441,0.4378857,0.000020217696,0.00008267825],"about_ca_topic_score_codex":0.0000023024595,"about_ca_topic_score_gemma":0.0000012801463,"teacher_disagreement_score":0.728783,"about_ca_system_score_codex":0.000028219876,"about_ca_system_score_gemma":0.00017006471,"threshold_uncertainty_score":0.57706106},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.091606244,0.00004368549,0.8926318,0.0035686225,0.0010841232,0.0012226625,0.000002703561,0.0003269036,0.009513237],"genre_scores_gemma":[0.99204814,0.000009932454,0.006508832,0.00015527305,0.00004874566,0.00017328125,0.0000011100364,0.000018223214,0.0010364663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977809,0.000039514318,0.00056905934,0.00048152698,0.0007126877,0.00041629848],"domain_scores_gemma":[0.9983725,0.0002468976,0.0005734891,0.00027179322,0.00046566586,0.00006968242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007094426,0.00021363918,0.00025656927,0.00016628974,0.00079804484,0.00028437338,0.0026881082,0.000047430007,0.00014723788],"category_scores_gemma":[0.0006209271,0.00018273028,0.00015412315,0.00078358257,0.00014701733,0.00035745243,0.0007129615,0.00045341795,0.000025233001],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072801246,0.000105438296,0.00022069649,0.000053722302,0.000027258375,4.1280157e-7,0.0077080564,0.16648324,0.014964776,0.77292114,0.00011804516,0.037324395],"study_design_scores_gemma":[0.000047813675,0.00077281223,0.00005795711,0.00004996344,0.000014969077,0.000005343334,0.0039449753,0.85548747,0.11093242,0.027844137,0.0005891024,0.0002530302],"about_ca_topic_score_codex":0.000011272876,"about_ca_topic_score_gemma":0.0000017597255,"teacher_disagreement_score":0.9004419,"about_ca_system_score_codex":0.00009219248,"about_ca_system_score_gemma":0.00009647871,"threshold_uncertainty_score":0.7451524},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09118279,0.00006706037,0.87436676,0.016139504,0.0017987489,0.0029355981,0.000039013343,0.00033555212,0.013134948],"genre_scores_gemma":[0.99763805,0.000009114529,0.0011941885,0.00028750158,0.000065528235,0.0007256949,9.927369e-7,0.00001004278,0.00006889565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980137,0.000015555424,0.000509928,0.00041180805,0.0007392053,0.00030984456],"domain_scores_gemma":[0.9989833,0.00013802297,0.00028767737,0.0002390803,0.0002742512,0.00007766683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008425867,0.0001446105,0.00017475382,0.00017927906,0.00035884202,0.00009833176,0.002395978,0.00004332085,0.000104361796],"category_scores_gemma":[0.00021488732,0.00012436173,0.0000923739,0.0008257541,0.0001825759,0.00036510592,0.0006826195,0.00038667963,0.0000065038867],"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.00004618282,0.0001156987,0.0012412795,0.000029544646,0.000006179307,2.1782103e-7,0.0012232065,0.00023849275,0.0019535476,0.87881273,0.00021707383,0.11611582],"study_design_scores_gemma":[0.000099209916,0.0002499757,0.00064136414,0.0000857117,0.000009951834,0.00001596478,0.0027980208,0.62349486,0.13854991,0.22951609,0.004214745,0.00032419796],"about_ca_topic_score_codex":0.000046084093,"about_ca_topic_score_gemma":0.000015382599,"teacher_disagreement_score":0.9064553,"about_ca_system_score_codex":0.00016034268,"about_ca_system_score_gemma":0.00024356927,"threshold_uncertainty_score":0.5071324},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45031416,0.00004384155,0.54151756,0.004106794,0.0008557382,0.0018398421,0.000026704405,0.00015209979,0.0011432705],"genre_scores_gemma":[0.97974336,0.000043615426,0.018938195,0.00016876931,0.00020385506,0.0007198716,0.000020124724,0.000038121143,0.00012406355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964491,0.000088679946,0.0011584952,0.0011594446,0.0006785804,0.00046568114],"domain_scores_gemma":[0.99721014,0.0002487608,0.0010261785,0.0005945244,0.0008280515,0.00009235722],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016695197,0.0004193254,0.0005003658,0.00040894473,0.0005331907,0.00057680113,0.0026703544,0.0002466482,0.000059064074],"category_scores_gemma":[0.00065794523,0.0003982006,0.00020502294,0.000909564,0.00014067894,0.00036551338,0.0018145221,0.0012894529,0.000014623029],"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.000059505957,0.0002329849,0.00014526126,0.00012831097,0.000020612713,3.653725e-7,0.0030228256,0.068417385,0.07438916,0.8321348,0.00010138886,0.021347387],"study_design_scores_gemma":[0.000034567656,0.00009353005,0.00012167867,0.0001527661,0.000013331649,0.0000021722158,0.0002717386,0.77356905,0.073463045,0.15193301,0.000028582726,0.00031650977],"about_ca_topic_score_codex":0.0009507194,"about_ca_topic_score_gemma":0.00029238287,"teacher_disagreement_score":0.7051517,"about_ca_system_score_codex":0.00037887236,"about_ca_system_score_gemma":0.00036672415,"threshold_uncertainty_score":0.999847},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48658273,0.00022819043,0.37261853,0.11804677,0.0008134125,0.003913747,0.00008513049,0.00040376722,0.017307743],"genre_scores_gemma":[0.99777055,0.000032257063,0.0012048441,0.0005056754,0.000047763373,0.00035463486,8.724839e-7,0.000015251026,0.00006815416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810207,0.000042832602,0.000387737,0.0005915884,0.00052925054,0.00034649836],"domain_scores_gemma":[0.9987762,0.0002456782,0.00025294645,0.00036627508,0.00030517287,0.00005373667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036743935,0.00021040622,0.00021362217,0.000115563285,0.0007176123,0.00012372115,0.0022271958,0.0000417626,0.000073755175],"category_scores_gemma":[0.00006566154,0.00014004503,0.00008549949,0.0016067768,0.00031255418,0.00035825488,0.00019774812,0.0007665737,0.000010300622],"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.00009657871,0.00013252029,0.00007500543,0.0000037142856,0.000015470425,8.384702e-7,0.016394274,0.0045012706,0.005810731,0.9685891,0.000033965334,0.0043465192],"study_design_scores_gemma":[0.00006547766,0.000267892,0.0003184964,0.00007187133,0.000016561555,0.000013481897,0.0072395485,0.06994282,0.07082673,0.8507678,0.00021126078,0.0002580562],"about_ca_topic_score_codex":0.00037540033,"about_ca_topic_score_gemma":0.00041364468,"teacher_disagreement_score":0.51118785,"about_ca_system_score_codex":0.00014520579,"about_ca_system_score_gemma":0.00010756332,"threshold_uncertainty_score":0.57108706},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048543938,0.000036587444,0.934604,0.007984645,0.0007513259,0.0003781585,0.00011928764,0.00014834123,0.0074337265],"genre_scores_gemma":[0.99349654,0.000010582787,0.0058484618,0.00032101013,0.00010511914,0.00007949445,0.0000088829565,0.000009115231,0.00012082341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975144,0.000023719635,0.0005857175,0.00055105967,0.0008236022,0.00050147256],"domain_scores_gemma":[0.9983667,0.00007550808,0.0003623616,0.00039472713,0.00068249716,0.000118201955],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0005809473,0.00022807988,0.00024221289,0.00009599188,0.0013315919,0.00023938753,0.0032118235,0.000061225735,0.0003429269],"category_scores_gemma":[0.00021529467,0.00019633253,0.00016401053,0.00093879865,0.00023374861,0.00052684004,0.0016635592,0.0005378674,0.000037765363],"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.000026599533,0.00012906844,0.00022690278,0.000014046167,0.000014331326,7.0283517e-7,0.00025287343,0.0043839216,0.0007120504,0.9901875,0.0007371996,0.0033147868],"study_design_scores_gemma":[0.00002315105,0.000077193494,0.00018367023,0.000027353466,0.0000073956344,0.000019217596,0.00012142771,0.39550716,0.0055784388,0.59817314,0.00012390355,0.00015795254],"about_ca_topic_score_codex":0.000045826873,"about_ca_topic_score_gemma":0.000016496462,"teacher_disagreement_score":0.94495255,"about_ca_system_score_codex":0.00014857626,"about_ca_system_score_gemma":0.00034354604,"threshold_uncertainty_score":0.9999685},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6217225,0.0000082382285,0.37371677,0.002648577,0.00023042609,0.00049913075,0.000023920264,0.00006188813,0.0010885539],"genre_scores_gemma":[0.9830235,0.0000028578947,0.016087985,0.0006427432,0.000050314775,0.00008991681,0.0000028318568,0.000007484376,0.00009233734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861866,0.000013185069,0.00039988387,0.0003227106,0.00042815288,0.0002173998],"domain_scores_gemma":[0.99916655,0.0000812473,0.00032166316,0.00021096354,0.00017353849,0.00004606169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036411276,0.00015056967,0.00015313203,0.00011734925,0.00031999304,0.00030728724,0.0007953014,0.00004654154,0.000024475537],"category_scores_gemma":[0.0001529079,0.00012851463,0.000060418708,0.00017690165,0.00004792508,0.0009946633,0.00033981598,0.00023469506,0.000006467182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030694343,0.00014878712,0.0001193418,0.0000587096,0.00002657878,2.7082834e-7,0.02966188,0.014304464,0.080686435,0.48030096,0.00016890497,0.39421672],"study_design_scores_gemma":[0.000056451456,0.000121010475,0.000059097132,0.000057816127,0.000008456453,0.0000013833956,0.0009679131,0.8311893,0.07712787,0.09019998,0.00007687294,0.00013386847],"about_ca_topic_score_codex":0.0001297252,"about_ca_topic_score_gemma":0.000006730746,"teacher_disagreement_score":0.8168848,"about_ca_system_score_codex":0.00007329592,"about_ca_system_score_gemma":0.000050536633,"threshold_uncertainty_score":0.5240674},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7530004,0.000037829217,0.23472403,0.0024311282,0.0008291229,0.001910576,0.000051621628,0.00016319242,0.006852151],"genre_scores_gemma":[0.9952148,0.0000156401,0.0034968026,0.0003114974,0.00003047607,0.00059301447,0.0000022771476,0.000013882608,0.00032157803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975761,0.000035267738,0.0004898337,0.0007113008,0.0006843089,0.0005031623],"domain_scores_gemma":[0.99829495,0.00016819326,0.00037934014,0.00021821586,0.0008396939,0.00009961572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008231104,0.00023530693,0.0002687193,0.00022435584,0.000851144,0.00030843943,0.0022970084,0.000044763925,0.00007247776],"category_scores_gemma":[0.00016851583,0.00020152087,0.0001955061,0.000939702,0.0002721594,0.0006689275,0.00093286927,0.0003458344,0.000010238038],"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.000049884147,0.00019006916,0.00003876554,0.00001680469,0.000012494558,8.626219e-7,0.0015287771,0.00039711304,0.040967062,0.9015975,0.000018418521,0.055182256],"study_design_scores_gemma":[0.0000625891,0.00030868748,0.000048832648,0.000074479714,0.00002271806,0.000007915615,0.0026791843,0.49514073,0.045602545,0.45578787,0.000018395496,0.00024606043],"about_ca_topic_score_codex":0.000025662674,"about_ca_topic_score_gemma":0.0000124261705,"teacher_disagreement_score":0.49474362,"about_ca_system_score_codex":0.00009428592,"about_ca_system_score_gemma":0.00023918897,"threshold_uncertainty_score":0.82177824},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5412674,0.0005674646,0.394179,0.04342689,0.00417735,0.0038908492,0.00005584952,0.00068501494,0.0117502],"genre_scores_gemma":[0.9734841,0.000028352028,0.02522638,0.0006650661,0.00019983691,0.00021006224,0.0000054776756,0.00001513357,0.0001655754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99755573,0.00006243123,0.0005675325,0.0006840409,0.0006992656,0.00043100334],"domain_scores_gemma":[0.9985146,0.000098078424,0.0005119484,0.00042369452,0.00038222555,0.000069486625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003293275,0.0002340927,0.00025032068,0.000057368794,0.0010407926,0.000121025645,0.00218572,0.00003679386,0.0001589763],"category_scores_gemma":[0.000054637203,0.00019519954,0.0001277935,0.0010594544,0.00023876116,0.0005342943,0.0011642469,0.00047695538,0.000034207886],"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.00008464917,0.00016240902,0.00010974244,0.000007898884,0.000010206193,3.9535192e-7,0.00034271355,0.050103668,0.041626316,0.8890861,0.0016991468,0.016766708],"study_design_scores_gemma":[0.000059939663,0.0001741127,0.00031119835,0.000047982638,0.000012961043,0.000027112894,0.00008905866,0.4708155,0.12198306,0.40374488,0.0024254413,0.00030876038],"about_ca_topic_score_codex":0.000017208233,"about_ca_topic_score_gemma":0.0000025045713,"teacher_disagreement_score":0.48534128,"about_ca_system_score_codex":0.00011446685,"about_ca_system_score_gemma":0.00007338085,"threshold_uncertainty_score":0.800504},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036767926,0.00012453689,0.95071894,0.002071342,0.0020408602,0.0010361413,0.000012185522,0.00010968493,0.0071184],"genre_scores_gemma":[0.9982823,0.000010374515,0.0010567635,0.00017024146,0.00012277279,0.00009719958,0.0000023147434,0.00001934274,0.00023868571],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99645406,0.00011654593,0.000959358,0.0006342812,0.0012277276,0.0006080463],"domain_scores_gemma":[0.9979515,0.00029323183,0.0008535601,0.00038246054,0.000384312,0.00013491808],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015754332,0.0002960935,0.00041466035,0.000227413,0.0004277779,0.00016920887,0.0024339615,0.00007985016,0.00023694689],"category_scores_gemma":[0.00035693616,0.00025326412,0.00011886948,0.0020768046,0.00025687576,0.00022188827,0.0011254571,0.00075968326,0.000012921883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009621997,0.00016922923,0.00012291515,0.000013928802,0.000015545294,0.0000013636172,0.0019877767,0.62183887,0.0016433854,0.3637965,0.00019510566,0.010119165],"study_design_scores_gemma":[0.00010050229,0.00043681686,0.0004003741,0.00022229156,0.000015401703,0.0000044038848,0.0017270378,0.9719863,0.0053864545,0.019158358,0.0002623988,0.00029965196],"about_ca_topic_score_codex":0.000034617817,"about_ca_topic_score_gemma":0.0000059862446,"teacher_disagreement_score":0.96151435,"about_ca_system_score_codex":0.00019375206,"about_ca_system_score_gemma":0.00019622191,"threshold_uncertainty_score":0.99999195},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48759338,0.000027236545,0.45933107,0.02711152,0.0021348393,0.0024184138,0.00001752856,0.0004923896,0.020873614],"genre_scores_gemma":[0.9838458,0.00000871343,0.015205653,0.00039688585,0.00004244064,0.00011804376,4.078684e-7,0.000013974384,0.00036813697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977077,0.000042108233,0.0004809014,0.0005644849,0.00079844805,0.00040632958],"domain_scores_gemma":[0.9987491,0.000098935336,0.00021287275,0.00033082126,0.00046530992,0.00014299387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006684843,0.00020817766,0.00022482104,0.00026907815,0.000500078,0.00034809066,0.0019872996,0.00006318445,0.00031319767],"category_scores_gemma":[0.00033435592,0.0001788637,0.00013236272,0.0016814603,0.00014360582,0.000383775,0.0009691384,0.00061641965,0.00006949464],"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.00005960504,0.00013313621,0.001078349,0.000016445389,0.000015477019,9.130183e-7,0.006387986,0.0040464755,0.002881096,0.6892931,0.00012563568,0.29596183],"study_design_scores_gemma":[0.00011427864,0.0016499171,0.0017268918,0.00064046663,0.000034459896,0.0000449317,0.01709748,0.71260345,0.15576299,0.107138574,0.0019754386,0.0012111228],"about_ca_topic_score_codex":0.00007117637,"about_ca_topic_score_gemma":0.000020629735,"teacher_disagreement_score":0.70855695,"about_ca_system_score_codex":0.00015107912,"about_ca_system_score_gemma":0.00015323688,"threshold_uncertainty_score":0.729385},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58246213,0.0011465234,0.39818874,0.010314328,0.0007001368,0.0020764726,0.000030535542,0.0008766889,0.004204463],"genre_scores_gemma":[0.9718595,0.000022308077,0.02786349,0.000114851835,0.000026755206,0.00006196936,0.0000011204146,0.000010865769,0.000039112652],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984608,0.000017670107,0.00029632903,0.00044159754,0.0005741649,0.00020941928],"domain_scores_gemma":[0.999101,0.000046869714,0.00025823954,0.00020590064,0.00033279308,0.00005521265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003661396,0.00017303464,0.0001694296,0.00014248544,0.0004126839,0.00018846444,0.0011327427,0.00005218099,0.000029246963],"category_scores_gemma":[0.00005497689,0.000120584205,0.00004319539,0.0005232533,0.00015759622,0.00058032793,0.00037156118,0.00037213278,0.000002374991],"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.00023500131,0.00017742936,0.0008208593,0.00008595698,0.000018693305,0.000002655172,0.008588866,0.000118177486,0.13171093,0.36116844,0.000060794635,0.4970122],"study_design_scores_gemma":[0.00006006225,0.000728039,0.0002227308,0.00019971773,0.000018067441,0.00003249047,0.0008077551,0.23489958,0.61609924,0.14659908,0.00009281414,0.00024045257],"about_ca_topic_score_codex":0.000030681327,"about_ca_topic_score_gemma":0.000006820943,"teacher_disagreement_score":0.49677175,"about_ca_system_score_codex":0.000049674418,"about_ca_system_score_gemma":0.00006200511,"threshold_uncertainty_score":0.49172813},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01222112,0.0000100127845,0.98408306,0.002412431,0.00031398374,0.0004800324,0.000022921782,0.00009689498,0.00035955897],"genre_scores_gemma":[0.91470456,0.000020254898,0.08498559,0.000095110474,0.000018742381,0.000074816286,0.000010328859,0.000013040699,0.000077534096],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998327,0.000046236422,0.00067079667,0.00046332052,0.00025030188,0.00024235214],"domain_scores_gemma":[0.9976406,0.00015529779,0.0005960021,0.00021320356,0.0013401174,0.00005479334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060599565,0.00019704903,0.00031212386,0.00014412629,0.00020617631,0.00012925403,0.000761285,0.000121090954,0.000017219385],"category_scores_gemma":[0.00032975612,0.000163293,0.00019454355,0.00056868925,0.000090270056,0.0003407633,0.00010584844,0.00023952691,0.0000026539237],"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.00007784195,0.00061492674,0.00012877437,0.00030802915,0.000033870754,2.4766763e-7,0.002114389,0.00047072404,0.30654898,0.24487163,0.000056832512,0.44477373],"study_design_scores_gemma":[0.00006052527,0.00010970113,0.000055549277,0.00026793982,0.00000721401,8.747371e-7,0.00048716733,0.44628698,0.5443725,0.008217702,0.000021064401,0.00011279882],"about_ca_topic_score_codex":0.000044328088,"about_ca_topic_score_gemma":0.000053564705,"teacher_disagreement_score":0.90248346,"about_ca_system_score_codex":0.000060410108,"about_ca_system_score_gemma":0.00013427337,"threshold_uncertainty_score":0.66588956},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21862437,0.000022922264,0.77247506,0.0032493882,0.00042856677,0.00034180642,0.0000015590374,0.00014701605,0.0047092754],"genre_scores_gemma":[0.9868441,0.0000040757577,0.012116883,0.00038267073,0.000058975267,0.000053254058,2.544261e-7,0.0000135863775,0.00052618433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979625,0.00003216676,0.00043523035,0.00053384306,0.0006737466,0.0003625521],"domain_scores_gemma":[0.99905455,0.00006472765,0.00022629058,0.00031847483,0.00024036299,0.000095595125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075292826,0.00017576519,0.00021010605,0.0001666933,0.00048419822,0.00016692054,0.0025156862,0.000036138183,0.00012063035],"category_scores_gemma":[0.00014503246,0.00015349856,0.00010285197,0.00076702016,0.00005186329,0.0002443486,0.0012176393,0.0005413743,0.00006456472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047903806,0.00009112098,0.00006010968,0.000021239355,0.0000112395755,0.0000014937178,0.014638208,0.2795329,0.04841625,0.54603857,0.000051871084,0.11108909],"study_design_scores_gemma":[0.000016010617,0.00013435895,0.0000044483927,0.000035823938,0.0000043864516,0.000005610785,0.0018109952,0.8469016,0.11192735,0.038755123,0.00023043118,0.00017386593],"about_ca_topic_score_codex":0.00010709007,"about_ca_topic_score_gemma":0.0000030242666,"teacher_disagreement_score":0.76821977,"about_ca_system_score_codex":0.00007892781,"about_ca_system_score_gemma":0.000065402135,"threshold_uncertainty_score":0.62594897},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067641363,0.00003949907,0.98037523,0.003416066,0.0010071556,0.0009251507,0.000009824655,0.00016307914,0.00729984],"genre_scores_gemma":[0.9184501,0.00007271467,0.08045983,0.00019455542,0.0001252951,0.00033921612,0.0000033843367,0.00001687417,0.00033801823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99812317,0.000035835143,0.00065859046,0.0005675239,0.00021015402,0.00040472142],"domain_scores_gemma":[0.9983148,0.0001176576,0.0002751203,0.00026937405,0.0009308614,0.00009221548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006097116,0.00023035215,0.00032335208,0.00008963473,0.00028348333,0.00025632922,0.0011390111,0.00013226739,0.000039445426],"category_scores_gemma":[0.00014157263,0.00017994925,0.00023879507,0.00071129977,0.00011470651,0.0003887569,0.00015108555,0.00028446494,0.000015451547],"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.000025776719,0.00030257922,0.0000794963,0.00005000195,0.000016202033,1.7137363e-7,0.0007736263,0.0000037500827,0.024325192,0.61222535,0.0006372782,0.36156058],"study_design_scores_gemma":[0.00007006314,0.00020305408,0.0001947337,0.00023460374,0.000019732512,0.000006543678,0.00020233452,0.028475508,0.8489402,0.11973597,0.0016406357,0.00027661698],"about_ca_topic_score_codex":0.000013003777,"about_ca_topic_score_gemma":0.000044848057,"teacher_disagreement_score":0.911686,"about_ca_system_score_codex":0.00004230537,"about_ca_system_score_gemma":0.00013070519,"threshold_uncertainty_score":0.73381174},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95850223,0.00015011847,0.021528449,0.010980661,0.00057012873,0.0012937392,0.00009169479,0.000042695992,0.0068402984],"genre_scores_gemma":[0.990052,0.00004814765,0.009317246,0.00011475511,0.00003034001,0.0000580424,3.4364e-7,0.000012903365,0.00036623573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954155,0.0002173798,0.0012861834,0.0007427468,0.0018710493,0.000467112],"domain_scores_gemma":[0.99631035,0.0012552005,0.00087352813,0.000417695,0.0010116596,0.00013157513],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0071444763,0.00021452169,0.00050910073,0.0006441697,0.00029104546,0.000110112174,0.0022704478,0.000059300568,0.0005070998],"category_scores_gemma":[0.009762134,0.00015939616,0.00012743194,0.0029357912,0.00094434124,0.00031219653,0.0014856735,0.0006047828,0.000011753648],"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.0005668318,0.00048016885,0.005402951,0.00007285725,0.000021380829,0.0000022133331,0.00780279,0.0025023913,0.124172054,0.49268085,0.0002527278,0.3660428],"study_design_scores_gemma":[0.00005902191,0.00039473115,0.0036302244,0.0000652124,0.000006500173,0.00000796612,0.010563852,0.056922205,0.37199664,0.555453,0.0006692909,0.00023134885],"about_ca_topic_score_codex":0.00033196362,"about_ca_topic_score_gemma":0.000018234947,"teacher_disagreement_score":0.36581144,"about_ca_system_score_codex":0.00014823796,"about_ca_system_score_gemma":0.00028888453,"threshold_uncertainty_score":0.9985791},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44748634,0.00034101564,0.46986946,0.06507396,0.0027202398,0.005374014,0.00017070277,0.0010391078,0.007925169],"genre_scores_gemma":[0.9359608,0.000030508254,0.06365327,0.000058048812,0.000019349403,0.00022410908,5.813121e-7,0.000012064806,0.000041232615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981281,0.000031209507,0.0004886504,0.0004737017,0.00052206276,0.00035623356],"domain_scores_gemma":[0.9971693,0.00038882572,0.0005908203,0.0013172808,0.0004984726,0.000035306584],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0009199476,0.00017869676,0.00022276447,0.00011742782,0.0006338253,0.0001449012,0.018889377,0.00006176812,0.000015127785],"category_scores_gemma":[0.0061645913,0.00012580425,0.0001272509,0.00086971547,0.00039849794,0.0003396213,0.017185355,0.0003875034,0.0000051500574],"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.00023174688,0.00012226873,0.00015535638,0.000013462045,0.00003519639,7.5031735e-8,0.00035213455,0.00031408886,0.05099502,0.85241705,0.0014715185,0.09389206],"study_design_scores_gemma":[0.000015231313,0.00023715851,0.000014932052,0.000016810869,0.0000059097756,0.00000223312,0.0005124794,0.25033244,0.33644474,0.41197103,0.00036847012,0.00007856341],"about_ca_topic_score_codex":0.000041395717,"about_ca_topic_score_gemma":0.000004342083,"teacher_disagreement_score":0.4884745,"about_ca_system_score_codex":0.000099252145,"about_ca_system_score_gemma":0.00010700363,"threshold_uncertainty_score":0.9907635},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016420025,0.000023111053,0.97066385,0.007178877,0.0004852287,0.0003560067,0.0000081438975,0.000058901212,0.0048058466],"genre_scores_gemma":[0.8434662,0.0000121717985,0.15580218,0.00025232934,0.0001907227,0.000038418275,0.0000030803296,0.00001011738,0.00022476967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984539,0.000032771375,0.00047165228,0.00047140723,0.0002930037,0.0002772709],"domain_scores_gemma":[0.9978101,0.00019851113,0.00030152462,0.00026715698,0.0013599468,0.000062754225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004681661,0.00017176506,0.00021225707,0.00006147972,0.00041687072,0.00040012144,0.000831395,0.00006538102,0.000055097364],"category_scores_gemma":[0.0012094093,0.00014207844,0.00014562879,0.0005049268,0.00012585908,0.0005793144,0.00023080998,0.00015266772,0.000026092555],"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.00001027919,0.000059784423,0.00007282227,0.00001661578,0.000009560836,2.511106e-7,0.00038258336,0.00030199598,0.4072296,0.5659448,0.0006122331,0.025359472],"study_design_scores_gemma":[0.000020463713,0.00004089285,0.00014732072,0.000044535343,0.000008140126,0.0000019932243,0.00021199607,0.3856525,0.55310035,0.060534637,0.00012464021,0.00011254401],"about_ca_topic_score_codex":0.000008250041,"about_ca_topic_score_gemma":0.000012029451,"teacher_disagreement_score":0.8270462,"about_ca_system_score_codex":0.000036769812,"about_ca_system_score_gemma":0.000108843305,"threshold_uncertainty_score":0.5793791},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07377626,0.000013558316,0.89523643,0.023522934,0.002414783,0.00093723845,0.000017688995,0.00013496776,0.003946152],"genre_scores_gemma":[0.9671659,0.000003461768,0.031129578,0.0009934795,0.00016918204,0.00008291358,5.9807684e-7,0.000010451155,0.00044442847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975472,0.00005079753,0.0004507353,0.0005975959,0.0010206993,0.0003329451],"domain_scores_gemma":[0.9987255,0.0000841736,0.00027032843,0.00032503498,0.000465109,0.00012987366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008698668,0.00018856059,0.00021971624,0.0001627009,0.00061082025,0.0003602966,0.0031799052,0.00003154641,0.00047493962],"category_scores_gemma":[0.0005322328,0.00015791455,0.0000944023,0.0009893519,0.00007408145,0.00037433257,0.0016093783,0.00033096728,0.00009083359],"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.00008043658,0.0002778227,0.00056756276,0.000008890807,0.00004317146,6.993223e-7,0.0017899876,0.101754524,0.026723899,0.8441175,0.0024992973,0.022136169],"study_design_scores_gemma":[0.00009270729,0.0007149383,0.003117379,0.000095304524,0.000030011632,0.000007072406,0.001494483,0.578843,0.21119118,0.20266467,0.0011118314,0.00063745136],"about_ca_topic_score_codex":0.000101251084,"about_ca_topic_score_gemma":0.0000055465425,"teacher_disagreement_score":0.89338964,"about_ca_system_score_codex":0.0001421038,"about_ca_system_score_gemma":0.00015267501,"threshold_uncertainty_score":0.64395684},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12753388,0.0002180171,0.7537536,0.09639413,0.004563295,0.0049524317,0.00013916557,0.0011729109,0.011272572],"genre_scores_gemma":[0.98644245,0.000006101695,0.011902474,0.0004785716,0.000088858236,0.00022020415,0.0000017605964,0.000023201725,0.00083635707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978991,0.000048895974,0.00054029643,0.00057600957,0.0005184601,0.0004172034],"domain_scores_gemma":[0.9984657,0.00014738248,0.00042286637,0.0003885139,0.00044416598,0.00013134096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007286078,0.0002184828,0.00026256416,0.0001379194,0.0007173521,0.00021863142,0.002606835,0.000035752662,0.00016430725],"category_scores_gemma":[0.0006593847,0.00019012364,0.00016538476,0.0005081589,0.00014197784,0.0003775929,0.0014108779,0.00041775743,0.000031377913],"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.0004581672,0.00013832115,0.0004202757,0.00024726562,0.00001948874,9.859422e-7,0.0033292102,0.002797334,0.007388947,0.8707448,0.0003789378,0.11407622],"study_design_scores_gemma":[0.00004021967,0.00033404285,0.00017186107,0.00016992926,0.000012259373,0.00000579042,0.0005852085,0.8704631,0.017321317,0.10946289,0.0011443355,0.00028907618],"about_ca_topic_score_codex":0.000030746505,"about_ca_topic_score_gemma":0.0000044094313,"teacher_disagreement_score":0.86766577,"about_ca_system_score_codex":0.00011174365,"about_ca_system_score_gemma":0.00014889335,"threshold_uncertainty_score":0.7753017},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9331085,0.000006057805,0.06335507,0.0015252534,0.00019014324,0.0008973432,0.000011686487,0.000074435804,0.0008315116],"genre_scores_gemma":[0.99769753,0.000006283492,0.002048003,0.0000569947,0.00002333819,0.00011562087,0.000003614165,0.000015011103,0.000033631848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99889463,0.000006228303,0.00042655307,0.00020253033,0.00025124094,0.0002188244],"domain_scores_gemma":[0.99954563,0.0000777464,0.00005958281,0.00013665674,0.00013905435,0.000041336643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037771167,0.00012583083,0.00015377904,0.00012576024,0.0000605925,0.00003620193,0.00031968107,0.00005707814,0.000053970223],"category_scores_gemma":[0.00010123456,0.000111402864,0.0000570649,0.00023391828,0.00009999615,0.00007557863,0.000015690497,0.00015563077,0.000024197456],"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.00021403351,0.00043365578,0.018508062,0.000508118,0.000028706587,1.358375e-7,0.0014114764,0.262434,0.24286298,0.45565408,0.00008380759,0.017860921],"study_design_scores_gemma":[0.000098638164,0.00009654614,0.0121401,0.00016839012,0.00000906398,7.412788e-8,0.00026124393,0.41244432,0.56697494,0.007613433,0.000049193153,0.00014409501],"about_ca_topic_score_codex":0.000026972884,"about_ca_topic_score_gemma":0.00004418543,"teacher_disagreement_score":0.44804066,"about_ca_system_score_codex":0.00007102186,"about_ca_system_score_gemma":0.000024209105,"threshold_uncertainty_score":0.4542877},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60896456,0.0003144638,0.29084393,0.00082292897,0.0010692402,0.0006103043,0.0000070895835,0.00028660195,0.097080864],"genre_scores_gemma":[0.9924743,0.000085967404,0.0070268544,0.00010548852,0.000040115207,0.000015968952,4.298635e-7,0.000008251023,0.0002425902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856687,0.000022039512,0.00040152282,0.00045116246,0.00027027982,0.00028815743],"domain_scores_gemma":[0.9988721,0.000039656352,0.00032470515,0.00020077713,0.00047595252,0.00008682582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047858394,0.00020752687,0.00020751053,0.00008854386,0.00023027002,0.00027490643,0.0011612115,0.000108368076,0.000040007348],"category_scores_gemma":[0.00038276476,0.0001460211,0.000071257244,0.0003105779,0.00028437914,0.00068500615,0.00030549744,0.00025845208,0.000052713356],"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.000016087908,0.0000913669,0.000756009,0.00002042382,0.000006276431,2.164712e-7,0.0041875793,1.9888454e-7,0.04986605,0.87228805,0.00022080417,0.07254693],"study_design_scores_gemma":[0.000028680846,0.00032512328,0.001009401,0.00017883917,0.000013838338,0.000011501407,0.0014321454,0.024885261,0.38712996,0.58457047,0.0001412101,0.00027356078],"about_ca_topic_score_codex":0.000086805325,"about_ca_topic_score_gemma":0.000014526927,"teacher_disagreement_score":0.38350976,"about_ca_system_score_codex":0.000036748672,"about_ca_system_score_gemma":0.00004199675,"threshold_uncertainty_score":0.5954568},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28702807,0.000007614851,0.6999476,0.0009941091,0.0008353591,0.00047596902,0.0000024958629,0.0001464716,0.010562324],"genre_scores_gemma":[0.7929964,0.0000060680213,0.20673646,0.00013388346,0.00006386071,0.000012982483,2.5367484e-7,0.000009912519,0.000040139344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976969,0.00006792978,0.000647489,0.0005929951,0.0006106527,0.000384074],"domain_scores_gemma":[0.99784225,0.000113886,0.0005798216,0.0006407119,0.0007281376,0.000095169955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021198962,0.00022896928,0.00027274303,0.0001315885,0.00028117752,0.00021023552,0.0021947701,0.00012842119,0.000034017],"category_scores_gemma":[0.0018066892,0.00018278224,0.000116343464,0.00079125876,0.00040189456,0.00063869765,0.00046516213,0.00030253493,0.00005514144],"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.000025283747,0.000055919016,0.0004470625,0.000034421533,0.000004543465,4.6221494e-8,0.00037766478,0.00022626018,0.062158365,0.8781496,0.000051450323,0.058469333],"study_design_scores_gemma":[0.000014569825,0.00008282631,0.00065503904,0.00007613478,0.000006152618,0.00000441166,0.000056325003,0.43791476,0.2584613,0.302513,0.000081160324,0.00013431127],"about_ca_topic_score_codex":0.000078025834,"about_ca_topic_score_gemma":0.0000047941535,"teacher_disagreement_score":0.5756366,"about_ca_system_score_codex":0.00012895241,"about_ca_system_score_gemma":0.00008551262,"threshold_uncertainty_score":0.74536437},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041675046,0.000015255038,0.9866679,0.003790766,0.0002692476,0.0006732113,0.000016276956,0.00012983842,0.0042700293],"genre_scores_gemma":[0.87075037,0.000006482341,0.12808853,0.0004820089,0.00008179385,0.000107006126,0.0000014785467,0.000019630637,0.00046268463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976319,0.00002741942,0.0006251904,0.0007378864,0.00047085385,0.0005067704],"domain_scores_gemma":[0.99768835,0.00038948088,0.0005339668,0.00034630788,0.0009053892,0.0001364751],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007912909,0.00034096325,0.00042948616,0.00011006805,0.00035102174,0.00044767343,0.0020316055,0.00011528172,0.0000090505555],"category_scores_gemma":[0.001751269,0.0002565759,0.00017204272,0.00039893418,0.00027436772,0.0003889238,0.00031206998,0.00035951313,0.000012737743],"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.000057170895,0.0002290218,0.000006801988,0.0000415234,0.000018149482,3.5955804e-8,0.0012788296,0.016666453,0.11803138,0.7991924,0.00018827955,0.064289935],"study_design_scores_gemma":[0.000097044496,0.00031573206,0.0000016194423,0.00011845058,0.0000133989115,0.0000016043423,0.00009812311,0.8091842,0.10217485,0.08765261,0.0000871176,0.00025525878],"about_ca_topic_score_codex":0.000026517531,"about_ca_topic_score_gemma":0.000006541368,"teacher_disagreement_score":0.8665829,"about_ca_system_score_codex":0.00006258138,"about_ca_system_score_gemma":0.00012165959,"threshold_uncertainty_score":0.9999887},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84823436,0.00007549467,0.14662479,0.001265622,0.00252012,0.00068890146,0.00009842835,0.00011030683,0.0003819889],"genre_scores_gemma":[0.9767809,0.000042907694,0.022717169,0.00011140135,0.00023327848,0.00002990319,0.000011429465,0.0000244664,0.00004852721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961693,0.00005357813,0.0009557385,0.0012368538,0.0011606654,0.00042385946],"domain_scores_gemma":[0.9975703,0.00010100854,0.0009561356,0.0008144147,0.00045355022,0.000104628954],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004063481,0.00044263792,0.00045176077,0.00015968179,0.0004205419,0.0005803253,0.003836408,0.00020135689,0.00022928187],"category_scores_gemma":[0.00024836688,0.00036256222,0.00020409179,0.0003985258,0.00018232857,0.0005074405,0.0038000287,0.0011817749,0.000004411901],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013908478,0.00033783828,0.0132528,0.0004455549,0.00013909781,0.000006511756,0.020803303,0.0374135,0.3418012,0.46258178,0.000036215704,0.12304311],"study_design_scores_gemma":[0.00002704595,0.000054351487,0.00024038849,0.00057920424,0.0000382706,0.0000021973274,0.0025639858,0.6662207,0.14770287,0.18223467,0.0000072476164,0.0003290249],"about_ca_topic_score_codex":0.00089056353,"about_ca_topic_score_gemma":0.000051625775,"teacher_disagreement_score":0.62880725,"about_ca_system_score_codex":0.00026920403,"about_ca_system_score_gemma":0.00027568048,"threshold_uncertainty_score":0.99988264},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024068458,0.000007929089,0.9738654,0.00064664206,0.00011827106,0.0010266434,0.00004874394,0.00009805857,0.00011986758],"genre_scores_gemma":[0.87759066,0.000006752118,0.12210488,0.00004965268,0.000013908552,0.00020182061,0.000009346708,0.00000979494,0.000013160226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983625,0.000017413653,0.00037881493,0.00055619754,0.00047503982,0.00021003214],"domain_scores_gemma":[0.9985565,0.00020342028,0.0003712272,0.0004075329,0.00041934702,0.00004198607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073747337,0.00016246548,0.00018259314,0.00011674307,0.0004581527,0.00017439963,0.001579994,0.00003212114,0.000023798642],"category_scores_gemma":[0.0004500675,0.00012794763,0.0000265384,0.00042897314,0.00015110268,0.0007189955,0.0006280406,0.00017505515,5.1952094e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027029403,0.00027200097,0.00016698624,0.000108075226,0.000018125931,7.238988e-8,0.0018651446,0.34141114,0.0010824832,0.6209396,0.000022040464,0.033844013],"study_design_scores_gemma":[0.000050495688,0.00043212852,0.000044454748,0.000043988803,0.000012699427,0.00000754753,0.00027552183,0.95772874,0.01550137,0.025750993,0.000004024157,0.00014800775],"about_ca_topic_score_codex":0.000017299106,"about_ca_topic_score_gemma":0.0000023013572,"teacher_disagreement_score":0.85352224,"about_ca_system_score_codex":0.000060130867,"about_ca_system_score_gemma":0.000082003404,"threshold_uncertainty_score":0.5217553},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7276096,0.000024123556,0.26465443,0.002630477,0.001193426,0.0008443208,0.00007509203,0.00014543945,0.0028231167],"genre_scores_gemma":[0.9682569,0.0000021185595,0.03048013,0.00047715887,0.00017267025,0.000101067235,0.0000025375468,0.00002148972,0.00048594648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99737364,0.000026114581,0.000667286,0.00080593966,0.00065595855,0.00047108153],"domain_scores_gemma":[0.9984336,0.00023390561,0.0003662916,0.0004288744,0.0004057155,0.00013162823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008016448,0.00025117586,0.000334835,0.00016060603,0.0006815835,0.00035623234,0.0027020143,0.000050205468,0.000098108096],"category_scores_gemma":[0.00038361215,0.00022489257,0.00014998307,0.0005349111,0.000092308204,0.00031701615,0.0012682945,0.0004131281,0.000022560636],"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.00017199818,0.00014182088,0.00024635028,0.000028154982,0.000020828264,0.000001324026,0.013324969,0.0118265925,0.11417794,0.7153935,0.000035564855,0.14463095],"study_design_scores_gemma":[0.0000961897,0.000371739,0.000030878553,0.00012812439,0.0000128696975,0.0000045614934,0.0026814197,0.6437089,0.24921094,0.10251372,0.00091043615,0.0003302455],"about_ca_topic_score_codex":0.00033221298,"about_ca_topic_score_gemma":0.000018246947,"teacher_disagreement_score":0.6318823,"about_ca_system_score_codex":0.00010424155,"about_ca_system_score_gemma":0.00012425074,"threshold_uncertainty_score":0.91708535},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6143258,0.00045856804,0.36714554,0.0070549557,0.0012099008,0.0016945887,0.000016807471,0.001113129,0.0069807],"genre_scores_gemma":[0.9754565,0.00002001349,0.024036173,0.0003056369,0.00003290345,0.00006216031,0.0000011651765,0.000011168423,0.00007430601],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977598,0.000038449798,0.00061683526,0.00043232174,0.0007748676,0.00037768556],"domain_scores_gemma":[0.99831194,0.00013066089,0.0006051591,0.0003315307,0.00053564063,0.00008509633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009802709,0.00024531427,0.00025269567,0.00029617062,0.0005983771,0.00057405425,0.0022493117,0.00007571279,0.000081168415],"category_scores_gemma":[0.00075225456,0.00020034854,0.000069646965,0.0010012483,0.00017298556,0.0017486076,0.0021186941,0.0006437721,0.000010328007],"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.00005903833,0.000084397856,0.00046177,0.0001991899,0.000021546739,0.0000012722719,0.011532137,0.00017483669,0.041515708,0.757676,0.00031919996,0.18795487],"study_design_scores_gemma":[0.00003542727,0.00017981404,0.00016757604,0.00020562601,0.000017202126,0.000036991856,0.0012507371,0.22602357,0.2947118,0.4768503,0.00013547286,0.00038547037],"about_ca_topic_score_codex":0.00015811724,"about_ca_topic_score_gemma":0.000003596526,"teacher_disagreement_score":0.36113065,"about_ca_system_score_codex":0.00009306706,"about_ca_system_score_gemma":0.00012425304,"threshold_uncertainty_score":0.81699765},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2076304,0.00001098996,0.7765041,0.0105388025,0.0005263461,0.001641389,0.00008592793,0.0002585402,0.0028034996],"genre_scores_gemma":[0.92677397,0.0000021035714,0.07271465,0.00017436943,0.00004351519,0.00020361852,0.0000053164717,0.00001293205,0.00006953301],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980696,0.000041973555,0.00044624877,0.00060514815,0.0005367034,0.00030032205],"domain_scores_gemma":[0.9982684,0.00040680158,0.00043822767,0.00027446295,0.0005210633,0.000091025395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064632157,0.00021282776,0.00020874431,0.00020284239,0.000917053,0.00018980786,0.0013614385,0.000056701756,0.00012058646],"category_scores_gemma":[0.0007161337,0.00019434698,0.000124243,0.00062490255,0.000313915,0.00038486053,0.00063390966,0.00043660423,0.000015950529],"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.00012957094,0.0001626841,0.0017571328,0.000026844353,0.0000137431725,2.3182527e-7,0.00093281694,0.0057342467,0.02263709,0.9482769,0.000047247737,0.020281537],"study_design_scores_gemma":[0.00016714896,0.00022545911,0.0029984855,0.000035775556,0.00001984335,0.000003019663,0.0004624599,0.86105376,0.014722032,0.11986993,0.00017296751,0.00026912472],"about_ca_topic_score_codex":0.0002682291,"about_ca_topic_score_gemma":0.0000087313365,"teacher_disagreement_score":0.8553195,"about_ca_system_score_codex":0.00008071475,"about_ca_system_score_gemma":0.00017227286,"threshold_uncertainty_score":0.792524},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3176038,0.000017230388,0.6750885,0.0022666634,0.001384208,0.0011035033,0.000017254148,0.00014735549,0.0023714819],"genre_scores_gemma":[0.9935902,0.000003899151,0.0057155285,0.00022556074,0.000058773872,0.0001648758,0.0000019550905,0.000008788703,0.00023043423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985783,0.00002268948,0.00038119426,0.00036812032,0.0004284599,0.00022123859],"domain_scores_gemma":[0.998946,0.00009343918,0.00032317036,0.0001255844,0.00046453273,0.000047270525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052419276,0.00014018064,0.00015422194,0.00014767844,0.0008334284,0.00024054297,0.0007565251,0.000036996735,0.00015975402],"category_scores_gemma":[0.00020787839,0.000120241675,0.00009880242,0.00056045275,0.00009174073,0.00019021398,0.00021910609,0.00021089785,0.00003893289],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069644695,0.00026162993,0.00001008139,0.000030885814,0.000011799263,8.475659e-8,0.0011921217,0.0075947484,0.033024717,0.58189034,0.00026994,0.37564403],"study_design_scores_gemma":[0.00003532957,0.00041764995,0.000019174571,0.000043354234,0.000010744728,0.0000058447445,0.00022621568,0.7499845,0.20477979,0.04388764,0.0004629466,0.00012679413],"about_ca_topic_score_codex":0.000012462198,"about_ca_topic_score_gemma":0.0000030039614,"teacher_disagreement_score":0.74238974,"about_ca_system_score_codex":0.00009225,"about_ca_system_score_gemma":0.00009070055,"threshold_uncertainty_score":0.64101416},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25936538,0.00013383717,0.705568,0.013852857,0.0008512003,0.0029065467,0.000035609668,0.00035865552,0.016927894],"genre_scores_gemma":[0.9878162,0.000083472834,0.011109681,0.0004142209,0.000040279887,0.00031646772,0.0000027297347,0.00001414585,0.00020276535],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99838233,0.000022890612,0.0005267778,0.000407741,0.00034582097,0.00031444104],"domain_scores_gemma":[0.99830323,0.00038746346,0.0005207429,0.0002467945,0.00048575905,0.000056026493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043461597,0.00016529966,0.0002392199,0.00009450029,0.00048006355,0.00008159066,0.0015660898,0.000041318268,0.000073166244],"category_scores_gemma":[0.0005740987,0.00014504323,0.00014203513,0.00075677084,0.000106381965,0.00045071272,0.0003447854,0.00038059035,0.000019150448],"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.0001617378,0.00027783395,0.00027325717,0.00016008611,0.00002455913,3.2731677e-7,0.001572307,0.0029811668,0.18077138,0.38269183,0.00085255806,0.43023297],"study_design_scores_gemma":[0.000037527163,0.0003567135,0.000032413598,0.00008059364,0.000013476745,0.0000065733443,0.0003910107,0.072034135,0.70504856,0.22016832,0.0016390308,0.00019163633],"about_ca_topic_score_codex":0.000019528341,"about_ca_topic_score_gemma":0.0000027667577,"teacher_disagreement_score":0.72845083,"about_ca_system_score_codex":0.000046208763,"about_ca_system_score_gemma":0.00006489901,"threshold_uncertainty_score":0.59146917},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18205968,0.00003995012,0.8069924,0.0049091233,0.00033315102,0.0014981152,0.0000158339,0.000054274955,0.004097439],"genre_scores_gemma":[0.9910137,0.000006782017,0.007980516,0.00047176183,0.000020812153,0.00027727356,0.0000018024643,0.000012082602,0.00021526046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977183,0.000106265274,0.0007107689,0.0004145015,0.0007284268,0.0003217673],"domain_scores_gemma":[0.9983669,0.00043216438,0.0005816831,0.0002941259,0.0002810001,0.000044136246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020603046,0.00018670311,0.00027154834,0.00016681518,0.00030053785,0.00014458367,0.0023143792,0.000045492165,0.000040383824],"category_scores_gemma":[0.0002853214,0.00013938457,0.00014559575,0.0006775861,0.00017329725,0.00038900724,0.00036089393,0.00029660744,0.0000028621303],"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.000253172,0.00018648479,0.000034376517,0.000027557437,0.000013348987,2.2737753e-7,0.05384325,0.0075833392,0.011502747,0.8760386,0.00008058855,0.05043633],"study_design_scores_gemma":[0.00011369039,0.00038679427,0.000058298607,0.000073683055,0.0000084571075,0.000003820579,0.040739898,0.65585124,0.021932991,0.28024977,0.00042237143,0.00015900464],"about_ca_topic_score_codex":0.00010885888,"about_ca_topic_score_gemma":0.00002812107,"teacher_disagreement_score":0.80895406,"about_ca_system_score_codex":0.0000944181,"about_ca_system_score_gemma":0.00012410023,"threshold_uncertainty_score":0.5683938},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6421717,0.00010626149,0.3088268,0.011159629,0.0028961485,0.0012892473,0.00006735597,0.00029385847,0.033189006],"genre_scores_gemma":[0.9949158,0.000010364746,0.0046703843,0.00007630748,0.000026103493,0.000042622858,0.000001059243,0.0000063095667,0.00025104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983686,0.000026573403,0.00046351398,0.00036537525,0.00055571715,0.00022018803],"domain_scores_gemma":[0.99868923,0.00007220515,0.00039425574,0.00037444918,0.00042176695,0.000048064303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005553489,0.00013065191,0.00019214704,0.00017113039,0.0004433931,0.00007709566,0.002226747,0.000030130157,0.00020283411],"category_scores_gemma":[0.00010998518,0.00011550749,0.0001339967,0.0011555365,0.00021931862,0.00026088278,0.00070191093,0.00027698796,0.00002119821],"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.000024973984,0.00023792192,0.00027691122,0.000016918517,0.0000114172735,1.2613724e-7,0.00060683466,0.00050130894,0.026877966,0.9414547,0.00022973632,0.029761156],"study_design_scores_gemma":[0.00002969671,0.00031450944,0.0006656492,0.000044865006,0.000012544248,0.0000066440107,0.0010027855,0.14800373,0.3847809,0.4640575,0.0008843209,0.00019684085],"about_ca_topic_score_codex":0.00005214188,"about_ca_topic_score_gemma":0.0000037257148,"teacher_disagreement_score":0.4773972,"about_ca_system_score_codex":0.000044104767,"about_ca_system_score_gemma":0.00008579932,"threshold_uncertainty_score":0.47102588},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035075676,0.00062868284,0.86146796,0.081996664,0.0012616022,0.0026456104,0.000033200417,0.0010589701,0.01583162],"genre_scores_gemma":[0.9759045,0.00003288556,0.022613706,0.00093375606,0.00003263362,0.00006386012,0.000001988422,0.0000129586515,0.00040369306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980214,0.00005653183,0.0004187054,0.0004865923,0.0007885419,0.00022819957],"domain_scores_gemma":[0.9985149,0.00015821036,0.00047733032,0.0003978532,0.0004098393,0.00004187663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007478334,0.00017303445,0.00016299762,0.00011425001,0.00059856585,0.00030904656,0.0027071072,0.00004791624,0.00018616348],"category_scores_gemma":[0.00065639714,0.00011588084,0.00008408485,0.0010864909,0.00013716487,0.0003977029,0.0007513272,0.00046061474,0.000020426312],"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.00005235414,0.00011498515,0.000014638106,0.00001216543,0.0000061521514,3.90379e-7,0.0010553385,0.0010055256,0.029643236,0.8723868,0.005980834,0.08972757],"study_design_scores_gemma":[0.00001585069,0.00023747128,0.0000024826115,0.00010643724,0.0000059236613,0.000004370104,0.00037275473,0.18575439,0.66797715,0.14487709,0.000467542,0.00017853336],"about_ca_topic_score_codex":0.00002875717,"about_ca_topic_score_gemma":5.2777654e-7,"teacher_disagreement_score":0.94082886,"about_ca_system_score_codex":0.000088332374,"about_ca_system_score_gemma":0.000057003916,"threshold_uncertainty_score":0.50305235},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50209486,0.00008992597,0.49432698,0.0017026912,0.0003112883,0.0010928581,0.000007907663,0.00017403429,0.0001994352],"genre_scores_gemma":[0.9961755,0.000008001589,0.0032640758,0.0003768804,0.00006541656,0.000056768313,0.0000026472678,0.000028205208,0.000022502294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996624,0.00017113553,0.0006329778,0.0009927758,0.00082485663,0.00075428426],"domain_scores_gemma":[0.99772877,0.00046157493,0.0004714426,0.0004812833,0.000671746,0.00018515885],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000714934,0.0004190226,0.0004971829,0.00021467764,0.0010019216,0.00031823697,0.0017613762,0.00010172847,0.00002746659],"category_scores_gemma":[0.00011766492,0.00031357247,0.00014874042,0.0023682746,0.00081319787,0.0005116149,0.00089637126,0.0010913368,7.4360395e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000809125,0.00013771642,0.0023231842,0.000011863512,0.00003152676,0.000002759558,0.0001957393,0.93980515,0.0018490993,0.040795457,0.000015484386,0.014022921],"study_design_scores_gemma":[0.00016431896,0.0006564644,0.0009647016,0.000070382266,0.00002776424,0.000012414072,0.00039079462,0.9789599,0.0016891749,0.016710186,0.0000024983053,0.00035138545],"about_ca_topic_score_codex":0.0001754787,"about_ca_topic_score_gemma":0.000056564375,"teacher_disagreement_score":0.4940806,"about_ca_system_score_codex":0.00016143841,"about_ca_system_score_gemma":0.00015642734,"threshold_uncertainty_score":0.99993163},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01232518,0.00010746981,0.97529376,0.0030280396,0.0018694202,0.0010746492,0.000025434209,0.00017237026,0.006103689],"genre_scores_gemma":[0.9331552,0.00008333243,0.065573215,0.00031641632,0.00023062991,0.00016490881,0.0000025267368,0.00003799199,0.00043578775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99663794,0.000065818196,0.0007346149,0.0011988897,0.00080893753,0.0005537963],"domain_scores_gemma":[0.9973688,0.00008889234,0.0008087564,0.0007904896,0.0007970236,0.00014600961],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006095456,0.0005535807,0.00059033965,0.00019253691,0.0004962323,0.0007270395,0.0043475665,0.00018383615,0.00034744779],"category_scores_gemma":[0.00021450523,0.00040424222,0.00025250233,0.00065137306,0.00029868793,0.0003519754,0.0037475675,0.0010763174,0.000027439264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004611719,0.0011996462,0.00077965145,0.0005489883,0.00045808274,0.000017185506,0.012809524,0.27312982,0.050988384,0.35089874,0.0007359116,0.3079729],"study_design_scores_gemma":[0.00004443748,0.00022664519,0.000105011895,0.00023861916,0.00004204952,0.000005385855,0.0007056274,0.7878848,0.1999361,0.009966,0.00027986505,0.0005654708],"about_ca_topic_score_codex":0.0001432363,"about_ca_topic_score_gemma":0.00011169582,"teacher_disagreement_score":0.92083,"about_ca_system_score_codex":0.00013832787,"about_ca_system_score_gemma":0.00029928616,"threshold_uncertainty_score":0.9998409},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00864207,0.000029264227,0.9765597,0.00184015,0.001410495,0.0018552575,0.0000044693747,0.00037022607,0.009288367],"genre_scores_gemma":[0.97274595,0.00012068622,0.01777588,0.00018921342,0.00016400656,0.00049168896,0.000017807313,0.00006889545,0.008425872],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946226,0.00007624093,0.0015159237,0.0013157859,0.0015324879,0.00093696034],"domain_scores_gemma":[0.9955468,0.0002193057,0.0020379417,0.0007615866,0.0012582486,0.00017610643],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.001777161,0.00068041595,0.00076766853,0.0002861875,0.0010437749,0.00096084067,0.0056238435,0.0003253492,0.00019411868],"category_scores_gemma":[0.0013503117,0.0006282656,0.00054999435,0.0005592981,0.00025761066,0.0004607374,0.0059209117,0.002682238,0.00003408584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000883356,0.00005054368,0.00007877832,0.0002209438,0.00005779117,4.818026e-7,0.00155921,0.7264161,0.0033993481,0.26513457,0.00013390776,0.0028599675],"study_design_scores_gemma":[0.00006434446,0.00048921595,0.000005176941,0.0003643083,0.000068387504,0.0000016531596,0.00038520523,0.90610117,0.047710743,0.04339894,0.0008292898,0.00058155984],"about_ca_topic_score_codex":0.00006285763,"about_ca_topic_score_gemma":0.0000041042736,"teacher_disagreement_score":0.9641039,"about_ca_system_score_codex":0.0003366556,"about_ca_system_score_gemma":0.00077488227,"threshold_uncertainty_score":0.9997562},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42952898,0.000021777421,0.5474309,0.0035017212,0.00055926235,0.00039552705,0.000008077957,0.00017010259,0.018383667],"genre_scores_gemma":[0.9974805,0.000006534864,0.0017713802,0.00030585894,0.000047965204,0.000023597378,0.0000017387841,0.000011417614,0.000351005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979986,0.000025197922,0.0005396086,0.00046157616,0.0006553856,0.00031962077],"domain_scores_gemma":[0.9989538,0.00004610593,0.00039747506,0.00018632768,0.0003591088,0.00005718628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062491896,0.00018830659,0.00023396332,0.00013232241,0.000494834,0.00022902159,0.0018413131,0.000039445986,0.00005082887],"category_scores_gemma":[0.00009655303,0.00014770743,0.00015890456,0.00055580045,0.00009398401,0.00028462632,0.0007809202,0.0003482408,0.00001956493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023442302,0.000079145386,0.000029144343,0.0000114862605,0.0000134996335,5.223735e-7,0.001835566,0.071154915,0.013000284,0.8864733,0.00014643298,0.027232286],"study_design_scores_gemma":[0.000017032273,0.00006711512,0.000008413883,0.000053845637,0.000009013591,0.0000030420183,0.00035946205,0.938578,0.050685257,0.00995048,0.0001020733,0.00016626409],"about_ca_topic_score_codex":0.000008730757,"about_ca_topic_score_gemma":0.0000054584357,"teacher_disagreement_score":0.8765228,"about_ca_system_score_codex":0.000089526504,"about_ca_system_score_gemma":0.000062567895,"threshold_uncertainty_score":0.60233337},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93122286,0.000025410121,0.041521557,0.004115241,0.0008182092,0.00080630707,0.0000118105545,0.0005030988,0.020975526],"genre_scores_gemma":[0.99738014,0.000015840245,0.0018974151,0.00023607757,0.000049343107,0.00007458324,0.0000041104154,0.000010837719,0.0003316316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99811614,0.000071257375,0.00048389388,0.0004604976,0.00061538146,0.0002528307],"domain_scores_gemma":[0.9987662,0.000111022615,0.00049062714,0.00017876962,0.00039237674,0.00006103687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000626417,0.00015590587,0.00018619126,0.00011595573,0.0007128649,0.00027649573,0.0010864044,0.00004095448,0.00023048415],"category_scores_gemma":[0.00029284047,0.0001442343,0.0001064273,0.0006136168,0.00006919622,0.0006635582,0.00046969156,0.0004731375,0.000046750858],"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.0000936087,0.000572974,0.0018927307,0.000073816766,0.000046700035,0.0000017551898,0.010383253,0.00028363024,0.15966477,0.45208183,0.0017902268,0.3731147],"study_design_scores_gemma":[0.000076316595,0.00031155968,0.00011795075,0.000060364833,0.00001478442,0.0000071458203,0.0040108874,0.23030666,0.71218425,0.05099254,0.0016129185,0.000304606],"about_ca_topic_score_codex":0.000050132614,"about_ca_topic_score_gemma":0.0000025190882,"teacher_disagreement_score":0.5525195,"about_ca_system_score_codex":0.00008143749,"about_ca_system_score_gemma":0.000061856095,"threshold_uncertainty_score":0.5881704},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91155213,0.00005930549,0.04693289,0.0200111,0.0006938472,0.0019060096,0.00067866803,0.00015668203,0.01800935],"genre_scores_gemma":[0.99606496,0.000043132688,0.0016009067,0.0002105221,0.00010775404,0.00018139117,0.000008335195,0.000022207949,0.0017608108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960524,0.00008495749,0.0009070088,0.0010051563,0.001650543,0.00029994568],"domain_scores_gemma":[0.9962503,0.00058952806,0.0007044814,0.0006784294,0.0016247983,0.00015251787],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0019365515,0.00031337785,0.00042596448,0.00036779762,0.0007024025,0.00042959908,0.0023534629,0.00016435281,0.0015175105],"category_scores_gemma":[0.0011932291,0.00020856893,0.00015236827,0.0012175096,0.0009869158,0.00016236093,0.0012671691,0.0012819222,0.00007533975],"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.00045550428,0.0011551804,0.0012576621,0.000089590496,0.0000578958,6.8321447e-7,0.0017160559,0.02720156,0.00290933,0.93590593,0.00052843645,0.028722145],"study_design_scores_gemma":[0.000074741205,0.0006708695,0.0010146488,0.00043467953,0.00012827144,0.0000126073965,0.016771847,0.1615274,0.05814112,0.7577273,0.0028547077,0.0006417881],"about_ca_topic_score_codex":0.000154514,"about_ca_topic_score_gemma":0.00004974105,"teacher_disagreement_score":0.17817864,"about_ca_system_score_codex":0.00007468551,"about_ca_system_score_gemma":0.0004520593,"threshold_uncertainty_score":0.99939525},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90796214,0.00039062253,0.0112149175,0.06710165,0.0015237924,0.0010218311,0.000009939874,0.0001796121,0.01059549],"genre_scores_gemma":[0.99696004,0.000048064798,0.0013969827,0.0011030325,0.00006601861,0.000058586524,2.5269173e-7,0.000010834451,0.00035618932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980755,0.000056834804,0.0004172685,0.00045052817,0.0006418982,0.00035796504],"domain_scores_gemma":[0.9987025,0.0002046015,0.0003884159,0.00039183072,0.00024669032,0.00006593054],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0011715497,0.0002020506,0.00018573961,0.00007144755,0.0015349598,0.0003980613,0.0035774948,0.000034440087,0.00006775347],"category_scores_gemma":[0.0002104523,0.0001090717,0.00009857191,0.00075870246,0.00031200334,0.00033250084,0.0015661453,0.0005436083,0.000020586054],"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.000119599244,0.0002760884,0.0012412894,0.000038809107,0.000045765013,0.0000013234549,0.007613307,0.00015281129,0.053152714,0.5063811,0.0012188819,0.4297583],"study_design_scores_gemma":[0.000057446476,0.00030125873,0.0008256899,0.00009647932,0.000023549073,0.000073612595,0.0030950622,0.022900756,0.4369965,0.5322708,0.0030222065,0.000336684],"about_ca_topic_score_codex":0.00002825176,"about_ca_topic_score_gemma":0.000008448036,"teacher_disagreement_score":0.42942163,"about_ca_system_score_codex":0.000047614943,"about_ca_system_score_gemma":0.00011316252,"threshold_uncertainty_score":0.9997649},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051710038,0.000048077836,0.9768948,0.006871697,0.0054357653,0.0021722906,0.00024413787,0.00027993487,0.002882321],"genre_scores_gemma":[0.9477046,0.00001630501,0.05089596,0.00032010954,0.0005025222,0.00024129474,0.000060541985,0.00005882281,0.0001998137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950395,0.00008876015,0.0011290375,0.0018870609,0.0011943548,0.00066126476],"domain_scores_gemma":[0.9947614,0.0004897513,0.0016405627,0.0021604912,0.0008132647,0.0001345322],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0020195069,0.00060402404,0.00072115596,0.00026400838,0.0006220918,0.00057173945,0.016010283,0.00031926236,0.0002684854],"category_scores_gemma":[0.0023311062,0.00053571584,0.00036921966,0.00060935714,0.0003503042,0.0005174994,0.012034517,0.0017904103,0.000029967878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047915083,0.00048610586,0.00017003655,0.00056793354,0.00013772506,0.000002311129,0.0011768374,0.25707257,0.0013300136,0.66374665,0.002029048,0.07280164],"study_design_scores_gemma":[0.0000958019,0.0002566831,0.000024191026,0.00032367447,0.00007414573,0.0000016882257,0.00026150327,0.9169186,0.011923282,0.06812108,0.0014371771,0.0005622155],"about_ca_topic_score_codex":0.000112616195,"about_ca_topic_score_gemma":0.000017591206,"teacher_disagreement_score":0.9425336,"about_ca_system_score_codex":0.00027532582,"about_ca_system_score_gemma":0.001204184,"threshold_uncertainty_score":0.9997094},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1386619,0.000021478463,0.85461813,0.0033483456,0.0003050278,0.0014596868,0.0000029315447,0.00041069652,0.001171788],"genre_scores_gemma":[0.9476427,0.000012345611,0.051664934,0.000061925406,0.000015155348,0.00042230563,0.0000037786426,0.000015995662,0.00016084767],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973178,0.000064325315,0.00066810247,0.0007688084,0.0006538794,0.00052708655],"domain_scores_gemma":[0.9983979,0.00010658343,0.00053366745,0.0005542784,0.00035534636,0.000052249492],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.001630291,0.00023891902,0.00027617722,0.00031819392,0.0008533102,0.00025945314,0.00914621,0.000080337806,0.00002755598],"category_scores_gemma":[0.0072802505,0.00021290877,0.00010536637,0.0014007598,0.00012490677,0.0002133848,0.01728757,0.0009771347,0.000007113799],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002559988,0.0008848026,0.0010690413,0.00012700932,0.00003595716,7.951853e-7,0.0022510095,0.74799794,0.08481167,0.11429604,0.0008375337,0.04743222],"study_design_scores_gemma":[0.00008046261,0.0004090308,0.00006203154,0.000048499063,0.000005186816,0.0000039252022,0.0014039949,0.8857277,0.10389314,0.008006244,0.0001551022,0.00020467593],"about_ca_topic_score_codex":0.000065924214,"about_ca_topic_score_gemma":0.000004832437,"teacher_disagreement_score":0.8089808,"about_ca_system_score_codex":0.00040562608,"about_ca_system_score_gemma":0.00012470492,"threshold_uncertainty_score":0.9962148},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49289954,0.00026463033,0.3765475,0.078346655,0.012041298,0.00599046,0.000104702085,0.00166488,0.03214037],"genre_scores_gemma":[0.9854298,0.000022541783,0.010193336,0.0031594743,0.00028622674,0.00028191032,0.0000030215097,0.000054223376,0.00056945236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99101716,0.00034326492,0.0022286847,0.001737015,0.0033666957,0.0013071863],"domain_scores_gemma":[0.9951299,0.0007293821,0.0012531298,0.0009895228,0.0014463075,0.0004517453],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.007831675,0.000586075,0.00071320886,0.00040498743,0.0018404647,0.0005993588,0.0062212255,0.00015758966,0.00052277045],"category_scores_gemma":[0.005897599,0.000516841,0.00038827778,0.0018024754,0.00068911386,0.0008568312,0.0030630017,0.001922545,0.00014281434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020551238,0.0012096685,0.0009013289,0.000055722525,0.0000507319,0.0000359097,0.0036574134,0.0015901763,0.011684711,0.5876289,0.0006294381,0.3923505],"study_design_scores_gemma":[0.00013349977,0.0008956909,0.00009282611,0.00032262204,0.000025194555,0.000040581494,0.0047983998,0.836508,0.094052844,0.06195311,0.00055216276,0.00062508986],"about_ca_topic_score_codex":0.00054640474,"about_ca_topic_score_gemma":0.000057924153,"teacher_disagreement_score":0.8349178,"about_ca_system_score_codex":0.00045472238,"about_ca_system_score_gemma":0.00085877645,"threshold_uncertainty_score":0.9997283},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93694806,0.000012546233,0.05244656,0.000692865,0.00030532802,0.00035792543,0.0000028797094,0.00016473282,0.0090691205],"genre_scores_gemma":[0.9960514,0.000006079326,0.0036465605,0.00007610987,0.000027152977,0.000038521473,3.7369372e-7,0.000027115311,0.00012671329],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986094,0.000044242475,0.00038745973,0.00023910092,0.00041017338,0.00030960256],"domain_scores_gemma":[0.9995551,0.000090277645,0.000057600053,0.00010554604,0.000128755,0.0000626822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001080865,0.0001358667,0.0001819171,0.00022197902,0.00019884124,0.000061349594,0.0006550254,0.00003754304,0.00022371481],"category_scores_gemma":[0.00028951705,0.0001321592,0.000050473915,0.001054397,0.000065194414,0.000096935226,0.00029137835,0.00073969894,0.000029654315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003350855,0.000028329048,0.0007586865,0.000027383176,0.000004395362,3.6127557e-7,0.0039776587,0.85985297,0.028761348,0.023088442,0.000018654997,0.08344829],"study_design_scores_gemma":[0.000020214275,0.00011047527,0.00026746132,0.00007214972,0.000002879979,0.0000025347529,0.004890411,0.8038375,0.18735108,0.0031796969,0.00010705904,0.0001585627],"about_ca_topic_score_codex":0.000032689655,"about_ca_topic_score_gemma":0.000005346755,"teacher_disagreement_score":0.15858974,"about_ca_system_score_codex":0.00014939695,"about_ca_system_score_gemma":0.00003422554,"threshold_uncertainty_score":0.5389296},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6188173,0.00006375254,0.0041938666,0.007049133,0.0025123563,0.0014352553,0.000036552075,0.00029581258,0.36559597],"genre_scores_gemma":[0.996376,0.000019051933,0.0006023357,0.00067719806,0.00023850161,0.00009728164,7.341855e-7,0.000034146182,0.0019547965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957491,0.00012365857,0.00094242673,0.00067152444,0.0017347562,0.0007785147],"domain_scores_gemma":[0.99776125,0.00050040067,0.00061035936,0.00036916102,0.000606802,0.00015205448],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002335238,0.00029856086,0.0003763578,0.00023735354,0.0024899265,0.00040840704,0.0030438453,0.00012242795,0.0046629123],"category_scores_gemma":[0.0019380314,0.0002671871,0.00027370948,0.0014173792,0.0012409381,0.00052426045,0.0010346451,0.00085134315,0.00016903497],"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.00032930422,0.00023519502,0.0003173706,0.000013124369,0.000016238253,0.0000017891705,0.008874246,0.0008543114,0.0047683315,0.89550954,0.0016721643,0.0874084],"study_design_scores_gemma":[0.000047408623,0.00057614414,0.00007655571,0.0008184582,0.00006719517,0.000013512621,0.08423933,0.019246284,0.18748237,0.6352114,0.07116959,0.0010517326],"about_ca_topic_score_codex":0.0005746634,"about_ca_topic_score_gemma":0.0003052088,"teacher_disagreement_score":0.37755865,"about_ca_system_score_codex":0.00037884963,"about_ca_system_score_gemma":0.00035657984,"threshold_uncertainty_score":0.999978},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04500306,0.000053639003,0.9285732,0.0070188674,0.0012724248,0.00291819,0.000035239686,0.00032666148,0.014798718],"genre_scores_gemma":[0.930199,0.000007310255,0.06735146,0.00073659944,0.00012736671,0.0009553583,0.0000011022972,0.00004138058,0.00058039324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99585885,0.00003507231,0.0010418463,0.001163296,0.001061155,0.0008397986],"domain_scores_gemma":[0.99743015,0.0002711964,0.00062783126,0.0006563127,0.0008156034,0.00019890616],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015191789,0.00041984307,0.00049532886,0.00034569416,0.0010008703,0.00054016634,0.00536713,0.00008867865,0.00005042255],"category_scores_gemma":[0.0009496804,0.00036258888,0.00030776396,0.0015755197,0.0002711449,0.00058382243,0.0021265172,0.0005730616,0.000040400366],"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.00008412477,0.0004895323,0.000090828755,0.00008153879,0.000025949219,1.5746657e-7,0.006338113,0.006691675,0.14382339,0.7877712,0.00057945953,0.05402399],"study_design_scores_gemma":[0.00005523187,0.0009641689,0.000096868695,0.00023637178,0.000031772743,0.00002266314,0.0056055333,0.4438066,0.40363696,0.14103433,0.0036244835,0.00088502024],"about_ca_topic_score_codex":0.00011308384,"about_ca_topic_score_gemma":0.000012430832,"teacher_disagreement_score":0.885196,"about_ca_system_score_codex":0.00019671269,"about_ca_system_score_gemma":0.00021005532,"threshold_uncertainty_score":0.9998826},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059737563,0.0007627083,0.8900856,0.026370235,0.004255547,0.0050678863,0.00016832829,0.00077281275,0.012779346],"genre_scores_gemma":[0.9909035,0.000036452893,0.008242825,0.00015406904,0.000041342704,0.00027801644,0.0000020259015,0.000015554922,0.00032621814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99801165,0.0000640362,0.0007992853,0.00042665328,0.00041819748,0.000280192],"domain_scores_gemma":[0.9980558,0.00015205645,0.00086551945,0.000310951,0.0005636643,0.000052013882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013225584,0.000201911,0.0005003147,0.00016620253,0.0003101524,0.0001274485,0.002220531,0.00004988306,0.00006309994],"category_scores_gemma":[0.00012714449,0.00014845024,0.00028156856,0.000534404,0.00007630832,0.00024993735,0.0007372509,0.00034407506,0.000002774172],"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.000037662063,0.00021586838,0.000047997022,0.00010538677,0.00019933576,9.986078e-8,0.00068966526,0.0004183034,0.006230823,0.96486676,0.0011369433,0.026051188],"study_design_scores_gemma":[0.0000986685,0.0015135945,0.000034375516,0.00018686705,0.00028064032,0.0000212957,0.0036443034,0.35048854,0.39244992,0.2212039,0.029436274,0.00064163026],"about_ca_topic_score_codex":0.00009985062,"about_ca_topic_score_gemma":0.000003730942,"teacher_disagreement_score":0.93116593,"about_ca_system_score_codex":0.000051506257,"about_ca_system_score_gemma":0.000068620495,"threshold_uncertainty_score":0.6053625},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12965713,0.000034390672,0.8574195,0.0017754427,0.00069306826,0.0008535225,0.000008427147,0.0003455939,0.009212934],"genre_scores_gemma":[0.99359494,0.000007988929,0.0059527503,0.00008622031,0.0000280191,0.00020505731,0.0000012033969,0.000011460525,0.00011238319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99814767,0.00003752347,0.0005431225,0.0005528384,0.0004426229,0.0002762558],"domain_scores_gemma":[0.998837,0.00005737337,0.0003926886,0.00038614715,0.00028191356,0.000044896613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009579688,0.00016535065,0.00018731933,0.0003265033,0.00031162854,0.00014450906,0.0024469462,0.000057361547,0.000045249646],"category_scores_gemma":[0.00015327698,0.00015319826,0.00006600525,0.0014450703,0.00011372221,0.00057672994,0.0008497036,0.00046659552,0.00004062756],"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.000038645318,0.00018145452,0.00018492862,0.00001891103,0.0000040284885,3.3751076e-7,0.0032395474,0.00020093107,0.14116503,0.6847888,0.000033293378,0.17014405],"study_design_scores_gemma":[0.00002419322,0.0001299318,0.0004806469,0.00004517625,0.0000023678515,0.0000048958846,0.00096088945,0.2966401,0.43624926,0.26498452,0.00031190767,0.00016612433],"about_ca_topic_score_codex":0.00007410366,"about_ca_topic_score_gemma":0.00004933489,"teacher_disagreement_score":0.8639378,"about_ca_system_score_codex":0.00024061221,"about_ca_system_score_gemma":0.000074114956,"threshold_uncertainty_score":0.6247244},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46197936,0.00024294107,0.13048515,0.03295388,0.011385518,0.006248514,0.00007623433,0.0034914676,0.35313696],"genre_scores_gemma":[0.98464835,0.00012560638,0.013353143,0.0006235226,0.000082169274,0.00017069558,0.0000065578492,0.000039698727,0.00095023547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960075,0.00011661634,0.000878286,0.0011084576,0.0014079437,0.00048121536],"domain_scores_gemma":[0.99713635,0.0002567102,0.0010294471,0.00080875173,0.000623414,0.0001453502],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011137057,0.00048232693,0.00046707806,0.00042012014,0.000682924,0.0007426609,0.005744295,0.00019574103,0.0005468128],"category_scores_gemma":[0.00082000095,0.00042440597,0.0003358121,0.00091139274,0.00018037032,0.0003221686,0.0031713883,0.0020843477,0.0001191557],"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.00007962727,0.0002529857,0.00023366287,0.00011254882,0.00005966499,0.0000016022362,0.0069362773,0.0068493616,0.0021224495,0.93432987,0.00033211568,0.048689857],"study_design_scores_gemma":[0.00013975873,0.00065199274,0.00041455732,0.00054829865,0.00005215394,0.0000043870778,0.0041398215,0.4493635,0.037176557,0.5050664,0.0015421853,0.0009004212],"about_ca_topic_score_codex":0.000055748274,"about_ca_topic_score_gemma":0.0000047073527,"teacher_disagreement_score":0.522669,"about_ca_system_score_codex":0.00017859222,"about_ca_system_score_gemma":0.00029315765,"threshold_uncertainty_score":0.99982077},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.988792,0.00000466351,0.0004318806,0.0012631057,0.00022548791,0.0003708818,0.000030548777,0.00003893881,0.00884249],"genre_scores_gemma":[0.99875295,0.000020188529,0.00042307004,0.00028520628,0.000024335752,0.000040556693,0.0000065276686,0.000011976603,0.00043519586],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982976,0.00002841839,0.00052080513,0.00024613363,0.00051238167,0.00039468668],"domain_scores_gemma":[0.99905354,0.000037272006,0.00067628064,0.00011312868,0.000010097074,0.000109674744],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00072854024,0.00017547097,0.00017305919,0.00008378953,0.0007461605,0.00007436677,0.00074624165,0.000051859828,0.0048555546],"category_scores_gemma":[0.00012886684,0.00015220976,0.00007383051,0.00024120214,0.00023426802,0.00053864275,0.00055267155,0.00049673166,0.00041114134],"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.0004184987,0.0007127909,0.21890914,0.00007208781,0.00004603478,4.8414984e-7,0.022334907,0.009558199,0.052804977,0.03192817,0.003966777,0.65924793],"study_design_scores_gemma":[0.0005772534,0.0030531997,0.1050111,0.00018617172,0.00008483193,0.00001930541,0.02668749,0.16556938,0.65485984,0.013946914,0.027899852,0.0021046503],"about_ca_topic_score_codex":0.00038393904,"about_ca_topic_score_gemma":0.000019417817,"teacher_disagreement_score":0.6571433,"about_ca_system_score_codex":0.00042485024,"about_ca_system_score_gemma":0.000039611008,"threshold_uncertainty_score":0.9960541},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40993816,0.00002232511,0.5843103,0.0022946934,0.00037610956,0.0010428741,0.000028784689,0.00009153669,0.0018952128],"genre_scores_gemma":[0.99362385,0.000011345755,0.0059649157,0.00015038613,0.000020926198,0.000102232625,0.0000024248095,0.0000076417855,0.000116296236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875885,0.000016915154,0.00028035598,0.00037019557,0.00035652387,0.00021713894],"domain_scores_gemma":[0.9990772,0.00006038715,0.0002574955,0.0001225267,0.00042317237,0.000059217957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041680498,0.00012773526,0.00013866209,0.00008362535,0.00055782776,0.00017382971,0.00054243486,0.000023521565,0.000072604664],"category_scores_gemma":[0.00007273278,0.00009683233,0.000049341517,0.0003906406,0.00011290456,0.00019688993,0.00023697219,0.00015169974,0.0000034166476],"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.00016573527,0.00036142865,0.00013454579,0.00006131319,0.000018570514,2.7864826e-7,0.0015511406,0.026747517,0.0040370096,0.9375805,0.00014463134,0.029197304],"study_design_scores_gemma":[0.00010529245,0.000629243,0.0001309698,0.00008294001,0.000023594006,0.000009299719,0.0013291619,0.8163232,0.14712285,0.033559445,0.00041831832,0.00026569818],"about_ca_topic_score_codex":0.000012631203,"about_ca_topic_score_gemma":0.0000032193905,"teacher_disagreement_score":0.9040211,"about_ca_system_score_codex":0.000056704677,"about_ca_system_score_gemma":0.000066053435,"threshold_uncertainty_score":0.42904168},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82210034,0.000021123977,0.17102036,0.00085465884,0.0004771552,0.001105664,0.00017490855,0.00012948853,0.0041162977],"genre_scores_gemma":[0.9974453,0.000005690345,0.002195963,0.00005930935,0.000057672984,0.00013890646,0.000010534366,0.000017284912,0.00006937494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998917,0.000011556222,0.00031824925,0.0002248417,0.0002697601,0.0002586113],"domain_scores_gemma":[0.99952114,0.000107982865,0.00012504842,0.00008243395,0.00012283488,0.00004057085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035659922,0.00014250877,0.00017637781,0.00014173846,0.00018970248,0.00007597674,0.00039092335,0.000040951676,0.00009987087],"category_scores_gemma":[0.00027496493,0.00013199367,0.000065185544,0.0004356556,0.000055149685,0.00008270591,0.00016322386,0.00031178392,0.000008853198],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046186245,0.00013379728,0.0037029756,0.00008157055,0.000055297645,0.0000015348242,0.006876163,0.4215815,0.0045098616,0.54077005,0.00056594884,0.02125946],"study_design_scores_gemma":[0.00010393293,0.0003750566,0.0023314129,0.00032310208,0.000046826408,0.0000023754062,0.006904136,0.6609328,0.16121823,0.16549665,0.0017422705,0.000523231],"about_ca_topic_score_codex":0.000021137748,"about_ca_topic_score_gemma":0.0000044117987,"teacher_disagreement_score":0.37527338,"about_ca_system_score_codex":0.00009545659,"about_ca_system_score_gemma":0.0000116607525,"threshold_uncertainty_score":0.53825456},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40400684,0.000022297749,0.5896968,0.004771221,0.00039991233,0.00070498616,0.000015263558,0.000049737948,0.0003328893],"genre_scores_gemma":[0.9874661,0.0000082541865,0.011806701,0.00035584279,0.00009217592,0.000056344274,0.00000214018,0.000010378068,0.000202058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824786,0.00002217982,0.0003473021,0.0006495318,0.0004544812,0.00027864706],"domain_scores_gemma":[0.99899393,0.00007604657,0.00012969952,0.00045251974,0.000276257,0.000071566355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010802884,0.0001327739,0.00016505276,0.0001129749,0.0005023371,0.00031100924,0.002206429,0.000030739466,0.000025116027],"category_scores_gemma":[0.00030881405,0.000116132265,0.000037241287,0.00035153877,0.000057817586,0.00040901967,0.002087228,0.00023992674,0.0000086342125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003445125,0.00005994214,0.00011064262,0.000055285305,0.0000085538795,2.7890994e-7,0.0019210717,0.00319608,0.16696133,0.50979847,0.00014341822,0.3177105],"study_design_scores_gemma":[0.000023045537,0.0001772086,0.000024275234,0.000019571768,0.0000059638023,0.000004318276,0.0002990225,0.8857565,0.101643376,0.011745863,0.00017368993,0.0001271454],"about_ca_topic_score_codex":0.000105892934,"about_ca_topic_score_gemma":0.000013518144,"teacher_disagreement_score":0.88256043,"about_ca_system_score_codex":0.000047903668,"about_ca_system_score_gemma":0.00011030256,"threshold_uncertainty_score":0.47357363},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7295202,0.000018249997,0.24765904,0.01017467,0.0010978379,0.0024297251,0.00012870146,0.00050844805,0.008463114],"genre_scores_gemma":[0.9914952,0.000022145075,0.007042742,0.00088333676,0.000027910617,0.00024810043,0.0000025741624,0.000017852793,0.00026014395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9972713,0.000051136853,0.00065123435,0.0006342041,0.00096520234,0.00042692557],"domain_scores_gemma":[0.9974739,0.00008510643,0.00059721945,0.0004060964,0.0013240328,0.000113645714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082820735,0.0002664317,0.00034197516,0.00031264787,0.00035337554,0.00016507416,0.0021805274,0.00005974948,0.00015536493],"category_scores_gemma":[0.00014597642,0.00020824069,0.00011639519,0.001081813,0.00017680948,0.0008207054,0.0007987957,0.00042121945,0.00002482264],"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.00023758458,0.0003363712,0.00008354571,0.000048880254,0.000026101607,0.0000023817522,0.0039969846,0.00026642779,0.31163204,0.60317075,0.00022522948,0.079973705],"study_design_scores_gemma":[0.000042047523,0.0011258704,0.000055438326,0.00024255415,0.000013707657,0.000035588797,0.0012813882,0.037465245,0.85989004,0.09938884,0.00016069114,0.00029858237],"about_ca_topic_score_codex":0.00014281884,"about_ca_topic_score_gemma":0.000020070722,"teacher_disagreement_score":0.548258,"about_ca_system_score_codex":0.00014993286,"about_ca_system_score_gemma":0.00017872325,"threshold_uncertainty_score":0.8491809},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35217217,0.00063037366,0.62733096,0.014497439,0.00070567837,0.0021544078,0.00011077942,0.001058337,0.0013398763],"genre_scores_gemma":[0.92591995,0.000002343268,0.07342788,0.00041110034,0.00008182549,0.000051818988,0.0000048887623,0.000028969904,0.00007121611],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997018,0.00005641458,0.000656253,0.0008051773,0.0009478735,0.0005163125],"domain_scores_gemma":[0.998283,0.00020540008,0.0005534156,0.00037913842,0.00043453198,0.00014448178],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00077963463,0.0003817184,0.0004571824,0.00029460178,0.0006190433,0.000585875,0.00295541,0.00006882823,0.00014190875],"category_scores_gemma":[0.00026935866,0.0002830773,0.00013803954,0.0013576876,0.00014173533,0.0008111984,0.0004898206,0.0006860663,0.000006403056],"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.001684544,0.00022401605,0.00011779519,0.00007419333,0.0000488019,0.0000066531597,0.013027298,0.0027601318,0.34113613,0.056129694,0.00015072469,0.58464],"study_design_scores_gemma":[0.00017276156,0.00054732955,0.00002227568,0.00020929314,0.00003177659,0.000018865132,0.0014518615,0.58997214,0.36071977,0.04628252,0.000101515725,0.00046991245],"about_ca_topic_score_codex":0.00049780303,"about_ca_topic_score_gemma":0.00004765609,"teacher_disagreement_score":0.58721197,"about_ca_system_score_codex":0.00013169172,"about_ca_system_score_gemma":0.00013374533,"threshold_uncertainty_score":0.99996215},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95670086,0.00007930251,0.00037860288,0.0024167155,0.0024929666,0.00096709793,0.000010762285,0.00010021823,0.036853485],"genre_scores_gemma":[0.9989195,0.00009708581,0.00011935696,0.00019408495,0.00021738524,0.00008690955,5.913696e-7,0.000020703681,0.00034436767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99724185,0.0001217952,0.0006688592,0.00054329354,0.00089990615,0.0005242692],"domain_scores_gemma":[0.9988231,0.00015942266,0.00039449328,0.00016419461,0.00034390835,0.0001149035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017714017,0.00022034186,0.0002786131,0.0002616359,0.001200697,0.00022835618,0.0009480009,0.000116901945,0.0006644081],"category_scores_gemma":[0.00078892225,0.00020990772,0.0001017904,0.0011292385,0.0008721118,0.0005072152,0.00043444723,0.0006752891,0.00003464268],"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.00035101973,0.00017773449,0.000914304,0.000022690994,0.000010773874,9.772249e-7,0.023073424,0.00012287621,0.012920634,0.8402319,0.000071706985,0.12210197],"study_design_scores_gemma":[0.00011695734,0.0007355681,0.0019638054,0.00023711633,0.000043501965,0.00001520477,0.14076683,0.015012823,0.27628917,0.53560287,0.02802367,0.0011924938],"about_ca_topic_score_codex":0.0018192325,"about_ca_topic_score_gemma":0.0011439675,"teacher_disagreement_score":0.30462903,"about_ca_system_score_codex":0.00025873768,"about_ca_system_score_gemma":0.00021631995,"threshold_uncertainty_score":0.9234912},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7914923,0.000041497904,0.16050948,0.01314556,0.00121836,0.0021639513,0.000060593982,0.0006157896,0.030752465],"genre_scores_gemma":[0.9968412,0.000010034751,0.0026341914,0.00017706043,0.00005595373,0.000043447693,0.0000100147645,0.000014614405,0.00021346983],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977199,0.000055387165,0.00036204702,0.000687106,0.000852066,0.00032349417],"domain_scores_gemma":[0.99824405,0.00017489142,0.00055048143,0.00041925244,0.0005346467,0.00007668382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007118406,0.00021353834,0.00022317244,0.0001410019,0.00069074845,0.00027022962,0.0026940545,0.000037532038,0.00007280988],"category_scores_gemma":[0.00032299958,0.00016370349,0.000050275878,0.00081891875,0.00015442679,0.00055476016,0.0014336861,0.00091849687,0.000029533561],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034024852,0.00049744593,0.00082547625,0.00002988049,0.00008197803,0.00000873577,0.014416636,0.015578862,0.011678247,0.2295821,0.000102531274,0.72685784],"study_design_scores_gemma":[0.0001021449,0.00086912833,0.0050482717,0.00011765775,0.000030600895,0.000032096963,0.010950176,0.8931105,0.081817605,0.0067246803,0.00074034807,0.00045677583],"about_ca_topic_score_codex":0.00009530993,"about_ca_topic_score_gemma":0.000014180827,"teacher_disagreement_score":0.87753165,"about_ca_system_score_codex":0.00007803337,"about_ca_system_score_gemma":0.00011127342,"threshold_uncertainty_score":0.66756344},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54003984,0.000104785184,0.42480245,0.015172211,0.0013611229,0.0044938275,0.0000943839,0.00047645206,0.013454953],"genre_scores_gemma":[0.9889779,0.000012116851,0.010533575,0.00022862744,0.00002992254,0.00012229953,0.0000022635568,0.000009030386,0.000084248975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983301,0.0000170587,0.00051792234,0.00043655006,0.00044710204,0.00025127124],"domain_scores_gemma":[0.99881005,0.00014617004,0.00038661662,0.00015864796,0.0004235647,0.00007495911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064125215,0.00017383521,0.00020251138,0.00017166432,0.00044318373,0.0002951782,0.000784503,0.00004306588,0.00018651437],"category_scores_gemma":[0.00025344663,0.00014658534,0.00009758962,0.00049213145,0.00022924221,0.00021846379,0.00040886583,0.00028266638,0.0000040087507],"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.000040605242,0.00008398961,0.0007725815,0.000030399922,0.00001372551,3.364364e-7,0.0014842555,0.00019917675,0.0037434448,0.7656571,0.00005545868,0.22791892],"study_design_scores_gemma":[0.00064238,0.0026763037,0.016788365,0.0008305636,0.00012613263,0.00013179635,0.026998494,0.5252592,0.16515657,0.2517094,0.007571392,0.00210938],"about_ca_topic_score_codex":0.000009097832,"about_ca_topic_score_gemma":0.0000064218016,"teacher_disagreement_score":0.52506006,"about_ca_system_score_codex":0.000054607233,"about_ca_system_score_gemma":0.000116191564,"threshold_uncertainty_score":0.5977577},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6851063,0.0011975594,0.14894375,0.1460444,0.0070156795,0.006644043,0.00006176534,0.0010446546,0.003941856],"genre_scores_gemma":[0.9952189,0.00016158806,0.0029705344,0.00033346444,0.00017572133,0.000533738,0.0000027915619,0.000033140594,0.0005701202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965463,0.00011991827,0.0008717768,0.0008078082,0.0009924226,0.0006617327],"domain_scores_gemma":[0.9969771,0.0009433899,0.00077307876,0.000570014,0.00063331536,0.000103112514],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011895683,0.00037845163,0.00039870976,0.000112352616,0.0013965025,0.0018719566,0.005161511,0.000089309506,0.0001438024],"category_scores_gemma":[0.00080944016,0.000264559,0.00027715048,0.0009537711,0.00056195987,0.0011608131,0.0012165762,0.00089479086,0.0000436375],"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.000072445764,0.00014386693,0.00017966893,0.00003210983,0.000040137806,5.822567e-7,0.019575011,0.002377165,0.0076108878,0.6695335,0.00015495179,0.3002797],"study_design_scores_gemma":[0.00002447584,0.0005131539,0.00005647215,0.0002342382,0.00003155351,0.0000046864875,0.080978155,0.11743479,0.13165025,0.6660032,0.0027059242,0.0003630833],"about_ca_topic_score_codex":0.00030423093,"about_ca_topic_score_gemma":0.00016341326,"teacher_disagreement_score":0.31011263,"about_ca_system_score_codex":0.00013721884,"about_ca_system_score_gemma":0.00033877706,"threshold_uncertainty_score":0.9999807},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9694753,0.000009948064,0.00016821176,0.0058714882,0.00016619735,0.0005597953,0.000034315013,0.00012483004,0.023589881],"genre_scores_gemma":[0.99544746,0.0000082927845,0.00042931197,0.0002663543,0.000052346673,0.000018748946,0.0000067178007,0.000028176533,0.003742586],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9970713,0.000023358814,0.00042032165,0.0007362119,0.0012244199,0.0005243375],"domain_scores_gemma":[0.9988697,0.00006731105,0.00050162035,0.00024891266,0.00017966489,0.00013276299],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00026240826,0.00038257285,0.00033925852,0.00005598559,0.00067990756,0.0002885274,0.0012299463,0.000105880434,0.0011340942],"category_scores_gemma":[0.0002462033,0.0002419354,0.00017079877,0.0009552124,0.00058971444,0.00038699666,0.0005260189,0.00094867166,0.00018951307],"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.0013558981,0.0013707586,0.15125908,0.0002222803,0.0001246474,0.00003119917,0.017542308,0.2246784,0.56133187,0.0038551427,0.00884286,0.029385554],"study_design_scores_gemma":[0.0002909373,0.0036907806,0.03542564,0.0014406316,0.0001401705,0.00017878535,0.03218478,0.07263755,0.84110963,0.0037490185,0.0065860823,0.0025659902],"about_ca_topic_score_codex":0.00022069154,"about_ca_topic_score_gemma":0.00001913792,"teacher_disagreement_score":0.27977774,"about_ca_system_score_codex":0.00025815648,"about_ca_system_score_gemma":0.000048218066,"threshold_uncertainty_score":0.999779},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48112217,0.000032926022,0.51384413,0.0018087174,0.0016603661,0.001117034,0.000011675695,0.00011285692,0.00029011694],"genre_scores_gemma":[0.96015054,0.000009137199,0.03911115,0.00020252145,0.00009965476,0.00017701785,0.000002588505,0.0000124756425,0.00023489702],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979896,0.000019802477,0.0005675386,0.00057748525,0.0005482328,0.00029731778],"domain_scores_gemma":[0.9986811,0.00004588161,0.0004325359,0.00029063906,0.00048885494,0.000060939903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077873096,0.00018506387,0.00019639527,0.000118464974,0.0005628079,0.00020008229,0.0013878396,0.00005712505,0.000052484953],"category_scores_gemma":[0.00017151337,0.00015750181,0.00014442584,0.00028917904,0.00006654913,0.0003409779,0.000618604,0.0002746194,0.00001751539],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003733274,0.0005050025,0.0003686531,0.000031949647,0.000017384386,4.3357437e-7,0.0021136638,0.0032333187,0.62937325,0.3056469,0.00013535804,0.058536727],"study_design_scores_gemma":[0.00007982602,0.00014617026,0.00079453154,0.000032329837,0.000010435538,0.000002743306,0.00038927866,0.8155995,0.17604008,0.0066493885,0.000072081726,0.00018360592],"about_ca_topic_score_codex":0.000043249882,"about_ca_topic_score_gemma":0.000019595658,"teacher_disagreement_score":0.8123662,"about_ca_system_score_codex":0.00011306023,"about_ca_system_score_gemma":0.00007286035,"threshold_uncertainty_score":0.6422737},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3346348,0.000018526813,0.660996,0.0022018524,0.00022042476,0.0005484703,0.0000126285595,0.00011120275,0.001256078],"genre_scores_gemma":[0.96667355,0.0000018099043,0.03268597,0.0001491873,0.000035150548,0.00012937844,0.0000032235698,0.000012290162,0.00030942223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830824,0.00001551495,0.000377422,0.00047336004,0.0005299613,0.00029552425],"domain_scores_gemma":[0.99888015,0.00006942979,0.0002617701,0.00029839747,0.0004417326,0.00004853329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041869428,0.0001729717,0.00018100966,0.0001488778,0.0007136452,0.00021654378,0.0017372828,0.000033298544,0.000023397735],"category_scores_gemma":[0.000117747615,0.00013698115,0.00008776646,0.00045090695,0.000091865724,0.00048450456,0.00047581614,0.0003214006,0.0000029535047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030977215,0.000095092095,0.00012509893,0.00003144172,0.000011873828,3.1228151e-7,0.0030515175,0.030515099,0.041987445,0.90459555,0.00003700728,0.019518597],"study_design_scores_gemma":[0.00004561824,0.00014401613,0.0000434021,0.00006572605,0.000011013984,0.000004169866,0.0018684986,0.9352983,0.026573839,0.035749983,0.000009907526,0.00018548519],"about_ca_topic_score_codex":0.00004481687,"about_ca_topic_score_gemma":0.000026742906,"teacher_disagreement_score":0.90478325,"about_ca_system_score_codex":0.00008443703,"about_ca_system_score_gemma":0.000104920684,"threshold_uncertainty_score":0.5585929},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24624833,0.0000820139,0.6184949,0.093155645,0.005444045,0.005603291,0.00015762614,0.0010064224,0.029807724],"genre_scores_gemma":[0.9747518,0.000008665088,0.021664247,0.0020744249,0.0002547947,0.00053710124,0.0000021787228,0.00006176278,0.0006450257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9927795,0.00013291201,0.0018555697,0.0018372544,0.002081603,0.0013131738],"domain_scores_gemma":[0.99630105,0.0003836671,0.00067943713,0.0013338409,0.0007337047,0.0005682924],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0022509557,0.00071010634,0.000739477,0.00078495115,0.0011833371,0.00074719405,0.009130608,0.00015247204,0.00047214516],"category_scores_gemma":[0.0014704287,0.0006377406,0.00037129212,0.0041607106,0.00047221975,0.00067979936,0.0044786436,0.00110122,0.00115344],"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.00019030689,0.00040686145,0.00008653792,0.00002572705,0.000026455149,0.000003422155,0.0054071173,0.006493753,0.015165369,0.78468573,0.0010421909,0.18646653],"study_design_scores_gemma":[0.0000068078675,0.0007326711,0.00003215445,0.00009601014,0.000018636669,0.000018165798,0.0038612313,0.038496554,0.55636376,0.39769536,0.0020331466,0.00064549013],"about_ca_topic_score_codex":0.00019308875,"about_ca_topic_score_gemma":0.00007557921,"teacher_disagreement_score":0.72850347,"about_ca_system_score_codex":0.00037208485,"about_ca_system_score_gemma":0.00033889388,"threshold_uncertainty_score":0.99962425},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29639605,0.00020486653,0.68324405,0.013387098,0.001977323,0.002186701,0.000044661265,0.0003145751,0.002244649],"genre_scores_gemma":[0.97420067,0.000047454545,0.024927521,0.00033535468,0.000072833594,0.00021619916,0.0000016885675,0.000014883711,0.0001833788],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981536,0.000028018982,0.00046283347,0.0005974339,0.00041528587,0.00034280974],"domain_scores_gemma":[0.99872506,0.00012329407,0.0004328464,0.00028921722,0.00036066675,0.00006893339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004374123,0.00019306393,0.00022336018,0.000102437036,0.00057961466,0.0001804231,0.0016310503,0.000051100364,0.000026062553],"category_scores_gemma":[0.00017900711,0.00016487563,0.00009202306,0.0005790602,0.00015850631,0.00037634218,0.0007198778,0.00030856984,0.0000031810296],"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.000100318386,0.000060059734,0.000056492227,0.000020908923,0.0000091875445,8.328383e-8,0.00032465614,0.0008053779,0.10614888,0.85455775,0.00011658257,0.03779968],"study_design_scores_gemma":[0.00007749534,0.0002018079,0.000098922435,0.000044292865,0.000013543401,0.000004940225,0.00018300355,0.46401173,0.13002661,0.40466902,0.0004428987,0.0002257452],"about_ca_topic_score_codex":0.00000944798,"about_ca_topic_score_gemma":0.0000030574436,"teacher_disagreement_score":0.67780465,"about_ca_system_score_codex":0.000047666323,"about_ca_system_score_gemma":0.000055512057,"threshold_uncertainty_score":0.6723433},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56371915,0.00030970643,0.17243282,0.11992229,0.026244055,0.0072430675,0.00012460731,0.0013992853,0.10860498],"genre_scores_gemma":[0.9952697,0.000027253804,0.0015100904,0.002637191,0.00008143917,0.00012210786,3.7931235e-7,0.000018134118,0.00033368368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964517,0.000087030654,0.0006478642,0.0008966636,0.0012915166,0.00062527554],"domain_scores_gemma":[0.99830836,0.00013023501,0.00053177844,0.000479473,0.00038272276,0.00016743832],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010426486,0.00029473673,0.00030559226,0.00021769796,0.0010890717,0.0002581925,0.004832404,0.000060104187,0.00016626854],"category_scores_gemma":[0.00023611702,0.00025280513,0.00019318683,0.001697765,0.0004123872,0.0005168468,0.0017039737,0.0008226829,0.00009075301],"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.0000627211,0.0003909574,0.00019593375,0.000028514187,0.0000073330634,0.0000010663365,0.0026192144,0.0001276743,0.019338353,0.9302565,0.0007526197,0.04621912],"study_design_scores_gemma":[0.00005414206,0.0012664155,0.00044146497,0.00009348828,0.000011930139,0.0000320356,0.0024984304,0.047244906,0.41464245,0.53209853,0.0011142027,0.0005020134],"about_ca_topic_score_codex":0.0000772509,"about_ca_topic_score_gemma":0.000024995103,"teacher_disagreement_score":0.43155053,"about_ca_system_score_codex":0.00029598858,"about_ca_system_score_gemma":0.0006183231,"threshold_uncertainty_score":0.99999243},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26127607,0.00012342689,0.73007596,0.0032368056,0.0012321125,0.00061943254,0.00000950351,0.0003728543,0.0030538826],"genre_scores_gemma":[0.9953247,0.000020933032,0.004195411,0.00024664248,0.00006334746,0.000036699923,0.0000033698018,0.000018332228,0.00009061437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99757093,0.00010594065,0.0005567527,0.00067390676,0.0006546053,0.00043788337],"domain_scores_gemma":[0.99842966,0.00014321954,0.00062574627,0.00041044914,0.00029215455,0.00009877089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008826892,0.00024749068,0.0002530638,0.00023226273,0.0011108096,0.00030700813,0.0024999473,0.00006166336,0.000064432905],"category_scores_gemma":[0.000434282,0.000216128,0.00014731142,0.0015703116,0.00019955992,0.0005113893,0.00085583125,0.0010226497,0.0000063053467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012549841,0.00017822697,0.008747631,0.00003500585,0.000023159364,0.0000016901924,0.0017132303,0.16580531,0.022129344,0.6702521,0.000103638675,0.1308852],"study_design_scores_gemma":[0.000037344118,0.00016942875,0.0004234972,0.0000413937,0.000009390098,0.000011061549,0.0006419382,0.9710264,0.007751325,0.019360723,0.00028398496,0.00024350417],"about_ca_topic_score_codex":0.00013078662,"about_ca_topic_score_gemma":0.000014757621,"teacher_disagreement_score":0.8052211,"about_ca_system_score_codex":0.00006873382,"about_ca_system_score_gemma":0.000065220556,"threshold_uncertainty_score":0.8813444},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9849173,0.000033164994,0.004598709,0.0051995255,0.00035843923,0.00060856814,0.0000062725144,0.0001246607,0.004153395],"genre_scores_gemma":[0.9985131,0.000007852431,0.0008107636,0.00035446906,0.00006500176,0.00004584989,6.2447987e-7,0.0000135132495,0.0001888229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981767,0.000027870788,0.00031373982,0.00047513176,0.00065953954,0.00034704767],"domain_scores_gemma":[0.99899524,0.000100218705,0.00020708835,0.0003531739,0.00026225104,0.00008204404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036101945,0.00019098677,0.0001716551,0.00008791919,0.00057481596,0.00024183521,0.0024793292,0.000028559105,0.00014243729],"category_scores_gemma":[0.000027524422,0.00012925941,0.00007060755,0.00080871757,0.00015863938,0.00019895773,0.00087250577,0.00066931616,0.000011664759],"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.00010298856,0.000109685476,0.00022533628,0.000015753943,0.000014877458,0.0000019245126,0.0014011005,0.010873642,0.025420178,0.89096296,0.000075982265,0.070795566],"study_design_scores_gemma":[0.00012731567,0.0016006685,0.006536731,0.0001585638,0.00004134973,0.00014687708,0.0039659436,0.109868474,0.4429732,0.43254992,0.0010393391,0.000991598],"about_ca_topic_score_codex":0.000015961321,"about_ca_topic_score_gemma":0.0000047048543,"teacher_disagreement_score":0.45841303,"about_ca_system_score_codex":0.00003830213,"about_ca_system_score_gemma":0.0000665722,"threshold_uncertainty_score":0.52710456},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027187576,0.000019740108,0.98562104,0.008827554,0.0007788663,0.0010675343,0.000015542728,0.00012733763,0.000823644],"genre_scores_gemma":[0.9652853,0.0000029014302,0.033203978,0.00027589788,0.00013707501,0.0003588484,0.0000042602524,0.000021414273,0.00071034377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978739,0.000058497535,0.0004215464,0.00059749937,0.00063969113,0.00040888687],"domain_scores_gemma":[0.9982222,0.0001925413,0.0005600137,0.00031866887,0.0006352514,0.00007135512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009619723,0.00024521304,0.0002598408,0.0001496254,0.0008473295,0.00017386474,0.0020168638,0.00010470394,0.000034525794],"category_scores_gemma":[0.0005817566,0.00021749025,0.00016172361,0.0009306215,0.00019911931,0.00034982702,0.0010444762,0.0007153015,0.0000023290186],"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.000113831,0.000085832,0.00012137624,0.000020176029,0.00001386459,5.1544987e-7,0.00044571306,0.08598807,0.015973767,0.8908957,0.0004866471,0.0058544744],"study_design_scores_gemma":[0.000048325557,0.00021337239,0.00006777381,0.000039475108,0.000012875264,0.000017678145,0.00022146424,0.82958055,0.0644018,0.10488717,0.00027658787,0.00023295228],"about_ca_topic_score_codex":0.000022238764,"about_ca_topic_score_gemma":0.0000031608377,"teacher_disagreement_score":0.9625665,"about_ca_system_score_codex":0.00013581391,"about_ca_system_score_gemma":0.00012953837,"threshold_uncertainty_score":0.8868995},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16268533,0.00021728214,0.8025934,0.00453555,0.0027084548,0.002421633,0.00008885423,0.00030917663,0.024440289],"genre_scores_gemma":[0.9912483,0.0000110185565,0.008017979,0.00027559884,0.00009587544,0.00005945162,0.0000017740815,0.000011262125,0.00027875765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99787235,0.000028533275,0.00046634767,0.0005465723,0.00073391816,0.0003522766],"domain_scores_gemma":[0.9982991,0.0001487153,0.0004412875,0.00026776324,0.0007637439,0.00007936427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094217365,0.00019508682,0.00024112975,0.00013291904,0.0008209592,0.00019305517,0.0023908739,0.000064521286,0.00017229615],"category_scores_gemma":[0.00045865527,0.00015770075,0.00016606304,0.00062104204,0.00018074624,0.00039585485,0.0009280055,0.00036259115,0.000023005578],"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.000043756907,0.00013827285,0.00011089396,0.000028836852,0.000009102943,3.8501398e-7,0.00079897145,0.00029173287,0.017500175,0.96482396,0.00033392408,0.015919983],"study_design_scores_gemma":[0.00005911311,0.00042382945,0.00008620892,0.00009864455,0.000016178346,0.000025429477,0.00061564764,0.23148893,0.17732571,0.5880101,0.0015445035,0.0003057377],"about_ca_topic_score_codex":0.000020935191,"about_ca_topic_score_gemma":0.000002609509,"teacher_disagreement_score":0.8285629,"about_ca_system_score_codex":0.000113200374,"about_ca_system_score_gemma":0.00023302094,"threshold_uncertainty_score":0.643085},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97638196,0.00003099067,0.01916352,0.0013410543,0.0006112583,0.00044536532,0.0000034247787,0.0002111149,0.0018113042],"genre_scores_gemma":[0.99705917,0.000010995356,0.002546647,0.000048994996,0.000048238846,0.000051925806,4.7999526e-7,0.000014339374,0.00021923525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99743676,0.000034471002,0.00045086662,0.0005214746,0.0011873585,0.00036905307],"domain_scores_gemma":[0.9986083,0.00029717665,0.00030470203,0.00028459667,0.00042950525,0.00007575367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093212695,0.00017041972,0.00019188812,0.00019436482,0.00053463894,0.0003085105,0.0024496752,0.00004091482,0.0001601814],"category_scores_gemma":[0.0009206937,0.0001485349,0.000094625575,0.0010471328,0.0001482679,0.0004303159,0.0011037977,0.00067323307,0.000026330941],"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.00009213605,0.0004031874,0.022841558,0.0000880284,0.00006248694,0.000008543956,0.009849464,0.09154849,0.3020857,0.5229044,0.00019389194,0.049922116],"study_design_scores_gemma":[0.00005613415,0.00040016425,0.008339905,0.0001533629,0.000015384263,0.000034988352,0.0039561037,0.356032,0.59077126,0.039473116,0.0002795414,0.0004880583],"about_ca_topic_score_codex":0.00010301573,"about_ca_topic_score_gemma":0.000002858309,"teacher_disagreement_score":0.48343128,"about_ca_system_score_codex":0.00017647754,"about_ca_system_score_gemma":0.00015029575,"threshold_uncertainty_score":0.60570776},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.961408,0.00014924661,0.035487644,0.00056481536,0.0014709546,0.00051612896,0.000006402115,0.00020265665,0.00019415373],"genre_scores_gemma":[0.99901015,0.000021199863,0.0001072227,0.00027165547,0.00050842226,0.000026870812,0.0000027261237,0.000043641056,0.000008095572],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977255,0.000061971026,0.00065325876,0.00050757284,0.0004258812,0.0006258001],"domain_scores_gemma":[0.998857,0.0003135192,0.0002845634,0.00027600632,0.00013161481,0.00013724901],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00067318336,0.00035939578,0.0003698222,0.000100086516,0.0011343916,0.00020432236,0.0009936884,0.00011122885,0.00007698248],"category_scores_gemma":[0.00011386033,0.00027884493,0.00013274717,0.000600022,0.0003045093,0.00022938989,0.0005413785,0.0014594718,0.0000028564828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009985534,0.00003825232,0.000540724,0.00003733248,0.000019050694,0.0000018027026,0.0009409986,0.90392953,0.0036763547,0.015289323,0.000016127658,0.075410634],"study_design_scores_gemma":[0.00002874702,0.00021748403,0.00023141179,0.000088718305,0.000036461286,0.0000131292845,0.0016195776,0.97115254,0.021043831,0.005234474,0.000023453873,0.00031016648],"about_ca_topic_score_codex":0.0000110610845,"about_ca_topic_score_gemma":0.0000023717555,"teacher_disagreement_score":0.07510047,"about_ca_system_score_codex":0.00007440434,"about_ca_system_score_gemma":0.0000127116355,"threshold_uncertainty_score":0.9999664},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99479294,0.000024654046,0.00010243468,0.0032055823,0.00014394839,0.0009779861,0.00031621408,0.00002266979,0.00041354698],"genre_scores_gemma":[0.9994727,0.000008945293,0.00016709541,0.000031932315,0.000035095138,0.00017533542,0.0000042583993,0.000001816681,0.000102827915],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99848056,0.000012901549,0.00054814486,0.00027294853,0.0004898379,0.00019560968],"domain_scores_gemma":[0.99868095,0.00028933733,0.00046154924,0.000093942435,0.00043910262,0.000035106514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075049145,0.00012911564,0.0002117392,0.000015851543,0.00028023048,0.000024934945,0.0010041079,0.000046652232,0.00019953467],"category_scores_gemma":[0.00026986824,0.000049347003,0.00015278558,0.00030174124,0.00030026052,0.00008267618,0.00026163852,0.00019637102,0.0000019800825],"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.00065267,0.00072967133,0.007056107,0.00013921605,0.000050664505,4.5200284e-8,0.0036527517,0.009539243,0.88588035,0.05308886,0.00037035224,0.03884005],"study_design_scores_gemma":[0.000046861212,0.001139451,0.031819183,0.00008416368,0.000059624137,0.0000017674089,0.005939727,0.27009147,0.6499942,0.040588964,0.000059711656,0.00017490634],"about_ca_topic_score_codex":0.00013470348,"about_ca_topic_score_gemma":0.00005299745,"teacher_disagreement_score":0.26055223,"about_ca_system_score_codex":0.000034662273,"about_ca_system_score_gemma":0.000039003593,"threshold_uncertainty_score":0.21847646},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42814425,0.000021016176,0.56250685,0.003423805,0.00030572966,0.0005741408,0.0000022916215,0.0001593133,0.00486262],"genre_scores_gemma":[0.99267,0.0000069501357,0.0068526855,0.00015382799,0.000036263198,0.00006929997,5.515235e-7,0.000011991153,0.00019844656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782664,0.000066437635,0.0004279375,0.0006110361,0.0007438806,0.00032406225],"domain_scores_gemma":[0.9985706,0.00016112438,0.00042479695,0.00025500718,0.0005205969,0.00006786314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004947057,0.00019632342,0.00023384092,0.00012737862,0.0006157458,0.00018887279,0.0016166297,0.000031969954,0.00007032232],"category_scores_gemma":[0.00027620263,0.00015363247,0.00007636211,0.00085899443,0.00019657826,0.00053914083,0.0006294797,0.00053687027,0.000010786992],"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.00024135188,0.00019606501,0.0036947783,0.000036823538,0.00004765828,0.000003809227,0.015313956,0.020405117,0.13031524,0.71319103,0.000020001773,0.11653414],"study_design_scores_gemma":[0.00006230696,0.00036721982,0.00038127293,0.00010425833,0.0000120517725,0.000016902515,0.006928012,0.67110044,0.26793694,0.05282044,0.000028701777,0.00024146553],"about_ca_topic_score_codex":0.00011391613,"about_ca_topic_score_gemma":0.0000064167707,"teacher_disagreement_score":0.6603706,"about_ca_system_score_codex":0.00007907002,"about_ca_system_score_gemma":0.00010041976,"threshold_uncertainty_score":0.626495},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44694763,0.000046917386,0.4809639,0.06257642,0.002148709,0.0023283942,0.00019434173,0.0011005527,0.0036931408],"genre_scores_gemma":[0.9321325,0.000009628493,0.067357756,0.00016692826,0.00004400388,0.00021289663,0.0000059664144,0.000019755975,0.000050608476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99730635,0.000049942613,0.0007010181,0.0007623039,0.00071605074,0.000464321],"domain_scores_gemma":[0.99621844,0.00025718068,0.0008165258,0.0021830117,0.00045739606,0.0000674706],"candidate_categories":["metaresearch","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0012250826,0.00027396178,0.00030420176,0.00021959399,0.00070497714,0.0002987937,0.028861726,0.00009082645,0.000051104314],"category_scores_gemma":[0.010055265,0.00023107041,0.00013862528,0.0010718508,0.00026942932,0.0005941044,0.038483944,0.00056528545,0.00001180136],"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.000029823577,0.00011193489,0.0005036457,0.000050348866,0.000017405844,5.444771e-7,0.00025325472,0.000022520884,0.06970114,0.88907045,0.0021806997,0.038058214],"study_design_scores_gemma":[0.000029225646,0.00024584125,0.00008776549,0.00006126132,0.0000071847576,0.000004184278,0.00023655649,0.10505992,0.20871654,0.6852335,0.00012206575,0.00019600437],"about_ca_topic_score_codex":0.00004150654,"about_ca_topic_score_gemma":0.0000081770695,"teacher_disagreement_score":0.48518485,"about_ca_system_score_codex":0.00015730753,"about_ca_system_score_gemma":0.0001516165,"threshold_uncertainty_score":0.99828345},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15688324,0.000097780656,0.8117621,0.0036525002,0.011201464,0.0029523682,0.00041842906,0.0010844404,0.011947677],"genre_scores_gemma":[0.93375164,0.000013735178,0.06577583,0.00008148734,0.00018473523,0.00009656366,0.000008073681,0.00004679474,0.00004113812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982214,0.000026339492,0.0005388994,0.0003999541,0.00045741023,0.0003559852],"domain_scores_gemma":[0.9986889,0.00031166215,0.00023274402,0.00039985345,0.00029673165,0.00007013594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009946263,0.00021055584,0.00028034294,0.000112088615,0.0004188011,0.00011784515,0.0019246375,0.000088260946,0.00019891601],"category_scores_gemma":[0.0012262476,0.00020145968,0.00010016745,0.0005655788,0.000116420546,0.00020374417,0.00059672893,0.0003767814,0.000010249823],"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.00011721029,0.000088311135,0.00010378792,0.00009151258,0.000054893415,2.3929002e-7,0.0013101599,0.08931455,0.01581787,0.878163,0.0015298208,0.01340868],"study_design_scores_gemma":[0.000048741917,0.00011691324,0.000006895797,0.000085483094,0.000033746077,0.0000019609695,0.0012521811,0.7773602,0.082051866,0.13779117,0.0010093246,0.00024153729],"about_ca_topic_score_codex":0.000009179263,"about_ca_topic_score_gemma":9.74904e-7,"teacher_disagreement_score":0.7768684,"about_ca_system_score_codex":0.00011670023,"about_ca_system_score_gemma":0.00006552829,"threshold_uncertainty_score":0.82152873},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024353497,0.0000055362734,0.9703914,0.0010225201,0.00033623356,0.0008476899,0.0000033084211,0.00012983165,0.0029099674],"genre_scores_gemma":[0.9849914,0.000003883459,0.014306175,0.00016710955,0.000029552892,0.00013666265,0.0000014267938,0.000018121045,0.00034566803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976083,0.00004716043,0.00047025707,0.0005024269,0.00096631236,0.0004055316],"domain_scores_gemma":[0.9985246,0.00010684138,0.0005240828,0.00028962662,0.0004727837,0.000082070655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074203504,0.00023142027,0.00021286863,0.00015961581,0.0005079584,0.0002598929,0.0021489381,0.000036682333,0.00018459259],"category_scores_gemma":[0.00019286078,0.00017977788,0.00007399151,0.0008563429,0.00019420542,0.00042678564,0.00066165667,0.0005045254,0.00007924158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019022479,0.00023507807,0.000058949452,0.000036717025,0.00003357282,0.000001716385,0.0023102625,0.85259116,0.0054175043,0.12122287,0.00019809967,0.017703878],"study_design_scores_gemma":[0.0000731677,0.0013379044,0.000049870545,0.00013564054,0.000021146649,0.000025732734,0.0005309642,0.9339495,0.036495812,0.027029034,0.000044855387,0.00030640338],"about_ca_topic_score_codex":0.000018377741,"about_ca_topic_score_gemma":0.000001032391,"teacher_disagreement_score":0.9606379,"about_ca_system_score_codex":0.000111037196,"about_ca_system_score_gemma":0.00015406634,"threshold_uncertainty_score":0.73311293},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97559226,0.00015443643,0.0010128017,0.0058855144,0.001215515,0.00058450823,0.00011979147,0.0000724635,0.015362698],"genre_scores_gemma":[0.9981036,0.0000053740905,0.00009549043,0.00029345253,0.0001362285,0.00007501521,7.591599e-7,0.000023297727,0.0012667703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981822,0.000030215477,0.00085024117,0.00044507041,0.0001444076,0.00034787421],"domain_scores_gemma":[0.9981608,0.00016647457,0.001188822,0.0002804588,0.00014974191,0.000053729556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021559028,0.00020044851,0.0003609469,0.00012832966,0.0008823021,0.00018997655,0.0012212932,0.00005295459,0.00086450257],"category_scores_gemma":[0.00061876944,0.00015453159,0.00015591407,0.00043594776,0.00023892263,0.00015579432,0.00036443849,0.00051418884,0.00018542008],"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.00005399411,0.0000891703,0.0021734836,0.000031528532,0.00002448516,0.0000032050732,0.0032468378,0.0002014414,0.00029610939,0.9916476,0.0002608068,0.0019713347],"study_design_scores_gemma":[0.000054458993,0.00020803888,0.00037969355,0.00012020312,0.000016694248,0.00009432449,0.01818815,0.010754346,0.013016494,0.9547733,0.0020127173,0.00038155974],"about_ca_topic_score_codex":0.0003549255,"about_ca_topic_score_gemma":0.000030492514,"teacher_disagreement_score":0.036874283,"about_ca_system_score_codex":0.00008123633,"about_ca_system_score_gemma":0.000022816761,"threshold_uncertainty_score":0.9465697},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31290174,0.0003244379,0.684127,0.0013819195,0.00010586418,0.00050971226,0.000020243038,0.00012795583,0.0005011815],"genre_scores_gemma":[0.97895306,0.000021537035,0.02070741,0.00006321249,0.000021792306,0.0000727328,0.000004061771,0.000012710587,0.0001434868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800277,0.00002932221,0.00053723704,0.00063917076,0.000441142,0.00035034106],"domain_scores_gemma":[0.9985646,0.00022636558,0.0006034269,0.0002042022,0.00031673312,0.00008468614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075303623,0.00022116303,0.00041412763,0.00035729446,0.00096219685,0.00037301285,0.00080039265,0.0000381337,0.00007083081],"category_scores_gemma":[0.0004471872,0.0001901059,0.00016594744,0.0024037638,0.00017409347,0.00039322715,0.0004975876,0.00023255595,0.000001117607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054114073,0.00029408804,0.05893935,0.0002439078,0.00079603534,0.0000024664366,0.006365766,0.05583339,0.05423859,0.6572608,0.00003649833,0.16544797],"study_design_scores_gemma":[0.00004147055,0.00025183512,0.0006592166,0.000032177086,0.00015205218,0.0000029923967,0.0017827252,0.9601635,0.025582803,0.010931927,0.0001381132,0.00026123997],"about_ca_topic_score_codex":0.000033655717,"about_ca_topic_score_gemma":0.000020649399,"teacher_disagreement_score":0.9043301,"about_ca_system_score_codex":0.00006360607,"about_ca_system_score_gemma":0.000039877796,"threshold_uncertainty_score":0.77522933},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22184269,0.000016749182,0.7715905,0.0035625405,0.0011885035,0.00079557224,0.00002051626,0.00016677703,0.0008162032],"genre_scores_gemma":[0.973558,0.000002964061,0.025546562,0.0003074058,0.00015756505,0.00028758007,0.0000023240348,0.00001650359,0.00012109761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790037,0.000024546454,0.00058440946,0.0005543063,0.00055415614,0.0003822149],"domain_scores_gemma":[0.9985436,0.00010810601,0.00041540677,0.00041951015,0.00043951854,0.00007381818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010544504,0.00020340904,0.0002302854,0.00016372104,0.00053370703,0.00027061783,0.0024750533,0.000054512286,0.00004533892],"category_scores_gemma":[0.0005313586,0.0001812175,0.00011175732,0.0004931578,0.00009474369,0.0004560114,0.00059073686,0.00030705286,0.0000035801688],"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.000090150825,0.00009454229,0.00012641276,0.00006081053,0.000014354751,3.4062563e-7,0.0039160023,0.013761157,0.058493502,0.78013545,0.0001544341,0.14315282],"study_design_scores_gemma":[0.000058943027,0.00020963559,0.000033807886,0.000075239856,0.000007738648,0.0000015675646,0.00025150296,0.7499764,0.19012922,0.058921356,0.00016309225,0.00017148137],"about_ca_topic_score_codex":0.000054400545,"about_ca_topic_score_gemma":0.000023394368,"teacher_disagreement_score":0.7517153,"about_ca_system_score_codex":0.00013212189,"about_ca_system_score_gemma":0.0002425733,"threshold_uncertainty_score":0.7389835},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18780042,0.000028389435,0.8076231,0.001327134,0.00043542567,0.0006272051,0.000023768525,0.00004596138,0.002088637],"genre_scores_gemma":[0.9866087,0.0000022778936,0.013108602,0.00009695049,0.000033248467,0.000082668616,0.0000018859374,0.000009925995,0.000055751447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984174,0.000038560534,0.0004909126,0.00037657275,0.0003992551,0.00027734492],"domain_scores_gemma":[0.9985045,0.00032015526,0.00052098744,0.00017075411,0.000444729,0.00003883881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006465044,0.00016375056,0.00027359911,0.0002202735,0.00028296225,0.00012272804,0.0010818973,0.000038237376,0.00003623553],"category_scores_gemma":[0.00068504096,0.00013781147,0.000092887625,0.0007006733,0.0001512166,0.00016514973,0.00038264514,0.0003063689,0.0000010731602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017840236,0.00030045205,0.00048299928,0.000032723314,0.000014169829,4.6056078e-7,0.015615491,0.36786565,0.003850417,0.5959662,0.000019587977,0.015673425],"study_design_scores_gemma":[0.000054897817,0.00046143294,0.00012701217,0.000100782985,0.0000054308075,0.0000024747826,0.002578873,0.9373246,0.038060375,0.02109521,0.000042797063,0.00014610888],"about_ca_topic_score_codex":0.0001571131,"about_ca_topic_score_gemma":0.0000028601632,"teacher_disagreement_score":0.7988083,"about_ca_system_score_codex":0.00007593295,"about_ca_system_score_gemma":0.00007522106,"threshold_uncertainty_score":0.5619788},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8108959,0.000057262445,0.00006128155,0.005536029,0.001652508,0.00045858973,0.000041883588,0.000058628328,0.18123788],"genre_scores_gemma":[0.9971308,0.000013728658,0.00009242875,0.0003119571,0.00014982643,0.000012882057,5.8901634e-7,0.0000116126985,0.0022761351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981994,0.00002455961,0.0005030741,0.00031232412,0.0006740761,0.0002865921],"domain_scores_gemma":[0.9984543,0.00010119327,0.0004794296,0.00021263698,0.0006755843,0.00007685544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009323703,0.00015645835,0.0003013267,0.00015168668,0.0006400223,0.000107244756,0.0010359113,0.000031381787,0.0007465046],"category_scores_gemma":[0.00028428977,0.00012349144,0.00013525045,0.00027996665,0.002396632,0.00020426515,0.00043403855,0.00044599266,0.000024387544],"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.000070908995,0.00015000053,0.000031375617,0.000045114113,0.000011081348,3.535469e-7,0.036311593,0.000022226744,0.02002438,0.93716764,0.0004139169,0.0057514217],"study_design_scores_gemma":[0.00003647941,0.0004669307,0.000029193174,0.00009004345,0.000036072415,0.000005785192,0.029229896,0.0011491034,0.37584436,0.58879614,0.0040997863,0.00021617484],"about_ca_topic_score_codex":0.00062417955,"about_ca_topic_score_gemma":0.00007913906,"teacher_disagreement_score":0.35582,"about_ca_system_score_codex":0.000048442827,"about_ca_system_score_gemma":0.0003171102,"threshold_uncertainty_score":0.883049},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99207175,0.000020872818,0.0050322106,0.0002499992,0.00053864,0.00035929304,0.000011722246,0.0001334445,0.0015820689],"genre_scores_gemma":[0.99910235,0.000005481886,0.00057059206,0.000048689522,0.00008171462,0.000017139324,0.000001446809,0.000021950473,0.00015063857],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99871266,0.00001825404,0.0003530111,0.000276141,0.00037479447,0.00026516474],"domain_scores_gemma":[0.9993641,0.000033097986,0.00018943522,0.00014655449,0.00021874467,0.00004808602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034881127,0.00018484039,0.0001802577,0.00006996814,0.00048293336,0.0000930718,0.000526504,0.0000487601,0.0001448525],"category_scores_gemma":[0.00010660784,0.00015811811,0.00008992775,0.00042818597,0.00011178186,0.00029712138,0.0002776958,0.0005275552,0.000008853898],"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.000090379894,0.000047978167,0.00015140208,0.00009817873,0.000007712915,7.865716e-7,0.0005255564,0.03732893,0.93351746,0.015421453,0.000033217457,0.0127769755],"study_design_scores_gemma":[0.00002152606,0.000069628346,0.00011675114,0.000071691866,0.000008306461,0.000008064176,0.00044051028,0.20699774,0.7775462,0.0145126805,0.00004834342,0.00015852577],"about_ca_topic_score_codex":0.000005333216,"about_ca_topic_score_gemma":0.0000012114964,"teacher_disagreement_score":0.16966881,"about_ca_system_score_codex":0.00011580915,"about_ca_system_score_gemma":0.00002885004,"threshold_uncertainty_score":0.64478695},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99078876,0.0000062015592,0.0023708239,0.00043946458,0.0007534475,0.0003934501,0.000020074734,0.00006527018,0.005162503],"genre_scores_gemma":[0.99875134,0.0000053840804,0.00023053869,0.000071602175,0.000054652224,0.00028899705,9.578129e-7,0.0000119610695,0.0005845629],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99855757,0.000012082569,0.0003430141,0.00032865346,0.0005279726,0.00023073217],"domain_scores_gemma":[0.99945307,0.000055913577,0.00024180382,0.000110554436,0.0000815495,0.0000571066],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00033524973,0.00014734047,0.00012655076,0.00006562575,0.0006521911,0.00006538573,0.00043884866,0.00004512222,0.0009562477],"category_scores_gemma":[0.000119533055,0.00012907387,0.00011924634,0.0002744473,0.00015973274,0.00014313796,0.00019232965,0.00018303767,0.000024762816],"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.00024926735,0.00022625338,0.0014986807,0.000026616774,0.000008715573,1.5614492e-7,0.0011974126,0.007929838,0.731694,0.00955865,0.000046839723,0.24756356],"study_design_scores_gemma":[0.00005395882,0.00027335586,0.002797389,0.000025303201,0.000009414451,0.000001122022,0.0036743921,0.027783146,0.95620173,0.007202227,0.001809031,0.00016892132],"about_ca_topic_score_codex":0.00059541943,"about_ca_topic_score_gemma":0.00009813897,"teacher_disagreement_score":0.24739464,"about_ca_system_score_codex":0.00024106132,"about_ca_system_score_gemma":0.000021531117,"threshold_uncertainty_score":0.999957},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9587101,0.00013075375,0.00080284197,0.0018877793,0.0008768684,0.00043618397,0.000119934695,0.00009791893,0.036937624],"genre_scores_gemma":[0.9989076,0.000015163593,0.000068147216,0.00016550653,0.00006977311,0.00009232064,0.0000023978644,0.00001676822,0.00066230283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983,0.000024958159,0.00078794314,0.00043936737,0.00012981288,0.000317903],"domain_scores_gemma":[0.99877673,0.00008275171,0.00071723043,0.00021440245,0.00015572608,0.00005315312],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013433088,0.00017393904,0.0003633205,0.00017999708,0.00055248186,0.00011531092,0.0008604792,0.00005499081,0.0014938964],"category_scores_gemma":[0.0004820195,0.00016956306,0.00017151223,0.00064462033,0.00021524892,0.00017150583,0.00023612905,0.00038704756,0.00020818133],"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.000070326045,0.0001446111,0.003581889,0.000035340887,0.000022397722,2.9097285e-7,0.0018164474,0.00010283463,0.0027952082,0.9906184,0.00014434177,0.000667899],"study_design_scores_gemma":[0.000055389068,0.0002610942,0.0010512334,0.00009664812,0.000008681746,0.000007658164,0.003152166,0.0065356498,0.0437465,0.9436152,0.0011700938,0.00029970027],"about_ca_topic_score_codex":0.0001742072,"about_ca_topic_score_gemma":0.000009393636,"teacher_disagreement_score":0.04700323,"about_ca_system_score_codex":0.00006119234,"about_ca_system_score_gemma":0.000026242704,"threshold_uncertainty_score":0.99941885},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8192253,0.000009082804,0.00032527692,0.009543824,0.0008685263,0.00076722965,0.000008288224,0.00008291098,0.16916953],"genre_scores_gemma":[0.9948558,0.00003251056,0.00016948106,0.00011884149,0.00007125433,0.00014132672,0.0000014648572,0.00000724084,0.004602032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892455,0.000026000313,0.0003109066,0.00023350069,0.00028190485,0.00022312546],"domain_scores_gemma":[0.99924105,0.000086890366,0.0002860688,0.000063609645,0.00027157643,0.000050810497],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001010549,0.00008513127,0.00011704156,0.00007215362,0.0011671403,0.00012375983,0.00057424745,0.000033443575,0.0010766777],"category_scores_gemma":[0.00029515612,0.000078533245,0.00007555834,0.0002745364,0.0001968394,0.000110736226,0.000099255165,0.00019471525,0.00004101685],"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.00006094552,0.00006403566,0.00032611625,0.000009585275,0.0000056497256,3.0773702e-8,0.0055284775,0.00016608766,0.0041533057,0.9309962,0.000072543655,0.058617055],"study_design_scores_gemma":[0.00010051737,0.00061157293,0.00093393715,0.00008729069,0.000033852037,0.0000022264055,0.41181105,0.035189427,0.02035033,0.46434474,0.06591349,0.0006215626],"about_ca_topic_score_codex":0.00009613884,"about_ca_topic_score_gemma":0.000058178677,"teacher_disagreement_score":0.4666514,"about_ca_system_score_codex":0.00016921195,"about_ca_system_score_gemma":0.00025887424,"threshold_uncertainty_score":0.99983644},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96735483,0.00033737812,0.0018334145,0.0015136029,0.0014794254,0.00053053297,0.00005700442,0.000040485123,0.026853338],"genre_scores_gemma":[0.9987879,0.000016294674,0.000047143152,0.0000363208,0.000053630825,0.000041005766,5.862861e-7,0.000013501999,0.0010036628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983842,0.00002390732,0.0009237808,0.00028527962,0.0001453085,0.00023753935],"domain_scores_gemma":[0.99819946,0.0001834366,0.0012269149,0.00019186754,0.00016549752,0.000032799744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022644103,0.00012820047,0.00028185156,0.00015820503,0.0005546785,0.00006166543,0.00096443255,0.000038268587,0.00018386065],"category_scores_gemma":[0.0010094796,0.00009772618,0.00015618159,0.00076034386,0.00021886194,0.00010319496,0.00024522052,0.0002873083,0.00005332652],"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.000061858016,0.00008782168,0.003893153,0.000027960883,0.000019223431,5.6348767e-8,0.00096935366,0.00025259526,0.001565256,0.9859097,0.00007265266,0.007140381],"study_design_scores_gemma":[0.000118963646,0.0006266811,0.0041181557,0.00016350302,0.000030173354,0.00000800373,0.008676781,0.044938926,0.21808356,0.71776795,0.004878246,0.0005890332],"about_ca_topic_score_codex":0.000118205404,"about_ca_topic_score_gemma":0.00000612549,"teacher_disagreement_score":0.26814172,"about_ca_system_score_codex":0.00007842082,"about_ca_system_score_gemma":0.000019988687,"threshold_uncertainty_score":0.42661944},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63177305,0.00022980012,0.12274087,0.010773825,0.004643054,0.0023173995,0.000011337748,0.0007015337,0.2268091],"genre_scores_gemma":[0.99630266,0.0000035000328,0.0020866825,0.0007075074,0.00008476611,0.00010704305,2.741948e-7,0.0000131111765,0.0006944222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979076,0.00003997348,0.0003916665,0.00058173225,0.0006266989,0.000452331],"domain_scores_gemma":[0.998745,0.00019338848,0.0002596101,0.00034464383,0.00031250782,0.0001448366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068339554,0.00022676338,0.00027013832,0.00017735579,0.0005987402,0.00023295255,0.0031192403,0.000046700872,0.000056564397],"category_scores_gemma":[0.00064518384,0.00017921497,0.00012786608,0.0010114138,0.00010324439,0.0002529581,0.0015691064,0.0004418939,0.00015695045],"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.00004954798,0.000144568,0.00026731336,0.000043585682,0.000012436708,0.0000030509448,0.0056384187,0.0004174586,0.045787506,0.9047647,0.00072834536,0.042143054],"study_design_scores_gemma":[0.000048375066,0.0008663458,0.0005646265,0.00022199776,0.000014391727,0.000020529404,0.0012329353,0.03464479,0.73844904,0.2218897,0.0015781836,0.00046910837],"about_ca_topic_score_codex":0.000028734825,"about_ca_topic_score_gemma":0.000003361897,"teacher_disagreement_score":0.6926615,"about_ca_system_score_codex":0.00009417702,"about_ca_system_score_gemma":0.00011851659,"threshold_uncertainty_score":0.7308175},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021818662,0.000041948566,0.9569534,0.0071943603,0.0007823931,0.0011093473,0.000012177093,0.00020775726,0.011879949],"genre_scores_gemma":[0.98607665,0.000012176298,0.012512884,0.0005003803,0.000074261,0.00026903226,0.0000021466287,0.00001972571,0.00053276797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976968,0.00006856294,0.0005767822,0.00059824163,0.0006377594,0.00042186503],"domain_scores_gemma":[0.9977422,0.0005835372,0.0006978342,0.00023544423,0.0006406165,0.00010041761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010264403,0.00022745135,0.00028764314,0.00015786884,0.0009438396,0.00031359363,0.0017858942,0.00007927692,0.00019847922],"category_scores_gemma":[0.001484658,0.00020101247,0.00016597066,0.0007820723,0.00020968729,0.00032535766,0.00035251866,0.00076236244,0.00003595426],"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.00013940259,0.0001114245,0.00012023538,0.000015250553,0.00001841994,2.1722758e-7,0.0029593362,0.00087839685,0.016818011,0.8966592,0.00009651658,0.08218361],"study_design_scores_gemma":[0.00011842593,0.0007365552,0.00078661117,0.00011916045,0.000022196104,0.000007889247,0.009796239,0.5529114,0.04342377,0.38771796,0.0039524953,0.0004072873],"about_ca_topic_score_codex":0.000013122248,"about_ca_topic_score_gemma":0.0000021108249,"teacher_disagreement_score":0.96425796,"about_ca_system_score_codex":0.000109362765,"about_ca_system_score_gemma":0.00015197984,"threshold_uncertainty_score":0.81970507},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8642784,0.00005106663,0.011435593,0.036697797,0.0013937049,0.0010032245,0.00004929218,0.00014354597,0.0849474],"genre_scores_gemma":[0.9964009,0.0000120083205,0.00020639008,0.0006962045,0.00004249694,0.000077732766,3.9889497e-7,0.0000075429602,0.0025563196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974686,0.000057961228,0.00068024336,0.00043516088,0.0011248833,0.00023318028],"domain_scores_gemma":[0.9980216,0.00052117737,0.0005151722,0.00035130966,0.0005129917,0.000077770565],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017408512,0.0001334082,0.00021501313,0.0001400627,0.0006611683,0.00017170933,0.0021500161,0.000038368566,0.0064385706],"category_scores_gemma":[0.0017292536,0.000093045,0.00016366667,0.0011369028,0.0002345449,0.00016885558,0.00046152377,0.00032525495,0.00024116908],"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.00012326067,0.00011131234,0.00022102827,0.000001984347,0.000006398323,1.0694177e-7,0.0012137906,0.00012466013,0.012731323,0.90739053,0.002988003,0.07508761],"study_design_scores_gemma":[0.000016763554,0.00010513438,0.0000673474,0.0000093603185,0.000007344225,0.0000039293122,0.00644238,0.0024018649,0.28941214,0.6925795,0.008851615,0.00010260404],"about_ca_topic_score_codex":0.000023837534,"about_ca_topic_score_gemma":0.00000755065,"teacher_disagreement_score":0.27668083,"about_ca_system_score_codex":0.000034418274,"about_ca_system_score_gemma":0.00006777581,"threshold_uncertainty_score":0.9944697},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034279518,0.00002999507,0.93941784,0.0045792325,0.0006281236,0.00045926098,0.00001596421,0.00021974366,0.0203703],"genre_scores_gemma":[0.9761463,0.000034129334,0.023226593,0.00018352822,0.000036128695,0.000052902382,0.0000064630717,0.000012527899,0.0003014588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976947,0.000055775647,0.00054510206,0.00061671005,0.00079941645,0.0002883061],"domain_scores_gemma":[0.9983262,0.00013929528,0.0005226446,0.0005141753,0.00041664677,0.00008103239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007638126,0.00020647161,0.00021425834,0.00019710447,0.00060869794,0.00025085255,0.0026984503,0.000058285405,0.00021208997],"category_scores_gemma":[0.00040443262,0.0001676811,0.00008171582,0.0009647928,0.0001236279,0.00046497403,0.0009397044,0.00047545088,0.00006686533],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000893703,0.00013974807,0.00026513948,0.000013159712,0.0000069058774,4.634913e-7,0.00067124586,0.018667987,0.013481253,0.6042979,0.00028551774,0.36208135],"study_design_scores_gemma":[0.00004097471,0.00028909105,0.00039066884,0.00006214186,0.000010404679,0.000012923152,0.00047526023,0.8982022,0.039372202,0.060087156,0.00079925766,0.00025771902],"about_ca_topic_score_codex":0.000063909465,"about_ca_topic_score_gemma":0.000013386211,"teacher_disagreement_score":0.94186676,"about_ca_system_score_codex":0.00007904443,"about_ca_system_score_gemma":0.00009600294,"threshold_uncertainty_score":0.68378365},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48768568,0.000038772603,0.50117195,0.002037569,0.00045049906,0.00055846537,0.0000070155625,0.00017938382,0.007870695],"genre_scores_gemma":[0.9925399,0.0000039242373,0.0069136806,0.00010615301,0.000071024246,0.000113473594,7.721232e-7,0.000017585597,0.00023348775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980992,0.000053302585,0.0004471016,0.00061611563,0.00046940686,0.00031486846],"domain_scores_gemma":[0.9987004,0.0001833568,0.00045307277,0.0003326148,0.00022583258,0.00010474742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074691145,0.00021414971,0.00019936716,0.0002005888,0.001103275,0.0002610757,0.0015006041,0.00004920814,0.00009162783],"category_scores_gemma":[0.0004352316,0.00019196377,0.000080584636,0.0006160505,0.00015220148,0.0002952781,0.0009919889,0.0007432819,0.00005007889],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003891971,0.00016021861,0.0015677762,0.000017666725,0.0000072360504,4.4518853e-7,0.0019777587,0.0005403792,0.053954784,0.7174312,0.000019234096,0.22428443],"study_design_scores_gemma":[0.000054887805,0.0002920445,0.004257427,0.00012224946,0.000014046584,0.000019332294,0.00025037155,0.8827375,0.0340874,0.07776742,0.00011540074,0.00028188698],"about_ca_topic_score_codex":0.00081309216,"about_ca_topic_score_gemma":0.000018712448,"teacher_disagreement_score":0.88219714,"about_ca_system_score_codex":0.00013180941,"about_ca_system_score_gemma":0.00008996032,"threshold_uncertainty_score":0.8485611},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053389102,0.000039258135,0.8866123,0.0068679173,0.0005340345,0.00095649576,0.00001910464,0.00087160897,0.050710205],"genre_scores_gemma":[0.98774534,0.000005638802,0.011173193,0.0002391641,0.000021848473,0.000049885293,8.671546e-7,0.000018008694,0.0007460434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99805677,0.000016778275,0.0003620978,0.0004833233,0.0007867766,0.00029423652],"domain_scores_gemma":[0.99874395,0.000043858367,0.00037832002,0.00032889209,0.00044299653,0.00006197208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033557304,0.0002068437,0.00019112538,0.00015539868,0.00035112377,0.0005482562,0.002524733,0.000037935293,0.00007123298],"category_scores_gemma":[0.00011760964,0.00015457153,0.000068385496,0.0009933867,0.00019452185,0.0010175866,0.0009333263,0.00032280016,0.000022804703],"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.00005364965,0.00015721114,0.00024713395,0.000028780856,0.000010206839,9.995272e-7,0.000742768,0.00010903777,0.017500963,0.94344497,0.0003004715,0.03740378],"study_design_scores_gemma":[0.000026316375,0.0004735898,0.00007685618,0.000094447125,0.000009786992,0.000018067773,0.00048742263,0.022119548,0.52895004,0.44690734,0.0005396799,0.0002969238],"about_ca_topic_score_codex":0.00002129503,"about_ca_topic_score_gemma":0.0000024847845,"teacher_disagreement_score":0.9343563,"about_ca_system_score_codex":0.00011091129,"about_ca_system_score_gemma":0.00014933187,"threshold_uncertainty_score":0.6303244},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9785061,0.00007709101,0.0083212275,0.008312486,0.0006737822,0.0005617694,0.0000035955095,0.000108474036,0.003435498],"genre_scores_gemma":[0.9974577,0.000033037537,0.0021503,0.00021578428,0.000014355711,0.00008286767,5.0411484e-7,0.000006234016,0.000039261893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99788076,0.00006356184,0.00065919914,0.0005631378,0.00042221294,0.00041115534],"domain_scores_gemma":[0.9988729,0.00022612482,0.00028230526,0.00030456297,0.0002723394,0.000041766758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012614065,0.00018537177,0.0003098458,0.00026107716,0.00022264186,0.00011238891,0.0019226605,0.00008820346,0.000068399095],"category_scores_gemma":[0.0014279356,0.00015469553,0.00006537111,0.0015359814,0.00022779293,0.00039637924,0.00075261155,0.00050559774,0.000014120243],"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.00022818874,0.0008179236,0.09263931,0.000087577595,0.0000100210245,0.000008300978,0.008364972,0.0017656916,0.012671613,0.8589971,0.00012735496,0.024281912],"study_design_scores_gemma":[0.00016999777,0.0005607697,0.05053355,0.00023740857,0.000008704479,0.000022288745,0.009337049,0.4070823,0.028832128,0.50228053,0.00033895668,0.00059633824],"about_ca_topic_score_codex":0.0007049848,"about_ca_topic_score_gemma":0.0021853212,"teacher_disagreement_score":0.4053166,"about_ca_system_score_codex":0.00020755736,"about_ca_system_score_gemma":0.00013510132,"threshold_uncertainty_score":0.63083005},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018676905,0.0000037771385,0.97374785,0.0031218044,0.00015852416,0.0008595169,0.000016955024,0.00033358473,0.0030810644],"genre_scores_gemma":[0.95156527,0.0000016936109,0.04734838,0.00012787084,0.000008094979,0.0002458342,0.000008848968,0.000014736559,0.0006792916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983011,0.000019020596,0.00044062646,0.0004109763,0.00053454464,0.00029376487],"domain_scores_gemma":[0.9986869,0.0001073123,0.00047839436,0.0002547491,0.0004313877,0.000041268348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009151863,0.00017675561,0.00019186387,0.00016076895,0.0005974968,0.00021363146,0.002146218,0.000038045182,0.000037174188],"category_scores_gemma":[0.00046200716,0.00016133106,0.00009434195,0.0004468069,0.00010724595,0.0005211039,0.0008577863,0.00027790683,0.0000062504064],"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.00014025289,0.00014704761,0.000028987362,0.00006347041,0.000013037031,2.7749437e-7,0.0014171733,0.07272042,0.029197784,0.84745514,0.00042099803,0.048395406],"study_design_scores_gemma":[0.000025677753,0.00049644377,0.0000022185586,0.000056886605,0.0000062315876,0.000002096853,0.00012082996,0.777064,0.117549285,0.10446996,0.0000698598,0.00013645629],"about_ca_topic_score_codex":0.000008859861,"about_ca_topic_score_gemma":0.0000012577298,"teacher_disagreement_score":0.9328883,"about_ca_system_score_codex":0.00013742717,"about_ca_system_score_gemma":0.00013094212,"threshold_uncertainty_score":0.65788895},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92858106,0.000031364696,0.005890096,0.0064920126,0.0018772071,0.00096827437,0.000022978826,0.0003476635,0.05578935],"genre_scores_gemma":[0.9972267,0.000007678128,0.0013609645,0.00033078497,0.00014536554,0.00013986189,0.000001528491,0.00001325819,0.00077384873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978907,0.00001921246,0.000419085,0.00061514834,0.00064871623,0.00040712798],"domain_scores_gemma":[0.99865836,0.00011619123,0.00028748746,0.00037499538,0.00039957173,0.00016340724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036545482,0.00022921486,0.0002419263,0.00013258254,0.00059026165,0.00038032612,0.0028188252,0.00005736062,0.00053919497],"category_scores_gemma":[0.00038432959,0.00018081997,0.00014290844,0.0008701241,0.0001420543,0.00036440074,0.001081023,0.00044338903,0.0003947094],"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.00007565834,0.00051312806,0.00023898693,0.00001047575,0.000031436382,0.0000021281774,0.01016008,0.000072322146,0.034314293,0.8007307,0.00091347075,0.15293731],"study_design_scores_gemma":[0.000059672024,0.0011820643,0.0011334353,0.00013424037,0.000032691387,0.000020746613,0.008533794,0.007564588,0.5932378,0.376804,0.01061069,0.0006862626],"about_ca_topic_score_codex":0.00045073158,"about_ca_topic_score_gemma":0.00005350577,"teacher_disagreement_score":0.55892354,"about_ca_system_score_codex":0.00010424261,"about_ca_system_score_gemma":0.00020293755,"threshold_uncertainty_score":0.73736244},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9214013,0.00005881882,0.03629955,0.021219969,0.00081995566,0.0010040558,0.0000073298,0.00018604232,0.019002976],"genre_scores_gemma":[0.99452525,0.000007830881,0.0049291663,0.00020642024,0.00009184717,0.000048122474,8.345252e-7,0.000024633699,0.00016589674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959851,0.000108531705,0.000647184,0.00080842467,0.0017220828,0.00072871026],"domain_scores_gemma":[0.9986098,0.00020208946,0.00027865742,0.00043998662,0.00034316513,0.00012630445],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001895329,0.00030196153,0.000380005,0.00040108847,0.00056764495,0.00035027938,0.0044846646,0.000079476784,0.00028542746],"category_scores_gemma":[0.00037779193,0.00026829788,0.00014472616,0.0016096191,0.00022215676,0.00038390688,0.0030246566,0.0021854432,0.000024971565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017688297,0.00039349814,0.0021992903,0.00006206609,0.000022540647,0.000009803995,0.014668128,0.1570646,0.025634004,0.6901922,0.000019595778,0.10955737],"study_design_scores_gemma":[0.00019375779,0.0007921355,0.013530579,0.00032277865,0.000017795503,0.000039837752,0.01049932,0.74468434,0.16831203,0.060625218,0.00010741715,0.00087481976],"about_ca_topic_score_codex":0.00047655514,"about_ca_topic_score_gemma":0.00003379706,"teacher_disagreement_score":0.629567,"about_ca_system_score_codex":0.0002562076,"about_ca_system_score_gemma":0.00025829836,"threshold_uncertainty_score":0.99997693},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16768686,0.00006329122,0.7018859,0.058058843,0.0019140946,0.0028593792,0.000031690895,0.00047685194,0.06702309],"genre_scores_gemma":[0.9967705,0.000010244545,0.002607877,0.00026192734,0.000017769738,0.00006261904,3.9718392e-7,0.0000072126422,0.00026145543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834853,0.000043203025,0.00038481093,0.00034203794,0.0006247143,0.00025668627],"domain_scores_gemma":[0.998619,0.00021113263,0.00039730946,0.00026003452,0.00045184343,0.00006063363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057509245,0.00016035097,0.0001517816,0.000071990886,0.0011169555,0.00029373163,0.0014170522,0.000025335246,0.00018953848],"category_scores_gemma":[0.00019226439,0.00009580156,0.000073255884,0.0006898405,0.00048434388,0.00026576055,0.00037517835,0.0003668867,0.000018501742],"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.000052974392,0.000048691603,0.00026706504,0.0000052966047,0.000014816453,4.238268e-7,0.0014345788,0.0018165617,0.0011935274,0.92993397,0.00007844297,0.06515363],"study_design_scores_gemma":[0.00012815357,0.0009373255,0.0012432024,0.00011583076,0.000030496973,0.00007857928,0.011101927,0.61343175,0.09384478,0.27753153,0.0009846126,0.00057178887],"about_ca_topic_score_codex":0.000022162287,"about_ca_topic_score_gemma":0.00002578782,"teacher_disagreement_score":0.8290836,"about_ca_system_score_codex":0.00007720812,"about_ca_system_score_gemma":0.00022767067,"threshold_uncertainty_score":0.8590832},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.967254,0.00012835638,0.003732606,0.0077156406,0.0006427521,0.0010058014,0.0007933724,0.00011222463,0.01861524],"genre_scores_gemma":[0.9981794,0.000034595083,0.00006906146,0.0011226197,0.000081784034,0.00007028991,0.0000057848792,0.000034998568,0.00040150946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99717176,0.000027806445,0.0013588833,0.0006979301,0.00021381998,0.0005297928],"domain_scores_gemma":[0.997061,0.00047024878,0.0015710075,0.00040750098,0.00015915831,0.00033105825],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017122795,0.000341988,0.0007019873,0.00050339586,0.00043144566,0.00008858411,0.0014065192,0.00011490737,0.0027446428],"category_scores_gemma":[0.0049100863,0.00032092517,0.00040157992,0.0007462022,0.0004857603,0.00022278108,0.0004825894,0.00055588,0.00009782949],"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.0010849673,0.00047811624,0.04328671,0.00023233645,0.00016646384,0.0000016701013,0.00616085,0.045923978,0.0024556832,0.89188796,0.0025082696,0.005813003],"study_design_scores_gemma":[0.0006111671,0.004008862,0.004953436,0.00018595927,0.000054672648,0.000024361358,0.006158634,0.1826125,0.04085438,0.75263083,0.0066141863,0.001291041],"about_ca_topic_score_codex":0.002012864,"about_ca_topic_score_gemma":0.000067363384,"teacher_disagreement_score":0.13925715,"about_ca_system_score_codex":0.0013148031,"about_ca_system_score_gemma":0.0007346582,"threshold_uncertainty_score":0.9999243},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96265715,0.00017237694,0.0138873095,0.0010197066,0.0004261048,0.0012215914,0.00002085191,0.0007874968,0.01980743],"genre_scores_gemma":[0.99648094,0.0000768379,0.0030275886,0.00012180488,0.000044100085,0.00009845877,0.0000011575069,0.00003626407,0.000112869035],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99866927,0.0000120684335,0.00036563375,0.00026358382,0.00036331726,0.00032615016],"domain_scores_gemma":[0.99948025,0.00005537863,0.00012576776,0.00013021105,0.0001490541,0.00005934718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028509047,0.00021237621,0.00025884237,0.00008823329,0.00028687992,0.00006896262,0.00047540705,0.000054191867,0.0002515069],"category_scores_gemma":[0.00005795777,0.00016408645,0.000052788015,0.00054387643,0.00017197205,0.00028283044,0.000105042614,0.0006848108,0.000004632058],"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.0013724815,0.00013910579,0.0012936482,0.0002301484,0.000080923004,0.000004603483,0.0030595628,0.017086446,0.6081794,0.09035713,0.0020547383,0.27614185],"study_design_scores_gemma":[0.00010375656,0.00038579034,0.00016864363,0.00018516537,0.000035930763,0.000028044142,0.001314424,0.19220962,0.7730747,0.031409774,0.00064539065,0.000438792],"about_ca_topic_score_codex":0.000017164066,"about_ca_topic_score_gemma":0.0000066233156,"teacher_disagreement_score":0.27570304,"about_ca_system_score_codex":0.000051275867,"about_ca_system_score_gemma":0.000022694265,"threshold_uncertainty_score":0.6691251},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079512015,0.00009163772,0.9028898,0.0074054855,0.0015036291,0.0017001155,0.000020149884,0.00036758522,0.0065095937],"genre_scores_gemma":[0.97890514,0.000019548046,0.019020908,0.00025896388,0.000057123303,0.00015057191,0.0000035384592,0.000022208616,0.0015620011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997723,0.00005865489,0.00047747578,0.00058319484,0.0007113742,0.00044629522],"domain_scores_gemma":[0.9985419,0.00018640277,0.0005180336,0.00027206773,0.00037587574,0.00010570555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091464305,0.0002521251,0.00029058516,0.00018305785,0.0011795952,0.00034416156,0.0017106008,0.000076727476,0.00004595267],"category_scores_gemma":[0.00052521843,0.00021988867,0.00014735281,0.00067759614,0.0002247543,0.0002635276,0.000870619,0.0006968147,0.0000056748627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052522704,0.00006404671,0.00020047497,0.00003135133,0.00002364291,2.3506037e-7,0.0015525757,0.30441713,0.004970009,0.6866579,0.0004505952,0.0015795212],"study_design_scores_gemma":[0.000105436855,0.00091944647,0.00008183095,0.00006581956,0.000025185385,0.00001100626,0.0008084377,0.94016784,0.024490545,0.030462848,0.0026231618,0.00023841453],"about_ca_topic_score_codex":0.00001879438,"about_ca_topic_score_gemma":4.2420493e-7,"teacher_disagreement_score":0.89939314,"about_ca_system_score_codex":0.00008237784,"about_ca_system_score_gemma":0.00013005268,"threshold_uncertainty_score":0.9072612},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026142685,0.000024138913,0.9595757,0.0035057901,0.00062014506,0.0012868884,0.000016941893,0.00030104446,0.008526659],"genre_scores_gemma":[0.88942754,0.000005139818,0.10928372,0.00042859558,0.00007312124,0.00029867643,8.7435234e-7,0.000016800137,0.0004654986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976817,0.000021066768,0.0005186461,0.0005929428,0.00069046265,0.00049518363],"domain_scores_gemma":[0.9985478,0.00008003751,0.00041027673,0.00039796793,0.0005005616,0.00006337686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008635699,0.00022102159,0.00025176402,0.000109013396,0.00061082264,0.00016983897,0.003185766,0.000047227568,0.00004923288],"category_scores_gemma":[0.00015968445,0.00018827007,0.00017009626,0.00072668574,0.00015494718,0.00015309552,0.0012336227,0.00032518953,0.000012470494],"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.000065681095,0.00014202218,0.000010368175,0.000019274245,0.000009205955,4.4259951e-7,0.0006612646,0.060802028,0.024428416,0.89008033,0.001739778,0.022041164],"study_design_scores_gemma":[0.00001975057,0.00020063143,0.000003144122,0.000040127892,0.0000066725447,0.000004490649,0.00009297633,0.69832665,0.13774605,0.16312574,0.00027453207,0.00015921473],"about_ca_topic_score_codex":0.000012197814,"about_ca_topic_score_gemma":0.0000023640337,"teacher_disagreement_score":0.8632849,"about_ca_system_score_codex":0.00012428347,"about_ca_system_score_gemma":0.0001333921,"threshold_uncertainty_score":0.7677431},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8849552,0.0000228329,0.105969526,0.00039027294,0.00019254447,0.0013041751,0.00072962773,0.00011082792,0.0063249827],"genre_scores_gemma":[0.99773484,0.000011071038,0.001853732,0.000017732356,0.000029171306,0.00012445854,0.00014836004,0.000015275673,0.00006532851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987871,0.0000072044027,0.00045184186,0.00021661514,0.00032607617,0.00021116958],"domain_scores_gemma":[0.99909663,0.00005202712,0.0002314916,0.00014146087,0.00042894218,0.00004943087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004097147,0.0001624372,0.00030911338,0.00014994906,0.00016718432,0.000062701474,0.00040660077,0.000050109848,0.0001304723],"category_scores_gemma":[0.00006206966,0.00012555736,0.00012441602,0.0006831946,0.00010451039,0.0001833541,0.00006376851,0.00020024845,8.005241e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032499544,0.0010089416,0.004075558,0.0010568337,0.000986801,0.0000019633599,0.0063416916,0.1043283,0.019974753,0.6623104,0.0003412314,0.19632353],"study_design_scores_gemma":[0.00011129246,0.00056206284,0.0011344489,0.000071659146,0.00042354144,0.0000022301624,0.0010582035,0.9033474,0.06455974,0.028388806,0.000105123145,0.00023551505],"about_ca_topic_score_codex":0.000034619297,"about_ca_topic_score_gemma":0.000034582838,"teacher_disagreement_score":0.7990191,"about_ca_system_score_codex":0.000060090788,"about_ca_system_score_gemma":0.000038326187,"threshold_uncertainty_score":0.5120081},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6947783,0.00012689548,0.2899028,0.004024602,0.0010129311,0.0008945751,0.000007032699,0.0003103406,0.0089425305],"genre_scores_gemma":[0.98936325,0.0000123683185,0.009641468,0.0002914218,0.00013435356,0.00009161944,0.0000012356692,0.00002440025,0.00043987282],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99707043,0.000039623774,0.000556791,0.00077719125,0.0010531613,0.0005027855],"domain_scores_gemma":[0.9983081,0.00006829525,0.0006203408,0.0003964318,0.0004918418,0.00011496864],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007938362,0.00031434032,0.00031480793,0.00018917491,0.0010025157,0.00049999706,0.0023319656,0.00006407281,0.00012118723],"category_scores_gemma":[0.00018538404,0.00024593092,0.000108320266,0.001180161,0.00019112269,0.00088151987,0.000881904,0.00055371405,0.000033190456],"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.00010563388,0.00021779916,0.00024829936,0.00007265152,0.000035254103,0.0000054254338,0.0049048644,0.005576788,0.625535,0.029228425,0.00023211302,0.33383778],"study_design_scores_gemma":[0.00004421955,0.00029531823,0.00004140847,0.00013337715,0.000015814374,0.000055034536,0.0011558353,0.116750285,0.87152654,0.0095850965,0.00007934584,0.00031771392],"about_ca_topic_score_codex":0.00003463538,"about_ca_topic_score_gemma":0.000011991218,"teacher_disagreement_score":0.33352005,"about_ca_system_score_codex":0.0001571962,"about_ca_system_score_gemma":0.0002298807,"threshold_uncertainty_score":0.9999993},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85581475,0.000026899253,0.09503858,0.017815294,0.0030512586,0.004141946,0.000052870342,0.00025100895,0.023807405],"genre_scores_gemma":[0.9979291,0.0000062541253,0.0008745358,0.00065382535,0.00009063479,0.0002019443,0.0000058784,0.00001089282,0.0002269088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888337,0.0000044816948,0.00035771137,0.00028812897,0.00027829866,0.0001880106],"domain_scores_gemma":[0.99940056,0.00001634311,0.0002246068,0.000110179644,0.00023796395,0.000010358067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005657856,0.00012890875,0.00014683662,0.00012700213,0.00037307103,0.00018006183,0.00040738712,0.000022559972,0.00027146528],"category_scores_gemma":[0.00021700635,0.00011013814,0.000063317995,0.0003039751,0.00007303228,0.0003636525,0.0004326851,0.000106453626,0.000019210298],"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.00042140431,0.00037218115,0.00041349753,0.0005104539,0.000038375896,1.3102725e-7,0.0005921388,0.0010336292,0.0115195885,0.83459914,0.0006811253,0.14981836],"study_design_scores_gemma":[0.0001372892,0.00006755398,0.00042412232,0.00005474343,0.00003504714,9.383581e-7,0.002270374,0.91084,0.0035159988,0.07827647,0.0041321996,0.0002453037],"about_ca_topic_score_codex":0.00010786175,"about_ca_topic_score_gemma":0.00001621505,"teacher_disagreement_score":0.9098063,"about_ca_system_score_codex":0.000025945912,"about_ca_system_score_gemma":0.000009468903,"threshold_uncertainty_score":0.44913033},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9365827,0.00005065767,0.05790274,0.0018443451,0.00045843082,0.00046490584,0.000008709102,0.00015477816,0.002532764],"genre_scores_gemma":[0.966666,0.000021439628,0.0330277,0.00012064647,0.00004798908,0.000037547223,2.94532e-7,0.000016001104,0.00006239805],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980054,0.0000726235,0.00039044837,0.00056957005,0.00059380184,0.00036819564],"domain_scores_gemma":[0.99888265,0.00018716915,0.00032621395,0.00027920242,0.00022907996,0.0000956781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009941878,0.00022614583,0.00028811026,0.00013000781,0.00056925823,0.00024256343,0.0013006151,0.000045894074,0.000048371145],"category_scores_gemma":[0.00024126132,0.00017320245,0.00007947389,0.0005614907,0.00019632146,0.00034227408,0.0005184342,0.00051065173,0.000005672117],"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.0004317851,0.00025818637,0.0018867553,0.00012596083,0.00006939403,0.00001212093,0.013581458,0.0025316258,0.09029058,0.29491457,0.000020945097,0.59587663],"study_design_scores_gemma":[0.0002655622,0.0011949558,0.0030550666,0.0002755439,0.000036046065,0.000095582946,0.005283697,0.1476962,0.708748,0.13234067,0.00016115788,0.00084755354],"about_ca_topic_score_codex":0.00024611823,"about_ca_topic_score_gemma":0.000049527684,"teacher_disagreement_score":0.6184574,"about_ca_system_score_codex":0.00006750757,"about_ca_system_score_gemma":0.0001213639,"threshold_uncertainty_score":0.7062991},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9667402,0.0000043119694,0.0045992024,0.005553434,0.00019624319,0.00076085713,0.000052575673,0.00008617378,0.022007015],"genre_scores_gemma":[0.99688756,0.000005119676,0.0022662566,0.00017698725,0.000027339624,0.00021250157,0.0000015759374,0.000013318897,0.00040934607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985377,0.00005150924,0.0005522668,0.00031807213,0.0003388992,0.00020155155],"domain_scores_gemma":[0.9986951,0.00045331987,0.00029324586,0.00021249262,0.00030182963,0.000044017783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009871795,0.0001308354,0.00020472334,0.00012204738,0.00036520866,0.000059674912,0.00061052217,0.000039871305,0.00066976575],"category_scores_gemma":[0.0010128053,0.00011401738,0.00010234785,0.0006422901,0.000121083176,0.00011048167,0.00019152906,0.00038305594,0.00002666221],"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.00005913192,0.0004195055,0.00035772184,0.000029298722,0.000007694405,1.7677111e-7,0.001247557,0.00020738668,0.02171453,0.9712203,0.00022422108,0.0045124395],"study_design_scores_gemma":[0.000031911062,0.00007157268,0.0004727476,0.000050765044,0.000017347502,0.000005543652,0.0026321681,0.011477116,0.049512476,0.9354038,0.00017444973,0.00015008035],"about_ca_topic_score_codex":0.000036751706,"about_ca_topic_score_gemma":0.000017026321,"teacher_disagreement_score":0.03581651,"about_ca_system_score_codex":0.0001069078,"about_ca_system_score_gemma":0.00007556056,"threshold_uncertainty_score":0.7333465},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5616408,0.000086040964,0.23659909,0.019207256,0.0029227873,0.0015804588,0.00002528779,0.0006658075,0.17727247],"genre_scores_gemma":[0.9943251,0.000011625006,0.0038601055,0.00052117574,0.000045851746,0.000090033835,0.0000014928169,0.000014939162,0.001129695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974538,0.000060144477,0.0006044245,0.00060228544,0.00090154505,0.00037781318],"domain_scores_gemma":[0.9983808,0.00010253783,0.00055135327,0.00039963797,0.00046335522,0.00010233091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011311093,0.00021247425,0.000216661,0.00021993877,0.0008765295,0.0004435498,0.0027965612,0.000056820452,0.00048334684],"category_scores_gemma":[0.00025947654,0.00018424193,0.00016004044,0.0013153872,0.0003008232,0.00048305586,0.000690172,0.0005480375,0.00010096144],"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.00005062058,0.00013139899,0.0005301834,0.000011876713,0.0000095160485,5.4920577e-7,0.0020647508,0.00041969173,0.038975324,0.92551875,0.00017929816,0.03210802],"study_design_scores_gemma":[0.00013387504,0.0005542595,0.00552501,0.000083630584,0.000014804993,0.000027599634,0.006592966,0.16687885,0.12532097,0.6856274,0.008524862,0.0007157576],"about_ca_topic_score_codex":0.000021080408,"about_ca_topic_score_gemma":0.0000029555868,"teacher_disagreement_score":0.43268427,"about_ca_system_score_codex":0.0000968094,"about_ca_system_score_gemma":0.00012905884,"threshold_uncertainty_score":0.7513168},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1216079,0.00002302763,0.85863143,0.010957945,0.00059637177,0.0010097056,0.00005137055,0.00019998215,0.0069222874],"genre_scores_gemma":[0.97751766,0.0000055326136,0.021585107,0.00015664498,0.00004951979,0.00018718636,0.0000015309195,0.0000131120605,0.0004836799],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984345,0.000021173935,0.0003111486,0.00048225193,0.00047178476,0.00027916575],"domain_scores_gemma":[0.9986635,0.00014221822,0.00042030608,0.00024722604,0.00047732692,0.000049408005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045273933,0.00017368105,0.00019281902,0.00009905285,0.0007008317,0.00017878809,0.001555411,0.00003213641,0.00003612587],"category_scores_gemma":[0.00022121194,0.00012987826,0.000075495525,0.00060688093,0.0001710651,0.0003203852,0.00029357072,0.00036083657,0.000006493775],"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.0001599078,0.000093196686,0.000102836035,0.000023435754,0.000012254147,1.09888404e-7,0.0020605596,0.00053376105,0.014553763,0.8570056,0.000061057886,0.1253935],"study_design_scores_gemma":[0.00012625256,0.0013071508,0.0018308047,0.00018696123,0.000024320014,0.000017344886,0.0070339586,0.49931642,0.27015498,0.21586177,0.0035137436,0.0006263017],"about_ca_topic_score_codex":0.00003804187,"about_ca_topic_score_gemma":0.000010369071,"teacher_disagreement_score":0.85590976,"about_ca_system_score_codex":0.00007825723,"about_ca_system_score_gemma":0.00014124635,"threshold_uncertainty_score":0.5390302},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9846549,0.0003596722,0.002512226,0.001889755,0.00031788804,0.00015344167,0.000030890707,0.00001276558,0.010068434],"genre_scores_gemma":[0.9977453,0.00058974023,0.0008490704,0.00021097533,0.00004629336,0.000007287867,0.000002154737,0.0000103308,0.00053889776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877673,0.0000032900512,0.00060851633,0.00035178743,0.000067059154,0.00019261734],"domain_scores_gemma":[0.9992611,0.00003113378,0.00035426652,0.00013497892,0.0001796664,0.000038898983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037536275,0.00012576186,0.0002807725,0.00010233814,0.000079307574,0.0001271599,0.00023895771,0.000080376296,0.00035164887],"category_scores_gemma":[0.00026434488,0.00011784976,0.000058575482,0.00036894548,0.00010664653,0.0001808396,0.00008413378,0.0001713599,0.000027730055],"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.00003600682,0.00005955736,0.021384383,0.00003295595,0.000011323,5.008831e-7,0.0007844011,0.0004569017,0.001004421,0.97400707,0.000039976094,0.002182503],"study_design_scores_gemma":[0.00022338798,0.0001432688,0.03216155,0.00054014823,0.000019753046,0.000013949975,0.0016843382,0.35100573,0.080064155,0.529511,0.003922546,0.0007101863],"about_ca_topic_score_codex":0.00013174144,"about_ca_topic_score_gemma":0.00005344776,"teacher_disagreement_score":0.4444961,"about_ca_system_score_codex":0.00003457231,"about_ca_system_score_gemma":0.00003503435,"threshold_uncertainty_score":0.48057738},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039237965,0.000005588323,0.9441179,0.01139146,0.0001816119,0.0009780194,0.0000054301345,0.00044719537,0.0036348477],"genre_scores_gemma":[0.9779484,0.00000971778,0.021551808,0.00009660074,0.000056982204,0.00007270887,0.000007518787,0.000018139537,0.00023811606],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796146,0.000043642012,0.00039580083,0.00058160047,0.00062129495,0.00039619757],"domain_scores_gemma":[0.9986328,0.00009355116,0.0002907271,0.00037302033,0.000522025,0.00008786559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006144039,0.00022517802,0.00019993597,0.00022550048,0.0004038022,0.00054808334,0.0016576868,0.00007582892,0.000023669261],"category_scores_gemma":[0.00031117923,0.00015117871,0.0000556497,0.0015905155,0.00016478123,0.00052973,0.00035729236,0.00048053553,0.00004437563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013955642,0.000109010936,0.0020782745,0.00015301595,0.000023329167,0.0000016222357,0.0045001293,0.09426767,0.030221593,0.43412903,0.0001343764,0.4342424],"study_design_scores_gemma":[0.000027736372,0.00018342977,0.00047048234,0.00012526153,0.0000059120794,0.000007969348,0.00024755808,0.9123782,0.07692108,0.009412603,0.000036285117,0.00018347395],"about_ca_topic_score_codex":0.000044328404,"about_ca_topic_score_gemma":0.000010522906,"teacher_disagreement_score":0.93871045,"about_ca_system_score_codex":0.000029794739,"about_ca_system_score_gemma":0.000094209136,"threshold_uncertainty_score":0.6164889},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6073118,0.00003275056,0.17427555,0.09912844,0.0010033846,0.0018260407,0.000043121527,0.00022009994,0.11615886],"genre_scores_gemma":[0.99655163,0.000015835194,0.00048556627,0.00018472757,0.00008974833,0.000046911206,1.2672781e-7,0.000008438698,0.002617026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997674,0.000047522954,0.00075013237,0.00042402453,0.0008736414,0.00023070375],"domain_scores_gemma":[0.9964279,0.000925004,0.0007445422,0.0003922231,0.0014551734,0.00005514763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027546342,0.0001368708,0.00016363502,0.00009785328,0.0005286741,0.00027018893,0.0016340436,0.00005604746,0.0005667563],"category_scores_gemma":[0.004063599,0.00005701525,0.000105448846,0.0009852261,0.00055282406,0.0004143203,0.0002026613,0.00015728414,0.00050924363],"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.00003178027,0.000027685684,0.00021452647,0.0000020374596,0.000004203696,2.4705631e-8,0.0007944404,0.000014660514,0.058564126,0.7566206,0.0006456971,0.18308021],"study_design_scores_gemma":[0.00001109678,0.000035086676,0.00022687772,0.00007779479,0.000005967866,0.0000019512318,0.002069435,0.00093473645,0.27744833,0.71766555,0.0014462899,0.00007687849],"about_ca_topic_score_codex":0.000014457452,"about_ca_topic_score_gemma":0.000014021141,"teacher_disagreement_score":0.38923985,"about_ca_system_score_codex":0.00003456227,"about_ca_system_score_gemma":0.0000734266,"threshold_uncertainty_score":0.6545467},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7146682,0.00024665744,0.20999523,0.00814593,0.0011320398,0.00045925102,0.0000078121375,0.00061587105,0.06472897],"genre_scores_gemma":[0.9884552,0.00013686864,0.009473722,0.00025353703,0.00012560897,0.000017890248,0.0000046995565,0.00002495136,0.001507527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9970478,0.00011200723,0.00066610187,0.0008310939,0.000842286,0.00050075207],"domain_scores_gemma":[0.99745995,0.0004462154,0.00058191706,0.00034912195,0.0010018769,0.00016094878],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005945309,0.00031294476,0.0004122028,0.0001406864,0.00053699507,0.0008188283,0.0018525572,0.00014754903,0.0002689113],"category_scores_gemma":[0.0019020855,0.00027643534,0.00017315436,0.0009643205,0.0002597641,0.00057862623,0.0006618166,0.0009276477,0.00017068052],"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.000046212077,0.0001769268,0.0028585785,0.00002988402,0.000045301724,0.0000029092,0.0038973894,0.0010881698,0.16321957,0.7200461,0.00006396619,0.10852501],"study_design_scores_gemma":[0.00009655739,0.0003066227,0.0039786953,0.00057042245,0.000038678576,0.000009654584,0.012772607,0.10398999,0.7442041,0.1285079,0.004834296,0.0006905055],"about_ca_topic_score_codex":0.000101702106,"about_ca_topic_score_gemma":0.000050089708,"teacher_disagreement_score":0.5915382,"about_ca_system_score_codex":0.00005816515,"about_ca_system_score_gemma":0.0002464817,"threshold_uncertainty_score":0.99996877},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.077706516,0.000026627853,0.92037565,0.0010076902,0.0003936789,0.00038434297,0.0000018922998,0.000039931467,0.0000636696],"genre_scores_gemma":[0.9875054,0.000005131232,0.012230745,0.00013821991,0.00007359806,0.00002429242,0.0000049213454,0.000012527336,0.0000051963875],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831957,0.00006028254,0.00048822933,0.00051966705,0.00032099,0.00029129296],"domain_scores_gemma":[0.9982953,0.00017103877,0.00037786688,0.0001664617,0.0009317826,0.000057521553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000606228,0.00018934344,0.00023405587,0.00012960105,0.00022573395,0.00022741545,0.0005193886,0.00011098613,0.000011070821],"category_scores_gemma":[0.0012171994,0.00017395044,0.00008116642,0.0006812179,0.00015424803,0.000402236,0.0001681095,0.00026718152,0.0000011545309],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036979004,0.00023402502,0.005758628,0.00019827853,0.00002259811,0.0000040064697,0.001150155,0.3020527,0.024475425,0.18387707,0.0000073490532,0.48184997],"study_design_scores_gemma":[0.00010778386,0.00008628168,0.00038534106,0.000276872,0.000016814565,0.0000053515005,0.00019033268,0.9408185,0.028008362,0.02992656,0.0000014746121,0.00017631987],"about_ca_topic_score_codex":0.0001268938,"about_ca_topic_score_gemma":0.0002514749,"teacher_disagreement_score":0.90979886,"about_ca_system_score_codex":0.000062161336,"about_ca_system_score_gemma":0.000078852274,"threshold_uncertainty_score":0.70934933},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55833787,0.000007938315,0.03195735,0.0017460879,0.00029836613,0.0006807643,0.000011004074,0.000084533596,0.4068761],"genre_scores_gemma":[0.9960454,0.000005640747,0.0011546912,0.000092578506,0.000040622283,0.000029031138,2.2390537e-7,0.0000086705195,0.0026231492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99805444,0.000032562122,0.0005830003,0.0004190378,0.0007193239,0.00019161102],"domain_scores_gemma":[0.9979473,0.00017586611,0.00057948625,0.00030542078,0.00092274195,0.00006920117],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011994061,0.00014962329,0.00019088178,0.00013957567,0.00025332137,0.0001307046,0.0012031787,0.0000585581,0.0020951994],"category_scores_gemma":[0.00072916824,0.000087445194,0.00008236845,0.0008303203,0.00049731066,0.00039049986,0.00013894711,0.00017167136,0.00032013108],"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.0002723646,0.0001211814,0.002596561,0.0000037860507,0.000009303356,1.2649116e-7,0.0019916,0.0000105962345,0.0039157546,0.95232856,0.00033875208,0.038411383],"study_design_scores_gemma":[0.000016540149,0.00010264927,0.0067219413,0.000050643688,0.000011715355,0.0000032036244,0.004852169,0.0022784835,0.26155046,0.72403264,0.00025487453,0.00012467397],"about_ca_topic_score_codex":0.00002084705,"about_ca_topic_score_gemma":0.00001563597,"teacher_disagreement_score":0.4377075,"about_ca_system_score_codex":0.000019182804,"about_ca_system_score_gemma":0.000042877884,"threshold_uncertainty_score":0.998817},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10074261,0.000011747927,0.893173,0.0032311883,0.00036316807,0.00085771654,0.000020212881,0.000050483573,0.0015498869],"genre_scores_gemma":[0.99677306,0.000031073167,0.0027259951,0.000113235285,0.00006322487,0.00008863713,4.054463e-7,0.000012459704,0.00019191943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997689,0.000031429285,0.0008606298,0.00046377472,0.0006064791,0.00034867],"domain_scores_gemma":[0.9977589,0.00043232366,0.00057174766,0.0003942656,0.0008025002,0.000040218223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001061687,0.00021174378,0.00026566186,0.00017937229,0.00011030068,0.000117518284,0.0024264383,0.00011729088,0.000016605198],"category_scores_gemma":[0.0011037244,0.0001166601,0.0001476522,0.00067718205,0.00032095978,0.0007077575,0.00019641126,0.00016715906,0.000018347559],"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.00007349858,0.000117267075,0.00064277364,0.00002893165,0.00000772597,6.821291e-8,0.0054170084,0.0010613126,0.09109436,0.8164239,0.000063090665,0.085070044],"study_design_scores_gemma":[0.000019285226,0.000091297,0.0001572415,0.00016900952,0.000005591671,7.041544e-7,0.00028973995,0.33986166,0.3387791,0.3205253,0.000017903063,0.00008317592],"about_ca_topic_score_codex":0.000024465147,"about_ca_topic_score_gemma":0.000021360127,"teacher_disagreement_score":0.8960304,"about_ca_system_score_codex":0.00006953504,"about_ca_system_score_gemma":0.00011108484,"threshold_uncertainty_score":0.4757261},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36706322,0.00004867235,0.5464488,0.040202226,0.0031403634,0.0028368642,0.00019958362,0.00014728864,0.03991292],"genre_scores_gemma":[0.9980654,0.000004763609,0.0007627643,0.000041586,0.000112665984,0.00009507991,5.2668486e-7,0.000008913836,0.0009082902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827546,0.000019737121,0.0007506941,0.00042519788,0.00029680622,0.00023212681],"domain_scores_gemma":[0.99679637,0.00075123773,0.0012812662,0.0005059895,0.0005999141,0.00006520278],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0024316544,0.0001424204,0.0002268642,0.00006750972,0.0026166034,0.0012585773,0.0028722712,0.00005879506,0.00006290842],"category_scores_gemma":[0.0009899258,0.000085907726,0.00020327342,0.000087338776,0.00048283313,0.00031667476,0.0002307884,0.00013312303,0.00027726518],"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.00007527063,0.000015085082,0.0000565046,0.000004799314,0.000015298228,1.48899595e-8,0.000114455055,0.0009973884,0.0013283347,0.967933,0.00015009055,0.029309738],"study_design_scores_gemma":[0.000026250807,0.000045577028,0.00016566552,0.00003283367,0.000014072015,0.0000024559665,0.0015039191,0.08444124,0.06880269,0.8443345,0.0005362694,0.00009456667],"about_ca_topic_score_codex":0.000024291034,"about_ca_topic_score_gemma":0.000029042694,"teacher_disagreement_score":0.6310022,"about_ca_system_score_codex":0.00009897393,"about_ca_system_score_gemma":0.00013075513,"threshold_uncertainty_score":0.9997782},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86775386,0.0001722251,0.078902274,0.01505123,0.0032745418,0.0014973704,0.000018555984,0.00054673804,0.032783218],"genre_scores_gemma":[0.993712,0.000018469238,0.004501322,0.00035409207,0.00021005588,0.000030969877,5.623066e-7,0.000025960788,0.0011465369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99633145,0.000049198425,0.0008272731,0.00086399756,0.0012313906,0.00069670466],"domain_scores_gemma":[0.9969113,0.00015048997,0.00038970562,0.0007119905,0.001568577,0.00026793464],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012673736,0.00038658342,0.00039733207,0.00022884742,0.0002867787,0.0011153644,0.0043903356,0.00019621641,0.00002983966],"category_scores_gemma":[0.0011523187,0.0002814541,0.00020186738,0.0013163693,0.00057756266,0.0018629747,0.0011861153,0.00072368473,0.00027598807],"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.000067879046,0.00016122553,0.00031647473,0.00003234718,0.000015414682,0.0000019283166,0.0028655296,0.0002426376,0.09310417,0.8409218,0.0004354048,0.06183518],"study_design_scores_gemma":[0.000020242258,0.00027233962,0.00006665943,0.00015109601,0.000009574369,0.0000105393265,0.0022979716,0.04157766,0.80224,0.15291466,0.0001084641,0.00033079623],"about_ca_topic_score_codex":0.00017755723,"about_ca_topic_score_gemma":0.000024502537,"teacher_disagreement_score":0.70913583,"about_ca_system_score_codex":0.00014093025,"about_ca_system_score_gemma":0.00046235145,"threshold_uncertainty_score":0.99996376},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39359573,0.000026507792,0.6005483,0.0010319098,0.0014254696,0.0008071783,0.000011926106,0.00014276394,0.0024101832],"genre_scores_gemma":[0.9919879,0.000005547718,0.007607359,0.00009125193,0.0001552693,0.00007620364,3.6987723e-7,0.000008634604,0.000067504065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984481,0.000016514205,0.00045913816,0.00032068588,0.00033784204,0.00041776727],"domain_scores_gemma":[0.99879473,0.0001808298,0.00023219231,0.0002450784,0.00043723785,0.000109934634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093668624,0.0001679517,0.00021451554,0.000076830096,0.00021331264,0.00011434018,0.0009818216,0.00009874278,0.000020680087],"category_scores_gemma":[0.0005447047,0.000116179865,0.000106884894,0.00035417738,0.00017683284,0.00057658,0.00013879003,0.00016648883,0.000060385206],"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.000079829406,0.00020487397,0.0020204277,0.00012088441,0.000014502975,4.8851902e-8,0.0016647688,0.000008990596,0.02703782,0.728537,0.00012707216,0.24018374],"study_design_scores_gemma":[0.00005031541,0.00039101252,0.0049690735,0.00011187496,0.00001859581,0.000008947429,0.0003978038,0.045366738,0.85595983,0.09193855,0.0004952653,0.0002920225],"about_ca_topic_score_codex":0.000024408742,"about_ca_topic_score_gemma":0.000006022454,"teacher_disagreement_score":0.828922,"about_ca_system_score_codex":0.000053186453,"about_ca_system_score_gemma":0.000057603553,"threshold_uncertainty_score":0.47376776},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19002219,0.0000842428,0.00028841876,0.004233568,0.001583399,0.00053979777,0.000081548824,0.000059671194,0.80310714],"genre_scores_gemma":[0.96910083,0.000075649084,0.00030189042,0.0002763366,0.00005841669,0.00004824063,6.330016e-7,0.000012586998,0.030125385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99826354,0.0000042720085,0.0007674179,0.000505196,0.00008937197,0.00037022278],"domain_scores_gemma":[0.9987196,0.00004628296,0.0005634494,0.00026547723,0.00031859154,0.00008663466],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0004379637,0.00020943304,0.00041434623,0.00014293182,0.0002246407,0.00030337583,0.0010736965,0.00008238221,0.013981133],"category_scores_gemma":[0.00027634518,0.00017713755,0.00015518873,0.00030807473,0.00054211833,0.00041733222,0.0002886992,0.00020607888,0.019872336],"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.000010090292,0.000081952276,0.0017917958,0.00001882163,0.00002729085,6.293305e-8,0.0009182602,0.0000066291536,0.00076519576,0.97499895,0.018078241,0.0033027024],"study_design_scores_gemma":[0.00007028047,0.00012957567,0.0026065558,0.00013079173,0.000011563705,0.0000018865625,0.0050674197,0.009564209,0.03805826,0.9326426,0.011194818,0.0005220648],"about_ca_topic_score_codex":0.00029346676,"about_ca_topic_score_gemma":0.000008334324,"teacher_disagreement_score":0.77907866,"about_ca_system_score_codex":0.000048280745,"about_ca_system_score_gemma":0.000021804473,"threshold_uncertainty_score":0.98692024},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9185253,0.0000036294084,0.050060492,0.014022369,0.0002625118,0.0007489715,0.00004572319,0.00012055853,0.01621046],"genre_scores_gemma":[0.9983854,0.0000012584215,0.00013606834,0.00071092753,0.000113916714,0.000051263643,0.0000011490102,0.000013315766,0.0005866594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99748796,0.000088346766,0.000607231,0.0005782465,0.0009583546,0.00027985882],"domain_scores_gemma":[0.99732083,0.0008073271,0.00065123674,0.0003334987,0.000776807,0.000110327135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014182946,0.00022562467,0.00032135428,0.000158465,0.0004605526,0.00025716756,0.0007764129,0.00009546231,0.00050931424],"category_scores_gemma":[0.0012897919,0.00013829298,0.000095975476,0.000568186,0.0005218088,0.00022511081,0.000056268957,0.00030872365,0.00018104138],"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.0009415361,0.00012772823,0.0018056848,0.00000468489,0.000041008658,1.2548867e-7,0.002112346,0.015883802,0.025471168,0.9097924,0.00065818505,0.04316133],"study_design_scores_gemma":[0.00013677352,0.00062761916,0.004275992,0.00014606012,0.00004404848,0.00000454158,0.004580963,0.06282015,0.15670094,0.76967007,0.0006579538,0.00033486812],"about_ca_topic_score_codex":0.000090170666,"about_ca_topic_score_gemma":0.0000481657,"teacher_disagreement_score":0.14012231,"about_ca_system_score_codex":0.000053781507,"about_ca_system_score_gemma":0.00008822654,"threshold_uncertainty_score":0.56394243},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12104704,0.000020693458,0.8757023,0.0009818076,0.0005029845,0.00036918838,0.0000044850644,0.00006573284,0.0013057662],"genre_scores_gemma":[0.9697508,0.000008692855,0.029893031,0.00010951645,0.00008471457,0.000018027438,9.232091e-7,0.000010697938,0.00012359093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982246,0.000020018559,0.0005021575,0.00045771603,0.0005240092,0.00027146665],"domain_scores_gemma":[0.9977696,0.00014439847,0.0003968419,0.00028863846,0.0013007325,0.00009977587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007386561,0.00017472928,0.00022584821,0.00019073591,0.00015519201,0.00046550666,0.0012245413,0.00009067891,0.000002528736],"category_scores_gemma":[0.0011523067,0.00013641236,0.00011550422,0.001156409,0.000114728995,0.0011351135,0.0002337905,0.00015751293,0.000011334854],"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.00006498343,0.00008430982,0.00026097073,0.000021808912,0.00001088317,1.15443356e-7,0.0008666352,0.004568912,0.018577736,0.9396913,0.00010297301,0.035749342],"study_design_scores_gemma":[0.000026813394,0.000096049225,0.000024456333,0.00005689044,0.000009888246,0.0000014262474,0.00022348734,0.5437163,0.1862432,0.2694761,0.000014262818,0.00011110958],"about_ca_topic_score_codex":0.00006360384,"about_ca_topic_score_gemma":0.0000032194396,"teacher_disagreement_score":0.84870374,"about_ca_system_score_codex":0.00007876956,"about_ca_system_score_gemma":0.00018049583,"threshold_uncertainty_score":0.55627346},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17089504,0.0002311599,0.81686246,0.0027759066,0.0009207005,0.002041639,0.000029079765,0.002240003,0.004003993],"genre_scores_gemma":[0.8743919,0.000029710172,0.12503894,0.00014503261,0.00006956029,0.00006636593,0.0000046588734,0.000020631713,0.00023318423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99773943,0.00001644284,0.00055155717,0.00068136136,0.00054866995,0.00046250463],"domain_scores_gemma":[0.9981391,0.0001546277,0.00040324783,0.00036723798,0.0008522932,0.00008349719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089897064,0.00026980817,0.0003047631,0.00031771595,0.00043653673,0.00043360554,0.0025004062,0.00014662131,0.0000073966207],"category_scores_gemma":[0.00063389103,0.00019454706,0.00017832895,0.0015292657,0.00025014876,0.00048132733,0.0007790053,0.00035516665,0.000019083693],"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.0001312118,0.00010094588,0.00014059084,0.00016839143,0.000011247676,7.2841823e-7,0.001158144,0.00008373612,0.15156536,0.7566823,0.0002949042,0.089662485],"study_design_scores_gemma":[0.000028159993,0.00011697903,0.000029960507,0.000153896,0.000006148808,0.0000048623056,0.00010725193,0.19567062,0.5260973,0.27756768,0.000039047107,0.00017811655],"about_ca_topic_score_codex":0.00003328416,"about_ca_topic_score_gemma":0.0000017423192,"teacher_disagreement_score":0.7034969,"about_ca_system_score_codex":0.00004070329,"about_ca_system_score_gemma":0.000062612104,"threshold_uncertainty_score":0.79333985},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8688679,0.000025602987,0.09266759,0.01887959,0.0016681759,0.001303879,0.00001547267,0.0005208012,0.016051026],"genre_scores_gemma":[0.9977736,0.000022995104,0.0015292093,0.00016727227,0.00010771899,0.00001817369,0.0000050458443,0.000010305367,0.00036569938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99779236,0.00002738622,0.0005448847,0.00069319713,0.0005849604,0.0003571825],"domain_scores_gemma":[0.99869365,0.00010732297,0.00029358707,0.00065441645,0.00018596137,0.0000650646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093936303,0.00017533284,0.00019540374,0.00024242695,0.00013714713,0.00021805638,0.0032654435,0.000091678296,0.000033760585],"category_scores_gemma":[0.0006459146,0.00014966185,0.000051815492,0.0012977854,0.00012526826,0.0008226498,0.0011862314,0.00027910978,0.00030233982],"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.000118952994,0.00011235948,0.0002480281,0.00005137662,0.0000115438415,0.0000021727337,0.0032343096,0.0018782292,0.019044477,0.7645514,0.00060741964,0.21013972],"study_design_scores_gemma":[0.000072507246,0.00006963546,0.00038998984,0.000380222,0.000007579002,0.000002781169,0.0011607346,0.78087324,0.08783769,0.12869449,0.0002814493,0.00022967428],"about_ca_topic_score_codex":0.00016441412,"about_ca_topic_score_gemma":0.00003695024,"teacher_disagreement_score":0.77899504,"about_ca_system_score_codex":0.00007548733,"about_ca_system_score_gemma":0.00012142678,"threshold_uncertainty_score":0.6103033},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80824417,0.0000047629346,0.1815467,0.0018374716,0.00056231517,0.00055910874,0.0000013602836,0.0003052412,0.0069388575],"genre_scores_gemma":[0.9928456,0.000013453428,0.0064388397,0.0001106918,0.000047078473,0.000011581549,3.35897e-7,0.000017775697,0.0005146569],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975744,0.000028694465,0.00067262055,0.00046664252,0.0007855231,0.00047210132],"domain_scores_gemma":[0.998212,0.00013490835,0.0005060469,0.0003294535,0.0006997765,0.000117835814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092235336,0.00021924649,0.00032636934,0.0003257226,0.00016138154,0.00018848504,0.0021361292,0.00006912412,0.000044886703],"category_scores_gemma":[0.0011381786,0.00018263755,0.00013120225,0.0021147658,0.00019710696,0.00033575765,0.0008671129,0.00035604538,0.00016897319],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003846505,0.00003471047,0.0011840892,0.000066856264,0.00002360191,9.798515e-7,0.005964089,0.47090822,0.11144512,0.38381892,0.00008442326,0.026430506],"study_design_scores_gemma":[0.000023880288,0.0002471151,0.00014794627,0.00027026163,0.000009345761,0.0000019791348,0.00069819577,0.79993725,0.18886964,0.009533662,0.00008797129,0.00017277422],"about_ca_topic_score_codex":0.000045073473,"about_ca_topic_score_gemma":0.0000018054404,"teacher_disagreement_score":0.37428525,"about_ca_system_score_codex":0.00005699352,"about_ca_system_score_gemma":0.00013523451,"threshold_uncertainty_score":0.7447743},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14582004,0.000027689926,0.81909275,0.027647575,0.0007992774,0.0019035457,0.000008868757,0.0026151915,0.0020850408],"genre_scores_gemma":[0.9622319,0.000014389481,0.036511797,0.00010313263,0.000023155326,0.00018046536,0.0000012927512,0.000012597119,0.00092132046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983854,0.0000102040085,0.0004248776,0.00047857384,0.00033151096,0.00036939696],"domain_scores_gemma":[0.99870586,0.00014960674,0.00035629762,0.000274202,0.00046716435,0.000046894947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005864269,0.00018024378,0.00020360721,0.0002649336,0.00032439682,0.0002786772,0.0020002478,0.00009868916,0.000013134642],"category_scores_gemma":[0.0009702646,0.00013963076,0.00010002564,0.0012660598,0.00019406938,0.00032208447,0.00032568988,0.0002459625,0.00013734157],"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.000019857427,0.000108198175,0.00039684883,0.00007352163,0.000010057201,1.7186028e-7,0.00078767317,0.00015302752,0.14870878,0.71176344,0.00033912723,0.13763931],"study_design_scores_gemma":[0.000055109977,0.00013325433,0.00028339535,0.00012338547,0.0000040923287,3.3791062e-7,0.00076490885,0.49582767,0.44178522,0.059933115,0.0009166849,0.00017284723],"about_ca_topic_score_codex":0.000006295232,"about_ca_topic_score_gemma":0.0000018787766,"teacher_disagreement_score":0.8164118,"about_ca_system_score_codex":0.000036705278,"about_ca_system_score_gemma":0.00008537223,"threshold_uncertainty_score":0.56939775},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.531307,0.00005483975,0.067993574,0.35774776,0.003929008,0.002593052,0.00029845277,0.0060848775,0.02999143],"genre_scores_gemma":[0.9713303,0.00009198004,0.02798454,0.00029977877,0.00008037362,0.000032433854,0.000009200569,0.000024888648,0.00014649016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965564,0.000026376067,0.0006281014,0.0012244916,0.0009245385,0.00064011954],"domain_scores_gemma":[0.99054444,0.00029251265,0.00045444173,0.008171908,0.00043109778,0.000105578794],"candidate_categories":["metaresearch","metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":["open_science"],"category_scores_codex":[0.0009920038,0.00032683605,0.00033393558,0.00034108857,0.00029292994,0.00051368546,0.07594156,0.00018258413,0.000048656915],"category_scores_gemma":[0.025465725,0.0002519098,0.000091707065,0.0021722717,0.00046180093,0.0010877816,0.09318361,0.00067341706,0.0010967389],"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.000051679275,0.0002203072,0.00048119534,0.00006595229,0.000040261213,0.0000041084436,0.00037831074,0.00005512287,0.021784654,0.7951048,0.06784079,0.113972805],"study_design_scores_gemma":[0.00002623291,0.00015593645,0.00019615775,0.00026477664,0.0000075867547,0.0000030686965,0.00015254038,0.36585063,0.2032747,0.42878035,0.0010314406,0.0002565881],"about_ca_topic_score_codex":0.00002111301,"about_ca_topic_score_gemma":0.00000422454,"teacher_disagreement_score":0.4400233,"about_ca_system_score_codex":0.00007148709,"about_ca_system_score_gemma":0.00013384747,"threshold_uncertainty_score":0.9999933},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87989575,0.000028545086,0.057874594,0.03091299,0.0009991261,0.0009425808,0.000010962243,0.0012044242,0.028131027],"genre_scores_gemma":[0.99755967,0.000013225988,0.0016866596,0.00016651175,0.000037917922,0.000027705997,0.0000049715964,0.000013907393,0.0004894562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979813,0.000051568008,0.0005027947,0.00055626285,0.00050724804,0.00040081836],"domain_scores_gemma":[0.99871534,0.00020652666,0.0003423408,0.00033315347,0.0003292375,0.000073381576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097401295,0.00020032903,0.000234761,0.00033285626,0.00020503315,0.00027903426,0.00177182,0.000094190334,0.000031204225],"category_scores_gemma":[0.0012301765,0.00016111453,0.0000707473,0.0019267207,0.00016979151,0.00032593907,0.00031497344,0.00052338815,0.00032322775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006350002,0.0002231797,0.0057107625,0.00007259072,0.000007384115,0.0000018024264,0.0016018747,0.0055855513,0.10096126,0.7194287,0.00023243812,0.16611096],"study_design_scores_gemma":[0.00005943537,0.0002162084,0.001260837,0.00023069409,0.0000044699987,0.0000011127078,0.00047046572,0.8738568,0.09238393,0.030466244,0.00081941526,0.00023041343],"about_ca_topic_score_codex":0.00015646774,"about_ca_topic_score_gemma":0.000049515624,"teacher_disagreement_score":0.86827123,"about_ca_system_score_codex":0.00007274436,"about_ca_system_score_gemma":0.00011670487,"threshold_uncertainty_score":0.65700597},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9214576,0.000018030292,0.046195317,0.0053662015,0.0004928393,0.00043255626,0.000012792789,0.00017610147,0.025848582],"genre_scores_gemma":[0.9932734,0.00006015751,0.004746261,0.00011733436,0.00013396537,0.000013257071,7.1838866e-7,0.0000093940625,0.0016455402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816287,0.0000544182,0.00038362067,0.00034636614,0.0007139133,0.00033882665],"domain_scores_gemma":[0.99856186,0.00015596108,0.00026266955,0.00010504623,0.00082095386,0.00009350523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011251927,0.00014966386,0.00021787299,0.00017360205,0.0007726476,0.00013657815,0.00080785196,0.00007743382,0.00016303574],"category_scores_gemma":[0.00082318095,0.000118051445,0.00016345123,0.0016877868,0.00051554583,0.00023975645,0.00021147596,0.00017872528,0.00010099902],"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.000026440755,0.00005370744,0.0004188238,0.0000100764155,0.000024173185,3.1142955e-7,0.009423736,0.029411133,0.024690915,0.91180056,0.00021720599,0.02392291],"study_design_scores_gemma":[0.000007855198,0.000018728988,0.00008057714,0.000042773223,0.000019400857,1.7297938e-7,0.0031534142,0.53672016,0.037102483,0.42265663,0.00007660098,0.000121219506],"about_ca_topic_score_codex":0.00039641533,"about_ca_topic_score_gemma":0.00013456678,"teacher_disagreement_score":0.507309,"about_ca_system_score_codex":0.00007177266,"about_ca_system_score_gemma":0.00026283594,"threshold_uncertainty_score":0.5942659},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08028902,0.000020079375,0.9104862,0.0022681223,0.00055034616,0.00083031337,0.000005200458,0.000716585,0.0048341053],"genre_scores_gemma":[0.99267256,0.000034103916,0.0068880464,0.00008712513,0.000033884025,0.000039149196,0.0000033271217,0.000017238437,0.00022453602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776906,0.000027790074,0.0004911568,0.00072328607,0.00050719135,0.00048150547],"domain_scores_gemma":[0.99847764,0.00014452703,0.00033112135,0.0005716543,0.00039432672,0.00008076166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076101726,0.00023119053,0.00025866364,0.0002565682,0.0001781479,0.00024136266,0.0035173784,0.00006904681,0.000033848333],"category_scores_gemma":[0.00037237722,0.00017501347,0.000039243067,0.0024488422,0.00023471485,0.00076600764,0.0010900652,0.0004573332,0.00004256096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009707829,0.000116772244,0.006169556,0.000034534227,0.000017979117,0.0000048623124,0.001545812,0.29201,0.0043244422,0.667458,0.0003618806,0.027859058],"study_design_scores_gemma":[0.000036374237,0.00014491353,0.00023683679,0.00016237255,0.000005416391,0.000005527491,0.00033099088,0.9607296,0.025806088,0.012325634,0.000014677048,0.00020159925],"about_ca_topic_score_codex":0.000068245456,"about_ca_topic_score_gemma":0.0000240238,"teacher_disagreement_score":0.91238356,"about_ca_system_score_codex":0.000036408917,"about_ca_system_score_gemma":0.00006983738,"threshold_uncertainty_score":0.7136842},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7442043,0.000049264498,0.19421105,0.014804922,0.0028495765,0.0021940386,0.000010811579,0.0018361297,0.039839912],"genre_scores_gemma":[0.99794704,0.00007710137,0.00088122045,0.00026070408,0.00006543646,0.000040835283,0.0000011136566,0.000017148783,0.0007094091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978957,0.000031669457,0.00043713165,0.0005796561,0.00057894795,0.00047689432],"domain_scores_gemma":[0.99858713,0.00026300075,0.00039923744,0.00022551416,0.00043161437,0.000093494375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042029933,0.00024233517,0.00024309094,0.00025550186,0.00037087445,0.00022082313,0.0014117033,0.0000844712,0.00003153111],"category_scores_gemma":[0.00044616376,0.00018839428,0.00013155027,0.0019788938,0.00022380144,0.0005499142,0.00028886626,0.0005382906,0.00026186518],"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.00009572519,0.00006117134,0.0002844968,0.000015797626,0.000015652244,0.0000015509784,0.0007982133,0.008028104,0.02900827,0.8832076,0.00029980246,0.07818359],"study_design_scores_gemma":[0.000065681445,0.00059736974,0.0010342877,0.00026320602,0.00001037699,0.0000027240674,0.00088696636,0.21718973,0.39196354,0.38750672,0.00016153647,0.0003178723],"about_ca_topic_score_codex":0.000013357408,"about_ca_topic_score_gemma":0.0000037433858,"teacher_disagreement_score":0.4957009,"about_ca_system_score_codex":0.000042760952,"about_ca_system_score_gemma":0.00004196818,"threshold_uncertainty_score":0.7682496},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94575745,0.00016660521,0.019771678,0.012658309,0.0018622815,0.0012044614,0.000015080872,0.001104609,0.017459508],"genre_scores_gemma":[0.9976743,0.00040864345,0.0010171643,0.00028899504,0.00009111889,0.00003819023,8.057995e-7,0.000018483513,0.00046232913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99773335,0.000036550413,0.00045537922,0.0007133953,0.00058382296,0.00047752133],"domain_scores_gemma":[0.99846816,0.00041588847,0.00034217208,0.00020752601,0.00043751244,0.00012871085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043229663,0.00029640645,0.00031828764,0.00028841017,0.0004330738,0.00022531005,0.0011252698,0.00011600359,0.000024671426],"category_scores_gemma":[0.00051081256,0.0002296922,0.00012977183,0.0016985092,0.00038290696,0.00046111713,0.0003715755,0.00063613633,0.000079022655],"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.00020183946,0.000108329776,0.0027807693,0.00003533643,0.000042697473,0.0000034159316,0.0011316382,0.0028133364,0.032347202,0.84562945,0.000491681,0.11441428],"study_design_scores_gemma":[0.00013480203,0.00095447915,0.0056258133,0.00069546455,0.000026259977,0.0000180159,0.0011477841,0.28503165,0.34300154,0.3614338,0.0012425814,0.0006878064],"about_ca_topic_score_codex":0.000016930839,"about_ca_topic_score_gemma":0.000011892113,"teacher_disagreement_score":0.48419565,"about_ca_system_score_codex":0.000031615833,"about_ca_system_score_gemma":0.000046853365,"threshold_uncertainty_score":0.9366576},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31898585,0.00006619797,0.63844097,0.023587324,0.0010687629,0.0011015785,0.00006810632,0.0013563441,0.015324869],"genre_scores_gemma":[0.9748106,0.00003256602,0.023683941,0.0005808224,0.00013138352,0.00005881586,0.000013140846,0.00004393395,0.00064480293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964621,0.00007505976,0.00071592565,0.001116923,0.0009562342,0.0006737443],"domain_scores_gemma":[0.99739915,0.00040583644,0.00068764994,0.00066199986,0.00065227627,0.00019307046],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010665613,0.0004455876,0.00045691605,0.00029828283,0.0005573501,0.00057992066,0.002613412,0.00020600767,0.0000452543],"category_scores_gemma":[0.0004963296,0.00033549182,0.0000849524,0.001782856,0.0004048316,0.0010397277,0.00061168236,0.00095686316,0.0002566156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002520896,0.00029205912,0.00066941243,0.000051395866,0.00009536206,0.00000531658,0.010066883,0.0010307442,0.06672517,0.7229439,0.00044562374,0.19742201],"study_design_scores_gemma":[0.00019754404,0.0003657974,0.001619259,0.00048484164,0.000044181692,0.000006253431,0.0035477974,0.87890214,0.026090547,0.08797271,0.00021503726,0.00055386557],"about_ca_topic_score_codex":0.00047904992,"about_ca_topic_score_gemma":0.00012694807,"teacher_disagreement_score":0.8778714,"about_ca_system_score_codex":0.000093640025,"about_ca_system_score_gemma":0.00027354542,"threshold_uncertainty_score":0.9999097},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29336977,0.000022313608,0.6853404,0.010397216,0.0017230611,0.0018427848,0.000017456941,0.0006900842,0.006596903],"genre_scores_gemma":[0.98307353,0.00006538949,0.015758896,0.00017284842,0.00012912939,0.00022282946,0.0000024120175,0.000026992935,0.0005479455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.996855,0.000021655327,0.0008635336,0.0008356633,0.00074776885,0.0006763698],"domain_scores_gemma":[0.9969512,0.00057567767,0.00047493007,0.0006109008,0.0012419434,0.00014532606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013059756,0.0003053209,0.00032967477,0.00033390216,0.00047375294,0.000475739,0.003349914,0.0001629949,0.00003495189],"category_scores_gemma":[0.0017074831,0.00024038677,0.00024740954,0.002229513,0.00030624922,0.00078758074,0.0005398923,0.0002769271,0.00059945526],"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.00007504644,0.00009933672,0.000080062055,0.000028669989,0.000010201563,4.307284e-7,0.00087670825,0.00048412342,0.047099207,0.79224443,0.0011434836,0.15785833],"study_design_scores_gemma":[0.000019252317,0.0001951922,0.00022844748,0.00011120441,0.000007655627,0.0000017578955,0.0008419583,0.3518049,0.3851126,0.26090518,0.0005676112,0.00020422191],"about_ca_topic_score_codex":0.000022657894,"about_ca_topic_score_gemma":0.00001538528,"teacher_disagreement_score":0.68970376,"about_ca_system_score_codex":0.0000875742,"about_ca_system_score_gemma":0.00013604051,"threshold_uncertainty_score":0.9802688},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43924543,0.000028066737,0.5102121,0.03411925,0.002350997,0.001918006,0.000011319227,0.0016704416,0.01044434],"genre_scores_gemma":[0.98994446,0.00002172411,0.009124836,0.00044725812,0.00007308658,0.000069517504,9.259447e-7,0.000021165462,0.00029703663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99736273,0.00002907092,0.00067429786,0.0007662321,0.0006172718,0.00055036676],"domain_scores_gemma":[0.9981032,0.00017695833,0.00042221582,0.0005477076,0.0005887671,0.00016114335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006416121,0.00028253192,0.00028186262,0.0004551491,0.0003151405,0.00026892932,0.002778788,0.0001111928,0.000016730755],"category_scores_gemma":[0.00055396854,0.00022509335,0.00018962474,0.0042478708,0.00023157867,0.00058275176,0.000713605,0.0004019861,0.00016265793],"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.000033559358,0.000042132604,0.00038618676,0.000019563366,0.000010751917,6.4726345e-7,0.00092089747,0.0003559449,0.12204998,0.7956663,0.00074255955,0.07977149],"study_design_scores_gemma":[0.000023418352,0.00020469037,0.0017010142,0.0003011042,0.000007851492,0.0000037387153,0.00057106314,0.13060969,0.26204556,0.60403025,0.0001759131,0.0003257308],"about_ca_topic_score_codex":0.000015784244,"about_ca_topic_score_gemma":0.000011831991,"teacher_disagreement_score":0.550699,"about_ca_system_score_codex":0.0000403819,"about_ca_system_score_gemma":0.00004197492,"threshold_uncertainty_score":0.917904},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97439253,0.000024525452,0.01974801,0.0016535483,0.0004123734,0.00049034343,0.00001965451,0.00007471758,0.003184305],"genre_scores_gemma":[0.9990137,0.000042686686,0.00030896993,0.000034179393,0.00021256848,0.00005701148,0.0000034621603,0.000014869395,0.00031250351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989069,0.000007411424,0.00033435214,0.00029900495,0.00017005489,0.00028226725],"domain_scores_gemma":[0.9993361,0.00007132103,0.00015004528,0.00009665135,0.00028177444,0.00006408403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025357038,0.00016107791,0.00019568451,0.000076872835,0.00025630923,0.000087816865,0.00027545844,0.000045908404,0.00004042048],"category_scores_gemma":[0.000038829683,0.00012325993,0.00009156056,0.00035845884,0.00008426501,0.00012753745,0.00009443048,0.00016368719,0.000016400476],"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.000157881,0.0000634243,0.0007084333,0.000099319244,0.000042803455,8.29023e-8,0.0012599827,0.05825913,0.033768483,0.7888234,0.00060124166,0.116215795],"study_design_scores_gemma":[0.00002530457,0.00003833386,0.0000064555566,0.00010479019,0.000015138901,5.702697e-7,0.0012426202,0.8050587,0.047695484,0.14563808,0.000052924774,0.00012160475],"about_ca_topic_score_codex":0.00005431587,"about_ca_topic_score_gemma":0.0000022516915,"teacher_disagreement_score":0.7467996,"about_ca_system_score_codex":0.0000141923765,"about_ca_system_score_gemma":0.00003134809,"threshold_uncertainty_score":0.5026394},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9184599,0.0001183891,0.03621808,0.034298196,0.0007301562,0.0018245159,0.000027761778,0.0003908153,0.007932212],"genre_scores_gemma":[0.99820274,0.0002609326,0.0006902185,0.0004793606,0.00006445441,0.000033849254,4.5271148e-7,0.000017144683,0.00025084664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970674,0.000051544772,0.0007275185,0.00062379945,0.0009182186,0.00061152736],"domain_scores_gemma":[0.9972744,0.00022688828,0.000392239,0.0005148717,0.0013582802,0.00023331358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017400641,0.00025459277,0.00031058455,0.00042102532,0.0005111999,0.0005180555,0.0027894115,0.00009528201,0.000010763491],"category_scores_gemma":[0.0016873194,0.00017155227,0.00009512713,0.0031011128,0.0004558829,0.00048080398,0.0010038199,0.00029187577,0.00004594006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045351793,0.00014746764,0.0002918963,0.000043609423,0.000012089241,2.478488e-7,0.01143977,0.0010173148,0.0138655985,0.66977215,0.0001419703,0.30322257],"study_design_scores_gemma":[0.000085464,0.00085021864,0.00090681197,0.00041408284,0.000013614334,0.000005891722,0.008536388,0.8101697,0.12905842,0.047835853,0.0016270215,0.0004965565],"about_ca_topic_score_codex":0.000110094785,"about_ca_topic_score_gemma":0.000021413143,"teacher_disagreement_score":0.80915236,"about_ca_system_score_codex":0.000051631607,"about_ca_system_score_gemma":0.0003447621,"threshold_uncertainty_score":0.6995698},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84473085,0.000034369725,0.0007133229,0.0026448239,0.0009689477,0.00028396648,0.00004073869,0.00019316479,0.15038979],"genre_scores_gemma":[0.9975351,0.000019660856,0.00006569803,0.00008388338,0.00010765369,0.000030055498,0.000001372288,0.000017009259,0.002139569],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852127,0.000007740454,0.00069482066,0.00036089637,0.000090155605,0.00032514692],"domain_scores_gemma":[0.99905515,0.00006873173,0.0004895295,0.00018691286,0.00014085812,0.000058836114],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011413845,0.00014842929,0.00028699334,0.00019059495,0.00021543076,0.00013562791,0.0006401255,0.00008301181,0.00036998204],"category_scores_gemma":[0.00044587324,0.00013355837,0.00012999766,0.00080640777,0.00018985599,0.00019898728,0.00011813826,0.00020368029,0.0026941074],"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.000019957917,0.000034145694,0.0032121537,0.000032260363,0.000015197043,2.2552044e-7,0.0011238534,0.00005593216,0.0018687281,0.99184954,0.00028249607,0.0015055157],"study_design_scores_gemma":[0.000026502557,0.00010899138,0.0016999395,0.00017427027,0.000005877322,0.0000019011782,0.0014340983,0.009753555,0.06289707,0.922522,0.0011502443,0.00022552807],"about_ca_topic_score_codex":0.000051916802,"about_ca_topic_score_gemma":0.00000466472,"teacher_disagreement_score":0.15280423,"about_ca_system_score_codex":0.000029991703,"about_ca_system_score_gemma":0.000015414409,"threshold_uncertainty_score":0.9980824},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75180674,0.000025722871,0.24161795,0.0032391455,0.0011114582,0.0010694403,0.000047539765,0.00035355642,0.000728448],"genre_scores_gemma":[0.99673754,0.000025948157,0.0013656146,0.000053651882,0.00008931155,0.000033258886,0.000007078525,0.000034447043,0.0016531537],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994455,0.000085149026,0.0012375778,0.0008966473,0.0025694703,0.0007561987],"domain_scores_gemma":[0.9954524,0.00072501804,0.00067213894,0.00040218452,0.002493884,0.00025436172],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0024123746,0.00035241697,0.00049777166,0.00073570857,0.00049047853,0.0004770725,0.00259157,0.00013152706,0.00034586745],"category_scores_gemma":[0.0092041455,0.00023368523,0.0002276028,0.003953778,0.00071435195,0.00042722494,0.0007413324,0.0008963033,0.001051249],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006679757,0.0006267925,0.0014523668,0.000058157017,0.00008978741,0.000015412139,0.0036962342,0.09828399,0.13036458,0.051120568,0.00088719174,0.71273696],"study_design_scores_gemma":[0.000057583246,0.00037027075,0.0008562168,0.00027640205,0.000019265206,0.000011269907,0.0033256463,0.73367983,0.12023414,0.14063537,0.00020266601,0.00033133445],"about_ca_topic_score_codex":0.0000734639,"about_ca_topic_score_gemma":0.000041613555,"teacher_disagreement_score":0.7124056,"about_ca_system_score_codex":0.00015837824,"about_ca_system_score_gemma":0.00020023828,"threshold_uncertainty_score":0.99972653},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9748501,0.00002195433,0.00026619987,0.001950354,0.00054876116,0.00024793722,0.000036800455,0.00007845287,0.021999419],"genre_scores_gemma":[0.99861115,0.000030799187,0.00006282236,0.00009139877,0.00008108271,0.000018156072,0.0000018759514,0.000018594876,0.0010840932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983527,0.000010386953,0.00083661795,0.00038174583,0.00008537835,0.00033318883],"domain_scores_gemma":[0.99912864,0.00008950863,0.00046178023,0.00018074682,0.00009358937,0.00004574667],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012800804,0.00016081872,0.00036322005,0.00030436157,0.0000949432,0.00009022905,0.00077029853,0.000097762524,0.00012084057],"category_scores_gemma":[0.00043211575,0.00014518412,0.00010333949,0.00096537464,0.00013497676,0.00017667234,0.00015309658,0.0002953548,0.0008300901],"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.000032228483,0.00008574831,0.0050861966,0.00006014178,0.0000075795256,5.120016e-7,0.0016666406,0.0002166165,0.0022127267,0.9881997,0.000054603606,0.0023773068],"study_design_scores_gemma":[0.00003865552,0.00006195322,0.0043734494,0.00030474394,0.0000024453113,0.0000016361944,0.0032250367,0.015909163,0.016539708,0.9590526,0.00026880862,0.00022175576],"about_ca_topic_score_codex":0.00018172005,"about_ca_topic_score_gemma":0.000049270333,"teacher_disagreement_score":0.029147055,"about_ca_system_score_codex":0.000048512855,"about_ca_system_score_gemma":0.000018130537,"threshold_uncertainty_score":0.9999479},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80480295,0.00012834427,0.17733714,0.013231172,0.00071962754,0.0011369968,0.000009239127,0.00022074752,0.0024137625],"genre_scores_gemma":[0.9970692,0.000197427,0.002497649,0.0000793705,0.00003591706,0.000027876831,2.0081008e-7,0.000006301104,0.00008606865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888873,0.0000086880955,0.0002566854,0.00034843214,0.00025269305,0.00024479514],"domain_scores_gemma":[0.9990467,0.0003176198,0.00013254491,0.00016960077,0.00028060994,0.000052930794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008440565,0.00011537758,0.0001255929,0.0000875459,0.0003363137,0.00028101262,0.0006693725,0.000053383843,0.000005128107],"category_scores_gemma":[0.00026573264,0.000076020486,0.00004229076,0.00036394093,0.00038062193,0.00023641372,0.00025850144,0.00019634957,0.000006967298],"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.000012878736,0.0000078653065,0.00030083657,0.000024877376,0.0000074344366,1.32634e-7,0.0008315272,0.000056326135,0.008181552,0.7530135,0.0000289896,0.23753408],"study_design_scores_gemma":[0.000040541396,0.00010487717,0.001955584,0.00017434802,0.000013920906,0.000015690885,0.0019945402,0.6477664,0.14070484,0.2069593,0.00010514819,0.00016477308],"about_ca_topic_score_codex":0.00005003478,"about_ca_topic_score_gemma":0.000006978863,"teacher_disagreement_score":0.6477101,"about_ca_system_score_codex":0.000011801399,"about_ca_system_score_gemma":0.00004620208,"threshold_uncertainty_score":0.31000254},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9837098,0.000011397537,0.0072078686,0.0039184904,0.00061301846,0.0007676231,0.0000030888148,0.00013917778,0.00362951],"genre_scores_gemma":[0.9983247,0.000031566502,0.0008357949,0.00036363938,0.0001748895,0.000053134725,0.000011182013,0.000013790559,0.0001913215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836326,0.000007301482,0.00056476553,0.00039323015,0.00033650576,0.00033493078],"domain_scores_gemma":[0.9993264,0.000008199042,0.00015474966,0.00012814268,0.00036119204,0.000021323018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075725815,0.00020153279,0.00021290968,0.00025662463,0.00015720133,0.00029900618,0.00040563688,0.000068333866,0.00014469678],"category_scores_gemma":[0.000216593,0.00016755077,0.00006594929,0.00083205977,0.0001760657,0.0005062964,0.00039657703,0.00015802926,0.00016722115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003758581,0.0005908,0.007034316,0.0008980935,0.00006506479,0.0000036100919,0.0012341765,0.028947677,0.061832115,0.55101264,0.0016803846,0.34632528],"study_design_scores_gemma":[0.000103538674,0.000024619609,0.0006322013,0.0001402204,0.000015844775,8.4783113e-7,0.0010905259,0.9864822,0.0062927436,0.00316465,0.0018290152,0.0002236152],"about_ca_topic_score_codex":0.0005123798,"about_ca_topic_score_gemma":0.00059173134,"teacher_disagreement_score":0.9575345,"about_ca_system_score_codex":0.000038692713,"about_ca_system_score_gemma":0.0000180078,"threshold_uncertainty_score":0.68325216},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056312937,0.00002489777,0.93759096,0.0037791482,0.0008374447,0.00056409184,0.000018212915,0.00044954938,0.000422745],"genre_scores_gemma":[0.99235755,0.000076834294,0.007084885,0.00011994457,0.000097298245,0.00006063432,0.000006033784,0.00001592146,0.00018089268],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972558,0.000027517524,0.00055855437,0.00086557056,0.0008580949,0.000434435],"domain_scores_gemma":[0.99812764,0.00020622757,0.00036632136,0.00065633387,0.0005117935,0.00013168027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013959813,0.00020980342,0.00032222946,0.00040328273,0.00033615073,0.00023591374,0.0046220585,0.00014033008,0.000049055598],"category_scores_gemma":[0.0013925206,0.00016807932,0.00021436666,0.0029677178,0.00023225638,0.00042660173,0.0012669798,0.00035979686,0.00006959046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002185339,0.0003468643,0.0024912078,0.00018174562,0.0007271791,0.0000047386784,0.0027515418,0.013436509,0.017638206,0.3702981,0.00086268975,0.5910427],"study_design_scores_gemma":[0.000032395285,0.00013360534,0.0001926287,0.00005412369,0.00006438495,0.0000034328118,0.00016084364,0.8962643,0.08044985,0.022282733,0.00018456718,0.00017714678],"about_ca_topic_score_codex":0.000067695284,"about_ca_topic_score_gemma":0.00009094752,"teacher_disagreement_score":0.93604463,"about_ca_system_score_codex":0.000045667173,"about_ca_system_score_gemma":0.0001360656,"threshold_uncertainty_score":0.85890114},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013885499,0.000004568438,0.9710676,0.0021800718,0.00076122273,0.00055779103,2.5331147e-7,0.00052980665,0.011013205],"genre_scores_gemma":[0.9934386,0.000051784507,0.0023597085,0.00015659501,0.00008464202,0.00003710558,0.0000014470238,0.00002173315,0.003848389],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975906,0.000024575667,0.0005535978,0.0005091121,0.0007793089,0.0005427827],"domain_scores_gemma":[0.9982592,0.00011501106,0.00054402853,0.00034892705,0.0006230652,0.00010976811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053514953,0.00027589148,0.00025418625,0.00038004483,0.00041489973,0.00035741032,0.0017288275,0.0000934659,0.000028879647],"category_scores_gemma":[0.0007938605,0.00020295392,0.00009918239,0.0020878382,0.0002273838,0.000511422,0.0005397301,0.0005300157,0.0003729894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000555641,0.00004277975,0.0008220025,0.000037760037,0.000027794133,0.0000010789593,0.002780319,0.67854685,0.011013279,0.27456403,0.00013776321,0.031970788],"study_design_scores_gemma":[0.00004972408,0.00045495125,0.00041698376,0.00018750016,0.0000096776275,0.0000057214634,0.00076413306,0.89911497,0.09645052,0.0020953622,0.00021788785,0.00023258443],"about_ca_topic_score_codex":0.000089540954,"about_ca_topic_score_gemma":0.000008455007,"teacher_disagreement_score":0.9795531,"about_ca_system_score_codex":0.00012295935,"about_ca_system_score_gemma":0.00016331846,"threshold_uncertainty_score":0.82762206},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021278877,0.000002783071,0.9744536,0.0019584224,0.00011352532,0.00032250583,0.00001052328,0.00042907352,0.0014306639],"genre_scores_gemma":[0.97079426,0.000011824815,0.028887765,0.00003823964,0.00005323654,0.00011502486,0.00000231577,0.000007794573,0.00008955609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882555,0.000008652953,0.00028828395,0.0003541025,0.00027742024,0.00024599404],"domain_scores_gemma":[0.9988685,0.00011679561,0.000271662,0.00026591722,0.0004144706,0.00006259988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025759297,0.00013975694,0.00013855328,0.0000857084,0.00041695926,0.00015284207,0.0010420553,0.00006209277,0.000014470826],"category_scores_gemma":[0.00019568558,0.00009072348,0.00006041248,0.0014617804,0.00019039623,0.0002598462,0.00030142057,0.0002276246,0.000025534793],"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.000022776348,0.000056615427,0.00027863638,0.000011255541,0.000008972696,2.0751284e-7,0.00035026728,0.0024531921,0.0023800174,0.9337297,0.00044319607,0.060265172],"study_design_scores_gemma":[0.000009745626,0.00015005124,0.00032952137,0.00016270952,0.0000061319934,0.000002642906,0.00015593493,0.7716027,0.0940927,0.13331306,0.00006861834,0.000106173415],"about_ca_topic_score_codex":0.00003391085,"about_ca_topic_score_gemma":0.0000032346484,"teacher_disagreement_score":0.94951534,"about_ca_system_score_codex":0.000033506178,"about_ca_system_score_gemma":0.00004690356,"threshold_uncertainty_score":0.3699596},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9429302,0.00002513109,0.0007991739,0.0019133309,0.00044275957,0.00034556567,0.000026014233,0.00017381593,0.053343985],"genre_scores_gemma":[0.9968644,0.000013573474,0.000117538744,0.00009106306,0.000076929704,0.000028002276,9.943706e-7,0.000022054463,0.0027854766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984331,0.000009026898,0.00066143577,0.00042208392,0.000111701134,0.0003626233],"domain_scores_gemma":[0.9987817,0.00009813087,0.0005956449,0.00019447405,0.0002719938,0.00005808857],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010251217,0.00019637175,0.00036967197,0.00020974618,0.00019286017,0.00014110607,0.00073523,0.00007957793,0.00013380297],"category_scores_gemma":[0.0005474016,0.00015136224,0.000091790884,0.0007832854,0.00030158146,0.00020739283,0.00014967169,0.00026067538,0.0009946395],"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.0000663658,0.00003232794,0.0048098676,0.00006617924,0.000020967775,3.8754519e-7,0.0016282621,0.000078538935,0.0013693253,0.99033314,0.00015989761,0.0014347212],"study_design_scores_gemma":[0.00008093483,0.0004892786,0.0046062446,0.001036772,0.000016388698,0.000012021078,0.007266385,0.030099515,0.13092008,0.82415193,0.00067333895,0.0006471022],"about_ca_topic_score_codex":0.00007602973,"about_ca_topic_score_gemma":0.000013319927,"teacher_disagreement_score":0.16618122,"about_ca_system_score_codex":0.0000328107,"about_ca_system_score_gemma":0.000023891263,"threshold_uncertainty_score":0.9997832},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40365124,0.00006545796,0.5698628,0.011199696,0.0021009278,0.0044876435,0.000051865063,0.0015668971,0.007013491],"genre_scores_gemma":[0.99571323,0.00002041022,0.0036149442,0.000062096784,0.00007334298,0.000106439365,0.000004626696,0.000018098759,0.00038682512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984016,0.00003177116,0.00042400951,0.00044896815,0.00037650514,0.00031717506],"domain_scores_gemma":[0.99862045,0.00013095047,0.00041592124,0.00018631684,0.00058569026,0.00006064523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005152735,0.000215436,0.00026792983,0.00017856144,0.00033850997,0.00036388714,0.0010428374,0.000091145535,0.000013311722],"category_scores_gemma":[0.00008741711,0.00014199365,0.000091438334,0.0006544572,0.00009281978,0.00041785924,0.00017745566,0.00023221629,0.000011674481],"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.000083381026,0.000041843425,0.00053612515,0.00017868789,0.00004902662,2.9930342e-7,0.0033660624,0.000085195425,0.014512572,0.9595952,0.001440102,0.020111525],"study_design_scores_gemma":[0.00018618413,0.0011038317,0.0003157884,0.0010676815,0.00003432089,0.000019752135,0.010204604,0.38695607,0.45559338,0.14136991,0.0024598136,0.0006886782],"about_ca_topic_score_codex":0.00006242316,"about_ca_topic_score_gemma":0.000011328039,"teacher_disagreement_score":0.81822526,"about_ca_system_score_codex":0.000062866064,"about_ca_system_score_gemma":0.00006239237,"threshold_uncertainty_score":0.57903326},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9339203,0.000010047612,0.056082036,0.0071497113,0.00039097844,0.000819386,0.000023211562,0.000173132,0.0014311725],"genre_scores_gemma":[0.9978041,0.0000367807,0.001685219,0.00010749532,0.000061630366,0.000042860007,0.000003231692,0.00000964095,0.00024906342],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980533,0.000036819358,0.0005583214,0.00028817408,0.0007053122,0.00035805555],"domain_scores_gemma":[0.9976381,0.0006986679,0.00032808044,0.0002445758,0.0010211723,0.00006937346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012155741,0.00015126054,0.00020925234,0.00011962745,0.00057409424,0.000215647,0.0018823165,0.0000779922,0.00004383711],"category_scores_gemma":[0.0012062608,0.00009017234,0.00014565991,0.00110636,0.00024218703,0.00052095467,0.0004851512,0.0003803302,0.0000587831],"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.00014036265,0.00011711717,0.0017096371,0.00010663915,0.000025074864,4.810241e-7,0.020789973,0.001320174,0.29371992,0.4935029,0.0006716312,0.18789612],"study_design_scores_gemma":[0.00003999777,0.00017483647,0.00080215663,0.00035736285,0.000008771447,5.6253526e-7,0.008273851,0.24510549,0.71663177,0.028311003,0.00016538714,0.0001288325],"about_ca_topic_score_codex":0.000060598333,"about_ca_topic_score_gemma":0.0000027779515,"teacher_disagreement_score":0.46519187,"about_ca_system_score_codex":0.000025041805,"about_ca_system_score_gemma":0.00014259003,"threshold_uncertainty_score":0.4415527},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2635052,0.000032965152,0.52924675,0.10937186,0.004664289,0.0011471682,0.000017324552,0.0019828423,0.0900316],"genre_scores_gemma":[0.98971134,0.000025349716,0.007672605,0.0005145417,0.0001545846,0.000020520121,0.0000011110036,0.000018495692,0.0018814375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99737066,0.00002975674,0.00052466313,0.000633222,0.0008934595,0.0005482622],"domain_scores_gemma":[0.9983496,0.00019649358,0.00032208025,0.00042328268,0.0006119696,0.00009658508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079062243,0.00028026762,0.00029237065,0.00018480726,0.00032883312,0.0004425043,0.0027170258,0.000104992854,0.00008966231],"category_scores_gemma":[0.00089880783,0.00020737195,0.0001561433,0.001701447,0.00023252581,0.0006267497,0.0006799343,0.00055815803,0.00055260945],"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.000010162114,0.00005585605,0.001131606,0.000035206573,0.000015210407,0.0000019150314,0.0028917107,0.00015881554,0.007070849,0.90272003,0.0016172566,0.08429137],"study_design_scores_gemma":[0.000034120145,0.00016272045,0.00065776805,0.00024888612,0.000010490273,0.000006148432,0.00044939414,0.2988701,0.1499529,0.54759276,0.0016238546,0.00039084713],"about_ca_topic_score_codex":0.000064744854,"about_ca_topic_score_gemma":0.000003758551,"teacher_disagreement_score":0.7262062,"about_ca_system_score_codex":0.00003185914,"about_ca_system_score_gemma":0.00007701293,"threshold_uncertainty_score":0.84563833},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98506576,0.000007139578,0.008793885,0.0002746744,0.00081117783,0.0004927609,0.000008023523,0.00035018826,0.004196391],"genre_scores_gemma":[0.9986599,0.00007864731,0.0008011887,0.000046401954,0.00005593302,0.00013629618,0.0000011430361,0.000050283637,0.0001701842],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997931,0.0000100235575,0.0005803355,0.00041746115,0.00055346533,0.00050770905],"domain_scores_gemma":[0.99919105,0.00009568247,0.00015069178,0.0002416361,0.00024209208,0.000078872894],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052508834,0.000308293,0.00028090872,0.00036208314,0.00010273017,0.00011538401,0.000489746,0.00008974801,0.000033836015],"category_scores_gemma":[0.00029001906,0.00028440947,0.00009683375,0.00070369587,0.000103751816,0.00022528991,0.0001488331,0.00038072764,0.00028016244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000772525,0.00007881216,0.0015087724,0.00012934068,0.000017549273,0.000003805294,0.0017787981,0.9322705,0.054382756,0.0050792303,0.00008944751,0.0045837048],"study_design_scores_gemma":[0.000063291984,0.00004122159,0.0012623025,0.0005681738,0.0000068572595,2.634836e-7,0.00061605964,0.726775,0.26875812,0.0016926926,0.0000065004056,0.00020951919],"about_ca_topic_score_codex":0.000036423273,"about_ca_topic_score_gemma":0.000019174122,"teacher_disagreement_score":0.21437535,"about_ca_system_score_codex":0.00025814056,"about_ca_system_score_gemma":0.000036188092,"threshold_uncertainty_score":0.9999608},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40112293,0.00018822632,0.56796646,0.007346532,0.0033876644,0.0031783641,0.00008541118,0.0013487854,0.015375612],"genre_scores_gemma":[0.9896999,0.00012249441,0.009435821,0.000027563487,0.00008456867,0.00008866819,0.0000035149988,0.000017988747,0.00051950495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810946,0.00002412128,0.0006221497,0.0005285372,0.00035151353,0.00036422745],"domain_scores_gemma":[0.99773693,0.0003780305,0.0005307458,0.0002855251,0.0009943269,0.000074442076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059868314,0.00019172505,0.0002585844,0.00032098033,0.00033937974,0.000099519006,0.0013263207,0.00010033098,0.0000062682007],"category_scores_gemma":[0.0010437423,0.00016145065,0.00018447617,0.002254093,0.00025266074,0.0005065713,0.0003672738,0.00033508087,0.00001823478],"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.0000411764,0.000047460588,0.0006669625,0.000054362245,0.00001841881,1.5229953e-7,0.0018699572,0.0025470979,0.03265206,0.86501294,0.0002662898,0.096823104],"study_design_scores_gemma":[0.000038937065,0.000263589,0.0009859727,0.00024942934,0.000014177963,0.0000019277995,0.00056978123,0.4063854,0.21376848,0.3774952,0.00008432985,0.00014276753],"about_ca_topic_score_codex":0.00001046208,"about_ca_topic_score_gemma":0.000006926726,"teacher_disagreement_score":0.588577,"about_ca_system_score_codex":0.000022995526,"about_ca_system_score_gemma":0.000067304965,"threshold_uncertainty_score":0.65837663},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41764462,0.00016942121,0.51832837,0.028294476,0.007171876,0.0029085868,0.000017552698,0.0034863753,0.021978738],"genre_scores_gemma":[0.99779,0.00005663144,0.001225075,0.00048252655,0.00012617803,0.000039311584,9.96939e-7,0.000022731294,0.00025655192],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973491,0.000028774322,0.00060418696,0.0007073525,0.0005965515,0.0007140253],"domain_scores_gemma":[0.9983167,0.00019760139,0.00039799995,0.0004860668,0.00044858584,0.00015305045],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046197063,0.00032448702,0.00032694996,0.0002723792,0.00034639146,0.00027839758,0.0031866978,0.00013698041,0.000025154317],"category_scores_gemma":[0.00023307044,0.00024771798,0.00022185793,0.0033770301,0.00036278955,0.00064839155,0.0007260805,0.0005160658,0.000103614795],"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.00005681051,0.000061068116,0.00027390514,0.00001777403,0.000016088905,0.000003402452,0.00041108436,0.010460701,0.008037398,0.87029684,0.00085419515,0.109510735],"study_design_scores_gemma":[0.000027434584,0.00017125648,0.00031349275,0.00008716222,0.000007579214,0.0000053177937,0.00015243547,0.6896701,0.045238387,0.2639768,0.00006572518,0.00028431372],"about_ca_topic_score_codex":0.000011202537,"about_ca_topic_score_gemma":0.0000106326615,"teacher_disagreement_score":0.6792094,"about_ca_system_score_codex":0.000026590204,"about_ca_system_score_gemma":0.000032907377,"threshold_uncertainty_score":0.9999975},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14314204,0.000033551845,0.7444814,0.022439383,0.0020480873,0.0011926828,0.000048380032,0.0011767651,0.085437685],"genre_scores_gemma":[0.9890271,0.000020111402,0.0093078995,0.0004242579,0.000096485026,0.000039579052,0.0000075942335,0.0000157313,0.0010612627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99755764,0.00004053322,0.00057219446,0.0005378874,0.0008649657,0.0004268011],"domain_scores_gemma":[0.99845815,0.00019579413,0.00041294858,0.00025541263,0.00055932463,0.00011837585],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00080776203,0.00023041852,0.00023591418,0.00026983858,0.0003428213,0.00030851248,0.001500063,0.000105306885,0.00017248518],"category_scores_gemma":[0.00044517574,0.00019280573,0.00014329731,0.0013361766,0.00027633243,0.0006659565,0.00031183325,0.0003528938,0.0008809593],"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.000039249477,0.00006345323,0.00010807619,0.000018639517,0.000016522426,0.0000013712736,0.0028150138,0.0021044053,0.013522008,0.96661764,0.00072027143,0.013973372],"study_design_scores_gemma":[0.00005980957,0.00013748983,0.0008945417,0.0000887257,0.0000059781846,0.0000054156376,0.003073369,0.44915998,0.05018153,0.49399668,0.0021465425,0.0002499199],"about_ca_topic_score_codex":0.000012497918,"about_ca_topic_score_gemma":0.000005943454,"teacher_disagreement_score":0.84588504,"about_ca_system_score_codex":0.00006230851,"about_ca_system_score_gemma":0.00019980449,"threshold_uncertainty_score":0.99989694},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43896577,0.00009419926,0.48691097,0.049976397,0.002524413,0.0066534444,0.000035174984,0.0016856239,0.013154021],"genre_scores_gemma":[0.99406576,0.00004662677,0.0047929757,0.00014965568,0.00015143439,0.00034963546,8.216324e-7,0.000033093183,0.00041001348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9964231,0.000053650772,0.00089779584,0.00076325145,0.000964882,0.0008973098],"domain_scores_gemma":[0.99659216,0.0010698787,0.0004067876,0.0006930505,0.0011184302,0.00011967401],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001984971,0.00037379176,0.00039203712,0.0002598641,0.0007471006,0.0012568448,0.005078511,0.00014164897,0.000036211408],"category_scores_gemma":[0.0010446426,0.00023094703,0.00028242718,0.0019573239,0.0008201862,0.0008481346,0.00079473155,0.000444128,0.00030499583],"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.000032835535,0.00007003419,0.000059096914,0.00008806907,0.000025221965,5.1745036e-7,0.003940901,0.0004962875,0.030896937,0.7988943,0.00021462461,0.16528116],"study_design_scores_gemma":[0.000009166371,0.00015172255,0.00006661949,0.00018063717,0.0000127941785,0.000003067562,0.0064283176,0.24263088,0.44652724,0.30364087,0.00014544847,0.0002032184],"about_ca_topic_score_codex":0.00006576004,"about_ca_topic_score_gemma":0.000029005825,"teacher_disagreement_score":0.55509996,"about_ca_system_score_codex":0.00006752847,"about_ca_system_score_gemma":0.00023395497,"threshold_uncertainty_score":0.99977994},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98867315,0.00010324163,0.00057310995,0.0017476969,0.00038463488,0.001305376,0.0005277388,0.00011685752,0.006568199],"genre_scores_gemma":[0.99862564,0.00044321016,0.00023081568,0.0000671982,0.00014842341,0.000034431738,0.000017783663,0.000018034712,0.0004144597],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997931,0.00004673294,0.00042778274,0.00045635126,0.00061885285,0.0005192562],"domain_scores_gemma":[0.99782914,0.0007803279,0.00039805588,0.00013130186,0.00075300055,0.00010817314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021143486,0.00019734357,0.00035731896,0.00011454528,0.0003816559,0.00009459913,0.00065718376,0.00014789528,0.000068272966],"category_scores_gemma":[0.002814154,0.00016388741,0.000099394056,0.000958502,0.00094047113,0.00021691139,0.00025192657,0.00020731661,0.000052366322],"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.004042772,0.0013434892,0.039336253,0.00118903,0.0003350239,0.0000029938442,0.17700326,0.000016418131,0.027814755,0.28279558,0.0324046,0.43371582],"study_design_scores_gemma":[0.0008468356,0.0022160902,0.026858129,0.009197918,0.00042178802,0.0000037054708,0.3000109,0.007933208,0.29656467,0.3482099,0.005637541,0.0020993617],"about_ca_topic_score_codex":0.00013988625,"about_ca_topic_score_gemma":0.00041679072,"teacher_disagreement_score":0.43161646,"about_ca_system_score_codex":0.00005314697,"about_ca_system_score_gemma":0.00018364502,"threshold_uncertainty_score":0.66831344},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9700871,0.000008166757,0.009385619,0.008155809,0.000606851,0.00052573596,0.000005898042,0.00041090423,0.010813925],"genre_scores_gemma":[0.99828583,0.00007556592,0.00089908595,0.00013689519,0.00010867605,0.00007435481,0.0000016985189,0.000012460607,0.0004054464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982395,0.000011724176,0.0004535711,0.0004803737,0.00043962718,0.00037516846],"domain_scores_gemma":[0.9988306,0.0000837859,0.00030400624,0.00035083396,0.0003421448,0.00008858543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036481008,0.00018790338,0.00017488471,0.00014503777,0.00037369886,0.00029061295,0.0018811971,0.00006673612,0.000023135726],"category_scores_gemma":[0.000097016724,0.00014159599,0.000093717856,0.0015533268,0.00022447352,0.00068273913,0.00037946668,0.0002725356,0.00019481295],"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.000018925899,0.000068766734,0.0011001216,0.000036833593,0.000008610146,3.1812274e-7,0.0007560215,0.00021593344,0.15840936,0.73654544,0.0014300079,0.10140966],"study_design_scores_gemma":[0.00002085265,0.000108835644,0.004925014,0.00008860663,0.000007795107,0.0000031956745,0.0003020152,0.67443377,0.2767289,0.043018457,0.00016115044,0.00020139768],"about_ca_topic_score_codex":0.000006349076,"about_ca_topic_score_gemma":0.0000015955366,"teacher_disagreement_score":0.693527,"about_ca_system_score_codex":0.000032422933,"about_ca_system_score_gemma":0.000041405838,"threshold_uncertainty_score":0.57741165},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9560781,0.000020659892,0.014912168,0.011322952,0.0011750701,0.000513025,0.000008298764,0.00058446097,0.01538526],"genre_scores_gemma":[0.9964527,0.000077441386,0.0024873766,0.00014607783,0.000060481972,0.00002822302,0.0000010527799,0.000009864172,0.0007368156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99838626,0.000015984682,0.00038140308,0.00043630134,0.00044482417,0.000335198],"domain_scores_gemma":[0.9989365,0.00007822883,0.00025063392,0.00028247118,0.00036495746,0.0000872323],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00040041443,0.00018395056,0.00019432526,0.00018731087,0.00022746515,0.0002090494,0.0016210981,0.00009250097,0.00008703738],"category_scores_gemma":[0.0002738898,0.000120742676,0.000116117066,0.0010535954,0.00015312206,0.00048595044,0.00050742,0.00022684199,0.00078058295],"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.000085330474,0.00015541074,0.00018351797,0.000039725946,0.000013482906,0.000002047865,0.0020247956,0.00037283992,0.26099092,0.52343714,0.0074115847,0.20528321],"study_design_scores_gemma":[0.000025901882,0.00012973396,0.00034708116,0.00041001354,0.0000056789613,0.0000032290125,0.0006827213,0.11487741,0.78968936,0.09320807,0.0004297164,0.0001910574],"about_ca_topic_score_codex":0.000014477366,"about_ca_topic_score_gemma":0.0000033850604,"teacher_disagreement_score":0.5286985,"about_ca_system_score_codex":0.00001871939,"about_ca_system_score_gemma":0.00005292147,"threshold_uncertainty_score":0.99999744},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5230296,0.000012024736,0.47115716,0.00011301574,0.0007320285,0.00056834705,0.0000011765734,0.0005367432,0.0038498745],"genre_scores_gemma":[0.98923105,0.000009737027,0.00973759,0.000040203464,0.00029424828,0.000060674716,0.0000010367023,0.000043477456,0.00058196887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99556744,0.00010972985,0.0010546251,0.0011741681,0.0012022738,0.00089174474],"domain_scores_gemma":[0.99774736,0.00008928643,0.0004696678,0.00049752207,0.00090393424,0.0002922224],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022833992,0.00045730732,0.0005600655,0.0004689473,0.00077898375,0.00086078193,0.002903601,0.0001179541,0.0000056314816],"category_scores_gemma":[0.0005016698,0.0003648122,0.00022213209,0.001593133,0.00008489622,0.0006749111,0.0011804301,0.00078429084,0.00015531857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023967117,0.00012439895,0.00023643361,0.000087766864,0.000024743273,0.0000032999094,0.005742706,0.30435914,0.014558224,0.667847,0.0000039897845,0.0069883605],"study_design_scores_gemma":[0.000021415735,0.00029051304,0.000037928887,0.0009489026,0.000016351238,0.000027649492,0.011001999,0.9310969,0.05376505,0.002283714,0.0000944082,0.00041516498],"about_ca_topic_score_codex":0.00017363577,"about_ca_topic_score_gemma":0.0000014226316,"teacher_disagreement_score":0.6655633,"about_ca_system_score_codex":0.00031127926,"about_ca_system_score_gemma":0.00011335843,"threshold_uncertainty_score":0.9998804},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9142115,0.000053219752,0.031083627,0.010146331,0.0024412863,0.0011952515,0.0000310192,0.0009367129,0.039901026],"genre_scores_gemma":[0.9947094,0.0000711504,0.004455042,0.00026266114,0.0001255119,0.000034448676,0.0000028274426,0.000014272078,0.00032472174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756086,0.0000115074545,0.00054083776,0.00059209194,0.00085646834,0.00043824097],"domain_scores_gemma":[0.9985405,0.0002918345,0.0003879939,0.0003630491,0.0003241909,0.00009241193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053117087,0.000246655,0.0002215919,0.0002193302,0.00034283186,0.00017494896,0.0019280928,0.000065333545,0.00006745579],"category_scores_gemma":[0.00031139728,0.0001848204,0.000110680354,0.0009765206,0.00024712618,0.00090580375,0.00051282486,0.0004709821,0.0002698952],"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.000046887464,0.00007703685,0.00092126156,0.000022904407,0.000014505352,0.0000015063116,0.0016454089,0.0026336478,0.004519549,0.9188794,0.00074829155,0.0704896],"study_design_scores_gemma":[0.00008743674,0.0005415901,0.015731141,0.0010598201,0.000017984394,0.00000930155,0.0013233678,0.3883554,0.26466623,0.3263256,0.0011369906,0.00074515014],"about_ca_topic_score_codex":0.000007679001,"about_ca_topic_score_gemma":0.000006663003,"teacher_disagreement_score":0.5925538,"about_ca_system_score_codex":0.000037396094,"about_ca_system_score_gemma":0.00006177611,"threshold_uncertainty_score":0.7536757},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94350207,0.000028570254,0.046054486,0.0003469553,0.002424732,0.0012470094,0.000032623644,0.0010441305,0.0053194226],"genre_scores_gemma":[0.9939866,0.00008596517,0.005325558,0.000022794722,0.00012200971,0.0001931672,0.0000012141696,0.00003910116,0.00022357146],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99847436,0.000008465558,0.000519493,0.00029321088,0.00030303755,0.00040144986],"domain_scores_gemma":[0.9991836,0.0001598278,0.000119573764,0.0001396223,0.00034168697,0.00005566602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006272495,0.00024157223,0.00025858567,0.00023147445,0.00019914578,0.00009511027,0.0005369423,0.00016206152,0.00006335165],"category_scores_gemma":[0.00037329074,0.00019169057,0.00019150208,0.0006104629,0.000119778546,0.00021932015,0.000033245276,0.00031323632,0.00013388493],"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.00009837658,0.000043014654,0.000041135663,0.00015755603,0.0000443935,2.6747097e-7,0.0015442501,0.0022538195,0.91655827,0.012580258,0.00009849357,0.066580154],"study_design_scores_gemma":[0.000042813368,0.00010981898,0.00090361165,0.000066166256,0.000018874654,0.000001712147,0.0011833301,0.053990327,0.9291257,0.014130987,0.0002192132,0.00020743732],"about_ca_topic_score_codex":0.0000082907745,"about_ca_topic_score_gemma":0.00001594922,"teacher_disagreement_score":0.066372715,"about_ca_system_score_codex":0.00007632628,"about_ca_system_score_gemma":0.000023865921,"threshold_uncertainty_score":0.7816915},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97925466,0.000014374235,0.010051281,0.0010774804,0.00048726145,0.00092428963,0.000001932024,0.00015967607,0.008029062],"genre_scores_gemma":[0.99758613,0.00006328357,0.0007722919,0.000101457146,0.00013024759,0.000026221564,0.000006741156,0.00002202581,0.0012916026],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982548,0.000011117038,0.00056218193,0.00032834095,0.0005158051,0.00032778885],"domain_scores_gemma":[0.9989973,0.00002372253,0.0002920286,0.00015957418,0.00040455392,0.00012287051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042530228,0.00021024197,0.00033678938,0.00017947766,0.00019496799,0.00004722241,0.00021505383,0.00011103148,0.00042409266],"category_scores_gemma":[0.0002698805,0.00014897484,0.00017859298,0.00055349164,0.000087247354,0.00011246458,0.00010652596,0.00021044837,0.00015732496],"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.00077453896,0.00019368962,0.0005920056,0.00009983916,0.00007629956,0.0000058973637,0.0010738731,0.001554294,0.72605246,0.1357086,0.00003347872,0.13383505],"study_design_scores_gemma":[0.00009109751,0.0010221608,0.0001944495,0.00021730276,0.00009148332,0.0000071702584,0.0010350943,0.164964,0.8244896,0.006971842,0.00078095077,0.00013484881],"about_ca_topic_score_codex":0.000032247477,"about_ca_topic_score_gemma":0.0000042991687,"teacher_disagreement_score":0.16340971,"about_ca_system_score_codex":0.00014103291,"about_ca_system_score_gemma":0.0001600431,"threshold_uncertainty_score":0.60750175},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9787882,0.0000064867418,0.00778098,0.006698038,0.00035716727,0.0017800345,0.000040385203,0.0003163046,0.0042324006],"genre_scores_gemma":[0.99703634,0.00006752139,0.0016281713,0.0002274679,0.00017857335,0.00033140718,0.000007930407,0.00003184804,0.00049076957],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99815506,0.000010523306,0.000670003,0.0004584901,0.00034203893,0.00036387885],"domain_scores_gemma":[0.99777544,0.00083376555,0.00034256835,0.00022866824,0.0006987577,0.00012079576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074641505,0.0001938502,0.0003509319,0.00017191212,0.00025881024,0.00007210489,0.00041917016,0.00014141065,0.00009553836],"category_scores_gemma":[0.0032252022,0.00015186587,0.00020381632,0.00093751255,0.00031317005,0.00011295152,0.00008526809,0.00032168953,0.00013288349],"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.00031775027,0.00017366634,0.00055030786,0.00012518516,0.000043086002,2.127299e-7,0.0016323844,0.000035376197,0.77934635,0.0994044,0.00027606697,0.11809524],"study_design_scores_gemma":[0.00010737603,0.0007352755,0.0025912062,0.00048898876,0.000114999435,0.000009067603,0.0049830265,0.031581227,0.8441617,0.11283211,0.002141201,0.00025382056],"about_ca_topic_score_codex":0.000019103773,"about_ca_topic_score_gemma":0.000014047735,"teacher_disagreement_score":0.117841415,"about_ca_system_score_codex":0.000055537625,"about_ca_system_score_gemma":0.000084396626,"threshold_uncertainty_score":0.61929107},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99227816,0.000005053472,0.0033966363,0.00016791472,0.001462437,0.0007118034,0.000009912171,0.0005144612,0.0014536396],"genre_scores_gemma":[0.99818844,0.00018551198,0.00021917188,0.000010169931,0.0002760886,0.00006204437,0.000008730068,0.000052620522,0.0009972076],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9976995,0.000027431754,0.00089482265,0.0004448771,0.00047790646,0.00045548595],"domain_scores_gemma":[0.99910426,0.00012855451,0.0003727361,0.00017948402,0.00013455046,0.00008042414],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073426677,0.00031314493,0.0004120307,0.00020247407,0.00040406603,0.0001290261,0.00038650603,0.0001899114,0.00004948436],"category_scores_gemma":[0.00014878654,0.00026743513,0.0001275451,0.00055267476,0.00007601501,0.00033976097,0.000111620626,0.0004363109,0.00026520572],"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.0005947146,0.000098749726,0.0010744883,0.00036121364,0.00013211137,8.1337345e-7,0.0013642393,0.34259135,0.58878875,0.018672727,0.0007934646,0.0455274],"study_design_scores_gemma":[0.00008729779,0.00022962574,0.0018010081,0.00017566812,0.000019358811,7.8831783e-7,0.0004637313,0.14368276,0.850832,0.0015179866,0.00091337593,0.00027638534],"about_ca_topic_score_codex":0.0004087283,"about_ca_topic_score_gemma":0.00006920483,"teacher_disagreement_score":0.26204327,"about_ca_system_score_codex":0.00022522495,"about_ca_system_score_gemma":0.000018576253,"threshold_uncertainty_score":0.99997777},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044324238,0.00001399948,0.91089785,0.020366838,0.0017083512,0.00089464063,0.00003588722,0.0008603921,0.020897798],"genre_scores_gemma":[0.98130596,0.00003902968,0.017226446,0.00016344702,0.00013124854,0.000027684955,0.000005837873,0.000023232511,0.0010771413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99700767,0.000029028843,0.0007111039,0.0008526698,0.0009147963,0.00048470972],"domain_scores_gemma":[0.99733186,0.00017457263,0.00052827067,0.0014138065,0.00044944408,0.00010204817],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0013386921,0.00027249544,0.00027911927,0.00020387842,0.00036330224,0.00033760545,0.007844091,0.00010461282,0.00004700187],"category_scores_gemma":[0.0022811375,0.0002144519,0.000099509496,0.0013200773,0.00022927736,0.0014055767,0.0036454676,0.00048052313,0.00022383056],"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.000030562296,0.000084133004,0.00022675996,0.000038350365,0.00002110417,0.0000012559524,0.00087007246,0.024035726,0.015584565,0.9022144,0.00516728,0.051725756],"study_design_scores_gemma":[0.000030510524,0.000035421235,0.00012544288,0.00008249736,0.0000126367795,0.0000028002555,0.00024742645,0.75846267,0.02694567,0.21373826,0.00012778178,0.00018887296],"about_ca_topic_score_codex":0.000057347344,"about_ca_topic_score_gemma":0.000015076096,"teacher_disagreement_score":0.9369817,"about_ca_system_score_codex":0.000066123175,"about_ca_system_score_gemma":0.00013111976,"threshold_uncertainty_score":0.99752396},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95570046,0.00003576205,0.031051537,0.0074952557,0.0013501957,0.00065567344,0.0000059637878,0.0007373028,0.0029678766],"genre_scores_gemma":[0.99161047,0.000092125636,0.007408011,0.00040331148,0.00011036446,0.00004795566,0.0000010938676,0.000024847739,0.00030183612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731207,0.000024217785,0.000585478,0.0006959443,0.000708391,0.00067392096],"domain_scores_gemma":[0.9985013,0.00008499994,0.00036394811,0.00049272995,0.0004090393,0.00014798479],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038439536,0.00035303543,0.00034525033,0.00026493674,0.00033083963,0.00023435015,0.0031207814,0.00011794463,0.000029271929],"category_scores_gemma":[0.00023409759,0.00025497057,0.00019237086,0.0024122684,0.00028816983,0.0005429849,0.00079728087,0.0005414669,0.00013250153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090934496,0.000064329295,0.0005137582,0.00007135153,0.000022177523,0.0000032207092,0.0010697257,0.012042658,0.02842407,0.53949726,0.0005073519,0.41769314],"study_design_scores_gemma":[0.000039921597,0.00018775233,0.0011724465,0.00012550197,0.000008987591,0.000015094299,0.00006671184,0.6548672,0.2248497,0.11814783,0.0001815211,0.00033736156],"about_ca_topic_score_codex":0.000013195755,"about_ca_topic_score_gemma":0.0000037179861,"teacher_disagreement_score":0.64282453,"about_ca_system_score_codex":0.000034609788,"about_ca_system_score_gemma":0.00007307958,"threshold_uncertainty_score":0.9999902},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43488166,0.000062411076,0.5375334,0.01916605,0.0011049632,0.0013605257,0.000008579648,0.00039097658,0.005491458],"genre_scores_gemma":[0.98853284,0.000019950709,0.010958635,0.00015948265,0.00017912919,0.00003445591,5.330147e-7,0.000018520463,0.00009644755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978384,0.000034182263,0.0007385224,0.00046097173,0.00051358755,0.00041435493],"domain_scores_gemma":[0.9970863,0.0008737678,0.0009072527,0.00041095604,0.00067384983,0.000047887497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002119106,0.00020398629,0.0003058954,0.00014058393,0.00045391746,0.00020160979,0.002637386,0.00007311531,0.0000120427085],"category_scores_gemma":[0.0040762275,0.00013505474,0.00018510979,0.0014250089,0.0002662233,0.00037173126,0.00068252446,0.0003345732,0.00001767872],"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.000031832842,0.000013315871,0.0030004822,0.0001116352,0.000016309034,3.013363e-7,0.0017193946,0.002247259,0.013379145,0.8756062,0.00005654685,0.1038176],"study_design_scores_gemma":[0.000043407385,0.00008393869,0.0011436858,0.0006713714,0.000023200606,0.0000044606063,0.0018980239,0.5818698,0.17712337,0.23669022,0.00018231633,0.00026621943],"about_ca_topic_score_codex":0.000021164245,"about_ca_topic_score_gemma":0.0000033187275,"teacher_disagreement_score":0.63891596,"about_ca_system_score_codex":0.000036440942,"about_ca_system_score_gemma":0.00009549936,"threshold_uncertainty_score":0.55073726},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9467094,0.000009396301,0.040547445,0.003678389,0.00057724945,0.000656138,0.000030388357,0.00050992187,0.0072817043],"genre_scores_gemma":[0.9985164,0.000028672444,0.0009564364,0.0000567409,0.00002315269,0.000008868715,0.0000021233682,0.000007577253,0.00040005377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857503,0.000018519177,0.0005292079,0.00030887872,0.00035186912,0.00021650121],"domain_scores_gemma":[0.99904996,0.000055035034,0.0003023278,0.00017832423,0.00038227928,0.00003207851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047327802,0.00013933427,0.00022393937,0.00030255452,0.00008776998,0.00013684886,0.0009563678,0.000060489503,0.000035018555],"category_scores_gemma":[0.00045441644,0.00011231039,0.00006305695,0.0018702983,0.00019474704,0.0006574466,0.00036846087,0.00012140672,0.00012960922],"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.000044920722,0.00015113984,0.0011535449,0.000048029164,0.000009783861,6.410728e-7,0.0017899154,0.00013776276,0.0939927,0.8878852,0.00016709745,0.014619273],"study_design_scores_gemma":[0.000034817822,0.00015507307,0.002529374,0.00017688746,0.000004851027,0.0000015748362,0.00060871785,0.51829994,0.430858,0.04710534,0.000068306974,0.00015711754],"about_ca_topic_score_codex":0.00004943744,"about_ca_topic_score_gemma":0.000014633496,"teacher_disagreement_score":0.84077984,"about_ca_system_score_codex":0.000026298418,"about_ca_system_score_gemma":0.00007700586,"threshold_uncertainty_score":0.45798847},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09821355,0.000037730875,0.88677335,0.004576178,0.0031377897,0.0011698938,0.0000042510223,0.0007222104,0.0053650495],"genre_scores_gemma":[0.98568535,0.000014944578,0.0135393785,0.00016493644,0.00030161583,0.000088633555,0.0000012942245,0.000028504794,0.00017534824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973667,0.000029863833,0.0006160085,0.0006889198,0.000581253,0.00071722356],"domain_scores_gemma":[0.9980455,0.00041951597,0.00046454684,0.0003947655,0.0005697288,0.00010596163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010179013,0.00029514905,0.00034357025,0.0001589189,0.00055144605,0.00032155568,0.0031945957,0.0001378787,0.000025370276],"category_scores_gemma":[0.0012346044,0.00024181746,0.00019959609,0.0015717128,0.00019425516,0.00060879264,0.000917937,0.00045526066,0.00008895597],"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.00006862135,0.000035351834,0.0008357461,0.00006779698,0.000018319894,0.0000012612348,0.0013720246,0.029636959,0.001856478,0.82547385,0.00016377997,0.14046983],"study_design_scores_gemma":[0.00003886927,0.00011300161,0.0003027231,0.00010343796,0.000013404738,0.0000037987363,0.0004497426,0.7479902,0.01542971,0.23521553,0.00009297601,0.00024662522],"about_ca_topic_score_codex":0.000018517438,"about_ca_topic_score_gemma":0.000011277408,"teacher_disagreement_score":0.8874718,"about_ca_system_score_codex":0.00005194849,"about_ca_system_score_gemma":0.00007620457,"threshold_uncertainty_score":0.986103},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9554279,0.0000049628507,0.000012861376,0.018328723,0.00018710361,0.0003397994,0.0001488146,0.00004438627,0.025505481],"genre_scores_gemma":[0.99918747,0.00008466096,0.000012699292,0.00031945293,0.000019713952,0.000011207307,0.000019020086,0.0000037779268,0.00034197423],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9985438,0.000021154752,0.0001965709,0.0003939381,0.000540355,0.00030420328],"domain_scores_gemma":[0.99933267,0.000057832192,0.00013882462,0.00037935958,0.000046065426,0.000045256333],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006661927,0.00013138614,0.00012496403,0.00004478816,0.00019183032,0.00015147404,0.002308647,0.00005371971,0.0036748082],"category_scores_gemma":[0.00034057425,0.00008450022,0.000052009338,0.00101212,0.00047159134,0.000285686,0.0010393957,0.00018483093,0.0021321548],"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.0003325151,0.0010404221,0.22325687,0.00010080521,0.000042277534,0.000014343787,0.009928067,0.00008565075,0.16609068,0.104396164,0.4529074,0.041804776],"study_design_scores_gemma":[0.00022772992,0.0002978582,0.46285346,0.00016522282,0.00007425889,0.000013617564,0.09612759,0.01519746,0.35753104,0.03779625,0.028658284,0.001057207],"about_ca_topic_score_codex":0.00032701012,"about_ca_topic_score_gemma":0.00021207512,"teacher_disagreement_score":0.42424914,"about_ca_system_score_codex":0.00008159989,"about_ca_system_score_gemma":0.000010270802,"threshold_uncertainty_score":0.9986448},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9751225,0.000015598487,0.020121934,0.0017876609,0.00035032464,0.00045361015,0.000031263215,0.000029053075,0.0020880285],"genre_scores_gemma":[0.9994501,0.000070209586,0.00012700645,0.000059613816,0.000116048424,0.000055804434,0.000006821413,0.000012984979,0.000101452424],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990595,0.000012679319,0.00027302228,0.0003072657,0.00013497837,0.00021258366],"domain_scores_gemma":[0.9992774,0.000049074864,0.0001345922,0.000113884176,0.00037695927,0.000048102687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020500812,0.0001505468,0.00013870552,0.000036458085,0.00022469863,0.00010242959,0.00030092575,0.00006615761,0.0000036140013],"category_scores_gemma":[0.00015629352,0.00010867567,0.00009037425,0.0002140218,0.00022728468,0.000022774604,0.00010479022,0.00012446848,0.0000056225617],"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.00035121452,0.00008390814,0.0004274273,0.00005660537,0.00004954072,1.5614435e-7,0.0013364751,0.00051942555,0.9305738,0.041116424,0.000063549465,0.025421428],"study_design_scores_gemma":[0.00007557088,0.00041422472,0.0004849783,0.00008689532,0.000039993316,0.0000020903246,0.007265682,0.0098908795,0.9712139,0.010188953,0.00016977136,0.00016711326],"about_ca_topic_score_codex":0.00012482778,"about_ca_topic_score_gemma":0.00008761889,"teacher_disagreement_score":0.04064,"about_ca_system_score_codex":0.000043962347,"about_ca_system_score_gemma":0.00004030868,"threshold_uncertainty_score":0.44316652},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9376675,0.000014578497,0.04895199,0.0029713628,0.0003150884,0.00044399197,0.000001237655,0.0007036112,0.008930653],"genre_scores_gemma":[0.99408996,0.00003189563,0.0050795525,0.00014757257,0.00009525802,0.000032986343,0.0000011672831,0.00001970958,0.00050188735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974631,0.000033678407,0.000521494,0.00071478606,0.0007721639,0.0004947694],"domain_scores_gemma":[0.9983008,0.00013448781,0.0004547203,0.00026974027,0.0007379694,0.00010229038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007090474,0.0002577513,0.000290386,0.00017322978,0.00057698274,0.0006461045,0.001530048,0.00010748192,0.000042915617],"category_scores_gemma":[0.00042179352,0.00018805939,0.000105223735,0.0018405358,0.00028493148,0.00093476276,0.0004967335,0.00048114057,0.00016585465],"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.00033921233,0.00043639183,0.018611925,0.00048351995,0.00011822329,0.000011574486,0.014965232,0.004496851,0.089618735,0.62208253,0.00047780768,0.248358],"study_design_scores_gemma":[0.00008825998,0.00033563463,0.0022419104,0.00031322148,0.000017838636,0.00000985143,0.00081540114,0.6219744,0.34890535,0.024855323,0.00010246326,0.0003403234],"about_ca_topic_score_codex":0.000033717064,"about_ca_topic_score_gemma":0.0000053587273,"teacher_disagreement_score":0.61747754,"about_ca_system_score_codex":0.000071928,"about_ca_system_score_gemma":0.0002271869,"threshold_uncertainty_score":0.76688397},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043517977,0.000008755408,0.9415976,0.002451647,0.00060202397,0.0010096818,7.477175e-7,0.0002609395,0.010550657],"genre_scores_gemma":[0.9966988,0.00006158241,0.0012903663,0.00014276634,0.0000485935,0.00009196417,0.0000017781205,0.000019113653,0.0016450594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976925,0.000018296512,0.00070041977,0.00047573357,0.00053967914,0.0005733526],"domain_scores_gemma":[0.9988997,0.00021737887,0.00018760428,0.0002608654,0.00036109818,0.00007337801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000988232,0.00023457769,0.00029230374,0.0002618379,0.00020099519,0.00022597788,0.0018474094,0.000116327654,0.000029254208],"category_scores_gemma":[0.0004834271,0.00019225704,0.0001248316,0.0012918437,0.00013955023,0.00036603725,0.00030229712,0.0004483723,0.000099333185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004446092,0.00002177543,0.00030232497,0.00004777159,0.000010045122,3.8967167e-7,0.0014018049,0.43167633,0.0067016566,0.54965985,0.00013646511,0.009997107],"study_design_scores_gemma":[0.00006138445,0.00033423444,0.0001296653,0.00023254665,0.0000070413657,0.0000010350476,0.00030189473,0.89585304,0.08019302,0.022260899,0.00040490105,0.00022032316],"about_ca_topic_score_codex":0.000016603639,"about_ca_topic_score_gemma":0.000004238305,"teacher_disagreement_score":0.9531808,"about_ca_system_score_codex":0.000067359375,"about_ca_system_score_gemma":0.00008063376,"threshold_uncertainty_score":0.78400147},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98233247,0.00004266985,0.0013564811,0.005867576,0.0001607387,0.0009337187,0.00005612901,0.000193469,0.009056761],"genre_scores_gemma":[0.9966763,0.00015102622,0.0024665424,0.00010286575,0.000046453526,0.0000026162502,0.00002357471,0.00001973833,0.0005108577],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989301,0.00000932654,0.00023625325,0.0003902296,0.00021610312,0.00021798561],"domain_scores_gemma":[0.99948794,0.00008449723,0.00018244944,0.00016709615,0.000029865252,0.00004818066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003924352,0.00013375064,0.000161127,0.000042869022,0.00025013054,0.00016440386,0.00054080924,0.00004673767,0.00020825479],"category_scores_gemma":[0.00008184219,0.000084827385,0.000023088976,0.0003426528,0.000072980525,0.0005536938,0.00056808576,0.000118397555,0.00011040948],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013117442,0.00009157775,0.016968627,0.0006936839,0.00008622244,0.000003531108,0.003427507,0.0007090168,0.04613835,0.008291414,0.002420128,0.9198582],"study_design_scores_gemma":[0.000060012735,0.00023630289,0.0004388329,0.00039288655,0.000032704953,0.0000054083353,0.00079310103,0.8991776,0.080580965,0.0124197425,0.0056509883,0.00021142213],"about_ca_topic_score_codex":0.00019217377,"about_ca_topic_score_gemma":0.00014750854,"teacher_disagreement_score":0.9196468,"about_ca_system_score_codex":0.000010925046,"about_ca_system_score_gemma":0.000012810159,"threshold_uncertainty_score":0.34591603},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28841257,0.0000043266573,0.6913485,0.0012218005,0.00036726292,0.0007838463,9.1467604e-7,0.00078759494,0.017073186],"genre_scores_gemma":[0.9986983,0.000024208028,0.0008385824,0.000021112235,0.00003345901,0.00013262322,6.41945e-7,0.000011793465,0.00023928855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982049,0.0000115562225,0.0006309825,0.0004240722,0.00041021843,0.00031828403],"domain_scores_gemma":[0.99897987,0.000041787676,0.00039945662,0.00024247919,0.00027427397,0.00006212096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006500174,0.00018044547,0.0002030866,0.0002707473,0.00028307398,0.00021051356,0.0011948749,0.00009935927,0.000013024977],"category_scores_gemma":[0.00007733578,0.00015687876,0.00009744713,0.0012372838,0.00007687488,0.00029265886,0.0004180219,0.0003852382,0.000104397426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012840932,0.00006738969,0.00034341784,0.000067651,0.000010961562,9.570059e-7,0.0010619484,0.0050537516,0.035398617,0.6342457,0.0000085853435,0.3237282],"study_design_scores_gemma":[0.000016644237,0.00012245597,0.002384497,0.00016936574,0.000004423897,0.0000044587205,0.0010813904,0.68341917,0.30343756,0.009157559,0.00004514058,0.00015736386],"about_ca_topic_score_codex":0.00016861668,"about_ca_topic_score_gemma":0.00008256515,"teacher_disagreement_score":0.7102857,"about_ca_system_score_codex":0.00033444585,"about_ca_system_score_gemma":0.00006091517,"threshold_uncertainty_score":0.63973296},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81431067,0.000007829884,0.16890001,0.0051457933,0.0005459328,0.0028437325,0.00010551625,0.0011466021,0.006993885],"genre_scores_gemma":[0.9932268,0.000030318834,0.005890503,0.000041899784,0.00008370759,0.00024447567,0.000013335962,0.000024020343,0.00044490484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99813783,0.000018501487,0.00065006985,0.00040047496,0.00048485663,0.00030828704],"domain_scores_gemma":[0.99779946,0.00051498844,0.0005556757,0.00026545857,0.0008012431,0.00006314947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006515808,0.00019862145,0.00036786695,0.0003676549,0.00016240815,0.00007788249,0.000577738,0.00010494861,0.00008698989],"category_scores_gemma":[0.0033147628,0.00015403541,0.00024552984,0.002182848,0.00017796275,0.00025692076,0.00012942505,0.00015805988,0.00003143848],"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.000099920675,0.00008003838,0.001344181,0.000059132046,0.000083367035,1.9884905e-7,0.0008361315,0.0000684637,0.045381352,0.9421605,0.00081287755,0.009073842],"study_design_scores_gemma":[0.00001901401,0.00007680813,0.0003147618,0.000037471225,0.00012290511,2.6226343e-7,0.0008033681,0.019690456,0.32653266,0.6522627,0.000015709404,0.00012387967],"about_ca_topic_score_codex":0.000017575861,"about_ca_topic_score_gemma":0.00003919939,"teacher_disagreement_score":0.2898978,"about_ca_system_score_codex":0.00006768423,"about_ca_system_score_gemma":0.00004097665,"threshold_uncertainty_score":0.6281382},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015984848,0.000036550005,0.9686698,0.010815234,0.0012563632,0.0006956856,0.000026224143,0.00022063499,0.0022947034],"genre_scores_gemma":[0.97654736,0.000028703873,0.022611389,0.0002103851,0.00033857676,0.000029613102,0.0000050067,0.000015163512,0.00021379966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806273,0.000023259148,0.0004537828,0.0006673791,0.00036632214,0.000426498],"domain_scores_gemma":[0.9984944,0.00021081169,0.00027161065,0.00055009563,0.00039020137,0.000082922175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007478651,0.00020911211,0.00025246915,0.00011469436,0.00043874086,0.00044571064,0.0030661304,0.0000792622,0.000015230179],"category_scores_gemma":[0.00085687626,0.00014835855,0.000099519755,0.0008718351,0.00015412264,0.00054344296,0.001000153,0.00017985239,0.000037195205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003077459,0.00007956962,0.000041098276,0.0000390149,0.00002830693,7.938658e-7,0.0008093071,0.001366745,0.1922827,0.6391856,0.0037713542,0.16236472],"study_design_scores_gemma":[0.00001866046,0.000058190144,0.000034810528,0.00004551258,0.000010361312,0.000001483825,0.0001704862,0.7023173,0.2354046,0.061481263,0.00030606048,0.00015126466],"about_ca_topic_score_codex":0.00003685953,"about_ca_topic_score_gemma":0.000011358504,"teacher_disagreement_score":0.9605625,"about_ca_system_score_codex":0.000025052981,"about_ca_system_score_gemma":0.00008696365,"threshold_uncertainty_score":0.6049886},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45507783,0.0000017393195,0.541391,0.0016528394,0.00061691244,0.0008140813,0.000016786864,0.000106414045,0.0003224174],"genre_scores_gemma":[0.95425814,0.000003939307,0.04533707,0.00017516482,0.000106930405,0.00008030476,0.0000043107684,0.000013544544,0.000020572448],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978231,0.000014309314,0.00061565323,0.0005546664,0.00060666824,0.00038556827],"domain_scores_gemma":[0.99849194,0.00013597129,0.00032601375,0.0002293757,0.00070892373,0.000107772255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009034433,0.00021017285,0.00024067375,0.0002443114,0.00026453004,0.00023536885,0.0011732925,0.000105455154,0.000027099573],"category_scores_gemma":[0.000305001,0.00018740437,0.00015362244,0.0008178261,0.00007992373,0.00042901633,0.000095374504,0.00018214279,0.00005344322],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040268904,0.00050039805,0.00033053043,0.00027253487,0.00006520139,0.0000022888262,0.016213292,0.034606893,0.34609222,0.22305161,0.00021765508,0.37824467],"study_design_scores_gemma":[0.00009339803,0.00017122402,0.00022085292,0.00021777692,0.000017340659,6.8429205e-7,0.0010190326,0.615261,0.24660927,0.13610476,0.00005107175,0.00023357305],"about_ca_topic_score_codex":0.00013969275,"about_ca_topic_score_gemma":0.000060946648,"teacher_disagreement_score":0.58065414,"about_ca_system_score_codex":0.00008934689,"about_ca_system_score_gemma":0.0001944576,"threshold_uncertainty_score":0.76421285},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5157091,0.000013121872,0.47399625,0.0058390154,0.0009912066,0.0006248277,0.0000040234568,0.0003866978,0.0024357417],"genre_scores_gemma":[0.9927037,0.000023464638,0.0067930575,0.00017224398,0.00009541968,0.00004297887,0.0000014611496,0.000011117612,0.0001565525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808604,0.000013735168,0.00052944623,0.0004805202,0.0005720809,0.00031820216],"domain_scores_gemma":[0.9989079,0.000049978786,0.0002285254,0.0002757061,0.00046359783,0.000074265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007214079,0.00018820023,0.00018032086,0.00017582912,0.00020652972,0.00025687393,0.0013942547,0.00009433448,0.000042343054],"category_scores_gemma":[0.00016908394,0.00014959986,0.00010879969,0.0006825896,0.00009612092,0.0004148694,0.0000939425,0.00023492226,0.00017188686],"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.000015451742,0.00016588069,0.0002494598,0.000042122036,0.000009588428,7.800559e-7,0.0016163229,0.0045956643,0.2873701,0.5756582,0.00009985579,0.13017662],"study_design_scores_gemma":[0.000027460974,0.000054188593,0.00059339375,0.00008391352,0.0000046871082,6.1094994e-7,0.00015531255,0.55538684,0.4346094,0.008921744,0.000035521512,0.00012690667],"about_ca_topic_score_codex":0.000051374114,"about_ca_topic_score_gemma":0.00003167008,"teacher_disagreement_score":0.56673646,"about_ca_system_score_codex":0.00005902885,"about_ca_system_score_gemma":0.00010570891,"threshold_uncertainty_score":0.6100505},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53834546,0.0000452152,0.37938228,0.05169322,0.001251165,0.0009935828,0.000026573493,0.0015632992,0.026699224],"genre_scores_gemma":[0.98871464,0.0000612398,0.009533771,0.00033971862,0.000052524163,0.000033016924,0.00000435122,0.000018609997,0.001242151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976751,0.000029933126,0.00052398595,0.0006568528,0.0006915856,0.00042254792],"domain_scores_gemma":[0.99830216,0.00011097065,0.00040753715,0.00054834376,0.0005338556,0.000097130076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010546594,0.00023684629,0.0002377114,0.00021328536,0.00036989886,0.00038957983,0.0025690577,0.00012577891,0.0000177412],"category_scores_gemma":[0.00046663452,0.00018501276,0.000069575566,0.0014263872,0.0001816247,0.00061182375,0.0006861153,0.00048060893,0.00019832003],"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.000024935573,0.00008695798,0.000081475286,0.00004336516,0.000010650671,3.9629913e-7,0.0013252213,0.006330182,0.029078115,0.9057194,0.00045788984,0.05684143],"study_design_scores_gemma":[0.000032122327,0.000049630988,0.00012745407,0.00013304388,0.000007504163,0.0000015825332,0.00015661775,0.73112583,0.045424256,0.22274536,0.000028874741,0.00016772177],"about_ca_topic_score_codex":0.000030996165,"about_ca_topic_score_gemma":0.000008871837,"teacher_disagreement_score":0.72479564,"about_ca_system_score_codex":0.000057955647,"about_ca_system_score_gemma":0.00012441343,"threshold_uncertainty_score":0.7544601},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8890525,0.000024247507,0.08344497,0.009229324,0.0005408648,0.0011280675,0.000014557206,0.0017107137,0.014854747],"genre_scores_gemma":[0.9956617,0.000023126775,0.003840778,0.00007197795,0.000040708685,0.000035729532,0.0000028929178,0.000017376586,0.0003057449],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9977019,0.000018509585,0.0004258955,0.00057495746,0.0008500614,0.00042871977],"domain_scores_gemma":[0.99867207,0.00008782818,0.0004072191,0.00033781189,0.00040585882,0.00008923301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006105333,0.00025016913,0.00023370204,0.0001926095,0.00026512693,0.0003654785,0.0022363153,0.00008624096,0.000039422106],"category_scores_gemma":[0.00014431504,0.00018391751,0.00007411586,0.0010204301,0.0003126021,0.0005872835,0.0008582232,0.00042083472,0.00015599107],"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.000039674804,0.00012512508,0.002135439,0.000020199215,0.000029195031,0.0000021942026,0.0019232668,0.00048368776,0.041028354,0.9381217,0.00074119476,0.015349978],"study_design_scores_gemma":[0.00008401981,0.00088760996,0.015433685,0.0006952586,0.000027447028,0.000013735799,0.0040934402,0.03916617,0.84532297,0.09349091,0.00019654438,0.00058821775],"about_ca_topic_score_codex":0.0001336074,"about_ca_topic_score_gemma":0.000018368099,"teacher_disagreement_score":0.8446308,"about_ca_system_score_codex":0.00012597989,"about_ca_system_score_gemma":0.00010694675,"threshold_uncertainty_score":0.7499938},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57174253,0.000010810872,0.42110822,0.00491028,0.00082080043,0.00049058034,0.0000040829996,0.0002664023,0.0006462757],"genre_scores_gemma":[0.99325013,0.000019766254,0.006200557,0.00043189936,0.00004305872,0.000016657814,0.0000013839708,0.0000074654317,0.00002908586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980668,0.000017528651,0.0006264972,0.00032389036,0.00062533806,0.0003399412],"domain_scores_gemma":[0.99866796,0.00006713926,0.00043096766,0.00028427754,0.0004890088,0.000060624527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065913494,0.00017968773,0.0001761932,0.00034569643,0.0002609115,0.00037663293,0.0013157878,0.00006919441,0.000013259703],"category_scores_gemma":[0.00020506368,0.00014834365,0.00009631286,0.001477251,0.00009872359,0.0017141324,0.00039398804,0.00019799225,0.00017891733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043234406,0.00008217127,0.0029813428,0.0002256869,0.00003518,6.495215e-7,0.007645694,0.0070007388,0.06388892,0.80602926,0.00039953648,0.11166757],"study_design_scores_gemma":[0.000026175754,0.00004863428,0.00124219,0.00027659102,0.000010962387,0.0000027817214,0.0011422386,0.8856031,0.06996884,0.041382574,0.00009154108,0.00020440627],"about_ca_topic_score_codex":0.00008980414,"about_ca_topic_score_gemma":0.000009181028,"teacher_disagreement_score":0.8786023,"about_ca_system_score_codex":0.00005414269,"about_ca_system_score_gemma":0.000061582476,"threshold_uncertainty_score":0.60492784},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7296069,0.000020508345,0.21535294,0.028822683,0.0010162506,0.0012221175,0.000014873874,0.0014325125,0.022511166],"genre_scores_gemma":[0.9921866,0.0000026600185,0.006470574,0.00067863025,0.00006756293,0.000039423972,9.681365e-7,0.000020275353,0.0005332739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99745995,0.000023806408,0.0004959518,0.00066180277,0.0006920852,0.0006664027],"domain_scores_gemma":[0.99863863,0.000177909,0.0002691969,0.0003131862,0.00043142264,0.00016964419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011677352,0.00027498975,0.00029120452,0.00030909557,0.00043246255,0.00044094352,0.0020121618,0.000073994255,0.000021706268],"category_scores_gemma":[0.00032894895,0.00019786906,0.00008844974,0.0022201487,0.00013261003,0.00035005415,0.00035538778,0.00036902202,0.0002340496],"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.0001196133,0.00016844804,0.0008799943,0.00010641026,0.000037750906,0.000009078574,0.030225378,0.00811428,0.05925043,0.7400476,0.001721207,0.15931985],"study_design_scores_gemma":[0.00011291615,0.0012487101,0.00088905887,0.001979245,0.000030499155,0.000025057569,0.0040180087,0.46195439,0.4834633,0.044375543,0.0009994195,0.0009038886],"about_ca_topic_score_codex":0.000025145357,"about_ca_topic_score_gemma":0.000007086973,"teacher_disagreement_score":0.69567204,"about_ca_system_score_codex":0.00004149906,"about_ca_system_score_gemma":0.00015937681,"threshold_uncertainty_score":0.8068866},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99463385,0.000020491443,0.00026884937,0.00044508872,0.00012893316,0.00067814026,0.000007477714,0.000058678153,0.003758508],"genre_scores_gemma":[0.99938583,0.000046161265,0.00035326584,0.000010014142,0.000043777538,0.00002309286,5.975682e-7,0.000005820804,0.000131448],"study_design_codex":"observational","study_design_gemma":"qualitative","domain_scores_codex":[0.99862486,0.000027809203,0.00047554256,0.0002870308,0.00039053772,0.00019421599],"domain_scores_gemma":[0.9988598,0.00010323897,0.00023654751,0.00014570357,0.00058568694,0.00006900797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009210845,0.00010853548,0.00019706239,0.000038494254,0.0004295486,0.00007098977,0.00036655084,0.0000658069,0.00020557638],"category_scores_gemma":[0.00034490766,0.00008506139,0.000051228784,0.00046959225,0.0003951555,0.0004118819,0.00008098866,0.00009482183,0.000002554771],"study_design_candidate":"qualitative","study_design_consensus":null,"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.00028725225,0.0025042233,0.31588438,0.00027906342,0.00009560914,0.000015316773,0.24855396,0.0011502724,0.0012311727,0.2602623,0.00013308451,0.16960335],"study_design_scores_gemma":[0.00031840013,0.0013933369,0.051897738,0.0003277921,0.00023747984,0.000009403553,0.6466155,0.14374532,0.019877715,0.13448085,0.00015937722,0.0009371125],"about_ca_topic_score_codex":0.015747402,"about_ca_topic_score_gemma":0.010848932,"teacher_disagreement_score":0.3980615,"about_ca_system_score_codex":0.000045950866,"about_ca_system_score_gemma":0.00008526999,"threshold_uncertainty_score":0.9908068},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9260998,0.00006982168,0.009575498,0.0028921142,0.0036506294,0.0020859868,0.000074972646,0.0011658949,0.054385297],"genre_scores_gemma":[0.99894327,0.000057400935,0.0003008287,0.000043456286,0.00011197014,0.00012826349,0.0000013835866,0.000029295355,0.00038415633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984187,0.000003522998,0.0005307621,0.00029720497,0.00030218874,0.00044760513],"domain_scores_gemma":[0.9991803,0.00013251015,0.00012736932,0.0001839161,0.00029840268,0.00007745707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065314316,0.00020808286,0.00028197217,0.00010331841,0.00012794942,0.00009971273,0.0007805742,0.00010418638,0.00004650045],"category_scores_gemma":[0.00035984296,0.0001645824,0.00015410822,0.00044729337,0.00013929662,0.00016111248,0.000083387364,0.00022404782,0.00013931892],"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.000177534,0.00017295273,0.00026091235,0.001247466,0.00013221231,0.0000015624444,0.0142153585,0.027158374,0.16068257,0.6902166,0.007189352,0.09854513],"study_design_scores_gemma":[0.00013053499,0.00029400855,0.0024430952,0.0015263244,0.00005663614,0.000006891934,0.014504885,0.2191856,0.6480647,0.10716773,0.0057353596,0.0008842529],"about_ca_topic_score_codex":0.000009626319,"about_ca_topic_score_gemma":0.000013723967,"teacher_disagreement_score":0.5830489,"about_ca_system_score_codex":0.000058769743,"about_ca_system_score_gemma":0.000038682567,"threshold_uncertainty_score":0.6711475},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97715014,0.000009024199,0.0008754811,0.003037365,0.0012539899,0.0007503354,0.000041715168,0.000096393655,0.016785573],"genre_scores_gemma":[0.9965769,0.00002261961,0.00012844603,0.00038815345,0.00025620914,0.000058621357,0.000045869827,0.000033188422,0.0024900082],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99738276,0.00003074577,0.0007559536,0.00070941506,0.0006443437,0.00047679257],"domain_scores_gemma":[0.99804044,0.00005153038,0.0005432935,0.0005067533,0.00073862076,0.000119365395],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00093469163,0.00030246278,0.00026987225,0.00013270382,0.00033934662,0.0002775824,0.0009997843,0.00019658316,0.0002465912],"category_scores_gemma":[0.00032234637,0.000251044,0.00023287185,0.0006086927,0.00041392865,0.000013092518,0.00020578389,0.00028588725,0.00043302265],"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.0011003116,0.00063740945,0.002114953,0.00011665686,0.00010360432,0.0000016968526,0.00026806255,0.03715625,0.84197444,0.10570024,0.0060667247,0.0047596265],"study_design_scores_gemma":[0.0001584938,0.000260213,0.022703268,0.00014360977,0.00003012978,0.000002392258,0.00029283963,0.026514776,0.9465754,0.001668778,0.0012809478,0.00036912572],"about_ca_topic_score_codex":0.000025850835,"about_ca_topic_score_gemma":0.000013371694,"teacher_disagreement_score":0.104600966,"about_ca_system_score_codex":0.000047241687,"about_ca_system_score_gemma":0.00014841161,"threshold_uncertainty_score":0.99999416},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9118541,0.000041021023,0.07609181,0.0050182375,0.00043708392,0.00039180787,0.000002817836,0.00022777567,0.005935389],"genre_scores_gemma":[0.9982683,0.000035082216,0.0012294911,0.000067388726,0.00004202469,0.00001850816,2.3438898e-7,0.000007843351,0.00033111486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851805,0.000018252766,0.00035729632,0.000488574,0.00031702933,0.00030082176],"domain_scores_gemma":[0.9989666,0.000079762816,0.00018763299,0.00029139037,0.00039218093,0.00008248349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006193005,0.0001593298,0.00020358332,0.0001408707,0.00016138135,0.00016695075,0.0011684846,0.000060707043,0.000013670074],"category_scores_gemma":[0.00015787386,0.00011093021,0.00004731975,0.00083705486,0.00020636045,0.00028803534,0.00054720143,0.00020404605,0.000079179015],"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.000018166205,0.000052631436,0.0017499778,0.000054039057,0.000014441796,0.0000010997352,0.002090954,0.00008670206,0.010084873,0.9273486,0.0001184323,0.05838006],"study_design_scores_gemma":[0.000060210175,0.00029195767,0.008671747,0.00038345685,0.000022866094,0.000018319746,0.0009720626,0.36149547,0.23784792,0.38958493,0.00023665333,0.00041440097],"about_ca_topic_score_codex":0.0000543269,"about_ca_topic_score_gemma":0.000042502543,"teacher_disagreement_score":0.5377637,"about_ca_system_score_codex":0.000026946927,"about_ca_system_score_gemma":0.00008480274,"threshold_uncertainty_score":0.45236027},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008096433,0.000023327326,0.95975953,0.024358975,0.0009820363,0.0014067179,0.000075092306,0.00037003084,0.004927856],"genre_scores_gemma":[0.89448714,0.0005019366,0.1041325,0.00016819792,0.00006884186,0.00011302595,0.00010836163,0.00001957091,0.00040042985],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984331,0.000017686023,0.00043344646,0.00053494435,0.00032163862,0.0002591845],"domain_scores_gemma":[0.99884963,0.000097385164,0.00026596128,0.0004182075,0.0003224585,0.000046384142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079827505,0.00013243422,0.0001546513,0.00018092603,0.00014073194,0.00019339465,0.0024347452,0.000057595935,0.000011279263],"category_scores_gemma":[0.000869451,0.00010367092,0.00002828335,0.0011299837,0.00006698987,0.0005421483,0.0006446484,0.00015954366,0.000048602633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004524402,0.00006727592,0.0005815682,0.00004409164,0.000010991029,2.639304e-7,0.0010522101,0.009630027,0.0021216774,0.410427,0.0007042505,0.5753154],"study_design_scores_gemma":[0.000032791315,0.000040938365,0.00062321627,0.000095344716,0.000003481179,5.5712337e-7,0.00017310465,0.97605395,0.009667598,0.011453527,0.0017253349,0.00013016703],"about_ca_topic_score_codex":0.000016313299,"about_ca_topic_score_gemma":0.000015121026,"teacher_disagreement_score":0.9664239,"about_ca_system_score_codex":0.000039915016,"about_ca_system_score_gemma":0.00010115216,"threshold_uncertainty_score":0.4524403},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9986849,0.00006271508,0.00041962307,0.00018072869,0.0000970517,0.0002963488,4.1161e-7,0.000005203265,0.0002530266],"genre_scores_gemma":[0.9995694,0.00029474738,0.00005390377,0.000012153748,0.000020556065,0.00001234148,4.4528662e-7,0.000008233709,0.000028184511],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99916583,0.000029956625,0.00027913268,0.0001995554,0.00019664747,0.00012889644],"domain_scores_gemma":[0.99938095,0.00007729984,0.00026882658,0.00009052775,0.00016505957,0.00001732567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006633116,0.00010279827,0.00014642972,0.000074329226,0.0000676742,0.0000146827415,0.00020729602,0.00006924766,0.000006092146],"category_scores_gemma":[0.00042098394,0.00006704292,0.000045977293,0.00017251562,0.00009463413,0.000008492699,0.00011572898,0.00012915234,8.9356223e-7],"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.00019259127,0.000028153356,0.000144503,0.00010175651,0.000009821703,7.242657e-8,0.000898524,0.00201582,0.94551724,0.03777774,0.000002898769,0.013310876],"study_design_scores_gemma":[0.000029714643,0.000299474,0.00012081988,0.00046673827,0.000007382085,5.05794e-7,0.0014391,0.020265961,0.96960855,0.007693162,0.000004573476,0.00006403017],"about_ca_topic_score_codex":0.00003053201,"about_ca_topic_score_gemma":0.0000072715,"teacher_disagreement_score":0.030084576,"about_ca_system_score_codex":0.000009305406,"about_ca_system_score_gemma":0.0000270513,"threshold_uncertainty_score":0.2733931},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8305215,0.000118072094,0.12523404,0.012600062,0.0022385963,0.0017686246,0.00008505825,0.0014844607,0.025949577],"genre_scores_gemma":[0.9935091,0.00017688822,0.0058061834,0.00022868717,0.00008174003,0.000017879223,0.0000067116207,0.000020924155,0.00015185337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99701273,0.000060197137,0.0006473247,0.0009387242,0.0007833369,0.0005576757],"domain_scores_gemma":[0.9975712,0.0004407611,0.00054006896,0.00086242607,0.00043229997,0.00015329242],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013320645,0.00031717398,0.00037847023,0.0003300461,0.00036715242,0.00049949484,0.004523997,0.00014107431,0.000029459012],"category_scores_gemma":[0.0031440845,0.00024986514,0.00007431393,0.001985798,0.00037498263,0.000997811,0.0034934834,0.00059398956,0.00014092466],"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.00006662626,0.00010009776,0.0030203632,0.00008597873,0.000044747336,0.0000049643163,0.003191207,0.00091529655,0.005564673,0.77891475,0.0007337938,0.2073575],"study_design_scores_gemma":[0.00015582843,0.00017548908,0.0019654708,0.00042569998,0.000041563446,0.000009892253,0.0009588431,0.85145974,0.023672372,0.11918557,0.0012576279,0.00069192395],"about_ca_topic_score_codex":0.000035544625,"about_ca_topic_score_gemma":0.00000776218,"teacher_disagreement_score":0.85054445,"about_ca_system_score_codex":0.00004254692,"about_ca_system_score_gemma":0.00016363217,"threshold_uncertainty_score":0.99999535},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12101206,0.00009290358,0.8730106,0.00033347096,0.0017588225,0.001778494,0.00000980463,0.00047141555,0.0015324674],"genre_scores_gemma":[0.99847883,0.000052071846,0.0009453054,0.000043361473,0.00019114545,0.0001657396,0.000008734811,0.000042467156,0.00007233634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984292,0.00001189094,0.0006224664,0.0003021039,0.00017686005,0.00045748125],"domain_scores_gemma":[0.9991837,0.00019096803,0.00019094137,0.0001492246,0.00023448654,0.000050663577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039026313,0.00023058147,0.00029190877,0.00015368154,0.00011418327,0.000107697604,0.0003778914,0.00013816093,0.000019854933],"category_scores_gemma":[0.00023756702,0.00020271946,0.00010783741,0.0009889429,0.00008583734,0.00030622663,0.000048711125,0.00024142538,0.000014644286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071784365,0.000015411815,0.00025777495,0.000092189715,0.000014622065,3.398807e-7,0.0003413632,0.9177621,0.01723248,0.054748874,0.00022168658,0.009241373],"study_design_scores_gemma":[0.000054865228,0.00005308666,0.00009105987,0.00023817702,0.000010802419,5.4056187e-7,0.00020324529,0.9210665,0.05428549,0.023773562,0.00002540272,0.00019723215],"about_ca_topic_score_codex":0.000010271647,"about_ca_topic_score_gemma":0.000016935799,"teacher_disagreement_score":0.8774668,"about_ca_system_score_codex":0.00005576207,"about_ca_system_score_gemma":0.000012671589,"threshold_uncertainty_score":0.82666594},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97167814,0.000033009484,0.02284063,0.0034287653,0.0005342081,0.0009610492,0.0000042517568,0.00008987224,0.0004300527],"genre_scores_gemma":[0.9986263,0.00005384153,0.0009857962,0.00014494863,0.00003418797,0.000037496,1.5386355e-7,0.000011841874,0.00010546748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795175,0.000053257816,0.0006104323,0.0004833399,0.00048388867,0.0004173087],"domain_scores_gemma":[0.9983989,0.00034008978,0.00052685535,0.00048929587,0.00019903228,0.000045853318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012748366,0.00020316362,0.00023577784,0.00021727281,0.00029060958,0.0003639577,0.002160581,0.000057716265,0.000009134467],"category_scores_gemma":[0.000588774,0.000118352255,0.000107773354,0.0020367918,0.00027601898,0.00045855335,0.0016487804,0.00034947236,0.000009450337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035574838,0.0000693907,0.007023867,0.00015651571,0.000034429184,0.00000206891,0.004857624,0.013195282,0.05179999,0.5794735,0.0002615833,0.34309018],"study_design_scores_gemma":[0.000033564156,0.00006067453,0.003477071,0.0005006253,0.000017942408,0.0000016344993,0.0010477687,0.86968166,0.10862531,0.016289022,0.00007804199,0.00018666436],"about_ca_topic_score_codex":0.0001436924,"about_ca_topic_score_gemma":0.00005147782,"teacher_disagreement_score":0.8564864,"about_ca_system_score_codex":0.00006423693,"about_ca_system_score_gemma":0.00006380905,"threshold_uncertainty_score":0.4826265},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27476048,0.000065260654,0.70596343,0.012526565,0.0016797575,0.0016786342,0.000026491449,0.0007565334,0.0025428645],"genre_scores_gemma":[0.9928952,0.00008064353,0.0064431205,0.00021336168,0.00013094976,0.00006209112,0.0000053319523,0.000021250042,0.00014804388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972618,0.000021566751,0.00070459145,0.00090337085,0.0005445543,0.0005640786],"domain_scores_gemma":[0.9979936,0.00037953156,0.00048620623,0.0006917696,0.0003443379,0.000104552164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015099212,0.00023946734,0.0003027659,0.00020838414,0.00044561207,0.0003098128,0.0037852281,0.00009296046,0.000015058746],"category_scores_gemma":[0.0014447569,0.0001887965,0.000094051495,0.00082981965,0.00011047829,0.00047044648,0.0010744758,0.0003624313,0.00006030758],"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.00014134088,0.00006471121,0.00043331322,0.00009999296,0.000015415335,8.1060705e-7,0.0019211326,0.0012065347,0.0045785042,0.87053436,0.0001239915,0.12087989],"study_design_scores_gemma":[0.000037012123,0.00041055467,0.00012620287,0.00021665732,0.00000802093,0.0000016595003,0.00095045206,0.8686185,0.023947656,0.105054334,0.00040701695,0.0002219444],"about_ca_topic_score_codex":0.00005174717,"about_ca_topic_score_gemma":0.000027509273,"teacher_disagreement_score":0.867412,"about_ca_system_score_codex":0.00005054941,"about_ca_system_score_gemma":0.000112597736,"threshold_uncertainty_score":0.7698898},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07829308,0.00009865824,0.880305,0.0053241295,0.0007516396,0.0020018201,0.000008704814,0.0012889988,0.031927984],"genre_scores_gemma":[0.96569157,0.000045568995,0.030891135,0.00024903394,0.00006919363,0.00023640825,0.0000075322573,0.000034343535,0.0027752297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969123,0.000100225516,0.00074371294,0.00079959526,0.0008135651,0.0006305745],"domain_scores_gemma":[0.9980754,0.00026157693,0.0006181957,0.0002662167,0.0006359129,0.00014269132],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021598786,0.0003557947,0.00057090324,0.0003308398,0.0006944012,0.0005490263,0.0019746989,0.00012474772,0.00006982535],"category_scores_gemma":[0.0011743415,0.0002712979,0.0004496996,0.0015586473,0.00021750138,0.0005588844,0.0005708713,0.00062597427,0.00010511346],"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.00010723963,0.00010354421,0.00009965796,0.000084494146,0.00026658564,5.7868283e-7,0.0029279313,0.01609046,0.08356487,0.87177587,0.0003749678,0.024603797],"study_design_scores_gemma":[0.00011089383,0.00027042956,0.000040462837,0.00003818013,0.00017082875,0.0000043487603,0.0017140823,0.83460927,0.1291898,0.030688427,0.002794545,0.0003687607],"about_ca_topic_score_codex":0.00003099566,"about_ca_topic_score_gemma":0.0000021760661,"teacher_disagreement_score":0.8873985,"about_ca_system_score_codex":0.000059680293,"about_ca_system_score_gemma":0.000102920734,"threshold_uncertainty_score":0.9999739},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09761402,0.000008360945,0.8909177,0.0053711967,0.0013037679,0.0009983348,0.00001445006,0.00035718016,0.0034149943],"genre_scores_gemma":[0.99246377,0.000013082735,0.006913303,0.000071016744,0.00008841083,0.00007373634,0.0000015462113,0.000027361824,0.00034776863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99723816,0.000044767763,0.0008436795,0.0006554394,0.0006565451,0.00056139217],"domain_scores_gemma":[0.9970891,0.0006377617,0.0007826726,0.00043527246,0.0009516293,0.000103596794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013943707,0.00029444773,0.0004971501,0.00030453026,0.00035210222,0.00016291067,0.0029928458,0.00016264546,0.000037834834],"category_scores_gemma":[0.0019602843,0.00023821316,0.00023991952,0.0015579086,0.0004676114,0.00046662713,0.00047979207,0.000447683,0.000020106172],"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.00011768441,0.0000569841,0.0000873922,0.0001310014,0.00003166444,6.009771e-7,0.0043303533,0.014232739,0.021992376,0.9156254,0.00016405762,0.04322974],"study_design_scores_gemma":[0.00007181926,0.00019290004,0.00011546282,0.00032982396,0.000019710953,0.0000022391096,0.0041161324,0.68533427,0.1640145,0.14547831,0.0000616155,0.00026320567],"about_ca_topic_score_codex":0.000031506857,"about_ca_topic_score_gemma":0.0000073668616,"teacher_disagreement_score":0.8948498,"about_ca_system_score_codex":0.0000510593,"about_ca_system_score_gemma":0.00023490457,"threshold_uncertainty_score":0.9714051},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014549204,0.00002173384,0.97787726,0.0027968043,0.0003386313,0.0006663266,0.0000052051378,0.0005593796,0.0031854324],"genre_scores_gemma":[0.93604296,0.00010856475,0.06308201,0.00025140948,0.00010142572,0.000090273235,9.241848e-7,0.000023591088,0.0002988156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99806464,0.000011193489,0.0005036352,0.0005404654,0.00040355782,0.000476535],"domain_scores_gemma":[0.9983051,0.00021834031,0.0003226475,0.00034135318,0.0007273805,0.00008519244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070811895,0.00022877248,0.00026732916,0.00020957486,0.00032579017,0.00031978227,0.0021558497,0.000080105456,0.000011435268],"category_scores_gemma":[0.0012102086,0.00017774932,0.00017149506,0.0011914151,0.00018823969,0.0009363947,0.0005688294,0.00025583655,0.00009015687],"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.000035249588,0.000040574087,0.000021959013,0.000052818858,0.0000084916155,5.6842543e-7,0.00077957206,0.000016703436,0.16527617,0.57070065,0.0002627542,0.26280448],"study_design_scores_gemma":[0.000017955015,0.00012009499,0.00003154468,0.00014539382,0.000005673439,0.0000017048552,0.00023644135,0.060334392,0.6188265,0.31970486,0.0004106023,0.00016482912],"about_ca_topic_score_codex":0.000009787777,"about_ca_topic_score_gemma":0.0000029511998,"teacher_disagreement_score":0.92149377,"about_ca_system_score_codex":0.000044694174,"about_ca_system_score_gemma":0.000064073814,"threshold_uncertainty_score":0.7248407},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25916478,0.000044753015,0.6560024,0.027918804,0.0023609665,0.0029517463,0.0000066285124,0.002072439,0.04947749],"genre_scores_gemma":[0.9896939,0.00003019037,0.005714618,0.0003826982,0.00010864412,0.00010957711,0.0000017139163,0.000028882338,0.0039298204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99745554,0.000045471952,0.0005955362,0.00067269633,0.0006190318,0.0006117097],"domain_scores_gemma":[0.99810076,0.0003845826,0.00036283792,0.00024067727,0.0007377261,0.0001734345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001511608,0.00026790387,0.00033939563,0.000348308,0.00064212165,0.00047163956,0.0018886985,0.00010340644,0.00006807905],"category_scores_gemma":[0.0024929666,0.00022555626,0.00019763791,0.0018342058,0.00012690174,0.00040217783,0.00046402364,0.0005392949,0.00058684463],"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.00015289345,0.000056081702,0.0002831713,0.00006617404,0.000024029032,8.666367e-7,0.008206062,0.011047154,0.070601344,0.71118444,0.0006356465,0.19774215],"study_design_scores_gemma":[0.00016337863,0.00079829287,0.0005511549,0.000389079,0.000021298489,0.0000055685778,0.005986984,0.6864759,0.22096908,0.0658898,0.018077051,0.00067242497],"about_ca_topic_score_codex":0.000014794242,"about_ca_topic_score_gemma":0.0000038783414,"teacher_disagreement_score":0.73052907,"about_ca_system_score_codex":0.000048309594,"about_ca_system_score_gemma":0.000096904754,"threshold_uncertainty_score":0.91979176},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13270123,0.00001743607,0.84628046,0.00842205,0.0012478976,0.001240342,0.000014673862,0.00044188683,0.00963404],"genre_scores_gemma":[0.96524847,0.000013559649,0.03362539,0.000225804,0.00009031089,0.0001243213,0.0000027878914,0.000016130534,0.0006532073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99813825,0.000030397747,0.00046271135,0.0004814164,0.00052910123,0.00035812164],"domain_scores_gemma":[0.99864227,0.00023042655,0.00034875498,0.00018007592,0.0005172574,0.00008121217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009046596,0.00019317862,0.00020562144,0.0002448945,0.00037758643,0.00023267453,0.0010145749,0.00007551088,0.00004291149],"category_scores_gemma":[0.00025460354,0.00015896004,0.00014506484,0.0011933697,0.00017132013,0.00041415615,0.0001937509,0.00018841744,0.00019795286],"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.00007917496,0.0000569456,0.00007078966,0.000026385134,0.00002269512,3.93676e-7,0.0026615458,0.000269289,0.058897566,0.8969029,0.00045728034,0.040555015],"study_design_scores_gemma":[0.00009791316,0.00028649697,0.0004804725,0.0001371757,0.000011721324,0.000004851207,0.0041531804,0.18640624,0.17218734,0.6351183,0.0008305462,0.00028573402],"about_ca_topic_score_codex":0.0000133770955,"about_ca_topic_score_gemma":0.000008537844,"teacher_disagreement_score":0.83254725,"about_ca_system_score_codex":0.00006268113,"about_ca_system_score_gemma":0.000087723274,"threshold_uncertainty_score":0.64822024},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1783317,0.00013938936,0.7709972,0.019664966,0.0009566931,0.0010068119,0.000008332129,0.0012613741,0.027633509],"genre_scores_gemma":[0.98261225,0.00014775257,0.015290646,0.0002718378,0.000048539794,0.000018240853,4.0422688e-7,0.000010144067,0.0016001848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987005,0.00001211759,0.00028750897,0.0004147157,0.0002909212,0.0002942252],"domain_scores_gemma":[0.9991269,0.000084596315,0.0001831361,0.00026191477,0.00027728738,0.00006617074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031461671,0.00017653398,0.00021850516,0.00013010767,0.0001880239,0.00028483092,0.0012137076,0.00008770068,0.000015247148],"category_scores_gemma":[0.00025914135,0.0001292754,0.00007318525,0.00083423336,0.00013980463,0.000591142,0.0006431008,0.000300886,0.000027429089],"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.000021558164,0.000031757845,0.0001470668,0.000056189103,0.0000099125855,0.0000016780889,0.0011247159,0.000012001519,0.0483432,0.67048943,0.0005283584,0.27923414],"study_design_scores_gemma":[0.000020573127,0.00013034088,0.00091288873,0.0003009976,0.000007319626,0.000010236511,0.00045659547,0.013317499,0.6128743,0.37117025,0.00058875553,0.00021024136],"about_ca_topic_score_codex":0.000019282592,"about_ca_topic_score_gemma":0.000004393228,"teacher_disagreement_score":0.8042806,"about_ca_system_score_codex":0.000026642605,"about_ca_system_score_gemma":0.00003381608,"threshold_uncertainty_score":0.52716976},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5650171,0.000016183752,0.35333395,0.040404562,0.0032580143,0.0021121071,0.000055941295,0.0011103017,0.034691803],"genre_scores_gemma":[0.9931222,0.0000545442,0.0060373126,0.00018203926,0.00016743723,0.00008408857,0.0000061039427,0.0000125009165,0.00033373068],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983908,0.000025391884,0.00043834493,0.00045900882,0.00039285433,0.00029362654],"domain_scores_gemma":[0.99785453,0.0001936381,0.0008308021,0.00018713628,0.0008640603,0.000069828704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008750565,0.00016812979,0.00018013016,0.0001844141,0.00038748968,0.0004273485,0.00078366796,0.00010395257,0.000049892587],"category_scores_gemma":[0.0012822413,0.00013845549,0.00013372008,0.0007866533,0.000093159855,0.0011640805,0.00014284882,0.00021950467,0.0001798603],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006432008,0.00013160406,0.000020248795,0.000110788234,0.000019389494,2.5294398e-7,0.0006763624,0.000044444863,0.043597322,0.18414113,0.00037291917,0.7708212],"study_design_scores_gemma":[0.00003140251,0.00012600263,0.00015466177,0.0001501778,0.000016984732,0.0000029612413,0.000556016,0.10378528,0.4981977,0.3965025,0.00031947787,0.00015683957],"about_ca_topic_score_codex":0.000051287374,"about_ca_topic_score_gemma":0.000012912979,"teacher_disagreement_score":0.7706644,"about_ca_system_score_codex":0.00005405708,"about_ca_system_score_gemma":0.00010633736,"threshold_uncertainty_score":0.5646051},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94428957,0.00014460362,0.04382455,0.00031771758,0.001483057,0.00092631043,0.000020833002,0.0012881991,0.0077051744],"genre_scores_gemma":[0.9974354,0.00015343603,0.0019516529,0.000064705826,0.0002605288,0.000030500723,0.0000021662895,0.00006327023,0.000038372207],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976891,0.000026437001,0.00061208924,0.0004210783,0.00045206762,0.00079921266],"domain_scores_gemma":[0.99853337,0.00048063617,0.00020456825,0.0001623523,0.0004858114,0.00013328715],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005435971,0.0003844285,0.0004746456,0.00014124498,0.00030303415,0.000160813,0.00065306545,0.00018256038,0.00007237081],"category_scores_gemma":[0.0009775158,0.0003316301,0.00016473542,0.0012480414,0.00025983728,0.00023077242,0.00011971154,0.0008270572,0.000110420755],"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.00032806638,0.00030402775,0.0028812306,0.0006128393,0.0004640062,0.000010816432,0.010443914,0.10331393,0.70062315,0.14293711,0.00063804956,0.037442856],"study_design_scores_gemma":[0.000049326914,0.00009144194,0.00024496618,0.0007463239,0.00007994098,0.000005682465,0.0019992827,0.6876488,0.28568715,0.02300214,0.00007338519,0.00037160335],"about_ca_topic_score_codex":0.000012943204,"about_ca_topic_score_gemma":0.000002884212,"teacher_disagreement_score":0.58433485,"about_ca_system_score_codex":0.0001456251,"about_ca_system_score_gemma":0.00007752986,"threshold_uncertainty_score":0.9999136},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6324874,0.00005195005,0.16317885,0.06604767,0.0050150575,0.002740827,0.000019089895,0.0022062939,0.12825288],"genre_scores_gemma":[0.9963529,0.000045395605,0.003019852,0.00023054986,0.00007993605,0.000041774834,4.1525468e-7,0.000012575048,0.00021657976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787223,0.000015884534,0.0005205221,0.0005834728,0.00051898323,0.0004889184],"domain_scores_gemma":[0.99869686,0.00013333623,0.00025368427,0.00045940344,0.00035600178,0.000100708414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000725602,0.00022988766,0.0002586979,0.00018145955,0.0003590232,0.0003417015,0.0027144772,0.0000923822,0.000038267957],"category_scores_gemma":[0.00039944737,0.00016562289,0.00014543923,0.0013982321,0.00023809298,0.00049296994,0.0010870779,0.0002600627,0.0003392341],"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.00004714155,0.0001359853,0.0006530266,0.0001324825,0.000016816584,0.0000027196743,0.0045199,0.0007079768,0.0030411454,0.90123016,0.0009796451,0.08853299],"study_design_scores_gemma":[0.000054109718,0.00036498372,0.0017659332,0.00035986418,0.000011781872,0.000011096693,0.0021473144,0.53309864,0.07373439,0.38671157,0.0012198011,0.00052048924],"about_ca_topic_score_codex":0.000040239403,"about_ca_topic_score_gemma":0.00002595827,"teacher_disagreement_score":0.5323907,"about_ca_system_score_codex":0.000056509292,"about_ca_system_score_gemma":0.0000596312,"threshold_uncertainty_score":0.6753905},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98402715,0.00000304423,0.00024792063,0.01363101,0.00023963122,0.00030635457,0.000020045774,0.00010831882,0.0014165011],"genre_scores_gemma":[0.9987435,0.000075397955,0.00020526887,0.00058602024,0.00009536129,0.000011581854,0.0000016129126,0.000015461614,0.00026580706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99721396,0.00010418659,0.00050885597,0.00036273937,0.0013810156,0.0004292565],"domain_scores_gemma":[0.9967973,0.0004666349,0.00024772857,0.0002531636,0.001963973,0.0002711529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050503984,0.00016726108,0.0003720719,0.000565682,0.0005489844,0.00042123656,0.0017935422,0.00025652573,0.000079070654],"category_scores_gemma":[0.0070917653,0.00014602086,0.00016595112,0.0033524346,0.00046018147,0.00052513357,0.00017341302,0.0006116436,0.000026548983],"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.0001437294,0.0002230267,0.009726561,0.00002743607,0.00013296916,5.6278554e-7,0.13047278,0.001732903,0.031410918,0.82327294,0.000042438416,0.002813755],"study_design_scores_gemma":[0.00011974428,0.002674479,0.12046551,0.0010743188,0.0011651965,4.4214963e-7,0.23460776,0.08328799,0.33004126,0.22329251,0.0014307676,0.0018400128],"about_ca_topic_score_codex":0.0028192063,"about_ca_topic_score_gemma":0.0024052851,"teacher_disagreement_score":0.5999804,"about_ca_system_score_codex":0.000077385106,"about_ca_system_score_gemma":0.00036970872,"threshold_uncertainty_score":0.84900177},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.983009,0.000010749251,0.010894915,0.005087898,0.00011739909,0.00024561657,0.00019054464,0.000138432,0.00030544784],"genre_scores_gemma":[0.99234736,0.000026073229,0.003123695,0.000043488104,0.000045122695,0.0000037637149,0.000023326551,0.000008449326,0.0043787253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892133,0.000020255819,0.00021683708,0.00037885326,0.00021549618,0.0002472257],"domain_scores_gemma":[0.99916834,0.00012398453,0.0002186523,0.00015518792,0.0002619104,0.000071938965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043491006,0.00012961273,0.00016263917,0.000111906425,0.0009413726,0.00014068834,0.00072170136,0.000054287106,0.000007241001],"category_scores_gemma":[0.00015562835,0.00011205432,0.000054355623,0.00044014672,0.0001806546,0.00020054136,0.0006997856,0.00017786643,0.0000337354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077021956,0.00014888206,0.008837289,0.00019365059,0.00005164328,0.000002911968,0.003943688,0.0038212382,0.20763263,0.71716386,0.0049503837,0.05317677],"study_design_scores_gemma":[0.00006163392,0.00024894855,0.00048013253,0.00023281675,0.00003181216,0.000006386627,0.0015997789,0.9140487,0.06938307,0.010963928,0.0026660187,0.00027682184],"about_ca_topic_score_codex":0.0000487651,"about_ca_topic_score_gemma":0.00009496124,"teacher_disagreement_score":0.9102274,"about_ca_system_score_codex":0.000056579163,"about_ca_system_score_gemma":0.000043705124,"threshold_uncertainty_score":0.7240372},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54779005,0.0003039723,0.4145628,0.02393449,0.0034486789,0.0039357557,0.00007113893,0.003998907,0.001954212],"genre_scores_gemma":[0.90467715,0.0000068515524,0.09404843,0.0005014947,0.00013039973,0.00010644101,0.0000037574575,0.000025176925,0.0005002993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9977181,0.000016825055,0.00059102883,0.00063446513,0.00048001186,0.0005595614],"domain_scores_gemma":[0.99820596,0.00015188924,0.00038006812,0.00039457463,0.00074795715,0.000119550896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067875074,0.0002909862,0.0003236059,0.00033963157,0.00036695728,0.00026249918,0.0023396276,0.0001307918,0.000012494816],"category_scores_gemma":[0.0015737027,0.00021624293,0.00018074794,0.0017409223,0.00015559993,0.0006009995,0.0007159503,0.0004117416,0.00008113742],"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.00008312042,0.000056345303,0.000091667054,0.00012831287,0.000016475171,0.0000023874068,0.003923857,0.000012230754,0.25656423,0.63434345,0.0006321127,0.104145825],"study_design_scores_gemma":[0.00003688256,0.00019843233,0.000026267273,0.0002463881,0.000009505152,0.000008718062,0.0009004323,0.055268273,0.763418,0.17947082,0.0001393381,0.00027691407],"about_ca_topic_score_codex":0.00006411693,"about_ca_topic_score_gemma":0.000029423485,"teacher_disagreement_score":0.5068538,"about_ca_system_score_codex":0.000076538825,"about_ca_system_score_gemma":0.00010389192,"threshold_uncertainty_score":0.88181305},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032422002,0.0000029750565,0.96052563,0.0023472423,0.00077778933,0.00086607406,0.0000032618893,0.0005179783,0.002537022],"genre_scores_gemma":[0.98698413,0.000008105514,0.011847404,0.00005174408,0.0000889506,0.00018428295,0.0000016912335,0.000027645596,0.00080604886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997955,0.000037884467,0.0005450841,0.00057973445,0.0004519111,0.0004303765],"domain_scores_gemma":[0.9982142,0.0002394402,0.00058423635,0.00024180821,0.0006432279,0.00007713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001073299,0.00024471123,0.00026657677,0.0002922122,0.0007033939,0.00030897438,0.0014752509,0.000097169774,0.000022232764],"category_scores_gemma":[0.0013504655,0.0002045637,0.00016861227,0.0011509235,0.00013479375,0.0009786271,0.00055235514,0.00069086807,0.000043963828],"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.00004660936,0.000035831792,0.000056647503,0.000044531123,0.00001982353,2.8379023e-7,0.0019400938,0.06671524,0.030982045,0.86124593,0.000016434014,0.038896535],"study_design_scores_gemma":[0.000027907065,0.000107049666,0.000027501224,0.00012758016,0.000009091849,0.0000022994377,0.0005525899,0.68951976,0.092098795,0.21731938,0.00005854582,0.00014948894],"about_ca_topic_score_codex":0.00013065225,"about_ca_topic_score_gemma":0.00002136451,"teacher_disagreement_score":0.9545621,"about_ca_system_score_codex":0.00006899694,"about_ca_system_score_gemma":0.00005535469,"threshold_uncertainty_score":0.83418655},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4963297,0.0000130251765,0.4768634,0.010737296,0.0024345254,0.0014027818,0.000006560641,0.0024560362,0.00975666],"genre_scores_gemma":[0.9668534,0.0000075738653,0.03229743,0.00010619922,0.00025080043,0.000044117332,0.0000011180011,0.00004304743,0.00039635296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964316,0.0000618006,0.00069667073,0.0009789392,0.0010471256,0.0007838956],"domain_scores_gemma":[0.9973175,0.00029892515,0.00080794224,0.00058476627,0.00083811826,0.00015272948],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013587284,0.00043081862,0.00045504782,0.00032053806,0.000623761,0.00048229148,0.003224495,0.00017587267,0.000034436252],"category_scores_gemma":[0.0010738308,0.00031386616,0.00016350673,0.0023775587,0.0002831895,0.0010108013,0.0011360263,0.0007998073,0.00010912275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031292628,0.00019197604,0.0016220664,0.00022767867,0.00010272858,0.000013755508,0.004771091,0.04220094,0.034596022,0.8417472,0.0003751431,0.07383844],"study_design_scores_gemma":[0.000115160285,0.00024634105,0.00026612013,0.00029866863,0.00003352057,0.000010836071,0.0010827591,0.88401324,0.10396237,0.009393851,0.000120322286,0.00045682918],"about_ca_topic_score_codex":0.00007983114,"about_ca_topic_score_gemma":0.000011746972,"teacher_disagreement_score":0.84181225,"about_ca_system_score_codex":0.00012748879,"about_ca_system_score_gemma":0.0002747895,"threshold_uncertainty_score":0.99993134},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98822093,0.00003490853,0.0009195262,0.0008178372,0.0004181472,0.00023604515,0.0000028780134,0.00045677548,0.008892937],"genre_scores_gemma":[0.99928373,0.00022318776,0.0002333759,0.0000316091,0.000033964945,0.000013373286,9.976294e-7,0.000016145861,0.00016361204],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991216,0.000007209785,0.00032494002,0.00014827627,0.00018541272,0.00021256552],"domain_scores_gemma":[0.9994853,0.000065964625,0.00009007228,0.00017123991,0.0001479733,0.000039455834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023630768,0.00012623967,0.00014546872,0.00007795785,0.00014551534,0.000033276636,0.00058646617,0.000044098157,0.000056489942],"category_scores_gemma":[0.00015186644,0.00010124174,0.00006854258,0.0005949671,0.00009119759,0.00012219549,0.00012504036,0.00022044765,0.0001797762],"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.000047212143,0.000033042204,0.00008866265,0.00009978487,0.000019029612,3.4073466e-7,0.0010687647,0.012265671,0.61231005,0.31904292,0.0007979294,0.054226577],"study_design_scores_gemma":[0.000014047388,0.000028364246,0.00012557053,0.00013838874,0.000006105244,8.9397275e-7,0.00052899827,0.112075366,0.83556736,0.051179007,0.0002120568,0.00012382743],"about_ca_topic_score_codex":0.0000030171923,"about_ca_topic_score_gemma":0.000002639633,"teacher_disagreement_score":0.2678639,"about_ca_system_score_codex":0.000018921619,"about_ca_system_score_gemma":0.000008265201,"threshold_uncertainty_score":0.41285184},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55552006,0.000017450202,0.4341399,0.0047715562,0.00032050427,0.00061449484,0.0000010186551,0.00050018803,0.0041148644],"genre_scores_gemma":[0.99424124,0.000016794407,0.0049171704,0.0002996635,0.0000612074,0.00004633326,7.324174e-7,0.000021946136,0.00039490595],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.997576,0.000020634427,0.00044979123,0.0006440245,0.00074529124,0.0005642411],"domain_scores_gemma":[0.9989013,0.000069999835,0.00028518192,0.00019382671,0.00040107386,0.0001486133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000580367,0.00027030281,0.00026760076,0.00025617832,0.0004172009,0.0005119323,0.0014553836,0.00008011992,0.000023131062],"category_scores_gemma":[0.00023495776,0.0002020266,0.0000944826,0.001875105,0.00012194411,0.00068637554,0.00026224332,0.00028992063,0.00018839724],"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.0001253165,0.00006281155,0.00028171635,0.00007092925,0.000025694073,0.0000025831835,0.008546274,0.0045968816,0.69990575,0.06455418,0.00006792675,0.22175995],"study_design_scores_gemma":[0.000040051338,0.0003975999,0.00013001624,0.0003606133,0.0000108937475,0.0000057718607,0.0022621583,0.103688866,0.87919533,0.013529998,0.00011674635,0.00026194498],"about_ca_topic_score_codex":0.000020048526,"about_ca_topic_score_gemma":0.000011510421,"teacher_disagreement_score":0.4387212,"about_ca_system_score_codex":0.000059221646,"about_ca_system_score_gemma":0.00007469046,"threshold_uncertainty_score":0.82384056},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7341532,0.000009227485,0.23684624,0.005526812,0.0014090643,0.0017776691,0.000010038368,0.0007673525,0.019500397],"genre_scores_gemma":[0.9973026,0.00001640544,0.0019801056,0.00011493505,0.00006866779,0.00011361805,0.0000036333654,0.000008823815,0.0003911961],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99876297,0.00001901631,0.00034014563,0.00036410912,0.00029685526,0.00021692527],"domain_scores_gemma":[0.9986627,0.00017717849,0.00031939385,0.00011098644,0.0006903779,0.000039360737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038723144,0.00011737375,0.00013170928,0.00018350201,0.00031833674,0.0001979872,0.0005604916,0.000046922964,0.000029952014],"category_scores_gemma":[0.000665717,0.00009921289,0.00009346116,0.00095512904,0.00006684328,0.00061997835,0.00008933134,0.0001679046,0.00015938595],"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.000031927986,0.00005957632,0.00038199482,0.000038193022,0.000019545645,2.5231287e-7,0.0025347364,0.00022854739,0.17550854,0.6951664,0.0006290311,0.12540127],"study_design_scores_gemma":[0.00002982885,0.00012826163,0.00038655373,0.000063436644,0.0000075043836,0.0000010983338,0.00070610974,0.0668086,0.59557503,0.3361497,0.000043500986,0.00010034543],"about_ca_topic_score_codex":0.000023421426,"about_ca_topic_score_gemma":0.000005277607,"teacher_disagreement_score":0.42006654,"about_ca_system_score_codex":0.000046906167,"about_ca_system_score_gemma":0.00005346086,"threshold_uncertainty_score":0.40457845},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8959714,0.00005205648,0.07392857,0.0017081319,0.003643756,0.0029018687,0.00005225345,0.0011191152,0.020622818],"genre_scores_gemma":[0.9993018,0.000021502767,0.00008739716,0.000029443829,0.000075129225,0.00006490969,0.0000026416353,0.000023853238,0.00039334298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988313,0.000008705972,0.00048320086,0.00020321964,0.00022395421,0.00024965688],"domain_scores_gemma":[0.99926245,0.00006124571,0.00017286802,0.00014142792,0.0003103529,0.000051648305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026528526,0.00016085927,0.00023744501,0.00012802138,0.000080746315,0.000053157208,0.0004194086,0.00012088702,0.00003494684],"category_scores_gemma":[0.00017486238,0.00013257778,0.00010407378,0.0006489786,0.000101646554,0.00013864963,0.0000406241,0.00016246534,0.000013081227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041839023,0.00009955021,0.0009234065,0.0007949751,0.00014079845,4.3524915e-7,0.0024079545,0.2268257,0.29969078,0.30488172,0.0030172328,0.16079904],"study_design_scores_gemma":[0.000036349407,0.00007921399,0.00011528295,0.00010148154,0.000013628949,6.467503e-7,0.0005603449,0.8893729,0.10153317,0.0079197185,0.00014471359,0.00012255638],"about_ca_topic_score_codex":0.000017696186,"about_ca_topic_score_gemma":0.000024628507,"teacher_disagreement_score":0.66254723,"about_ca_system_score_codex":0.000027189371,"about_ca_system_score_gemma":0.000015918664,"threshold_uncertainty_score":0.54063654},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9615083,0.00007752711,0.01021646,0.005712616,0.0006866631,0.0008045743,0.0000017985193,0.00026587993,0.020726224],"genre_scores_gemma":[0.99924016,0.000047358106,0.00020822247,0.000029054088,0.000012306052,0.000015737565,1.5355889e-7,0.0000055626633,0.0004414335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984576,0.000083243605,0.000385825,0.0002869956,0.00050692214,0.0002794065],"domain_scores_gemma":[0.9985548,0.00065281993,0.00033942013,0.00019380034,0.0002147196,0.00004439831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002094418,0.00014584363,0.00028209033,0.00015034553,0.00042421021,0.00012794948,0.0018053768,0.000051279396,0.000023140688],"category_scores_gemma":[0.0012673823,0.000084288724,0.00016768392,0.0013283821,0.00022625896,0.00023893728,0.0009620931,0.00035166572,0.000075646494],"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.00012594675,0.000033555472,0.006811631,0.000056764533,0.00009332322,0.0000012288959,0.0050130095,0.002260839,0.010915887,0.85089296,0.000103718376,0.123691104],"study_design_scores_gemma":[0.00012615277,0.00087833434,0.0072249956,0.00019758864,0.00010637452,0.000002655178,0.0026002575,0.3909572,0.50129074,0.09552014,0.00072033406,0.00037524663],"about_ca_topic_score_codex":0.00005740843,"about_ca_topic_score_gemma":0.000014137488,"teacher_disagreement_score":0.7553729,"about_ca_system_score_codex":0.000022938719,"about_ca_system_score_gemma":0.000030026662,"threshold_uncertainty_score":0.34371942},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9775677,0.000003271793,0.019026011,0.0013960239,0.0002232446,0.0009919294,0.000006783672,0.00023443424,0.0005506556],"genre_scores_gemma":[0.99907666,0.000018611636,0.00028544624,0.0002002713,0.000044574797,0.000224657,0.0000011639436,0.000017123766,0.00013147625],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998214,0.00002874755,0.00044734165,0.00063128106,0.00031474466,0.00036388205],"domain_scores_gemma":[0.9990854,0.00020943423,0.00021953424,0.00015134818,0.00026293233,0.000071316885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049715367,0.00019356601,0.00026946442,0.0006648295,0.00022766899,0.00013898213,0.000772433,0.000091632966,0.000008996068],"category_scores_gemma":[0.00050350954,0.00016066586,0.00016458715,0.0038278073,0.000074836185,0.00017708585,0.00015131869,0.0002414945,0.00006231212],"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.0001908202,0.00014701033,0.00048481225,0.00010193416,0.00003267016,4.3991264e-7,0.004933706,0.007108212,0.9128186,0.021791765,0.00003754059,0.0523525],"study_design_scores_gemma":[0.000020535306,0.0001572315,0.0003124424,0.000034070803,0.000025257426,6.6203296e-7,0.0006232399,0.41277787,0.57547593,0.01039749,0.000058093436,0.0001171885],"about_ca_topic_score_codex":0.000041455114,"about_ca_topic_score_gemma":0.000053134743,"teacher_disagreement_score":0.40566966,"about_ca_system_score_codex":0.00004477336,"about_ca_system_score_gemma":0.000024449164,"threshold_uncertainty_score":0.65517634},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99674195,0.000011983272,0.00092446373,0.000053298187,0.00047090356,0.00044102193,0.000015453435,0.0005751784,0.0007657429],"genre_scores_gemma":[0.9991442,0.000027929493,0.00051744963,0.000028137394,0.00015475063,0.00001774716,0.0000032544417,0.000065309774,0.000041245028],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9977443,0.000021070298,0.0005954199,0.00048265,0.0004286333,0.0007278956],"domain_scores_gemma":[0.9991426,0.00015049388,0.00018869944,0.00019884323,0.00018939721,0.00013000765],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022790766,0.00041740853,0.0004393119,0.00019580834,0.00028705763,0.00010558385,0.0006985944,0.00011588546,0.000033739718],"category_scores_gemma":[0.00017210733,0.00035642122,0.00021723201,0.0011589496,0.00022263911,0.00030366483,0.00011263567,0.0006241763,0.000064589185],"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.000054768916,0.000059134258,0.00009906522,0.00012311147,0.000021578673,0.0000034030277,0.0012987249,0.23376703,0.75342613,0.00097288453,0.000012278786,0.010161881],"study_design_scores_gemma":[0.000043519234,0.00006842659,0.00022408967,0.00025581886,0.000012158162,0.0000017188064,0.000398498,0.47048151,0.52790445,0.00039210482,0.0000023112611,0.00021541958],"about_ca_topic_score_codex":0.000012482299,"about_ca_topic_score_gemma":0.000011934076,"teacher_disagreement_score":0.23671448,"about_ca_system_score_codex":0.00008747515,"about_ca_system_score_gemma":0.000036594898,"threshold_uncertainty_score":0.9998888},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91873604,0.000027969518,0.07879762,0.00049108826,0.00023437593,0.0007339919,0.000030384777,0.00031461843,0.0006339081],"genre_scores_gemma":[0.9985738,0.000048235393,0.0011780398,0.000016960708,0.000024184134,0.00006130743,0.000010965322,0.00002444562,0.00006210489],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913996,0.000008724915,0.00027000226,0.0002054463,0.00018607019,0.00018980545],"domain_scores_gemma":[0.9992557,0.00015280396,0.00013303121,0.00014365389,0.00028248504,0.00003228485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001447,0.00013929837,0.00014660548,0.000069637965,0.00018395578,0.000045536442,0.00035503114,0.00004396939,0.000007686367],"category_scores_gemma":[0.00010120903,0.00010909892,0.000052199965,0.0003915016,0.00012247164,0.00016933959,0.000060848564,0.00012875911,0.000011575315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005672399,0.000047682362,0.00015516042,0.00020041384,0.000065893626,7.266844e-7,0.0015554026,0.5114432,0.2739845,0.18148668,0.00006099869,0.030432131],"study_design_scores_gemma":[0.000027158645,0.00008949541,0.0001325796,0.00015159133,0.000010562881,0.0000022986724,0.0004604111,0.5523833,0.42728248,0.01933798,0.000008836883,0.00011332173],"about_ca_topic_score_codex":0.0000033826839,"about_ca_topic_score_gemma":0.000014146858,"teacher_disagreement_score":0.1621487,"about_ca_system_score_codex":0.000033957906,"about_ca_system_score_gemma":0.00001704883,"threshold_uncertainty_score":0.44489247},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10695067,0.00003779516,0.8765483,0.012992224,0.0007227783,0.0014862854,0.000020965907,0.00014006227,0.0011009258],"genre_scores_gemma":[0.9797114,0.0003058645,0.018889267,0.0003000494,0.00006356739,0.000113625516,0.000059696307,0.00001820882,0.0005382993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813634,0.00002607091,0.00050166855,0.0005565445,0.00048531173,0.0002940748],"domain_scores_gemma":[0.99898624,0.00012300185,0.00031169818,0.0003561009,0.0001670255,0.000055930446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009931579,0.00015954135,0.00016372674,0.0002323655,0.00019576559,0.00037180138,0.0016036415,0.0000657283,0.00003708991],"category_scores_gemma":[0.00022061547,0.00013983296,0.000051037565,0.00073757797,0.00011069633,0.0020552885,0.00045507343,0.0001428801,0.000081803635],"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.00009617379,0.00012316182,0.00041449792,0.00006347595,0.000014683843,7.6214127e-7,0.0061175902,0.011744808,0.030170063,0.73050857,0.00061332237,0.2201329],"study_design_scores_gemma":[0.00010120718,0.00011816025,0.0010391464,0.00014501283,0.0000052477735,9.697774e-7,0.0039473753,0.8145157,0.021391565,0.15733327,0.0012130309,0.0001893113],"about_ca_topic_score_codex":0.000016665896,"about_ca_topic_score_gemma":0.000011833585,"teacher_disagreement_score":0.8727608,"about_ca_system_score_codex":0.00006837337,"about_ca_system_score_gemma":0.00006002242,"threshold_uncertainty_score":0.57022226},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033149637,0.000009125968,0.95849127,0.006945554,0.0001842493,0.0005522905,0.00014715889,0.0002331136,0.00028760132],"genre_scores_gemma":[0.85437214,0.0000046221676,0.14493333,0.0003885544,0.00006363282,0.00010192329,0.000051292198,0.000021617336,0.00006287035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978948,0.000049134556,0.00046261062,0.0006665423,0.00047697237,0.00044994397],"domain_scores_gemma":[0.99817,0.0004599534,0.0004213365,0.00043951505,0.00041396217,0.000095220144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014536015,0.0002410972,0.00027189357,0.00024002718,0.00031026022,0.00050952035,0.001468897,0.00007712375,0.000017940025],"category_scores_gemma":[0.00096979184,0.00017234722,0.00008126881,0.0011306445,0.00013757803,0.0004705526,0.00021306609,0.00027306174,0.000043444088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058823056,0.00015593827,0.0010326225,0.00027164517,0.000055617726,0.0000037121297,0.004659869,0.005878971,0.06990818,0.55965215,0.0010841154,0.35670894],"study_design_scores_gemma":[0.00008418405,0.00024587812,0.00039360992,0.00040668604,0.000031969197,0.0000055737723,0.000621366,0.84914386,0.13357471,0.014081602,0.0011120086,0.00029856924],"about_ca_topic_score_codex":0.000052879477,"about_ca_topic_score_gemma":0.000029235243,"teacher_disagreement_score":0.8432649,"about_ca_system_score_codex":0.00003898314,"about_ca_system_score_gemma":0.00017501292,"threshold_uncertainty_score":0.70281154},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8359238,0.00009803586,0.15786308,0.0020915782,0.0016042071,0.00096256455,0.00014200728,0.00011784937,0.0011968879],"genre_scores_gemma":[0.9823056,0.0000041128847,0.016748004,0.0003567061,0.00021313978,0.000037906553,0.0000030532237,0.000037693964,0.00029381094],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99488425,0.000040000912,0.0015349675,0.0010551359,0.0019000378,0.00058561354],"domain_scores_gemma":[0.9945118,0.0027632632,0.0004365905,0.00037044947,0.001711786,0.00020613955],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0025198334,0.00037845015,0.00053452246,0.0006151094,0.00060472277,0.0020455655,0.0019341353,0.00012282256,0.0006339412],"category_scores_gemma":[0.005820286,0.00027138946,0.00034009153,0.001345815,0.00031611283,0.00079214846,0.0006598315,0.0002541866,0.00019165082],"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.00041016928,0.00009961039,0.00018689639,0.000046287827,0.00002686996,9.941384e-7,0.0010520419,0.0011775404,0.8385643,0.048964985,0.004165074,0.10530528],"study_design_scores_gemma":[0.000050077164,0.00018418927,0.00018913313,0.0008357636,0.000031215124,0.00002102671,0.0021936113,0.46376,0.4674462,0.06254771,0.0023793261,0.00036174912],"about_ca_topic_score_codex":0.000038881135,"about_ca_topic_score_gemma":0.000023358307,"teacher_disagreement_score":0.46258244,"about_ca_system_score_codex":0.00015071526,"about_ca_system_score_gemma":0.00016711357,"threshold_uncertainty_score":0.99997383},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08619178,0.00083184434,0.8575628,0.029854802,0.004132107,0.0058722734,0.00034186253,0.0014145575,0.013797975],"genre_scores_gemma":[0.97758776,0.00023418541,0.019780023,0.00020991538,0.00022220684,0.00016282273,0.0000044633507,0.00004697627,0.0017516474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9962267,0.000024146158,0.0010136388,0.0013762092,0.00082387077,0.0005353874],"domain_scores_gemma":[0.99668133,0.00017432876,0.0007111288,0.0006526503,0.0016196432,0.00016090985],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001135656,0.0005534402,0.0005682816,0.00023900473,0.00029744438,0.0018386082,0.0031724388,0.00041070362,0.00004189403],"category_scores_gemma":[0.0006250326,0.00043052997,0.00027337388,0.0005572588,0.0008077384,0.00036424294,0.0034890906,0.0009768978,0.000055455137],"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.0001701129,0.00017729186,0.000015214309,0.00067308126,0.000052598225,8.8433933e-7,0.000799074,0.000003155284,0.07892071,0.8014686,0.00031127705,0.11740798],"study_design_scores_gemma":[0.000028788818,0.00017033091,0.000029240193,0.00033562648,0.00003118932,0.0000052106066,0.00007838849,0.07959083,0.4951804,0.42407924,0.00017328042,0.00029748693],"about_ca_topic_score_codex":0.00003114249,"about_ca_topic_score_gemma":0.0000014576502,"teacher_disagreement_score":0.891396,"about_ca_system_score_codex":0.00015762969,"about_ca_system_score_gemma":0.00040174447,"threshold_uncertainty_score":0.9998146},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12756895,0.00026840632,0.8433978,0.0043323715,0.0012420489,0.0022055455,0.00002731172,0.0017435612,0.019214025],"genre_scores_gemma":[0.9804621,0.00011371739,0.018622506,0.00008981922,0.00014994606,0.00005928431,0.0000011930014,0.000036742465,0.00046470435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99710065,0.000028023165,0.00052518246,0.0011409845,0.0007808669,0.00042426586],"domain_scores_gemma":[0.9971713,0.000071815884,0.0006340452,0.00032286957,0.0016981498,0.0001018453],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046397492,0.000491132,0.0004688711,0.0003068085,0.00025822915,0.0006838111,0.0020394283,0.00026082605,0.000033249355],"category_scores_gemma":[0.00064424187,0.00034970068,0.00023920354,0.00095663534,0.00033351028,0.0004751246,0.0026509762,0.0020550457,0.000040601255],"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.00032983028,0.0002070634,0.0009021231,0.00029323684,0.00013030444,0.0000066645653,0.0064654923,0.00064900663,0.015345457,0.8792359,0.0002388217,0.09619608],"study_design_scores_gemma":[0.000024358535,0.00041600404,0.00009627916,0.0009857184,0.000042483258,0.000008249794,0.0011125952,0.07627912,0.5082728,0.41222432,0.0001286022,0.00040940967],"about_ca_topic_score_codex":0.0006194851,"about_ca_topic_score_gemma":0.000036711055,"teacher_disagreement_score":0.8528931,"about_ca_system_score_codex":0.00030613402,"about_ca_system_score_gemma":0.00039405946,"threshold_uncertainty_score":0.9998955},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3435065,0.00062485266,0.44787356,0.038314678,0.002664153,0.0033966238,0.000025424182,0.003970628,0.1596236],"genre_scores_gemma":[0.9931769,0.000058819736,0.006080325,0.00020765488,0.000043276363,0.00004584512,0.0000011715839,0.000016058371,0.00036994234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979064,0.0000117205545,0.0005108686,0.0006096595,0.00062584504,0.00033551306],"domain_scores_gemma":[0.9989763,0.00015737458,0.00019321538,0.000319325,0.00025797728,0.00009582549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074391894,0.00025092537,0.00022490164,0.00019891058,0.000177582,0.00088542176,0.0017928829,0.00008842062,0.000066190914],"category_scores_gemma":[0.00023985984,0.00018790143,0.00009254986,0.00050922483,0.00022415807,0.0005783322,0.00072306086,0.0004411521,0.000064556385],"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.000023673267,0.00008103678,0.00023343493,0.00012354221,0.000026972004,0.0000033790343,0.0017459533,0.00014458416,0.016096476,0.8221167,0.0008960785,0.15850823],"study_design_scores_gemma":[0.0000359361,0.0005660709,0.0006262763,0.0015319948,0.00003338764,0.00001357159,0.00043638743,0.3179118,0.6049635,0.06971022,0.0036596796,0.000511221],"about_ca_topic_score_codex":0.000060278155,"about_ca_topic_score_gemma":0.0000052621067,"teacher_disagreement_score":0.7524064,"about_ca_system_score_codex":0.000060165552,"about_ca_system_score_gemma":0.00011120601,"threshold_uncertainty_score":0.85381424},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74409544,0.000039589406,0.24907994,0.0009596501,0.00057211757,0.0004986966,0.000002124263,0.0001257624,0.004626701],"genre_scores_gemma":[0.9943718,0.000006775467,0.0053921323,0.000046109897,0.00007273814,0.000022748822,2.8982373e-7,0.000016465081,0.000070973416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791354,0.000010547905,0.00054068066,0.00063832157,0.00055187463,0.00034504366],"domain_scores_gemma":[0.99900067,0.00009558382,0.00023509191,0.000252481,0.0003519709,0.00006421376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005157097,0.00022935469,0.00022269921,0.00023760562,0.00012528668,0.00063942,0.001242612,0.0000936663,0.000028178805],"category_scores_gemma":[0.000113967966,0.00016824163,0.00006260532,0.00079992606,0.0001251993,0.00097430055,0.00028726752,0.00044778714,0.000025282676],"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.000045374345,0.00014962372,0.00076920376,0.00015253824,0.000020976073,0.000007096199,0.0042032213,0.004830308,0.0704535,0.7269431,0.0000054501234,0.19241965],"study_design_scores_gemma":[0.000028996965,0.000083711006,0.0010814695,0.00090973807,0.000013291168,0.000010900855,0.0013803703,0.6839556,0.28476357,0.02748633,0.000013452143,0.0002725317],"about_ca_topic_score_codex":0.00029638357,"about_ca_topic_score_gemma":0.000055942255,"teacher_disagreement_score":0.69945675,"about_ca_system_score_codex":0.0001525405,"about_ca_system_score_gemma":0.00025087557,"threshold_uncertainty_score":0.6860695},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9535629,0.00017940994,0.0075551495,0.022855587,0.0015875904,0.003111057,0.00028190154,0.00025452554,0.010611849],"genre_scores_gemma":[0.9973298,0.00014568314,0.00090462266,0.00040567646,0.00054101355,0.0002076208,0.00002298772,0.000038294093,0.00040434216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971892,0.000019024028,0.0010282736,0.0005630382,0.00063012127,0.0005703164],"domain_scores_gemma":[0.9978621,0.00013770934,0.00030198114,0.00022154873,0.0011926629,0.00028402242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015029929,0.0002560067,0.00044903808,0.00020182593,0.00030726043,0.00021557769,0.0003634528,0.00020225678,0.000105216386],"category_scores_gemma":[0.00029955013,0.00018496126,0.00018910282,0.00057718146,0.00016625528,0.00033659814,0.00005282717,0.0004814804,0.00003547144],"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.00016121751,0.0001807636,0.0006251159,0.0009346504,0.0000294696,3.1395243e-7,0.003192276,0.0000025789443,0.005415209,0.70203733,0.00024650624,0.28717458],"study_design_scores_gemma":[0.0004252328,0.0071753105,0.033893757,0.00594835,0.00024182546,0.00006395716,0.03200178,0.12750036,0.21394937,0.5096891,0.0674464,0.0016645875],"about_ca_topic_score_codex":0.0005197957,"about_ca_topic_score_gemma":0.00009082554,"teacher_disagreement_score":0.28551,"about_ca_system_score_codex":0.00033058357,"about_ca_system_score_gemma":0.0011286957,"threshold_uncertainty_score":0.7542501},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011870293,0.00011187748,0.9817971,0.0039044395,0.00017855324,0.0005139511,0.00004829783,0.0002588985,0.0013165948],"genre_scores_gemma":[0.8290677,0.000019277222,0.17067547,0.000098863115,0.000015923772,0.0000825526,0.0000022672891,0.000008871597,0.00002906191],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983663,0.000007808579,0.00060339837,0.00036379285,0.00046697876,0.0001917055],"domain_scores_gemma":[0.9987974,0.00014151132,0.00023452772,0.0001952586,0.0005855695,0.000045710374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006508945,0.00016635127,0.00020836653,0.00016848468,0.00012911882,0.00017250559,0.0010693063,0.00009445654,0.000013023707],"category_scores_gemma":[0.0002827922,0.00012601932,0.00018172197,0.00048910116,0.0001754854,0.00054167944,0.00006599689,0.00022383999,0.0000051303196],"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.000038182225,0.00012502303,0.0000027641852,0.0003334986,0.000010779999,1.5345738e-7,0.0013951095,0.0010572879,0.031533934,0.883655,0.00008322874,0.08176503],"study_design_scores_gemma":[0.000009645031,0.00005142112,0.000010247062,0.00028724078,0.000009892212,6.834039e-7,0.00006562243,0.39124587,0.27306664,0.33517897,0.000004022027,0.00006973094],"about_ca_topic_score_codex":0.000037414924,"about_ca_topic_score_gemma":0.0000058428004,"teacher_disagreement_score":0.81719744,"about_ca_system_score_codex":0.00006730098,"about_ca_system_score_gemma":0.0002919686,"threshold_uncertainty_score":0.51389194},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09291839,0.000109100045,0.8926831,0.00680894,0.0012713184,0.001474514,0.0013387179,0.0012081945,0.0021877314],"genre_scores_gemma":[0.9244611,0.000053950436,0.07473884,0.00013438097,0.00015033665,0.00008777264,0.00030192794,0.000020145339,0.00005149542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99751437,0.00003347358,0.00059366476,0.0008098823,0.00070639054,0.00034223218],"domain_scores_gemma":[0.99874204,0.00005650764,0.00027995274,0.000497598,0.00033680504,0.00008708286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007239334,0.00029580435,0.00023795941,0.00023084348,0.00020053539,0.0006815233,0.001593696,0.00011113501,0.000046497214],"category_scores_gemma":[0.00012530109,0.00021492474,0.00008063911,0.00077032065,0.00019052214,0.0012611381,0.0004073641,0.00038035895,0.00009062906],"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.0001266198,0.00038329238,0.00005111853,0.0001584205,0.00006879586,0.000012825081,0.0010540897,0.000449368,0.02007858,0.55424017,0.013227607,0.4101491],"study_design_scores_gemma":[0.000020311807,0.00048737958,0.00003225842,0.0006580057,0.000026064208,0.000026337888,0.00007797438,0.58155906,0.32780945,0.088653654,0.00039469512,0.00025480945],"about_ca_topic_score_codex":0.00023450836,"about_ca_topic_score_gemma":0.000059287482,"teacher_disagreement_score":0.8315428,"about_ca_system_score_codex":0.00012330452,"about_ca_system_score_gemma":0.00024894805,"threshold_uncertainty_score":0.87643766},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3614569,0.00024461577,0.6356209,0.0010717002,0.0001155091,0.00037586575,3.0330906e-7,0.000076590906,0.0010376105],"genre_scores_gemma":[0.9951993,0.000039865812,0.004448939,0.00011141737,0.000040565603,0.000053240383,3.2670252e-7,0.00000927099,0.00009706112],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99912333,0.000008752754,0.0001777306,0.00035618138,0.00017891773,0.00015510172],"domain_scores_gemma":[0.99956536,0.00012253679,0.000055457054,0.000059837443,0.00015455771,0.00004223865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002141363,0.00012983156,0.00013197669,0.00007676356,0.00020329072,0.0004720774,0.00022564048,0.00004113699,0.000006642501],"category_scores_gemma":[0.0000655277,0.000089005385,0.00002742406,0.00024878496,0.0001471258,0.0005063021,0.000053678545,0.00012332205,0.0000021543997],"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.00004688246,0.00002345255,0.000079984886,0.00038589168,0.000014899021,3.3485318e-7,0.010412678,0.000041340132,0.09473149,0.41377053,0.0000146007405,0.48047793],"study_design_scores_gemma":[0.000048537873,0.0004036711,0.00020052979,0.00065405935,0.00002487713,0.00000694947,0.00086993753,0.3321708,0.63750523,0.027849682,0.000102545244,0.00016317095],"about_ca_topic_score_codex":0.000008639439,"about_ca_topic_score_gemma":0.0000043504488,"teacher_disagreement_score":0.6337424,"about_ca_system_score_codex":0.000015649091,"about_ca_system_score_gemma":0.000032566564,"threshold_uncertainty_score":0.45522532},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9579514,0.0002445696,0.029483471,0.0055679292,0.0015300595,0.0005453385,0.0000033709057,0.00021762894,0.0044562113],"genre_scores_gemma":[0.99667794,0.000030258632,0.0029926086,0.00009388861,0.00009978311,0.000015224972,4.87185e-7,0.000016710032,0.000073114745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980199,0.000022846063,0.00047876543,0.00067084236,0.0004520598,0.00035562305],"domain_scores_gemma":[0.99909097,0.00021499964,0.00022422605,0.00022130548,0.00017875145,0.00006974924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065598206,0.0002569276,0.00030430386,0.00023976118,0.00014111174,0.0003421038,0.00126676,0.00011466711,0.00002596744],"category_scores_gemma":[0.00029842084,0.00018395987,0.000059965245,0.0006590508,0.00038922037,0.00055400614,0.00043619258,0.00075191783,0.000018014514],"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.00010249297,0.00008106072,0.0047307573,0.00013700374,0.000015994892,0.000043843444,0.006663344,0.0012518478,0.006811678,0.9276916,0.000024847557,0.05244557],"study_design_scores_gemma":[0.00036159114,0.0011599715,0.0607995,0.0045651672,0.00013314924,0.00026182746,0.0054602106,0.54510534,0.052687205,0.3269236,0.00067776657,0.0018646786],"about_ca_topic_score_codex":0.00012946945,"about_ca_topic_score_gemma":0.000064317515,"teacher_disagreement_score":0.60076797,"about_ca_system_score_codex":0.000118773234,"about_ca_system_score_gemma":0.00013255679,"threshold_uncertainty_score":0.75016654},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9470729,0.00028527272,0.0020057154,0.0019727887,0.0014704103,0.00042496892,0.000027331142,0.00011212768,0.04662849],"genre_scores_gemma":[0.9985701,0.0000109730045,0.00012313192,0.000051215196,0.00011659725,0.000022823027,6.168315e-7,0.000021430347,0.0010831559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982782,0.0000100603975,0.00087433663,0.00045837043,0.00007929258,0.00029973115],"domain_scores_gemma":[0.9993602,0.0000887069,0.00028402093,0.0001362402,0.00008616791,0.00004468172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013981315,0.00017843126,0.00033676845,0.0002617999,0.000079283665,0.00021217858,0.0006156402,0.00010318161,0.00020893943],"category_scores_gemma":[0.000427803,0.00015128434,0.00012818706,0.000642336,0.00015944545,0.0002630472,0.0001060408,0.00034298623,0.0005915837],"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.000023762375,0.000058382673,0.008556986,0.0001303851,0.000011026594,8.9612894e-7,0.0015670789,0.000054414726,0.00134559,0.9838296,0.0000478939,0.0043739765],"study_design_scores_gemma":[0.000048677153,0.00012045229,0.0017117423,0.001405314,0.0000070749284,0.000006674726,0.0018290575,0.12108542,0.055551454,0.81653255,0.0012363384,0.0004652737],"about_ca_topic_score_codex":0.00021944928,"about_ca_topic_score_gemma":0.000029651004,"teacher_disagreement_score":0.16729708,"about_ca_system_score_codex":0.000062484614,"about_ca_system_score_gemma":0.000025232071,"threshold_uncertainty_score":0.7603809},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9296006,0.0004344614,0.0008350635,0.0061776643,0.0012838544,0.00092788646,0.0000021588207,0.00046092094,0.060277406],"genre_scores_gemma":[0.99712193,0.00014641488,0.00022794247,0.000055485845,0.00032351058,0.000034441557,0.0000013721585,0.000027870114,0.0020610173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981192,0.00003870793,0.0004768582,0.00042235543,0.00046751124,0.0004753659],"domain_scores_gemma":[0.99889636,0.00029896773,0.00016622916,0.00009266618,0.0004534481,0.000092302536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012481144,0.0001981706,0.00024746516,0.00017896127,0.0012858845,0.0005493252,0.0007883274,0.00018246716,0.00020522512],"category_scores_gemma":[0.0006465753,0.00015337481,0.0002226,0.00080302433,0.0005706243,0.00024359617,0.00007422813,0.00051134307,0.00004662385],"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.00003595794,0.000075154254,0.0002753442,0.00011555916,0.000049105827,5.659843e-7,0.064962864,0.00017364333,0.03476862,0.8247734,0.00031685946,0.07445293],"study_design_scores_gemma":[0.00008568778,0.0006452685,0.00012610556,0.003755325,0.00018749415,0.000002752072,0.17849721,0.043078303,0.31384867,0.44061232,0.01819729,0.00096358237],"about_ca_topic_score_codex":0.00022517121,"about_ca_topic_score_gemma":0.000057661124,"teacher_disagreement_score":0.38416108,"about_ca_system_score_codex":0.000055803674,"about_ca_system_score_gemma":0.00011277197,"threshold_uncertainty_score":0.9890114},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008410074,0.000022274819,0.9749536,0.0024696998,0.00059869216,0.00070521433,0.0000010497572,0.000387306,0.01245209],"genre_scores_gemma":[0.9834925,0.000016049571,0.01485545,0.00014135698,0.00009187429,0.00007202678,0.0000011894005,0.000030125098,0.0012994339],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971296,0.0000131663555,0.00085311115,0.0007581372,0.00071345596,0.00053251104],"domain_scores_gemma":[0.9980313,0.00034166744,0.0004312273,0.00042830606,0.00066487514,0.0001025819],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013788257,0.00030829263,0.00028758243,0.00024175292,0.00036792862,0.000845509,0.0020163995,0.0001231203,0.00004520314],"category_scores_gemma":[0.0012638832,0.00024862651,0.0002616786,0.00065961457,0.00016878858,0.0005421879,0.00039375538,0.00067406887,0.00008157375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003265151,0.00001953699,0.000024560439,0.00012119986,0.000016506714,4.578669e-7,0.0007804049,0.5530468,0.010568021,0.41961005,0.00009035451,0.015689429],"study_design_scores_gemma":[0.000024737457,0.0001936874,0.000010342484,0.0005155158,0.000015321222,0.0000021290934,0.00018343565,0.7680879,0.20214465,0.02838434,0.00022300846,0.00021493163],"about_ca_topic_score_codex":0.000017395943,"about_ca_topic_score_gemma":0.0000012973638,"teacher_disagreement_score":0.9750824,"about_ca_system_score_codex":0.0001631186,"about_ca_system_score_gemma":0.0002966257,"threshold_uncertainty_score":0.9999966},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5550711,0.00012607574,0.40831646,0.024621723,0.002621531,0.0018199412,0.00004974611,0.00082615745,0.006547271],"genre_scores_gemma":[0.9921424,0.00008316903,0.0073661464,0.00012223827,0.000100371544,0.000038120226,5.873477e-7,0.00002250708,0.00012448485],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9977106,0.000024836954,0.00050221954,0.00070773903,0.0005619055,0.00049273274],"domain_scores_gemma":[0.99926805,0.00011327043,0.00010271389,0.00013742027,0.00021309649,0.00016542441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006409108,0.00033004247,0.0002901344,0.0003488159,0.00040346078,0.0006328971,0.0008892933,0.00013178143,0.000025072302],"category_scores_gemma":[0.00022565442,0.00019724447,0.00018731564,0.0010323736,0.00023309456,0.0005768377,0.00008341935,0.00053768896,0.0000639453],"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.00007142546,0.000036170266,0.0000036249849,0.00005658394,0.0000135678165,0.0000017835403,0.005527711,0.0000047704784,0.24356027,0.03527628,0.0000584848,0.7153893],"study_design_scores_gemma":[0.000045786786,0.0003464728,0.00014861977,0.00061678875,0.00002103004,0.000013321135,0.001790298,0.01663527,0.9500238,0.029858889,0.00016925269,0.00033049574],"about_ca_topic_score_codex":0.000053146334,"about_ca_topic_score_gemma":0.0000959763,"teacher_disagreement_score":0.71505886,"about_ca_system_score_codex":0.00006298762,"about_ca_system_score_gemma":0.000075309006,"threshold_uncertainty_score":0.8043396},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94324356,0.00018885235,0.018697148,0.0078011737,0.0014897704,0.0012492224,0.000026041113,0.00027048975,0.027033763],"genre_scores_gemma":[0.9982726,0.000020424115,0.0011604237,0.0002015459,0.0001481081,0.000028047309,8.745657e-7,0.0000152945,0.0001526743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99730086,0.000039980867,0.0008183698,0.0006917281,0.0007630452,0.00038599983],"domain_scores_gemma":[0.99815017,0.00016463414,0.0004394298,0.00063647894,0.0005189967,0.00009026211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092681916,0.00027916682,0.0003465033,0.00012894796,0.0002866179,0.00073553686,0.002384979,0.00011831884,0.00004369406],"category_scores_gemma":[0.00018485558,0.00017298113,0.00023136995,0.00054368813,0.00031059515,0.00064886606,0.00042136083,0.00046367783,0.00006002192],"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.00003676179,0.00025838052,0.00015012863,0.00015297857,0.000048389265,0.0000018596438,0.00730905,0.00046828508,0.117261656,0.8331396,0.00052435865,0.04064855],"study_design_scores_gemma":[0.000033870263,0.00009880754,0.00047065335,0.0006216913,0.000012176334,0.0000042711295,0.00074400264,0.23156095,0.57806927,0.18811364,0.00007070101,0.00019999816],"about_ca_topic_score_codex":0.00051736424,"about_ca_topic_score_gemma":0.000011108115,"teacher_disagreement_score":0.64502597,"about_ca_system_score_codex":0.00006941707,"about_ca_system_score_gemma":0.00017621898,"threshold_uncertainty_score":0.70927984},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7081295,0.00073864945,0.2837266,0.0011098424,0.0015007543,0.0011967801,0.000018698127,0.00022723916,0.00335189],"genre_scores_gemma":[0.9930973,0.00008581369,0.0064814757,0.000016608086,0.000070128524,0.000038027567,5.0092245e-7,0.000013803632,0.00019630874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807584,0.000015038288,0.00051082106,0.00067247695,0.00038342917,0.0003423961],"domain_scores_gemma":[0.9985783,0.00029840422,0.00016767773,0.00026837163,0.000584559,0.00010265564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009155541,0.00021779262,0.00026317628,0.00022165036,0.00028137935,0.0008081595,0.0011032515,0.00011090322,0.000007681231],"category_scores_gemma":[0.00041173474,0.00015487033,0.000121631485,0.0005488036,0.00018369255,0.00052898267,0.00031728062,0.00026619097,0.000018547205],"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.000048590227,0.00007914067,0.00028335652,0.0002206551,0.000026991971,0.000002462419,0.0022989977,0.0007772033,0.014601909,0.86517125,0.00009545704,0.116394006],"study_design_scores_gemma":[0.00002829854,0.00015052248,0.00036160595,0.0006622075,0.000016868966,0.000020089727,0.0009391513,0.91096735,0.013752862,0.07276878,0.0001199625,0.00021232088],"about_ca_topic_score_codex":0.00014962004,"about_ca_topic_score_gemma":0.000052503725,"teacher_disagreement_score":0.9101901,"about_ca_system_score_codex":0.00010513736,"about_ca_system_score_gemma":0.00016438971,"threshold_uncertainty_score":0.77931005},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98447454,0.00034627612,0.00017423888,0.0056469208,0.0006048136,0.0013456354,0.000026042315,0.00003558063,0.0073459796],"genre_scores_gemma":[0.99775845,0.000057692836,0.0009827601,0.0006642621,0.000056371304,0.0000770853,8.7960916e-7,0.000017317429,0.00038517924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99811566,0.00008526913,0.0004973903,0.00047244542,0.00037773547,0.00045151045],"domain_scores_gemma":[0.99935603,0.00006682451,0.000103489976,0.00013237502,0.00008039371,0.0002608991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011162978,0.00017488436,0.00022051563,0.000254429,0.00016360398,0.000099609846,0.00036540744,0.00005621009,0.00036544158],"category_scores_gemma":[0.00012411801,0.00014148053,0.000035053945,0.00048301346,0.00021594028,0.0001319778,0.0002898623,0.00039544137,0.000095414565],"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.0006456866,0.0003604718,0.0012417391,0.00029944707,0.000043262382,0.0000063275097,0.048364207,0.000010798487,0.031001639,0.79926276,0.0013273543,0.11743633],"study_design_scores_gemma":[0.0005089514,0.005678895,0.0059827827,0.010224104,0.00003982229,0.000058791415,0.0844058,0.08229187,0.6321617,0.17083412,0.006286565,0.0015265914],"about_ca_topic_score_codex":0.0016461499,"about_ca_topic_score_gemma":0.00007336647,"teacher_disagreement_score":0.62842864,"about_ca_system_score_codex":0.00027368852,"about_ca_system_score_gemma":0.00017151613,"threshold_uncertainty_score":0.57694083},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8507658,0.0008079326,0.05530728,0.001349246,0.002070471,0.0016699425,0.000010042639,0.0009966288,0.08702263],"genre_scores_gemma":[0.9972667,0.000034228993,0.00021207152,0.00002474044,0.00005694755,0.00005017661,3.5698585e-7,0.00002502418,0.002329755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987276,0.0000056392932,0.00050758186,0.00022883812,0.00024696387,0.00028332986],"domain_scores_gemma":[0.9996364,0.000039946448,0.000059517577,0.000093887575,0.00012296623,0.00004729663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033736083,0.00018301672,0.00023093584,0.00018179661,0.00005372866,0.0001382402,0.00037490515,0.000062995285,0.000053869713],"category_scores_gemma":[0.00007783907,0.00014323682,0.00008795059,0.00042249632,0.00007016867,0.00017551155,0.000056821686,0.0004392479,0.00007449463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038725804,0.00004093354,0.0003310116,0.0003243311,0.000040350904,0.0000017055726,0.0029181708,0.27062827,0.20351793,0.49029022,0.00024537786,0.03162294],"study_design_scores_gemma":[0.000024268978,0.000030619405,0.000026271906,0.0005560692,0.000007867544,7.945117e-7,0.0003964949,0.88992685,0.105516456,0.0031381967,0.00023236251,0.00014374811],"about_ca_topic_score_codex":0.000041364667,"about_ca_topic_score_gemma":0.00007290288,"teacher_disagreement_score":0.6192986,"about_ca_system_score_codex":0.000072433206,"about_ca_system_score_gemma":0.00003559197,"threshold_uncertainty_score":0.5841028},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7312461,0.00033850168,0.23167604,0.012087218,0.0019657402,0.0026054615,0.000059175247,0.00072115136,0.019300599],"genre_scores_gemma":[0.9950562,0.000030097954,0.0015297711,0.000032489384,0.00013547354,0.000047039193,9.740359e-7,0.000028932562,0.0031389997],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.993507,0.00019852057,0.0013620738,0.0013064657,0.0029495207,0.0006764176],"domain_scores_gemma":[0.9942891,0.001895123,0.00043361544,0.0007568269,0.0024120656,0.00021324196],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.006627342,0.00035644489,0.0005185211,0.0005431432,0.0005267726,0.00095717126,0.0031468899,0.00019778695,0.0022805005],"category_scores_gemma":[0.020441165,0.0002328263,0.0002946122,0.0034031065,0.0009137788,0.00086048443,0.0009839268,0.0014154225,0.0008652479],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011781075,0.00026367995,0.0011496444,0.00013667894,0.00006245491,0.000007704026,0.004713302,0.00035156612,0.11644496,0.06610196,0.00094901887,0.8086409],"study_design_scores_gemma":[0.000018798646,0.00017206816,0.00062000006,0.00015730312,0.000008808023,0.00000509652,0.00076768745,0.29460397,0.27187985,0.4299971,0.0015914859,0.00017782487],"about_ca_topic_score_codex":0.00007427278,"about_ca_topic_score_gemma":0.000032724023,"teacher_disagreement_score":0.8084631,"about_ca_system_score_codex":0.00013679855,"about_ca_system_score_gemma":0.0004402265,"threshold_uncertainty_score":0.9999127},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9317262,0.000024826435,0.015723664,0.0019587472,0.00031736557,0.00060299254,0.000056429035,0.00010794038,0.04948183],"genre_scores_gemma":[0.9980121,0.000003144746,0.0003511624,0.000017059358,0.00043449228,0.000028481554,0.0000042912393,0.000025323723,0.0011239402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979806,0.000026103555,0.0003441965,0.0005214495,0.0005889188,0.0005387127],"domain_scores_gemma":[0.9990391,0.000106609456,0.000054583063,0.00023104654,0.00037677772,0.00019185597],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004739296,0.00022035166,0.0002281059,0.00012299752,0.00022311429,0.00038348095,0.00096533465,0.00005005987,0.0013748186],"category_scores_gemma":[0.000028942637,0.00016012749,0.00017635217,0.0006321814,0.00042453586,0.0004099939,0.00026448246,0.0006929179,0.0005356891],"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.00006767213,0.00021945039,0.00040578347,0.000021806558,0.000035080633,4.3237054e-7,0.0007012969,0.00007986553,0.07487253,0.5714569,0.00012749332,0.35201165],"study_design_scores_gemma":[0.000017591321,0.00033542296,0.00010353679,0.00021973591,0.000013861041,4.1294155e-7,0.0023272987,0.026580552,0.92577815,0.044184092,0.00025333677,0.00018598315],"about_ca_topic_score_codex":0.00017063208,"about_ca_topic_score_gemma":0.0000013908189,"teacher_disagreement_score":0.85090566,"about_ca_system_score_codex":0.000030426074,"about_ca_system_score_gemma":0.00022846638,"threshold_uncertainty_score":0.99953806},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56457853,0.00030174135,0.3666732,0.042894833,0.0011501852,0.0022027267,0.000033807697,0.00097585784,0.021189112],"genre_scores_gemma":[0.98876953,0.00007832235,0.009905331,0.0007757467,0.00006332347,0.000045528257,3.9519324e-7,0.000021713959,0.00034009427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99777085,0.000028579598,0.0004893464,0.00076897285,0.00055871095,0.00038356005],"domain_scores_gemma":[0.9982868,0.00044861904,0.00016521278,0.0003442533,0.00055647077,0.00019865985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052691804,0.0003046528,0.00033956423,0.00027221334,0.00025319934,0.00081683556,0.0014443261,0.00014867647,0.00011734932],"category_scores_gemma":[0.00053173455,0.00020610754,0.000093626055,0.0011215743,0.00032227533,0.00044772582,0.0004574464,0.00047378129,0.00016890862],"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.00007033168,0.000051252802,0.00006538776,0.00004210929,0.000019836549,0.0000039388715,0.001368468,7.8731733e-7,0.0061658532,0.59944755,0.00011049182,0.392654],"study_design_scores_gemma":[0.00009685914,0.0007895549,0.00023995215,0.004976886,0.00005810654,0.00010354777,0.0058441935,0.09282404,0.6740576,0.21744195,0.0027066793,0.0008606582],"about_ca_topic_score_codex":0.000038150356,"about_ca_topic_score_gemma":0.000035053363,"teacher_disagreement_score":0.66789174,"about_ca_system_score_codex":0.000053907857,"about_ca_system_score_gemma":0.00012584346,"threshold_uncertainty_score":0.8404821},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7477295,0.0001685779,0.24347606,0.00092901813,0.0031076078,0.0018485554,0.0000062276486,0.00020346667,0.00253101],"genre_scores_gemma":[0.99757046,0.000004955779,0.0019658387,0.000019373523,0.00011413391,0.00011390381,3.8690644e-7,0.000016658529,0.00019428908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981774,0.00007242379,0.00055482966,0.00046771558,0.00044252264,0.00028511148],"domain_scores_gemma":[0.9979309,0.0010150133,0.00030074283,0.00023553922,0.00047398708,0.00004385996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021072263,0.0002065287,0.00027371183,0.00012194631,0.00028063232,0.00033357998,0.0012821867,0.0000772733,0.00000283948],"category_scores_gemma":[0.001595576,0.00012809648,0.00023702542,0.0006831424,0.00017181959,0.0004443465,0.00023313776,0.00031534885,0.000011660157],"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.000018104822,0.000022923665,0.00022538504,0.00045999544,0.000038985658,1.8680988e-7,0.0014207397,0.0004154795,0.122427344,0.8554858,0.0000094917805,0.019475557],"study_design_scores_gemma":[0.00002913569,0.00027525512,0.00044436668,0.003820866,0.000033339304,0.0000060664806,0.00047382255,0.08955871,0.7223067,0.18254493,0.00031567158,0.00019113139],"about_ca_topic_score_codex":0.000055876437,"about_ca_topic_score_gemma":0.000002042452,"teacher_disagreement_score":0.67294085,"about_ca_system_score_codex":0.00006139854,"about_ca_system_score_gemma":0.0001378499,"threshold_uncertainty_score":0.5223623},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98059857,0.000035688336,0.010223669,0.0049498226,0.00041018298,0.00082166406,0.0000055775763,0.00014497116,0.0028098496],"genre_scores_gemma":[0.9987613,0.000010808471,0.0004834559,0.00037875262,0.00022638765,0.00004317366,0.0000016909831,0.000024751222,0.000069706366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846494,0.0000055039386,0.00038533477,0.0005045521,0.00034997324,0.00028969065],"domain_scores_gemma":[0.9992237,0.000055847366,0.00016660566,0.00014364196,0.00038583728,0.000024332468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004843178,0.00022613638,0.00020826337,0.00018967791,0.00021480166,0.00067400496,0.0004471371,0.000081064514,0.00006658088],"category_scores_gemma":[0.0005489486,0.00018078763,0.00006954233,0.00085065514,0.00023272318,0.0009837908,0.0005400465,0.00020085751,0.00007408253],"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.00025948614,0.00027781795,0.017609213,0.0014264467,0.000066854715,0.0000032985183,0.0015199394,0.020284576,0.023679877,0.87598795,0.00022395518,0.058660578],"study_design_scores_gemma":[0.000112437054,0.00020449665,0.025042497,0.002571558,0.00023802422,0.000011967471,0.011056222,0.6467488,0.21777573,0.092311494,0.002399593,0.001527218],"about_ca_topic_score_codex":0.00015034729,"about_ca_topic_score_gemma":0.00002566768,"teacher_disagreement_score":0.78367645,"about_ca_system_score_codex":0.00011607144,"about_ca_system_score_gemma":0.000026710328,"threshold_uncertainty_score":0.73723054},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3033201,0.0005375016,0.56564444,0.1117366,0.0016021829,0.0032401949,0.000055497534,0.0010164359,0.012847039],"genre_scores_gemma":[0.9951542,0.000040680654,0.0033641953,0.00045406361,0.00016735148,0.00009351152,0.0000016041455,0.000017876127,0.00070649147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981551,0.000016979153,0.0003798504,0.00061505643,0.00042463592,0.0004083861],"domain_scores_gemma":[0.9989621,0.00018103466,0.00009429919,0.00022136518,0.00043723235,0.00010395634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035954974,0.00021844407,0.0002189276,0.00010927334,0.00030209488,0.00090558414,0.0015803708,0.00008345731,0.00005102151],"category_scores_gemma":[0.00007731055,0.0001558862,0.00018296747,0.00076251355,0.00020240583,0.0002682286,0.00027055998,0.00044014587,0.00005266229],"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.00003543681,0.000063656735,0.0000063640405,0.00006654659,0.000020656315,3.7892892e-7,0.00091178354,0.00017848826,0.0587662,0.8422218,0.00040136182,0.09732735],"study_design_scores_gemma":[0.000026080083,0.00019958323,0.000020633248,0.00023345859,0.00001760798,0.000009625433,0.00019335469,0.62928337,0.21102047,0.1572487,0.0015097912,0.00023731576],"about_ca_topic_score_codex":0.000021711137,"about_ca_topic_score_gemma":0.0000063959424,"teacher_disagreement_score":0.6918341,"about_ca_system_score_codex":0.00003581525,"about_ca_system_score_gemma":0.00010265359,"threshold_uncertainty_score":0.87325686},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34924272,0.0001334653,0.6446182,0.0010364684,0.00020965938,0.00077250344,0.000001422227,0.00019001738,0.0037955076],"genre_scores_gemma":[0.9911271,0.000019052455,0.008433295,0.000041686002,0.0000411945,0.00006206129,0.0000017377566,0.000020513324,0.0002533945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983033,0.000039482715,0.00041021092,0.0005558287,0.00037157125,0.00031962185],"domain_scores_gemma":[0.99895346,0.00021578652,0.00027584328,0.000084133026,0.00040589654,0.000064902386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007182416,0.00021545839,0.00021141801,0.00022891472,0.00031873272,0.0007754025,0.00040352604,0.00007402282,0.00001591054],"category_scores_gemma":[0.00030068686,0.0001660738,0.000055966037,0.0007009558,0.00021319976,0.0007972748,0.00014177985,0.00043371422,0.000007224325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029858883,0.000044665012,0.0067456113,0.00015093523,0.000028739685,0.0000035847231,0.01738469,0.014109967,0.008995055,0.84452814,0.00000606745,0.10770398],"study_design_scores_gemma":[0.00009853669,0.00044585144,0.0013770587,0.00091800897,0.000011250567,0.000012531258,0.004640845,0.94677055,0.019247694,0.025772326,0.00040654783,0.00029879546],"about_ca_topic_score_codex":0.000016521362,"about_ca_topic_score_gemma":0.000007929715,"teacher_disagreement_score":0.9326606,"about_ca_system_score_codex":0.0000712175,"about_ca_system_score_gemma":0.00009161367,"threshold_uncertainty_score":0.74772245},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85639596,0.000085300875,0.104178615,0.013717352,0.0007152574,0.0018384381,0.00014282725,0.00048292428,0.022443349],"genre_scores_gemma":[0.9975187,0.000011201906,0.0021205249,0.00007610272,0.000044557724,0.000013475391,0.000010070853,0.0000060306756,0.00019933963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837714,0.000012170224,0.0005519001,0.0003670216,0.00042572783,0.00026605194],"domain_scores_gemma":[0.9991873,0.00004616012,0.00014687565,0.0003496281,0.00020715909,0.0000628747],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005925805,0.00015303749,0.00017863559,0.00021317926,0.000093472045,0.0011217742,0.0022454276,0.000048032063,0.00012548399],"category_scores_gemma":[0.00021873284,0.00011773825,0.000053480693,0.0011754935,0.00006443259,0.0034894627,0.0007865933,0.00018122961,0.00020638284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000911266,0.00006895349,0.0001815896,0.00011209849,0.000029803714,0.0000013099362,0.0041100834,0.0029843836,0.013344861,0.7356688,0.0010868253,0.24232021],"study_design_scores_gemma":[0.000016081452,0.0002777468,0.00028512906,0.00021444984,0.000011486314,0.000003756902,0.0008266341,0.8364034,0.08279685,0.07839752,0.00057158666,0.00019530882],"about_ca_topic_score_codex":0.00016579352,"about_ca_topic_score_gemma":0.00007805571,"teacher_disagreement_score":0.8334191,"about_ca_system_score_codex":0.000050173272,"about_ca_system_score_gemma":0.00009303177,"threshold_uncertainty_score":0.9999152},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15994099,0.0003468825,0.76529807,0.02771968,0.0019608135,0.0012174333,0.000047758695,0.0017230952,0.04174531],"genre_scores_gemma":[0.99342895,0.000047004916,0.0055895215,0.00008522287,0.00008144856,0.000012582388,0.000012452976,0.000018439972,0.00072440604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775964,0.000039933137,0.00045946226,0.0008606156,0.00055496546,0.0003253998],"domain_scores_gemma":[0.99842215,0.00024747936,0.00020779014,0.00067869143,0.00035145646,0.00009245171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001008161,0.00024018751,0.00023326122,0.00016047238,0.00028712652,0.0008319628,0.0032093746,0.000082087005,0.00006952405],"category_scores_gemma":[0.00072896964,0.0001601406,0.000056191995,0.0010802791,0.0002453375,0.000883963,0.0007184174,0.0006576537,0.00012918562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044694647,0.000037163307,0.0002537219,0.000104880586,0.000030974257,0.0000014346797,0.0014384802,0.00019805918,0.020880226,0.6636298,0.00019940581,0.31318116],"study_design_scores_gemma":[0.000036937792,0.00013245705,0.00006630883,0.0006702936,0.000026519048,0.000015052103,0.00081449136,0.9252207,0.056876782,0.014308658,0.001572303,0.00025947572],"about_ca_topic_score_codex":0.000054550797,"about_ca_topic_score_gemma":0.0000082773895,"teacher_disagreement_score":0.92502266,"about_ca_system_score_codex":0.0000335615,"about_ca_system_score_gemma":0.00022731774,"threshold_uncertainty_score":0.8022637},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30148697,0.000039559807,0.68540126,0.0033662408,0.0003108179,0.0009887468,0.0000059537506,0.00031461156,0.008085832],"genre_scores_gemma":[0.9835305,0.0000051531506,0.015764402,0.000031384214,0.00010020585,0.00020784436,0.0000024713895,0.000020040206,0.0003379527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982537,0.000024694034,0.00043019128,0.0006511091,0.00036997715,0.0002702969],"domain_scores_gemma":[0.99860877,0.0002929282,0.00024458172,0.00026083636,0.00052371534,0.00006919991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005806557,0.00019887707,0.00018546934,0.0001350346,0.00034170476,0.00069173175,0.00095912593,0.00006036211,0.00002016503],"category_scores_gemma":[0.00030062164,0.00014382214,0.00010132497,0.0007375325,0.00019424543,0.00045783096,0.00020284748,0.00029937734,0.00007079534],"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.00005580997,0.00006515378,0.0012656536,0.00008332867,0.000019249786,1.779701e-7,0.0026090483,0.0022375034,0.019129882,0.91378355,0.00004326772,0.060707394],"study_design_scores_gemma":[0.00004633685,0.00026427247,0.0019293629,0.00030936993,0.000016878517,0.0000060454954,0.00033337943,0.720797,0.110062964,0.16492374,0.0010761997,0.00023442716],"about_ca_topic_score_codex":0.00008154387,"about_ca_topic_score_gemma":0.000010439144,"teacher_disagreement_score":0.74885976,"about_ca_system_score_codex":0.00008943336,"about_ca_system_score_gemma":0.00010549346,"threshold_uncertainty_score":0.6670385},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19758123,0.0001541812,0.7639186,0.021072378,0.0039166464,0.0042440034,0.000024190851,0.00088487286,0.008203905],"genre_scores_gemma":[0.9893613,0.000017181628,0.009935469,0.000064132866,0.000111236564,0.00017535423,0.0000025641348,0.000014043664,0.0003187317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983905,0.000036082125,0.0004383975,0.00054107,0.00033076113,0.00026317209],"domain_scores_gemma":[0.99860287,0.00049508153,0.00021640943,0.0002619978,0.0003628766,0.000060756916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005359041,0.0002058203,0.0002679215,0.00012847381,0.00016747249,0.00037875457,0.00084462704,0.00008121043,0.000017660515],"category_scores_gemma":[0.00086721266,0.00013857626,0.00015879975,0.00049964373,0.000082397804,0.00037401126,0.00010621954,0.00016962126,0.00004916746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084630396,0.000035829016,0.00022812717,0.00015180664,0.000020476115,5.1210606e-7,0.0013103333,0.00070657843,0.008203029,0.56844777,0.00010095352,0.42070994],"study_design_scores_gemma":[0.000042235213,0.00085962366,0.00014705704,0.00028727629,0.000019817975,0.000003862603,0.00006437882,0.7148152,0.21599393,0.067457125,0.00018339428,0.00012610429],"about_ca_topic_score_codex":0.00011583323,"about_ca_topic_score_gemma":0.00000860955,"teacher_disagreement_score":0.79178005,"about_ca_system_score_codex":0.00012338016,"about_ca_system_score_gemma":0.00013094573,"threshold_uncertainty_score":0.5650976},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07100577,0.00003927795,0.90908945,0.016132671,0.00011414281,0.0017790259,0.000027338048,0.0002011617,0.0016111726],"genre_scores_gemma":[0.9638398,0.00008589079,0.03476895,0.00030321672,0.00008755381,0.00026636245,0.000005623141,0.000024584318,0.0006180108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870974,0.0000029826272,0.0004299497,0.00040245298,0.0002480406,0.00020685703],"domain_scores_gemma":[0.99911857,0.000066201676,0.0001024823,0.00018985978,0.00042626273,0.00009662704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017491878,0.00016509667,0.00022505425,0.00010789815,0.00013011775,0.000054169843,0.00025743817,0.0000910334,0.000022131218],"category_scores_gemma":[0.00012790815,0.00012005881,0.00013997046,0.0004026064,0.000105630585,0.000116484975,0.000050190258,0.00018828218,0.000018252762],"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.00030636138,0.0001537399,0.00002349084,0.00015572629,0.000008146434,2.668802e-7,0.00059531786,0.00034580962,0.19743264,0.63751674,0.0006237435,0.162838],"study_design_scores_gemma":[0.000027185633,0.0001480123,0.000026371019,0.00044586483,0.000045607416,0.0000028798415,0.00014392313,0.44715816,0.26353556,0.28808397,0.0002794943,0.0001029629],"about_ca_topic_score_codex":0.000015936845,"about_ca_topic_score_gemma":0.000006703141,"teacher_disagreement_score":0.89283407,"about_ca_system_score_codex":0.00006532574,"about_ca_system_score_gemma":0.00007548348,"threshold_uncertainty_score":0.4895856},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25599307,0.00092380855,0.43207496,0.22610581,0.021288933,0.003495708,0.00022838509,0.007660294,0.05222902],"genre_scores_gemma":[0.982378,0.00024938097,0.01517226,0.00059517846,0.00019959702,0.000088376255,0.0000028324673,0.00004814438,0.0012662129],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9955266,0.000034587913,0.00096389453,0.0014757321,0.0011819357,0.00081724324],"domain_scores_gemma":[0.9949716,0.000332126,0.00047749412,0.0032237915,0.00083175616,0.0001632471],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0011505831,0.0005497703,0.00050468894,0.0004872143,0.00039976023,0.0014826381,0.028040735,0.00033256697,0.00021698051],"category_scores_gemma":[0.009907558,0.00043654765,0.00026399439,0.0023672627,0.00065274717,0.0015827877,0.021837763,0.0011496982,0.00072431134],"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.00006597132,0.0002362398,0.00020868225,0.00018495481,0.00009335174,0.000008678208,0.0023630296,0.000019675674,0.0222907,0.4025419,0.0975806,0.4744062],"study_design_scores_gemma":[0.000023871853,0.00018892405,0.00006696208,0.00058195804,0.000026013431,0.000029039045,0.00088731176,0.22899666,0.39461365,0.37096745,0.0031793066,0.0004388662],"about_ca_topic_score_codex":0.00014988476,"about_ca_topic_score_gemma":0.000019509327,"teacher_disagreement_score":0.72638494,"about_ca_system_score_codex":0.0002029188,"about_ca_system_score_gemma":0.0003873711,"threshold_uncertainty_score":0.9998086},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17123948,0.0002008339,0.81642354,0.008045771,0.0020291773,0.001052146,0.000075716634,0.00022148671,0.00071183516],"genre_scores_gemma":[0.98818475,0.000024528106,0.01142472,0.00004699998,0.00017065792,0.000040383933,0.000006013374,0.000018613428,0.00008330598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789584,0.000030070352,0.00047183913,0.00082238286,0.00042845623,0.0003514431],"domain_scores_gemma":[0.99869466,0.00041361043,0.00017477538,0.00041504196,0.00023146324,0.00007045657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091603736,0.0002392169,0.0002679308,0.00023506068,0.00020971775,0.00077916315,0.0027789352,0.000120711695,0.00001633385],"category_scores_gemma":[0.00093974185,0.00018971963,0.00006138843,0.00067959115,0.00026473647,0.0010329847,0.0013521032,0.00039385405,0.0000054781253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073285264,0.0000793349,0.00021631303,0.0001580905,0.000040050607,0.0000031238276,0.0028250183,0.014776793,0.0014796546,0.9012652,0.00012464954,0.0789585],"study_design_scores_gemma":[0.000051242732,0.00010754607,0.00011248413,0.00028865837,0.000028346027,0.000013139445,0.00050502893,0.94227135,0.0075712306,0.04862067,0.00019692851,0.00023335456],"about_ca_topic_score_codex":0.000068665904,"about_ca_topic_score_gemma":0.00006309565,"teacher_disagreement_score":0.9274946,"about_ca_system_score_codex":0.00004565175,"about_ca_system_score_gemma":0.0001811854,"threshold_uncertainty_score":0.7736542},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20044975,0.00002387324,0.7951964,0.00015516674,0.0011961646,0.00077535276,0.000040717696,0.0016200058,0.0005425523],"genre_scores_gemma":[0.9991504,0.000010121346,0.00042029377,0.000011466808,0.00016106798,0.00018364436,0.0000049816135,0.000028998547,0.000029005265],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987048,0.0000074687714,0.0004687871,0.0003195308,0.00025736607,0.00024203755],"domain_scores_gemma":[0.9995647,0.00006322035,0.00004955185,0.00011620871,0.00015613684,0.00005019497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003058306,0.00020008995,0.00017400672,0.0001404633,0.000120833,0.00020911702,0.00032926435,0.00010228077,0.0000357831],"category_scores_gemma":[0.000070308444,0.00016637304,0.00015484542,0.00022823142,0.00014937948,0.0003204009,0.000030466788,0.00025370828,0.000006380785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017651609,0.00011954811,0.000024633575,0.0010081289,0.000070566406,1.8725927e-7,0.0012730259,0.010507885,0.43201402,0.20500448,0.00037676937,0.34942424],"study_design_scores_gemma":[0.00002949735,0.00013921592,0.00017850245,0.00011949796,0.000034598357,0.0000010634409,0.00012614469,0.85228163,0.13048247,0.016460238,0.000026846063,0.00012029761],"about_ca_topic_score_codex":0.000008947987,"about_ca_topic_score_gemma":0.0000062428053,"teacher_disagreement_score":0.84177375,"about_ca_system_score_codex":0.000091960406,"about_ca_system_score_gemma":0.000020345708,"threshold_uncertainty_score":0.6784496},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91021574,0.000286903,0.0012274114,0.021629663,0.002631985,0.0008142212,0.000036540503,0.0002320059,0.06292555],"genre_scores_gemma":[0.9926408,0.000020268195,0.0002188039,0.0002860026,0.00014725169,0.00014399858,5.283057e-7,0.000020472013,0.0065218895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981421,0.000020596466,0.0003771641,0.00061698275,0.00042001085,0.00042311157],"domain_scores_gemma":[0.9991666,0.00005039046,0.00009601665,0.00021138179,0.0003548772,0.000120746015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003918683,0.00025856597,0.00027673168,0.00011153671,0.00014837016,0.00030424792,0.0008281932,0.00013380776,0.0008370692],"category_scores_gemma":[0.00005430331,0.00016107026,0.000180428,0.00064066146,0.00026834483,0.0001818759,0.00019816501,0.0003865194,0.00069839985],"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.00014799775,0.00026760923,0.00011972251,0.000018825456,0.000026616535,0.0000029158343,0.0034917628,0.0000075542257,0.0144652305,0.7134305,0.0033195585,0.26470166],"study_design_scores_gemma":[0.00007783909,0.0025296444,0.0022563112,0.0008105307,0.00025437408,0.000024743673,0.009911804,0.002965039,0.11842903,0.85383636,0.007842851,0.0010614776],"about_ca_topic_score_codex":0.00009072295,"about_ca_topic_score_gemma":0.000013594089,"teacher_disagreement_score":0.2636402,"about_ca_system_score_codex":0.000036947687,"about_ca_system_score_gemma":0.000020156072,"threshold_uncertainty_score":0.9165321},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036280148,0.000100737285,0.9585433,0.0015000544,0.00082641025,0.0007400939,0.000007494751,0.00020841071,0.0017933463],"genre_scores_gemma":[0.9458953,0.000027333357,0.053659428,0.000095457566,0.00010310607,0.00006216547,0.0000011783692,0.000013720867,0.00014231722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982524,0.000012155318,0.00046328438,0.00057258765,0.0003841279,0.00031543162],"domain_scores_gemma":[0.9988329,0.00013077968,0.00023269064,0.00023243079,0.0005093546,0.00006184888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041244453,0.00021317755,0.00020086905,0.00015205459,0.00021309042,0.00043698592,0.0012309616,0.00009464744,0.000016226333],"category_scores_gemma":[0.00026618195,0.00015671882,0.00012315201,0.0007320805,0.00014599411,0.00094526995,0.0002008364,0.00020891849,0.00002953789],"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.000013206125,0.000034750738,0.0000070033007,0.00008111246,0.000008091552,1.7701805e-7,0.0006139057,0.00023320604,0.030625103,0.751461,0.000030212335,0.21689221],"study_design_scores_gemma":[0.000009420753,0.00007123333,0.000008825896,0.00021214412,0.000006967468,0.0000033028064,0.00007622809,0.41075704,0.24165505,0.34701854,0.00007816869,0.00010307779],"about_ca_topic_score_codex":0.000009333116,"about_ca_topic_score_gemma":0.0000019739832,"teacher_disagreement_score":0.90961516,"about_ca_system_score_codex":0.00007115152,"about_ca_system_score_gemma":0.000118797805,"threshold_uncertainty_score":0.63908076},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68082845,0.0003454947,0.29109478,0.0069310754,0.0012607444,0.00067820644,0.000023889328,0.0001740846,0.01866331],"genre_scores_gemma":[0.98745906,0.000050294064,0.0119277695,0.00024850445,0.000039189046,0.0000071609143,7.6361187e-7,0.000012801539,0.00025446515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979232,0.00003375427,0.0007415384,0.00043799324,0.0005924614,0.00027108364],"domain_scores_gemma":[0.9985769,0.00015867397,0.00034617737,0.00024138251,0.00061200035,0.00006486881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006816164,0.00019935728,0.00031252464,0.00017552411,0.000095174066,0.00017503611,0.0012610878,0.00008325978,0.0001012088],"category_scores_gemma":[0.00029876147,0.00015665896,0.00015838216,0.001137902,0.00048807377,0.000463292,0.00019705723,0.00027968668,0.000036652717],"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.000026713817,0.000034850123,0.000034884528,0.0001119907,0.000021392068,0.0000015789461,0.008775211,0.000110824345,0.20160969,0.762357,0.000062401916,0.026853465],"study_design_scores_gemma":[0.000042458632,0.00016061137,0.0000912545,0.0007782392,0.00001573841,0.000021556561,0.0020746153,0.1927504,0.63004744,0.17341971,0.0003794334,0.00021851993],"about_ca_topic_score_codex":0.00003183216,"about_ca_topic_score_gemma":0.0000062162803,"teacher_disagreement_score":0.5889373,"about_ca_system_score_codex":0.00003983783,"about_ca_system_score_gemma":0.00019821392,"threshold_uncertainty_score":0.6388367},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88109666,0.0014791752,0.09056995,0.0004672357,0.0026614708,0.0008081017,0.000033310964,0.00036460935,0.022519484],"genre_scores_gemma":[0.99961555,0.000093265764,0.000094562725,0.0000039952715,0.00010009579,0.000011604803,7.074551e-7,0.000015620799,0.00006460882],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988372,0.0000055434493,0.0004216769,0.00017962641,0.00037480897,0.00018115538],"domain_scores_gemma":[0.99941975,0.00006003714,0.00009342265,0.00007438271,0.00030698002,0.000045437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002329661,0.00013254253,0.00017025665,0.00010578619,0.000049548154,0.000097201235,0.00027622748,0.00006824561,0.00007788516],"category_scores_gemma":[0.00011391377,0.00009453671,0.00007556948,0.0003126488,0.00015124341,0.00024693902,0.000035471818,0.00028998105,0.000019476654],"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.000017783761,0.000018306848,0.000012728664,0.00072713994,0.000026091166,4.3265572e-7,0.0009267476,0.007499952,0.4714181,0.23297778,0.00008717701,0.28628775],"study_design_scores_gemma":[0.0000069174625,0.00004628063,0.00004134579,0.0005196275,0.000008753955,0.0000026964167,0.00043647736,0.22858387,0.72412986,0.04594431,0.00018900394,0.00009083678],"about_ca_topic_score_codex":0.000013382587,"about_ca_topic_score_gemma":0.0000027427275,"teacher_disagreement_score":0.28619692,"about_ca_system_score_codex":0.000053127344,"about_ca_system_score_gemma":0.00004180713,"threshold_uncertainty_score":0.3855095},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83420336,0.00013153272,0.00011727392,0.00539765,0.0011312698,0.00093711645,0.000013674352,0.00012785966,0.15794028],"genre_scores_gemma":[0.9945712,0.00019378116,0.00016283378,0.00025273813,0.00014025989,0.00009118817,2.7581194e-7,0.000014259134,0.0045734593],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99805677,0.000017076209,0.00043622946,0.0004251495,0.0006007777,0.0004639705],"domain_scores_gemma":[0.99922085,0.00016135113,0.000096399745,0.00012394153,0.00023173801,0.00016571044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074995845,0.00016911273,0.00022090563,0.00018844492,0.00009547273,0.00043064976,0.00084743416,0.00008931912,0.00014031027],"category_scores_gemma":[0.0008146067,0.00011471854,0.00010039165,0.0010591999,0.00039714872,0.0004086514,0.00016660399,0.00029033632,0.0002049992],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040915867,0.00006652847,0.0003194336,0.000035722856,0.000005161291,0.000001703788,0.035874255,0.000048903014,0.007908552,0.3574528,0.00024286391,0.59800315],"study_design_scores_gemma":[0.0000664428,0.0011646509,0.002017582,0.0044549247,0.00004170849,0.0000045549114,0.086827636,0.0072851335,0.5367408,0.1567864,0.20333655,0.001273632],"about_ca_topic_score_codex":0.00033146478,"about_ca_topic_score_gemma":0.00040472153,"teacher_disagreement_score":0.5967295,"about_ca_system_score_codex":0.00011207892,"about_ca_system_score_gemma":0.00025782196,"threshold_uncertainty_score":0.4678086},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05095797,0.000090698595,0.93823177,0.0053533684,0.00022945632,0.0016467987,0.000022709199,0.0004986961,0.0029685085],"genre_scores_gemma":[0.94976294,0.000009684145,0.049205378,0.00005264312,0.00009633319,0.00019316138,0.0000066727303,0.0000373476,0.0006358573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99726224,0.000024504978,0.0005396551,0.0011027737,0.00062550575,0.0004453324],"domain_scores_gemma":[0.9982677,0.00019205199,0.00024387389,0.00070398755,0.00048310906,0.00010925478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009833882,0.0002964724,0.00028117985,0.00017805645,0.00040613164,0.00089553965,0.0032555594,0.00009055988,0.000026499623],"category_scores_gemma":[0.00042863537,0.00020655183,0.00007377079,0.00073934405,0.00012502089,0.0006621016,0.00080860296,0.0006359485,0.00004488758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010198745,0.00019247003,0.00006556595,0.000322932,0.000054770622,0.0000018739714,0.0035180096,0.01553611,0.029342614,0.5541974,0.000072367904,0.39659396],"study_design_scores_gemma":[0.000035264173,0.0002651373,0.000021489852,0.0005929664,0.00002784395,0.000011643189,0.00047641245,0.96100605,0.022713894,0.014361618,0.00023016453,0.00025751788],"about_ca_topic_score_codex":0.00017219558,"about_ca_topic_score_gemma":0.000038078317,"teacher_disagreement_score":0.9454699,"about_ca_system_score_codex":0.00005786073,"about_ca_system_score_gemma":0.00028821302,"threshold_uncertainty_score":0.8635709},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43502155,0.00070793525,0.54217625,0.0034266615,0.0052570365,0.0026723188,0.00002266238,0.0006792473,0.010036374],"genre_scores_gemma":[0.99525976,0.000060426482,0.0043058926,0.000026733771,0.000113975904,0.00010297013,6.3322346e-7,0.000013435452,0.000116169984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845296,0.000014231341,0.00045925763,0.00055373146,0.00022879208,0.00029105198],"domain_scores_gemma":[0.99912286,0.0001721042,0.00015054703,0.00017991388,0.0003263765,0.000048197442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000426205,0.00017936436,0.00017632176,0.0002792673,0.000121781275,0.00018320786,0.00084381044,0.000104172635,0.0000049853697],"category_scores_gemma":[0.00020447455,0.00014171764,0.00011111687,0.0014766131,0.00012539294,0.00095879345,0.00017062573,0.00038659322,0.000016042999],"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.000026801907,0.00004769137,0.00023294655,0.00004965771,0.00000684278,2.6768132e-7,0.0015141976,0.00024516392,0.013032774,0.8827807,0.00009298332,0.101969995],"study_design_scores_gemma":[0.00001818197,0.00014300706,0.0004950911,0.0005128479,0.000005706611,0.0000015117474,0.0001583828,0.3459835,0.06920204,0.58325785,0.00010338536,0.000118467244],"about_ca_topic_score_codex":0.000007721899,"about_ca_topic_score_gemma":0.000010040057,"teacher_disagreement_score":0.56023824,"about_ca_system_score_codex":0.000085349726,"about_ca_system_score_gemma":0.0000669532,"threshold_uncertainty_score":0.57790774},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26077992,0.00005701462,0.72471815,0.010201905,0.00079733477,0.0007969952,0.0000079457695,0.0004676541,0.0021730517],"genre_scores_gemma":[0.99661416,0.0000070919687,0.0029574237,0.00008125652,0.00020526403,0.00003133221,5.773396e-7,0.000010583935,0.000092316535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869627,0.000009948759,0.00025964697,0.00044940316,0.00033713027,0.00024759455],"domain_scores_gemma":[0.99923986,0.00011840191,0.00012370084,0.0001993864,0.00025788977,0.000060740553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001548215,0.00016860806,0.00014703187,0.000076326935,0.00025213513,0.00056696124,0.00091498665,0.000042485935,0.000008274652],"category_scores_gemma":[0.000046158544,0.000109871406,0.000084432155,0.00077287125,0.00019822219,0.0005547882,0.00018386425,0.00027387566,0.000048105318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022779688,0.00012962784,0.0000431198,0.0000384978,0.000011598612,8.212636e-7,0.0010748426,0.04325794,0.027808692,0.8565504,0.00011647617,0.07094523],"study_design_scores_gemma":[0.000012699726,0.00010136715,0.00008790914,0.00017121372,0.0000098565015,0.0000031401412,0.00005761586,0.9205493,0.05925196,0.019460592,0.00016425064,0.00013010226],"about_ca_topic_score_codex":0.000016027629,"about_ca_topic_score_gemma":0.0000066602834,"teacher_disagreement_score":0.8772913,"about_ca_system_score_codex":0.000032633136,"about_ca_system_score_gemma":0.000050727358,"threshold_uncertainty_score":0.546722},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012037502,0.00008562783,0.97204775,0.004436987,0.002112895,0.0009513668,0.000015358264,0.0004371199,0.00787538],"genre_scores_gemma":[0.99218094,0.000032906526,0.0066680675,0.00010981292,0.0003026053,0.00008599326,0.0000023985956,0.000037490296,0.00057980267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971067,0.00004819605,0.0006961236,0.00091447943,0.0006123463,0.00062216294],"domain_scores_gemma":[0.9980582,0.00057199615,0.00023493028,0.00026955458,0.0007423888,0.00012292259],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009249009,0.0003897446,0.0004336463,0.00021237378,0.0005014423,0.00065428787,0.0022137312,0.00019657469,0.00011191175],"category_scores_gemma":[0.0009461374,0.00030990422,0.00030819912,0.00084548263,0.00031136416,0.00097143394,0.0002761218,0.0009609494,0.000078843506],"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.00011797513,0.000068680645,0.00011973148,0.00016166146,0.00007274422,0.0000024933277,0.003364687,0.008908595,0.013899763,0.9073567,0.00022946886,0.06569753],"study_design_scores_gemma":[0.000097848606,0.0004524066,0.000036130612,0.0006471747,0.00005310737,0.000008253583,0.0009868927,0.7837743,0.09949798,0.11293836,0.001051681,0.00045586767],"about_ca_topic_score_codex":0.000058639365,"about_ca_topic_score_gemma":0.000011802419,"teacher_disagreement_score":0.9801434,"about_ca_system_score_codex":0.0001250825,"about_ca_system_score_gemma":0.00030225015,"threshold_uncertainty_score":0.9999353},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72420615,0.004416541,0.18071519,0.053854328,0.009138077,0.0039725965,0.00007506508,0.00093598675,0.02268609],"genre_scores_gemma":[0.9966881,0.0001181398,0.002088606,0.0003498179,0.00011936542,0.00003253426,7.140322e-7,0.000011203682,0.0005914896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986778,0.000006217472,0.000324043,0.00044230817,0.00028542976,0.00026423373],"domain_scores_gemma":[0.99926853,0.00010689551,0.00010509298,0.00020059709,0.00023961884,0.0000792893],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00044482332,0.00017008722,0.00018921332,0.00012598494,0.000120718876,0.001185203,0.00083447876,0.00008066691,0.00002114847],"category_scores_gemma":[0.00014013822,0.000112473936,0.00010428555,0.0004142244,0.00012527674,0.0010774956,0.00021115455,0.00013706036,0.00006983388],"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.00004546633,0.000036645833,0.000021915708,0.00017845462,0.000016971766,6.422043e-7,0.006941416,0.0000015035722,0.06568083,0.5911453,0.0015993464,0.3343315],"study_design_scores_gemma":[0.00003489593,0.0003304127,0.000036701917,0.00087046594,0.000015508016,0.0000116890005,0.0038726435,0.10056144,0.74203163,0.15016553,0.001820504,0.00024856],"about_ca_topic_score_codex":0.000038615246,"about_ca_topic_score_gemma":0.000004489741,"teacher_disagreement_score":0.67635083,"about_ca_system_score_codex":0.000022272283,"about_ca_system_score_gemma":0.00007176205,"threshold_uncertainty_score":0.99985164},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18033479,0.000010700888,0.79946864,0.010538093,0.0012881904,0.00056207745,0.0000057363964,0.000105043226,0.0076867184],"genre_scores_gemma":[0.99746394,0.00000937651,0.002159112,0.00020206865,0.00007310905,0.000018833993,9.9421e-7,0.0000104140645,0.00006212458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983458,0.000067886,0.0004636044,0.0003842659,0.0005836768,0.00015474812],"domain_scores_gemma":[0.99830306,0.00069685344,0.0002868679,0.00023422524,0.0004500153,0.000028989307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007179992,0.00016042768,0.00015430269,0.00017165065,0.000109367196,0.00026953363,0.0012049995,0.00005789055,0.000036868558],"category_scores_gemma":[0.0008490662,0.00010409989,0.0001181269,0.000883965,0.00015865013,0.0006085943,0.00022609156,0.00026575374,0.00003324201],"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.000072807685,0.000052362986,0.000010041073,0.000038014794,0.000013108835,1.083007e-7,0.0014427914,0.016467245,0.016573185,0.87658596,0.000112423564,0.08863197],"study_design_scores_gemma":[0.000008879416,0.00010335048,0.0001288574,0.00024113187,0.000006313739,7.357967e-7,0.00009326284,0.5649578,0.2471588,0.1872112,0.00002553442,0.000064140724],"about_ca_topic_score_codex":0.000016168144,"about_ca_topic_score_gemma":0.0000013700075,"teacher_disagreement_score":0.8171292,"about_ca_system_score_codex":0.000059889375,"about_ca_system_score_gemma":0.00013120104,"threshold_uncertainty_score":0.42450702},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010843185,0.000102783044,0.975299,0.008880477,0.00058823207,0.0010492794,0.00006535853,0.00020959982,0.0029621066],"genre_scores_gemma":[0.96418256,0.00004003296,0.034337357,0.00038730178,0.00017898303,0.00036202432,0.000006704641,0.000019753326,0.0004852704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99799114,0.0000089212135,0.0005223866,0.0006679759,0.0003928548,0.00041674022],"domain_scores_gemma":[0.9986311,0.00025600192,0.0002043857,0.00030124674,0.0005196286,0.00008763059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027528993,0.00024260793,0.00021951548,0.00011070142,0.00029946966,0.00041608684,0.0016548892,0.00006328201,0.00012846568],"category_scores_gemma":[0.00013512665,0.00018784733,0.00014681907,0.0006741967,0.0002837799,0.0006992869,0.00033686962,0.00024478504,0.00011394533],"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.000016959393,0.000057169884,0.0000027997933,0.000051077783,0.000012230123,3.3661885e-7,0.00018325346,0.00015203786,0.14221987,0.8090293,0.0012173883,0.047057614],"study_design_scores_gemma":[0.000013572163,0.00010084621,0.000010079887,0.00008913224,0.000009815752,0.0000061295136,0.0000441791,0.27614623,0.35211492,0.37009117,0.0012283751,0.00014552259],"about_ca_topic_score_codex":0.000008152831,"about_ca_topic_score_gemma":0.000004955837,"teacher_disagreement_score":0.9533394,"about_ca_system_score_codex":0.0000652434,"about_ca_system_score_gemma":0.00008946944,"threshold_uncertainty_score":0.76601917},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.839219,0.00017340174,0.1377117,0.007725368,0.0010556033,0.0015387088,0.000051797084,0.0002512043,0.012273272],"genre_scores_gemma":[0.9970721,0.000027550266,0.0018446298,0.00023298351,0.000052892956,0.00005037449,0.0000014300188,0.000018190598,0.0006998651],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971296,0.000042359658,0.00084198074,0.00073468004,0.0008707781,0.0003805899],"domain_scores_gemma":[0.9986145,0.00021554409,0.00027412138,0.0004897739,0.00028307823,0.00012300682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010521924,0.00028528628,0.00051293464,0.0004578226,0.00016531436,0.00037467416,0.002275192,0.000082250604,0.00032531854],"category_scores_gemma":[0.00070818607,0.00018650581,0.0002969445,0.002044466,0.00042368038,0.00058991904,0.0006048946,0.0002878873,0.00009209644],"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.0001333006,0.00058319897,0.0001497587,0.00026928575,0.0005866988,0.0000018280579,0.025622062,0.000957368,0.49715614,0.28594118,0.00088247226,0.1877167],"study_design_scores_gemma":[0.000015217943,0.00036204845,0.00006460977,0.0005677786,0.00021734809,0.0000024647015,0.0013540565,0.56859326,0.4120581,0.016506482,0.0000361606,0.00022247364],"about_ca_topic_score_codex":0.000057303103,"about_ca_topic_score_gemma":0.000011145422,"teacher_disagreement_score":0.5676359,"about_ca_system_score_codex":0.00009299986,"about_ca_system_score_gemma":0.000112762544,"threshold_uncertainty_score":0.7605486},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5774649,0.0006906094,0.23141958,0.14904001,0.0026774318,0.0017433675,0.000015374968,0.0041444306,0.032804325],"genre_scores_gemma":[0.98739105,0.00011293991,0.012256121,0.000055374632,0.000027618991,0.000027057322,0.0000013261972,0.000013802251,0.00011469967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979876,0.000028965596,0.00052909617,0.00063879415,0.00045979634,0.00035570315],"domain_scores_gemma":[0.99838114,0.0001695237,0.00018931493,0.00088845624,0.0003275593,0.00004399506],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00068609015,0.00021154813,0.00022353337,0.0003531084,0.00015452737,0.0006397328,0.01086513,0.00015009583,0.00004528772],"category_scores_gemma":[0.007919908,0.00016453021,0.00006802227,0.0020635012,0.00019121058,0.0008594294,0.009338972,0.00074100686,0.00011898421],"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.000024812041,0.000064402426,0.00016819683,0.0000615095,0.000013903631,0.0000039924244,0.00041108925,0.000019240239,0.023416257,0.60166967,0.0015563392,0.3725906],"study_design_scores_gemma":[0.000009277543,0.000053061693,0.00005209458,0.00040991083,0.0000023624616,0.0000028873342,0.0001194094,0.44148612,0.2298763,0.32772166,0.00016233604,0.00010458743],"about_ca_topic_score_codex":0.00006186865,"about_ca_topic_score_gemma":0.00002416853,"teacher_disagreement_score":0.4414669,"about_ca_system_score_codex":0.00011480421,"about_ca_system_score_gemma":0.00014571202,"threshold_uncertainty_score":0.9986733},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64090115,0.00008164536,0.35080415,0.0040641367,0.0009798626,0.00058051746,0.0000020602515,0.0002854965,0.0023009623],"genre_scores_gemma":[0.9936883,0.000006542374,0.005931212,0.00006350358,0.00010000346,0.00002724331,2.2666421e-7,0.000017748062,0.00016525651],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978323,0.000021377138,0.0005517827,0.0005911654,0.00052027724,0.00048308936],"domain_scores_gemma":[0.9992374,0.00012453282,0.00014176086,0.00019263253,0.0001987851,0.00010488986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009685453,0.00022919849,0.00023669956,0.00033532907,0.00030862322,0.0006930815,0.0014291783,0.00007163736,0.00003189694],"category_scores_gemma":[0.00025800287,0.00018268444,0.00010170814,0.0011233938,0.00007219276,0.0004072241,0.0005754176,0.00082620303,0.00011162235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000118202015,0.00014597751,0.00010535093,0.00010792946,0.000018791998,0.0000032142445,0.015118235,0.4205437,0.061258126,0.3894154,0.000019657742,0.11325178],"study_design_scores_gemma":[0.000014714603,0.0001234135,0.0002314341,0.0012843219,0.000007923662,0.00000978558,0.00096827134,0.9450742,0.0057415827,0.046252456,0.000055517594,0.000236358],"about_ca_topic_score_codex":0.0002956327,"about_ca_topic_score_gemma":0.0000402353,"teacher_disagreement_score":0.52453053,"about_ca_system_score_codex":0.000107888816,"about_ca_system_score_gemma":0.00012273532,"threshold_uncertainty_score":0.74496555},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99491066,0.000044387976,0.0017635155,0.002199681,0.00017792426,0.0005244227,0.00024567093,0.00006114753,0.000072587194],"genre_scores_gemma":[0.9971906,0.000012069094,0.002527967,0.000081036625,0.00014489025,0.0000025812167,0.000008117498,0.0000036558397,0.000029067285],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985375,0.000024067396,0.00032968985,0.00056096667,0.00022132524,0.00032648447],"domain_scores_gemma":[0.9990496,0.0004546587,0.0001546637,0.00007366177,0.00019140894,0.00007601959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007346924,0.00021097806,0.00022478346,0.000028671991,0.00036441282,0.00045706378,0.00034742168,0.00010127999,0.000026789323],"category_scores_gemma":[0.0005737039,0.00009382811,0.000093744515,0.00035683898,0.00027203406,0.00035477796,0.0001738946,0.0002635756,0.00000389517],"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.00006281413,0.00002110957,0.00006139287,0.0000950469,0.000010734783,3.7065072e-7,0.0002052973,0.000010244682,0.60745245,0.0014990158,0.00002304109,0.3905585],"study_design_scores_gemma":[0.000016557,0.00026506084,0.00084241934,0.0005841787,0.000041391566,0.00001831219,0.0012149892,0.23837036,0.73625803,0.02142065,0.0006704754,0.00029758894],"about_ca_topic_score_codex":0.0006846741,"about_ca_topic_score_gemma":0.0005321866,"teacher_disagreement_score":0.3902609,"about_ca_system_score_codex":0.000041106578,"about_ca_system_score_gemma":0.000024860316,"threshold_uncertainty_score":0.44074765},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79605967,0.00006868511,0.12695722,0.06249717,0.0012494228,0.0010422013,0.000010673016,0.00054370594,0.01157127],"genre_scores_gemma":[0.9910025,0.0000132093965,0.0086012,0.00017652851,0.00006372593,0.000077755874,7.1801804e-7,0.000009489703,0.000054849777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981985,0.000035953624,0.0005265895,0.0005833948,0.00041289174,0.00024265125],"domain_scores_gemma":[0.99904484,0.00017638388,0.0001421719,0.00030083425,0.00027483283,0.00006092963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079887157,0.00017681699,0.00017654954,0.00020967617,0.00012628853,0.00031620418,0.0013430024,0.00008207957,0.000060743954],"category_scores_gemma":[0.00043369253,0.00013995319,0.00009129631,0.0010824954,0.00018940329,0.0005497886,0.00028584112,0.0005313481,0.00012016359],"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.000011588282,0.00008469527,0.0016883876,0.000040259663,0.0000051071816,2.4963686e-7,0.00054121664,0.00022065324,0.009428273,0.86774117,0.000052321022,0.12018606],"study_design_scores_gemma":[0.000021559896,0.00008035611,0.012262025,0.00029071048,0.0000056929653,0.0000078923995,0.000083632985,0.42406148,0.05649419,0.5059009,0.00059227063,0.00019926553],"about_ca_topic_score_codex":0.00043303805,"about_ca_topic_score_gemma":0.000033405642,"teacher_disagreement_score":0.42384082,"about_ca_system_score_codex":0.0001292622,"about_ca_system_score_gemma":0.00011281549,"threshold_uncertainty_score":0.57071257},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.971244,0.000059353602,0.0014749647,0.009426782,0.00039141104,0.0013456971,0.0000066095863,0.0002587877,0.01579243],"genre_scores_gemma":[0.99896467,0.00006221549,0.00010495674,0.000304707,0.00018725565,0.00007186743,5.7089096e-7,0.000018610535,0.0002851507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997766,0.00007516065,0.0005602073,0.0005629865,0.0006772774,0.00035834243],"domain_scores_gemma":[0.9985263,0.00026145534,0.0002567221,0.00019156607,0.0006395514,0.00012445956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010091525,0.0002383556,0.0002379925,0.0001490981,0.00089293055,0.000932805,0.0007120533,0.00011370685,0.00026899573],"category_scores_gemma":[0.0016066498,0.00018803796,0.00010149311,0.0011133113,0.000089621106,0.0012488734,0.0001173218,0.00035769463,0.00007925186],"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.000065706896,0.00033912156,0.0013810807,0.00016491029,0.00003128582,0.00008292536,0.17831543,0.00029017078,0.0012626433,0.8013196,0.00021389317,0.016533213],"study_design_scores_gemma":[0.00012294765,0.0013117853,0.0009288987,0.0008706016,0.00012767315,0.00009040603,0.4393081,0.0075281295,0.03024536,0.51738715,0.0013326177,0.0007463263],"about_ca_topic_score_codex":0.0017965134,"about_ca_topic_score_gemma":0.0011041472,"teacher_disagreement_score":0.28393248,"about_ca_system_score_codex":0.00020557296,"about_ca_system_score_gemma":0.0006945221,"threshold_uncertainty_score":0.89950603},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6047009,0.000026247957,0.3937813,0.0007606459,0.00016975825,0.00029165501,0.0000101075975,0.000085670996,0.00017371355],"genre_scores_gemma":[0.98256433,0.000019353507,0.017270437,0.000034543802,0.00003266802,0.000019911988,0.0000032713322,0.000011130956,0.000044327186],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998882,0.000011343099,0.00026369048,0.0003950792,0.0002182629,0.0002296091],"domain_scores_gemma":[0.9993661,0.000067313566,0.00013615286,0.000097060896,0.00027486528,0.000058485068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026774133,0.00015100764,0.00013987487,0.000080294376,0.00029197315,0.0006760948,0.00037506068,0.000055800294,0.000007150448],"category_scores_gemma":[0.000099015255,0.00010492694,0.000052078085,0.00025612453,0.00015872128,0.00050091976,0.00017774143,0.000189674,0.000008544543],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000996663,0.00025760365,0.0013479458,0.0009285174,0.00011524858,0.0000035485778,0.015618938,0.019767309,0.12642717,0.24261016,0.0002810969,0.5916458],"study_design_scores_gemma":[0.000038029997,0.00018815098,0.000041239793,0.0010154037,0.000013340046,0.000009085616,0.0008665634,0.87839276,0.11318227,0.005956123,0.00015613787,0.00014091989],"about_ca_topic_score_codex":0.000016568476,"about_ca_topic_score_gemma":0.000005147466,"teacher_disagreement_score":0.8586254,"about_ca_system_score_codex":0.000037064343,"about_ca_system_score_gemma":0.000055020195,"threshold_uncertainty_score":0.6519598},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77650017,0.00018565558,0.058791496,0.03266884,0.0019781606,0.00094753184,0.00005358117,0.00009585273,0.12877871],"genre_scores_gemma":[0.99912834,0.000025061116,0.00027924278,0.00014822697,0.0000692812,0.000020821333,6.9258977e-7,0.0000045323677,0.0003238029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971861,0.000037801972,0.0008308502,0.00029805664,0.0014865198,0.00016065309],"domain_scores_gemma":[0.9976784,0.0004667928,0.00036577205,0.00022156972,0.001227702,0.000039789415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002542596,0.000121947654,0.00016807721,0.000106722066,0.00022099185,0.0004320232,0.0011562469,0.00005464391,0.0007792808],"category_scores_gemma":[0.0011544487,0.0000629208,0.00012084403,0.0013953358,0.0003552284,0.00044284732,0.00014411274,0.00018861447,0.00018483789],"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.000016103468,0.00002781743,0.00059861795,0.000011551671,0.0000084305975,5.988192e-8,0.0009386697,0.0004916668,0.0015437477,0.73435354,0.00038980794,0.26162],"study_design_scores_gemma":[0.000015674615,0.0001054276,0.0012369136,0.0002491808,0.000019021158,0.0000032664773,0.00898544,0.33984733,0.17626056,0.4723663,0.000805316,0.000105579675],"about_ca_topic_score_codex":0.000040983035,"about_ca_topic_score_gemma":0.00006850935,"teacher_disagreement_score":0.33935565,"about_ca_system_score_codex":0.000064981796,"about_ca_system_score_gemma":0.000262479,"threshold_uncertainty_score":0.85325783},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8839698,0.00010446005,0.004564996,0.024892684,0.0015198757,0.0016814992,0.0004773521,0.0002673086,0.082522035],"genre_scores_gemma":[0.9981009,0.00014047635,0.00037189483,0.0008281581,0.00010848064,0.00003528524,0.00001830279,0.000024716195,0.00037178252],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99740124,0.000027444186,0.0005400933,0.00079716934,0.00075585005,0.00047819866],"domain_scores_gemma":[0.9992019,0.0001337059,0.00014217941,0.00029669623,0.000023939974,0.00020158252],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00076420367,0.0002489033,0.00022193871,0.00008630004,0.00018845241,0.00015666924,0.00096645125,0.000116092815,0.0046845586],"category_scores_gemma":[0.0003727959,0.00018078554,0.00009177504,0.0006001551,0.0008976516,0.00038931708,0.0004136805,0.00049295207,0.0033801477],"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.0001314761,0.0006470484,0.0025081988,0.00021368329,0.00005494095,0.000014749193,0.0031489765,0.00006318541,0.31703374,0.06937959,0.042898104,0.5639063],"study_design_scores_gemma":[0.000080660066,0.0006713848,0.002383024,0.0010830471,0.00010199841,0.00003879291,0.002392406,0.034388054,0.7207298,0.103101656,0.13402438,0.0010047677],"about_ca_topic_score_codex":0.000347587,"about_ca_topic_score_gemma":0.000048351125,"teacher_disagreement_score":0.56290156,"about_ca_system_score_codex":0.00015279505,"about_ca_system_score_gemma":0.0000515338,"threshold_uncertainty_score":0.9973958},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056802314,0.00002838979,0.9834609,0.007006197,0.00012439802,0.0007720842,0.000015622496,0.00052867644,0.002383477],"genre_scores_gemma":[0.93075365,0.000027275306,0.064839125,0.00012857527,0.00009215497,0.00016874324,0.000001072007,0.000020299622,0.0039691245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984927,0.000007206848,0.00046016055,0.0005067099,0.00028640206,0.00024682318],"domain_scores_gemma":[0.9988966,0.00012207519,0.00017894717,0.00025246592,0.00046684087,0.00008307741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033797667,0.00020360154,0.00018914747,0.00016169873,0.00024933528,0.00045710293,0.0010461884,0.00010785155,0.000049882376],"category_scores_gemma":[0.00019498642,0.00016642743,0.00015014784,0.000537146,0.0001038109,0.00092559104,0.0001576087,0.00016642903,0.00014680094],"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.00004434238,0.000051840703,0.000001580905,0.00004925318,0.000010639307,8.1689016e-8,0.0010217387,0.00041992354,0.37249422,0.40826693,0.0006356102,0.21700384],"study_design_scores_gemma":[0.000008094829,0.00014137775,0.0000031022673,0.000054090444,0.000009712242,0.0000023323253,0.000037490354,0.46777362,0.40256482,0.12893845,0.0003706451,0.00009626705],"about_ca_topic_score_codex":0.000042548843,"about_ca_topic_score_gemma":0.000010041497,"teacher_disagreement_score":0.9250734,"about_ca_system_score_codex":0.000058135694,"about_ca_system_score_gemma":0.00016878973,"threshold_uncertainty_score":0.67867136},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95464474,0.0000979641,0.007272483,0.02421602,0.0033334661,0.0009961302,0.000029256815,0.0006070004,0.008802923],"genre_scores_gemma":[0.9987953,0.00005765967,0.000036939415,0.00039157833,0.00012326745,0.0000369834,8.32053e-7,0.000019588939,0.0005378502],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985836,0.00001822221,0.000301683,0.00050012197,0.00035033905,0.0002460342],"domain_scores_gemma":[0.9993732,0.000106334206,0.00016054187,0.000141684,0.0001532858,0.00006497951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000198889,0.00018618771,0.00014511173,0.00012753071,0.00019359526,0.0002785652,0.00053950376,0.00010512602,0.00007102357],"category_scores_gemma":[0.00023692673,0.0001342323,0.00015066871,0.00095330173,0.0002962975,0.00031770676,0.000021181255,0.0004750055,0.000037982758],"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.00005236092,0.00003243617,0.000011201517,0.000035915342,0.00000299086,6.218481e-7,0.00031530793,0.00010329759,0.57913303,0.3500486,0.00023028474,0.07003396],"study_design_scores_gemma":[0.000011614882,0.000092640665,0.00033765627,0.00010178808,0.000015254582,0.0000058195606,0.0002993078,0.17139684,0.795746,0.03149746,0.00035666797,0.00013892725],"about_ca_topic_score_codex":0.00000780531,"about_ca_topic_score_gemma":0.000009780565,"teacher_disagreement_score":0.31855115,"about_ca_system_score_codex":0.000027485703,"about_ca_system_score_gemma":0.000031946503,"threshold_uncertainty_score":0.5473834},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8911175,0.000020032463,0.03726294,0.03500479,0.0010285451,0.0011293316,0.000024605537,0.00046919062,0.033943024],"genre_scores_gemma":[0.9985307,0.00003279571,0.0002875136,0.000663368,0.00006555053,0.00006846438,8.827409e-7,0.00002287012,0.00032785136],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978303,0.000028377206,0.0004109996,0.00050405756,0.0009776275,0.00024867163],"domain_scores_gemma":[0.999206,0.00021511344,0.00013592499,0.0001426875,0.00018277983,0.00011748887],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00035144287,0.0001977758,0.00016155379,0.00014968311,0.00020560366,0.00023913062,0.0005802543,0.00009183335,0.0010189032],"category_scores_gemma":[0.0005397099,0.00012447227,0.00009731703,0.0007931228,0.0005508447,0.0002758992,0.000024677736,0.00038714113,0.00018764469],"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.00012194216,0.00011096599,0.000018135655,0.00007369728,0.000003646694,0.000002051449,0.00046323214,0.000004189631,0.7600397,0.1517683,0.00006465882,0.087329514],"study_design_scores_gemma":[0.000041076462,0.00017254232,0.00006654988,0.00033769928,0.000016009182,0.00001495353,0.00054712454,0.06622949,0.9183644,0.013889554,0.00017130568,0.00014930799],"about_ca_topic_score_codex":0.000014489502,"about_ca_topic_score_gemma":0.000016951995,"teacher_disagreement_score":0.15832472,"about_ca_system_score_codex":0.000058433478,"about_ca_system_score_gemma":0.00023216629,"threshold_uncertainty_score":0.9998943},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05626,0.00012730705,0.9329278,0.0053891973,0.002102609,0.00056562776,0.000009116618,0.00015703065,0.0024613426],"genre_scores_gemma":[0.98769885,0.00003537045,0.011426709,0.0004602264,0.00015023042,0.000017903352,3.6702454e-7,0.00002185348,0.00018851088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968952,0.000041781645,0.00088263827,0.00077156175,0.0008439158,0.0005648836],"domain_scores_gemma":[0.9982938,0.0002147357,0.00029826976,0.00061028235,0.00043991033,0.00014299917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008914148,0.0003385159,0.0004020071,0.0001359029,0.0003274243,0.00052227284,0.0033388678,0.0000748851,0.00005966514],"category_scores_gemma":[0.00026299903,0.00022227228,0.00020740065,0.0009359413,0.0002604712,0.0008584393,0.0012795194,0.000651499,0.00007947324],"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.000060978895,0.00009136752,0.00015159177,0.00017625712,0.00003500232,0.0000016266775,0.006215996,0.015139356,0.05884745,0.7061573,0.00009686024,0.2130262],"study_design_scores_gemma":[0.000015236763,0.000058359878,0.000050956336,0.0012582194,0.000014589595,0.000005923075,0.00037283296,0.6431979,0.10331257,0.25142077,0.00007660035,0.00021605882],"about_ca_topic_score_codex":0.00018405555,"about_ca_topic_score_gemma":0.00008334315,"teacher_disagreement_score":0.9314388,"about_ca_system_score_codex":0.00006469953,"about_ca_system_score_gemma":0.0001362321,"threshold_uncertainty_score":0.9064001},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031817313,0.00010079839,0.956897,0.0019743976,0.00096017367,0.0006173256,0.000006067019,0.00040975207,0.007217141],"genre_scores_gemma":[0.98356587,0.00009829798,0.015941514,0.00008618249,0.00012709032,0.0000628292,3.3744564e-7,0.000015733058,0.00010214057],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99802655,0.000022681186,0.00055883115,0.00059966056,0.0004465157,0.00034578165],"domain_scores_gemma":[0.9989869,0.000088029265,0.00018212054,0.00026940522,0.00041403304,0.00005951003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005811896,0.00023081987,0.00024277852,0.0002641832,0.00011227923,0.0005358099,0.0013662077,0.00010458608,0.00003979206],"category_scores_gemma":[0.0006261866,0.00018174977,0.0001240659,0.0015128336,0.000189384,0.0013605187,0.00029977763,0.0004207042,0.000073966075],"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.00006923383,0.00005062337,0.0000061869287,0.000058054135,0.000006295674,0.000002959415,0.0008065098,0.0000090674175,0.34841752,0.29601964,0.000037968275,0.35451594],"study_design_scores_gemma":[0.000016480586,0.00020035468,0.00006333827,0.0002839528,0.000004495109,0.000007886413,0.000116200325,0.040662393,0.7115749,0.24678071,0.0001330342,0.00015625307],"about_ca_topic_score_codex":0.00009353288,"about_ca_topic_score_gemma":0.00003091875,"teacher_disagreement_score":0.95174855,"about_ca_system_score_codex":0.00011515437,"about_ca_system_score_gemma":0.00016094986,"threshold_uncertainty_score":0.741154},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02970715,0.0004659916,0.93648297,0.006499167,0.0005261798,0.00059719355,0.000021577063,0.0009941818,0.024705572],"genre_scores_gemma":[0.98588794,0.00024034156,0.0130207455,0.0002629978,0.00007044265,0.0000464777,0.0000014681233,0.000025103407,0.00044450705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9974411,0.000030744584,0.0006519598,0.00076230697,0.0007020099,0.00041184574],"domain_scores_gemma":[0.9986577,0.00013467642,0.00022472744,0.00032176464,0.00055279036,0.000108325105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080765865,0.00029613162,0.00029186328,0.00020362253,0.00024178109,0.0007788812,0.0020859253,0.00016337661,0.00005481941],"category_scores_gemma":[0.00018172472,0.00022710532,0.0001787369,0.00075457955,0.0003227441,0.0010782516,0.0006038226,0.00056586514,0.00009509661],"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.000016202073,0.000076597804,0.0000031696027,0.00008718601,0.0000125842635,0.0000017013746,0.0026297544,0.0000131177585,0.17500079,0.53008026,0.0017512132,0.2903274],"study_design_scores_gemma":[0.0000066310226,0.00006496165,0.0000011131946,0.0005482503,0.0000073111933,0.000005875055,0.0002662092,0.18477106,0.4364805,0.3775614,0.000143399,0.00014328498],"about_ca_topic_score_codex":0.00008308016,"about_ca_topic_score_gemma":0.0000042416723,"teacher_disagreement_score":0.95618075,"about_ca_system_score_codex":0.000090345064,"about_ca_system_score_gemma":0.00010956759,"threshold_uncertainty_score":0.9261086},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029509496,0.000057154648,0.9856378,0.0064148144,0.0005796417,0.0004737925,0.0000063498355,0.0005333922,0.003346092],"genre_scores_gemma":[0.5951223,0.000027539645,0.40417522,0.00010643565,0.00014633188,0.00012326578,0.0000012051116,0.000018069552,0.00027967917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99797815,0.000016848073,0.0005054609,0.00068638276,0.00048793937,0.00032521095],"domain_scores_gemma":[0.99849933,0.00021314091,0.00016349752,0.0002472914,0.0008052764,0.000071440096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004348151,0.00020943015,0.00021322782,0.00013078024,0.0002322821,0.00055634876,0.0012694816,0.00010086585,0.00003112128],"category_scores_gemma":[0.0008266867,0.0001642163,0.00017001697,0.0009359228,0.00030504033,0.0011710603,0.00029359173,0.00030912543,0.00004419927],"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.000053257383,0.000092375354,0.000015169604,0.00007323433,0.00001042499,6.3640476e-7,0.00037014383,0.000017319631,0.2496538,0.6595323,0.0011121139,0.08906924],"study_design_scores_gemma":[0.000010032302,0.00009279451,0.000017662403,0.00012439725,0.000007043203,0.000008772831,0.00005350707,0.3451046,0.354576,0.29963517,0.00026064014,0.0001094073],"about_ca_topic_score_codex":0.000014691965,"about_ca_topic_score_gemma":0.0000017940603,"teacher_disagreement_score":0.5921713,"about_ca_system_score_codex":0.00010782939,"about_ca_system_score_gemma":0.00014822015,"threshold_uncertainty_score":0.66965467},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020846257,0.00006951097,0.9582923,0.016782595,0.00022163766,0.00089518377,0.000016835602,0.000637586,0.002238069],"genre_scores_gemma":[0.97628707,0.000005973555,0.022908295,0.00007689759,0.000023755778,0.000112386646,0.000001025388,0.000012943465,0.0005716317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987306,0.000006826285,0.0002801219,0.0004605016,0.00029858664,0.00022338092],"domain_scores_gemma":[0.9989213,0.00020149852,0.00015691001,0.00018067383,0.00050411146,0.000035528723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037624998,0.0001794645,0.00022028295,0.00013753083,0.00013937797,0.00032826632,0.0009478147,0.000072702634,0.000028270108],"category_scores_gemma":[0.0003337446,0.00011214382,0.000108829474,0.0006305414,0.00019476487,0.00038345647,0.00009873234,0.00016226748,0.00005658393],"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.00002176309,0.000070158654,0.000017019547,0.00010281407,0.00006632211,3.4365465e-7,0.00049302285,0.00007988752,0.028512046,0.8959429,0.00021029987,0.07448339],"study_design_scores_gemma":[0.000013119285,0.00028989735,0.00003333245,0.0002137475,0.00008278279,0.000009184871,0.000049425904,0.54985005,0.34244543,0.106787734,0.000098650424,0.0001266267],"about_ca_topic_score_codex":0.0000055476617,"about_ca_topic_score_gemma":0.0000019987172,"teacher_disagreement_score":0.9554408,"about_ca_system_score_codex":0.00003359562,"about_ca_system_score_gemma":0.00009515493,"threshold_uncertainty_score":0.45730922},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028405727,0.00024795844,0.9820544,0.00842858,0.00084051845,0.00054445374,0.000011045091,0.0006981579,0.004334328],"genre_scores_gemma":[0.9861439,0.00009946625,0.012730789,0.00016272569,0.00008160136,0.00002856198,0.0000017443368,0.000013003021,0.0007382285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982574,0.000018639153,0.00048785724,0.0005216659,0.00045679254,0.00025763555],"domain_scores_gemma":[0.99884826,0.000051422576,0.00021098218,0.00026489008,0.0005574772,0.00006696535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003982179,0.00019847417,0.00018282315,0.00016144263,0.00014908363,0.0004677085,0.0013833235,0.000117890275,0.00008288623],"category_scores_gemma":[0.00020576827,0.00014221927,0.00012346273,0.0010355248,0.0002492046,0.0006857358,0.00020693494,0.00030648752,0.00013213993],"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.000010027104,0.00007079078,0.000005058017,0.0000303299,0.000008072428,5.5253787e-7,0.0005322605,0.000012790867,0.050178524,0.83093596,0.00041838308,0.11779725],"study_design_scores_gemma":[0.000016610455,0.0000779284,0.000106652966,0.00020043393,0.000011994471,0.0000054041143,0.00012438108,0.22320655,0.71401554,0.060958263,0.0010908905,0.00018536493],"about_ca_topic_score_codex":0.00003293539,"about_ca_topic_score_gemma":0.0000018662461,"teacher_disagreement_score":0.9833033,"about_ca_system_score_codex":0.00006902673,"about_ca_system_score_gemma":0.00012109521,"threshold_uncertainty_score":0.5799533},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2986089,0.00038592282,0.6352021,0.025933068,0.0025821456,0.0040650824,0.00007964226,0.001124617,0.032018527],"genre_scores_gemma":[0.9913751,0.000017483791,0.007008148,0.000046258225,0.00009970565,0.000059647336,0.0000012655548,0.00001843975,0.0013739612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818623,0.00000802929,0.0005638827,0.000520962,0.00034806252,0.0003728498],"domain_scores_gemma":[0.9989995,0.00012776635,0.00017051262,0.0001921222,0.00043959025,0.00007051926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005219971,0.00022718523,0.0002754698,0.00012407127,0.0002818983,0.00056278484,0.0010801544,0.00007468737,0.00008016941],"category_scores_gemma":[0.00026228247,0.00015186395,0.0002573271,0.0006936929,0.00017610728,0.00065755914,0.0001507539,0.00018810478,0.000050304865],"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.0000476724,0.000053220658,0.000015209907,0.00019445193,0.000028339939,5.2090604e-7,0.0013539465,0.00011913058,0.036733344,0.7932357,0.00011710171,0.16810134],"study_design_scores_gemma":[0.000014434866,0.0002724278,0.0000136259705,0.0004723231,0.000033914457,0.000010023356,0.00012586422,0.70739365,0.117718674,0.17332079,0.00042971616,0.00019457207],"about_ca_topic_score_codex":0.000013262974,"about_ca_topic_score_gemma":0.000006890716,"teacher_disagreement_score":0.7072745,"about_ca_system_score_codex":0.000043551776,"about_ca_system_score_gemma":0.00007740291,"threshold_uncertainty_score":0.6192832},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017089241,0.000090454385,0.9908594,0.0015429008,0.0009286338,0.00051003747,0.000047926605,0.00020846615,0.004103239],"genre_scores_gemma":[0.83870536,0.000049381084,0.15912491,0.00014066354,0.00017629395,0.00017287691,0.0000021238309,0.000027531274,0.0016008712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998208,0.000005259247,0.0004763564,0.00057092105,0.00036091983,0.00037853065],"domain_scores_gemma":[0.9988505,0.000104952596,0.0001906586,0.00029722488,0.0004962412,0.000060407972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006392022,0.00020775272,0.00023821698,0.000103133585,0.00023799538,0.00032303747,0.0010684873,0.0000637569,0.000009748401],"category_scores_gemma":[0.00023337452,0.00014793078,0.00012640707,0.00049487373,0.00015154677,0.0010251025,0.00033603256,0.00019083194,0.00003278144],"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.000011915545,0.000026660206,0.0000026353716,0.00019535629,0.000010947429,2.669149e-7,0.0005397584,0.0005775546,0.017393507,0.9401392,0.0005351763,0.04056705],"study_design_scores_gemma":[0.000008952287,0.00004273989,5.930677e-7,0.00027468786,0.000005936554,0.000003120631,0.00016061835,0.6594979,0.15770984,0.18057364,0.0015921511,0.0001297873],"about_ca_topic_score_codex":0.000017702818,"about_ca_topic_score_gemma":0.0000034716948,"teacher_disagreement_score":0.83699644,"about_ca_system_score_codex":0.000043597134,"about_ca_system_score_gemma":0.00013762862,"threshold_uncertainty_score":0.6032442},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012133833,0.00012406956,0.98396564,0.0006318788,0.000098998054,0.00034360366,0.00000447617,0.0003168447,0.0023806798],"genre_scores_gemma":[0.9800313,0.000091147,0.019591289,0.0000110593755,0.000060911003,0.000066807916,6.386339e-7,0.000020449152,0.00012638142],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938095,9.1862046e-7,0.00020469549,0.00018360866,0.000095020936,0.00013480183],"domain_scores_gemma":[0.9997256,0.000024472754,0.000035400488,0.00006597723,0.000115093055,0.00003347445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012664964,0.00011280122,0.00009162849,0.00007931513,0.00009957694,0.00017591739,0.00016768028,0.000055112134,0.000009134938],"category_scores_gemma":[0.00003552802,0.00009485272,0.00004470963,0.00018123898,0.000041127536,0.0002199468,0.000032073796,0.00012935027,0.0000042894826],"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.000011817207,0.000008950017,0.0000015220816,0.00032384845,0.0000091677975,3.698072e-8,0.0006785443,0.0014291416,0.32563064,0.3275529,0.00019477992,0.34415862],"study_design_scores_gemma":[0.0000038807484,0.000012515908,0.0000031881607,0.000120568635,0.000009220938,0.0000010411719,0.00004749011,0.56856996,0.2826784,0.14845236,0.000041784977,0.000059638416],"about_ca_topic_score_codex":0.0000064487385,"about_ca_topic_score_gemma":0.000004463149,"teacher_disagreement_score":0.9678975,"about_ca_system_score_codex":0.000028120847,"about_ca_system_score_gemma":0.000017647018,"threshold_uncertainty_score":0.38679817},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8744282,0.00015130584,0.0969413,0.00047955476,0.001385389,0.000417463,0.000022202326,0.00029159154,0.025882976],"genre_scores_gemma":[0.9982499,0.00006848349,0.001575584,0.0000082346605,0.000051431747,0.0000074674085,7.268777e-7,0.0000136350345,0.00002455619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990419,0.0000091516395,0.0003607107,0.00020916115,0.0002209508,0.00015808392],"domain_scores_gemma":[0.99936664,0.000055564822,0.00008650535,0.00009851915,0.0003493213,0.000043432567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002777495,0.00012305974,0.00016162355,0.00011570082,0.000066771194,0.00006668445,0.0002583803,0.000053887085,0.00008365124],"category_scores_gemma":[0.00020173333,0.00010015746,0.00007432822,0.00036408403,0.00017876356,0.00034803062,0.000031619198,0.00020051014,0.000005155969],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006769533,0.00006041475,0.00014328341,0.000381946,0.000054813474,4.0780796e-7,0.0062241415,0.07155854,0.18527627,0.6851075,0.000055192762,0.051069744],"study_design_scores_gemma":[0.000009614997,0.000040174036,0.00002957563,0.00029925106,0.0000147865,0.000004214241,0.005513656,0.69868815,0.26184338,0.03346294,0.0000036546498,0.000090605805],"about_ca_topic_score_codex":0.00008638122,"about_ca_topic_score_gemma":0.000006987603,"teacher_disagreement_score":0.6516446,"about_ca_system_score_codex":0.00011464078,"about_ca_system_score_gemma":0.000041411502,"threshold_uncertainty_score":0.40843028},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.603074,0.00016834452,0.3677445,0.020215811,0.0012372595,0.0011578277,0.0000059646327,0.0015061368,0.0048901513],"genre_scores_gemma":[0.99399096,0.00002610799,0.0057484135,0.000020954123,0.00002885621,0.00004826078,9.292986e-7,0.000013517904,0.00012201265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983234,0.000018243467,0.00031087108,0.0006571254,0.00040681168,0.00028355833],"domain_scores_gemma":[0.9986517,0.00012603166,0.00019804573,0.0005595216,0.00041786357,0.000046875422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043087607,0.00021480142,0.00018575706,0.00019544589,0.00030789734,0.0007194324,0.0034046515,0.00009056643,0.000012613991],"category_scores_gemma":[0.004041378,0.00015052303,0.000038191596,0.0010816349,0.0003028402,0.00032402002,0.0046045408,0.00049622473,0.000022322496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018273875,0.00022016367,0.001094419,0.00019407694,0.0000901883,0.0000060722923,0.0021289955,0.0011607131,0.04442079,0.48339954,0.0024969154,0.4646054],"study_design_scores_gemma":[0.000018251521,0.00028416744,0.00011164914,0.00040777077,0.000008084424,0.000010392278,0.00030045296,0.62287027,0.27396527,0.10187939,0.000014794662,0.00012947447],"about_ca_topic_score_codex":0.00004594919,"about_ca_topic_score_gemma":0.000013057822,"teacher_disagreement_score":0.6217096,"about_ca_system_score_codex":0.00015805369,"about_ca_system_score_gemma":0.00011303631,"threshold_uncertainty_score":0.6937504},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01759104,0.00015738205,0.9759016,0.003056958,0.0019238408,0.0006286022,0.000018626864,0.00012575975,0.00059620873],"genre_scores_gemma":[0.9778515,0.00004154424,0.02050527,0.00035958836,0.0009966101,0.00008438726,0.000006441595,0.000023188597,0.00013148252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99717104,0.00007555312,0.00087909517,0.00084802706,0.00049261795,0.0005336534],"domain_scores_gemma":[0.9975387,0.00081259006,0.0004097405,0.00025366084,0.0008618289,0.0001234701],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013755449,0.0003509589,0.0004611446,0.0001482299,0.00059294305,0.00082933763,0.00126175,0.0001323904,0.000048964055],"category_scores_gemma":[0.0007876348,0.00027547436,0.0002830442,0.0005771585,0.00029029005,0.00081110286,0.00035856562,0.0004175214,0.000016959491],"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.00010345567,0.000068711764,0.000022220513,0.00013493004,0.00009163142,0.000001024358,0.0034438404,0.02360352,0.1480099,0.7662811,0.00060442474,0.057635225],"study_design_scores_gemma":[0.000038966686,0.0001075424,0.000014697692,0.00037546988,0.000019407224,0.0000020037658,0.00076451735,0.5216597,0.37775332,0.098855674,0.00016871885,0.00024003207],"about_ca_topic_score_codex":0.000094991316,"about_ca_topic_score_gemma":0.00005219167,"teacher_disagreement_score":0.96026045,"about_ca_system_score_codex":0.000121799305,"about_ca_system_score_gemma":0.00025288964,"threshold_uncertainty_score":0.9999697},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73671144,0.0011273501,0.18313,0.05608045,0.0010785579,0.0018953189,0.000039068676,0.00021216396,0.019725684],"genre_scores_gemma":[0.99539274,0.00003763791,0.00420554,0.00018268234,0.000023475368,0.000049809947,2.1564854e-7,0.0000061162846,0.000101783204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988376,0.000016833503,0.00036004142,0.0003634892,0.00021265095,0.00020940053],"domain_scores_gemma":[0.9984606,0.0004763734,0.00019866702,0.00020366181,0.00062252046,0.00003816687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003253171,0.00016367246,0.00027154852,0.00008241607,0.00018588685,0.00018774542,0.0008373649,0.000073201736,0.000008348644],"category_scores_gemma":[0.00038061343,0.00008678469,0.00008212647,0.00034108636,0.001338306,0.00025657786,0.00015595111,0.0001714775,0.0000026374275],"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.000043584707,0.00002508222,0.0001660742,0.00005540736,0.000039213366,3.797117e-7,0.0019405844,0.000002812866,0.005537812,0.8736797,0.00010017447,0.11840916],"study_design_scores_gemma":[0.00009774194,0.00095347926,0.001742503,0.0005332764,0.00011718705,0.000089151465,0.011567187,0.046028674,0.474224,0.46366617,0.0006415863,0.00033904365],"about_ca_topic_score_codex":0.000120856974,"about_ca_topic_score_gemma":0.00022139389,"teacher_disagreement_score":0.46868616,"about_ca_system_score_codex":0.000015860667,"about_ca_system_score_gemma":0.00027405054,"threshold_uncertainty_score":0.4931044},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78298175,0.00020813229,0.062082928,0.14971879,0.00059407623,0.0007633447,0.00004383162,0.00027699996,0.0033301583],"genre_scores_gemma":[0.9889646,0.000024750909,0.006816335,0.0002909276,0.00010632602,0.000038768656,9.1552613e-7,0.000011213719,0.0037461251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987499,0.000014478109,0.00021880628,0.00045412092,0.00028391392,0.0002787626],"domain_scores_gemma":[0.9992449,0.00011621372,0.000088958936,0.00019447367,0.00023183848,0.00012356474],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003154349,0.00017324767,0.00016613418,0.0001617294,0.00013547845,0.0012352078,0.0008210025,0.00005552471,0.0000128531965],"category_scores_gemma":[0.00034058388,0.00012998967,0.00006891497,0.00047879698,0.00010026397,0.000573512,0.00028871998,0.00027832112,0.000018031336],"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.000005723299,0.00006500267,0.0003659137,0.000033351098,0.000019523237,7.7266554e-7,0.0050101937,0.00013081309,0.0041104527,0.9545902,0.00037237472,0.035295658],"study_design_scores_gemma":[0.000037155234,0.00023657824,0.0003469245,0.0007566865,0.000048067177,0.000014454441,0.0043853526,0.7542728,0.0652464,0.16978037,0.0043249633,0.0005502093],"about_ca_topic_score_codex":0.00009282819,"about_ca_topic_score_gemma":0.000044129934,"teacher_disagreement_score":0.7848098,"about_ca_system_score_codex":0.00003509871,"about_ca_system_score_gemma":0.0001450581,"threshold_uncertainty_score":0.9998016},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73950016,0.00016567911,0.10148308,0.068461604,0.004377055,0.0025045646,0.00006044125,0.0006937751,0.08275362],"genre_scores_gemma":[0.98869807,0.000023795797,0.0010582109,0.00018007398,0.00017877115,0.000025952395,2.5426905e-7,0.000023184733,0.009811721],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9953471,0.000043461885,0.000836392,0.0008514376,0.0024322227,0.0004893966],"domain_scores_gemma":[0.99681836,0.0009681633,0.00019268556,0.00035397903,0.0014756542,0.00019114287],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0029883473,0.00022749734,0.00032688348,0.00051776407,0.00027234032,0.0009801476,0.0024404547,0.000096432865,0.00087694504],"category_scores_gemma":[0.011348607,0.00014124143,0.00018366653,0.0026552256,0.0003556325,0.0004748167,0.0006203851,0.0007375239,0.0030261464],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017824846,0.000053578475,0.000108313885,0.000028637836,0.000016491033,0.0000037050393,0.0032596088,0.0012730078,0.055029534,0.29589304,0.0023657759,0.64179003],"study_design_scores_gemma":[0.000012713428,0.0003909591,0.00018154255,0.00032619818,0.0000075782727,0.0000072759035,0.0035173944,0.07766184,0.5865977,0.32287034,0.00818055,0.00024592716],"about_ca_topic_score_codex":0.000020851263,"about_ca_topic_score_gemma":0.000008365019,"teacher_disagreement_score":0.6415441,"about_ca_system_score_codex":0.0000823079,"about_ca_system_score_gemma":0.00015504801,"threshold_uncertainty_score":0.9977501},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93456,0.0005872458,0.009921543,0.027342437,0.009704086,0.0074485894,0.0005454819,0.0005586664,0.00933196],"genre_scores_gemma":[0.9964036,0.00018267639,0.00031375844,0.0007782352,0.0008240629,0.00064745906,0.00006607479,0.00006368815,0.00072049664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956642,0.00013846386,0.0014709762,0.0007349314,0.00085422443,0.0011372169],"domain_scores_gemma":[0.9975736,0.00078263634,0.00050824933,0.00030592494,0.0006028434,0.00022671971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038194135,0.00032206794,0.00054416404,0.00020996486,0.000674666,0.000075703916,0.0009176279,0.00040806268,0.00033487641],"category_scores_gemma":[0.0016225415,0.0002140593,0.00016133457,0.0009780602,0.0001811614,0.00029313934,0.00012825307,0.0015559453,0.00017168262],"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.0011675324,0.00017332131,0.0012630167,0.0020423713,0.00027533612,0.0000035574885,0.0024357515,0.000008576289,0.0068521947,0.82313716,0.015876925,0.14676428],"study_design_scores_gemma":[0.0013880641,0.008795928,0.00022660747,0.028853845,0.00072237063,0.00009962134,0.01743017,0.22507755,0.13863783,0.34580302,0.23036258,0.0026024128],"about_ca_topic_score_codex":0.0004716561,"about_ca_topic_score_gemma":0.0014638476,"teacher_disagreement_score":0.4773341,"about_ca_system_score_codex":0.00044978393,"about_ca_system_score_gemma":0.0035616844,"threshold_uncertainty_score":0.8729085},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12814492,0.000045535286,0.8670768,0.00077111344,0.00044586544,0.0006760526,0.0000020406467,0.00024867698,0.002588969],"genre_scores_gemma":[0.99091643,0.00012198776,0.008133444,0.000037416587,0.00008267952,0.000038041962,0.0000017374749,0.000020915284,0.00064736203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977749,0.000015485526,0.0007009843,0.00059311005,0.00048522462,0.0004302964],"domain_scores_gemma":[0.998433,0.0002703144,0.0004107225,0.00027051425,0.0005181191,0.00009733391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013463566,0.00026380923,0.00026430163,0.00017221319,0.00034558974,0.00084004045,0.000872215,0.000088380126,0.000034822686],"category_scores_gemma":[0.00088803447,0.00020364257,0.00014518891,0.00044521512,0.00014413947,0.00080350204,0.00039971684,0.00048650778,0.000018253315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010719578,0.000044307013,0.0001907569,0.00043208865,0.00008659933,0.0000014735446,0.0030860573,0.270412,0.09082403,0.4966014,0.00006841331,0.13814567],"study_design_scores_gemma":[0.000026504733,0.0003405552,0.00017140023,0.00043912907,0.000017772596,0.0000098304145,0.00032614043,0.76778626,0.19385913,0.03661331,0.00020724474,0.00020270087],"about_ca_topic_score_codex":0.00007923522,"about_ca_topic_score_gemma":0.0000026085577,"teacher_disagreement_score":0.8627715,"about_ca_system_score_codex":0.00013084708,"about_ca_system_score_gemma":0.00015524027,"threshold_uncertainty_score":0.8304303},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9802477,0.00006989677,0.0029394084,0.0021206564,0.0006410044,0.00052555255,0.000020604757,0.000111037734,0.013324187],"genre_scores_gemma":[0.9995646,0.00003363939,0.00009970008,0.000052439926,0.000019798172,0.000026076683,6.586693e-7,0.0000136148665,0.00018946468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998939,0.0000065556155,0.0004849268,0.0001540955,0.00023338736,0.00018204465],"domain_scores_gemma":[0.99949336,0.00009005999,0.000079343794,0.00014891944,0.0001688467,0.000019488512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038202413,0.00012064888,0.0001302227,0.00009421959,0.00006687192,0.00005721588,0.00046283245,0.000037288115,0.000036213114],"category_scores_gemma":[0.00013472006,0.00007053379,0.00006814287,0.0007918352,0.00016491339,0.00013921098,0.000031504434,0.00036052056,0.000014073554],"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.000066485605,0.00010002942,0.0019524008,0.0006169053,0.00007340122,0.0000012566607,0.02194558,0.08535413,0.31578243,0.46041444,0.0009988785,0.11269404],"study_design_scores_gemma":[0.0000258028,0.000043732958,0.0038772789,0.001339736,0.000024881683,0.0000025919285,0.0024822962,0.122028254,0.80865055,0.058998358,0.0023324315,0.00019410244],"about_ca_topic_score_codex":0.000021291033,"about_ca_topic_score_gemma":0.0001060458,"teacher_disagreement_score":0.4928681,"about_ca_system_score_codex":0.00003528939,"about_ca_system_score_gemma":0.000056643352,"threshold_uncertainty_score":0.28762844},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9509478,0.0006641532,0.0028925156,0.001704426,0.00084210705,0.000469639,0.00001350486,0.00019960279,0.042266246],"genre_scores_gemma":[0.99806017,0.00028260818,0.00087304995,0.000081262944,0.00017217635,0.00008710844,0.0000019174975,0.000029646835,0.0004120756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985098,0.00002596295,0.00038571897,0.00048521557,0.00027753456,0.00031576422],"domain_scores_gemma":[0.99910253,0.00021270847,0.00016668344,0.00013750771,0.0003026644,0.000077891105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004137226,0.00021939298,0.00021740107,0.00017618634,0.00023377177,0.00023580123,0.00028009174,0.000086103144,0.00045919395],"category_scores_gemma":[0.00018417266,0.00016011599,0.00006941908,0.0004746915,0.00027295208,0.0003857969,0.00008584279,0.00041648687,0.00018194798],"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.0002594214,0.00013740276,0.0010738615,0.00023639144,0.00014111605,0.00001078355,0.037186388,0.000029530982,0.02071301,0.7153639,0.00008986794,0.22475831],"study_design_scores_gemma":[0.00029022375,0.0009946431,0.0009288743,0.008071577,0.00042932606,0.00013974222,0.14655076,0.09878156,0.63578206,0.10533566,0.0014393489,0.0012562424],"about_ca_topic_score_codex":0.00010847567,"about_ca_topic_score_gemma":0.000034102086,"teacher_disagreement_score":0.61506903,"about_ca_system_score_codex":0.000034054316,"about_ca_system_score_gemma":0.00005995543,"threshold_uncertainty_score":0.6529341},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9076157,0.00032840818,0.05551837,0.0014102885,0.001827983,0.0009341755,0.000024118739,0.0007683737,0.03157256],"genre_scores_gemma":[0.9995043,0.000111384456,0.0002024144,0.000015140073,0.000038931747,0.000019603476,0.0000011252065,0.000023733019,0.00008332155],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990215,0.0000028874235,0.00033061026,0.00021565298,0.00020782671,0.0002215725],"domain_scores_gemma":[0.9997548,0.000024226436,0.00003458349,0.00006443364,0.00008532522,0.00003663778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014033596,0.00016778318,0.00015864134,0.00016190823,0.000048206068,0.0001465885,0.00032824636,0.0000858813,0.00014138498],"category_scores_gemma":[0.000026432046,0.00012809072,0.000058936843,0.00044839614,0.000071524875,0.00025116833,0.000024526018,0.0002929391,0.000015682965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008484699,0.00005262982,0.0002908967,0.002141974,0.000054259144,0.0000026739035,0.008480731,0.13264662,0.034813948,0.37657687,0.0001490956,0.44470546],"study_design_scores_gemma":[0.000013773149,0.000027359942,0.0001411143,0.00058262615,0.000009615605,0.0000016605428,0.0006791423,0.4782653,0.48424304,0.03575458,0.00011061312,0.00017120547],"about_ca_topic_score_codex":0.000016051155,"about_ca_topic_score_gemma":0.000026062515,"teacher_disagreement_score":0.44942906,"about_ca_system_score_codex":0.00004941266,"about_ca_system_score_gemma":0.000030115552,"threshold_uncertainty_score":0.52233875},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90053993,0.00009112827,0.012983544,0.010182715,0.0011381884,0.0020660125,0.000039780916,0.00028330056,0.07267538],"genre_scores_gemma":[0.9941568,0.00006662042,0.004308914,0.0002556017,0.00016462157,0.000118749515,0.0000027296624,0.000031127332,0.00089488784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99776417,0.000015900378,0.0005312442,0.00071241526,0.00054756925,0.00042872087],"domain_scores_gemma":[0.99917024,0.00012646109,0.00019332835,0.00027431312,0.00012133219,0.000114296236],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006888645,0.00027238874,0.00026244725,0.000057020425,0.00029130347,0.00024064769,0.00092310953,0.00012186439,0.0017330658],"category_scores_gemma":[0.00045557998,0.00020355187,0.00016378616,0.00059025595,0.00043739527,0.0002137069,0.0006211556,0.0003320467,0.00046693292],"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.00016496982,0.00024020526,0.0019950639,0.0001356519,0.000022569306,4.1883442e-7,0.000938614,0.00019476174,0.008354519,0.8228353,0.0005351173,0.16458277],"study_design_scores_gemma":[0.00005795448,0.0012172867,0.01736579,0.00057316775,0.0001311855,0.0000097421025,0.0025873985,0.30546412,0.0724983,0.582691,0.016537715,0.0008663223],"about_ca_topic_score_codex":0.00032599416,"about_ca_topic_score_gemma":0.00012359694,"teacher_disagreement_score":0.30526936,"about_ca_system_score_codex":0.0001777332,"about_ca_system_score_gemma":0.00003020658,"threshold_uncertainty_score":0.9991795},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9408216,0.000018652208,0.019157626,0.011922445,0.00017904614,0.0005689799,0.000032893244,0.0002518207,0.027046923],"genre_scores_gemma":[0.9968182,0.00011856978,0.00031884018,0.0009427238,0.00003297617,0.000024525452,9.0515096e-7,0.000025649693,0.0017176033],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978793,0.000027893751,0.00038149382,0.0006887372,0.00068861194,0.00033394634],"domain_scores_gemma":[0.99923164,0.000049791077,0.00012972642,0.00021746034,0.00020829892,0.00016309493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000294583,0.0002544199,0.00024178899,0.00019078446,0.000244649,0.00032611427,0.0008035453,0.00007933437,0.00048847205],"category_scores_gemma":[0.00022018018,0.00016136153,0.00013255657,0.0010022258,0.00038417993,0.0003748294,0.00022207382,0.00031652697,0.00046565733],"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.00009328736,0.00013719723,0.000010984657,0.000038304577,0.0000030574076,0.0000013855046,0.0015974684,0.00007825547,0.83143955,0.12624317,0.0014213612,0.038935944],"study_design_scores_gemma":[0.000024500387,0.00028892583,0.000006980883,0.00042882882,0.000029968693,0.0000063370294,0.0016990608,0.24347413,0.72756845,0.02529367,0.0009151829,0.00026396857],"about_ca_topic_score_codex":0.00005490781,"about_ca_topic_score_gemma":0.00000606633,"teacher_disagreement_score":0.24339588,"about_ca_system_score_codex":0.00006738685,"about_ca_system_score_gemma":0.000055027787,"threshold_uncertainty_score":0.6580132},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09425629,0.0003781322,0.8626312,0.033120845,0.0011323955,0.0006682422,0.000011304091,0.001197652,0.0066039125],"genre_scores_gemma":[0.9776282,0.0003154145,0.020744342,0.00023262574,0.00012649465,0.000043515134,0.000005100516,0.000015682579,0.0008886801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981171,0.000030586438,0.00039628585,0.00048239666,0.00074652716,0.0002271106],"domain_scores_gemma":[0.9989772,0.0001319439,0.00018005788,0.00019102781,0.00043090733,0.00008885798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005074873,0.00019195318,0.0002029129,0.00011165257,0.00018234763,0.0006803043,0.0013842342,0.00013693991,0.0003729884],"category_scores_gemma":[0.0005427366,0.00013465233,0.00012304567,0.00068406627,0.00024269427,0.00065911433,0.0002702785,0.00048059612,0.0002068949],"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.000026365737,0.000041086045,0.000039532737,0.000037249833,0.00001929611,0.0000018800599,0.0012373299,0.0000012146553,0.30635282,0.55040646,0.0006790496,0.14115773],"study_design_scores_gemma":[0.000014598961,0.00007537533,0.000042636235,0.00026116526,0.000009693282,0.0000035071198,0.00030513143,0.13618143,0.77559733,0.086721055,0.0006478538,0.00014023586],"about_ca_topic_score_codex":0.000058546633,"about_ca_topic_score_gemma":0.000007559385,"teacher_disagreement_score":0.88337183,"about_ca_system_score_codex":0.000054341388,"about_ca_system_score_gemma":0.00016863129,"threshold_uncertainty_score":0.65601903},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91878885,0.00023133481,0.041770317,0.00061475084,0.00018311612,0.00056582614,0.000010801246,0.000048672002,0.037786312],"genre_scores_gemma":[0.99673796,0.00006418563,0.0019390394,0.00018987308,0.00012088971,0.000053906697,0.0000036911906,0.000022448889,0.00086800015],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986739,0.000013192933,0.00040469665,0.00036204903,0.00019582751,0.00035034283],"domain_scores_gemma":[0.9993337,0.000025614601,0.00011968555,0.00014128171,0.0002975765,0.00008215463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004750027,0.00021097375,0.00020203978,0.000069543676,0.00013400691,0.00019321885,0.0005403208,0.00010970421,0.000014309775],"category_scores_gemma":[0.00042482422,0.00016000625,0.00012502911,0.00028050705,0.00010847476,0.000021364815,0.00015899396,0.00029943974,0.00003169793],"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.00012605343,0.000048266545,0.00007790096,0.00013136854,0.000055621782,2.9104916e-7,0.002026935,0.0007947155,0.91370505,0.071655355,0.00016973574,0.01120869],"study_design_scores_gemma":[0.000021323347,0.00030351712,0.000051502822,0.00028243745,0.00002385183,0.000017729413,0.0024775967,0.023590034,0.9690367,0.0030205504,0.0009483347,0.00022639774],"about_ca_topic_score_codex":0.000023558525,"about_ca_topic_score_gemma":0.0000040393643,"teacher_disagreement_score":0.07794909,"about_ca_system_score_codex":0.000049246628,"about_ca_system_score_gemma":0.00017448807,"threshold_uncertainty_score":0.65248656},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89371985,0.00007517454,0.07274855,0.008856691,0.0015389727,0.0011118734,0.00011217001,0.0007244167,0.021112295],"genre_scores_gemma":[0.9963609,0.0000133728345,0.0023323854,0.000417563,0.0001539255,0.000026787875,0.000012790136,0.00001638866,0.0006658793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99833447,0.000019562174,0.0003556098,0.0005697253,0.00041605302,0.0003045776],"domain_scores_gemma":[0.9991351,0.000048042883,0.00012933083,0.00023621025,0.00033534146,0.00011601304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036085304,0.00021038888,0.00017986141,0.00021105172,0.0003307756,0.00082490436,0.0011371981,0.000058444686,0.00017115523],"category_scores_gemma":[0.000079033416,0.00014711492,0.00005774001,0.0007585287,0.00010438774,0.00063437835,0.00028004913,0.0003789125,0.00053516065],"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.0000427142,0.000122032296,0.000040415816,0.00008464576,0.00004174426,0.0000079323345,0.0023831513,0.00034762183,0.20623825,0.61482984,0.003284729,0.17257693],"study_design_scores_gemma":[0.000028539469,0.000738848,0.00005658918,0.0006169022,0.00002847751,0.000024093524,0.00043691637,0.059144925,0.9020806,0.030015323,0.0064016967,0.00042711198],"about_ca_topic_score_codex":0.000036055706,"about_ca_topic_score_gemma":0.000014904158,"teacher_disagreement_score":0.6958423,"about_ca_system_score_codex":0.000039955277,"about_ca_system_score_gemma":0.00008095142,"threshold_uncertainty_score":0.7954572},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015516199,0.00007138475,0.9689971,0.0036202704,0.0018705827,0.00031763437,0.0000055798537,0.00036213585,0.009239101],"genre_scores_gemma":[0.96613413,0.000022915212,0.033119775,0.0002830721,0.0001618022,0.000025273052,3.343992e-7,0.00001438894,0.00023830429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982775,0.000023983435,0.00038980733,0.00056538027,0.0004410066,0.0003023417],"domain_scores_gemma":[0.99907905,0.000074030526,0.00012374733,0.0003023021,0.00032144063,0.00009944915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005838459,0.00019565344,0.00019715818,0.0001128331,0.00014064055,0.00071870507,0.0015242299,0.000073640855,0.00007786845],"category_scores_gemma":[0.00008968435,0.00012971285,0.000113030386,0.00077844405,0.00017117089,0.00079049746,0.00020100454,0.00030460645,0.000127426],"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.000013205367,0.00005873956,0.000009972885,0.00003079832,0.000008185035,4.7164372e-7,0.00033693243,0.000009911793,0.026303483,0.6461673,0.00008345584,0.32697758],"study_design_scores_gemma":[0.000007774586,0.0002754615,0.00004485095,0.00015851847,0.0000102380345,0.000004443588,0.00015949477,0.41240415,0.1723737,0.41352186,0.00088106276,0.0001584528],"about_ca_topic_score_codex":0.000017865674,"about_ca_topic_score_gemma":9.478372e-7,"teacher_disagreement_score":0.9506179,"about_ca_system_score_codex":0.00003306527,"about_ca_system_score_gemma":0.00006184436,"threshold_uncertainty_score":0.69304895},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9587492,0.00032877788,0.008535285,0.0025332354,0.0013842698,0.00278685,0.000060426126,0.00019444425,0.02542751],"genre_scores_gemma":[0.9982104,0.000024481615,0.00083768286,0.00017549795,0.00023722346,0.00015478236,0.000004046527,0.000023948598,0.00033198463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972307,0.00011152546,0.0007559457,0.00036957112,0.00095318176,0.0005790484],"domain_scores_gemma":[0.99793285,0.00045329015,0.00024837788,0.00018646661,0.0010566211,0.00012239814],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0032486208,0.00016657889,0.00022488649,0.00020137959,0.00067783386,0.00006743554,0.0004772775,0.00015454213,0.0010067926],"category_scores_gemma":[0.0012261359,0.000119316224,0.0000933792,0.000638702,0.00009983339,0.0003861084,0.00020506501,0.0007574243,0.0003068731],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012606426,0.00010413947,0.00042186683,0.0018360026,0.000021637274,7.319207e-7,0.008292688,0.00019376173,0.02731912,0.6284743,0.00019536281,0.3330143],"study_design_scores_gemma":[0.000036064346,0.000063085965,0.00024227911,0.0011379474,0.000026866164,9.23522e-7,0.0039618947,0.91892385,0.007582512,0.06788062,0.000031949843,0.00011199837],"about_ca_topic_score_codex":0.0003206124,"about_ca_topic_score_gemma":0.00004855705,"teacher_disagreement_score":0.9187301,"about_ca_system_score_codex":0.00028596784,"about_ca_system_score_gemma":0.00114084,"threshold_uncertainty_score":0.9999064},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.587128,0.0011298651,0.3875697,0.015477398,0.001714624,0.00076156866,0.000038566723,0.00051714474,0.0056631234],"genre_scores_gemma":[0.99804395,0.00016887474,0.0006954947,0.0003636715,0.0003108245,0.000029126486,0.000005548918,0.000031386775,0.00035111274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976634,0.0000050578356,0.0006946444,0.00057786907,0.0006852629,0.000373771],"domain_scores_gemma":[0.9973941,0.00012573811,0.00029331842,0.00025986703,0.001901339,0.000025662612],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00071548263,0.00032883798,0.00032032433,0.00034289272,0.0006001443,0.0013655929,0.001380933,0.00012318874,0.00012993133],"category_scores_gemma":[0.0006434195,0.0001871738,0.00025574627,0.0022087093,0.0002105196,0.0010287736,0.00037823018,0.00046930462,0.00039086724],"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.0001417587,0.00017115312,0.00015889651,0.00023318412,0.00006249747,0.0000011466719,0.00026632028,0.019960545,0.003621511,0.7200676,0.0033172965,0.2519981],"study_design_scores_gemma":[0.000021538901,0.000009858997,0.00003102557,0.0012346327,0.000104263934,0.0000015154486,0.0004935218,0.7753644,0.002532156,0.21878566,0.0012331044,0.00018830458],"about_ca_topic_score_codex":0.00013876602,"about_ca_topic_score_gemma":0.00007030448,"teacher_disagreement_score":0.7554039,"about_ca_system_score_codex":0.000051887695,"about_ca_system_score_gemma":0.0000850692,"threshold_uncertainty_score":0.9996711},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6701395,0.00011530133,0.32233268,0.005217551,0.00011240436,0.00034688233,0.0000035745645,0.00017953049,0.0015525623],"genre_scores_gemma":[0.9952193,0.00003123888,0.00429735,0.000125112,0.000070585986,0.000021252577,7.645667e-7,0.000015406778,0.00021897283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819005,0.000033980723,0.000362399,0.00057898235,0.0005068863,0.00032769018],"domain_scores_gemma":[0.99910516,0.0001731584,0.000112677575,0.00029868662,0.00024302637,0.00006731533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007178865,0.00019807955,0.00019990216,0.00010225592,0.00034112672,0.00058545015,0.0011714639,0.00006254389,0.000011368366],"category_scores_gemma":[0.00020030973,0.00011847272,0.000068202244,0.0006086101,0.00017025847,0.0006558074,0.00039576457,0.0004661266,0.00001344988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036185367,0.000039959294,0.0022642084,0.00015516924,0.000047384943,0.000003655721,0.03477602,0.0038165713,0.058863334,0.8051948,0.000028379884,0.09477435],"study_design_scores_gemma":[0.000026454063,0.000061027564,0.00009235911,0.00033447566,0.000019130799,0.0000057760044,0.0039792294,0.89633,0.07347809,0.025514659,0.0000112245125,0.0001475674],"about_ca_topic_score_codex":0.000060701477,"about_ca_topic_score_gemma":0.000009511055,"teacher_disagreement_score":0.89251345,"about_ca_system_score_codex":0.000028322509,"about_ca_system_score_gemma":0.00008695923,"threshold_uncertainty_score":0.56455094},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09852953,0.000114779206,0.8932757,0.005133378,0.00047061636,0.0005304972,0.000008997967,0.00011265881,0.0018238802],"genre_scores_gemma":[0.9990894,0.00004911385,0.00071602984,0.000047625574,0.00004272016,0.000023987897,0.0000018236957,0.000008147502,0.000021160515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985376,0.000018775429,0.0005115046,0.00040318182,0.0002852572,0.00024370999],"domain_scores_gemma":[0.9991949,0.00017837272,0.00015399462,0.00023524111,0.00018269272,0.00005480134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002736379,0.00014358571,0.00019828006,0.00011227137,0.000111936635,0.00021695034,0.0010541899,0.00006378378,0.000021370523],"category_scores_gemma":[0.0000840439,0.000108015265,0.00009274468,0.0013571971,0.00022590627,0.00039727477,0.00025776538,0.00028581,0.0000050797985],"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.000014283697,0.000052686788,0.0007374613,0.000026487516,0.0000068048575,6.066648e-7,0.00061207666,0.010327969,0.0055341083,0.9676195,0.00007434769,0.014993717],"study_design_scores_gemma":[0.000015932908,0.000049964587,0.00027288674,0.00020566305,0.000006312676,0.0000026244684,0.00045606808,0.8620268,0.020969898,0.11588467,0.00001129272,0.0000978787],"about_ca_topic_score_codex":0.00004219738,"about_ca_topic_score_gemma":0.000033090746,"teacher_disagreement_score":0.90055984,"about_ca_system_score_codex":0.000055072735,"about_ca_system_score_gemma":0.000032452615,"threshold_uncertainty_score":0.44047347},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15783869,0.00017861162,0.70750886,0.11319302,0.00052431755,0.0016174928,0.000018872664,0.0015650301,0.017555071],"genre_scores_gemma":[0.99220186,0.000068374036,0.007395814,0.00012940551,0.000034267632,0.00007017759,0.0000016325305,0.000019587626,0.00007885304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972805,0.000080773396,0.00051321206,0.000828226,0.0007818076,0.0005154917],"domain_scores_gemma":[0.99723864,0.0006402178,0.0002540343,0.0013831841,0.00042331702,0.00006063486],"candidate_categories":["metaresearch","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010401781,0.00031926198,0.00029786793,0.000269163,0.00029021114,0.0015128751,0.015741186,0.00016407625,0.00003042657],"category_scores_gemma":[0.009042928,0.00019497139,0.0000613586,0.0028313617,0.0005313765,0.0012507378,0.0075930064,0.0012864855,0.00004175989],"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.00013298057,0.00023517855,0.0010742698,0.00012995675,0.00006218364,0.000015124958,0.0031770535,0.00042174247,0.011595043,0.9435713,0.0010954153,0.038489714],"study_design_scores_gemma":[0.000023896711,0.0003605366,0.00024787083,0.0007998544,0.000011848489,0.000008192237,0.0011988722,0.59473884,0.091092095,0.31123036,0.0000725991,0.00021503915],"about_ca_topic_score_codex":0.00021376807,"about_ca_topic_score_gemma":0.00010019012,"teacher_disagreement_score":0.8343632,"about_ca_system_score_codex":0.00011379146,"about_ca_system_score_gemma":0.00029371367,"threshold_uncertainty_score":0.99952364},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10732596,0.000108254004,0.88385195,0.0022038731,0.002085872,0.0015250434,0.0000025663298,0.0003614283,0.002535042],"genre_scores_gemma":[0.99566704,0.000025690722,0.0033744457,0.00006380812,0.00015893743,0.00011759092,0.0000026919786,0.000012639111,0.00057717506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982659,0.000015014179,0.0005969827,0.0004415734,0.0004325006,0.00024798609],"domain_scores_gemma":[0.99904406,0.00006687887,0.0002770939,0.00018162334,0.0003706474,0.000059687758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006379609,0.00018078093,0.00018598654,0.0001331553,0.00021822176,0.00044966151,0.0007140978,0.00006843211,0.000057200166],"category_scores_gemma":[0.00023301871,0.00013012723,0.00014721109,0.00038503422,0.000051020965,0.00047588468,0.00013360941,0.00016370378,0.00007010644],"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.0000047207695,0.00004981837,0.000033370685,0.00019661813,0.000021770029,4.5807556e-7,0.0019137113,0.0027706565,0.08479757,0.80801684,0.0006507931,0.10154369],"study_design_scores_gemma":[0.000016487347,0.00010798721,0.000025083928,0.00029728783,0.000011684892,0.0000025641675,0.00013525932,0.78893477,0.20555912,0.0044263164,0.00035876187,0.00012470284],"about_ca_topic_score_codex":0.000024647934,"about_ca_topic_score_gemma":0.000004422779,"teacher_disagreement_score":0.88834107,"about_ca_system_score_codex":0.00005640283,"about_ca_system_score_gemma":0.00006802732,"threshold_uncertainty_score":0.53064346},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03180414,0.000045415538,0.9436005,0.008575157,0.0024964253,0.0006562866,0.000020949545,0.00033620125,0.012464966],"genre_scores_gemma":[0.9924615,0.000019669023,0.0068663685,0.00026044133,0.00014641367,0.000032537708,0.0000014724893,0.0000093590525,0.0002022362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986384,0.000009576113,0.0004256177,0.00032860212,0.00033480872,0.00026302945],"domain_scores_gemma":[0.99898887,0.0001353369,0.00016174246,0.00017995837,0.0004616692,0.00007243197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035959462,0.00016519893,0.00014837158,0.00022154588,0.00030407237,0.00056401093,0.0011641083,0.000081597675,0.000040598727],"category_scores_gemma":[0.00020669324,0.0001243789,0.00020117107,0.0007903973,0.00017738747,0.00084982626,0.00013966642,0.00020754898,0.000046520556],"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.000019166195,0.000025276488,0.000004241963,0.000037395665,0.000019301226,1.2956873e-7,0.001759847,0.00015961593,0.014109141,0.9535603,0.0011393445,0.029166225],"study_design_scores_gemma":[0.000022833503,0.00011963402,0.0000072488706,0.00010272015,0.00001275532,0.0000017220821,0.0010502768,0.79635084,0.045724574,0.15425143,0.00221089,0.00014509413],"about_ca_topic_score_codex":0.000011001254,"about_ca_topic_score_gemma":0.000003209845,"teacher_disagreement_score":0.96065736,"about_ca_system_score_codex":0.000044643548,"about_ca_system_score_gemma":0.00017701177,"threshold_uncertainty_score":0.54387707},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00784055,0.000075350996,0.9800702,0.007918272,0.00049566146,0.00025380086,0.0000015872308,0.00022843204,0.0031161583],"genre_scores_gemma":[0.9916528,0.0000145335625,0.0071472256,0.00091622735,0.00006153599,0.00001497499,4.9889815e-7,0.00001475213,0.00017747513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984015,0.000013513521,0.00034660054,0.00050764927,0.000434761,0.00029595292],"domain_scores_gemma":[0.99911225,0.00008812924,0.00013534148,0.00021869801,0.00035928196,0.00008632731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023149326,0.00020450314,0.00017770939,0.0001523358,0.00016873617,0.00047966666,0.0010626214,0.000058610953,0.000051483938],"category_scores_gemma":[0.00013433986,0.00013712641,0.00007974912,0.0009810547,0.00021290945,0.00079811,0.00014240487,0.0003050163,0.000059045888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006590577,0.00008907348,0.00012176687,0.000096327014,0.000010576426,0.0000039697156,0.0007373317,0.003298809,0.008066069,0.5836385,0.00032265662,0.40354902],"study_design_scores_gemma":[0.000019142373,0.00018942285,0.000019753814,0.00036647366,0.0000054617994,0.000005692481,0.00011202232,0.77978694,0.197609,0.021455746,0.0002782098,0.000152116],"about_ca_topic_score_codex":0.000015271715,"about_ca_topic_score_gemma":0.0000057125885,"teacher_disagreement_score":0.9838122,"about_ca_system_score_codex":0.000039561928,"about_ca_system_score_gemma":0.00012531134,"threshold_uncertainty_score":0.55918527},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61316574,0.0003293904,0.21946207,0.026237236,0.0016168769,0.000864654,0.000044530152,0.001412171,0.13686734],"genre_scores_gemma":[0.9969507,0.000027292368,0.0023090846,0.0001314017,0.000083536936,0.000006067666,8.199228e-7,0.0000143821435,0.00047673477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99796283,0.000012953545,0.00042493996,0.00061330624,0.0006203652,0.00036560616],"domain_scores_gemma":[0.99882835,0.00014703031,0.0002126831,0.00034360512,0.00037877218,0.000089537716],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00067061523,0.00024216351,0.00027916278,0.00021156628,0.00021417627,0.0010875127,0.0020356292,0.00006232672,0.00006928848],"category_scores_gemma":[0.000185343,0.00015302411,0.00012959317,0.0013394485,0.00023811302,0.0008551386,0.00023913749,0.00036601064,0.00016070079],"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.000022208895,0.00006979754,0.0004529354,0.000090676906,0.00006224308,0.0000037855214,0.0016647932,0.00007272505,0.024861071,0.91322225,0.00087718567,0.058600307],"study_design_scores_gemma":[0.000028925886,0.00036168974,0.00027500454,0.001809043,0.000078301935,0.0000340936,0.0011611661,0.44088313,0.5004288,0.05258123,0.0018114838,0.0005471717],"about_ca_topic_score_codex":0.00010308789,"about_ca_topic_score_gemma":0.000009807969,"teacher_disagreement_score":0.86064106,"about_ca_system_score_codex":0.0000466773,"about_ca_system_score_gemma":0.00014649934,"threshold_uncertainty_score":0.99994946},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78770816,0.00042331856,0.13298811,0.060641848,0.005040279,0.00069991,0.000012955263,0.0007530071,0.011732415],"genre_scores_gemma":[0.98992985,0.00003072411,0.009065704,0.00038509766,0.00047720087,0.000018580098,2.717769e-7,0.000009485933,0.00008309209],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979194,0.000019045134,0.00047748385,0.00073420245,0.00052007736,0.000329793],"domain_scores_gemma":[0.9988646,0.00020541293,0.00012143596,0.00040589916,0.0003102748,0.00009239414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061465695,0.00022155777,0.00025963507,0.00012352064,0.00015604844,0.00091154897,0.002486969,0.000109870925,0.00005060717],"category_scores_gemma":[0.00027693535,0.00015062552,0.00013617413,0.00082150137,0.00016103317,0.0005975748,0.0004838117,0.00034542358,0.00019985368],"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.0000247338,0.000045365865,0.00012443424,0.000038473016,0.000016356724,0.0000017089436,0.009477793,0.000013701602,0.022016816,0.8114347,0.0007523157,0.1560536],"study_design_scores_gemma":[0.000008332298,0.000107453765,0.0006143875,0.00035279233,0.000011986916,0.0000029254286,0.0021587838,0.02076988,0.3027196,0.6720252,0.0010163393,0.00021234456],"about_ca_topic_score_codex":0.00015877311,"about_ca_topic_score_gemma":0.000045277942,"teacher_disagreement_score":0.28070277,"about_ca_system_score_codex":0.00004478864,"about_ca_system_score_gemma":0.00011353629,"threshold_uncertainty_score":0.87900877},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024541277,0.00003481639,0.96240264,0.0011881875,0.0006325775,0.0007867698,0.0000012153452,0.00018012685,0.010232413],"genre_scores_gemma":[0.9971423,0.00003334369,0.0014013584,0.00012967203,0.00006486572,0.0001098107,0.0000021331052,0.000022439086,0.0010940486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976549,0.000019620253,0.00076532376,0.0005735266,0.00053058175,0.00045603476],"domain_scores_gemma":[0.9988731,0.0003668294,0.00015890488,0.0002333999,0.00029139395,0.00007635111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069640344,0.00027831414,0.0002901996,0.00029576427,0.00022283234,0.00042600554,0.0012016563,0.00011439674,0.000063629566],"category_scores_gemma":[0.00045246803,0.0002227545,0.00015968464,0.000540514,0.00012823257,0.0005045348,0.00012919118,0.0007423408,0.0000712853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012220567,0.0000406045,0.00003064684,0.000100204394,0.000022242006,8.264607e-7,0.0047767013,0.5293257,0.017888531,0.42750472,0.000022980415,0.020164628],"study_design_scores_gemma":[0.000051516137,0.00056579366,0.00004953535,0.000660761,0.000011599355,0.0000019976949,0.0005071908,0.75777876,0.23406027,0.005842123,0.00026358388,0.00020683721],"about_ca_topic_score_codex":0.000026652828,"about_ca_topic_score_gemma":0.000008169053,"teacher_disagreement_score":0.97260106,"about_ca_system_score_codex":0.00012465223,"about_ca_system_score_gemma":0.00009956447,"threshold_uncertainty_score":0.9083665},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.440939,0.0009001845,0.523657,0.024499752,0.0015032977,0.0021047434,0.000019898382,0.0007042988,0.0056717684],"genre_scores_gemma":[0.9873356,0.00012972068,0.011910243,0.0001636508,0.00007982093,0.000101170845,3.781826e-7,0.000013112157,0.0002662696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857324,0.000008926955,0.0003608453,0.0005255512,0.00023851686,0.0002929012],"domain_scores_gemma":[0.9990821,0.00021398392,0.00012939711,0.00024890937,0.00025154641,0.00007405975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000315021,0.0001826934,0.00020116873,0.000088637564,0.00024516077,0.00046271394,0.0014171103,0.00006753915,0.000017826365],"category_scores_gemma":[0.00021112927,0.00013450053,0.00010844779,0.00059089204,0.00021731938,0.0003051185,0.0003638031,0.00028256234,0.000025733461],"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.000016304142,0.000028350652,0.00006312761,0.00006423548,0.000012474987,2.4780354e-7,0.00048257376,0.000028504759,0.027305478,0.8937748,0.00022095369,0.078002915],"study_design_scores_gemma":[0.00002260737,0.00016317843,0.000028466025,0.00018855484,0.000012498747,0.000009000196,0.00019067641,0.62922484,0.097642295,0.27045912,0.0018865631,0.00017222782],"about_ca_topic_score_codex":0.000012621621,"about_ca_topic_score_gemma":0.0000043729146,"teacher_disagreement_score":0.6291963,"about_ca_system_score_codex":0.000016349837,"about_ca_system_score_gemma":0.00003966869,"threshold_uncertainty_score":0.54847723},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5527638,0.00003845293,0.3970127,0.02823253,0.001668772,0.0025975972,0.00043847342,0.00034950196,0.016898155],"genre_scores_gemma":[0.996564,0.000008488872,0.0014326947,0.00020456025,0.000121478995,0.0001076131,0.0000015636509,0.000015855714,0.0015437761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976296,0.00002701563,0.0007084086,0.00063077925,0.00070457155,0.0002996393],"domain_scores_gemma":[0.99613434,0.0014634873,0.00026066348,0.00027887657,0.001777558,0.00008507932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018849258,0.00019783442,0.0002754914,0.00017736798,0.0002824855,0.0005630064,0.0012492075,0.0000960382,0.00019633489],"category_scores_gemma":[0.0042240624,0.00012835287,0.00025902287,0.0008903245,0.0003301839,0.0002968631,0.00020560702,0.00021824778,0.00040898216],"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.000062224855,0.000041882337,0.00000885135,0.000015129845,0.000014588927,2.3299745e-7,0.00072711194,0.000019149822,0.17086253,0.80605775,0.0004827374,0.021707805],"study_design_scores_gemma":[0.000009452055,0.000060712107,0.000011110573,0.00007455314,0.00001349922,0.0000023927482,0.0012206447,0.029404636,0.45265797,0.51603246,0.0004292244,0.000083350096],"about_ca_topic_score_codex":0.000016806576,"about_ca_topic_score_gemma":0.000022503627,"teacher_disagreement_score":0.44380015,"about_ca_system_score_codex":0.000035158722,"about_ca_system_score_gemma":0.00011799969,"threshold_uncertainty_score":0.5429083},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039190825,0.000072425544,0.95486534,0.0021035967,0.0015392049,0.0006712721,0.00001883909,0.00023302707,0.0013054456],"genre_scores_gemma":[0.9861635,0.000010458688,0.01273337,0.00012514813,0.00019574449,0.0000646401,0.0000023692244,0.00001806286,0.0006866885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807596,0.000025833795,0.00053838734,0.0005681255,0.00046424658,0.00032744146],"domain_scores_gemma":[0.9986266,0.00027744946,0.00019459831,0.00024838417,0.0005745204,0.00007844223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008946523,0.0002227458,0.00026351417,0.00018268121,0.0002305267,0.0006224743,0.0012015684,0.00010155506,0.00003108797],"category_scores_gemma":[0.0005540134,0.0001624216,0.00017482338,0.0005681308,0.00016852014,0.0005555705,0.00023607044,0.0002613047,0.00004250959],"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.00015924493,0.00011171645,0.000036562764,0.0001364368,0.000022680444,0.0000010686955,0.0016134203,0.00012104299,0.070044115,0.6912923,0.00093421113,0.23552725],"study_design_scores_gemma":[0.000050150647,0.00038178932,0.000059927126,0.0005105501,0.000026810692,0.000008317193,0.00014828109,0.5463634,0.18587554,0.26589942,0.0004856649,0.00019016294],"about_ca_topic_score_codex":0.000032992913,"about_ca_topic_score_gemma":0.0000046962805,"teacher_disagreement_score":0.94697267,"about_ca_system_score_codex":0.000054751203,"about_ca_system_score_gemma":0.00011907201,"threshold_uncertainty_score":0.66233605},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053139508,0.000031159172,0.9423323,0.0026165647,0.00048687556,0.00050085573,0.000056081262,0.0002263576,0.00061024964],"genre_scores_gemma":[0.954075,0.00001078041,0.045270525,0.00011684253,0.00012469878,0.000088588735,0.0000089832465,0.000020269359,0.00028433808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979821,0.000010622201,0.00045812043,0.0006087024,0.0005844993,0.000355956],"domain_scores_gemma":[0.9986084,0.00023913052,0.00020809352,0.00023024403,0.00062401773,0.000090097165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042581683,0.00026341373,0.00026160904,0.00017458205,0.00031732811,0.0004613522,0.0011535713,0.00009112221,0.000009574257],"category_scores_gemma":[0.0002192081,0.00018387429,0.000113711234,0.00053960655,0.00025011844,0.00070150715,0.00017962561,0.00030277635,0.000028883589],"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.000062608546,0.00009304273,0.000039848423,0.00009687661,0.000030468218,0.0000016222502,0.0018919274,0.009116088,0.041311156,0.9374845,0.00023217687,0.009639659],"study_design_scores_gemma":[0.000028924855,0.00014768937,0.00006792128,0.00038615306,0.00001604863,0.000009714819,0.00011120344,0.6702912,0.10600903,0.22274755,0.000015321422,0.0001692456],"about_ca_topic_score_codex":0.000013183349,"about_ca_topic_score_gemma":0.0000047336744,"teacher_disagreement_score":0.9009355,"about_ca_system_score_codex":0.000069193164,"about_ca_system_score_gemma":0.00024901913,"threshold_uncertainty_score":0.74981755},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028915778,0.000019596957,0.9543075,0.007913928,0.00057041104,0.0011901569,0.000014622802,0.00046159243,0.006606418],"genre_scores_gemma":[0.94792724,0.0000136838935,0.05094741,0.00023234313,0.00012890552,0.00028658065,0.0000012067655,0.000017291373,0.0004453302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832916,0.000012185282,0.00047922056,0.0005612616,0.00035113824,0.0002670275],"domain_scores_gemma":[0.998849,0.0001575548,0.00017188354,0.00028278597,0.0004685976,0.000070194095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004691428,0.00020241742,0.00018862079,0.00016011887,0.00029959736,0.00038995367,0.0013014423,0.00009890107,0.000038525035],"category_scores_gemma":[0.00016288752,0.00015746884,0.0001388774,0.00075233215,0.00013462851,0.00034942813,0.00016625125,0.00022928961,0.00006200454],"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.00003649822,0.00006938283,0.0000019055515,0.00004107888,0.000012277794,2.060489e-7,0.00084926834,0.00004774951,0.03581491,0.91513026,0.0006224013,0.047374092],"study_design_scores_gemma":[0.000033215238,0.00027101976,0.0000063283474,0.00020716277,0.000009657013,0.0000033280294,0.00024813873,0.3618459,0.19962138,0.4367045,0.00089529104,0.00015409742],"about_ca_topic_score_codex":0.000020322477,"about_ca_topic_score_gemma":0.00000364266,"teacher_disagreement_score":0.9190115,"about_ca_system_score_codex":0.00006534523,"about_ca_system_score_gemma":0.00013446862,"threshold_uncertainty_score":0.64213926},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04938832,0.00005597533,0.9412482,0.0056130406,0.00015320882,0.0003094152,9.927046e-7,0.000440736,0.0027901477],"genre_scores_gemma":[0.99659616,0.00003827493,0.0028220355,0.0000399208,0.00001480652,0.00002730144,7.292759e-7,0.0000073865695,0.0004533719],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989367,0.000013058712,0.00024308404,0.00037118603,0.00027964628,0.00015629636],"domain_scores_gemma":[0.99941605,0.000050381965,0.00014266097,0.00008697485,0.00027179118,0.00003214119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021097573,0.00013129691,0.0001126047,0.00011309184,0.00020982801,0.0005961283,0.0003917206,0.000064103326,0.000013738989],"category_scores_gemma":[0.00007966542,0.00008947469,0.000020873787,0.00065678067,0.00028081512,0.00062225934,0.00014166355,0.0002119502,0.000022720182],"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.000028720799,0.000022825065,0.00004767706,0.00001754558,0.000009665284,2.9628768e-7,0.00052837876,0.00004236892,0.016005207,0.76092696,0.000027191452,0.22234318],"study_design_scores_gemma":[0.000021826614,0.00025956487,0.00006303262,0.00016827778,0.000008954226,0.0000029645269,0.0010891346,0.44172284,0.4628116,0.09366988,0.00007281531,0.00010913021],"about_ca_topic_score_codex":0.000011994585,"about_ca_topic_score_gemma":0.0000034577665,"teacher_disagreement_score":0.94720787,"about_ca_system_score_codex":0.000037335896,"about_ca_system_score_gemma":0.000062547915,"threshold_uncertainty_score":0.5748479},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6532605,0.0008768606,0.21948563,0.025856895,0.010231115,0.0031815448,0.00012312173,0.00092140964,0.08606288],"genre_scores_gemma":[0.9969802,0.0001150568,0.00075405824,0.00008574947,0.0002318175,0.000041548472,4.8956133e-7,0.00002958565,0.0017614965],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99541664,0.000043197382,0.00088593684,0.0009739451,0.0021448683,0.0005354356],"domain_scores_gemma":[0.9968126,0.0008397541,0.00025979974,0.00041854967,0.0015201843,0.00014911639],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0019820328,0.0002942657,0.0003617003,0.0007204199,0.00032569474,0.0011029494,0.002497873,0.00014149997,0.00076186383],"category_scores_gemma":[0.0036214308,0.00018688623,0.0002687299,0.0030746972,0.0007447302,0.0008070608,0.00054148893,0.0007345237,0.00071385084],"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.00024946986,0.00020824118,0.00030843454,0.000050520095,0.00009268428,0.000005308226,0.0029667066,0.0021704247,0.05578538,0.3899572,0.00079427235,0.5474114],"study_design_scores_gemma":[0.000029706833,0.00016283822,0.00046946926,0.00029560042,0.000013980819,0.000009448137,0.00542635,0.08653226,0.30988556,0.5957065,0.0011899722,0.00027829706],"about_ca_topic_score_codex":0.000038299757,"about_ca_topic_score_gemma":0.000038757655,"teacher_disagreement_score":0.5471331,"about_ca_system_score_codex":0.00008368034,"about_ca_system_score_gemma":0.00018117667,"threshold_uncertainty_score":0.999934},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37261352,0.000113736445,0.61836046,0.005608714,0.0004920257,0.0006234414,0.00023002166,0.0001666828,0.0017914079],"genre_scores_gemma":[0.99693936,0.000020078513,0.002606776,0.00013905042,0.000034108147,0.000023551975,0.000014095585,0.000012366075,0.00021058768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998069,0.000045266035,0.0005575463,0.0005289791,0.0005379391,0.00026125796],"domain_scores_gemma":[0.99864644,0.00015248772,0.00029374336,0.00036835734,0.00046987084,0.00006908122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011392621,0.00019729655,0.0002745728,0.0002644269,0.00013285739,0.0003693816,0.0013253648,0.00006348346,0.00007469196],"category_scores_gemma":[0.00031603273,0.00013285351,0.00010818498,0.0012171924,0.00017673489,0.000636377,0.00029115894,0.00022229103,0.000042568932],"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.0012708765,0.00038425357,0.00027478187,0.00030072773,0.00012795314,0.000008822404,0.013873595,0.00047002087,0.13217555,0.77635723,0.0009791914,0.073777],"study_design_scores_gemma":[0.00003250287,0.0004137388,0.00018899809,0.0006497877,0.000047039626,0.000009210663,0.0014670497,0.6791848,0.29702684,0.019999051,0.00075227354,0.00022871599],"about_ca_topic_score_codex":0.000027826743,"about_ca_topic_score_gemma":0.000043072887,"teacher_disagreement_score":0.7563582,"about_ca_system_score_codex":0.000038675797,"about_ca_system_score_gemma":0.00014946592,"threshold_uncertainty_score":0.54176086},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98014486,0.000029659726,0.0044680242,0.0015486508,0.00049266114,0.00027438876,0.000016538876,0.00007766297,0.0129475435],"genre_scores_gemma":[0.9982533,0.000008585248,0.00030714867,0.00007078221,0.0003490488,0.000027171498,0.0000019304964,0.000021986141,0.0009600881],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987409,0.000008703306,0.00031074134,0.00036890348,0.000263704,0.00030700772],"domain_scores_gemma":[0.9994727,0.000021110594,0.000104017294,0.0001301802,0.00019092421,0.000081089514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000183628,0.00020282729,0.00018380948,0.00004565431,0.0002312038,0.00034303946,0.0004133034,0.00004301992,0.0003476772],"category_scores_gemma":[0.0000063918646,0.00012694558,0.00010764765,0.00042144093,0.0002293413,0.00024073504,0.00009649448,0.00032186508,0.000058337027],"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.00006692626,0.0000756842,0.0017046449,0.000033095737,0.000049562695,6.836272e-7,0.0013890429,0.00046743767,0.01949203,0.9214274,0.0005744725,0.054719012],"study_design_scores_gemma":[0.000055062985,0.0002575574,0.00010691532,0.0007579571,0.00004473374,0.0000070834485,0.004613729,0.08406236,0.8281319,0.07842806,0.0029919373,0.0005426729],"about_ca_topic_score_codex":0.0001067701,"about_ca_topic_score_gemma":0.000008875361,"teacher_disagreement_score":0.84299934,"about_ca_system_score_codex":0.000019820782,"about_ca_system_score_gemma":0.00006278031,"threshold_uncertainty_score":0.517669},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15575251,0.00074654946,0.8316255,0.00009165051,0.00046715612,0.0005318283,6.842871e-7,0.00022139387,0.010562721],"genre_scores_gemma":[0.9993617,0.00009173341,0.0003209876,0.000013653738,0.000094619776,0.000029701192,5.8562375e-7,0.00003339835,0.00005364995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837923,0.000016628857,0.00052087306,0.00029056368,0.00036307442,0.000429648],"domain_scores_gemma":[0.9996154,0.000060760598,0.000034594683,0.00008409744,0.0001347114,0.000070450325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000553377,0.00021435802,0.0002469528,0.00021302883,0.00012107107,0.00021406419,0.00041104876,0.00009805767,0.000031266947],"category_scores_gemma":[0.000069590256,0.00016170579,0.00010512421,0.00085498695,0.00014593767,0.00042074468,0.00005522603,0.00078193715,0.0000043868604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025627862,0.000014211703,0.00003638708,0.00033355053,0.000014719432,0.000001395826,0.000836101,0.8945118,0.027896743,0.042980805,0.00000303963,0.033345584],"study_design_scores_gemma":[0.000016011696,0.000045675588,0.0000036995782,0.0005679446,0.0000078664325,0.000006220269,0.0009743529,0.9586887,0.034522023,0.004973798,0.000023812308,0.00016992234],"about_ca_topic_score_codex":0.000024996953,"about_ca_topic_score_gemma":0.000003322715,"teacher_disagreement_score":0.84360915,"about_ca_system_score_codex":0.00008389005,"about_ca_system_score_gemma":0.000025123223,"threshold_uncertainty_score":0.6594171},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0131305205,0.00014419915,0.9813618,0.0012931238,0.0010540652,0.0003452969,0.000011697276,0.00032833056,0.002330975],"genre_scores_gemma":[0.96071285,0.000019023206,0.03850721,0.00017642729,0.00010898011,0.000023255046,0.0000012782295,0.000026443518,0.0004245625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969165,0.00003678083,0.00061457016,0.00086787465,0.00085312076,0.00071116415],"domain_scores_gemma":[0.99864596,0.00018393413,0.00015847589,0.0004176379,0.00042184078,0.00017216214],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010560005,0.0003342644,0.00034386365,0.00022777313,0.0002917994,0.0006234395,0.0024796522,0.00015614723,0.000041223528],"category_scores_gemma":[0.00015019554,0.00025639328,0.00016928393,0.0010705785,0.00029083143,0.0006249116,0.0007279627,0.00076744106,0.00035423334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011009519,0.00081516267,0.0012945035,0.00052690186,0.00012729164,0.00008693399,0.03498571,0.03730251,0.06665853,0.5386712,0.0011600318,0.31826112],"study_design_scores_gemma":[0.00003238793,0.0001571463,0.00024794549,0.0007202319,0.000011244668,0.000026735624,0.00074104336,0.8877746,0.094195545,0.015695674,0.00011988507,0.00027758078],"about_ca_topic_score_codex":0.000046464236,"about_ca_topic_score_gemma":0.0000019200006,"teacher_disagreement_score":0.9475823,"about_ca_system_score_codex":0.000103891405,"about_ca_system_score_gemma":0.00019624623,"threshold_uncertainty_score":0.99998885},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06957153,0.000100739824,0.91470534,0.004062675,0.0008216185,0.0004926235,0.0000227784,0.0005704297,0.009652277],"genre_scores_gemma":[0.9968318,0.000017126351,0.0019638594,0.00008334813,0.000099178294,0.00001873275,0.000007665409,0.00001670753,0.0009616355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788356,0.000042253334,0.0005752349,0.0005581768,0.0005911359,0.0003496389],"domain_scores_gemma":[0.998745,0.0002284597,0.00027521708,0.000206709,0.00046088075,0.00008369694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008080996,0.0002405094,0.00023506884,0.00012520551,0.0002791671,0.0008255924,0.0014078041,0.000110288885,0.000048386937],"category_scores_gemma":[0.00020347079,0.00019059755,0.000115777235,0.0008980855,0.0001178828,0.0005504979,0.00024300504,0.00034596934,0.00039554975],"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.00003408288,0.00014471411,0.00023872887,0.0002014573,0.000036169648,0.0000024958265,0.008041903,0.002973065,0.108698644,0.8324749,0.002761207,0.044392638],"study_design_scores_gemma":[0.000027594575,0.00024782357,0.00005077709,0.0006242594,0.000010288049,0.000012957351,0.0008494949,0.8578491,0.06479067,0.071304224,0.0039089657,0.000323829],"about_ca_topic_score_codex":0.000031972675,"about_ca_topic_score_gemma":0.0000020480752,"teacher_disagreement_score":0.9272602,"about_ca_system_score_codex":0.00006845931,"about_ca_system_score_gemma":0.000118132055,"threshold_uncertainty_score":0.79612064},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20481849,0.0002530285,0.6699478,0.026061784,0.0015031664,0.0033231543,0.000012174422,0.0050342935,0.08904609],"genre_scores_gemma":[0.9549485,0.00009496627,0.044320285,0.000048896763,0.000055745702,0.00010055403,2.2861025e-7,0.000019302513,0.0004115458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99777853,0.000016279824,0.0004719246,0.0007247166,0.0006151698,0.00039338655],"domain_scores_gemma":[0.99847287,0.00021335157,0.00016198542,0.00043547057,0.0006139246,0.00010237704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007541905,0.0002526138,0.00024652787,0.00021185876,0.00025461544,0.0009176568,0.0021635564,0.00010301799,0.00004981392],"category_scores_gemma":[0.00027210187,0.00017131506,0.000118491735,0.0010907478,0.00029418094,0.0004611867,0.00040634975,0.0004986825,0.00013623982],"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.00004635585,0.00022714719,0.00012357235,0.00016829759,0.00003510676,0.0000035262997,0.0012365567,0.00065036153,0.0019314563,0.6244063,0.00035615545,0.3708152],"study_design_scores_gemma":[0.000013460264,0.00036831407,0.00010878145,0.0013073733,0.000020589774,0.000020038511,0.0002407889,0.39435962,0.5759935,0.026730258,0.00050995365,0.00032734737],"about_ca_topic_score_codex":0.00007213912,"about_ca_topic_score_gemma":0.000007182781,"teacher_disagreement_score":0.75013,"about_ca_system_score_codex":0.00006005329,"about_ca_system_score_gemma":0.0001949865,"threshold_uncertainty_score":0.8848986},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9742657,0.00006430144,0.01721067,0.0024914988,0.00018587435,0.0008288721,0.0000146776065,0.000050671762,0.0048877527],"genre_scores_gemma":[0.9988859,0.00007185298,0.000810465,0.000029972767,0.00005282254,0.00002255952,7.1364536e-7,0.000012884664,0.00011278165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838436,0.000043440054,0.000568345,0.00026655052,0.00054244796,0.00019487055],"domain_scores_gemma":[0.9987758,0.0003860109,0.00013408797,0.00018211157,0.0004960839,0.00002589867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001096539,0.00014536019,0.0002013585,0.00013893704,0.00008250603,0.00009892155,0.0005972462,0.00008446939,0.000053904958],"category_scores_gemma":[0.00045141403,0.00009124884,0.00010408507,0.00062799064,0.0001836265,0.00021575502,0.0000390589,0.00027087436,0.0000059100407],"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.00015561323,0.00019601491,0.00007808811,0.0004568889,0.000018931196,5.923721e-7,0.03950406,0.08195811,0.006266482,0.8561252,0.00014643994,0.01509359],"study_design_scores_gemma":[0.00002005809,0.000074857235,0.000034562356,0.00048652143,0.000022018141,0.0000012091617,0.0032322959,0.77048856,0.027861264,0.19768451,0.000010185308,0.00008394545],"about_ca_topic_score_codex":0.00021565176,"about_ca_topic_score_gemma":0.00013798101,"teacher_disagreement_score":0.68853045,"about_ca_system_score_codex":0.000036066052,"about_ca_system_score_gemma":0.000087797,"threshold_uncertainty_score":0.37210196},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072239186,0.00006131601,0.9849993,0.003615754,0.00089547265,0.0010987265,0.000003539742,0.00026796915,0.0018339964],"genre_scores_gemma":[0.91630596,0.000037215214,0.08228014,0.000082908875,0.00008458549,0.0001229437,0.0000015031775,0.000028196127,0.0010565268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972025,0.000014517549,0.0006218798,0.00070903334,0.0008409186,0.0006111523],"domain_scores_gemma":[0.9985676,0.00019043422,0.00018685279,0.00036003592,0.00058133685,0.00011376722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010333207,0.0002808928,0.00026752867,0.00021429086,0.0002806983,0.0010294868,0.0025281007,0.00012233459,0.000025386114],"category_scores_gemma":[0.00018844684,0.00021327866,0.00021881296,0.00076284807,0.00024673555,0.0005159718,0.0005437853,0.0004862803,0.00010802346],"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.000032569067,0.00006471068,0.000025677466,0.00020047197,0.000043557673,0.0000015100235,0.0019733363,0.012959845,0.007158876,0.8268394,0.00007580716,0.15062426],"study_design_scores_gemma":[0.000034682434,0.00039078417,0.000027682736,0.00039821691,0.000016190159,0.00000961669,0.0006522343,0.8709118,0.054822236,0.07142713,0.0010308684,0.00027860922],"about_ca_topic_score_codex":0.000016290443,"about_ca_topic_score_gemma":0.000003235454,"teacher_disagreement_score":0.90908206,"about_ca_system_score_codex":0.00013074744,"about_ca_system_score_gemma":0.00020366063,"threshold_uncertainty_score":0.9927365},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056397665,0.000047684578,0.9357616,0.003028278,0.0003462969,0.00089465175,0.000010753743,0.00049363397,0.003019495],"genre_scores_gemma":[0.9942675,0.000036276757,0.004943215,0.00009307881,0.00010649629,0.0002450168,7.187667e-7,0.0000135300015,0.00029411685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986635,0.000007536809,0.0003853318,0.00046712166,0.0002609241,0.00021563],"domain_scores_gemma":[0.9990152,0.00008371483,0.00014512439,0.00023559178,0.00046416727,0.00005617126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003192459,0.00016313203,0.00014262863,0.00015821331,0.0002531157,0.00038306933,0.00097364123,0.00009648203,0.00002292981],"category_scores_gemma":[0.0001230395,0.00012660246,0.0001491431,0.00082360586,0.0001166736,0.00044299153,0.00013918876,0.0001962761,0.000052020645],"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.000012617073,0.00003359394,0.0000058109213,0.000040156952,0.0000062842546,5.6128275e-8,0.0002182668,0.000009499976,0.07603496,0.58509517,0.000087501736,0.3384561],"study_design_scores_gemma":[0.000010933895,0.00016556431,0.0000212367,0.00014443371,0.000009614311,0.000003618191,0.00012466843,0.16941197,0.68034947,0.14875297,0.0008918974,0.0001136069],"about_ca_topic_score_codex":0.00002201244,"about_ca_topic_score_gemma":0.0000125908455,"teacher_disagreement_score":0.9378699,"about_ca_system_score_codex":0.000055023356,"about_ca_system_score_gemma":0.00007421836,"threshold_uncertainty_score":0.51626986},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7880518,0.0005304791,0.1826945,0.0013462497,0.0025649855,0.0009258612,0.000032140244,0.0019056357,0.021948367],"genre_scores_gemma":[0.9993543,0.00003528189,0.0003304647,0.000019400866,0.00013197349,0.000022224427,0.0000012105961,0.00003351655,0.00007160632],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985373,0.000015702679,0.000523828,0.000310289,0.00031449654,0.00029835655],"domain_scores_gemma":[0.99935055,0.00011361012,0.000121341516,0.00006089709,0.0002778194,0.00007578055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003952308,0.00022902043,0.00025759547,0.00013437915,0.00022615978,0.00037810652,0.00022156136,0.00010196278,0.000052103183],"category_scores_gemma":[0.00016358093,0.00018545205,0.00007556581,0.00029894494,0.00012506699,0.0002547137,0.000070541995,0.0005502102,0.000019988474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002136166,0.000025489993,0.00034788615,0.00084349385,0.000054302687,0.000002019385,0.0034114611,0.002955568,0.22229324,0.011065537,0.000010038705,0.7589696],"study_design_scores_gemma":[0.000017978966,0.00008403922,0.00039955182,0.0013437477,0.00002020073,0.000010968818,0.0024472636,0.86540186,0.12871139,0.0013125689,0.00006364766,0.0001867831],"about_ca_topic_score_codex":0.000102914055,"about_ca_topic_score_gemma":0.000031431886,"teacher_disagreement_score":0.8624463,"about_ca_system_score_codex":0.000086572,"about_ca_system_score_gemma":0.000052659412,"threshold_uncertainty_score":0.7562516},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0187156,0.000035027846,0.97393143,0.0022646294,0.00079414557,0.0011028141,0.000010811602,0.00012423994,0.003021325],"genre_scores_gemma":[0.99120307,0.000019412906,0.007983294,0.00008628483,0.000060352973,0.0001405132,9.992203e-7,0.00001752551,0.0004885196],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802613,0.000033304084,0.00059639954,0.00060232275,0.00042863307,0.00031321897],"domain_scores_gemma":[0.9989495,0.0003471746,0.0002338071,0.00022516982,0.00017764838,0.00006667646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076006056,0.00021456783,0.00024818673,0.0002526406,0.000117645606,0.0004978217,0.00090403896,0.00009536063,0.00008092836],"category_scores_gemma":[0.0004095527,0.00018105064,0.000120407996,0.00060503196,0.00008949646,0.00069556106,0.00024524328,0.00020778901,0.00004794717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014968512,0.0008929172,0.0008244887,0.00057317666,0.00011353061,0.000004224208,0.008391024,0.006004089,0.09278688,0.29433888,0.00041713112,0.595504],"study_design_scores_gemma":[0.00003522576,0.00015388103,0.0001874951,0.0011891051,0.000013301335,0.000007952671,0.00067426555,0.87803674,0.11330435,0.005884953,0.0002576094,0.00025512042],"about_ca_topic_score_codex":0.000024420198,"about_ca_topic_score_gemma":0.00002070111,"teacher_disagreement_score":0.9724875,"about_ca_system_score_codex":0.00015906343,"about_ca_system_score_gemma":0.00008667395,"threshold_uncertainty_score":0.73830307},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25178346,0.000033708635,0.7362371,0.0038391592,0.00078080426,0.00042651015,0.0000018820025,0.00025446262,0.006642894],"genre_scores_gemma":[0.99428535,0.0000040145383,0.004885378,0.00031076104,0.00011320601,0.000028649596,2.3106844e-7,0.000026948239,0.0003454395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967121,0.00002261655,0.0012783579,0.0008504793,0.00057036075,0.0005661169],"domain_scores_gemma":[0.99852717,0.00013659427,0.00047740407,0.00040106848,0.00030454394,0.0001532396],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014217796,0.00030300175,0.0003776336,0.0003929345,0.00020217641,0.0008427117,0.0014159692,0.00011518298,0.000016593629],"category_scores_gemma":[0.00090516097,0.00024648008,0.00017601464,0.0013488849,0.00012243258,0.00038909493,0.00048021242,0.0005381555,0.000053818618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055548695,0.0001327405,0.00061194954,0.00015932272,0.000022085858,0.000013176104,0.013105922,0.0460902,0.12943839,0.59796715,0.0004630383,0.21194047],"study_design_scores_gemma":[0.000012697877,0.00007565841,0.00006642018,0.00095905794,0.0000071559916,0.000014015658,0.0004738761,0.7499727,0.19934583,0.04881316,0.0000298656,0.00022956706],"about_ca_topic_score_codex":0.00030271342,"about_ca_topic_score_gemma":0.00012608773,"teacher_disagreement_score":0.7425019,"about_ca_system_score_codex":0.00014238938,"about_ca_system_score_gemma":0.00025930122,"threshold_uncertainty_score":0.99999875},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015242658,0.00047173278,0.9556038,0.0065753055,0.00070721336,0.00058818236,0.000008168618,0.0006334793,0.02016948],"genre_scores_gemma":[0.989967,0.00016352242,0.009109896,0.000207804,0.00009559508,0.000055998753,5.5621774e-7,0.000027880555,0.0003717497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967844,0.00004541215,0.0007271887,0.0010656632,0.00075375417,0.0006236094],"domain_scores_gemma":[0.99749935,0.000426522,0.0002482023,0.0006275168,0.0009853602,0.00021305363],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007828045,0.00046363106,0.0004204013,0.00032998086,0.00031006694,0.00110341,0.00354614,0.00014803025,0.00010733614],"category_scores_gemma":[0.00034497192,0.00030877025,0.00018836223,0.0021933685,0.00061598024,0.0012150462,0.0005638934,0.000692373,0.00025199124],"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.000040974894,0.00010891464,0.000102975195,0.00016828079,0.000029967443,0.0000029838343,0.0015972629,0.00013039849,0.015286845,0.894476,0.0003342011,0.08772121],"study_design_scores_gemma":[0.000028285498,0.0005847203,0.00020146255,0.0035797663,0.00003996335,0.00003164316,0.00026850007,0.5126175,0.12336837,0.35838568,0.00027926287,0.00061481877],"about_ca_topic_score_codex":0.00005957262,"about_ca_topic_score_gemma":0.000034247605,"teacher_disagreement_score":0.97472435,"about_ca_system_score_codex":0.000076413635,"about_ca_system_score_gemma":0.00046774128,"threshold_uncertainty_score":0.99993646},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059220266,0.00024697118,0.91026723,0.00054350676,0.0010957975,0.0007407153,0.000018179468,0.0017832688,0.026084049],"genre_scores_gemma":[0.9784774,0.000074576266,0.020962225,0.000023794792,0.000117867705,0.00004949761,0.0000019283311,0.00006585494,0.00022681252],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984525,0.000006677027,0.00048463326,0.00038841856,0.00033048226,0.00033730757],"domain_scores_gemma":[0.9992695,0.000048221413,0.000091683774,0.0002318453,0.00029532408,0.00006343973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028315568,0.00028320058,0.00024473862,0.00019195059,0.00011044878,0.00017075187,0.00068592647,0.00013647866,0.000095405005],"category_scores_gemma":[0.00017808899,0.00024006407,0.000117596785,0.00065559277,0.00017995197,0.00043757304,0.00012264811,0.00042195685,0.0000735083],"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.000013380856,0.000024699217,0.00003192912,0.00027620082,0.00003387415,0.00000222728,0.0007630712,0.0051680687,0.65675914,0.30646327,0.0002511882,0.030212937],"study_design_scores_gemma":[0.0000055374376,0.00005457808,0.000025796548,0.00071472715,0.000014668833,0.0000050774306,0.00008430283,0.18964332,0.5482986,0.26086465,0.000087951725,0.00020079526],"about_ca_topic_score_codex":0.000015548734,"about_ca_topic_score_gemma":0.0000044925364,"teacher_disagreement_score":0.91925716,"about_ca_system_score_codex":0.00014034235,"about_ca_system_score_gemma":0.0000343285,"threshold_uncertainty_score":0.9789529},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29704818,0.00079221703,0.6631922,0.031604044,0.0010426049,0.001493023,0.0000628706,0.0009371165,0.003827732],"genre_scores_gemma":[0.986823,0.00034904777,0.012536637,0.000060858856,0.000018326218,0.00004508458,0.00000466831,0.000008344125,0.00015399902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982919,0.000014654823,0.0004762106,0.000688664,0.00030479854,0.00022378055],"domain_scores_gemma":[0.9990295,0.00007231622,0.00018530576,0.00046867516,0.00020074868,0.00004340994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044933116,0.00017682159,0.00017237206,0.00019989998,0.00009047122,0.0006321154,0.002258604,0.000094775474,0.000010704344],"category_scores_gemma":[0.00018055186,0.00013734527,0.000023201203,0.000864155,0.00026254405,0.0012200272,0.00056955044,0.00027266133,0.00002755797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011754464,0.000097174365,0.0002566547,0.00007085901,0.00000640615,7.88939e-7,0.00046676525,0.000031426745,0.027514609,0.6502076,0.00014172793,0.32119426],"study_design_scores_gemma":[0.000044564335,0.000052420644,0.0013306095,0.00024018179,0.0000057615184,0.0000025032587,0.0011404662,0.91582495,0.050716996,0.030415792,0.00005566765,0.00017008012],"about_ca_topic_score_codex":0.000016800393,"about_ca_topic_score_gemma":0.000017156124,"teacher_disagreement_score":0.91579354,"about_ca_system_score_codex":0.000053799453,"about_ca_system_score_gemma":0.000113477014,"threshold_uncertainty_score":0.60955036},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012405715,0.000031848478,0.98112094,0.0023137543,0.0012612548,0.00062082964,0.0000077236,0.00021312831,0.00202482],"genre_scores_gemma":[0.8747018,0.000018224877,0.1247303,0.00004655986,0.00011512966,0.00007245535,0.000002021047,0.0000134133925,0.00030007339],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99844927,0.000016497268,0.0004990363,0.00042881625,0.0003839168,0.00022244683],"domain_scores_gemma":[0.9986721,0.00013454347,0.00023353778,0.00023831915,0.00067323557,0.0000482131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007033225,0.00016249434,0.00014518548,0.00017092375,0.00018025366,0.0005172578,0.0011763572,0.00009402309,0.00001953876],"category_scores_gemma":[0.0006235984,0.00012696527,0.00010884831,0.0008091742,0.00010167076,0.0010547835,0.00011392473,0.00017561438,0.000062813386],"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.000014515047,0.00002414612,0.000015002975,0.000078755715,0.000007277102,3.5154045e-8,0.0007652423,0.00008186594,0.03900395,0.863283,0.00013587259,0.09659033],"study_design_scores_gemma":[0.00000748087,0.00007604939,0.00004914891,0.000106419626,0.0000069424545,0.0000010790932,0.00008426669,0.3274016,0.39826193,0.27355373,0.0003610414,0.00009030889],"about_ca_topic_score_codex":0.000015044907,"about_ca_topic_score_gemma":0.0000023977911,"teacher_disagreement_score":0.8622961,"about_ca_system_score_codex":0.00008592721,"about_ca_system_score_gemma":0.000115504794,"threshold_uncertainty_score":0.51774937},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1842877,0.0003230164,0.7611944,0.028769819,0.007321569,0.0018380194,0.00007675723,0.0004638842,0.015724808],"genre_scores_gemma":[0.99285054,0.000025767844,0.0015505763,0.00006399813,0.0003698394,0.000022876397,0.000030105806,0.000013335941,0.0050729606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966243,0.000052903575,0.00080453086,0.0011502715,0.0011005311,0.00026749767],"domain_scores_gemma":[0.9978649,0.000544153,0.00033879254,0.0006634396,0.00052401336,0.00006469651],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0064929663,0.00016790167,0.0002082756,0.00026831182,0.0005068069,0.002140179,0.0024043731,0.00006347849,0.00013747974],"category_scores_gemma":[0.0076536187,0.00011244208,0.00010498628,0.001102627,0.00016381675,0.0006717424,0.00067997497,0.00028961722,0.00021169876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003074211,0.000039275565,0.00007878663,0.000024057734,0.000014715952,2.2379395e-7,0.00072587247,0.00342541,0.018997496,0.5623915,0.016890997,0.3973809],"study_design_scores_gemma":[0.000012085603,0.00010334252,0.0000145296335,0.00008656604,0.00001820245,0.0000014216082,0.0006201584,0.8200294,0.044351656,0.10365333,0.030989992,0.000119316675],"about_ca_topic_score_codex":0.00002286658,"about_ca_topic_score_gemma":0.000019404262,"teacher_disagreement_score":0.816604,"about_ca_system_score_codex":0.000034935638,"about_ca_system_score_gemma":0.00010263714,"threshold_uncertainty_score":0.9988957},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042898167,0.0003573767,0.8896547,0.018691234,0.0035262671,0.0019631037,0.00025260242,0.0033276344,0.039328933],"genre_scores_gemma":[0.96818477,0.00008034896,0.031018782,0.00025548047,0.00013389916,0.00002880606,0.000010843593,0.00002128189,0.000265782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9973841,0.000022662289,0.0005598759,0.0009801574,0.00066613214,0.00038709558],"domain_scores_gemma":[0.99834555,0.0001089851,0.00022453039,0.00085134053,0.00037762884,0.00009193493],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0007857393,0.0002749035,0.00024646957,0.00019250797,0.00017995424,0.00097586325,0.005980705,0.00011088785,0.000049385362],"category_scores_gemma":[0.0003555534,0.0002113416,0.00007979533,0.0010813632,0.00028404637,0.0013579456,0.001978178,0.00042722045,0.00011450997],"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.000012389926,0.00009465661,0.000035099136,0.00005204764,0.000027521706,0.0000015693763,0.0009721484,0.000052865897,0.03065361,0.71531934,0.009888492,0.24289025],"study_design_scores_gemma":[0.000012130347,0.00017492566,0.000022757871,0.0006313077,0.000017186396,0.000009687603,0.00020943963,0.43883616,0.5162551,0.041478343,0.0020767713,0.0002762209],"about_ca_topic_score_codex":0.000055593093,"about_ca_topic_score_gemma":0.0000149176985,"teacher_disagreement_score":0.9252866,"about_ca_system_score_codex":0.00009191713,"about_ca_system_score_gemma":0.00020803051,"threshold_uncertainty_score":0.9993974},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085110284,0.0002932753,0.8903464,0.013506109,0.0010098555,0.0010130085,0.00014671794,0.00079772243,0.007776626],"genre_scores_gemma":[0.9706664,0.00006535242,0.029139843,0.00003121518,0.000025693354,0.00002676448,0.0000047854132,0.000014630632,0.000025320911],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99628776,0.00004130864,0.0008681396,0.0011277022,0.0012619247,0.00041313257],"domain_scores_gemma":[0.99335253,0.00015656262,0.0004366643,0.0052779973,0.00071139465,0.00006484643],"candidate_categories":["metaresearch","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.001871289,0.00028702602,0.00052610197,0.00060019223,0.00012808612,0.0003481083,0.039438277,0.00014371867,0.00004706548],"category_scores_gemma":[0.011045693,0.0002043457,0.00020380587,0.0031012876,0.000470447,0.00080004235,0.03914067,0.00048424228,0.000024227369],"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.000047502035,0.00038797816,0.00031779142,0.00044409395,0.0010727821,0.0000013330522,0.0007811316,0.00006879924,0.06555926,0.82551104,0.0026544943,0.103153825],"study_design_scores_gemma":[0.000010809864,0.00005949244,0.000230226,0.00033955,0.00027599718,0.000001192373,0.00015407926,0.70973694,0.11136665,0.1775643,0.000078455254,0.00018228193],"about_ca_topic_score_codex":0.000050488627,"about_ca_topic_score_gemma":0.000014488291,"teacher_disagreement_score":0.8855561,"about_ca_system_score_codex":0.00010225745,"about_ca_system_score_gemma":0.0001747679,"threshold_uncertainty_score":0.9972847},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25044912,0.00048334245,0.54756635,0.0036763833,0.0016451745,0.0019012571,0.00009403642,0.00032229073,0.19386205],"genre_scores_gemma":[0.9910455,0.000031445798,0.008082734,0.00008853966,0.00010881943,0.00006045968,0.0000029521154,0.00003081208,0.00054874795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793434,0.0000067199717,0.00079484703,0.00074504677,0.00016846448,0.0003505571],"domain_scores_gemma":[0.99906445,0.000040306506,0.0002509682,0.00029684044,0.00027430354,0.0000731344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010488278,0.00021817477,0.0003254351,0.0003102213,0.0001655481,0.00045039298,0.00084165443,0.000117679774,0.00019573861],"category_scores_gemma":[0.00043914144,0.00019855413,0.00013908856,0.0012946792,0.00018476594,0.0004958132,0.0001608464,0.00023480027,0.00022324391],"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.000023857036,0.00017854903,0.00043920174,0.00011868719,0.000015616148,6.509593e-8,0.0013965454,0.021041868,0.0006235901,0.97059464,0.00010313812,0.0054642395],"study_design_scores_gemma":[0.000019221783,0.00009193815,0.00030967005,0.000128175,0.000010289721,0.000002817004,0.0003270601,0.74123883,0.013624557,0.24323413,0.0007172027,0.00029612437],"about_ca_topic_score_codex":0.00010073308,"about_ca_topic_score_gemma":0.0000037497828,"teacher_disagreement_score":0.74059635,"about_ca_system_score_codex":0.0001448818,"about_ca_system_score_gemma":0.00005870337,"threshold_uncertainty_score":0.8096803},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9814564,0.000013954515,0.00085723086,0.00029750983,0.00043001023,0.0005153064,0.000015827236,0.00015491572,0.016258853],"genre_scores_gemma":[0.9996308,0.000014814911,0.00012009248,0.000018411658,0.000092024915,0.000028967592,0.0000033203223,0.000025648002,0.00006593255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983682,0.000009741753,0.00067914365,0.0002826323,0.00046349698,0.00019677654],"domain_scores_gemma":[0.9992711,0.00006646835,0.0000901641,0.00016620653,0.00034233197,0.00006371614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038015886,0.00021321586,0.00025280882,0.00011607415,0.00009065994,0.00013570082,0.00036589027,0.00007475697,0.00036002987],"category_scores_gemma":[0.000040087893,0.00017429485,0.00010765405,0.00037303788,0.00008480685,0.00015066129,0.00010933469,0.0003886802,0.00004693868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033350135,0.0020434875,0.0010022422,0.0020442647,0.000564831,0.0002632574,0.025199948,0.12573391,0.25580278,0.42465872,0.0006570947,0.16169597],"study_design_scores_gemma":[0.00005407796,0.00020248498,0.00023649487,0.00050538196,0.000054015778,0.000060154067,0.007032649,0.89636916,0.08692537,0.008245859,0.000057614878,0.00025673857],"about_ca_topic_score_codex":0.00012848956,"about_ca_topic_score_gemma":0.000013846615,"teacher_disagreement_score":0.77063525,"about_ca_system_score_codex":0.000059345784,"about_ca_system_score_gemma":0.000039029233,"threshold_uncertainty_score":0.7107538},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24744613,0.00039199885,0.7193622,0.012436351,0.008969807,0.0031511926,0.000063724925,0.0045543667,0.003624248],"genre_scores_gemma":[0.9833746,0.000039174745,0.015216147,0.00019412332,0.00023855406,0.00012384921,0.0000012524338,0.000046490582,0.00076580443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99650395,0.000031489046,0.0010135141,0.0010674774,0.0006695849,0.0007139664],"domain_scores_gemma":[0.9973289,0.0007642746,0.00035859464,0.0005250911,0.0008664764,0.00015668824],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008759599,0.00045258127,0.00044191183,0.00037039848,0.00040668793,0.0016842395,0.0028340432,0.00020797751,0.000038519465],"category_scores_gemma":[0.0008894397,0.00027048276,0.00032389554,0.0011573741,0.00038304608,0.0015872299,0.00044779282,0.00049921125,0.00014027534],"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.00006529408,0.000121271645,0.00011024848,0.00016230393,0.000060983966,0.0000035145472,0.0051327148,0.0010310292,0.05191536,0.8976905,0.000981738,0.042725064],"study_design_scores_gemma":[0.00000896914,0.00013852924,0.000017990744,0.0006982794,0.000020653182,0.0000041713574,0.00046539863,0.44329995,0.43944108,0.11441878,0.0012160828,0.00027010526],"about_ca_topic_score_codex":0.000058827394,"about_ca_topic_score_gemma":0.000013340495,"teacher_disagreement_score":0.7832717,"about_ca_system_score_codex":0.00012571298,"about_ca_system_score_gemma":0.0002279564,"threshold_uncertainty_score":0.9999747},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32317048,0.011112587,0.6495464,0.0037657334,0.0015176098,0.0012703337,0.0000077601,0.0022756918,0.0073334533],"genre_scores_gemma":[0.94791055,0.000029923547,0.051812716,0.000044135533,0.000044306693,0.00004948492,3.9565654e-7,0.000014710181,0.00009377954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982734,0.000019195544,0.0004217348,0.00056813343,0.0004249331,0.00029265674],"domain_scores_gemma":[0.9990277,0.0001460143,0.00015291064,0.00021974902,0.00038960317,0.00006400599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005436131,0.00024291709,0.00020892358,0.00022817653,0.00018733193,0.00051945273,0.001609114,0.000087461216,0.000029040153],"category_scores_gemma":[0.00014673038,0.00015046654,0.000093767194,0.0011831797,0.00027320726,0.0007733149,0.00016469612,0.00037981928,0.00002045866],"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.000032204975,0.000062021,0.000010257979,0.00012417338,0.000012203077,0.0000018685179,0.029907897,0.0000024234428,0.06784715,0.5758175,0.000013356747,0.32616892],"study_design_scores_gemma":[0.000011023998,0.0001483597,0.000001787817,0.0007028797,0.000009224614,0.000011450187,0.0018206352,0.09408177,0.8185892,0.0844005,0.000035801753,0.00018734245],"about_ca_topic_score_codex":0.000032962667,"about_ca_topic_score_gemma":0.00004321851,"teacher_disagreement_score":0.7507421,"about_ca_system_score_codex":0.000034857545,"about_ca_system_score_gemma":0.00014254067,"threshold_uncertainty_score":0.61358476},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84586865,0.00007838775,0.1038831,0.0060781045,0.0062060487,0.0022048126,0.00015421024,0.00049634476,0.03503032],"genre_scores_gemma":[0.99368626,0.0000025177778,0.0014805974,0.00021210658,0.00030882988,0.00022656983,0.000007891492,0.00003937043,0.0040358584],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978431,0.000034576227,0.0007654161,0.0007013079,0.0002952588,0.00036034748],"domain_scores_gemma":[0.998555,0.000355644,0.00021040883,0.00024236084,0.00046438127,0.00017218819],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0004899729,0.00027737487,0.0002967508,0.00028291857,0.00021512783,0.00033083477,0.00064209854,0.00012956478,0.001661114],"category_scores_gemma":[0.00049556186,0.00023195354,0.0001849713,0.00043053008,0.000109382825,0.00019403876,0.00015170177,0.0003048264,0.0015749267],"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.00021234278,0.0007332452,0.00064417615,0.000051963634,0.0001765751,9.101966e-7,0.104098886,0.00015722243,0.14372848,0.2868221,0.003458556,0.45991552],"study_design_scores_gemma":[0.0005536505,0.0028504548,0.0475728,0.0040724836,0.00050574186,0.000018038409,0.07241979,0.1864704,0.42266735,0.036026087,0.22385982,0.0029833599],"about_ca_topic_score_codex":0.00011627627,"about_ca_topic_score_gemma":0.00021395127,"teacher_disagreement_score":0.45693216,"about_ca_system_score_codex":0.00024821862,"about_ca_system_score_gemma":0.00007253972,"threshold_uncertainty_score":0.9992515},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9130658,0.000041367846,0.07458623,0.0082937395,0.00047809072,0.0019909625,0.000013408906,0.00029783917,0.0012325817],"genre_scores_gemma":[0.99276304,0.000015964746,0.005547743,0.0009784745,0.00012761974,0.0002680407,6.191658e-7,0.0000336296,0.00026487952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99735725,0.00010149575,0.00084872363,0.00070224574,0.00054750097,0.0004427765],"domain_scores_gemma":[0.99680275,0.0019398706,0.00026596946,0.0003426168,0.00052239,0.00012640787],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.001622639,0.0003567465,0.00053699914,0.00016294331,0.00028547386,0.00022943543,0.00094158406,0.00015947776,0.00029504794],"category_scores_gemma":[0.008986647,0.00023489942,0.00022047429,0.00087690324,0.00014866545,0.000115408904,0.00030156504,0.00043606377,0.00015933005],"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.00019550645,0.00037177542,0.000769068,0.00015255608,0.00010267649,0.0000017526287,0.0055615245,0.00023477159,0.028267866,0.95539504,0.00070992287,0.008237527],"study_design_scores_gemma":[0.000037434787,0.000833917,0.0002339728,0.00066867465,0.00011857894,6.516595e-7,0.002495371,0.036516905,0.17820044,0.78023,0.00031945514,0.0003446442],"about_ca_topic_score_codex":0.00014001635,"about_ca_topic_score_gemma":0.00007671058,"teacher_disagreement_score":0.1751651,"about_ca_system_score_codex":0.00012511584,"about_ca_system_score_gemma":0.000084477586,"threshold_uncertainty_score":0.9993611},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011225205,0.000056281955,0.9813711,0.0033541534,0.0002213808,0.0014252507,0.00013801597,0.00050270336,0.0017058953],"genre_scores_gemma":[0.9929975,0.00003592398,0.006182939,0.00038008185,0.00006950027,0.0002475728,0.000022412212,0.000014676918,0.00004934466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99821484,0.000008835643,0.00043063815,0.00060023234,0.00049215823,0.00025332268],"domain_scores_gemma":[0.9987889,0.00004433476,0.00012170565,0.0003499997,0.0005864188,0.00010861975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003308121,0.00020362929,0.00016698931,0.00024609055,0.00018454049,0.000738473,0.0015896222,0.000059904494,0.000026539718],"category_scores_gemma":[0.000036266156,0.00014250753,0.000051649968,0.0014003617,0.0001133573,0.00036076683,0.00033288193,0.00019779878,0.000038423696],"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.000016797336,0.00013980677,0.000023167975,0.00006863234,0.00001361434,7.159673e-7,0.00071409467,0.00004022098,0.008452554,0.9766081,0.0026231199,0.011299167],"study_design_scores_gemma":[0.000043173037,0.00090076705,0.0005445279,0.0010205349,0.000045027406,0.000028655439,0.00031604443,0.36550146,0.46859568,0.15064186,0.011608689,0.00075357076],"about_ca_topic_score_codex":0.000075716714,"about_ca_topic_score_gemma":0.000039425802,"teacher_disagreement_score":0.98177236,"about_ca_system_score_codex":0.00005317042,"about_ca_system_score_gemma":0.00016936188,"threshold_uncertainty_score":0.71211123},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6736377,0.00031909562,0.2868593,0.012251848,0.006834319,0.0040666847,0.00003024725,0.001024503,0.014976322],"genre_scores_gemma":[0.9928177,0.000011734052,0.0068176365,0.00006954847,0.00014588892,0.000046402627,4.8246557e-7,0.000016793678,0.00007380078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968417,0.00004265185,0.0009897085,0.0007960658,0.00095508713,0.00037475923],"domain_scores_gemma":[0.9977249,0.00020125916,0.0004957141,0.0007068176,0.0007870129,0.00008432965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010865481,0.00030795828,0.00036863322,0.00014035958,0.00019925152,0.0005656182,0.0039020833,0.00012721562,0.000023587381],"category_scores_gemma":[0.000091270806,0.00019321372,0.00027253773,0.0011629772,0.00038971062,0.00043230227,0.0010760257,0.00045616517,0.000102358536],"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.000015608934,0.00020242852,0.00025448608,0.00042634268,0.00003614084,7.565435e-7,0.0029932929,0.000303345,0.014463588,0.88148415,0.00015591242,0.09966396],"study_design_scores_gemma":[0.000050147515,0.00032622405,0.007219065,0.0019738828,0.000050567156,0.00003116174,0.000889777,0.5423726,0.32516402,0.12112636,0.00031147804,0.00048471216],"about_ca_topic_score_codex":0.00006606516,"about_ca_topic_score_gemma":0.000008832913,"teacher_disagreement_score":0.7603578,"about_ca_system_score_codex":0.0001736137,"about_ca_system_score_gemma":0.0002152515,"threshold_uncertainty_score":0.7879027},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3889027,0.00009076978,0.590089,0.015060897,0.0021755532,0.0015633599,0.0001255304,0.00031112926,0.0016810714],"genre_scores_gemma":[0.995591,0.0000010938231,0.0037979328,0.000063713494,0.00014749734,0.00003526858,0.0000034004302,0.000017806562,0.00034231637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99715346,0.00003754009,0.0008815678,0.00058773305,0.00085478474,0.00048492115],"domain_scores_gemma":[0.99701536,0.0006100937,0.000408062,0.0003545022,0.0014972697,0.00011472207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023837793,0.00027628735,0.00036418895,0.00011259676,0.00041657162,0.00078221544,0.002882704,0.00008836523,0.0000027286433],"category_scores_gemma":[0.0013300641,0.00017225594,0.00021671207,0.0009927739,0.0002306529,0.000094531024,0.00043083084,0.00035166033,0.000011848101],"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.00010210919,0.00006705025,0.00006368765,0.00030310208,0.00006980062,7.976028e-7,0.015479537,0.010568992,0.006980537,0.8744835,0.0010987539,0.0907821],"study_design_scores_gemma":[0.00004670025,0.00030382205,0.0001138049,0.0013296166,0.000022745315,0.000012710188,0.0017530543,0.78384537,0.105576,0.10482072,0.0018664817,0.00030897098],"about_ca_topic_score_codex":0.000038293667,"about_ca_topic_score_gemma":0.000015576405,"teacher_disagreement_score":0.7732764,"about_ca_system_score_codex":0.0000448945,"about_ca_system_score_gemma":0.00023285883,"threshold_uncertainty_score":0.75429213},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44756073,0.00016988146,0.5463533,0.0030396385,0.0006976584,0.00093501934,0.000025221172,0.00019288405,0.0010256991],"genre_scores_gemma":[0.9967614,0.000009341206,0.002964717,0.000068606074,0.0001240012,0.000044125027,0.0000048662514,0.000013174486,0.000009779474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788207,0.000025354811,0.000793352,0.0007167988,0.00021260421,0.0003698329],"domain_scores_gemma":[0.9983956,0.000496897,0.0003115479,0.00030998213,0.00038601755,0.0000999104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016593892,0.0002570379,0.00032843114,0.00012319627,0.00029022928,0.0007429732,0.0014742007,0.00009989332,0.0000023557932],"category_scores_gemma":[0.00022292043,0.00019334946,0.0001079384,0.0007891957,0.00020842816,0.00037750014,0.0005170915,0.00038124569,0.0000038692197],"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.000016138787,0.00009894568,0.0013582618,0.00027776035,0.000020995898,4.788722e-7,0.008902863,0.002518957,0.004549279,0.8134315,0.000052207517,0.16877261],"study_design_scores_gemma":[0.000034979155,0.000092031005,0.0023726292,0.0010382342,0.0000072644953,0.000007810311,0.0020294755,0.83552575,0.0061765327,0.15238099,0.00007357608,0.0002607519],"about_ca_topic_score_codex":0.0000861394,"about_ca_topic_score_gemma":0.00005656184,"teacher_disagreement_score":0.83300674,"about_ca_system_score_codex":0.00007375859,"about_ca_system_score_gemma":0.00017231719,"threshold_uncertainty_score":0.7884562},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.889788,0.00028485927,0.047490887,0.041556038,0.0026350461,0.002479874,0.000015270705,0.0006414959,0.015108539],"genre_scores_gemma":[0.9939158,0.000046468318,0.004769322,0.00072098157,0.00025828893,0.000053488704,4.793127e-7,0.000023305105,0.00021187644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99669427,0.00003475147,0.000737319,0.0010834952,0.0009081501,0.00054200477],"domain_scores_gemma":[0.998019,0.00055409776,0.00024438402,0.0005713911,0.00047171774,0.00013940907],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011081124,0.0004290594,0.00036715786,0.00015529619,0.00029787066,0.001414737,0.0027256713,0.00013477978,0.00011697611],"category_scores_gemma":[0.000112520895,0.00025695964,0.00019953336,0.0007301062,0.00056472543,0.00045860288,0.0013350949,0.00069090875,0.00031801173],"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.000028977745,0.00027126883,0.00017779999,0.000106510175,0.00005097258,0.000004041843,0.004359644,0.00007567617,0.0035151395,0.8894089,0.0018164415,0.10018461],"study_design_scores_gemma":[0.00007536284,0.0008996647,0.0047276067,0.0011859755,0.00004665678,0.00004276308,0.00078403373,0.47463378,0.09031141,0.4243259,0.0020811248,0.0008856859],"about_ca_topic_score_codex":0.000023275754,"about_ca_topic_score_gemma":0.000011770159,"teacher_disagreement_score":0.47455812,"about_ca_system_score_codex":0.00009894989,"about_ca_system_score_gemma":0.00012667682,"threshold_uncertainty_score":0.99998826},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96827036,0.00025166982,0.017142814,0.010191934,0.0009508834,0.00074750016,0.000015440843,0.00015785423,0.0022715349],"genre_scores_gemma":[0.99923354,0.00005794485,0.00037911427,0.00009435373,0.00010161247,0.000038673228,2.5205176e-7,0.000010296559,0.00008423601],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849755,0.0000061896767,0.00045853737,0.00036581676,0.00040663232,0.00026527853],"domain_scores_gemma":[0.99893093,0.0002660328,0.00015102424,0.00026841738,0.00032393192,0.0000596467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003466388,0.00017769972,0.00019332938,0.000089937894,0.00012825037,0.00031944516,0.0019325839,0.000053155272,0.00003773791],"category_scores_gemma":[0.00009359191,0.00010840432,0.00013364157,0.0010138145,0.00019495747,0.0002957401,0.00033713912,0.0003348387,0.00003403214],"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.0000121819085,0.00008258878,0.00011180952,0.00006060051,0.000026271351,0.0000012055508,0.0009870025,0.0014332348,0.04276916,0.9089314,0.00020051906,0.04538402],"study_design_scores_gemma":[0.000022653147,0.000118975855,0.0024318532,0.00039305422,0.000027040991,0.000012472901,0.00047563206,0.57246435,0.39495078,0.028525455,0.00033062932,0.00024712365],"about_ca_topic_score_codex":0.000024663146,"about_ca_topic_score_gemma":0.0000037103532,"teacher_disagreement_score":0.88040596,"about_ca_system_score_codex":0.000026706293,"about_ca_system_score_gemma":0.000055626817,"threshold_uncertainty_score":0.44206},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014380488,0.000017603508,0.98875034,0.0015580708,0.00036898037,0.00040460838,0.0000045036263,0.00008226251,0.007375584],"genre_scores_gemma":[0.72416705,0.00001367095,0.27543217,0.00017284794,0.000015703437,0.00001676412,8.205675e-7,0.000008888513,0.00017210256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827504,0.000021846141,0.0005845747,0.0004703485,0.0004067338,0.00024142746],"domain_scores_gemma":[0.997552,0.000113461545,0.00051449495,0.00035272728,0.001417322,0.00005004456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025147892,0.0002167127,0.00028454282,0.00028898643,0.00016298704,0.00012074646,0.0017172295,0.000098975506,0.00004544278],"category_scores_gemma":[0.000652007,0.00017191876,0.000110059664,0.0014029868,0.00032399158,0.0003944061,0.00027380185,0.00021187092,0.000004302014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004307538,0.000099657984,0.00009799941,0.000036346883,0.000012007014,1.14919345e-7,0.00020169832,0.45590496,0.004519061,0.50846916,0.000031131884,0.0305848],"study_design_scores_gemma":[0.0000428699,0.000058564565,0.00011074437,0.0001251571,0.000008202372,4.0504793e-7,0.000109780274,0.6306039,0.33297244,0.035855882,0.000009023931,0.00010304938],"about_ca_topic_score_codex":0.000021958876,"about_ca_topic_score_gemma":0.0000071049258,"teacher_disagreement_score":0.722729,"about_ca_system_score_codex":0.00006983005,"about_ca_system_score_gemma":0.00022114087,"threshold_uncertainty_score":0.70106435},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.403204,0.00012841276,0.4515387,0.0014231894,0.00029369796,0.0015254752,0.000037407317,0.00041455805,0.14143452],"genre_scores_gemma":[0.9985333,0.00008625819,0.0009937594,0.000056168108,0.000017397155,0.00004747169,0.0000014331152,0.000015674872,0.00024851784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99903286,0.0000042317365,0.00029044453,0.00026069925,0.00019795448,0.00021383399],"domain_scores_gemma":[0.9995506,0.000026189427,0.00004143465,0.00016681394,0.00016637915,0.00004861555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012947618,0.00019639627,0.00020705827,0.00009191283,0.00010199213,0.000115083996,0.00042099349,0.00006886261,0.000028257744],"category_scores_gemma":[0.00004656937,0.00013801026,0.000033467644,0.00026172888,0.0001470316,0.00009878039,0.00006028885,0.00018585923,0.000002094627],"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.00049133576,0.00025046317,0.0003909904,0.0018054941,0.00014295516,6.319264e-7,0.0028946716,0.07117911,0.010241265,0.8370167,0.0004784994,0.07510786],"study_design_scores_gemma":[0.00015219042,0.00018055407,0.00066521973,0.0007378571,0.00010293348,0.000004478942,0.0014742453,0.34343007,0.6116051,0.04106126,0.00015607907,0.0004300159],"about_ca_topic_score_codex":0.0000175605,"about_ca_topic_score_gemma":0.000009726477,"teacher_disagreement_score":0.7959555,"about_ca_system_score_codex":0.000025120162,"about_ca_system_score_gemma":0.000025928448,"threshold_uncertainty_score":0.5627895},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024996603,0.000033913195,0.9339277,0.0044951737,0.0009154174,0.0008407385,0.000016546865,0.0004008511,0.034373026],"genre_scores_gemma":[0.9754978,0.000106923515,0.023259353,0.0006961846,0.000016307536,0.000047188492,0.0000023752602,0.0000059864515,0.00036789756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982782,0.000025391691,0.0006468049,0.00036330678,0.0003852903,0.00030100215],"domain_scores_gemma":[0.9985372,0.00008594283,0.00040752772,0.00036686278,0.00054754544,0.000054913336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046972782,0.00022772943,0.00025247136,0.00024402552,0.00032354458,0.00038130072,0.0019124219,0.00013931943,0.00002451601],"category_scores_gemma":[0.00019474073,0.00017147862,0.00013487918,0.00077583845,0.00012215313,0.0019027839,0.0005651845,0.00029524055,0.00002259398],"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.000100073965,0.000101655714,0.00003506841,0.00005546067,0.00001501063,1.4234321e-7,0.00043371186,0.00005522282,0.05751295,0.75578064,0.0054886173,0.18042143],"study_design_scores_gemma":[0.000030296187,0.00011768937,0.000020701604,0.0003717906,0.00000478799,0.0000012138414,0.00006722427,0.035978664,0.56423694,0.39777613,0.0012585081,0.00013604776],"about_ca_topic_score_codex":0.00004907501,"about_ca_topic_score_gemma":0.0000017026305,"teacher_disagreement_score":0.9505012,"about_ca_system_score_codex":0.000056739304,"about_ca_system_score_gemma":0.00006495232,"threshold_uncertainty_score":0.69926953},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06843151,0.000051630668,0.9196787,0.0067970688,0.0005964026,0.00086480426,0.000013503555,0.00017077729,0.0033956293],"genre_scores_gemma":[0.94773084,0.00001552021,0.05070508,0.00088832603,0.00004221789,0.00013122243,9.252883e-7,0.0000062548374,0.00047959707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840385,0.000016572574,0.0005048782,0.00052696065,0.00022077163,0.00032697147],"domain_scores_gemma":[0.9982832,0.000167932,0.00028887222,0.00028810964,0.0009334322,0.00003845725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034950505,0.00023259559,0.00037778137,0.0001620344,0.00052732765,0.00018977631,0.0014467038,0.00014559823,0.000006245539],"category_scores_gemma":[0.00014045584,0.00017927414,0.00015620903,0.0005539685,0.00035106167,0.00024445142,0.00037546566,0.00023677776,0.00001010531],"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.00009575734,0.00020645876,0.00002882978,0.000049696624,0.00005840129,1.7163391e-7,0.0017437366,0.00091441016,0.032521095,0.92882913,0.0013685245,0.034183808],"study_design_scores_gemma":[0.00008380755,0.00010458258,0.00004325453,0.0001239304,0.000018825083,9.242261e-7,0.00014338813,0.68619233,0.12395451,0.1891362,0.00006994167,0.00012826224],"about_ca_topic_score_codex":0.0000151961,"about_ca_topic_score_gemma":0.00003234471,"teacher_disagreement_score":0.87929934,"about_ca_system_score_codex":0.000059758004,"about_ca_system_score_gemma":0.000119365344,"threshold_uncertainty_score":0.7310587},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17156608,0.000036081903,0.7689831,0.016028937,0.0010110802,0.00092763064,0.0000033214765,0.0003704531,0.041073292],"genre_scores_gemma":[0.9786669,0.000030632113,0.01998192,0.00039431223,0.00005173091,0.000045744677,4.1157506e-7,0.000008112122,0.0008202345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810654,0.00003456981,0.00051665475,0.0006338725,0.00040589037,0.00030246942],"domain_scores_gemma":[0.99843776,0.00008231228,0.00026759077,0.0003650022,0.0007863492,0.00006099501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038618725,0.00020515235,0.00024919762,0.00015620649,0.0002655822,0.0003002201,0.0017116545,0.00009518607,0.000013338895],"category_scores_gemma":[0.0002844273,0.00016471416,0.000108592096,0.00073624146,0.000104531675,0.0004901792,0.0004923049,0.00036774084,0.00001308226],"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.00001642065,0.00006327277,0.000117248404,0.000025244242,0.000020187748,2.1024714e-7,0.0031051922,0.0029887345,0.03447104,0.89888173,0.000049181257,0.06026156],"study_design_scores_gemma":[0.000017657976,0.00003947068,0.000010900976,0.000050346793,0.0000068755326,3.8777415e-7,0.00037073655,0.49520642,0.2532221,0.2509803,0.000011625496,0.000083158804],"about_ca_topic_score_codex":0.00013705135,"about_ca_topic_score_gemma":0.00001565875,"teacher_disagreement_score":0.80710083,"about_ca_system_score_codex":0.000083324085,"about_ca_system_score_gemma":0.00019983412,"threshold_uncertainty_score":0.67168486},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9049282,0.00004782079,0.07567658,0.00063206675,0.0014074406,0.0018225684,0.000017710932,0.00020837293,0.0152592575],"genre_scores_gemma":[0.9992571,0.0000057105103,0.0003458786,0.000018620669,0.000024524776,0.00011531487,7.1645695e-7,0.000007668404,0.00022448362],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991033,0.000005354616,0.00044111928,0.00014201336,0.00017551279,0.00013267843],"domain_scores_gemma":[0.9993672,0.000048366997,0.00014480627,0.00008709741,0.0003324759,0.000020094792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023452628,0.0001105997,0.0001741053,0.00012225214,0.0000639106,0.000038667065,0.00024320876,0.0000603281,0.000019580875],"category_scores_gemma":[0.0001398144,0.000089141984,0.00008158967,0.00032205335,0.000057961293,0.000060064664,0.000020421463,0.00007654312,0.000010845819],"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.00009690078,0.000071900504,0.000050019215,0.00048165314,0.000039843468,1.4206081e-8,0.0007259437,0.013893732,0.7323366,0.18591745,0.00024904896,0.06613692],"study_design_scores_gemma":[0.000030944262,0.000041389296,0.00006574095,0.00016765296,0.000011735585,1.7235676e-7,0.0004440777,0.43749684,0.5568366,0.0048012063,0.00005422236,0.000049391452],"about_ca_topic_score_codex":0.000010262726,"about_ca_topic_score_gemma":0.0000046045025,"teacher_disagreement_score":0.42360312,"about_ca_system_score_codex":0.000050102928,"about_ca_system_score_gemma":0.000022708895,"threshold_uncertainty_score":0.36351046},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.086500615,0.000060061662,0.86626816,0.01037474,0.0016822118,0.0018394643,0.000019377478,0.0009545306,0.032300834],"genre_scores_gemma":[0.9735661,0.000016854747,0.025720015,0.00029550513,0.000028979353,0.000043353535,5.84924e-7,0.000007815583,0.00032079796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979905,0.000021457266,0.00063019805,0.0005836334,0.00042791344,0.00034628977],"domain_scores_gemma":[0.9981723,0.00013447204,0.00036871727,0.0005599971,0.0006995866,0.0000649548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032444752,0.00023953996,0.000282324,0.0001813371,0.00026090737,0.00027140824,0.0034780933,0.000083013314,0.00004535955],"category_scores_gemma":[0.0009741757,0.00017202731,0.000102636746,0.00087716576,0.00029664894,0.0005801372,0.001128162,0.0003135822,0.000022095264],"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.000019056397,0.000030159577,0.000069329,0.00003942513,0.0000070333044,2.509364e-7,0.00014459324,0.000040553707,0.06309585,0.90379065,0.0006798517,0.032083236],"study_design_scores_gemma":[0.000014230651,0.00003798078,0.00007955032,0.00024805323,0.0000051005927,0.0000018545636,0.000044568966,0.06115948,0.46810913,0.47003508,0.00015189336,0.00011307798],"about_ca_topic_score_codex":0.000017548748,"about_ca_topic_score_gemma":0.0000022457239,"teacher_disagreement_score":0.8870655,"about_ca_system_score_codex":0.000082643244,"about_ca_system_score_gemma":0.00011974898,"threshold_uncertainty_score":0.70150703},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8434862,0.00026626603,0.048667643,0.08533263,0.00070894964,0.0011449214,0.000023368395,0.0011459304,0.019224102],"genre_scores_gemma":[0.9857164,0.000109554225,0.01283663,0.00049846224,0.000018747305,0.000034314064,0.0000023291188,0.000018627547,0.0007649271],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9968494,0.000033661556,0.0008587063,0.0010748352,0.0005188539,0.00066449645],"domain_scores_gemma":[0.9969943,0.00025518198,0.00041029157,0.0017336399,0.0005375658,0.000069029964],"candidate_categories":["metaresearch","metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0009996953,0.00034855475,0.00043120098,0.00032363535,0.00039798985,0.0008041713,0.021242123,0.00022511375,0.00005174261],"category_scores_gemma":[0.019564854,0.00030897424,0.00009513658,0.002074111,0.00024891325,0.00093121896,0.028146366,0.0010376138,0.000053060718],"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.000119067394,0.00050914305,0.022530546,0.00033632826,0.00008311358,0.0000041988474,0.0032273782,0.00007061293,0.33110365,0.35660097,0.022646409,0.2627686],"study_design_scores_gemma":[0.000054303335,0.00007106934,0.0002682738,0.0008167426,0.0000066431967,0.00000195369,0.00041744593,0.26998857,0.51660156,0.21113628,0.0003817363,0.00025539982],"about_ca_topic_score_codex":0.0001938278,"about_ca_topic_score_gemma":0.000012205484,"teacher_disagreement_score":0.26991794,"about_ca_system_score_codex":0.0001800685,"about_ca_system_score_gemma":0.0002278108,"threshold_uncertainty_score":0.9999362},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84487826,0.000016607824,0.109441616,0.0014821165,0.00045162253,0.00037741257,0.000008374732,0.000029523002,0.043314457],"genre_scores_gemma":[0.99839383,0.000009356816,0.0004706495,0.00007414659,0.0000664569,0.000014872469,9.953243e-7,0.000007994992,0.00096169405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989115,0.000008732282,0.0004140112,0.0002638703,0.0002099228,0.00019195834],"domain_scores_gemma":[0.99923563,0.000033108936,0.00026019168,0.00014636604,0.00028329954,0.000041408824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014267997,0.00016072649,0.000223257,0.00007806977,0.00013945288,0.00004184963,0.0004877559,0.000054219297,0.00013704895],"category_scores_gemma":[0.000020415988,0.000116819974,0.00013847431,0.00030378968,0.0001402362,0.0001134811,0.00015501685,0.00027051877,0.000008432994],"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.000076927994,0.00016434556,0.00067445135,0.000031084357,0.000019072306,1.9981416e-8,0.0003588107,0.0018308411,0.1340857,0.74154073,0.00020370267,0.121014304],"study_design_scores_gemma":[0.000016996959,0.000021134409,0.000040511513,0.00016797433,0.0000130361195,9.699972e-8,0.00019170137,0.32071358,0.38590553,0.29282948,0.000023196033,0.00007676638],"about_ca_topic_score_codex":0.00006217182,"about_ca_topic_score_gemma":0.000001507433,"teacher_disagreement_score":0.44871128,"about_ca_system_score_codex":0.000011849275,"about_ca_system_score_gemma":0.000051322608,"threshold_uncertainty_score":0.47637802},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21839008,0.000060672723,0.77626365,0.0021447036,0.0012325582,0.00070680096,0.00000279487,0.0001549523,0.0010437905],"genre_scores_gemma":[0.9900796,0.000012615176,0.008901605,0.0007852656,0.00008162425,0.000047208065,8.5544497e-7,0.0000219284,0.00006933286],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99714756,0.000090570415,0.0008586425,0.0007512799,0.0006060673,0.0005458991],"domain_scores_gemma":[0.9973677,0.000431077,0.00063674507,0.00059742265,0.00086205796,0.00010503685],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010182445,0.00039946483,0.00045088623,0.00044299514,0.00054708566,0.00025586472,0.003165049,0.00018296554,0.00001989242],"category_scores_gemma":[0.0011895223,0.0002817846,0.00029139713,0.0029377504,0.00044515525,0.0003821044,0.00063662673,0.00083599315,0.000010947171],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023289007,0.0001811294,0.008022729,0.00010199014,0.0000692338,9.966122e-7,0.0021180047,0.7935194,0.015868718,0.10412774,0.00014829956,0.07560887],"study_design_scores_gemma":[0.00006474599,0.00016977896,0.0007614639,0.00031637994,0.000023497432,8.0745866e-7,0.0005595707,0.8122978,0.17134437,0.014197726,0.000021280826,0.00024257458],"about_ca_topic_score_codex":0.00016079922,"about_ca_topic_score_gemma":0.000050782626,"teacher_disagreement_score":0.7716895,"about_ca_system_score_codex":0.00008315115,"about_ca_system_score_gemma":0.00013304867,"threshold_uncertainty_score":0.9999634},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8415485,0.00005980648,0.13190699,0.0052657444,0.00023894351,0.00058980985,6.9279855e-7,0.00022749325,0.020162044],"genre_scores_gemma":[0.99032,0.0000111788895,0.008807855,0.00017022784,0.000035410365,0.00001585389,7.00625e-7,0.000009271173,0.0006294968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99835616,0.00002007387,0.00039359636,0.00051551405,0.00040256107,0.00031206617],"domain_scores_gemma":[0.9989562,0.000050510178,0.0003601485,0.0001361652,0.00043550425,0.000061460036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004716323,0.00021002773,0.000226217,0.0001621559,0.0004462703,0.000543651,0.00078791723,0.000075287535,0.000010872215],"category_scores_gemma":[0.00025942468,0.00015352259,0.000043474338,0.0008396754,0.00025448442,0.00061260076,0.00037605868,0.00033626976,0.000006522745],"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.00018094815,0.00017903073,0.020215658,0.00022133817,0.00004925181,0.0000016407316,0.0016344149,0.00015107868,0.31991944,0.41749513,0.00007060429,0.23988146],"study_design_scores_gemma":[0.00005668754,0.00024746035,0.00078281376,0.0006609877,0.000015067489,0.0000069351563,0.00078373885,0.049603242,0.9162301,0.03135485,0.0000601161,0.00019803352],"about_ca_topic_score_codex":0.000018161152,"about_ca_topic_score_gemma":0.000009153011,"teacher_disagreement_score":0.5963106,"about_ca_system_score_codex":0.00004958894,"about_ca_system_score_gemma":0.00016081445,"threshold_uncertainty_score":0.62604696},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07826379,0.000093454306,0.7343489,0.0041951486,0.0022837906,0.0017487844,0.000003779494,0.0008198711,0.17824252],"genre_scores_gemma":[0.9984506,0.000012602015,0.0004108145,0.00020330405,0.00013316081,0.00008831805,5.604037e-7,0.000028733037,0.00067194627],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982259,0.000029670015,0.0005910057,0.00039338207,0.00031427882,0.00044574344],"domain_scores_gemma":[0.9992087,0.00009190478,0.00011852663,0.00019627849,0.0002469575,0.00013765844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003824348,0.0002840053,0.00035624174,0.00019105709,0.00020243268,0.00023449832,0.00056038646,0.00016744215,0.00004458165],"category_scores_gemma":[0.00038567622,0.00023495432,0.00014609014,0.0008896562,0.00010646592,0.00015984512,0.00009897837,0.00071544683,0.000034586217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057806924,0.00034641256,0.0005129356,0.00049930206,0.00019264955,0.0000018916543,0.002037589,0.4939373,0.04027289,0.27542377,0.0021688617,0.18402833],"study_design_scores_gemma":[0.000040790947,0.00008127606,0.000040077313,0.00019787045,0.000023874234,0.0000057496486,0.0012723097,0.9652267,0.030058308,0.0023278098,0.0005025603,0.00022266856],"about_ca_topic_score_codex":0.000046590627,"about_ca_topic_score_gemma":0.000018351067,"teacher_disagreement_score":0.92018676,"about_ca_system_score_codex":0.00007393484,"about_ca_system_score_gemma":0.000039237628,"threshold_uncertainty_score":0.95811594},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04662358,0.000019620282,0.9270438,0.013449766,0.00016148701,0.0020195935,0.00003146607,0.00015480633,0.010495914],"genre_scores_gemma":[0.98012877,0.000030272702,0.018141635,0.0005875276,0.000050111634,0.00018098776,0.00000814014,0.000012402156,0.0008601676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989856,0.000004382779,0.00039234615,0.00027998845,0.00015829189,0.00017937641],"domain_scores_gemma":[0.9985042,0.000074486525,0.000245999,0.00013882125,0.0009942811,0.00004216739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018341908,0.00013757555,0.00021116981,0.00010873961,0.0001744958,0.000045403132,0.00023898332,0.00008662955,0.000017307686],"category_scores_gemma":[0.0004891555,0.00010528814,0.00009751202,0.00041757486,0.00014419838,0.00015650972,0.00005600802,0.0001525773,0.0000043942678],"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.00026060676,0.000080763384,0.000049892355,0.000042807416,0.0000092936825,3.9795058e-8,0.0004012601,0.000082905855,0.09169737,0.85670334,0.0001536904,0.050518032],"study_design_scores_gemma":[0.00005354862,0.00030352344,0.00018065216,0.00044684354,0.00005791353,0.0000014525042,0.002280219,0.09073263,0.6977179,0.20764719,0.0004587593,0.00011938227],"about_ca_topic_score_codex":0.000013873618,"about_ca_topic_score_gemma":0.000005603447,"teacher_disagreement_score":0.9335052,"about_ca_system_score_codex":0.00004386417,"about_ca_system_score_gemma":0.00014769634,"threshold_uncertainty_score":0.42935258},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06316047,0.000094148,0.91341996,0.008091491,0.0013340446,0.0014996349,0.000023091043,0.00015704519,0.01222014],"genre_scores_gemma":[0.99464655,0.000021128952,0.0037512209,0.00041680085,0.00007248556,0.00011226055,7.1735525e-7,0.0000088054,0.00097000273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825644,0.00001631891,0.00058756664,0.00051443157,0.00033588076,0.00028934557],"domain_scores_gemma":[0.99788725,0.00013588635,0.00070323824,0.0003259282,0.0008903339,0.000057335463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040902256,0.00020833497,0.00030084111,0.00015939822,0.0002353601,0.00022732216,0.0017655941,0.000106453765,0.000013185249],"category_scores_gemma":[0.00036143078,0.00015561779,0.00015102481,0.00050916383,0.00010156846,0.00060535077,0.00029435093,0.00016411004,0.000014887642],"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.00006276117,0.00012330698,0.00012969345,0.0001303557,0.000020772428,1.7169155e-7,0.0007345022,0.0004939212,0.02360253,0.9534278,0.0013800203,0.019894164],"study_design_scores_gemma":[0.0000482013,0.000052453175,0.00017027382,0.00044801744,0.000011406642,5.7877764e-7,0.00041485572,0.40917292,0.3399674,0.24937987,0.00019095873,0.00014306391],"about_ca_topic_score_codex":0.000032349864,"about_ca_topic_score_gemma":0.000010849874,"teacher_disagreement_score":0.9314861,"about_ca_system_score_codex":0.000043367625,"about_ca_system_score_gemma":0.00008803944,"threshold_uncertainty_score":0.6345909},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13956359,0.000013283933,0.84029007,0.0038884939,0.00007917285,0.00039038772,0.000004716998,0.00010497627,0.015665296],"genre_scores_gemma":[0.98595184,0.000019268835,0.013354754,0.0002678959,0.000017699609,0.000050200262,8.9225324e-7,0.000007065472,0.00033039768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985256,0.000012534922,0.00039688146,0.0004806335,0.00033514967,0.0002491637],"domain_scores_gemma":[0.9987798,0.000047559217,0.00018160832,0.0003366657,0.0005974556,0.00005691276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023838409,0.00019569093,0.00021454226,0.00011873543,0.00029498705,0.00026858845,0.0015537936,0.00006416626,0.000010737264],"category_scores_gemma":[0.000049364917,0.00013680907,0.00007514542,0.0006871996,0.00020895322,0.00037472928,0.0003541102,0.00021325097,0.000014311598],"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.000023505721,0.00009298935,0.000007658705,0.000015772686,0.000013318608,2.2577994e-7,0.0005806648,0.003782825,0.083471864,0.8943063,0.000033005355,0.017671894],"study_design_scores_gemma":[0.00002374533,0.000036956746,0.0000072795856,0.00011261706,0.000008347002,0.0000013300632,0.00017372148,0.5941664,0.23102847,0.17433742,0.000008568525,0.00009517561],"about_ca_topic_score_codex":0.00003678707,"about_ca_topic_score_gemma":0.00001149786,"teacher_disagreement_score":0.8463882,"about_ca_system_score_codex":0.000037586677,"about_ca_system_score_gemma":0.00017480049,"threshold_uncertainty_score":0.55789125},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018196857,0.000018924404,0.96855944,0.0055781696,0.00042373268,0.001010812,0.0000046233286,0.00013592187,0.0060714874],"genre_scores_gemma":[0.9126389,0.000007619287,0.086236365,0.00061764993,0.00004256018,0.00014501748,0.000001236676,0.000010957315,0.00029970324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981159,0.00002879109,0.0005852028,0.0005396315,0.00037071217,0.00035973595],"domain_scores_gemma":[0.9979951,0.00045413495,0.0003295087,0.00032611226,0.0008220187,0.00007314819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006920859,0.00021807705,0.00026175656,0.00017410432,0.0003413747,0.00034361024,0.0016195163,0.000126289,0.00003029318],"category_scores_gemma":[0.0018934994,0.00017562062,0.00014773672,0.001014644,0.00019645442,0.00033388144,0.00023005444,0.0002951861,0.000026855045],"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.000078544814,0.00008761936,0.00005206918,0.00007954707,0.000014074719,9.212036e-8,0.002006488,0.0005177613,0.005235948,0.9234102,0.00007141284,0.068446286],"study_design_scores_gemma":[0.00004345265,0.00011563084,0.00012352529,0.00018277057,0.000009673474,4.104252e-7,0.0013321332,0.26330552,0.02393662,0.71025515,0.0005565923,0.00013854509],"about_ca_topic_score_codex":0.000016574884,"about_ca_topic_score_gemma":0.000008629345,"teacher_disagreement_score":0.894442,"about_ca_system_score_codex":0.0000658151,"about_ca_system_score_gemma":0.00021187254,"threshold_uncertainty_score":0.71616006},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.252915,0.0008644688,0.6002985,0.09592421,0.0026034329,0.0033053968,0.000013414106,0.00031356126,0.043761984],"genre_scores_gemma":[0.9973169,0.000085011845,0.0011434464,0.0011448212,0.00009012247,0.00004579151,4.799998e-7,0.000007637242,0.00016581066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998374,0.000044511195,0.0005451014,0.00034878374,0.0003647774,0.00032282594],"domain_scores_gemma":[0.99815345,0.00033424312,0.0004718569,0.00044719328,0.0005639661,0.000029285535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003664787,0.00019275708,0.00022796144,0.00003618973,0.00065173366,0.0002998273,0.0025415993,0.00006635986,0.000015089074],"category_scores_gemma":[0.00011282554,0.000105314546,0.0001207415,0.0014790975,0.0005125559,0.0003307306,0.0005303277,0.00028550316,0.0000064152764],"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.000030692576,0.00005432523,0.00023171477,0.00002451149,0.000019740373,9.558725e-8,0.0013078304,0.015963763,0.004606387,0.94423103,0.0015055604,0.032024324],"study_design_scores_gemma":[0.000039266786,0.00008877196,0.0005090582,0.00027238487,0.000039002876,0.0000036374981,0.0009932031,0.6910631,0.12604094,0.17900164,0.0017552642,0.00019370641],"about_ca_topic_score_codex":0.00008622362,"about_ca_topic_score_gemma":0.00004526246,"teacher_disagreement_score":0.7652294,"about_ca_system_score_codex":0.00002214951,"about_ca_system_score_gemma":0.000067699846,"threshold_uncertainty_score":0.50126743},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9448921,0.00004487062,0.002856186,0.015433972,0.00009821164,0.00049448607,7.719161e-7,0.000042197185,0.036137167],"genre_scores_gemma":[0.9981286,0.000011789378,0.00074396667,0.0006297846,0.00014659636,0.000093022994,0.0000012557163,0.00001097496,0.00023399908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806356,0.000023496346,0.00044925098,0.00039019997,0.0007315434,0.00034194405],"domain_scores_gemma":[0.99768215,0.000110163346,0.00014002583,0.00023693846,0.0018229211,0.000007824667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003287405,0.00016858138,0.00021501388,0.0004542712,0.00069126475,0.00082358747,0.0011805876,0.00006377861,0.00005117654],"category_scores_gemma":[0.0012202801,0.000096308795,0.000061396124,0.0033921537,0.0003006244,0.0005581618,0.000225571,0.0005045001,0.000038627404],"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.00010697475,0.00018630594,0.001466328,0.00013291503,0.000017307959,4.8515955e-7,0.0007586472,0.0064342204,0.004275415,0.9663823,0.000096887365,0.020142216],"study_design_scores_gemma":[0.00009827858,0.000060153994,0.0007586869,0.0019835485,0.0000812068,0.0000012033597,0.01845176,0.66883993,0.008229026,0.30098298,0.00023136672,0.00028184563],"about_ca_topic_score_codex":0.0010449374,"about_ca_topic_score_gemma":0.00053317664,"teacher_disagreement_score":0.6653993,"about_ca_system_score_codex":0.00003423947,"about_ca_system_score_gemma":0.00012648151,"threshold_uncertainty_score":0.7941873},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16279732,0.000025228026,0.82495266,0.0027272692,0.00019771341,0.00077230646,2.7954752e-7,0.0000902107,0.00843704],"genre_scores_gemma":[0.9893023,0.00002382644,0.0097704325,0.00016623018,0.00000886089,0.000043560613,0.0000010311032,0.000007968785,0.0006757884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998159,0.00004453958,0.0006585265,0.00039343646,0.00043273106,0.00031180133],"domain_scores_gemma":[0.9984218,0.000104318715,0.00044158832,0.00042000652,0.0005679462,0.000044359644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069793826,0.00020619822,0.00022479454,0.0002453855,0.00027436158,0.00023214884,0.0014147977,0.00007667908,0.00001284296],"category_scores_gemma":[0.00035498734,0.00015730067,0.000056481167,0.00091545517,0.0002002413,0.000096419324,0.0004603557,0.00044320023,0.00002322452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025157318,0.000052801137,0.0005653755,0.000021246426,0.000009961904,1.9620072e-7,0.0008510516,0.63081485,0.011837993,0.35229218,0.000019208146,0.0035099916],"study_design_scores_gemma":[0.000079284,0.00013660216,0.00043271214,0.00034014246,0.000008356497,0.0000012941114,0.00044022288,0.8942902,0.10309552,0.0009873925,0.000042271724,0.00014597393],"about_ca_topic_score_codex":0.00008608641,"about_ca_topic_score_gemma":0.000026806378,"teacher_disagreement_score":0.826505,"about_ca_system_score_codex":0.00015614434,"about_ca_system_score_gemma":0.00014206172,"threshold_uncertainty_score":0.6414535},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.096049726,0.000041530344,0.8924754,0.0036473067,0.000503425,0.0005083645,0.000006943157,0.00040700418,0.0063602775],"genre_scores_gemma":[0.97599715,0.0000551729,0.023099016,0.000528755,0.000032440308,0.000046931505,9.419141e-7,0.000011955556,0.00022765964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99799144,0.000023396155,0.00054517813,0.00058148225,0.00039683905,0.00046163416],"domain_scores_gemma":[0.9987109,0.00010516718,0.00030200093,0.00046771433,0.0003511361,0.00006313113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034621914,0.0002932687,0.000311995,0.00024013002,0.00029353128,0.00024119053,0.0025131262,0.00012076639,0.000009467578],"category_scores_gemma":[0.00015890843,0.0002184081,0.00016612407,0.00082023215,0.00027515754,0.0005616873,0.0006401872,0.0003681472,0.000013754357],"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.000046313882,0.00009229297,0.00014093224,0.000051195275,0.000022031474,0.0000014947841,0.0012214635,0.0004231761,0.12485619,0.83066607,0.0001505545,0.042328317],"study_design_scores_gemma":[0.000020325862,0.000048579786,0.000035606347,0.00022834509,0.000011338599,0.0000015664813,0.000074102725,0.110922486,0.50684255,0.38162068,0.00004288637,0.00015153982],"about_ca_topic_score_codex":0.00005709393,"about_ca_topic_score_gemma":0.00000521538,"teacher_disagreement_score":0.8799474,"about_ca_system_score_codex":0.000057448575,"about_ca_system_score_gemma":0.000068106616,"threshold_uncertainty_score":0.89064234},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9083395,0.000033329747,0.00080745236,0.0122287925,0.00026242607,0.00059904985,0.000008843387,0.000027666045,0.07769296],"genre_scores_gemma":[0.9989552,0.0001753387,0.00015056807,0.00020701498,0.000009237025,0.000026494728,4.1476588e-7,0.0000039189167,0.00047180656],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986674,0.000040658528,0.00042616238,0.00026725605,0.00041652066,0.00018197695],"domain_scores_gemma":[0.9987115,0.00023156448,0.00018421828,0.00021091272,0.0006238058,0.000037976686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005072136,0.00009762528,0.00013842525,0.00019117101,0.00020234716,0.000053270214,0.0010167628,0.0000445823,0.0003022587],"category_scores_gemma":[0.0013116569,0.00007486098,0.000079926125,0.0012535785,0.00054060214,0.0001963782,0.000112585745,0.00018056712,0.00003281269],"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.000056865745,0.00014016984,0.0002726164,0.000031850122,0.0000021966107,1.2662455e-8,0.0009660957,0.000010134064,0.5829723,0.3440086,0.00008015029,0.071459],"study_design_scores_gemma":[0.000020263413,0.00004777015,0.0006042716,0.00016535321,0.0000067063047,1.9640305e-7,0.0013972487,0.0053216503,0.9111008,0.081135914,0.00013964248,0.000060169194],"about_ca_topic_score_codex":0.000042947435,"about_ca_topic_score_gemma":0.000009658122,"teacher_disagreement_score":0.32812852,"about_ca_system_score_codex":0.000023262988,"about_ca_system_score_gemma":0.00015001853,"threshold_uncertainty_score":0.33095208},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03085725,0.000018965053,0.94870716,0.01532684,0.0004401445,0.0005914492,0.000016643799,0.00015712295,0.003884428],"genre_scores_gemma":[0.9459001,0.0000067149267,0.052951436,0.0007466443,0.000030139194,0.00002834943,0.0000040307373,0.000008457938,0.00032412956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811256,0.000060953025,0.0004549671,0.000660972,0.00037512768,0.00033539147],"domain_scores_gemma":[0.9983588,0.00021367152,0.0003097106,0.0004845817,0.0005486166,0.00008460411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010948252,0.00021267134,0.00026134233,0.00018287513,0.0006767713,0.00031588125,0.0024598178,0.000108074884,0.000022131167],"category_scores_gemma":[0.00045946756,0.00017292456,0.00011147598,0.00057990826,0.000111953,0.00059700705,0.000700523,0.00027150684,0.000017707214],"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.00014740716,0.00012507993,0.00037012564,0.00008996718,0.000016423608,1.9521936e-7,0.0013018587,0.00006111195,0.09022473,0.7506543,0.0003336926,0.15667512],"study_design_scores_gemma":[0.00008033933,0.00024643968,0.0010104736,0.0002580432,0.000044261786,0.000001670933,0.0011331899,0.5221568,0.21150506,0.2624236,0.00084946456,0.00029071324],"about_ca_topic_score_codex":0.00025016675,"about_ca_topic_score_gemma":0.000087149965,"teacher_disagreement_score":0.9150429,"about_ca_system_score_codex":0.00006233383,"about_ca_system_score_gemma":0.00011883417,"threshold_uncertainty_score":0.70516586},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034230947,0.00025127933,0.9553169,0.005910907,0.0003058306,0.001792346,0.000012875016,0.00042955452,0.0017493477],"genre_scores_gemma":[0.9553515,0.000027687167,0.04388431,0.00034811444,0.0000224457,0.00012371897,6.6619043e-7,0.000011421907,0.00023017528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99809057,0.000016764905,0.00048327062,0.00070568884,0.00031748557,0.00038622622],"domain_scores_gemma":[0.99777895,0.00024230142,0.000426844,0.00033296403,0.0011401739,0.00007877976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039514923,0.00030771742,0.00035516784,0.00018893184,0.00036508508,0.00045082252,0.0019323945,0.00012496319,0.000004840582],"category_scores_gemma":[0.0005036905,0.0002023078,0.00007033067,0.00067109504,0.00041781543,0.00065230875,0.0006545863,0.00036599487,0.0000017385747],"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.00011914089,0.00009948978,0.0003732772,0.00023041104,0.00001720527,3.3356622e-7,0.00083436375,0.0000039443744,0.11026199,0.71595496,0.00006295841,0.17204194],"study_design_scores_gemma":[0.00007183164,0.0003308441,0.000063418134,0.0016183048,0.00001769275,0.000004794515,0.00061232987,0.09611549,0.7377278,0.16313693,0.000046552293,0.00025397775],"about_ca_topic_score_codex":0.000050209575,"about_ca_topic_score_gemma":0.000022657625,"teacher_disagreement_score":0.9211205,"about_ca_system_score_codex":0.000050539034,"about_ca_system_score_gemma":0.00017981407,"threshold_uncertainty_score":0.82498723},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9943774,0.00006475945,0.0013438793,0.0020702607,0.0001197545,0.00071161013,7.757045e-7,0.00004818212,0.0012634174],"genre_scores_gemma":[0.9995401,0.00009155952,0.00014519806,0.000048718874,0.000031921856,0.000034254954,4.1553005e-7,0.000007488395,0.0001003763],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99857837,0.000030553663,0.00052537443,0.00036780283,0.0002648933,0.00023299672],"domain_scores_gemma":[0.999054,0.00011267,0.00028505325,0.0001628177,0.00036252436,0.000022900545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041907205,0.00015680367,0.00029874285,0.00014927848,0.00018224669,0.000058424248,0.00029789997,0.000117811585,0.000009439934],"category_scores_gemma":[0.0023123042,0.00009802238,0.00003735375,0.00065903587,0.00033763977,0.000141064,0.00016928524,0.00057126506,0.0000020063494],"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.0006740471,0.00021559604,0.021663213,0.0005037001,0.00003145063,4.6438421e-7,0.0049246233,0.0000016939816,0.84852386,0.048143294,0.000006306583,0.07531173],"study_design_scores_gemma":[0.00007853871,0.0006318993,0.024372527,0.00044397352,0.00003805519,0.000003938981,0.004830305,0.00054543384,0.94932646,0.019603087,0.000046379515,0.00007943127],"about_ca_topic_score_codex":0.00019158292,"about_ca_topic_score_gemma":0.000021358659,"teacher_disagreement_score":0.10080255,"about_ca_system_score_codex":0.00003741723,"about_ca_system_score_gemma":0.00009815312,"threshold_uncertainty_score":0.39972365},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7841916,0.00013998183,0.0009122492,0.016622761,0.00037170041,0.000791101,0.0000133918575,0.000038799677,0.19691843],"genre_scores_gemma":[0.998963,0.000064500186,0.000039100993,0.00042328838,0.000054548582,0.000035390327,4.329995e-7,0.0000052558107,0.0004144933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984073,0.00006031264,0.00048497276,0.0002419397,0.00048413404,0.0003213211],"domain_scores_gemma":[0.99891347,0.00020625985,0.00026134623,0.00018513518,0.0004030074,0.000030787192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013924971,0.00013622106,0.0002596864,0.000099581826,0.00030162698,0.00011086275,0.0015377236,0.00010537214,0.000105248175],"category_scores_gemma":[0.0006500309,0.000084866726,0.000109871005,0.0010349152,0.0004393155,0.00028221429,0.000125406,0.0003804026,0.0000079420215],"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.00009040764,0.00016213967,0.00089359574,0.000029539899,0.000010219865,3.348903e-7,0.021014128,0.00006351894,0.0012681707,0.949973,0.0000689191,0.026426049],"study_design_scores_gemma":[0.00014506002,0.00007019703,0.0028171751,0.0006368665,0.00005550141,3.71231e-7,0.088294424,0.023635149,0.056002498,0.8276325,0.00042297115,0.00028731403],"about_ca_topic_score_codex":0.0020949277,"about_ca_topic_score_gemma":0.001964226,"teacher_disagreement_score":0.2147714,"about_ca_system_score_codex":0.000031456875,"about_ca_system_score_gemma":0.00018098505,"threshold_uncertainty_score":0.3460765},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68810004,0.000013256222,0.20811743,0.010261954,0.0003029999,0.0011814281,0.0000029736775,0.00009266721,0.09192727],"genre_scores_gemma":[0.9950293,0.000024228622,0.0004674771,0.0001200175,0.000018100192,0.00005923293,8.550162e-7,0.00000401587,0.004276818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99802965,0.00002489352,0.0008152422,0.00037193327,0.0006061343,0.00015217291],"domain_scores_gemma":[0.9983995,0.0003482211,0.000378966,0.00024119743,0.0006065955,0.000025536561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008654973,0.00010654328,0.00019523954,0.00031157566,0.00016244226,0.00029869244,0.000883747,0.00006092309,0.00011342985],"category_scores_gemma":[0.0021539133,0.00007591095,0.000081295904,0.0017086834,0.00014658931,0.00040767973,0.00020747237,0.0002160527,0.000051417344],"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.00004160375,0.000045424666,0.0051727877,0.000004314661,0.0000032259734,4.0557275e-8,0.00033215835,0.023752546,0.0145996595,0.92425805,0.00016549499,0.031624664],"study_design_scores_gemma":[0.000024242427,0.000046909878,0.0028313757,0.00012743966,0.0000050605213,1.8745891e-7,0.001821718,0.20158309,0.18917485,0.60391885,0.00037902556,0.0000872649],"about_ca_topic_score_codex":0.00006973345,"about_ca_topic_score_gemma":0.000016621214,"teacher_disagreement_score":0.32033923,"about_ca_system_score_codex":0.000055401717,"about_ca_system_score_gemma":0.00006171956,"threshold_uncertainty_score":0.3095559},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89214045,0.00023229887,0.0073885648,0.017732397,0.0019892233,0.0010287157,0.000016684055,0.0002828745,0.07918881],"genre_scores_gemma":[0.997572,0.00040612058,0.0008335473,0.00060511305,0.00019436073,0.000029115816,0.0000011695228,0.00001664978,0.00034192982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974423,0.00011302605,0.0005805722,0.00052078714,0.0007729841,0.00057029724],"domain_scores_gemma":[0.996967,0.0006843518,0.00042997696,0.00015078453,0.0016065375,0.0001613372],"candidate_categories":["metaresearch","sts"],"consensus_categories":[],"category_scores_codex":[0.0023197304,0.0002848226,0.00039529146,0.00026926838,0.0019172562,0.0008827767,0.0011948128,0.00041478878,0.00007541627],"category_scores_gemma":[0.010695204,0.0002345821,0.00017458478,0.001406985,0.0017135825,0.0005417281,0.00033623137,0.0013472558,0.0000073577503],"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.000043550215,0.00007892847,0.0057900497,0.00004955973,0.000042164917,2.707501e-7,0.028357452,0.000008023506,0.0010677915,0.93486035,0.0001259706,0.029575886],"study_design_scores_gemma":[0.00003173421,0.00015063664,0.0011180253,0.0009564787,0.00004784828,2.3918497e-7,0.06694175,0.00029592804,0.00825631,0.92135555,0.00056428235,0.00028124414],"about_ca_topic_score_codex":0.002199108,"about_ca_topic_score_gemma":0.0011785656,"teacher_disagreement_score":0.105431564,"about_ca_system_score_codex":0.00006029385,"about_ca_system_score_gemma":0.00033467912,"threshold_uncertainty_score":0.99938214},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32632095,0.000013238533,0.6698508,0.0009695247,0.000234516,0.00084185175,0.0000049078194,0.000060921306,0.001703252],"genre_scores_gemma":[0.84760165,0.000035999597,0.15157075,0.000056133696,0.000029769555,0.0000042137203,0.0000012003342,0.000015701673,0.0006845891],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985026,0.0000125417955,0.00043334364,0.0005251862,0.00022111433,0.0003052084],"domain_scores_gemma":[0.9992039,0.00009141124,0.00023288614,0.00022446696,0.00017380923,0.00007351916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036001415,0.00021389934,0.0002169779,0.00007437369,0.00046906597,0.00016199777,0.00037736606,0.00010961008,0.000006739513],"category_scores_gemma":[0.00022778462,0.00018133085,0.00008888772,0.0003507542,0.00040232105,0.00024677723,0.00021948175,0.00019845465,0.0000254042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008295249,0.00015270131,0.0014452758,0.00006384699,0.000019092455,1.0463982e-7,0.0016949507,0.0038613412,0.37261203,0.0072048753,0.000040056268,0.6128228],"study_design_scores_gemma":[0.00007895725,0.000031391875,0.0013400262,0.00019347714,0.000026180183,0.0000014225387,0.0006758378,0.81256896,0.16118093,0.023661917,0.00008780259,0.0001531053],"about_ca_topic_score_codex":0.0007663878,"about_ca_topic_score_gemma":0.0003329983,"teacher_disagreement_score":0.8087076,"about_ca_system_score_codex":0.00010448605,"about_ca_system_score_gemma":0.00002728212,"threshold_uncertainty_score":0.73944575},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9557431,0.00006807664,0.0028089273,0.0034656683,0.00062429695,0.0011287152,0.000017975666,0.00006516503,0.036078118],"genre_scores_gemma":[0.9984256,0.00010556838,0.00030259803,0.00007353419,0.000026493739,0.00006266929,0.00000206039,0.000008029053,0.0009934609],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99882776,0.000008832739,0.0004407883,0.00026893304,0.00026134605,0.00019234495],"domain_scores_gemma":[0.9994622,0.000043870306,0.00021326619,0.000115309274,0.0001363291,0.000029066876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003371521,0.00014382902,0.0001635764,0.000032208143,0.00024071231,0.00008442173,0.0004942027,0.000061379746,0.00020150744],"category_scores_gemma":[0.00022975731,0.000119267694,0.00007493143,0.00039203034,0.00021896145,0.00030522147,0.000108281834,0.000116532734,0.000047225327],"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.0006752394,0.00040389542,0.042462546,0.000550056,0.000072912786,8.3260815e-8,0.0040344554,0.00010445329,0.35848364,0.1190014,0.0134981265,0.4607132],"study_design_scores_gemma":[0.0000449733,0.00017396605,0.018978244,0.00015632808,0.000038938255,2.553095e-7,0.001098595,0.003715904,0.94392246,0.024368847,0.0072851707,0.00021633053],"about_ca_topic_score_codex":0.00041156093,"about_ca_topic_score_gemma":0.00009975805,"teacher_disagreement_score":0.5854388,"about_ca_system_score_codex":0.00010804997,"about_ca_system_score_gemma":0.000018322162,"threshold_uncertainty_score":0.48635954},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8442763,0.00022588701,0.012018168,0.008670294,0.0043774084,0.0008763181,0.00003062322,0.00053074665,0.12899423],"genre_scores_gemma":[0.9840239,0.000011418268,0.00066871993,0.00013297137,0.000017576445,0.0000083683935,0.0000011280463,0.0000063744246,0.015129496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99660397,0.000052427946,0.00086946273,0.0010091483,0.0011055246,0.00035949654],"domain_scores_gemma":[0.99746203,0.00046028904,0.00042218683,0.0005603312,0.0010087218,0.00008645487],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0054443413,0.00020032134,0.000321191,0.00058567245,0.00077544845,0.0022824032,0.002237429,0.00006331263,0.0002310403],"category_scores_gemma":[0.0062699653,0.00013152519,0.00009908549,0.0026163394,0.0008164276,0.00038882994,0.0015012535,0.0003151864,0.00019286231],"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.000112311995,0.00017349019,0.00620202,0.000056097877,0.000030599927,5.5784716e-7,0.0011346583,0.00061932905,0.015533297,0.653983,0.014248905,0.30790573],"study_design_scores_gemma":[0.000036382953,0.00007061303,0.0008634178,0.00033739168,0.000022161606,0.0000020121893,0.0018210877,0.74186045,0.05132159,0.19548088,0.008002735,0.0001812565],"about_ca_topic_score_codex":0.00007488462,"about_ca_topic_score_gemma":0.000029787672,"teacher_disagreement_score":0.74124116,"about_ca_system_score_codex":0.000034855613,"about_ca_system_score_gemma":0.00009114996,"threshold_uncertainty_score":0.9987533},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49167457,0.0000653377,0.49867272,0.001584417,0.0003999951,0.00031928954,0.0000014324515,0.000035493536,0.007246747],"genre_scores_gemma":[0.9941404,0.000008089057,0.005184967,0.000101732425,0.00004657444,0.000030885156,2.7562868e-7,0.000007563986,0.00047949757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809533,0.000066078275,0.00065517763,0.00044665264,0.00040669224,0.0003300424],"domain_scores_gemma":[0.9985166,0.00018054954,0.00030909845,0.00043119883,0.00053175003,0.00003076824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017341668,0.00018440059,0.0002634179,0.00020324653,0.00017628503,0.00014805775,0.0018745352,0.00009861163,0.000014494017],"category_scores_gemma":[0.00030647864,0.00012720056,0.0001030506,0.0010748969,0.00014762688,0.0004319989,0.00057508703,0.00038499935,0.000006930497],"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.00003589991,0.00013078112,0.00007931345,0.00005831203,0.000011009153,8.702437e-8,0.004476894,0.042421237,0.0139166275,0.9147268,0.000025893072,0.02411718],"study_design_scores_gemma":[0.000047677597,0.00005765909,0.000069994654,0.00036279138,0.000008497427,0.0000017307019,0.0027183348,0.79889894,0.044809535,0.15289973,0.000011690117,0.00011344492],"about_ca_topic_score_codex":0.00015330611,"about_ca_topic_score_gemma":0.00028204257,"teacher_disagreement_score":0.76182705,"about_ca_system_score_codex":0.00008726372,"about_ca_system_score_gemma":0.00022759248,"threshold_uncertainty_score":0.5187088},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54914266,0.00011147313,0.4112972,0.0045262794,0.0017712371,0.00072882243,0.000016727161,0.00030272524,0.032102883],"genre_scores_gemma":[0.9113997,0.000045232082,0.0875408,0.00061033,0.00016606937,0.000012940526,0.0000014532512,0.00002130458,0.00020212527],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9965855,0.00004881164,0.0009808542,0.0010030656,0.0007108876,0.00067087373],"domain_scores_gemma":[0.9977883,0.0002896643,0.00041257433,0.000579647,0.0007951398,0.00013466828],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006424725,0.0004455283,0.00054110464,0.00024521258,0.00042700654,0.00084245723,0.0026632599,0.00018391323,0.0001390816],"category_scores_gemma":[0.00056902575,0.00036936373,0.00022671033,0.00142705,0.00037615688,0.0008870789,0.0004326482,0.00066821335,0.00008987834],"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.00009978023,0.00014818856,0.00027949398,0.000028789218,0.00004355529,0.0000039883967,0.0017053174,0.0007166898,0.5995054,0.37758744,0.00012868868,0.019752648],"study_design_scores_gemma":[0.00009769585,0.00015499498,0.0012678116,0.00036416092,0.00004426467,0.00000701335,0.0007829706,0.015617145,0.719217,0.26199165,0.0000908781,0.0003644342],"about_ca_topic_score_codex":0.00056937075,"about_ca_topic_score_gemma":0.000029786348,"teacher_disagreement_score":0.3622571,"about_ca_system_score_codex":0.00017492553,"about_ca_system_score_gemma":0.00029221084,"threshold_uncertainty_score":0.99987584},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9898645,0.00005001152,0.006487795,0.00059546257,0.00022051042,0.00016390365,0.000032921547,0.00006071092,0.002524143],"genre_scores_gemma":[0.9969602,0.000062236744,0.002776986,0.00006629408,0.000037169975,0.0000150282,0.000002490638,0.00000918094,0.00007041353],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992646,0.0000045150036,0.0003061371,0.00017686676,0.00010448813,0.00014342394],"domain_scores_gemma":[0.9996181,0.0000549215,0.00007091333,0.000084071355,0.00014006186,0.00003192934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009643668,0.00012297992,0.00014093243,0.00006146699,0.00011728212,0.00012954779,0.00022366703,0.000051532763,0.000058404003],"category_scores_gemma":[0.00008356723,0.0001025108,0.000036982274,0.00023523762,0.00012434977,0.00020276343,0.00006037817,0.00015446696,0.000008194398],"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.000029836334,0.000045358996,0.0062828395,0.00006400016,0.000049506794,4.4211742e-8,0.0003531405,0.0014493979,0.5467301,0.36763346,0.000577727,0.07678457],"study_design_scores_gemma":[0.000025576075,0.000030608073,0.005703978,0.0001474595,0.000018278846,8.425243e-8,0.00039284743,0.24237557,0.73035735,0.020687575,0.00014221852,0.00011842643],"about_ca_topic_score_codex":0.00010805669,"about_ca_topic_score_gemma":0.00003320723,"teacher_disagreement_score":0.34694588,"about_ca_system_score_codex":0.000033671586,"about_ca_system_score_gemma":0.000020835527,"threshold_uncertainty_score":0.4180269},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007834704,0.000013671326,0.98457026,0.0012602662,0.00062324887,0.0006790083,0.0000077695795,0.00011824512,0.0048928102],"genre_scores_gemma":[0.58334506,0.00001560772,0.4156084,0.00016785233,0.000044923094,0.000118974036,5.300016e-7,0.000009384469,0.0006892934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980858,0.0000111505515,0.00060528546,0.00053935806,0.0004155836,0.00034280305],"domain_scores_gemma":[0.99807626,0.000084305066,0.00039815827,0.00028380333,0.0011049408,0.000052537154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009462186,0.00021744515,0.00024008282,0.00019374197,0.00032098018,0.00031769404,0.0020603936,0.00012348489,0.000009015239],"category_scores_gemma":[0.00050428865,0.00018222012,0.00013890537,0.0007913044,0.00012920811,0.0005737145,0.0003138307,0.00029094092,0.000013577316],"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.00002329952,0.000086891676,0.00003742963,0.000044172488,0.000012968844,1.8671793e-8,0.0005268272,0.00073697086,0.014903299,0.6190068,0.00009229538,0.36452898],"study_design_scores_gemma":[0.000018984332,0.00003668992,0.00025723458,0.00013328712,0.000008660958,5.9239403e-7,0.00014793832,0.51229817,0.34187913,0.14504178,0.00007202265,0.00010552246],"about_ca_topic_score_codex":0.000019172212,"about_ca_topic_score_gemma":0.000005903429,"teacher_disagreement_score":0.5755103,"about_ca_system_score_codex":0.00013086038,"about_ca_system_score_gemma":0.00018524256,"threshold_uncertainty_score":0.7430721},"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":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93088526,0.000040238825,0.0022875902,0.0054036574,0.0010512834,0.0003805434,0.000012794605,0.00003103054,0.059907597],"genre_scores_gemma":[0.99835014,0.000013892996,0.0002774313,0.00020255016,0.000027026756,0.000005520685,8.329927e-7,0.0000050306985,0.0011175721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99687356,0.000048016733,0.00093051157,0.00083113933,0.000797969,0.0005187764],"domain_scores_gemma":[0.9980567,0.0003787913,0.00029620205,0.00046334782,0.00063670124,0.00016826173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032700677,0.00021694331,0.00035927547,0.0010572881,0.00039376735,0.00080063235,0.0021595915,0.00008191946,0.00014604766],"category_scores_gemma":[0.001699922,0.00016577516,0.00008773935,0.002503914,0.0006441971,0.0003468148,0.000769844,0.00031235864,0.000100188045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.000043477354,0.00006317532,0.014635887,0.000016381042,0.000008144009,0.0000016198342,0.0009470592,0.0006474169,0.00035942797,0.89059496,0.00066495227,0.092017524],"study_design_scores_gemma":[0.00002705496,0.00007017405,0.01194714,0.00057816,0.000023904104,0.000002621428,0.02499458,0.26948324,0.023368688,0.6669811,0.002166453,0.0003568872],"about_ca_topic_score_codex":0.032388743,"about_ca_topic_score_gemma":0.052504826,"teacher_disagreement_score":0.2688358,"about_ca_system_score_codex":0.00018776752,"about_ca_system_score_gemma":0.0003496869,"threshold_uncertainty_score":0.9740547},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26549685,0.000017708544,0.7235536,0.0033385395,0.000318426,0.00028767737,0.0000016135635,0.000050904193,0.0069347247],"genre_scores_gemma":[0.94813937,0.000005216803,0.051599175,0.00014974795,0.00003875844,0.000019271378,5.343518e-7,0.0000051711795,0.00004273354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773955,0.000022719869,0.0008807739,0.00047522935,0.000644302,0.00023743317],"domain_scores_gemma":[0.99825054,0.00014244992,0.00039177135,0.00034254274,0.0008186151,0.000054105418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009423385,0.00015387576,0.00025522258,0.00018181125,0.00011769517,0.00016045518,0.0015206551,0.00011203415,0.000013229549],"category_scores_gemma":[0.0017096521,0.00012680035,0.00007031967,0.0007951462,0.00017537124,0.00036616548,0.0003184157,0.00028442987,0.0000024359629],"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.000028582355,0.000272685,0.0017747021,0.00010783778,0.000009776967,0.000006679999,0.00053808483,0.016152557,0.085372284,0.74555534,0.00003228693,0.15014917],"study_design_scores_gemma":[0.000024086796,0.000021430773,0.00006703803,0.00035399958,0.000002224936,0.0000016211399,0.000048181562,0.6137801,0.33898726,0.046648484,0.0000013802756,0.00006420761],"about_ca_topic_score_codex":0.00038760173,"about_ca_topic_score_gemma":0.00006699918,"teacher_disagreement_score":0.6989069,"about_ca_system_score_codex":0.000049958304,"about_ca_system_score_gemma":0.00045871397,"threshold_uncertainty_score":0.51707685},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97039473,0.000023009497,0.00066373317,0.010511106,0.0008135921,0.001968556,0.00001942325,0.000032117892,0.015573744],"genre_scores_gemma":[0.99849594,0.000014709678,0.000098367505,0.00043667416,0.00020340504,0.00020926743,0.0000034954685,0.000008566665,0.0005295686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857646,0.00006363223,0.00035847235,0.00026562138,0.00047207528,0.00026372954],"domain_scores_gemma":[0.997906,0.00018413804,0.00030964878,0.00016656454,0.0013936663,0.00003996383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011897255,0.00014929839,0.00015640484,0.00007921329,0.00090555585,0.00027895055,0.00092095864,0.00006749532,0.000032271433],"category_scores_gemma":[0.0008492196,0.00008558397,0.0002151879,0.000421513,0.00048479508,0.00019690905,0.000074792915,0.00023355425,0.0000022499653],"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.0001246214,0.00018038799,0.00045313148,0.000018444252,0.000036879075,1.3403156e-8,0.008774178,0.0009886677,0.0063046287,0.7374668,0.0005660459,0.2450862],"study_design_scores_gemma":[0.00008577364,0.0018252529,0.0020756668,0.0010464417,0.00013270773,8.7131593e-7,0.09752097,0.58193636,0.06454942,0.25003746,0.0004011482,0.00038790543],"about_ca_topic_score_codex":0.0019899728,"about_ca_topic_score_gemma":0.00055285875,"teacher_disagreement_score":0.5809477,"about_ca_system_score_codex":0.00019658492,"about_ca_system_score_gemma":0.0009238009,"threshold_uncertainty_score":0.6964895},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9761932,0.00014085839,0.0015299205,0.0052570677,0.0011091151,0.000531155,0.000018546089,0.00007468475,0.015145446],"genre_scores_gemma":[0.9973345,0.00007306738,0.0012793164,0.00022197109,0.00007858033,0.000040211773,6.4172207e-7,0.00001034037,0.0009614161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957086,0.000046009292,0.0013033013,0.00087961025,0.0015814053,0.00048109223],"domain_scores_gemma":[0.9958534,0.000793167,0.0006988893,0.00047594227,0.0019622834,0.0002163227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029508297,0.00032980656,0.0005496714,0.00034243916,0.0005428954,0.0010333759,0.0023295248,0.00017335585,0.00056497304],"category_scores_gemma":[0.0045679575,0.00022213781,0.00016637915,0.0012704992,0.0013345876,0.0003549852,0.00053911767,0.00058255723,0.00022438838],"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.00009627719,0.00058649754,0.027174188,0.000027217186,0.000103438986,8.412854e-7,0.000978661,0.00043356072,0.0059680184,0.89696276,0.00033663778,0.067331895],"study_design_scores_gemma":[0.00017900663,0.0002088455,0.13102861,0.0008436598,0.00016156162,0.000006014254,0.021587163,0.0035290343,0.10751954,0.7342491,0.00016878384,0.0005186485],"about_ca_topic_score_codex":0.00008366502,"about_ca_topic_score_gemma":0.000040476887,"teacher_disagreement_score":0.16271363,"about_ca_system_score_codex":0.000055470766,"about_ca_system_score_gemma":0.00044251836,"threshold_uncertainty_score":0.9964868},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004655854,0.000046190748,0.98403174,0.0015151458,0.000072995404,0.0005454086,0.000003463911,0.00007561323,0.009053586],"genre_scores_gemma":[0.9775567,0.00005039451,0.018096237,0.00013204152,0.000060068513,0.00014649426,0.0000018320309,0.000008336033,0.003947919],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888736,0.000019472958,0.00034331725,0.00039430472,0.00017025003,0.00018531736],"domain_scores_gemma":[0.99881095,0.00022882393,0.00025639616,0.00017427628,0.00049325504,0.00003628377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006732594,0.00012219945,0.00017992637,0.00010638214,0.0003515294,0.00026388137,0.0007864044,0.00005284487,0.000018261784],"category_scores_gemma":[0.0003830154,0.00009545391,0.00008465162,0.0006466401,0.00018538027,0.0002726086,0.00025659785,0.00014570859,0.000012935084],"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.000011975322,0.000015691188,0.000043237334,0.000013218436,0.000011912938,1.8049255e-8,0.00022487796,0.0000649994,0.008382088,0.59449416,0.000018764242,0.39671907],"study_design_scores_gemma":[0.000018878793,0.00006009177,0.00006135319,0.00007903908,0.000022980359,0.0000011814826,0.0004891026,0.47086084,0.094903424,0.4328347,0.0005664829,0.00010190068],"about_ca_topic_score_codex":0.000014950587,"about_ca_topic_score_gemma":0.0000010050484,"teacher_disagreement_score":0.9729008,"about_ca_system_score_codex":0.000017581071,"about_ca_system_score_gemma":0.000049082166,"threshold_uncertainty_score":0.38924974},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99493617,0.000033610708,0.00019744482,0.002482881,0.00014215676,0.0014088181,0.000019487987,0.000016340395,0.00076310826],"genre_scores_gemma":[0.99934334,0.000043311815,0.00017150008,0.0002634608,0.000055743676,0.00008896786,0.0000047699127,8.315608e-7,0.00002810487],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99897134,0.000019765717,0.00030324413,0.0003588483,0.00014367975,0.00020314363],"domain_scores_gemma":[0.99926835,0.0003307128,0.00013244514,0.00002518676,0.00019757639,0.000045725123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003434139,0.00016056812,0.00023538714,0.000029700013,0.00019305515,0.00013166082,0.00020301215,0.00007967118,0.000009828796],"category_scores_gemma":[0.00007004935,0.00006133279,0.00005433895,0.00028758653,0.00014710524,0.00011798234,0.00020488561,0.0001709745,6.423897e-7],"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.00025698982,0.0002726834,0.031432044,0.000072503084,0.00003635148,2.9132846e-7,0.00038614144,0.000007226672,0.09658947,0.11322091,0.00017127344,0.7575541],"study_design_scores_gemma":[0.00023707867,0.002842376,0.7740231,0.00122643,0.00005817213,0.0000037915893,0.0053607957,0.015999874,0.16457106,0.033597857,0.001587608,0.0004918283],"about_ca_topic_score_codex":0.000054684766,"about_ca_topic_score_gemma":0.00024564547,"teacher_disagreement_score":0.7570623,"about_ca_system_score_codex":0.00003291049,"about_ca_system_score_gemma":0.000015215834,"threshold_uncertainty_score":0.25010782},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015208258,0.00004620503,0.9538768,0.00056717196,0.00034876482,0.0015479131,0.0000048609377,0.00034132914,0.028058719],"genre_scores_gemma":[0.9480983,0.000012265583,0.05153054,0.00003230709,0.000033758173,0.00017699425,0.0000011603136,0.000019739919,0.00009493709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877906,0.0000074906466,0.00047669644,0.00025294875,0.00017892414,0.0003049001],"domain_scores_gemma":[0.9991975,0.00024601808,0.00013252125,0.000096336094,0.0002765187,0.000051150364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000504815,0.00020366412,0.00024185295,0.00013188948,0.00015506617,0.00019847043,0.00037333302,0.00010051781,0.000022726423],"category_scores_gemma":[0.00064054696,0.00016837259,0.000113499314,0.00038825328,0.0002506851,0.00019155846,0.000069237365,0.00018805795,0.0000041849444],"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.000020118741,0.00007626875,0.000035866196,0.0003517965,0.000043389646,3.4051382e-8,0.0012806795,0.0060450677,0.010218472,0.8171943,0.000051321953,0.16468273],"study_design_scores_gemma":[0.000036097183,0.00009617996,0.000011359794,0.00085472595,0.00004779221,0.0000010475405,0.0059298924,0.7518162,0.15756051,0.083363935,0.000062224855,0.0002200271],"about_ca_topic_score_codex":0.0000042769975,"about_ca_topic_score_gemma":0.0000029833188,"teacher_disagreement_score":0.93289006,"about_ca_system_score_codex":0.00007146335,"about_ca_system_score_gemma":0.000031086598,"threshold_uncertainty_score":0.6866035},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5967687,0.00015889575,0.17059433,0.04320587,0.007807042,0.0018901933,0.00021609743,0.00021667243,0.17914224],"genre_scores_gemma":[0.9938101,0.0000051684174,0.0026563075,0.00020610375,0.000042768803,0.000014840949,0.0000043240707,0.0000057754687,0.0032545887],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967098,0.000025006597,0.0010434615,0.0010370823,0.0008381135,0.0003465074],"domain_scores_gemma":[0.9967818,0.0010003404,0.0004229636,0.0011132625,0.000631084,0.000050493905],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0065350137,0.00016267209,0.00030117147,0.0006854436,0.00024996322,0.00073271827,0.005311564,0.000059075515,0.00010377057],"category_scores_gemma":[0.010546119,0.00011109323,0.00009637373,0.0027032325,0.0002289282,0.0004014173,0.0016498414,0.00018836805,0.00004029697],"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.00007169607,0.000084965584,0.0009927327,0.000014113725,0.000007306619,1.132263e-7,0.0003461971,0.00019879478,0.0013596455,0.37427685,0.0064246883,0.6162229],"study_design_scores_gemma":[0.00006433637,0.00005112682,0.0012240639,0.0004221437,0.000018583556,4.5952754e-7,0.0036132834,0.57329,0.030653961,0.3837291,0.0067395736,0.00019337663],"about_ca_topic_score_codex":0.00008925242,"about_ca_topic_score_gemma":0.00008626133,"teacher_disagreement_score":0.6160295,"about_ca_system_score_codex":0.000038372804,"about_ca_system_score_gemma":0.0000839321,"threshold_uncertainty_score":0.9977885},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6774993,0.00001585303,0.2993834,0.0020054337,0.0012858676,0.00081004883,0.000016569198,0.00017512483,0.018808436],"genre_scores_gemma":[0.9982923,0.000025700008,0.0012231694,0.00009727373,0.00009273754,0.000033060067,0.0000023109783,0.0000062019385,0.0002271969],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99811554,0.00004104021,0.0007065561,0.00040508786,0.0004716974,0.00026010472],"domain_scores_gemma":[0.99862224,0.00007031148,0.00043852255,0.0002574925,0.000551427,0.000060015598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078729645,0.00019632418,0.00026150615,0.00023367982,0.00040767758,0.0002570338,0.0010228602,0.000095211624,0.000032885535],"category_scores_gemma":[0.0002328187,0.00015471206,0.0001142813,0.00056094624,0.00009492074,0.00073338696,0.00030706485,0.0003213444,0.00010049483],"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.000017740354,0.00010074341,0.0041592624,0.00016061425,0.000035726374,1.1983417e-7,0.0032622851,0.00009347194,0.022567945,0.9352877,0.00020318145,0.03411118],"study_design_scores_gemma":[0.00007780084,0.00017252448,0.024475675,0.0015940918,0.000029812807,0.0000014444007,0.0012127934,0.22275613,0.67500854,0.0742485,0.00017531929,0.00024735392],"about_ca_topic_score_codex":0.00005257577,"about_ca_topic_score_gemma":0.0000029697815,"teacher_disagreement_score":0.8610392,"about_ca_system_score_codex":0.00012039956,"about_ca_system_score_gemma":0.00007989019,"threshold_uncertainty_score":0.6308975},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03409618,0.000053771008,0.70614094,0.084612496,0.0043361066,0.0013048566,0.0000125044735,0.0006073632,0.16883576],"genre_scores_gemma":[0.9832207,0.000019648785,0.013936489,0.0010146187,0.000093007686,0.000025196558,5.994185e-7,0.00001511838,0.0016746452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99742395,0.000042388278,0.0006741498,0.00073225505,0.00062987907,0.00049738603],"domain_scores_gemma":[0.997934,0.00020467596,0.00044951122,0.0005546626,0.0007598754,0.00009731292],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007510647,0.00032431757,0.00037915134,0.0002657657,0.00039678888,0.0003539296,0.00404046,0.00016026718,0.00008405815],"category_scores_gemma":[0.0014120281,0.00026181465,0.00018417266,0.001440953,0.00036417475,0.00047574233,0.0011706776,0.00065149774,0.000042880336],"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.000050298622,0.00008066084,0.0003039354,0.000037619386,0.000029365432,8.504405e-7,0.00095251994,0.0038494167,0.0050511523,0.9506039,0.0006184091,0.038421877],"study_design_scores_gemma":[0.00011442472,0.00019854281,0.00048270615,0.00055487663,0.000053211075,0.0000047735903,0.0009231407,0.34033835,0.22017655,0.4351761,0.0014064164,0.0005709114],"about_ca_topic_score_codex":0.00015921611,"about_ca_topic_score_gemma":0.00004713547,"teacher_disagreement_score":0.9491245,"about_ca_system_score_codex":0.00012183447,"about_ca_system_score_gemma":0.00035432237,"threshold_uncertainty_score":0.99998343},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018381454,0.000018592913,0.97489953,0.002664498,0.00015046282,0.0008803745,0.0000012452384,0.00012893789,0.0028749134],"genre_scores_gemma":[0.98813874,0.000044103384,0.010659297,0.00019874878,0.00002032162,0.00014062731,0.0000010873174,0.000018260047,0.00077880244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768275,0.00002032966,0.0007186862,0.00057840336,0.00040547497,0.00059435284],"domain_scores_gemma":[0.99879795,0.00013159939,0.00017915938,0.0003000364,0.0005232928,0.000067930756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054781314,0.00028651903,0.000358549,0.0004957999,0.0002505225,0.00031846465,0.0021932668,0.00014744916,0.0000043198543],"category_scores_gemma":[0.0004891427,0.00024475725,0.00016734951,0.0013475162,0.00017400156,0.00042224102,0.00032103644,0.00052175345,0.000007671167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003149064,0.000049314855,0.00010262127,0.00008920532,0.000010291162,1.0390442e-7,0.0013300533,0.36419582,0.0019343144,0.577323,0.0000026440357,0.054931127],"study_design_scores_gemma":[0.00006132804,0.00011883569,0.0000412948,0.00032558417,0.000011151275,7.400587e-7,0.00038050546,0.90857077,0.02340014,0.06683898,0.00004569832,0.00020498308],"about_ca_topic_score_codex":0.000039346814,"about_ca_topic_score_gemma":0.000020942225,"teacher_disagreement_score":0.9697573,"about_ca_system_score_codex":0.00016941981,"about_ca_system_score_gemma":0.00024924395,"threshold_uncertainty_score":0.9980911},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011744599,0.000014089812,0.990986,0.001817451,0.0012486272,0.0006973515,0.0000026241864,0.00009046893,0.0039689443],"genre_scores_gemma":[0.9660493,0.000016181148,0.032719087,0.00029279393,0.00008486226,0.000059641297,0.0000019906229,0.000010038887,0.0007660829],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828357,0.000017174967,0.00052880245,0.0004610231,0.0003610306,0.0003484077],"domain_scores_gemma":[0.99819475,0.00017149338,0.00032556133,0.00029826685,0.00095672475,0.000053213833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043225838,0.00021912382,0.00023704678,0.00014454965,0.00032120023,0.00034673163,0.0016449571,0.00011003695,0.000016815604],"category_scores_gemma":[0.0006048456,0.00016949726,0.0001281395,0.00081021525,0.00014880985,0.0002012488,0.00033889757,0.00023787284,0.00001384445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020417563,0.00002983749,0.000026632075,0.000018926668,0.000012735727,3.106793e-8,0.00036491556,0.5367439,0.0019329445,0.44062966,0.00018097703,0.020039054],"study_design_scores_gemma":[0.000031050167,0.00010947763,0.000030502324,0.00013958407,0.000011930232,2.5523798e-7,0.00009284439,0.8445792,0.1342081,0.020513192,0.00014710583,0.00013672929],"about_ca_topic_score_codex":0.000004868024,"about_ca_topic_score_gemma":0.0000016210291,"teacher_disagreement_score":0.96487486,"about_ca_system_score_codex":0.00008368578,"about_ca_system_score_gemma":0.00012398824,"threshold_uncertainty_score":0.69118977},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08492848,0.000019926321,0.8952373,0.004882797,0.0006540399,0.00035564325,0.0000010389334,0.00013867728,0.013782092],"genre_scores_gemma":[0.9793122,0.000020349376,0.019759443,0.00045232067,0.00006705702,0.00001065907,5.605995e-7,0.00001207308,0.0003653625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793273,0.00004759468,0.0005850796,0.00059598073,0.0005235858,0.000315034],"domain_scores_gemma":[0.99843675,0.00018209952,0.0004479171,0.00042254903,0.00045370287,0.00005696223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007728989,0.00025055115,0.00031284065,0.00023397789,0.00026125315,0.00040492156,0.0022533077,0.00011143918,0.000039359224],"category_scores_gemma":[0.00084138353,0.00018886833,0.00013986546,0.0008103693,0.00016749486,0.0011499515,0.00093107275,0.00054957747,0.00003469087],"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.000096918026,0.00005539988,0.00014244122,0.000045971818,0.000020782669,4.4348158e-7,0.001472901,0.0036554278,0.01761141,0.77993417,0.00014872868,0.19681542],"study_design_scores_gemma":[0.00003997161,0.000064244035,0.000063087005,0.0009053696,0.000012668217,0.0000014871246,0.00039453057,0.62527883,0.20827876,0.16467816,0.00010649007,0.00017641674],"about_ca_topic_score_codex":0.000049159797,"about_ca_topic_score_gemma":0.000001793886,"teacher_disagreement_score":0.89438367,"about_ca_system_score_codex":0.000090735455,"about_ca_system_score_gemma":0.00008198298,"threshold_uncertainty_score":0.7701827},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72383636,0.0001571261,0.25096565,0.014970446,0.00081136124,0.0012526013,0.0000064800115,0.00013647687,0.0078634815],"genre_scores_gemma":[0.9970356,0.000029874433,0.0024069268,0.00038395618,0.000028222326,0.000022976612,1.6584484e-7,0.0000055305945,0.00008674652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977746,0.00008005047,0.00075557135,0.0005643185,0.00051738013,0.00030809868],"domain_scores_gemma":[0.99733347,0.0007947774,0.00035696008,0.0005353421,0.0009186406,0.000060805578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013273073,0.0002558209,0.0004668406,0.00016967239,0.0002881056,0.00022683153,0.0026046995,0.00008743615,0.000014469837],"category_scores_gemma":[0.001012408,0.00014814822,0.00016041502,0.0010064038,0.0017278588,0.00023589445,0.001435505,0.00035719102,0.000004928555],"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.00008944785,0.00018934603,0.0007391665,0.000096818214,0.00001402816,1.1288275e-7,0.0021170448,0.00007783468,0.0040100846,0.9572331,0.00004492739,0.03538814],"study_design_scores_gemma":[0.00011190663,0.00013532532,0.0013013154,0.00021283947,0.000017900815,0.0000026199052,0.0005007383,0.39409477,0.0998144,0.5036307,0.00003538548,0.00014211386],"about_ca_topic_score_codex":0.00040451906,"about_ca_topic_score_gemma":0.000020133184,"teacher_disagreement_score":0.45360234,"about_ca_system_score_codex":0.000043127475,"about_ca_system_score_gemma":0.0002087259,"threshold_uncertainty_score":0.6366368},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14105862,0.000030615123,0.81559706,0.002191237,0.004033612,0.0015095025,0.000010334859,0.00058244274,0.03498659],"genre_scores_gemma":[0.9924198,0.0000022061904,0.004692404,0.000100244026,0.00029850175,0.000088626264,4.863783e-7,0.00001717496,0.0023805918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99755806,0.000036360594,0.0007837537,0.0006636126,0.00043465654,0.0005235872],"domain_scores_gemma":[0.99798495,0.0001523992,0.0004762601,0.00030548964,0.0010047787,0.00007613345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001156918,0.00028777905,0.0004255109,0.00022572606,0.0007005773,0.0005269067,0.002313553,0.00013957736,0.000005766877],"category_scores_gemma":[0.0003422459,0.00023357625,0.0002242779,0.00067663984,0.00012694321,0.00052310614,0.00022834096,0.0003084259,0.000016977903],"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.000022030234,0.00009321363,0.00008002645,0.00014420353,0.000026319856,2.883962e-7,0.0042667477,0.00015509287,0.033641737,0.91619575,0.00007016643,0.045304425],"study_design_scores_gemma":[0.00010632344,0.00039574417,0.0002704374,0.001836759,0.000041269745,0.0000075481894,0.00890069,0.09872805,0.8191465,0.066358596,0.003619751,0.0005883296],"about_ca_topic_score_codex":0.000047748286,"about_ca_topic_score_gemma":0.0000031925767,"teacher_disagreement_score":0.85136116,"about_ca_system_score_codex":0.00016038354,"about_ca_system_score_gemma":0.00019537854,"threshold_uncertainty_score":0.9524963},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68628186,0.00008951649,0.1301645,0.00910296,0.0023731436,0.00085365225,0.0000044963977,0.00038259174,0.17074728],"genre_scores_gemma":[0.99759537,0.000008377067,0.0008731438,0.0006615278,0.00006121406,0.000029545066,3.044976e-7,0.000007733887,0.0007627796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978476,0.000032096697,0.00052170904,0.0006901072,0.00043226173,0.0004762381],"domain_scores_gemma":[0.9983834,0.00027274634,0.00025972325,0.00046733595,0.0005177612,0.00009903936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070773746,0.00026914733,0.00031273448,0.00012725942,0.00031138185,0.00031786706,0.002487144,0.00013467499,0.00006071217],"category_scores_gemma":[0.0008978748,0.00019330547,0.00017054222,0.00078990107,0.00029083408,0.00031757168,0.00054948806,0.00040854813,0.00010754832],"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.00006832715,0.0002031539,0.0012846122,0.000034032855,0.000017320037,4.6076e-7,0.0008326082,0.00030406722,0.003995105,0.9773076,0.00030551502,0.015647152],"study_design_scores_gemma":[0.000044081877,0.00021809444,0.0025111455,0.00037916718,0.0000140617,0.0000012074153,0.00034471732,0.074202105,0.20797816,0.7138335,0.00022729667,0.00024648252],"about_ca_topic_score_codex":0.000029401339,"about_ca_topic_score_gemma":0.000011774891,"teacher_disagreement_score":0.3113135,"about_ca_system_score_codex":0.00009338068,"about_ca_system_score_gemma":0.00021365503,"threshold_uncertainty_score":0.78827685},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059922836,0.00002545077,0.9738107,0.009659647,0.0006244393,0.000944961,0.000014126862,0.00010980775,0.0088186385],"genre_scores_gemma":[0.7376186,0.00005413222,0.25928056,0.00027793294,0.00010862578,0.00012189116,0.0000013365398,0.000016285167,0.0025206187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972898,0.000050284034,0.00057223404,0.0006749713,0.00087122986,0.00054148975],"domain_scores_gemma":[0.9963351,0.00068097067,0.00015383892,0.00043201438,0.0022687807,0.00012930104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014480877,0.00021974902,0.00029654868,0.00042211305,0.0004023787,0.00049705774,0.0027245358,0.00014658066,0.00013624193],"category_scores_gemma":[0.0021566674,0.00017629481,0.00015869629,0.0020899149,0.0003840402,0.00031423205,0.00063215976,0.00054262334,0.000056030283],"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.000112192356,0.00015005212,0.00007812382,0.00007074357,0.000029006065,2.3520612e-7,0.00034929617,0.00074364897,0.003224162,0.94521827,0.0003412084,0.04968307],"study_design_scores_gemma":[0.000040985,0.00014030594,0.0001265781,0.00017461828,0.000007808612,0.0000014057717,0.00022827146,0.50083816,0.24608529,0.2519876,0.0002212288,0.0001477554],"about_ca_topic_score_codex":0.000030835246,"about_ca_topic_score_gemma":0.0000023576606,"teacher_disagreement_score":0.73162633,"about_ca_system_score_codex":0.00009201411,"about_ca_system_score_gemma":0.00052497763,"threshold_uncertainty_score":0.7189093},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61392504,0.00007521077,0.00033402385,0.001482299,0.0007776942,0.00018561415,0.0000025077652,0.0001484434,0.38306913],"genre_scores_gemma":[0.9875033,0.00001555023,0.00015881775,0.00026446825,0.00022836032,0.000009337469,9.918891e-7,0.000014232187,0.011804947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987834,0.0000303449,0.0003634832,0.00028935896,0.00025817935,0.00027520023],"domain_scores_gemma":[0.99926955,0.000119633485,0.00024373407,0.00012459153,0.00021553643,0.000026965568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003837883,0.00018796042,0.00022287169,0.000110128334,0.00075651525,0.00041159568,0.00060891366,0.000059415397,0.0007443628],"category_scores_gemma":[0.0005600399,0.00013514249,0.00011452932,0.00014176045,0.00038581362,0.00024693814,0.00013963837,0.0006782858,0.000047644033],"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.000032204087,0.000029598841,0.00020655587,0.00005607337,0.000021829732,2.3293317e-7,0.054896507,0.000043093016,0.0053577665,0.9081073,0.00023208598,0.03101678],"study_design_scores_gemma":[0.00007180104,0.00030494362,0.00022969324,0.0012408267,0.00008652665,0.0000025519053,0.20510876,0.0035783015,0.17524664,0.5885787,0.025011154,0.0005401118],"about_ca_topic_score_codex":0.00035684265,"about_ca_topic_score_gemma":0.00006128607,"teacher_disagreement_score":0.37357822,"about_ca_system_score_codex":0.000037018784,"about_ca_system_score_gemma":0.00004125384,"threshold_uncertainty_score":0.8150251},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8442463,0.00003218168,0.00033373872,0.014505427,0.0011103472,0.00096148934,0.000016826189,0.00017640261,0.13861728],"genre_scores_gemma":[0.9964383,0.000052769272,0.0003814612,0.00082077185,0.00025351756,0.000072607334,0.0000015895287,0.000025916304,0.0019530134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9958712,0.0002110484,0.0013779139,0.00072454603,0.00095462514,0.0008606882],"domain_scores_gemma":[0.99713594,0.0005274821,0.000690612,0.00025278452,0.0012444301,0.00014873338],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002907369,0.00037710034,0.0005476872,0.00043392053,0.0012076792,0.0004228135,0.001987189,0.00036693137,0.00036092204],"category_scores_gemma":[0.006491035,0.00033170852,0.0002161241,0.0032950582,0.0024355804,0.0004583293,0.000333644,0.00078187016,0.00014526797],"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.000068804045,0.00024438932,0.0044786707,0.000040000115,0.000020799682,7.8226384e-7,0.0147512285,0.000110324676,0.016236879,0.93375206,0.00061080296,0.029685289],"study_design_scores_gemma":[0.00004516021,0.00009944491,0.0005568155,0.0006717434,0.00003363833,4.6456088e-7,0.02931175,0.0063898116,0.5326216,0.4271772,0.0026108846,0.00048143874],"about_ca_topic_score_codex":0.002679192,"about_ca_topic_score_gemma":0.0056443335,"teacher_disagreement_score":0.5163848,"about_ca_system_score_codex":0.00037561683,"about_ca_system_score_gemma":0.00085360627,"threshold_uncertainty_score":0.9999135},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14002614,0.000021871681,0.019163068,0.01297217,0.00045364478,0.00091711833,0.00000219218,0.0002606701,0.82618314],"genre_scores_gemma":[0.98234737,0.000024262137,0.014958348,0.00026218224,0.000062611114,0.000048484762,2.3786455e-7,0.000008218778,0.002288296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836797,0.00005733547,0.00050553016,0.00025697506,0.0005400351,0.0002721656],"domain_scores_gemma":[0.9982886,0.000488857,0.0003458841,0.0001991533,0.00061368424,0.00006384352],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0025483915,0.00013829232,0.00021262045,0.00013192966,0.0006327286,0.0002380847,0.0010211653,0.000099420984,0.00053464255],"category_scores_gemma":[0.010707814,0.00010743665,0.00010074302,0.00056861836,0.00044238864,0.0001740002,0.00015377223,0.00030521487,0.00005369887],"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.000011403917,0.00011269368,0.000075968754,0.000050081573,0.000008434893,2.8306951e-8,0.00821337,0.0000011778573,0.0030781715,0.9457522,0.000483217,0.042213243],"study_design_scores_gemma":[0.000010191614,0.00002964097,0.00001821623,0.0005527501,0.000019835607,3.0392965e-7,0.0055587627,0.0038136316,0.07366435,0.9157993,0.0004303107,0.00010270634],"about_ca_topic_score_codex":0.0001030041,"about_ca_topic_score_gemma":0.000021402137,"teacher_disagreement_score":0.8423212,"about_ca_system_score_codex":0.000083631545,"about_ca_system_score_gemma":0.00031715073,"threshold_uncertainty_score":0.9976254},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060011096,0.00000779116,0.80999106,0.012801199,0.0007806814,0.0006438217,0.000003179914,0.00024973645,0.11551146],"genre_scores_gemma":[0.9611923,0.000016631375,0.036336847,0.0012039331,0.000069306545,0.00004010189,4.891398e-7,0.000015733382,0.0011246407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974719,0.000037385005,0.000682355,0.0007579043,0.00058395835,0.00046646572],"domain_scores_gemma":[0.9979605,0.00013899358,0.0003011946,0.0005425321,0.0009371658,0.00011960911],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007147523,0.0003118135,0.0003487593,0.00033537997,0.0003837862,0.00043719326,0.0036231,0.00012588274,0.00005595271],"category_scores_gemma":[0.00093049917,0.00025270524,0.0001643451,0.0015077739,0.0002549913,0.00082288,0.0011947083,0.0005192498,0.00019276484],"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.000032681764,0.00008278508,0.000087695495,0.000035686797,0.000015903166,5.0515763e-7,0.0015108644,0.009146844,0.04194717,0.8578955,0.00073982525,0.08850454],"study_design_scores_gemma":[0.00004135526,0.00007285838,0.00024100047,0.0003780186,0.000014501265,0.0000020122181,0.00093180436,0.6590501,0.06666764,0.27211282,0.00017825865,0.00030962328],"about_ca_topic_score_codex":0.00006585648,"about_ca_topic_score_gemma":0.000006103941,"teacher_disagreement_score":0.9011812,"about_ca_system_score_codex":0.0001265642,"about_ca_system_score_gemma":0.00018565236,"threshold_uncertainty_score":0.9999925},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050504105,0.00008479812,0.9849537,0.0012540339,0.0010917486,0.000767495,0.000010085222,0.00015420637,0.0066335346],"genre_scores_gemma":[0.99567586,0.000015998714,0.0032062733,0.00039280325,0.00010356825,0.00009800688,0.0000025410923,0.000013579859,0.00049137115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99790996,0.000020451555,0.00062485004,0.0005989613,0.00036361502,0.00048214235],"domain_scores_gemma":[0.99821395,0.00020490095,0.00042841976,0.00041925057,0.00064576644,0.00008771703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005606319,0.00026985217,0.0003500404,0.00015011776,0.00031898424,0.00039207056,0.0021349802,0.00009614002,0.000020993832],"category_scores_gemma":[0.0005761777,0.00020486658,0.00015584401,0.0007709196,0.00017631339,0.00030830342,0.00046073692,0.0002457018,0.000058222035],"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.000034224395,0.00012414354,0.0011081357,0.0001735492,0.000027371796,9.1352723e-7,0.0007149307,0.000032010506,0.004439625,0.8732521,0.0014802876,0.11861269],"study_design_scores_gemma":[0.000110113244,0.00042754377,0.00023804972,0.00024139957,0.00004984975,0.000006332035,0.001050559,0.19712046,0.25281334,0.53681827,0.01054386,0.0005802317],"about_ca_topic_score_codex":0.00009158353,"about_ca_topic_score_gemma":0.0000062907557,"teacher_disagreement_score":0.99062544,"about_ca_system_score_codex":0.000050532657,"about_ca_system_score_gemma":0.00014049764,"threshold_uncertainty_score":0.8354216},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93387413,0.000034572688,0.018869404,0.001052856,0.0004781774,0.0003200324,0.0000033442439,0.00016148825,0.045205988],"genre_scores_gemma":[0.99922293,0.000048549275,0.00018040434,0.000083167935,0.00004967565,0.000009435302,0.0000013484661,0.000007360548,0.00039711292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99934953,0.0000059953286,0.00025794137,0.0001515714,0.00012255629,0.000112385016],"domain_scores_gemma":[0.9996356,0.000014909804,0.00005855789,0.000075242075,0.00018892786,0.000026767259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015635142,0.000108783635,0.00010725448,0.000112836744,0.00010900032,0.00009390907,0.00016924032,0.000060790237,0.00009063896],"category_scores_gemma":[0.00008183665,0.00009135693,0.000031038755,0.00026420577,0.00008496241,0.00015024672,0.000034217665,0.00013106246,0.00002377897],"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.000007702621,0.00002177447,0.00005657882,0.00005632042,0.00000767677,3.222819e-8,0.00039409826,0.0005023889,0.27303967,0.65313613,0.00041327887,0.07236434],"study_design_scores_gemma":[0.000027062502,0.00003216686,0.0008644657,0.00014698112,0.000014380653,5.817296e-7,0.00039609408,0.36758018,0.5857355,0.04479352,0.0002869722,0.00012209998],"about_ca_topic_score_codex":0.0000062954573,"about_ca_topic_score_gemma":0.000015292235,"teacher_disagreement_score":0.60834265,"about_ca_system_score_codex":0.000031638137,"about_ca_system_score_gemma":0.000012931787,"threshold_uncertainty_score":0.37254274},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017125942,0.00018292526,0.97517806,0.0036899657,0.00014345511,0.0008514909,0.000013258975,0.00027143382,0.0025434494],"genre_scores_gemma":[0.8404883,0.0000129126565,0.15891847,0.0002466578,0.000022937153,0.000059007893,0.000002017217,0.000012340889,0.00023731982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99820185,0.00001623979,0.0004137038,0.00057774934,0.0004328339,0.00035761273],"domain_scores_gemma":[0.9982831,0.00012470249,0.00019887257,0.0003533421,0.00097112294,0.00006885207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064752676,0.00023879691,0.00025810456,0.00024551334,0.00027480733,0.0003632579,0.0021718962,0.00011576841,0.000008315461],"category_scores_gemma":[0.000130615,0.00016411195,0.000081934406,0.00094016973,0.00020559125,0.0007046657,0.0001777719,0.00031908543,0.000004349202],"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.00016252718,0.0001172579,0.000055108154,0.00009490458,0.00001305339,2.2359147e-7,0.0008526836,0.000030406456,0.12200285,0.6136853,0.000047342703,0.26293835],"study_design_scores_gemma":[0.000038539725,0.00030569677,0.00001676568,0.00026943488,0.000012543331,0.0000024080753,0.000104670966,0.05551215,0.7290056,0.21453068,0.00004589548,0.00015567221],"about_ca_topic_score_codex":0.000079565434,"about_ca_topic_score_gemma":0.000039499027,"teacher_disagreement_score":0.8233624,"about_ca_system_score_codex":0.000048926402,"about_ca_system_score_gemma":0.0001971973,"threshold_uncertainty_score":0.6692291},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25745946,0.000038137132,0.73981696,0.00070457975,0.00027516286,0.00057685486,0.0000015880053,0.00006977119,0.0010575005],"genre_scores_gemma":[0.8997851,0.000014201377,0.09959463,0.00020701773,0.000032144555,0.00008431807,4.6934287e-7,0.000015609352,0.00026653288],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980226,0.000047497982,0.0005555146,0.0005474135,0.00039031162,0.00043667134],"domain_scores_gemma":[0.9987657,0.00023003403,0.00032128903,0.00021730855,0.00039651035,0.00006916128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001656331,0.0002394351,0.00031968445,0.0001390898,0.0004026433,0.0003542359,0.0008816136,0.00012074695,0.00017685092],"category_scores_gemma":[0.0021368433,0.00018658409,0.000067288725,0.00039815332,0.0002857175,0.0002081987,0.00033874137,0.00028945308,0.000032684984],"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.00013503604,0.000028962217,0.000026972426,0.000109114866,0.0000054034094,2.1132584e-7,0.00075012876,0.0805196,0.7030053,0.21051966,0.000008116999,0.0048914663],"study_design_scores_gemma":[0.000019356989,0.000097018696,0.0000025457025,0.00027551898,0.000013735205,8.171025e-7,0.00029131197,0.47144523,0.4557358,0.07200533,0.000008848059,0.000104471445],"about_ca_topic_score_codex":0.00008797011,"about_ca_topic_score_gemma":0.0000015507993,"teacher_disagreement_score":0.6423256,"about_ca_system_score_codex":0.000046900903,"about_ca_system_score_gemma":0.00009147575,"threshold_uncertainty_score":0.76086783},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14201076,0.000037287893,0.8241848,0.018269993,0.0007707653,0.0007085774,0.0000049534983,0.00020550725,0.013807373],"genre_scores_gemma":[0.9886951,0.000006682264,0.010625902,0.000519666,0.000022694325,0.000051856143,0.0000013242346,0.0000059111967,0.0000708645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998147,0.00003971496,0.0006886079,0.00050646,0.0003589953,0.00025918562],"domain_scores_gemma":[0.99826306,0.00023976289,0.00038913148,0.00037466272,0.00068173005,0.00005165415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008103742,0.00017238063,0.00019672149,0.00030737568,0.00030138218,0.00023637393,0.0017740559,0.000104192295,0.000015548],"category_scores_gemma":[0.0008604208,0.00015890082,0.00007551725,0.0017652947,0.0002518792,0.00034777963,0.0001870627,0.00033143206,0.000025969472],"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.000008787762,0.00013239664,0.0009152325,0.000042889882,0.000004521387,8.76229e-8,0.00088553585,0.0013379008,0.025949059,0.94621706,0.000062035004,0.024444496],"study_design_scores_gemma":[0.000029922263,0.000027227527,0.0015354258,0.00029268832,0.0000040186146,4.479178e-7,0.00021477675,0.5737259,0.26321998,0.16076937,0.000068441,0.00011182104],"about_ca_topic_score_codex":0.000087572604,"about_ca_topic_score_gemma":0.00003690324,"teacher_disagreement_score":0.84668434,"about_ca_system_score_codex":0.00011917907,"about_ca_system_score_gemma":0.00026176844,"threshold_uncertainty_score":0.6479787},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30982998,0.00015579425,0.49849835,0.009845656,0.00803119,0.0022268353,0.000009607877,0.0008989543,0.17050365],"genre_scores_gemma":[0.97809726,0.000015688349,0.01891105,0.00032470125,0.00019322267,0.00002888688,4.2309685e-7,0.00002332553,0.0024054376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99678195,0.000091383845,0.00092883076,0.0009455635,0.00065188063,0.00060041744],"domain_scores_gemma":[0.9971749,0.00038554537,0.00064745394,0.00066507515,0.0010042053,0.00012281408],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013671516,0.00043623397,0.0005274228,0.00037572964,0.00050189,0.00042453792,0.0039876862,0.0002232732,0.00007639343],"category_scores_gemma":[0.003040531,0.00033958344,0.00026181753,0.001574429,0.00045401967,0.0006591651,0.0015219628,0.0008280025,0.00018156612],"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.00018986994,0.00020932958,0.0013447647,0.00007391732,0.000046119178,0.0000019663323,0.0019798176,0.00069648493,0.009177715,0.84975183,0.00031614117,0.13621204],"study_design_scores_gemma":[0.0002562227,0.00021591547,0.00074239756,0.00094156386,0.00007262481,0.00001598157,0.000893067,0.59174,0.28772014,0.11217835,0.0045210123,0.0007027287],"about_ca_topic_score_codex":0.0001010025,"about_ca_topic_score_gemma":0.000029502511,"teacher_disagreement_score":0.7375735,"about_ca_system_score_codex":0.00014693041,"about_ca_system_score_gemma":0.00044051022,"threshold_uncertainty_score":0.99990565},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8380861,0.00035481065,0.113728,0.004486583,0.0012218156,0.00063403096,0.000026528263,0.00040514735,0.041056957],"genre_scores_gemma":[0.99263656,0.000082196166,0.0070711765,0.000051872306,0.000024724306,0.000009420828,7.4998496e-7,0.000010450423,0.000112834714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989802,0.000006601272,0.00043023433,0.00019954429,0.00020989391,0.00017349518],"domain_scores_gemma":[0.99913466,0.0000783488,0.00011292539,0.00015466398,0.00047613098,0.000043291864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003283213,0.00014316381,0.00021566189,0.0001482301,0.0000791621,0.00017484129,0.00058910955,0.00010280848,0.000047714133],"category_scores_gemma":[0.00073027605,0.00011691015,0.000060670023,0.0005328296,0.00019143877,0.00030378977,0.00014550217,0.00026906503,0.000004481615],"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.00005025913,0.00008470783,0.0022921208,0.00042366088,0.00005812444,1.0147093e-7,0.0010335349,0.00288053,0.008371436,0.864432,0.0001789672,0.12019457],"study_design_scores_gemma":[0.000027612772,0.000022369797,0.00042348108,0.00042593668,0.000018856768,4.7176863e-7,0.0011456759,0.5065613,0.44788024,0.043326885,0.000049708364,0.000117467476],"about_ca_topic_score_codex":0.000015274216,"about_ca_topic_score_gemma":0.0000027699125,"teacher_disagreement_score":0.8211051,"about_ca_system_score_codex":0.000018650286,"about_ca_system_score_gemma":0.000042703068,"threshold_uncertainty_score":0.47674575},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6680882,0.000061546816,0.32575092,0.002584704,0.00043682838,0.00053511345,0.000002848356,0.0001055788,0.0024342495],"genre_scores_gemma":[0.9925431,0.000018896968,0.0070876866,0.00017250807,0.00005799003,0.00002435748,0.0000012844855,0.000010289381,0.000083914994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998251,0.000036266665,0.00061327126,0.00049210165,0.0003235741,0.0002837569],"domain_scores_gemma":[0.9983096,0.000086490196,0.0004315278,0.0004343779,0.0006816101,0.000056356428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004350749,0.00020995458,0.00027038783,0.00023098683,0.0002626746,0.00016770628,0.0018424719,0.00010497318,0.000019835612],"category_scores_gemma":[0.0002971167,0.0001735795,0.0001307833,0.0013724328,0.00027163237,0.00034283934,0.00043231103,0.00038349774,0.0000060408083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027882765,0.00013464228,0.0018540173,0.00004804135,0.000021070317,1.5822015e-7,0.00044139463,0.026225273,0.18168123,0.71184987,0.000052612464,0.07766382],"study_design_scores_gemma":[0.00002545827,0.000045848243,0.0006784121,0.00010820249,0.000013369724,0.0000014385894,0.00006372348,0.7871101,0.19504419,0.016782876,0.000008948868,0.00011747835],"about_ca_topic_score_codex":0.00034493775,"about_ca_topic_score_gemma":0.000012851361,"teacher_disagreement_score":0.76088476,"about_ca_system_score_codex":0.00003955113,"about_ca_system_score_gemma":0.000099915465,"threshold_uncertainty_score":0.7078366},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10852998,0.000019352958,0.8792162,0.0035464857,0.00016501128,0.0005812545,0.000021288222,0.00006609681,0.007854334],"genre_scores_gemma":[0.9782065,0.000030902,0.021203162,0.00003360197,0.000008001275,0.00001991064,0.0000024422216,0.000006721462,0.00048873323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768835,0.000044799883,0.00058948615,0.0004935312,0.00082726596,0.0003565478],"domain_scores_gemma":[0.99701166,0.00015680924,0.0002728734,0.00044797952,0.002032881,0.0000778046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009954114,0.00018898731,0.0003071288,0.00018629785,0.00016508478,0.00017974208,0.0022021274,0.00008118456,0.000051398056],"category_scores_gemma":[0.0005520466,0.00013389431,0.000088812354,0.0018786888,0.0005815822,0.00031786071,0.0005292526,0.0003375562,0.000017189941],"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.0001443747,0.0002287799,0.00053406524,0.00011404581,0.00003081423,4.619327e-7,0.00023558518,0.0017552692,0.00601624,0.95976835,0.00005672539,0.03111528],"study_design_scores_gemma":[0.000048993643,0.00021432556,0.0017888697,0.00020722277,0.000013149127,0.0000022418867,0.00018861769,0.67889494,0.29670385,0.021781407,0.000018233673,0.0001381491],"about_ca_topic_score_codex":0.00005762172,"about_ca_topic_score_gemma":0.0000058531364,"teacher_disagreement_score":0.93798697,"about_ca_system_score_codex":0.00008557353,"about_ca_system_score_gemma":0.00035702254,"threshold_uncertainty_score":0.5460052},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.105293505,0.0003354947,0.49342597,0.041407496,0.005254003,0.0026214279,0.000019756535,0.0009426409,0.35069972],"genre_scores_gemma":[0.98766494,0.000060662762,0.009555584,0.0010969243,0.000060274724,0.000057994937,5.039196e-7,0.00001571922,0.0014874027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99665076,0.00003955264,0.001052794,0.00084304134,0.0007098761,0.0007039705],"domain_scores_gemma":[0.99701786,0.0002406716,0.0004576705,0.0007408692,0.0014058249,0.00013711788],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009517808,0.00038753435,0.0004445881,0.0003586949,0.000496388,0.0005838015,0.003894279,0.00016466365,0.00010468491],"category_scores_gemma":[0.000942848,0.0003111686,0.00025005554,0.0018704378,0.0005080699,0.00078910636,0.001025868,0.00049841637,0.00021198248],"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.000044588094,0.00015967953,0.00020149519,0.00005239808,0.000032272317,0.0000017637396,0.000874889,0.00033201577,0.029389944,0.90661734,0.00086647103,0.061427113],"study_design_scores_gemma":[0.000021878588,0.00012244668,0.00008881649,0.0003749323,0.000019604751,0.0000051683974,0.0008271053,0.11495341,0.6455421,0.23684153,0.00092448364,0.00027853533],"about_ca_topic_score_codex":0.00014515186,"about_ca_topic_score_gemma":0.000060900937,"teacher_disagreement_score":0.8823714,"about_ca_system_score_codex":0.00014085998,"about_ca_system_score_gemma":0.00035700618,"threshold_uncertainty_score":0.999934},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021607801,0.00003784843,0.9725189,0.0021179153,0.0010671725,0.0011873855,0.00010316912,0.00015293514,0.0012068562],"genre_scores_gemma":[0.98701966,0.00001783125,0.011808418,0.0003060412,0.000065689645,0.00018391295,0.0000052405753,0.00001692124,0.0005762945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99755424,0.00002074074,0.00063336414,0.00077445287,0.0004593152,0.00055787346],"domain_scores_gemma":[0.99740046,0.000398376,0.00033152083,0.0004948088,0.0012726791,0.00010217962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004988272,0.00027567052,0.0003333418,0.00023096982,0.0004975112,0.00064424716,0.002775413,0.0000928157,0.000031146606],"category_scores_gemma":[0.0010386256,0.00023650353,0.0001578558,0.0007787852,0.00036522865,0.00097068463,0.00096436037,0.00040448617,0.000032763244],"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.0006739877,0.0005739104,0.00025137322,0.00045301148,0.00020679586,0.0000058783744,0.0013480771,0.0075076614,0.07822114,0.59842795,0.001140125,0.3111901],"study_design_scores_gemma":[0.000060587394,0.00013145324,0.00003520874,0.00031124018,0.000010692251,0.000005456627,0.00021107923,0.518326,0.4274079,0.05259284,0.0007202779,0.00018729565],"about_ca_topic_score_codex":0.00002545241,"about_ca_topic_score_gemma":0.000014748065,"teacher_disagreement_score":0.96541184,"about_ca_system_score_codex":0.00015662445,"about_ca_system_score_gemma":0.00017672316,"threshold_uncertainty_score":0.96443343},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07357778,0.000100220896,0.8632607,0.013973433,0.0015090492,0.00084809534,0.0000058093933,0.00046899312,0.04625596],"genre_scores_gemma":[0.99123925,0.00012084444,0.0074001034,0.0005258651,0.000041379593,0.00004631153,0.0000010067528,0.000012888247,0.00061237416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99753433,0.000042511554,0.00065620284,0.0007431342,0.00050313125,0.0005206794],"domain_scores_gemma":[0.9981456,0.00012722227,0.00045459837,0.00046112214,0.000719044,0.00009242332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063651236,0.000289427,0.00031817862,0.00033477647,0.00044033516,0.00029393184,0.002595316,0.00014973833,0.000022253824],"category_scores_gemma":[0.00042097282,0.0002289865,0.00020157536,0.0024402947,0.0002956446,0.00058618793,0.00058916456,0.00070679263,0.000031505886],"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.000042290176,0.00012175675,0.0010276805,0.00003105398,0.000016388069,3.814381e-7,0.00062529877,0.00038188483,0.026601529,0.92679274,0.00026272138,0.04409627],"study_design_scores_gemma":[0.000051933202,0.000112344576,0.003023034,0.00035143012,0.000019423966,0.0000026392995,0.00074689055,0.267119,0.22869593,0.49915844,0.00041611085,0.000302826],"about_ca_topic_score_codex":0.00002190038,"about_ca_topic_score_gemma":0.000021976355,"teacher_disagreement_score":0.9176614,"about_ca_system_score_codex":0.000048862308,"about_ca_system_score_gemma":0.0001193234,"threshold_uncertainty_score":0.9337798},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013334763,0.00001018296,0.95293164,0.004053803,0.001420654,0.00067127147,0.000004337587,0.00009848517,0.027474837],"genre_scores_gemma":[0.9910348,0.0000059089934,0.007559478,0.00034711108,0.000050125564,0.000043230324,0.0000012414527,0.000004973319,0.00095311884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99890184,0.000008990495,0.0004186538,0.0002999511,0.00018621975,0.00018436633],"domain_scores_gemma":[0.9988864,0.00011833755,0.00025518157,0.00014854949,0.0005646076,0.000026928616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003685198,0.000120659875,0.0001366926,0.00013946039,0.00015938423,0.00036307643,0.00081604574,0.000041692307,0.000010262825],"category_scores_gemma":[0.0004304703,0.00009829298,0.00007105056,0.00055007864,0.00005650409,0.0006480504,0.00016196315,0.00009901917,0.000014577519],"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.000028676792,0.000029213874,0.000083937244,0.000029165038,0.0000063787033,1.3804216e-8,0.00025460392,0.0000034620484,0.03967233,0.65466326,0.0005916554,0.30463728],"study_design_scores_gemma":[0.000037627047,0.00012561014,0.00014770216,0.00034239158,0.000009315363,7.895143e-7,0.00031365897,0.3044251,0.4913467,0.20283334,0.0003088899,0.0001089136],"about_ca_topic_score_codex":0.000012306771,"about_ca_topic_score_gemma":0.0000021636813,"teacher_disagreement_score":0.97770005,"about_ca_system_score_codex":0.00004394268,"about_ca_system_score_gemma":0.000060988583,"threshold_uncertainty_score":0.4008271},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02907739,0.000040719715,0.8448326,0.010560726,0.002435349,0.0014332414,0.0000061439823,0.00023135525,0.11138246],"genre_scores_gemma":[0.9829701,0.000029278835,0.014704201,0.00091806555,0.000096123345,0.00007688574,0.0000026831501,0.000013269945,0.0011893602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997167,0.00006703977,0.0008510265,0.00079700607,0.00061743293,0.0005004946],"domain_scores_gemma":[0.99791294,0.00015832244,0.00061350595,0.0005301403,0.00067017047,0.000114927905],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014269158,0.00029736283,0.0003484257,0.00018024955,0.00060244155,0.001133136,0.004466613,0.00015186617,0.00009143279],"category_scores_gemma":[0.0003067421,0.0002463047,0.00015595018,0.0014752898,0.00038715324,0.00075032806,0.0011856884,0.00039557894,0.00010815824],"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.00014779813,0.00012712882,0.00048225452,0.000023060162,0.000031045165,3.899737e-7,0.00095192756,0.000838465,0.016230442,0.9529831,0.0007078735,0.02747654],"study_design_scores_gemma":[0.0002269211,0.00016441596,0.0023354224,0.00037814485,0.000024264253,0.0000027247895,0.00080186746,0.11697521,0.08063309,0.7920626,0.0059416085,0.00045372723],"about_ca_topic_score_codex":0.00005994772,"about_ca_topic_score_gemma":0.00001948938,"teacher_disagreement_score":0.95389277,"about_ca_system_score_codex":0.00011790949,"about_ca_system_score_gemma":0.00025779416,"threshold_uncertainty_score":0.9999989},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.561322,0.00027886726,0.0003506624,0.033446383,0.0028874504,0.0012392234,0.000025065832,0.00015852337,0.40029186],"genre_scores_gemma":[0.99438345,0.0000405638,0.00014897919,0.0011550066,0.00011667348,0.000046101566,8.989463e-7,0.000014174737,0.0040941234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982509,0.00003573339,0.00070738734,0.00040696762,0.00023835355,0.00036065988],"domain_scores_gemma":[0.99864995,0.00017995363,0.00036239656,0.00020889325,0.0005597499,0.00003904547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007184475,0.00022933277,0.00038347993,0.0001781094,0.00031145941,0.00020015545,0.00068507163,0.00010051275,0.0001328972],"category_scores_gemma":[0.00037876502,0.00018336874,0.00012283055,0.00021308914,0.0011742796,0.00024675354,0.00014312718,0.00054712035,0.00005370348],"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.000057145146,0.000100441284,0.0005318041,0.00020895622,0.000020002426,6.1879626e-7,0.014343416,0.00000809183,0.005502431,0.97531646,0.00033942272,0.0035712232],"study_design_scores_gemma":[0.00009178662,0.00015364308,0.00022527897,0.003945687,0.000063350475,0.0000034578688,0.028716655,0.0021424314,0.1101001,0.85104585,0.0030539378,0.0004578364],"about_ca_topic_score_codex":0.00039481686,"about_ca_topic_score_gemma":0.0006055246,"teacher_disagreement_score":0.4330615,"about_ca_system_score_codex":0.00007355707,"about_ca_system_score_gemma":0.00016200199,"threshold_uncertainty_score":0.74775606},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51502997,0.00047346583,0.4160715,0.019822303,0.004387294,0.002508254,0.00001028641,0.0008109406,0.04088597],"genre_scores_gemma":[0.99697834,0.00013880766,0.0016686822,0.0007436723,0.00005823693,0.000050507304,4.1824637e-7,0.000014267829,0.0003470367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99736744,0.00004022647,0.0007539499,0.0007847088,0.00043771346,0.0006159364],"domain_scores_gemma":[0.9981404,0.00038358037,0.0004429542,0.0002929843,0.000654336,0.00008576097],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055712246,0.00035881152,0.0004594194,0.0004765165,0.00034434555,0.00032651398,0.0023325742,0.00014578878,0.000019291349],"category_scores_gemma":[0.00087446714,0.00025310554,0.0001663994,0.0016330834,0.00044942703,0.00081886706,0.00065552525,0.0008642766,0.000008333774],"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.00010919578,0.00013456144,0.005575524,0.0000681353,0.000031742307,0.000001795065,0.0016895538,0.0011914173,0.020522328,0.8064326,0.00021384683,0.16402929],"study_design_scores_gemma":[0.00009273865,0.0002415073,0.0016100081,0.0015748183,0.000015873642,0.000002897048,0.0018037992,0.07314773,0.5490723,0.371456,0.00049946556,0.00048283522],"about_ca_topic_score_codex":0.00005760627,"about_ca_topic_score_gemma":0.00012033958,"teacher_disagreement_score":0.52855,"about_ca_system_score_codex":0.00008129715,"about_ca_system_score_gemma":0.00009667922,"threshold_uncertainty_score":0.99999213},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009464645,0.00001722302,0.97379255,0.0064415326,0.00044292415,0.0009170289,0.0000055965756,0.00024804604,0.008670469],"genre_scores_gemma":[0.98660654,0.00001900815,0.012027331,0.00032036082,0.00009196309,0.00011504544,0.0000010222515,0.000010377559,0.00080833136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981815,0.000015567008,0.00058115885,0.000521651,0.00036891177,0.00033116824],"domain_scores_gemma":[0.99806243,0.00013132472,0.0003804188,0.0002643742,0.0011052978,0.000056181972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057329325,0.00021289816,0.00025261598,0.00016656173,0.00031934655,0.00033982968,0.0017681556,0.00010044122,0.000021101781],"category_scores_gemma":[0.00068006414,0.00016040378,0.00015678657,0.00080851594,0.00025724285,0.00046322364,0.00044688597,0.00021788478,0.000024681307],"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.000030877163,0.00013307965,0.000034901306,0.00007144951,0.000006966989,9.941569e-8,0.00023731332,1.5376126e-7,0.27839938,0.56225467,0.0003699674,0.15846114],"study_design_scores_gemma":[0.000025798206,0.00012062717,0.00020533762,0.0002038333,0.000008965678,0.0000014019641,0.0001080766,0.06633553,0.74302125,0.1894681,0.00037102785,0.00013007515],"about_ca_topic_score_codex":0.000020323123,"about_ca_topic_score_gemma":0.0000018491241,"teacher_disagreement_score":0.9771419,"about_ca_system_score_codex":0.000056385128,"about_ca_system_score_gemma":0.00010757842,"threshold_uncertainty_score":0.6541077},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00996799,0.000029602312,0.9825762,0.0036533764,0.0002718432,0.00080429425,0.0000040779323,0.0002945426,0.0023980779],"genre_scores_gemma":[0.9079399,0.000035783898,0.09141234,0.00024432404,0.00003137752,0.00017855506,0.000003460889,0.000013745047,0.00014046789],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979496,0.000020151021,0.00057701126,0.0006943544,0.00038668633,0.0003721954],"domain_scores_gemma":[0.9978183,0.00018702743,0.00056796556,0.00051464734,0.0008572853,0.000054774042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067044405,0.0002536949,0.0002772868,0.00024875026,0.00041285026,0.0003474368,0.0021494783,0.00010998971,0.0000054326847],"category_scores_gemma":[0.00048542937,0.00018010814,0.000083566985,0.0010034874,0.00020370501,0.0006485446,0.00027841565,0.00027465067,0.000007003294],"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.000076238764,0.000068142646,0.00036099902,0.000069021604,0.000010913028,7.443377e-8,0.00030353773,0.000014737972,0.18573654,0.68687385,0.00012418834,0.12636176],"study_design_scores_gemma":[0.000062502506,0.00011274087,0.00049838977,0.0009161977,0.000015611526,0.0000017718103,0.00048442069,0.22729757,0.6488579,0.121275835,0.00025636228,0.00022069392],"about_ca_topic_score_codex":0.000008727158,"about_ca_topic_score_gemma":0.0000046035093,"teacher_disagreement_score":0.8979719,"about_ca_system_score_codex":0.00013081786,"about_ca_system_score_gemma":0.00011020117,"threshold_uncertainty_score":0.7344597},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3702855,0.000029063742,0.6252293,0.0007481,0.00020804735,0.00021755879,0.000002133569,0.000031246684,0.0032490366],"genre_scores_gemma":[0.9917031,0.00001959901,0.0079898555,0.00021115212,0.00000949565,0.0000050623485,5.2541867e-7,0.0000040120194,0.00005722315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986408,0.000031332806,0.00046219357,0.00033470558,0.0003280196,0.00020299444],"domain_scores_gemma":[0.9990982,0.00003055027,0.0002574867,0.00011943753,0.00043829132,0.000056048513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000343313,0.00014986806,0.0002032738,0.00009560749,0.00019752173,0.0001727884,0.00057995855,0.000065561304,0.000012446795],"category_scores_gemma":[0.00010393618,0.00012302118,0.00005346385,0.00082107494,0.00024771784,0.00023426622,0.00025155782,0.000095751784,0.0000030325461],"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.000042158197,0.00007838175,0.0011232963,0.000040495244,0.000018497534,2.0620298e-7,0.0006567539,0.0006898791,0.037676796,0.91154677,0.000020129733,0.04810666],"study_design_scores_gemma":[0.00008632016,0.000092062066,0.0008958014,0.00028491093,0.00001398896,0.0000025383044,0.0012132748,0.64376396,0.2054708,0.14796525,0.000057872443,0.0001532137],"about_ca_topic_score_codex":0.00007566408,"about_ca_topic_score_gemma":0.000009025757,"teacher_disagreement_score":0.7635815,"about_ca_system_score_codex":0.00007557218,"about_ca_system_score_gemma":0.000103996725,"threshold_uncertainty_score":0.50166583},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06174158,0.00017846344,0.78806907,0.13293484,0.0013995519,0.0021132403,0.000043658838,0.0011426975,0.012376913],"genre_scores_gemma":[0.96159667,0.00013936339,0.036563087,0.0006025152,0.00003450425,0.00014419944,0.0000051176035,0.00001609239,0.00089842186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99766845,0.00003097307,0.0006520269,0.00074216264,0.00045215525,0.00045424455],"domain_scores_gemma":[0.99608094,0.0002843046,0.000537483,0.0018070831,0.0012314795,0.000058695965],"candidate_categories":["metaresearch","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00089583074,0.00027746215,0.00035408992,0.0002334936,0.0004997578,0.00057562644,0.019689707,0.00018275729,0.00003303622],"category_scores_gemma":[0.028153418,0.0002270948,0.00014148987,0.0009867869,0.0004875321,0.0005147253,0.015912727,0.00047168968,0.00002916391],"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.00010677436,0.00007532851,0.0001339426,0.000067463865,0.00003458928,2.3380288e-7,0.0001949417,0.00001782385,0.018741129,0.8958461,0.013957786,0.07082387],"study_design_scores_gemma":[0.00008441821,0.000098797915,0.00002726789,0.00024275451,0.000012933188,0.0000011893437,0.00025931105,0.20205638,0.33664623,0.45739484,0.0030166989,0.00015918269],"about_ca_topic_score_codex":0.000037043985,"about_ca_topic_score_gemma":0.0000110472165,"teacher_disagreement_score":0.89985514,"about_ca_system_score_codex":0.00010739728,"about_ca_system_score_gemma":0.00019518474,"threshold_uncertainty_score":0.99204636},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18438147,0.00005509119,0.8060506,0.002029625,0.0009163314,0.0009976833,0.000008233383,0.00015715443,0.005403785],"genre_scores_gemma":[0.9025081,0.000010710679,0.09714217,0.000059725106,0.00001584988,0.000036589445,3.0276314e-7,0.000007391689,0.00021919108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976179,0.00003258868,0.00083813095,0.0006195518,0.0004986267,0.00039321405],"domain_scores_gemma":[0.99800533,0.00014064992,0.00052534963,0.0004916991,0.00076660706,0.000070348804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010499475,0.00025070732,0.00039292936,0.00021401492,0.00017249679,0.0001381757,0.0027033614,0.00011782177,0.000010956529],"category_scores_gemma":[0.0007804161,0.00019358663,0.00015230011,0.0011441293,0.0003874037,0.0003277521,0.0007530882,0.00035924366,0.00001792339],"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.00004708881,0.00072302745,0.0031605037,0.00033297428,0.00004958779,8.318165e-7,0.0041641546,0.0038076108,0.06527005,0.8321493,0.000077800614,0.090217024],"study_design_scores_gemma":[0.00005214963,0.0001561737,0.0013425509,0.00063132093,0.000014606373,0.0000022881748,0.00045265068,0.49308074,0.4671392,0.036906425,0.000025711313,0.00019619688],"about_ca_topic_score_codex":0.000050187176,"about_ca_topic_score_gemma":0.0000015995748,"teacher_disagreement_score":0.7952429,"about_ca_system_score_codex":0.00008111367,"about_ca_system_score_gemma":0.000200105,"threshold_uncertainty_score":0.7894234},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10847386,0.00012618233,0.8438176,0.006426905,0.0013706114,0.0015611697,0.000013493206,0.00044132626,0.037768867],"genre_scores_gemma":[0.9760986,0.000052666936,0.021920918,0.00035402074,0.00003389462,0.000027007594,8.1942403e-7,0.000011779456,0.0015002842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977339,0.000013179998,0.0005166484,0.0006615615,0.00062244275,0.0004522856],"domain_scores_gemma":[0.99831426,0.00010269015,0.00038392516,0.00046736488,0.00067376904,0.0000579773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007229444,0.00027838445,0.00030562092,0.0005020385,0.0003070695,0.00072624953,0.00318663,0.00007057787,0.000020782052],"category_scores_gemma":[0.0003726994,0.00019399045,0.00007459586,0.0032430054,0.00024892096,0.00090245856,0.00086541695,0.00031005827,0.00007372983],"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.000038746268,0.00033104737,0.0012080573,0.00011242514,0.00005710231,0.0000014387912,0.0004527428,0.000018994046,0.0046367073,0.7530141,0.00035193062,0.23977673],"study_design_scores_gemma":[0.0002094165,0.0003375847,0.0011514495,0.0010448827,0.000076624376,0.000004168106,0.0011980705,0.6247524,0.3426178,0.027437665,0.0005501999,0.00061969896],"about_ca_topic_score_codex":0.0000745284,"about_ca_topic_score_gemma":0.00002433277,"teacher_disagreement_score":0.86762476,"about_ca_system_score_codex":0.000055544577,"about_ca_system_score_gemma":0.00013196556,"threshold_uncertainty_score":0.7910701},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93768674,0.0004387338,0.05443122,0.0006837178,0.0012455701,0.002274478,0.000018629777,0.00009659496,0.0031242918],"genre_scores_gemma":[0.99932855,0.00011969185,0.00033177846,0.000021659805,0.000027314856,0.00009958799,6.5401713e-7,0.0000096317835,0.000061115505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892765,0.0000049693936,0.0005261641,0.00017321299,0.00014372288,0.00022428158],"domain_scores_gemma":[0.99939364,0.00017421333,0.0001281115,0.00010099597,0.00017603164,0.00002699059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024546208,0.00014706037,0.0003094446,0.00016135212,0.000023848168,0.000013234583,0.00039608672,0.000059557726,0.000006446174],"category_scores_gemma":[0.00016647254,0.00011841731,0.00011754809,0.0003737278,0.000084444,0.000048785623,0.00007986523,0.00012438511,0.0000010021666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030606752,0.00034729784,0.00032207122,0.0017370175,0.000111029294,2.509069e-7,0.000644255,0.19260234,0.071316116,0.5665136,0.00034614134,0.16575383],"study_design_scores_gemma":[0.00010949769,0.00013572244,0.001678883,0.0005939407,0.000040450956,8.462016e-8,0.0001547603,0.6810404,0.30007684,0.015959835,0.000101147394,0.000108471715],"about_ca_topic_score_codex":0.00002425793,"about_ca_topic_score_gemma":0.000024733923,"teacher_disagreement_score":0.55055374,"about_ca_system_score_codex":0.000033817923,"about_ca_system_score_gemma":0.000019519735,"threshold_uncertainty_score":0.48289177},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023673438,0.000059907426,0.9578586,0.0018541786,0.00080046814,0.0014912196,0.000012657266,0.000112416325,0.014137078],"genre_scores_gemma":[0.98921615,0.000013243837,0.009060289,0.00018350068,0.00004622518,0.00025148861,0.0000017327637,0.000009439591,0.0012179544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982055,0.000024058576,0.0005978672,0.00051983877,0.0003609826,0.0002917684],"domain_scores_gemma":[0.99819624,0.000104956445,0.0004400204,0.00034615106,0.0008662287,0.000046423735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084662746,0.0002039938,0.00027532672,0.00019889287,0.00023523622,0.00032032988,0.0019131603,0.000086853026,0.000016212673],"category_scores_gemma":[0.000507595,0.0001560483,0.00020703871,0.00060317764,0.000089684254,0.00054529146,0.00047117664,0.00015849929,0.00001487182],"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.00007674335,0.00040097052,0.0001134522,0.00018394108,0.00005779047,5.364609e-8,0.0010547834,0.00003728866,0.01527258,0.9382647,0.0007330389,0.043804612],"study_design_scores_gemma":[0.00017314267,0.00024214495,0.00023313974,0.0006147953,0.00005416795,0.0000014199026,0.0012267423,0.314111,0.50211585,0.18053399,0.0004518003,0.00024181904],"about_ca_topic_score_codex":0.00011629359,"about_ca_topic_score_gemma":0.000018260924,"teacher_disagreement_score":0.9655427,"about_ca_system_score_codex":0.00007973677,"about_ca_system_score_gemma":0.00007411694,"threshold_uncertainty_score":0.6363465},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2724153,0.000014217986,0.7219353,0.00095593074,0.00010559445,0.00031384832,0.0000028157492,0.0001385918,0.004118433],"genre_scores_gemma":[0.9976167,0.000010349384,0.0020472805,0.00015853881,0.000011183443,0.00003511163,0.0000029047087,0.000010293953,0.0001076237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993261,0.000004237938,0.00027541962,0.00016544799,0.00011622248,0.0001125716],"domain_scores_gemma":[0.99948794,0.00004699692,0.00006271642,0.00007875232,0.00029630258,0.00002732019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012063006,0.000111222864,0.00010274496,0.00010059079,0.00014616155,0.00010977088,0.00014353424,0.000059434333,0.000015263036],"category_scores_gemma":[0.000087810484,0.00009895966,0.000031208845,0.00022700705,0.00005609863,0.00009279075,0.000026925141,0.000111234745,0.00000856576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002634169,0.000018552242,0.000020756264,0.000036541198,0.000008515948,1.090181e-8,0.00026295646,0.8885,0.02644767,0.057418104,0.00003627651,0.027224286],"study_design_scores_gemma":[0.000027437847,0.0000104739065,0.000012434914,0.00008294644,0.000011520462,1.935402e-7,0.000095699106,0.85616046,0.12065076,0.022852099,0.00002074809,0.00007524193],"about_ca_topic_score_codex":0.000009114519,"about_ca_topic_score_gemma":0.000017136372,"teacher_disagreement_score":0.7252014,"about_ca_system_score_codex":0.000031907766,"about_ca_system_score_gemma":0.00003767073,"threshold_uncertainty_score":0.40354577},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06284289,0.0000065571394,0.9209353,0.002842321,0.0013054165,0.001042704,0.00003389381,0.00015367662,0.010837246],"genre_scores_gemma":[0.99596417,0.0000031759273,0.0030463603,0.00035015857,0.00005076043,0.000116963,0.000004130946,0.000013369137,0.00045089368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978165,0.000024000608,0.00061633816,0.000659312,0.0004953293,0.00038848957],"domain_scores_gemma":[0.99824053,0.00030763523,0.00033207954,0.00030903428,0.00074839627,0.00006235208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005944449,0.0002875602,0.00034131762,0.00022038812,0.00033532354,0.00019280004,0.002195974,0.00012266097,0.000068171146],"category_scores_gemma":[0.00065123226,0.00022999154,0.00020331723,0.00061591394,0.00039949844,0.0004324417,0.00021771986,0.00041669392,0.000022361057],"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.00024224138,0.00014809382,0.00011558336,0.00010054754,0.000035544406,3.428922e-7,0.0005819937,0.0052256184,0.0043986985,0.981939,0.00015603598,0.0070562647],"study_design_scores_gemma":[0.00009013272,0.00023771424,0.00017484029,0.0004134793,0.000034023655,0.0000020989262,0.00023814221,0.21372443,0.10899293,0.67564225,0.00020219496,0.0002477669],"about_ca_topic_score_codex":0.000026690395,"about_ca_topic_score_gemma":0.000009699266,"teacher_disagreement_score":0.9331213,"about_ca_system_score_codex":0.000100454236,"about_ca_system_score_gemma":0.00024547728,"threshold_uncertainty_score":0.9378783},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009899742,0.0000419724,0.9392537,0.0050090803,0.00046115907,0.00044647534,0.0000015690672,0.000368023,0.04451828],"genre_scores_gemma":[0.90980947,0.000032928776,0.08886451,0.00046009332,0.000021606422,0.000022380878,2.2319357e-7,0.000006834967,0.0007819238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998363,0.000024503755,0.00048328185,0.0004952996,0.00034932082,0.00028455438],"domain_scores_gemma":[0.9983802,0.00009834687,0.0002949829,0.0003475445,0.0008231418,0.00005581047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043879816,0.00021092537,0.0002531235,0.00020841202,0.00024676975,0.00020568476,0.0019453438,0.0001019949,0.000021523487],"category_scores_gemma":[0.0002612867,0.0001588424,0.00011869722,0.0009997255,0.00019292728,0.0002887542,0.0006226207,0.00027479566,0.00003510903],"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.00006740603,0.00009883452,0.000021110713,0.0000133708445,0.000014651913,2.6676773e-7,0.00036144524,0.0017657547,0.0090316925,0.9584548,0.0013097579,0.028860934],"study_design_scores_gemma":[0.000026404483,0.00014708756,0.00003182324,0.0002785326,0.000008461088,0.0000019751003,0.000116413124,0.5077688,0.3453613,0.14598872,0.00011005206,0.0001604463],"about_ca_topic_score_codex":0.000022406532,"about_ca_topic_score_gemma":0.0000021082346,"teacher_disagreement_score":0.89990973,"about_ca_system_score_codex":0.00005052176,"about_ca_system_score_gemma":0.00012927769,"threshold_uncertainty_score":0.64774054},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53079414,0.00004335196,0.39521825,0.056967568,0.0005083974,0.0018347215,0.000085113155,0.00030597713,0.0142424675],"genre_scores_gemma":[0.9773187,0.000004186683,0.020350663,0.00056372787,0.000036447836,0.000035005505,0.0000017868753,0.000012857196,0.0016766204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976844,0.000015517156,0.0005737648,0.00071939453,0.00047564824,0.0005312663],"domain_scores_gemma":[0.9987026,0.000059818318,0.00024065378,0.00042239035,0.00044557446,0.00012894974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008016472,0.00028841925,0.00041378167,0.00038598516,0.00021541152,0.00070134044,0.0028457306,0.00008575705,0.000023712666],"category_scores_gemma":[0.0010001039,0.00023441736,0.00010883453,0.0024118985,0.00008224989,0.00054210046,0.0013300587,0.00029449712,0.000038416267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031703507,0.00029827154,0.0014393852,0.0001418103,0.000074767624,0.000004013931,0.0060586943,0.016761553,0.113173395,0.6308751,0.001892815,0.22896317],"study_design_scores_gemma":[0.000030458083,0.00019055633,0.00024628444,0.00055532256,0.00001721273,0.0000037616262,0.00036316563,0.76955444,0.1940115,0.034382243,0.0003118906,0.00033316598],"about_ca_topic_score_codex":0.000067091074,"about_ca_topic_score_gemma":0.00014785097,"teacher_disagreement_score":0.7527929,"about_ca_system_score_codex":0.00008716093,"about_ca_system_score_gemma":0.00012637244,"threshold_uncertainty_score":0.9559262},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.260096,0.00008823021,0.72958225,0.0022121626,0.0022283553,0.0008401427,0.0000042346032,0.00018501483,0.0047636256],"genre_scores_gemma":[0.99062324,0.00003763885,0.008752127,0.00007954988,0.000059403406,0.00002219984,5.8618383e-7,0.000017168652,0.00040811725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99721915,0.000075398064,0.001009306,0.000640829,0.0006178186,0.00043747618],"domain_scores_gemma":[0.9971718,0.0002764003,0.00082103966,0.00057669316,0.0010776665,0.000076371405],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009008119,0.00032962268,0.0005748445,0.00032510242,0.0003551695,0.00025026902,0.0030723757,0.00017425929,0.000012570357],"category_scores_gemma":[0.0010264923,0.00026147178,0.0001796087,0.0013196465,0.00036533552,0.00042705514,0.0010982172,0.00058334967,0.000016523338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000118433774,0.00037473242,0.0028015946,0.00076557626,0.00007217059,0.0000017159837,0.0016806782,0.1532414,0.07094132,0.7034424,0.000115638824,0.06644437],"study_design_scores_gemma":[0.00007297305,0.00006039083,0.00038244078,0.001373888,0.000024368,0.0000022770557,0.0010850999,0.8871174,0.10732788,0.002271853,0.00004356334,0.00023788797],"about_ca_topic_score_codex":0.00010194986,"about_ca_topic_score_gemma":0.000010245964,"teacher_disagreement_score":0.733876,"about_ca_system_score_codex":0.0000862822,"about_ca_system_score_gemma":0.000149586,"threshold_uncertainty_score":0.9999837},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52591497,0.000047339785,0.44924995,0.0043951645,0.00017878726,0.00088110665,0.00001101568,0.00022118338,0.019100504],"genre_scores_gemma":[0.98553205,0.000013105528,0.007183109,0.0003932708,0.00001642575,0.000030294144,5.4621086e-7,0.000009886088,0.006821292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984087,0.000018741153,0.0003554459,0.0005090158,0.00037101988,0.0003370989],"domain_scores_gemma":[0.9991385,0.000038810085,0.00017339613,0.00025704523,0.00030268182,0.00008956378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041824984,0.00020610845,0.0002456461,0.00014180821,0.00021716318,0.00017544649,0.0011182406,0.00006369364,0.00002676426],"category_scores_gemma":[0.00022589721,0.00015341383,0.00004396782,0.00044266667,0.0000820803,0.0004066264,0.00065186125,0.00023776403,0.000034584977],"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.00022064333,0.00017287115,0.0014383894,0.000108517524,0.00006559858,0.0000014479112,0.010948087,0.0035502927,0.026363762,0.9120553,0.0004613347,0.044613723],"study_design_scores_gemma":[0.00008269806,0.00022119534,0.00014773296,0.0005643808,0.00001935639,0.000003129851,0.001169218,0.87181413,0.09489543,0.03069519,0.0001565239,0.00023098112],"about_ca_topic_score_codex":0.000023038016,"about_ca_topic_score_gemma":0.0000102113245,"teacher_disagreement_score":0.8813601,"about_ca_system_score_codex":0.000037904265,"about_ca_system_score_gemma":0.000093025425,"threshold_uncertainty_score":0.62560344},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051619083,0.000027702225,0.891397,0.014591578,0.00092098274,0.0011007327,0.0000019227807,0.00035478608,0.03998623],"genre_scores_gemma":[0.9891695,0.000017757162,0.0064505413,0.00025228562,0.00003230325,0.00005390683,8.4308783e-7,0.000008029318,0.0040148706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998696,0.000020760055,0.00037356612,0.0004061998,0.00024284542,0.00026059363],"domain_scores_gemma":[0.99881554,0.00009528346,0.00027000046,0.00020857547,0.00056857266,0.000042045092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061091693,0.00015699721,0.00018287182,0.00018991179,0.0003392475,0.00023544142,0.0013173658,0.00008303844,0.000010408543],"category_scores_gemma":[0.0007528104,0.00012231508,0.00011357881,0.00090096844,0.00013064664,0.00026640468,0.00025139452,0.00023473104,0.000015540314],"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.000022778015,0.00005790968,0.00030565957,0.0000788848,0.00001178862,3.375936e-8,0.00084308104,0.0014016252,0.009312159,0.8798775,0.00029141488,0.10779716],"study_design_scores_gemma":[0.00003994191,0.00018247537,0.000117499454,0.00027394394,0.0000117055015,6.8103105e-7,0.00023381456,0.36954993,0.120192364,0.50762385,0.0016283109,0.0001454716],"about_ca_topic_score_codex":0.000026186597,"about_ca_topic_score_gemma":0.0000073437877,"teacher_disagreement_score":0.93755037,"about_ca_system_score_codex":0.00002573476,"about_ca_system_score_gemma":0.000083474784,"threshold_uncertainty_score":0.4987864},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19925104,0.000011574179,0.7705166,0.0070016542,0.0004973527,0.00027829208,9.704046e-7,0.000093590796,0.022348972],"genre_scores_gemma":[0.994682,0.000009926453,0.0040289783,0.00033388208,0.000024477062,0.000026338286,6.442344e-7,0.0000062216827,0.00088748935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982136,0.00007625164,0.0004635403,0.00044597196,0.00056449295,0.00023617236],"domain_scores_gemma":[0.99816155,0.00033076855,0.00045298893,0.00020829435,0.00081044063,0.000035924986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000740624,0.0001523802,0.0002046349,0.00016928923,0.00016589882,0.00028635628,0.0012292447,0.0000767068,0.000022672135],"category_scores_gemma":[0.0015596215,0.00013297304,0.00011856874,0.0010860251,0.000060407583,0.00041451358,0.00038953646,0.0003129973,0.00003611003],"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.00001889084,0.000072499635,0.00083376555,0.000026594576,0.00003410016,2.4000892e-7,0.00066153205,0.009323737,0.0908541,0.7172987,0.00013036719,0.1807455],"study_design_scores_gemma":[0.00001929554,0.000034469533,0.0008631524,0.000108561944,0.000009808808,2.6974575e-7,0.00014687554,0.1905385,0.59191996,0.21622977,0.000036796962,0.000092515445],"about_ca_topic_score_codex":0.00003139297,"about_ca_topic_score_gemma":0.0000041285757,"teacher_disagreement_score":0.795431,"about_ca_system_score_codex":0.00013890013,"about_ca_system_score_gemma":0.00010986778,"threshold_uncertainty_score":0.54224837},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00720834,0.000031454616,0.9758953,0.0019698644,0.00033341395,0.000465318,0.000009158247,0.00037120617,0.013715946],"genre_scores_gemma":[0.87243176,0.00004337161,0.12646617,0.00042024182,0.000030228812,0.00008229444,6.0654094e-7,0.00001255334,0.0005127852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978983,0.000027097798,0.00051682733,0.0006725115,0.00048843416,0.00039685797],"domain_scores_gemma":[0.9983474,0.00009697665,0.00026031013,0.00046898855,0.0007382107,0.000088103756],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046407062,0.00031779427,0.00032527116,0.00023988805,0.00019363879,0.00021301332,0.0028640972,0.00014445846,0.000014762577],"category_scores_gemma":[0.00008812229,0.00025536126,0.00012654164,0.0008856553,0.0002742149,0.0006556095,0.0006116152,0.00041865688,0.0000367163],"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.000034265795,0.000049717197,0.000014196211,0.000019117284,0.000024176737,0.0000011249194,0.00094123645,0.003258004,0.0131189125,0.93729836,0.00033149766,0.044909384],"study_design_scores_gemma":[0.000010977147,0.0000878508,0.00000509251,0.0001892323,0.0000062290933,0.00000289367,0.000051311636,0.37009916,0.296344,0.33286446,0.00018850532,0.00015027219],"about_ca_topic_score_codex":0.00008038272,"about_ca_topic_score_gemma":0.0000054668185,"teacher_disagreement_score":0.8652234,"about_ca_system_score_codex":0.00012510475,"about_ca_system_score_gemma":0.00024142358,"threshold_uncertainty_score":0.99998987},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3250795,0.00009478805,0.030461725,0.0027998302,0.00013286673,0.0004219733,0.000047588524,0.00014743018,0.6408143],"genre_scores_gemma":[0.9902788,0.0000724826,0.000634556,0.00012950653,0.00006548174,0.000056127676,0.0000036334989,0.000014873437,0.008744561],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99821454,0.0000014367921,0.000670909,0.00040169692,0.00030047868,0.00041091052],"domain_scores_gemma":[0.9988214,0.00013584939,0.0001958577,0.00022755272,0.0005415624,0.00007782117],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00016915865,0.00026314388,0.0003891698,0.000127786,0.0001994342,0.00012153039,0.0008740757,0.00018093365,0.0010200109],"category_scores_gemma":[0.00080119196,0.00020517527,0.00029697455,0.0008442932,0.00021668509,0.00014596643,0.000053546562,0.00031574335,0.000011624496],"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.00066657056,0.00035715243,0.00030785787,0.0011090889,0.00030928804,2.2521479e-7,0.0006747644,0.00043300638,0.55338943,0.43106675,0.0008912993,0.010794531],"study_design_scores_gemma":[0.00005484432,0.000023800128,0.0000021280393,0.00015717752,0.00015860237,6.727998e-7,0.001543934,0.11266533,0.7998734,0.08509802,0.00025000787,0.00017206921],"about_ca_topic_score_codex":0.000023751472,"about_ca_topic_score_gemma":0.0000047569247,"teacher_disagreement_score":0.6651993,"about_ca_system_score_codex":0.00012005963,"about_ca_system_score_gemma":0.00021524701,"threshold_uncertainty_score":0.9998932},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9917198,0.00003697301,0.00025235626,0.0011777473,0.00016742694,0.00022803959,0.000005168599,0.000004528709,0.0064079906],"genre_scores_gemma":[0.99912107,0.000022877453,0.00007252069,0.00021671497,0.000040541967,0.000027672791,0.000003157879,0.000004225476,0.00049121544],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99910206,0.000020278107,0.00035702073,0.00020368864,0.00014740932,0.0001695622],"domain_scores_gemma":[0.99939793,0.000043412143,0.00013963976,0.00017567382,0.00022855174,0.000014777598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039565895,0.00011256352,0.00014222374,0.0000681924,0.000103033904,0.00002395515,0.0006871621,0.00012902511,0.000029933955],"category_scores_gemma":[0.0004158821,0.00007309845,0.00009120132,0.00022766349,0.000266703,0.000008006429,0.00015860508,0.00017372891,0.0000029554485],"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.000315552,0.00025577223,0.026683373,0.000039987866,0.000020081792,3.978682e-7,0.00026390614,0.000018525225,0.75777364,0.20881206,0.0005370685,0.005279661],"study_design_scores_gemma":[0.00006436318,0.00024363109,0.024104258,0.00011033759,0.00003183923,0.0000028288591,0.0008860764,0.00037952594,0.9400666,0.033913646,0.000103464794,0.00009345496],"about_ca_topic_score_codex":0.00002490866,"about_ca_topic_score_gemma":0.00029557676,"teacher_disagreement_score":0.18229295,"about_ca_system_score_codex":0.000007789992,"about_ca_system_score_gemma":0.000077164965,"threshold_uncertainty_score":0.29808682},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08293705,0.000056288074,0.90605754,0.0004922902,0.00022872655,0.0007201175,0.0000044671624,0.0003839712,0.009119578],"genre_scores_gemma":[0.9475683,0.000092659066,0.051847722,0.00006271179,0.000028714063,0.00010013685,0.0000016476531,0.00002118015,0.00027693558],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990804,0.0000050393023,0.00030070738,0.0002180057,0.00015793034,0.00023788163],"domain_scores_gemma":[0.99921125,0.00005855634,0.00009542025,0.000096009564,0.0005094633,0.000029290277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027808847,0.000174526,0.00020400048,0.0001485102,0.00014629401,0.000044847406,0.00034540467,0.00009294082,0.000022558937],"category_scores_gemma":[0.00026974003,0.00013377286,0.000054360986,0.0003999838,0.00009946972,0.0001524681,0.000036965797,0.00023945066,0.0000021435508],"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.00038549362,0.0000913782,0.0009835728,0.00038506155,0.000103042126,1.4207772e-7,0.0005565927,0.3057669,0.4431963,0.16146696,0.0001863867,0.08687816],"study_design_scores_gemma":[0.000042534553,0.00010870086,0.000011265339,0.0002917603,0.000028486578,3.5034813e-7,0.00027047077,0.4178113,0.5731558,0.008078277,0.00008415785,0.00011684459],"about_ca_topic_score_codex":0.000002569304,"about_ca_topic_score_gemma":0.0000038350954,"teacher_disagreement_score":0.86463124,"about_ca_system_score_codex":0.00004801858,"about_ca_system_score_gemma":0.000035026584,"threshold_uncertainty_score":0.5455099},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47588918,0.00005662848,0.41970947,0.029168399,0.00036265244,0.0012026178,0.000005291884,0.00033979147,0.07326597],"genre_scores_gemma":[0.9868169,0.000009590896,0.011941034,0.00041734008,0.000021594724,0.0000784682,3.1772822e-7,0.00000827113,0.00070649973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99834955,0.000017081993,0.00038230314,0.0005475313,0.0004268632,0.00027668494],"domain_scores_gemma":[0.99864626,0.00011119345,0.00027243604,0.0005132727,0.0003922405,0.00006460001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033503282,0.00020163199,0.00020506894,0.0001358557,0.00022755764,0.00022867924,0.0022490139,0.000058926435,0.000038006037],"category_scores_gemma":[0.00020087868,0.0001375988,0.00006766708,0.0009588222,0.00022286641,0.00024623683,0.00043823916,0.0002984,0.00009327448],"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.00003386652,0.00015439911,0.00034476715,0.00002847185,0.000013506564,2.608549e-7,0.0009821545,0.00016464035,0.068745226,0.83930635,0.00011540629,0.090110965],"study_design_scores_gemma":[0.00003899115,0.0001974507,0.002219888,0.00044143063,0.000015320158,0.0000021544183,0.00042041228,0.11069067,0.82372636,0.06176519,0.0002397384,0.00024241133],"about_ca_topic_score_codex":0.00016377862,"about_ca_topic_score_gemma":0.00001294856,"teacher_disagreement_score":0.77754116,"about_ca_system_score_codex":0.00005499429,"about_ca_system_score_gemma":0.000110402885,"threshold_uncertainty_score":0.5611116},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20870724,0.000013244505,0.78815675,0.0008038804,0.0004929606,0.0005856076,0.00007372601,0.000033651613,0.0011329668],"genre_scores_gemma":[0.94351596,0.000020366195,0.056012254,0.000077145596,0.000052137217,0.000022145497,0.000013875558,0.000010987839,0.0002751236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99714255,0.000030900315,0.0010734608,0.00057203544,0.0008449388,0.00033612762],"domain_scores_gemma":[0.99640185,0.00028117857,0.00064009905,0.0002275297,0.0023734574,0.000075868804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015038722,0.00023801629,0.00035234247,0.0002436833,0.00054591923,0.00029707176,0.0010946605,0.00014683041,0.00011879819],"category_scores_gemma":[0.0018608078,0.00017411675,0.00019542809,0.0012167919,0.00029680794,0.0005096838,0.00009989839,0.0001960878,0.0000046923547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003247286,0.000049191964,0.0037488923,0.0000140916045,0.000021505448,1.8853163e-7,0.00030131702,0.84277266,0.0043252283,0.13604951,0.00017854628,0.012214124],"study_design_scores_gemma":[0.00005511588,0.00007081578,0.001000411,0.0001026911,0.000047197085,0.000002167226,0.00057107705,0.8401487,0.09149187,0.06629205,0.000039403956,0.0001785327],"about_ca_topic_score_codex":0.000048072103,"about_ca_topic_score_gemma":0.000011472507,"teacher_disagreement_score":0.73480874,"about_ca_system_score_codex":0.00008783424,"about_ca_system_score_gemma":0.00031239036,"threshold_uncertainty_score":0.7100275},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024974855,0.000051903124,0.9718378,0.00019432604,0.00014574885,0.0006556476,0.000009367262,0.000034071465,0.002096289],"genre_scores_gemma":[0.93050945,0.000027563356,0.06930432,0.000030423333,0.00001995629,0.000049422673,6.322052e-7,0.000010897157,0.000047369864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901056,0.000090272835,0.00046914705,0.00016015378,0.00015971693,0.00011012193],"domain_scores_gemma":[0.9948093,0.0044081723,0.00022662916,0.00014586998,0.00038800063,0.000022005821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002124456,0.00012323578,0.00022738034,0.000073031166,0.00013452025,0.00003966627,0.0003736082,0.00004747101,0.000008037547],"category_scores_gemma":[0.0051654945,0.00007821788,0.00005447621,0.00024081071,0.00039368015,0.00013813945,0.00005695891,0.00018564114,0.000001133705],"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.00024488065,0.00002879422,0.0000063653333,0.00023350492,0.000017487404,9.799605e-9,0.0011931162,0.008012989,0.0027952841,0.9317147,0.0000039563106,0.05574893],"study_design_scores_gemma":[0.00003062241,0.000035057827,0.000013051737,0.00020731609,0.000020671056,2.2793253e-7,0.0008214399,0.351156,0.06810157,0.57956535,0.000004564093,0.00004415442],"about_ca_topic_score_codex":7.263965e-7,"about_ca_topic_score_gemma":2.3598221e-7,"teacher_disagreement_score":0.90553457,"about_ca_system_score_codex":0.000025798425,"about_ca_system_score_gemma":0.000020123372,"threshold_uncertainty_score":0.61839527},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7473642,0.00014491282,0.088001154,0.0019239503,0.0012705559,0.0011283101,0.00000809065,0.00015981228,0.159999],"genre_scores_gemma":[0.97764724,0.000021945545,0.021891331,0.000072834315,0.000017101,0.000019645078,2.2162017e-7,0.000005781173,0.0003239154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980717,0.00006768018,0.00081915385,0.0004273569,0.00034139137,0.00027275164],"domain_scores_gemma":[0.9983975,0.00020226614,0.00051029585,0.00037468257,0.00047723367,0.00003800027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015118471,0.00018589811,0.00033803962,0.00031455135,0.00010313243,0.00010292482,0.002389827,0.000116979034,0.0000485531],"category_scores_gemma":[0.0012888634,0.0001493515,0.000101472004,0.0011520372,0.00046626682,0.00042935516,0.00044230607,0.00028340885,0.000027036871],"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.00007391188,0.00009988796,0.0003375066,0.00005494823,0.000009541981,8.657809e-8,0.0007567379,0.000017738459,0.059440646,0.8209092,0.000028816305,0.11827095],"study_design_scores_gemma":[0.00002840018,0.00010819431,0.0010738538,0.00043573664,0.00000843905,9.549786e-7,0.0003140399,0.019856902,0.6802426,0.2977774,0.000029297784,0.00012412641],"about_ca_topic_score_codex":0.0000413809,"about_ca_topic_score_gemma":0.0000052841765,"teacher_disagreement_score":0.620802,"about_ca_system_score_codex":0.000059083577,"about_ca_system_score_gemma":0.00020568563,"threshold_uncertainty_score":0.60903776},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8056579,0.00016283139,0.0047116852,0.0046880525,0.00059019035,0.0004763436,0.000030778097,0.000056150573,0.18362607],"genre_scores_gemma":[0.9982835,0.000016192005,0.00014593365,0.00014360817,0.000022819631,0.000019141715,3.4523404e-7,0.0000059639965,0.0013624979],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989052,0.0000063743314,0.00056052767,0.00030439667,0.000044015236,0.0001795074],"domain_scores_gemma":[0.9992808,0.00008015679,0.00030925748,0.00014381346,0.00014815912,0.00003780531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067965174,0.000122793,0.00024788076,0.0001502773,0.0001647816,0.00009566594,0.00040186816,0.000067073204,0.00008681885],"category_scores_gemma":[0.00051977043,0.00010819573,0.00006630406,0.00036111052,0.00033880217,0.000057356476,0.00009642884,0.00014791582,0.00009341316],"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.000019167011,0.00006376789,0.0017545336,0.000046598125,0.000014748944,3.7974818e-8,0.00052549277,0.00005086881,0.0018981124,0.9933638,0.00005205482,0.0022107975],"study_design_scores_gemma":[0.000054771575,0.00007909838,0.0019480513,0.00033403677,0.000012044871,0.000002100553,0.0016709282,0.027689222,0.05606051,0.91128814,0.0006457807,0.00021533312],"about_ca_topic_score_codex":0.000043670243,"about_ca_topic_score_gemma":0.000004202409,"teacher_disagreement_score":0.1926256,"about_ca_system_score_codex":0.000026150925,"about_ca_system_score_gemma":0.000028121369,"threshold_uncertainty_score":0.4412094},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029402322,0.00001586871,0.9873288,0.002996156,0.00049096433,0.0010660982,0.000007826864,0.00016636265,0.0049876417],"genre_scores_gemma":[0.630717,0.000062860614,0.36749926,0.00037598214,0.000044079192,0.00017128926,0.000002500058,0.000018143173,0.0011089405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978644,0.000024190485,0.0006509557,0.00065969495,0.0004008055,0.00039991736],"domain_scores_gemma":[0.9971876,0.00020862914,0.00051276153,0.0003952374,0.0016228639,0.00007288599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000413209,0.00028747314,0.00034305896,0.0002946713,0.0004321187,0.00031051008,0.001889648,0.0001329025,0.000019846939],"category_scores_gemma":[0.0011840195,0.00023148587,0.00015178267,0.0012160391,0.0002453596,0.00067320396,0.00055574585,0.00020286467,0.0000066858984],"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.00009722644,0.00013853349,0.00006112189,0.00006125571,0.00002258438,7.3945316e-8,0.0008738517,0.02264646,0.026204307,0.9039217,0.00009586475,0.04587701],"study_design_scores_gemma":[0.00008133779,0.00008586214,0.000043009073,0.00022337539,0.000013419092,7.8453314e-7,0.0002529833,0.6294992,0.26813352,0.1014357,0.000065870765,0.00016491495],"about_ca_topic_score_codex":0.00002088391,"about_ca_topic_score_gemma":0.0000044628773,"teacher_disagreement_score":0.802486,"about_ca_system_score_codex":0.000109440116,"about_ca_system_score_gemma":0.00016106079,"threshold_uncertainty_score":0.943972},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4072777,0.00025110418,0.5664976,0.021444838,0.0005281404,0.00096579926,0.000007604224,0.0004877254,0.002539443],"genre_scores_gemma":[0.9119205,0.000019626592,0.086780325,0.00094421493,0.00001670577,0.00002468643,4.1134516e-7,0.0000097606335,0.00028378353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820703,0.000011979032,0.00048345723,0.00055559905,0.00037765302,0.00036427384],"domain_scores_gemma":[0.9985716,0.00018077975,0.00021640926,0.00036033976,0.000557376,0.00011352054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034552402,0.00026938177,0.0003205827,0.00026102783,0.00020210366,0.000347109,0.002314712,0.00014961521,0.000014216215],"category_scores_gemma":[0.0012140807,0.0001903677,0.00008300648,0.001229429,0.00020047318,0.000385515,0.0009761444,0.00041486917,0.0000093768485],"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.00003472133,0.000073965675,0.00048419848,0.000057932502,0.000012224878,3.6694203e-7,0.00069060875,0.0000018282926,0.023396943,0.92486936,0.000175163,0.050202664],"study_design_scores_gemma":[0.000015235775,0.00014069388,0.00022266406,0.00048451376,0.000009363327,0.000001632379,0.00011507877,0.010614553,0.40674615,0.5814135,0.000069243186,0.00016733953],"about_ca_topic_score_codex":0.000061887935,"about_ca_topic_score_gemma":0.000016725322,"teacher_disagreement_score":0.5046428,"about_ca_system_score_codex":0.00005921695,"about_ca_system_score_gemma":0.0000737956,"threshold_uncertainty_score":0.776297},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8911365,0.00009876268,0.041870274,0.0053943396,0.0012628969,0.0005977586,0.0000033567983,0.00020833973,0.059427727],"genre_scores_gemma":[0.99604917,0.000041022242,0.0032053185,0.00031349517,0.00002476966,0.000023112783,1.2137049e-7,0.0000052508417,0.00033774087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99834245,0.000018408147,0.00050949346,0.0004617304,0.00030090046,0.0003670004],"domain_scores_gemma":[0.9989247,0.00022742612,0.00021888498,0.00032554363,0.00026026974,0.000043228854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004243273,0.00019839295,0.00029160213,0.00023152235,0.00015068577,0.00025414355,0.0021251873,0.000096397765,0.00001793961],"category_scores_gemma":[0.0011432429,0.00014789413,0.00008560728,0.000845261,0.00029223727,0.00030169892,0.00048675618,0.0002743933,0.00003114376],"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.000032610897,0.0000846776,0.0020311566,0.000037442034,0.000008828958,0.000002064902,0.0011818194,0.000016811726,0.0070355297,0.95400745,0.00008291111,0.035478707],"study_design_scores_gemma":[0.00007704669,0.00018423778,0.012039131,0.0012612529,0.00001946494,0.000007906746,0.0019269935,0.053817544,0.50115997,0.42895025,0.00019089975,0.00036534786],"about_ca_topic_score_codex":0.00009157193,"about_ca_topic_score_gemma":0.000107699336,"teacher_disagreement_score":0.5250572,"about_ca_system_score_codex":0.000055557855,"about_ca_system_score_gemma":0.00018160167,"threshold_uncertainty_score":0.60309476},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6543281,0.000029203857,0.3011458,0.0027493073,0.0013549355,0.0022514963,0.0000642842,0.00021056662,0.03786632],"genre_scores_gemma":[0.9947264,0.0000067909828,0.00400426,0.00011208212,0.00009978509,0.00010509413,7.9014086e-7,0.000019906407,0.00092485466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99796164,0.000018934194,0.0007522433,0.0004748947,0.0003655383,0.00042674382],"domain_scores_gemma":[0.997918,0.00047159975,0.0004257635,0.0003134338,0.0008077741,0.0000634066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006014983,0.00026848138,0.00045410404,0.00011065331,0.0002714472,0.00013153841,0.0009014856,0.00015379842,0.00012860761],"category_scores_gemma":[0.0026137854,0.00021433686,0.0002303842,0.000370649,0.00061293156,0.00017358502,0.00021115964,0.00035705933,0.0000084090125],"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.00012664615,0.00015929247,0.0008690281,0.00023319226,0.0000534563,1.303387e-7,0.00029216448,0.0000063228244,0.008610911,0.9576217,0.00023826002,0.031788893],"study_design_scores_gemma":[0.00004790455,0.000050505383,0.0001173866,0.0002927636,0.000045111425,7.888601e-7,0.00047523237,0.0018028149,0.34014487,0.6567241,0.00016395701,0.0001345848],"about_ca_topic_score_codex":0.000009990584,"about_ca_topic_score_gemma":0.000009776037,"teacher_disagreement_score":0.34039834,"about_ca_system_score_codex":0.000082766994,"about_ca_system_score_gemma":0.00012129708,"threshold_uncertainty_score":0.87404037},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03925392,0.000017904276,0.94429296,0.006320465,0.0007220192,0.001773142,0.000008084769,0.00007230554,0.0075391685],"genre_scores_gemma":[0.9940259,0.0000058388223,0.005320006,0.00032470466,0.00001934544,0.00009573246,3.791226e-7,0.000008728735,0.00019935831],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979459,0.00004291476,0.00069995015,0.0005321754,0.0004773421,0.00030171013],"domain_scores_gemma":[0.99699676,0.0007671724,0.0004699405,0.0005014866,0.00122214,0.000042521388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013166389,0.00023871272,0.00036315047,0.00015122736,0.0002262711,0.00020604573,0.002613835,0.00010361265,0.00004399646],"category_scores_gemma":[0.0014350208,0.00014702213,0.00021010789,0.0008643555,0.00026623002,0.0002068744,0.00040258892,0.00022913123,0.000008774091],"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.00020761706,0.00018082577,0.000008000013,0.000039846975,0.000020629677,5.552503e-8,0.0005220537,0.0005720957,0.011653634,0.9591561,0.00015066574,0.027488487],"study_design_scores_gemma":[0.000072238814,0.00024576735,0.000023273542,0.000100860256,0.000009292621,3.7923195e-7,0.00020506293,0.112784475,0.34763324,0.5388336,0.000009018784,0.0000827583],"about_ca_topic_score_codex":0.000019664883,"about_ca_topic_score_gemma":0.000007700171,"teacher_disagreement_score":0.954772,"about_ca_system_score_codex":0.00005280578,"about_ca_system_score_gemma":0.00018535976,"threshold_uncertainty_score":0.59953886},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78624475,0.00001672737,0.2021072,0.0018920098,0.0004633072,0.0006751358,0.0000055884257,0.00021329962,0.008382004],"genre_scores_gemma":[0.99437815,0.000004303183,0.0050822753,0.00015279427,0.00004635969,0.000022035152,0.0000025638892,0.000010131677,0.0003013582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980051,0.00004231742,0.0004921693,0.00046507322,0.00069284014,0.00030248132],"domain_scores_gemma":[0.9979771,0.000054383996,0.00034045498,0.00019966876,0.0013524557,0.0000759671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053488393,0.00022251988,0.00022841613,0.00022284681,0.000679122,0.00033173646,0.00083953596,0.00008768935,0.00006955596],"category_scores_gemma":[0.0004191641,0.00017031368,0.000058789825,0.0008429819,0.00018356754,0.0005201356,0.0003230589,0.00038441404,0.000029898878],"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.0002579355,0.0003399079,0.000751603,0.00014996056,0.00008599133,0.0000021036585,0.0026125128,0.0032741285,0.344214,0.44450566,0.00019984011,0.20360634],"study_design_scores_gemma":[0.00009791527,0.00027017668,0.0006249278,0.0008945841,0.000041190073,0.000006294295,0.00018641526,0.40517467,0.5633991,0.028897578,0.00013095842,0.0002761912],"about_ca_topic_score_codex":0.000050098814,"about_ca_topic_score_gemma":0.00004259856,"teacher_disagreement_score":0.4156081,"about_ca_system_score_codex":0.00019370051,"about_ca_system_score_gemma":0.00020738848,"threshold_uncertainty_score":0.69451904},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42734006,0.000027956747,0.096563414,0.018082932,0.0006025175,0.00092794345,0.00001904416,0.00013693537,0.45629922],"genre_scores_gemma":[0.98713195,0.000009372698,0.00046468832,0.00025439003,0.000028575807,0.000034152265,2.0036435e-7,0.000006158274,0.012070533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99781835,0.00003671058,0.0006263689,0.0005005728,0.0008110235,0.00020699689],"domain_scores_gemma":[0.99749494,0.0005197836,0.00040839054,0.00039588916,0.001122346,0.000058651745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016482611,0.00016512483,0.00024094991,0.00021176836,0.0003991126,0.00027733447,0.0016902336,0.00006995047,0.00085655414],"category_scores_gemma":[0.0017459608,0.000092784016,0.00010586625,0.0015713905,0.00058469665,0.00026647592,0.00025502895,0.00022103722,0.00020862898],"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.00014136698,0.0000973559,0.00090040115,0.0000067627698,0.000010307474,6.2892745e-8,0.00029712814,0.00005100638,0.0053781136,0.8991013,0.0030326645,0.090983495],"study_design_scores_gemma":[0.00001734976,0.000074179654,0.0014217246,0.00012509189,0.000011261732,8.6077245e-7,0.0023541306,0.0043949876,0.21805319,0.77207893,0.0013694157,0.00009885835],"about_ca_topic_score_codex":0.000010506145,"about_ca_topic_score_gemma":0.0000065176623,"teacher_disagreement_score":0.55979186,"about_ca_system_score_codex":0.00002457383,"about_ca_system_score_gemma":0.000089832436,"threshold_uncertainty_score":0.9378667},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19954017,0.000016462516,0.7729885,0.0026883313,0.000555902,0.0010754167,0.00001683151,0.0002566465,0.022861753],"genre_scores_gemma":[0.9881108,0.00006143156,0.010755241,0.00010846491,0.000055095334,0.00007611328,0.0000020379969,0.000017465518,0.0008133714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775386,0.000022031656,0.00063212414,0.0006889075,0.00040643252,0.0004966384],"domain_scores_gemma":[0.9983323,0.00022588165,0.0002623531,0.00032034543,0.0007795349,0.00007955291],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004050995,0.0003158636,0.00035731235,0.00022468189,0.0003441955,0.00020082574,0.001762276,0.00017561117,0.000028743983],"category_scores_gemma":[0.00008176638,0.0002552771,0.00024774953,0.0008852071,0.00026260188,0.0004022979,0.00009153957,0.00026281175,0.000019761643],"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.00015572921,0.00018705819,0.000030047118,0.000053429812,0.000036536036,3.137472e-7,0.0015038542,0.0024752975,0.09177974,0.70776707,0.00013518272,0.19587572],"study_design_scores_gemma":[0.00007116516,0.0002763366,0.000098670906,0.0005359675,0.000038396505,0.0000022541121,0.0009758654,0.6674003,0.29981562,0.030436585,0.00006372043,0.00028512307],"about_ca_topic_score_codex":0.00006515954,"about_ca_topic_score_gemma":0.00002343617,"teacher_disagreement_score":0.7885706,"about_ca_system_score_codex":0.00010685083,"about_ca_system_score_gemma":0.00013452361,"threshold_uncertainty_score":0.9999899},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7137097,0.00013697986,0.0056117806,0.0037178996,0.0014006863,0.0005008283,0.000028520099,0.00009017371,0.2748034],"genre_scores_gemma":[0.9959295,0.000013067232,0.00013603171,0.00016819598,0.000043871063,0.000016512098,5.8836076e-7,0.000009944886,0.003682281],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985167,0.0000086157,0.00077383214,0.00038391206,0.00007094347,0.00024602795],"domain_scores_gemma":[0.99902207,0.000063746666,0.00049152283,0.00022014465,0.00016144585,0.00004109355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094724476,0.0001638167,0.00034215054,0.00019123603,0.0001716736,0.000120752586,0.0008286238,0.00009956725,0.00020826489],"category_scores_gemma":[0.0005377151,0.00013861762,0.00014303128,0.0005164318,0.00019916709,0.0001573705,0.00016742141,0.0002255863,0.00041184048],"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.000034436365,0.00008141853,0.010119187,0.00005466245,0.0000157629,7.858027e-8,0.0003627052,0.0000135744485,0.0015300912,0.9831954,0.00025916257,0.004333505],"study_design_scores_gemma":[0.000032194817,0.000086639986,0.0019061179,0.00032444188,0.0000051566194,5.278324e-7,0.0005533074,0.0043114447,0.07389232,0.91711706,0.0015926992,0.00017809185],"about_ca_topic_score_codex":0.00009637809,"about_ca_topic_score_gemma":0.0000063615707,"teacher_disagreement_score":0.28221977,"about_ca_system_score_codex":0.000042821528,"about_ca_system_score_gemma":0.000025922885,"threshold_uncertainty_score":0.56526625},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84002393,0.0001754538,0.006777611,0.02458818,0.0012182947,0.0008324566,0.0000068222516,0.00007941582,0.12629785],"genre_scores_gemma":[0.99865705,0.00023378863,0.000027497814,0.00012958692,0.000042295585,0.000020722644,3.194866e-7,0.000004111639,0.00088463986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984489,0.000049469723,0.0004821474,0.00018477965,0.00054313126,0.0002915863],"domain_scores_gemma":[0.9985927,0.00016258328,0.00040447718,0.00012770815,0.00066821015,0.000044346685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013141959,0.000093993665,0.00013852479,0.00004601921,0.00065321365,0.00013113442,0.00066991395,0.00007486081,0.00004233276],"category_scores_gemma":[0.0024571398,0.00006268578,0.00008202806,0.00074309856,0.0008017033,0.00020683405,0.00009302126,0.0001278448,0.000009674429],"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.000036030473,0.00007317058,0.006534901,0.000017616545,0.000009294446,2.4228493e-8,0.0018309099,0.0000070226847,0.0030350864,0.9276214,0.00039563765,0.060438853],"study_design_scores_gemma":[0.00006420997,0.00012728026,0.0076891924,0.0005412692,0.000057529393,1.03257086e-7,0.022512129,0.0035484747,0.6150495,0.32957545,0.02056196,0.00027295033],"about_ca_topic_score_codex":0.00023954156,"about_ca_topic_score_gemma":0.00030318502,"teacher_disagreement_score":0.61201435,"about_ca_system_score_codex":0.000101972604,"about_ca_system_score_gemma":0.00020215948,"threshold_uncertainty_score":0.50240576},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72257376,0.00005035748,0.25001678,0.0066620866,0.0008144016,0.00056958967,0.0000019909467,0.00015483891,0.019156178],"genre_scores_gemma":[0.9974365,0.0000040579275,0.0020119403,0.00021737079,0.00003431831,0.000014948703,4.0622345e-7,0.000005140115,0.00027529147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795085,0.000024941513,0.00078604615,0.0004996594,0.00041600183,0.00032250403],"domain_scores_gemma":[0.99889725,0.000072433344,0.00036717756,0.00015260732,0.00046979648,0.0000407452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010149472,0.00018589829,0.00028641958,0.00021439482,0.00015872887,0.00023561367,0.0016665821,0.000085783555,0.000031708107],"category_scores_gemma":[0.00044514178,0.00014193004,0.00014602735,0.0011074394,0.00015813184,0.0003377276,0.00039919603,0.00038298135,0.00002088838],"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.000017022316,0.00010297655,0.0027977494,0.00003971761,0.000013116972,6.31027e-7,0.0006403152,0.00045008727,0.0013897754,0.9772596,0.000050796945,0.017238263],"study_design_scores_gemma":[0.000034099896,0.000052470594,0.0014351446,0.0006151129,0.000011197364,0.0000017118891,0.0006235843,0.9124558,0.05984099,0.024629036,0.000086321415,0.0002145302],"about_ca_topic_score_codex":0.00007056522,"about_ca_topic_score_gemma":0.00009440999,"teacher_disagreement_score":0.9526305,"about_ca_system_score_codex":0.000077975565,"about_ca_system_score_gemma":0.00014625254,"threshold_uncertainty_score":0.57877386},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087059826,0.00003781833,0.698272,0.03246696,0.002014673,0.0008868395,0.00000767339,0.0003515103,0.17890269],"genre_scores_gemma":[0.9901186,0.000030405849,0.008044362,0.00075528695,0.000023072877,0.000006678604,2.2279424e-7,0.0000043112436,0.0010170112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998634,0.000014098493,0.0004187073,0.00038432368,0.00033623184,0.0002126364],"domain_scores_gemma":[0.99875015,0.000072668896,0.00024644486,0.00024092068,0.0006428577,0.000046973568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036023933,0.00015258031,0.00016544136,0.00016581845,0.00028399384,0.00022353661,0.0011231429,0.00008090729,0.00012839532],"category_scores_gemma":[0.0003749011,0.00012185941,0.00009408506,0.0008786514,0.00016488193,0.00036871925,0.00039831235,0.00022563976,0.00004457515],"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.0000115682815,0.00004372793,0.00043582488,0.000022612403,0.000006265722,9.7422145e-8,0.00054291,0.000039342838,0.0103227915,0.7997154,0.00014244871,0.18871702],"study_design_scores_gemma":[0.000035540517,0.00006558568,0.0016660189,0.00032825372,0.000012068424,0.0000023847203,0.0005016265,0.23578578,0.56674314,0.19421105,0.0004458536,0.00020269578],"about_ca_topic_score_codex":0.000028564638,"about_ca_topic_score_gemma":0.0000057926804,"teacher_disagreement_score":0.9030588,"about_ca_system_score_codex":0.000052603948,"about_ca_system_score_gemma":0.00011050139,"threshold_uncertainty_score":0.49692824},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6866004,0.000022394463,0.27703798,0.0070371036,0.00044504975,0.0014130113,0.0000016002958,0.0006699761,0.0267725],"genre_scores_gemma":[0.9838174,0.000017996652,0.015859572,0.000105140076,0.0000148441895,0.000034452267,0.0000018118702,0.000009111612,0.00013967392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982514,0.000057683625,0.0005128973,0.0004768579,0.00036312942,0.00033804632],"domain_scores_gemma":[0.998858,0.00010958556,0.00028454093,0.00015035417,0.0005309268,0.00006664559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005371284,0.0002235293,0.0002563036,0.00033098808,0.00031692718,0.0004606364,0.00058376935,0.00010526559,0.00003619137],"category_scores_gemma":[0.00020944627,0.00018184008,0.00007799173,0.0013231434,0.00023043666,0.00043946525,0.00015757898,0.00055574556,0.000012356319],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013239899,0.00024469706,0.013828319,0.00008759195,0.00004195204,0.000002803478,0.004660676,0.0037225708,0.012692414,0.5950762,0.000010170413,0.3695002],"study_design_scores_gemma":[0.00035819339,0.00086476386,0.004285985,0.0012253905,0.000049212566,0.00003345654,0.006011173,0.81638676,0.15595917,0.013822477,0.00038198332,0.0006214183],"about_ca_topic_score_codex":0.000045086857,"about_ca_topic_score_gemma":0.0000499744,"teacher_disagreement_score":0.8126642,"about_ca_system_score_codex":0.00010319418,"about_ca_system_score_gemma":0.0002207502,"threshold_uncertainty_score":0.7415223},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09034839,0.00007146493,0.88399696,0.011018337,0.000983776,0.00085845595,0.000012635584,0.00025667172,0.012453326],"genre_scores_gemma":[0.98007154,0.0000058850137,0.018627472,0.00036509146,0.00005298116,0.00006707121,0.0000028170566,0.000008081104,0.0007990742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984707,0.000016000751,0.00052450766,0.00042068856,0.0002690239,0.0002990643],"domain_scores_gemma":[0.9984451,0.00022405777,0.00035776972,0.00023797492,0.000677879,0.000057204506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005986776,0.00018714968,0.00022092128,0.0001915963,0.0004283081,0.0002949189,0.0012011403,0.00010979609,0.000015988924],"category_scores_gemma":[0.00044904626,0.0001520377,0.00012367961,0.0005769013,0.00009509574,0.00035391384,0.00015376389,0.00024455466,0.000018879411],"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.00008878165,0.00008148269,0.00042825314,0.00007742316,0.00002934389,3.0294078e-7,0.0011666421,0.0021153914,0.033639673,0.9329414,0.0015888355,0.027842466],"study_design_scores_gemma":[0.00008300801,0.00015172668,0.00045623502,0.00054950075,0.000034427634,0.0000020633026,0.00035183894,0.43393856,0.33711872,0.22630507,0.0007443224,0.0002645402],"about_ca_topic_score_codex":0.000064140266,"about_ca_topic_score_gemma":0.000007029066,"teacher_disagreement_score":0.8897231,"about_ca_system_score_codex":0.000049553288,"about_ca_system_score_gemma":0.0002107961,"threshold_uncertainty_score":0.6199918},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7855025,0.00005780428,0.19061053,0.002124079,0.00030205413,0.00071238243,0.000015936044,0.000094486786,0.020580262],"genre_scores_gemma":[0.9436509,0.000073181036,0.055730812,0.00015526969,0.000009279621,0.000023637509,2.2050088e-7,0.000010167764,0.00034651076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985644,0.00002584634,0.00053786166,0.00035535276,0.0002777964,0.00023872835],"domain_scores_gemma":[0.99810976,0.0007373847,0.00026540802,0.00019279386,0.0006364761,0.00005818759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050568767,0.00019203324,0.0002967859,0.00020137572,0.00016018651,0.00012430035,0.0005311593,0.000103962695,0.000060866416],"category_scores_gemma":[0.0078120455,0.00014060354,0.00005428409,0.0009792882,0.00039743277,0.00012019055,0.00019839537,0.0002660284,0.00001124458],"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.000041890027,0.00007601405,0.00045495693,0.00012247806,0.000011745,1.2076819e-7,0.00013524615,0.00004270101,0.005638293,0.9223028,0.000046758298,0.07112701],"study_design_scores_gemma":[0.000025455342,0.000080915815,0.0018755504,0.00036281138,0.000037754504,0.0000017379012,0.0002808117,0.05156988,0.048359673,0.8972481,0.000016514037,0.00014080554],"about_ca_topic_score_codex":0.00002412801,"about_ca_topic_score_gemma":0.0000049014284,"teacher_disagreement_score":0.15814845,"about_ca_system_score_codex":0.00004062888,"about_ca_system_score_gemma":0.00006634936,"threshold_uncertainty_score":0.93523127},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042749953,0.000024942456,0.9052263,0.007646741,0.00067921524,0.00089676614,0.000002187788,0.00025112345,0.042522766],"genre_scores_gemma":[0.9606492,0.000045798657,0.036455646,0.00077176886,0.000054722645,0.00011540402,5.3395854e-7,0.000012385429,0.0018945666],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99745685,0.000031310985,0.00070771074,0.00073339586,0.0005999689,0.0004707858],"domain_scores_gemma":[0.99804604,0.00005676572,0.00036124233,0.00051051466,0.00095540733,0.00007001131],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005372099,0.00033530532,0.00033411218,0.0002372961,0.0002916511,0.00037407383,0.0029068005,0.00010451342,0.00017054824],"category_scores_gemma":[0.00023345067,0.00025904007,0.00014999519,0.0009651806,0.0003567351,0.0007350794,0.0008851925,0.00035745732,0.00015055163],"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.000021693015,0.00016965812,0.000010532164,0.000031353637,0.000015508838,4.1790634e-7,0.0012590309,0.0000014808811,0.56576866,0.3800742,0.0010058362,0.051641624],"study_design_scores_gemma":[0.00002532503,0.00018043528,0.000033332235,0.00027555603,0.0000112861935,0.000001047532,0.0003158769,0.014308281,0.90653145,0.07786529,0.0002213024,0.00023078943],"about_ca_topic_score_codex":0.000019317229,"about_ca_topic_score_gemma":0.0000061788123,"teacher_disagreement_score":0.9178992,"about_ca_system_score_codex":0.00014464339,"about_ca_system_score_gemma":0.00016906334,"threshold_uncertainty_score":0.9999862},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65811807,0.00013534098,0.2677768,0.022312708,0.0036198688,0.0016368871,0.000007793937,0.0003631891,0.046029326],"genre_scores_gemma":[0.99588907,0.00004859374,0.0023259148,0.0007640457,0.000027451235,0.000028435485,2.0428755e-7,0.000006152784,0.00091012823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981039,0.000041958763,0.0006119759,0.0005454079,0.0003284294,0.00036829544],"domain_scores_gemma":[0.99875015,0.0001831262,0.00025372265,0.0003939537,0.00035616764,0.000062864274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075167,0.00022837108,0.0003079337,0.00029133985,0.00011744146,0.00023048713,0.0023603837,0.000113701244,0.00008234639],"category_scores_gemma":[0.00033196702,0.00017903015,0.00013011994,0.0015381257,0.00019252754,0.00041436317,0.00045678334,0.0003769515,0.000043863303],"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.00008097223,0.00009505473,0.0002678612,0.00004476306,0.000009778366,0.0000011404923,0.0009989933,0.000022171762,0.025147716,0.9364222,0.00011275469,0.036796574],"study_design_scores_gemma":[0.000044411507,0.00008312723,0.0001520053,0.0003039173,0.000005013889,0.0000012613501,0.00019753232,0.047084942,0.49604446,0.4557955,0.00014015328,0.00014769463],"about_ca_topic_score_codex":0.0000636909,"about_ca_topic_score_gemma":0.00003933767,"teacher_disagreement_score":0.48062673,"about_ca_system_score_codex":0.00003255655,"about_ca_system_score_gemma":0.00010437838,"threshold_uncertainty_score":0.73006374},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61800855,0.000098146316,0.26194674,0.0013221924,0.00035688313,0.0008293411,0.000023946719,0.00013964681,0.11727453],"genre_scores_gemma":[0.9981105,0.000009649403,0.0013492181,0.000074680356,0.00008401588,0.000021243803,0.0000012078385,0.000011480841,0.0003380026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99845296,0.000013688211,0.00061919354,0.00033728676,0.0002900953,0.0002867466],"domain_scores_gemma":[0.99874,0.00008214823,0.0004386715,0.00024108957,0.00046097153,0.000037115788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031711167,0.00021276002,0.0003772901,0.00014281255,0.00014142274,0.00008427284,0.0008441764,0.00006351669,0.00020489958],"category_scores_gemma":[0.000050005598,0.00016760733,0.00024879313,0.00074959465,0.00016527435,0.00020332732,0.0003427855,0.00026552807,0.0000030377334],"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.000052267907,0.00011436974,0.0016506842,0.00001816431,0.00007129161,3.862594e-8,0.00084448047,0.00029586072,0.02614961,0.93287003,0.000487976,0.037445202],"study_design_scores_gemma":[0.000019795918,0.000028316226,0.00005683314,0.00044532723,0.00003281289,8.602203e-8,0.00087928126,0.19214784,0.44507718,0.3611172,0.00006205044,0.00013325074],"about_ca_topic_score_codex":0.0002729265,"about_ca_topic_score_gemma":0.0000049180767,"teacher_disagreement_score":0.57175285,"about_ca_system_score_codex":0.00003350934,"about_ca_system_score_gemma":0.00006877513,"threshold_uncertainty_score":0.6834829},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36604702,0.00009863341,0.56035346,0.002835983,0.00269253,0.0050509544,0.00009778497,0.0080653215,0.05475831],"genre_scores_gemma":[0.9957536,0.00016174772,0.0034448414,0.000076158554,0.000055244804,0.00024886822,0.000012877697,0.000022183944,0.00022451881],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986488,0.0000071732106,0.0005326636,0.00026721484,0.00025503937,0.0002890973],"domain_scores_gemma":[0.9995052,0.000031396376,0.00008404221,0.00011101213,0.00022014427,0.000048177717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031975377,0.00022358222,0.00021534455,0.00020624102,0.00019722745,0.00008937251,0.00040160873,0.00010538094,0.000063375075],"category_scores_gemma":[0.00004466832,0.00019107839,0.00015019294,0.00037472526,0.00006985413,0.00023109379,0.000027766913,0.00025064108,0.000009954392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030009198,0.00036509454,0.00040472284,0.00088340166,0.00025952986,1.7462321e-7,0.0031695326,0.022150112,0.017671851,0.16354606,0.012380107,0.77886933],"study_design_scores_gemma":[0.00009479523,0.00018548706,0.00007493364,0.00023516452,0.00007187762,4.1264067e-7,0.00093910866,0.8306842,0.15698779,0.0022436667,0.008312201,0.00017039427],"about_ca_topic_score_codex":0.0000064264414,"about_ca_topic_score_gemma":0.000024465795,"teacher_disagreement_score":0.8085341,"about_ca_system_score_codex":0.00010286678,"about_ca_system_score_gemma":0.00003375433,"threshold_uncertainty_score":0.779195},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024642989,0.000013660232,0.96722704,0.0024058511,0.0007944164,0.000400506,0.0000042706115,0.000095455296,0.0044158357],"genre_scores_gemma":[0.9955822,0.000008027728,0.0035552874,0.00023564539,0.00004053017,0.000037578953,6.6147294e-7,0.0000068803065,0.0005331457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998415,0.0000147016735,0.00053993176,0.00044676143,0.00029809668,0.00028549167],"domain_scores_gemma":[0.9986052,0.000106317704,0.00033925948,0.00016404093,0.0007434141,0.00004179485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040812904,0.0001884117,0.00026116075,0.0001679435,0.0002650275,0.00024338171,0.0012840957,0.000096220654,0.000029279017],"category_scores_gemma":[0.00031919286,0.00014294231,0.00021411192,0.0006034324,0.00011122318,0.00026921023,0.00016780166,0.00020710679,0.000015340698],"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.00003508431,0.000068851914,0.00001387076,0.00002783602,0.000028090722,5.9557443e-8,0.0003600136,0.00005781235,0.014399832,0.9388411,0.00024996858,0.04591749],"study_design_scores_gemma":[0.000029934841,0.0001359041,0.000028871258,0.00016718768,0.00002485102,9.869995e-7,0.0002783766,0.43474936,0.41651165,0.14774615,0.00017046704,0.00015624857],"about_ca_topic_score_codex":0.0000104886885,"about_ca_topic_score_gemma":0.000030100733,"teacher_disagreement_score":0.9709393,"about_ca_system_score_codex":0.0000838838,"about_ca_system_score_gemma":0.0000915735,"threshold_uncertainty_score":0.58290184},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7265221,0.00024108078,0.21926169,0.028511923,0.0010585545,0.0018721127,0.00002812963,0.0001547263,0.022349693],"genre_scores_gemma":[0.99469876,0.000043187207,0.0009828429,0.00017877224,0.000073502604,0.0000682221,4.0210008e-7,0.00001318633,0.0039411257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99618787,0.00006297763,0.00081733556,0.00066116994,0.0018221578,0.00044846698],"domain_scores_gemma":[0.9961916,0.00090494554,0.0005142476,0.0005313517,0.0017795893,0.000078232784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002161511,0.00025757088,0.0003589875,0.00029874523,0.00067894836,0.0006484342,0.0026475305,0.00008987509,0.00019337567],"category_scores_gemma":[0.004952565,0.00012631112,0.00014668985,0.002251963,0.0012713234,0.0006326297,0.00056420837,0.0005509849,0.000129312],"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.0018930457,0.0003998813,0.003597591,0.00008730507,0.00011037179,0.0000030309554,0.0045165042,0.003563253,0.023165163,0.5300729,0.002089544,0.43050137],"study_design_scores_gemma":[0.00011620405,0.0007185385,0.0067786463,0.0010397116,0.000063076775,0.000014227193,0.02192076,0.037569266,0.5659605,0.3604424,0.004769191,0.0006074602],"about_ca_topic_score_codex":0.000060584476,"about_ca_topic_score_gemma":0.00007144841,"teacher_disagreement_score":0.54279536,"about_ca_system_score_codex":0.00010612114,"about_ca_system_score_gemma":0.00028220282,"threshold_uncertainty_score":0.6252866},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018308274,0.00003114275,0.97386444,0.009931063,0.0010662163,0.00046537528,0.00007327503,0.00013982075,0.012597825],"genre_scores_gemma":[0.98449343,0.000017576642,0.014220255,0.00043358243,0.00007955396,0.00001626988,0.00005173983,0.000012850743,0.000674743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997937,0.000042131334,0.00055026624,0.0006157653,0.00055127253,0.00030352324],"domain_scores_gemma":[0.9983702,0.000092179056,0.00046289852,0.0004612113,0.0005530481,0.000060468883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006068837,0.00025402487,0.00026602668,0.00015705501,0.00032485652,0.00034767718,0.0024424307,0.0001701564,0.00004312105],"category_scores_gemma":[0.0012287236,0.00020529938,0.00008388303,0.0012147166,0.00022075309,0.00074400194,0.00072728255,0.00046459216,0.000021555536],"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.000056897185,0.00006913026,0.00016748406,0.000039463554,0.000022949916,2.2399527e-7,0.00027240856,0.00444741,0.007044334,0.94008505,0.0047910595,0.04300361],"study_design_scores_gemma":[0.00008487236,0.0001003334,0.0003334088,0.0003520096,0.000047734433,0.0000018856888,0.00018045935,0.59818256,0.13291727,0.263958,0.0034560063,0.00038545375],"about_ca_topic_score_codex":0.000069666174,"about_ca_topic_score_gemma":0.000008568199,"teacher_disagreement_score":0.9826626,"about_ca_system_score_codex":0.000091679,"about_ca_system_score_gemma":0.00018630014,"threshold_uncertainty_score":0.8371866},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018023558,0.00012513199,0.9542792,0.006858562,0.001804957,0.0010186199,0.0000056500407,0.00017910147,0.017705211],"genre_scores_gemma":[0.9360798,0.000017245764,0.06216232,0.0009793838,0.000085147585,0.00006095693,4.0887338e-7,0.000009946797,0.00060480327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811745,0.000013277151,0.00053022016,0.00054010475,0.00030598184,0.0004929959],"domain_scores_gemma":[0.9986022,0.00024560592,0.0003007985,0.00028772766,0.0004940027,0.00006963843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044780024,0.00022318565,0.0002810868,0.00013126302,0.00044294025,0.00029697703,0.0018195912,0.00006368021,0.000022946926],"category_scores_gemma":[0.00054171274,0.0001692551,0.00013647381,0.00091947307,0.00021125814,0.00022244174,0.0005229215,0.00022609123,0.000017646204],"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.0000644771,0.00008200035,0.00005913247,0.00004273125,0.000010636151,1.8694367e-7,0.00032365604,0.010227048,0.015366431,0.77841717,0.0006121912,0.19479433],"study_design_scores_gemma":[0.00003680614,0.00008354288,0.000024265511,0.00028834117,0.00000956537,0.0000010428874,0.00021542954,0.8268487,0.09210939,0.07883616,0.0013955262,0.00015124804],"about_ca_topic_score_codex":0.000009444062,"about_ca_topic_score_gemma":0.0000031007387,"teacher_disagreement_score":0.91805625,"about_ca_system_score_codex":0.000054786462,"about_ca_system_score_gemma":0.00010359192,"threshold_uncertainty_score":0.69020224},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45069942,0.00004669466,0.5025763,0.00572238,0.00034776583,0.0005794227,0.0000066521447,0.00024024787,0.039781146],"genre_scores_gemma":[0.9836937,0.000041093746,0.0153774535,0.0004931973,0.000022630822,0.000025579624,3.383959e-7,0.000008487414,0.0003374931],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980889,0.000016376967,0.00053344213,0.0005840794,0.00041805266,0.00035917925],"domain_scores_gemma":[0.99873114,0.000045523575,0.0002462592,0.00028354226,0.0006207263,0.00007283659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058215734,0.00024772197,0.0002682119,0.0001786628,0.00028195648,0.00041816142,0.0016355409,0.000108908454,0.000008813887],"category_scores_gemma":[0.0002676107,0.00019336023,0.000075778094,0.0007251238,0.0002800214,0.0004458721,0.00070904626,0.0003593183,0.0000113010865],"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.000027018628,0.000070410126,0.0001416531,0.000051199328,0.000014149639,1.8362924e-7,0.00074701686,0.00013429712,0.042739615,0.8915364,0.00011221319,0.0644258],"study_design_scores_gemma":[0.000023528497,0.000052040046,0.00007243888,0.00024070065,0.000010277948,0.0000020105329,0.00021097192,0.5833875,0.19023052,0.22562078,0.000008570888,0.00014063613],"about_ca_topic_score_codex":0.00008786502,"about_ca_topic_score_gemma":0.000010313132,"teacher_disagreement_score":0.66591567,"about_ca_system_score_codex":0.000052832853,"about_ca_system_score_gemma":0.000274236,"threshold_uncertainty_score":0.78850013},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008303439,0.000026534382,0.98270005,0.0033660335,0.00036850307,0.0011716314,0.000041023417,0.00028276324,0.003739993],"genre_scores_gemma":[0.90587,0.00004847353,0.09310152,0.00036213646,0.00003224775,0.00018778136,0.0000036241584,0.000019784955,0.0003744152],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99747264,0.000022332935,0.0008309769,0.0007577269,0.00043952052,0.00047681606],"domain_scores_gemma":[0.99750596,0.00015462487,0.00034937917,0.0005756375,0.0013216928,0.0000926737],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043206135,0.00034502347,0.0004330589,0.00022821817,0.0003650535,0.00034570217,0.003204151,0.00013250725,0.000027243257],"category_scores_gemma":[0.00028470854,0.00025419,0.00021287272,0.00056330115,0.0002667544,0.0012900636,0.0005125274,0.0003672161,0.000015335503],"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.0001581431,0.00013374207,0.000010760621,0.00013412679,0.000016495898,3.0246795e-7,0.00035216616,0.000050847506,0.46982923,0.46101183,0.00055253564,0.06774984],"study_design_scores_gemma":[0.000052696523,0.00007170697,0.0000051463376,0.0005366049,0.000010920783,9.4441924e-7,0.00029974023,0.30704227,0.55527496,0.13639402,0.00014537912,0.00016558226],"about_ca_topic_score_codex":0.000034411896,"about_ca_topic_score_gemma":0.000005032233,"teacher_disagreement_score":0.89756656,"about_ca_system_score_codex":0.00006604279,"about_ca_system_score_gemma":0.00011583153,"threshold_uncertainty_score":0.99999106},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9113675,0.000035802193,0.00019367671,0.002614573,0.0002758475,0.0004165896,0.000009418361,0.0000506998,0.08503592],"genre_scores_gemma":[0.98929673,0.000020782765,0.00020615986,0.00062550424,0.00010805309,0.000020819669,6.727898e-7,0.000011789774,0.009709498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99902236,0.00000932852,0.0002517433,0.00027550544,0.00023285302,0.00020817986],"domain_scores_gemma":[0.999346,0.000060009974,0.00013519239,0.00009955383,0.00029637248,0.000062850195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023567361,0.00016466013,0.00020345446,0.000116351075,0.00022935073,0.00024516103,0.00031097746,0.00003755561,0.00040993455],"category_scores_gemma":[0.00019858623,0.00010479116,0.00004411621,0.0001354127,0.0002560331,0.00013137666,0.00013227749,0.00015892013,0.000029808309],"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.00019691447,0.00007485407,0.000237122,0.00007248547,0.00002672608,5.8190733e-7,0.03344819,0.0000022770782,0.025259394,0.90794176,0.00041040746,0.032329276],"study_design_scores_gemma":[0.00027756425,0.0016976043,0.00063336635,0.0057786377,0.00012684987,0.0000038043368,0.25522375,0.004944629,0.64317477,0.066691175,0.020516878,0.0009309863],"about_ca_topic_score_codex":0.00021482343,"about_ca_topic_score_gemma":0.00013077787,"teacher_disagreement_score":0.8412506,"about_ca_system_score_codex":0.000021591677,"about_ca_system_score_gemma":0.00004007424,"threshold_uncertainty_score":0.44884962},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9185439,0.000017889313,0.022366887,0.0015469464,0.0006741986,0.0005581943,0.000011372719,0.00036849355,0.05591214],"genre_scores_gemma":[0.9971709,0.000022016446,0.0022074927,0.00012530782,0.00005196921,0.000011833211,0.0000020878604,0.000019326539,0.00038901283],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99872285,0.000009792676,0.0005564359,0.00023467065,0.00024407184,0.00023220271],"domain_scores_gemma":[0.99926513,0.00002269905,0.00016885887,0.00014636488,0.00035479432,0.000042165822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002782613,0.00020008947,0.00021765078,0.00019414477,0.00013715877,0.00017082418,0.00038975864,0.000091828355,0.00022559961],"category_scores_gemma":[0.00015653025,0.00017099548,0.00009147555,0.00042926555,0.000103975304,0.00036899262,0.00006321556,0.00021250169,0.00009191058],"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.00003167731,0.000034024182,0.00003899853,0.00015877251,0.00001836611,1.787751e-7,0.0004646569,0.00023864157,0.75020266,0.24056087,0.00043787717,0.007813304],"study_design_scores_gemma":[0.000037868016,0.00003232501,0.0005621922,0.00049838005,0.000027902192,0.0000019287472,0.00040966916,0.3196815,0.6580413,0.02029821,0.00021393699,0.00019475623],"about_ca_topic_score_codex":0.000009605014,"about_ca_topic_score_gemma":0.000004594922,"teacher_disagreement_score":0.31944287,"about_ca_system_score_codex":0.000104224135,"about_ca_system_score_gemma":0.000031180036,"threshold_uncertainty_score":0.69729936},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49094656,0.0003598166,0.5001827,0.0014650344,0.0006251302,0.004574531,0.000020309086,0.00065475894,0.0011711332],"genre_scores_gemma":[0.8553688,0.00019504456,0.14391637,0.00006371242,0.000030764928,0.00022555277,0.0000023363534,0.000026035015,0.00017141669],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986605,0.000011359979,0.0005123498,0.00034963916,0.00016487534,0.00030127913],"domain_scores_gemma":[0.99922264,0.00008163997,0.00014140233,0.00017079157,0.00033960625,0.000043934557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036518453,0.00022905102,0.00027847738,0.00015723445,0.00012311325,0.0000723501,0.00033845843,0.00012943985,0.0000138895475],"category_scores_gemma":[0.00036630087,0.00019753177,0.000060162325,0.000405451,0.00015079223,0.0002640654,0.00013272725,0.0002639149,0.0000050543663],"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.00010797881,0.00012378364,0.00023021932,0.00017461569,0.000010642557,1.9832399e-7,0.00044904495,0.0003541243,0.9296705,0.01470576,0.00023055793,0.053942554],"study_design_scores_gemma":[0.00008488671,0.00008041669,0.0004994752,0.0005367152,0.000013889136,4.7622794e-7,0.00019841982,0.30016613,0.67739075,0.02075865,0.00010561049,0.00016459166],"about_ca_topic_score_codex":0.00002315127,"about_ca_topic_score_gemma":0.00004310646,"teacher_disagreement_score":0.3644222,"about_ca_system_score_codex":0.000076516946,"about_ca_system_score_gemma":0.000023533816,"threshold_uncertainty_score":0.8055112},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015724063,0.000028063743,0.9711357,0.0064599244,0.00027872165,0.0008081136,0.000015015959,0.00025134382,0.005299066],"genre_scores_gemma":[0.97672796,0.0000282011,0.019786926,0.0008862891,0.000029943052,0.000043344688,0.0000021794112,0.000015467498,0.0024797048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9977574,0.000020492942,0.00064745557,0.0006529148,0.0004803308,0.00044141634],"domain_scores_gemma":[0.9975455,0.00014636948,0.00035321523,0.00045843428,0.0014166443,0.00007987513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007664812,0.00027644666,0.00032497075,0.00022897756,0.00035922386,0.00044811127,0.002407649,0.00013264384,0.000036498863],"category_scores_gemma":[0.0006431241,0.00021392383,0.00021284421,0.00086401595,0.00023157246,0.0006332426,0.0005942013,0.00033950174,0.0000369141],"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.00014396879,0.00018942982,0.00001812424,0.00008120466,0.00001754236,3.0286083e-7,0.0012875643,0.000008079337,0.3096987,0.67469025,0.000505571,0.01335928],"study_design_scores_gemma":[0.000045464232,0.0000764917,0.000015128285,0.00019827808,0.000010446691,0.0000010657463,0.00066788075,0.3194656,0.5803204,0.09893021,0.00012521309,0.0001438172],"about_ca_topic_score_codex":0.000014013137,"about_ca_topic_score_gemma":0.0000015857258,"teacher_disagreement_score":0.9610039,"about_ca_system_score_codex":0.00009001967,"about_ca_system_score_gemma":0.00023020718,"threshold_uncertainty_score":0.87235606},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030520506,0.000042906624,0.92562443,0.029530551,0.00092653575,0.0009947639,0.00003299536,0.00028049469,0.012046837],"genre_scores_gemma":[0.97650427,0.000025195604,0.022101428,0.0007144873,0.000041750063,0.00012358866,0.0000014138492,0.000014822838,0.00047304214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997705,0.000031067964,0.00069498736,0.00069640425,0.00040835593,0.0004642243],"domain_scores_gemma":[0.9979387,0.00038033703,0.000423367,0.0003969023,0.0007604162,0.00010031426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006077391,0.00030513288,0.00044332058,0.0003824802,0.00036432894,0.00038445892,0.0019190419,0.00012856869,0.000097996715],"category_scores_gemma":[0.0009880678,0.00024250716,0.00038323642,0.0011919275,0.00025048858,0.00032227667,0.00026645995,0.0002612305,0.000068636175],"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.00013272176,0.00036910386,0.00015325943,0.00026387916,0.00011108032,8.221754e-7,0.00044449462,0.0004744871,0.044235557,0.59399676,0.00044701993,0.3593708],"study_design_scores_gemma":[0.000047687485,0.00009253002,0.000063809595,0.00078816625,0.000057598212,0.0000012664851,0.00030803078,0.61292064,0.3219054,0.063348055,0.00021812809,0.0002486866],"about_ca_topic_score_codex":0.000036530786,"about_ca_topic_score_gemma":0.00004829093,"teacher_disagreement_score":0.94598377,"about_ca_system_score_codex":0.000117328564,"about_ca_system_score_gemma":0.00022770213,"threshold_uncertainty_score":0.98891544},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54118377,0.000051590974,0.269072,0.003632245,0.0007818959,0.0019484387,0.000039028728,0.00039296536,0.18289807],"genre_scores_gemma":[0.9891828,0.000010353083,0.008312653,0.0002951921,0.000046236306,0.00016534662,0.000006015599,0.000009313009,0.0019720949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982805,0.000021307624,0.00059935515,0.0005204779,0.00023876772,0.00033954735],"domain_scores_gemma":[0.99883425,0.00007304998,0.00030674477,0.00023297308,0.00050764845,0.000045322955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006289601,0.00019888986,0.00026428857,0.00030059958,0.00030245777,0.00034825547,0.0011383056,0.00008393346,0.000026646332],"category_scores_gemma":[0.00022123707,0.0001637414,0.00010400019,0.00072590314,0.0001452203,0.0004973311,0.00020739324,0.00025425927,0.000008364297],"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.000041543895,0.00018547304,0.00013801997,0.000095336654,0.000013699825,4.3319247e-7,0.00055591465,0.00018378493,0.0561783,0.8936778,0.00036416575,0.04856557],"study_design_scores_gemma":[0.00014547142,0.00013966487,0.00026726496,0.00033024306,0.000013630591,0.0000014565429,0.0005815606,0.08859063,0.79020315,0.11909448,0.00036170095,0.00027073768],"about_ca_topic_score_codex":0.000106198495,"about_ca_topic_score_gemma":0.000040809282,"teacher_disagreement_score":0.7745833,"about_ca_system_score_codex":0.000062807856,"about_ca_system_score_gemma":0.0000893848,"threshold_uncertainty_score":0.667718},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005986391,0.00001752604,0.97697073,0.003801521,0.00072020286,0.00043757827,0.0000020533291,0.00024503033,0.0118189445],"genre_scores_gemma":[0.9887607,0.00003750578,0.010320798,0.00023416427,0.00013010547,0.000039603707,0.0000014074927,0.000009359048,0.00046637497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99824,0.000021592885,0.00045948263,0.000488304,0.00053563,0.00025500535],"domain_scores_gemma":[0.9980509,0.00007020609,0.0003872986,0.0003347488,0.0011026522,0.000054146658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003766805,0.00021824702,0.0002204509,0.00019459239,0.00032461615,0.00032291067,0.0013288843,0.00009805561,0.000022938142],"category_scores_gemma":[0.00011749058,0.00015128164,0.0000836064,0.0010331412,0.0002489142,0.0010112092,0.00030960134,0.00027426027,0.000023346889],"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.00009386437,0.0001107807,0.00003885332,0.000045077584,0.00001057066,1.18131226e-7,0.00020621496,0.000010234438,0.2848146,0.55510116,0.0003996326,0.15916891],"study_design_scores_gemma":[0.0000309304,0.00018344319,0.00031376508,0.00029743914,0.000016766351,0.0000015875844,0.00014980906,0.20817254,0.59770536,0.19269226,0.00027538883,0.0001606785],"about_ca_topic_score_codex":0.000020187417,"about_ca_topic_score_gemma":0.0000045104425,"teacher_disagreement_score":0.9827743,"about_ca_system_score_codex":0.00007814428,"about_ca_system_score_gemma":0.00009629853,"threshold_uncertainty_score":0.6169086},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6574338,0.0000129763575,0.33774573,0.0008761547,0.0002108208,0.00039376973,0.0000014656764,0.00008870635,0.0032365646],"genre_scores_gemma":[0.99705267,0.000030649804,0.0022873748,0.00018643647,0.000029899385,0.000020769343,0.0000010088906,0.0000064983246,0.00038468905],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99872345,0.000024289613,0.00040524005,0.00037522256,0.00026383664,0.00020794677],"domain_scores_gemma":[0.9991191,0.000049823466,0.00031298966,0.000110517736,0.00036021328,0.00004737136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003160804,0.00016371234,0.00018347338,0.00020832887,0.00046024006,0.00030387143,0.0004107729,0.00007706344,0.0000171612],"category_scores_gemma":[0.00011895937,0.00014177489,0.00006303937,0.0003920123,0.00011345417,0.00064312643,0.000146089,0.000268903,0.0000073412634],"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.00003229271,0.00008473701,0.00010823907,0.000060314647,0.00002026656,1.4879132e-7,0.00087499514,0.0011328022,0.64963174,0.23170568,0.000034906607,0.11631386],"study_design_scores_gemma":[0.000054696015,0.00006264965,0.000054932607,0.00016631516,0.00001943971,0.0000013160982,0.00048467977,0.38072705,0.54120815,0.07710141,0.000015568998,0.00010381089],"about_ca_topic_score_codex":0.00003697647,"about_ca_topic_score_gemma":0.00000793596,"teacher_disagreement_score":0.37959424,"about_ca_system_score_codex":0.00008186837,"about_ca_system_score_gemma":0.00007638918,"threshold_uncertainty_score":0.5781412},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04847759,0.00012659606,0.94629145,0.0005366247,0.00042998846,0.00086781423,0.000012502481,0.00033607392,0.002921362],"genre_scores_gemma":[0.9732584,0.00016079661,0.026231539,0.000105710475,0.00004354596,0.000085627515,8.5653e-7,0.00003112531,0.00008240535],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987687,0.0000067967994,0.00042628738,0.00031380492,0.00017711027,0.00030734294],"domain_scores_gemma":[0.9993839,0.00007210964,0.00007673106,0.00013845834,0.00028437862,0.00004441716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023624324,0.00024660322,0.00026455623,0.00015961815,0.00016097873,0.000082073944,0.00033816905,0.00011789127,0.000019810228],"category_scores_gemma":[0.00010083248,0.00021433587,0.0001052921,0.00030483244,0.0002277482,0.00026932714,0.00002648625,0.00028274526,0.0000037056532],"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.00012774392,0.000024818732,0.000020543948,0.00018730354,0.000041573152,1.2862108e-7,0.0004042867,0.00006403903,0.6778261,0.01920943,0.000068203924,0.30202582],"study_design_scores_gemma":[0.00004408045,0.00006319664,0.000016946486,0.00017894145,0.000045166184,0.000003676209,0.00014356893,0.052015197,0.84957623,0.097096734,0.00063022523,0.00018605629],"about_ca_topic_score_codex":0.00002302873,"about_ca_topic_score_gemma":0.00003359306,"teacher_disagreement_score":0.9247808,"about_ca_system_score_codex":0.000070949754,"about_ca_system_score_gemma":0.0000332714,"threshold_uncertainty_score":0.8740363},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16881932,0.00021978198,0.80626136,0.008211203,0.0038432742,0.0020787087,0.00008421635,0.0003878036,0.010094355],"genre_scores_gemma":[0.9977703,0.000027893915,0.0014393565,0.00042130388,0.000060083294,0.000055451812,0.000004217259,0.000006179355,0.00021520071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998261,0.000034422756,0.00046588472,0.00052666676,0.00039548558,0.00031654997],"domain_scores_gemma":[0.9988497,0.000054466087,0.0003221429,0.0003806585,0.00032575123,0.00006732034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005590448,0.00019091742,0.00019895397,0.00012848798,0.00043468055,0.00029676585,0.0010854129,0.00009682614,0.000028430632],"category_scores_gemma":[0.00021368678,0.00015081433,0.00007145962,0.0009050664,0.00016793817,0.00042800888,0.00067493273,0.00023699175,0.000024532857],"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.00013504256,0.00035072718,0.0016539699,0.000084039544,0.000048399033,9.138094e-7,0.0014050881,0.00022665047,0.010978972,0.86644363,0.0034053016,0.11526728],"study_design_scores_gemma":[0.00017699448,0.0005282608,0.0025900558,0.000544425,0.000053562293,0.00001223455,0.0012371944,0.3960664,0.24489771,0.35187206,0.0016205449,0.00040054842],"about_ca_topic_score_codex":0.000017669598,"about_ca_topic_score_gemma":0.000036612182,"teacher_disagreement_score":0.828951,"about_ca_system_score_codex":0.00005189577,"about_ca_system_score_gemma":0.000053337317,"threshold_uncertainty_score":0.61500305},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10003673,0.00007649065,0.8926945,0.0024067927,0.0002687517,0.00030982483,0.0000046708174,0.000061694904,0.0041405624],"genre_scores_gemma":[0.99694103,0.000041645577,0.002656267,0.00026581736,0.000026645737,0.000008468222,0.0000010251723,0.0000032060134,0.000055880246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875855,0.000025697853,0.0003604119,0.00040837898,0.00023849659,0.00020844433],"domain_scores_gemma":[0.9989584,0.00009373863,0.0002021241,0.0001283853,0.00056423206,0.000053112486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046616318,0.0001487211,0.00019845222,0.000076607525,0.00026388073,0.00034018917,0.00054736924,0.00005994468,0.000007568064],"category_scores_gemma":[0.00012601301,0.00012497025,0.000036902107,0.00067617494,0.00026663337,0.00042724403,0.00045772459,0.00013351241,0.000004662039],"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.000087007174,0.000067350535,0.0034208018,0.000052270912,0.00001934295,2.2333876e-7,0.00031023673,0.00050130964,0.0016280334,0.61740285,0.00047951678,0.37603104],"study_design_scores_gemma":[0.00010788984,0.000084969215,0.0037095256,0.0002624367,0.000025437523,0.0000038085316,0.00025692873,0.7695176,0.021176789,0.20467049,0.000034756104,0.00014937563],"about_ca_topic_score_codex":0.00016509808,"about_ca_topic_score_gemma":0.0002135366,"teacher_disagreement_score":0.8969043,"about_ca_system_score_codex":0.00004570489,"about_ca_system_score_gemma":0.000050344945,"threshold_uncertainty_score":0.5096139},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8961131,0.000011547111,0.049878582,0.00075688877,0.00038558175,0.0003234689,0.000019713292,0.00002894886,0.052482158],"genre_scores_gemma":[0.99907553,0.000007591781,0.00026541008,0.000036402893,0.000050244835,0.000008055741,0.000002908488,0.00000824135,0.0005456118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987227,0.000025010846,0.0004883975,0.0002855013,0.00025968254,0.00021873739],"domain_scores_gemma":[0.9986618,0.00013461393,0.00036642075,0.00019367613,0.00060227234,0.0000412173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042952973,0.00016990326,0.000285684,0.000112571215,0.00016102036,0.00007501174,0.00034394598,0.00005463186,0.00010972418],"category_scores_gemma":[0.0001007102,0.00013355943,0.00013425821,0.00051145686,0.00018919709,0.00025079012,0.00013811671,0.00019372987,0.000013142285],"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.000081608734,0.00020570998,0.005284336,0.000047314148,0.000019653657,4.4553875e-8,0.00024066145,0.0006103228,0.13445748,0.8353517,0.00014326259,0.023557898],"study_design_scores_gemma":[0.000028912247,0.000037969847,0.00038007833,0.00027545722,0.000018937515,1.3083539e-7,0.0008386949,0.15358171,0.5944502,0.2502338,0.000048317117,0.00010578346],"about_ca_topic_score_codex":0.00043043174,"about_ca_topic_score_gemma":0.000010727654,"teacher_disagreement_score":0.5851179,"about_ca_system_score_codex":0.0000119289,"about_ca_system_score_gemma":0.00010013236,"threshold_uncertainty_score":0.5446395},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014298023,0.000021647815,0.97952026,0.0033867427,0.00006272776,0.00031037378,0.000005186457,0.0001005522,0.002294499],"genre_scores_gemma":[0.917088,0.000031217915,0.082069226,0.00017197597,0.0000113259775,0.000002774597,7.124336e-7,0.000004971431,0.0006198209],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988428,0.000010083689,0.00033782385,0.0004035479,0.00021624606,0.0001895173],"domain_scores_gemma":[0.9988083,0.00009247326,0.00021311549,0.00026698806,0.000578517,0.00004057212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000420377,0.00014268745,0.00022582352,0.00023913026,0.0001872832,0.00027865902,0.0007342274,0.00006889757,0.00000404244],"category_scores_gemma":[0.0003034831,0.000109607376,0.00012410611,0.0010855643,0.00018397765,0.00030651112,0.0002476859,0.00012705517,0.0000037938537],"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.000051189712,0.000037924914,0.000012937792,0.000067001405,0.000043799733,1.7125609e-7,0.0015168695,0.000020582413,0.2595242,0.35554606,0.00011952681,0.38305977],"study_design_scores_gemma":[0.00001101363,0.000025887379,0.000026239524,0.000054590237,0.00003413294,2.9259053e-7,0.00017550644,0.5446332,0.38929588,0.065668665,0.000010825075,0.00006377521],"about_ca_topic_score_codex":0.00004158007,"about_ca_topic_score_gemma":0.000009188728,"teacher_disagreement_score":0.90278995,"about_ca_system_score_codex":0.000032436557,"about_ca_system_score_gemma":0.00006312655,"threshold_uncertainty_score":0.4469659},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022302238,0.00003824648,0.9630646,0.004867857,0.0006601055,0.0011918325,0.0000055494825,0.00021498618,0.0076545617],"genre_scores_gemma":[0.9728204,0.000047849477,0.02581406,0.00032162326,0.00008332063,0.00019669975,5.044795e-7,0.000013282397,0.00070224423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981935,0.000014022382,0.0005099206,0.00062434125,0.000301445,0.00035676733],"domain_scores_gemma":[0.99829143,0.0002101559,0.00033889685,0.0004263621,0.00067271956,0.00006043246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032970522,0.00023265058,0.00024270269,0.0001631986,0.00047065073,0.0001917611,0.0018569434,0.0001079714,0.000013394761],"category_scores_gemma":[0.00033248807,0.00018532621,0.000143835,0.001206972,0.00018618235,0.00038630216,0.00039121046,0.00026920435,0.00003053909],"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.000060931012,0.00008562625,0.000024314217,0.00003350323,0.000009850174,6.542194e-8,0.00020900484,0.00034019604,0.10328969,0.60207325,0.00012865468,0.29374492],"study_design_scores_gemma":[0.00003256883,0.00013325835,0.00007189714,0.00014460014,0.000013994239,0.0000017711344,0.00011458145,0.13422723,0.62314606,0.24060251,0.0013478281,0.0001636864],"about_ca_topic_score_codex":0.000016462605,"about_ca_topic_score_gemma":0.000025691981,"teacher_disagreement_score":0.9505182,"about_ca_system_score_codex":0.00008255033,"about_ca_system_score_gemma":0.00009462566,"threshold_uncertainty_score":0.7557383},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035111234,0.000008494237,0.961319,0.0009897333,0.00019954548,0.0005643565,0.0000039482675,0.0006827405,0.001120923],"genre_scores_gemma":[0.8861599,0.000006936133,0.11329385,0.00037113018,0.00002944319,0.00006316022,0.0000019233194,0.000015300388,0.000058333593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799716,0.000023164619,0.00055699964,0.00065239845,0.0003494112,0.00042084564],"domain_scores_gemma":[0.9980475,0.00011308133,0.00038863547,0.0003875549,0.0009832628,0.00008000442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072554225,0.00025603556,0.00029315043,0.00030093323,0.0004285867,0.00048213656,0.0016152895,0.00010511757,0.0000101456635],"category_scores_gemma":[0.00014700384,0.0001961972,0.00009343091,0.0012301538,0.000098979355,0.00046135322,0.00027264075,0.00020706712,0.000002010561],"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.000046332356,0.00021227868,0.00040802063,0.00010094173,0.000019031302,1.6076599e-7,0.0008528937,0.00013930857,0.028673436,0.94200164,0.00006733236,0.02747862],"study_design_scores_gemma":[0.00004482227,0.00015311547,0.000089797824,0.0005223652,0.000009539505,3.7781248e-7,0.00011432505,0.57658637,0.39926812,0.02302573,0.0000399924,0.00014542093],"about_ca_topic_score_codex":0.0000156473,"about_ca_topic_score_gemma":0.000040662486,"teacher_disagreement_score":0.9189759,"about_ca_system_score_codex":0.000040746956,"about_ca_system_score_gemma":0.00018030325,"threshold_uncertainty_score":0.800069},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7001668,0.00004966775,0.2929404,0.00042623415,0.00016497704,0.00019952553,0.0000019773263,0.00009164607,0.00595873],"genre_scores_gemma":[0.9988682,0.00007923885,0.0008160531,0.0000422751,0.00006758036,0.000015890171,0.0000019398385,0.000012078669,0.00009672986],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990632,0.000006153638,0.00032743768,0.00023415902,0.00020944179,0.00015961817],"domain_scores_gemma":[0.9994692,0.000022988168,0.00009338099,0.00010251702,0.00027839903,0.000033495584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017194492,0.00016028713,0.00018760648,0.00014179053,0.00016480169,0.00010291304,0.00016993134,0.00006607764,0.000009640534],"category_scores_gemma":[0.000038478567,0.000118399585,0.000049211747,0.00031128185,0.00008341957,0.0001668084,0.000051090177,0.0001577727,0.0000031854206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078437806,0.00010939935,0.0010787322,0.00030712568,0.0001326125,3.6708573e-7,0.0016645539,0.30311567,0.39472476,0.18869139,0.000094584575,0.11000237],"study_design_scores_gemma":[0.00002125345,0.000031181436,0.000049790488,0.00021549422,0.000046946807,0.0000011064391,0.00031983622,0.87227553,0.11094228,0.015986549,0.0000046722744,0.00010537222],"about_ca_topic_score_codex":0.000031154243,"about_ca_topic_score_gemma":0.00004370094,"teacher_disagreement_score":0.56915987,"about_ca_system_score_codex":0.000036469177,"about_ca_system_score_gemma":0.000016943506,"threshold_uncertainty_score":0.4828195},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28063992,0.000034444027,0.70608824,0.0009854031,0.00094272173,0.0009897916,0.000010464624,0.00020461413,0.010104402],"genre_scores_gemma":[0.99726063,0.000038379254,0.0024035233,0.000042877924,0.000031669864,0.000033642173,0.000005557449,0.000017165468,0.00016653718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989715,0.000005746081,0.00042273232,0.00023230333,0.00016458886,0.00020308381],"domain_scores_gemma":[0.99931353,0.00008041507,0.00011955693,0.0001278193,0.00032925163,0.00002944869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021658387,0.00014729354,0.00017453548,0.00014470554,0.00013839755,0.00010193213,0.000271822,0.00008679221,0.000021862124],"category_scores_gemma":[0.000335716,0.00012772664,0.00008213687,0.00044161058,0.00006394174,0.00012914643,0.00003004237,0.00012781065,0.000009036389],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013375518,0.000091186004,0.00067812233,0.00047485944,0.00006224965,1.7960001e-7,0.0007227764,0.205521,0.20941982,0.42773435,0.0001960642,0.15496564],"study_design_scores_gemma":[0.00002644631,0.00002542677,0.00025475517,0.00018752966,0.000020557518,3.137874e-7,0.00027553365,0.71333605,0.2580024,0.027766759,0.000015159124,0.000089064415],"about_ca_topic_score_codex":0.000015585063,"about_ca_topic_score_gemma":0.000023620638,"teacher_disagreement_score":0.71662074,"about_ca_system_score_codex":0.00007326185,"about_ca_system_score_gemma":0.000026249454,"threshold_uncertainty_score":0.5208541},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87243634,0.00007438699,0.10525514,0.0025542993,0.00029963773,0.0003286483,0.0000039127763,0.000056691744,0.018990919],"genre_scores_gemma":[0.99772847,0.000025488924,0.0018435703,0.00013200249,0.000018459226,0.000040262235,1.5977766e-7,0.0000062277227,0.00020533336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998401,0.000011589268,0.0005283556,0.0003963798,0.0003502016,0.00031248422],"domain_scores_gemma":[0.9989045,0.00009873446,0.00021961522,0.00045182963,0.00029056048,0.00003471289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005942634,0.0001723939,0.00024048447,0.0000876512,0.00008907606,0.00008806653,0.0022587453,0.000067860834,0.000027840824],"category_scores_gemma":[0.00029545263,0.00011821674,0.000098239005,0.00064581673,0.00012992322,0.00038136743,0.00064148754,0.0003390391,0.000004211931],"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.000040112947,0.00019649418,0.00027274984,0.00008428309,0.000016457525,7.2014467e-7,0.011816742,0.0014468585,0.12157372,0.8324325,0.000030350555,0.032088988],"study_design_scores_gemma":[0.00003138067,0.000012428351,0.000081220525,0.00028581382,0.0000031267446,5.942723e-7,0.0022145468,0.37381056,0.5654804,0.057973795,0.000012437847,0.0000936976],"about_ca_topic_score_codex":0.00010998201,"about_ca_topic_score_gemma":0.000014674613,"teacher_disagreement_score":0.7744587,"about_ca_system_score_codex":0.00004611068,"about_ca_system_score_gemma":0.00010224936,"threshold_uncertainty_score":0.48207387},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87221014,0.00010234291,0.099195495,0.009012572,0.00033439713,0.0029225063,0.000042436266,0.0001453575,0.016034767],"genre_scores_gemma":[0.9785897,0.00013314895,0.015349546,0.00028207607,0.000107911306,0.00008550629,0.0000075975377,0.00002735425,0.005417168],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978815,0.00001836257,0.00051663764,0.00050157105,0.00054952037,0.0005324434],"domain_scores_gemma":[0.99833524,0.00024949657,0.00021787577,0.00021801522,0.0008548578,0.00012449666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005406632,0.00028880485,0.00047850833,0.00025298583,0.0003754616,0.00013209414,0.0006589744,0.000117550364,0.00010973187],"category_scores_gemma":[0.00027746122,0.00018631795,0.00017943645,0.00063479046,0.00034808877,0.0001693439,0.00018580085,0.00038050648,0.000034998313],"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.006722824,0.00047398315,0.006756797,0.000897993,0.0003004275,0.000003982576,0.0013851913,0.0005243145,0.68539727,0.24941863,0.00086998893,0.047248624],"study_design_scores_gemma":[0.0001697747,0.0009631916,0.0013821947,0.0018362018,0.000096067,0.000013936008,0.000709629,0.043108027,0.91906375,0.03179778,0.00060859707,0.00025082653],"about_ca_topic_score_codex":0.00009185608,"about_ca_topic_score_gemma":0.000008125189,"teacher_disagreement_score":0.23366652,"about_ca_system_score_codex":0.000062993226,"about_ca_system_score_gemma":0.0002878491,"threshold_uncertainty_score":0.7597825},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2146967,0.00011284605,0.76350826,0.006859117,0.00019855426,0.0011045628,0.0000051431466,0.00023002527,0.013284774],"genre_scores_gemma":[0.9860435,0.00011802935,0.013189087,0.00031376115,0.000012798231,0.000029794004,7.2311343e-7,0.0000058763385,0.00028640963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987554,0.00001706125,0.00036021948,0.00039445958,0.00027433934,0.0001985182],"domain_scores_gemma":[0.99890745,0.0000934686,0.00020582935,0.00021083823,0.00053908327,0.00004330875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002613694,0.0001734381,0.00020570407,0.00012810707,0.00020063635,0.00026991256,0.00064147386,0.00006477523,0.000009165142],"category_scores_gemma":[0.00018377833,0.00012109624,0.00003831356,0.00066049583,0.00024773748,0.00063728716,0.0001546068,0.00017500267,0.000004775971],"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.00008580594,0.00006734938,0.00059056125,0.00008124827,0.000016254222,5.2113273e-7,0.0005097614,0.0000039753586,0.2143891,0.67409,0.00007104417,0.11009432],"study_design_scores_gemma":[0.000046904475,0.00022534415,0.00043348342,0.00029524238,0.000016673765,0.0000037044058,0.00035028253,0.008129917,0.86794204,0.12237665,0.000047476802,0.00013226156],"about_ca_topic_score_codex":0.000022272456,"about_ca_topic_score_gemma":0.000013093951,"teacher_disagreement_score":0.7713468,"about_ca_system_score_codex":0.000028230193,"about_ca_system_score_gemma":0.00009958218,"threshold_uncertainty_score":0.4938161},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19134416,0.000009146103,0.79102874,0.0042611314,0.0007988115,0.00080532365,0.0000048086695,0.00034537932,0.011402523],"genre_scores_gemma":[0.98166937,0.000079979545,0.016242294,0.0008815659,0.00007347175,0.00012109062,0.0000016697463,0.000013041205,0.00091753964],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99762064,0.000039655733,0.0007207042,0.00069552416,0.0005626773,0.00036077117],"domain_scores_gemma":[0.99809897,0.000114897695,0.00038277695,0.00041708222,0.000899749,0.00008652187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050754024,0.00030713537,0.00035199293,0.00029876668,0.0003143468,0.0003402436,0.0018907131,0.00016912146,0.0000931885],"category_scores_gemma":[0.0003868434,0.00023556601,0.00014229184,0.00091853447,0.00021095248,0.00043238897,0.00044151576,0.00038789277,0.00012075458],"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.00007206087,0.00026279874,0.000005706979,0.0000133286085,0.000014245512,2.5555545e-7,0.0002957465,0.000039326955,0.3838894,0.3748926,0.00035515116,0.24015938],"study_design_scores_gemma":[0.00007341237,0.00027018815,0.00002858021,0.00023230638,0.000010633864,0.0000011957308,0.000055448654,0.21316025,0.71343386,0.07253204,0.00002058523,0.00018149654],"about_ca_topic_score_codex":0.000022107277,"about_ca_topic_score_gemma":0.000005613906,"teacher_disagreement_score":0.79032516,"about_ca_system_score_codex":0.00009349562,"about_ca_system_score_gemma":0.000116210875,"threshold_uncertainty_score":0.96061033},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050771646,0.000024223324,0.9326677,0.0059891082,0.0019879902,0.0011749793,0.000008061965,0.00020002399,0.0071763014],"genre_scores_gemma":[0.9453049,0.0000033558822,0.05376488,0.00038825063,0.00012412183,0.00009777684,0.0000015209531,0.000016063794,0.00029917478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99727833,0.000051680363,0.00075288484,0.0007857505,0.00060657883,0.0005247756],"domain_scores_gemma":[0.9971045,0.0007046979,0.0005697691,0.00048342158,0.0010583982,0.00007916292],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001423588,0.0003208833,0.00038718368,0.0002666997,0.0005437772,0.00032301742,0.003045949,0.0001430361,0.000041252275],"category_scores_gemma":[0.0031142258,0.00026181532,0.00025009067,0.0010293619,0.000310994,0.00042544748,0.0005643677,0.0004169737,0.00001837317],"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.00016300827,0.00010183211,0.00039386516,0.0000940715,0.000027293207,1.7411985e-7,0.0005078274,0.0067239758,0.011995477,0.8875861,0.00023888753,0.09216748],"study_design_scores_gemma":[0.00014324917,0.00027197937,0.00016426823,0.00038024734,0.000038897768,6.6182565e-7,0.00033875665,0.6914078,0.15125854,0.1554024,0.00032689722,0.00026630526],"about_ca_topic_score_codex":0.000051175317,"about_ca_topic_score_gemma":0.00001277186,"teacher_disagreement_score":0.8945332,"about_ca_system_score_codex":0.00011549813,"about_ca_system_score_gemma":0.000380722,"threshold_uncertainty_score":0.99998343},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09960044,0.000024399054,0.8939371,0.004030108,0.00021995357,0.0009140957,0.0000038868934,0.000109360844,0.0011606516],"genre_scores_gemma":[0.9606463,0.00006450846,0.03850742,0.0001940761,0.000030494011,0.00013769831,4.078464e-7,0.0000084116855,0.00041071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857956,0.000009232243,0.0003666614,0.0005485469,0.00022668278,0.00026931026],"domain_scores_gemma":[0.99883187,0.00011744869,0.00022956957,0.00027444283,0.00048460963,0.00006203186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024373445,0.00018821936,0.00020063696,0.0001155119,0.00040635988,0.00013155016,0.00087547983,0.000090264424,0.0000034017635],"category_scores_gemma":[0.00013988194,0.00014886595,0.00007894553,0.000607048,0.00016534181,0.00029836976,0.00045454345,0.00013384385,0.000005612474],"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.00010470665,0.000090876616,0.00004983937,0.000042974465,0.0000073066144,4.6499952e-8,0.00056546397,0.0033856775,0.34882215,0.408105,0.000055112163,0.23877086],"study_design_scores_gemma":[0.000026229158,0.00005045101,0.000050588595,0.00006777826,0.0000074039517,8.353546e-7,0.00004024971,0.55754566,0.33175004,0.11035055,0.000026477963,0.00008372858],"about_ca_topic_score_codex":0.000019289453,"about_ca_topic_score_gemma":0.000036433557,"teacher_disagreement_score":0.86104584,"about_ca_system_score_codex":0.000047259025,"about_ca_system_score_gemma":0.000052353567,"threshold_uncertainty_score":0.60705775},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98234373,0.000015851545,0.0015669906,0.002297497,0.00014696227,0.00031986742,0.000013798686,0.000042565913,0.013252751],"genre_scores_gemma":[0.9992716,0.00001103337,0.00031190828,0.00015321176,0.00009307436,0.000004164952,0.0000024286392,0.0000041424223,0.00014846823],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9981496,0.000025966714,0.00037164628,0.00045083952,0.0005161689,0.00048578662],"domain_scores_gemma":[0.9989404,0.00018446552,0.00013400715,0.00016520235,0.0004249019,0.0001509936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013420574,0.00022839467,0.00035975454,0.000094264,0.0002624305,0.00015666787,0.000777631,0.000091337766,0.00049351424],"category_scores_gemma":[0.00037129867,0.00013413074,0.00012431029,0.0005927271,0.0016325682,0.00016677284,0.000090973626,0.00056132214,0.00009571886],"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.0008362052,0.00016440662,0.6140533,0.00009557047,0.000040537572,0.0000060210828,0.00016496563,0.000050967694,0.00204026,0.10644605,0.000027154294,0.27607453],"study_design_scores_gemma":[0.00010179759,0.0005934598,0.8661108,0.00048108477,0.00004352491,0.000019485697,0.00039731985,0.020572856,0.055836532,0.055522956,0.000023250848,0.00029691175],"about_ca_topic_score_codex":0.00019881257,"about_ca_topic_score_gemma":0.00043273804,"teacher_disagreement_score":0.27577764,"about_ca_system_score_codex":0.000013233427,"about_ca_system_score_gemma":0.00010208183,"threshold_uncertainty_score":0.60152656},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02839059,0.00006297065,0.96156853,0.0030816384,0.0005199508,0.0015343549,0.0000014951032,0.00025121716,0.0045892247],"genre_scores_gemma":[0.99043036,0.000117025564,0.008533916,0.00007745479,0.000029707999,0.0003607599,1.516899e-7,0.000011672572,0.00043893617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982064,0.000023670684,0.0005933753,0.00050977286,0.00033903916,0.0003277654],"domain_scores_gemma":[0.9976067,0.00031399535,0.0004873731,0.00036695533,0.00118102,0.00004397989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060332444,0.00023033239,0.00028013528,0.00019562148,0.0003690379,0.00010557093,0.0017858242,0.000059078964,0.0000075923035],"category_scores_gemma":[0.001304795,0.00016196056,0.0001929457,0.00068164786,0.00027594782,0.00044321772,0.0005403726,0.0003740668,0.00000595302],"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.000084634295,0.00012931606,0.000014485091,0.000057347042,0.00003180161,1.501007e-7,0.00640169,0.0028855582,0.014758024,0.8951551,0.000016903117,0.08046503],"study_design_scores_gemma":[0.000073630494,0.0003739721,0.0001275409,0.00033335364,0.000020914582,0.000001089952,0.0037712127,0.100822695,0.83906543,0.054867506,0.00035152453,0.00019111812],"about_ca_topic_score_codex":0.0000870962,"about_ca_topic_score_gemma":0.000014764605,"teacher_disagreement_score":0.96203977,"about_ca_system_score_codex":0.00018837377,"about_ca_system_score_gemma":0.00012848435,"threshold_uncertainty_score":0.660456},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045064844,0.000011724611,0.94203156,0.0043655764,0.00083690777,0.0008363684,0.000003694983,0.00009132583,0.006757968],"genre_scores_gemma":[0.98075074,0.0000044325097,0.016040439,0.00009365867,0.00011949322,0.000057272224,5.7219796e-7,0.0000111517475,0.002922214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99795467,0.000052510422,0.00072042196,0.0005297894,0.00040943973,0.00033319322],"domain_scores_gemma":[0.9973669,0.00042595895,0.0005224877,0.00021262703,0.0014006817,0.00007134793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094746833,0.00021551854,0.00033735158,0.0002707596,0.00034835917,0.00019889254,0.00088599726,0.000105810635,0.000012449344],"category_scores_gemma":[0.0015237038,0.00016829056,0.0001505137,0.0007771548,0.00010492122,0.00040692458,0.00030345947,0.00044146416,0.000019978886],"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.00009617087,0.000079928235,0.000729178,0.00008305415,0.000034140267,1.9523655e-7,0.0038863972,0.0006248312,0.054067146,0.908654,0.000090872105,0.03165411],"study_design_scores_gemma":[0.00005838886,0.0010710804,0.0005446888,0.001554902,0.000029605797,0.000004122681,0.0022371733,0.13946149,0.7639091,0.085744485,0.0051385015,0.0002464439],"about_ca_topic_score_codex":0.0000200163,"about_ca_topic_score_gemma":0.0000022196352,"teacher_disagreement_score":0.93568593,"about_ca_system_score_codex":0.00008161302,"about_ca_system_score_gemma":0.0001525366,"threshold_uncertainty_score":0.6862689},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5709622,0.00024789345,0.24930497,0.01142561,0.0017552107,0.0035213819,0.00002003672,0.0007278293,0.16203488],"genre_scores_gemma":[0.98333496,0.000032578053,0.015740683,0.0003046093,0.000096030875,0.0000771952,0.000002360444,0.000018985853,0.0003925812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975954,0.00001752977,0.0005608351,0.0007657763,0.000491074,0.00056934176],"domain_scores_gemma":[0.9974058,0.00018336234,0.00044779896,0.00041500808,0.0013981401,0.00014983607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005327833,0.00033900986,0.00040844953,0.000082661994,0.00028084638,0.00056368543,0.0016501172,0.00015378346,0.000066124616],"category_scores_gemma":[0.0003304461,0.00022941316,0.00021245827,0.0007085129,0.00054931326,0.0003786874,0.000298395,0.00040107057,0.00007156507],"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.00006767017,0.00040231715,0.00037697665,0.00012478694,0.000040428833,0.0000061017217,0.00090275233,0.000007298534,0.0052744914,0.94685477,0.00007134767,0.04587103],"study_design_scores_gemma":[0.00012823958,0.00081457087,0.00024267957,0.0005352635,0.000044600853,0.00007712091,0.001495404,0.024839466,0.42487067,0.5459084,0.00054465316,0.00049894815],"about_ca_topic_score_codex":0.000013701098,"about_ca_topic_score_gemma":0.00004169137,"teacher_disagreement_score":0.4195962,"about_ca_system_score_codex":0.000051932664,"about_ca_system_score_gemma":0.00045833745,"threshold_uncertainty_score":0.9355197},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055837994,0.0000139765625,0.9887096,0.0025921108,0.00069140276,0.0010569135,0.000006604226,0.00015222898,0.0011933285],"genre_scores_gemma":[0.9495,0.000005555571,0.04934507,0.00011239535,0.00013900064,0.00013841444,0.0000012283979,0.000027043156,0.0007312656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99755794,0.000022430862,0.00056773506,0.0006069412,0.0007317634,0.0005131832],"domain_scores_gemma":[0.99687356,0.0001901739,0.00033473372,0.00039531183,0.0020228324,0.00018341841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078032754,0.0002530946,0.00027884686,0.00015411015,0.00019712934,0.00037383244,0.002246971,0.00010805509,0.000008589263],"category_scores_gemma":[0.002196689,0.00019734938,0.00009716394,0.0007847266,0.00020812832,0.00090161257,0.0008124951,0.00026027748,0.00004892289],"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.00036304622,0.0002848627,0.000114777606,0.00035592823,0.000034472094,7.559729e-7,0.0045369333,0.013915732,0.024340576,0.7602262,0.00039512978,0.19543158],"study_design_scores_gemma":[0.000069211856,0.0002827723,0.000011949832,0.00012281549,0.000006306556,0.0000053602535,0.00027264204,0.7435699,0.06896058,0.1862791,0.0002111445,0.00020818674],"about_ca_topic_score_codex":0.000022640152,"about_ca_topic_score_gemma":0.000007839186,"teacher_disagreement_score":0.9439162,"about_ca_system_score_codex":0.00017461769,"about_ca_system_score_gemma":0.00023306713,"threshold_uncertainty_score":0.80476743},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9517703,0.00006788433,0.012769478,0.00034178235,0.00035916409,0.00064218644,0.00007162474,0.00002594581,0.03395161],"genre_scores_gemma":[0.9979008,0.000012480547,0.001850357,0.000022073298,0.00003349576,0.000015600343,6.3387336e-7,0.000008793417,0.0001557717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989894,0.0000047532135,0.00059227296,0.00023100509,0.00004029195,0.00014224504],"domain_scores_gemma":[0.99901754,0.00004231502,0.0006253756,0.000109335306,0.00017404287,0.000031411553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007509189,0.0001020573,0.00028147842,0.00008162884,0.00007778143,0.000024065392,0.00030674352,0.000058160098,0.000083689854],"category_scores_gemma":[0.00025882456,0.00009064114,0.000073754054,0.00013403852,0.00030060488,0.00011613061,0.00005509976,0.00007568058,0.00001735353],"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.00006990207,0.00006142333,0.003307982,0.00008765963,0.000012140749,1.3936735e-8,0.001398365,0.000001806642,0.0011747597,0.990598,0.000010514319,0.0032774147],"study_design_scores_gemma":[0.000030704574,0.00016683842,0.003582401,0.00008322438,0.0000058260703,9.120742e-7,0.0004950122,0.01372156,0.09339381,0.888364,0.000051604842,0.00010408245],"about_ca_topic_score_codex":0.0001442006,"about_ca_topic_score_gemma":0.0000071826653,"teacher_disagreement_score":0.102234,"about_ca_system_score_codex":0.000012155656,"about_ca_system_score_gemma":0.0000075457983,"threshold_uncertainty_score":0.36962384},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078001045,0.00019193727,0.8910595,0.021237722,0.00061902206,0.0026175012,0.000011205002,0.00014313827,0.006118924],"genre_scores_gemma":[0.91195244,0.00014679373,0.08524694,0.00059806963,0.00011596647,0.00015987689,0.000002257171,0.000013530355,0.0017641031],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799275,0.000014987369,0.00073489116,0.00051150896,0.0004005496,0.0003452853],"domain_scores_gemma":[0.9985514,0.000075263946,0.00042009313,0.00033255602,0.000515677,0.000104953826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004909229,0.00021499151,0.000360251,0.00013022176,0.00017672993,0.00031147746,0.0017801283,0.000063973275,0.0001239011],"category_scores_gemma":[0.00024458225,0.0001458737,0.0002868257,0.00046605285,0.00012677125,0.00039985773,0.00035008928,0.00019448697,0.00014102014],"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.0000142427125,0.00025994473,0.00005462724,0.00003460586,0.000023680126,4.2910848e-8,0.00074835896,0.00018696328,0.021036917,0.84824896,0.0022118045,0.12717986],"study_design_scores_gemma":[0.000024598952,0.000084874446,0.00003138068,0.00012839455,0.000014327778,6.301218e-7,0.00009246054,0.8031647,0.05118567,0.14477327,0.00034956043,0.0001501411],"about_ca_topic_score_codex":0.0000139805115,"about_ca_topic_score_gemma":0.0000042390266,"teacher_disagreement_score":0.8339514,"about_ca_system_score_codex":0.000032816297,"about_ca_system_score_gemma":0.000056134762,"threshold_uncertainty_score":0.59485567},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9840508,0.000011507001,0.0011930377,0.0014117276,0.0001476276,0.0014478334,0.000012642273,0.000034361205,0.01169044],"genre_scores_gemma":[0.99899083,0.0000030872795,0.00028495264,0.00012490868,0.000043494645,0.00013113444,4.165724e-7,0.00001724128,0.0004039523],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99840474,0.0000114996055,0.000522649,0.0003781659,0.00037152675,0.0003113962],"domain_scores_gemma":[0.99895096,0.00019731747,0.00042970074,0.0002253706,0.0001213492,0.0000752958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051775284,0.00017972347,0.00029244582,0.00004354045,0.00011910232,0.00007382186,0.0010343717,0.00008127501,0.00061065826],"category_scores_gemma":[0.0005456945,0.00012932695,0.00012175357,0.0002383309,0.00033752134,0.00024651614,0.00020245354,0.00013584804,0.0001843489],"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.0004315269,0.00045836417,0.052460805,0.0003663634,0.000068110574,2.153582e-7,0.0022506495,0.0011533976,0.73157984,0.088638276,0.0043976493,0.11819479],"study_design_scores_gemma":[0.00014209439,0.00061734236,0.006330675,0.00045005453,0.000039372826,0.0000031099034,0.0006243317,0.30345258,0.6350207,0.051986884,0.00096943317,0.0003634283],"about_ca_topic_score_codex":0.00064649543,"about_ca_topic_score_gemma":0.000034241493,"teacher_disagreement_score":0.30229917,"about_ca_system_score_codex":0.000052336774,"about_ca_system_score_gemma":0.0000107914,"threshold_uncertainty_score":0.668628},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64634603,0.000052488063,0.20803648,0.03100269,0.00097956,0.0017412187,0.000030148642,0.00047241987,0.11133898],"genre_scores_gemma":[0.95324445,0.000012566574,0.045900304,0.00029453746,0.00005843819,0.000097742966,6.342208e-7,0.0000091640395,0.00038219566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998444,0.000008560461,0.00041438453,0.0004532009,0.00037037648,0.00030947363],"domain_scores_gemma":[0.998495,0.00006530479,0.00029001894,0.00038170675,0.00066915835,0.00009885181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002529046,0.00017907938,0.00019733397,0.00008945903,0.00020704113,0.00045801193,0.0025391832,0.00006397749,0.00012448127],"category_scores_gemma":[0.00023319988,0.00013135718,0.00008399993,0.0006361335,0.00020833664,0.00066553935,0.0005065596,0.00017623654,0.000346082],"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.0000025872491,0.00007010172,0.000108732354,0.000009802112,0.000008266858,1.2709049e-7,0.00084801984,0.0000042154034,0.013512555,0.6844893,0.000979754,0.29996654],"study_design_scores_gemma":[0.000030443634,0.00022198938,0.0023469308,0.00019940025,0.000013779327,0.000009140629,0.0014731687,0.22251198,0.5602335,0.21190849,0.00065191387,0.00039931675],"about_ca_topic_score_codex":0.00016918882,"about_ca_topic_score_gemma":0.0000041003864,"teacher_disagreement_score":0.5467209,"about_ca_system_score_codex":0.000027736103,"about_ca_system_score_gemma":0.00009207987,"threshold_uncertainty_score":0.5356591},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95994616,0.000034600533,0.004131026,0.002612136,0.00038353432,0.00024566596,0.000018141278,0.000040732215,0.032587998],"genre_scores_gemma":[0.9987698,0.000022364035,0.00014290138,0.00023748,0.00009098307,0.000011844702,8.2060865e-7,0.000014114282,0.00070967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876225,0.000014190209,0.00055665825,0.000342167,0.00007266124,0.00025205783],"domain_scores_gemma":[0.9990463,0.00008394186,0.00050332636,0.00015929535,0.00014554731,0.0000615896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010041787,0.00016773975,0.00030124767,0.00014281021,0.00017602109,0.00014593962,0.00041176024,0.00008858108,0.00007461033],"category_scores_gemma":[0.00044864538,0.00014007282,0.000067873116,0.00024405311,0.0003063486,0.00018462252,0.000092051465,0.00016369743,0.00008183654],"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.000028342483,0.000029325529,0.0020937067,0.000037719306,0.000009648481,2.9011952e-8,0.0009568996,0.00037491712,0.0015432343,0.9907346,0.000037791455,0.0041537937],"study_design_scores_gemma":[0.000068376845,0.00019504836,0.00283322,0.00021141928,0.000012926142,0.0000049169553,0.0016393412,0.078234285,0.031048294,0.88470095,0.0006867031,0.00036452606],"about_ca_topic_score_codex":0.00033640102,"about_ca_topic_score_gemma":0.000042943393,"teacher_disagreement_score":0.106033646,"about_ca_system_score_codex":0.000041231986,"about_ca_system_score_gemma":0.000012823275,"threshold_uncertainty_score":0.5712004},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2508025,0.00013304096,0.10892031,0.0012510234,0.0014886578,0.00088508904,0.000014280984,0.00032758908,0.6361775],"genre_scores_gemma":[0.99669653,0.00004413211,0.0027381782,0.00005268096,0.000047399633,0.000012953047,2.0405493e-7,0.000007739333,0.00040016766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99856776,0.000021185231,0.00047250045,0.00035776326,0.00031214525,0.00026863805],"domain_scores_gemma":[0.9981966,0.00008229223,0.00043079775,0.00034759374,0.0008685304,0.00007415706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044340984,0.00018207192,0.00026904565,0.000120486526,0.00016474507,0.000080905,0.0018869274,0.000084669075,0.0001611816],"category_scores_gemma":[0.0005122379,0.00012525903,0.00013271057,0.000706284,0.00041601187,0.0003990417,0.00036389774,0.00021779924,0.00007536953],"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.000033388562,0.000135825,0.00066440157,0.00002929624,0.000014976901,2.3828431e-7,0.004016846,7.543534e-7,0.014977393,0.96632797,0.000072186616,0.013726738],"study_design_scores_gemma":[0.000014689882,0.0001792377,0.0009053757,0.00012370113,0.0000131959705,0.0000038799926,0.00051628076,0.0021781872,0.5479111,0.44793376,0.000087857064,0.00013270881],"about_ca_topic_score_codex":0.0000593413,"about_ca_topic_score_gemma":0.000012274507,"teacher_disagreement_score":0.7458941,"about_ca_system_score_codex":0.00002218405,"about_ca_system_score_gemma":0.00009645465,"threshold_uncertainty_score":0.5107915},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037255906,0.00003843128,0.9555289,0.0038364974,0.00096104847,0.0010662414,0.00003177013,0.00011453382,0.0011666603],"genre_scores_gemma":[0.9154703,0.000026512953,0.08369236,0.0002685391,0.00021948716,0.0001789824,0.0000035164992,0.00003087164,0.00010943206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9956253,0.000050148752,0.0017131439,0.0011869243,0.0008154587,0.00060899515],"domain_scores_gemma":[0.9931977,0.000740048,0.0012830613,0.00078951305,0.003839095,0.00015057654],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085695024,0.00047871392,0.00070402067,0.00026948968,0.00032813204,0.00034408947,0.0030283032,0.00021915603,0.00006850911],"category_scores_gemma":[0.0012314338,0.00040860957,0.00042071313,0.0015832825,0.00078718853,0.00083338015,0.0008252199,0.0004809543,0.00005405656],"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.00012170593,0.00049294246,0.000040170038,0.000070192116,0.00004494949,4.314144e-7,0.005671228,0.00065469125,0.12371763,0.6378104,0.00006449314,0.23131117],"study_design_scores_gemma":[0.0000132863715,0.0002346961,0.000029852545,0.00019005818,0.000017901006,0.0000076136757,0.0028127197,0.2658023,0.5570595,0.17346688,0.00011890134,0.00024627763],"about_ca_topic_score_codex":0.000063398526,"about_ca_topic_score_gemma":0.000059021313,"teacher_disagreement_score":0.8782144,"about_ca_system_score_codex":0.000116618496,"about_ca_system_score_gemma":0.00036374398,"threshold_uncertainty_score":0.99983656},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93483263,0.00014666856,0.012106674,0.016643116,0.000894669,0.0009482589,0.00000330813,0.00030573318,0.034118924],"genre_scores_gemma":[0.9947501,0.000022929315,0.0045322054,0.00023586943,0.00005580665,0.000037900016,2.1698415e-7,0.00000984224,0.0003551733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9977758,0.000029431521,0.0006367871,0.00054759224,0.00054885953,0.00046153896],"domain_scores_gemma":[0.9984769,0.00009010097,0.00029988316,0.00036362413,0.000658848,0.000110629684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009275786,0.00025082094,0.00035349163,0.00015672026,0.0001160437,0.00029767846,0.0021266572,0.00010388075,0.000014941729],"category_scores_gemma":[0.0012301607,0.00014843373,0.000088385845,0.0007046746,0.00033991554,0.00065891567,0.0005762632,0.00031519198,0.00006104201],"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.00012311238,0.00027441996,0.0050655073,0.000069553134,0.000012531201,0.000008095955,0.009100659,0.000042182335,0.010788628,0.8445522,0.00041876436,0.12954435],"study_design_scores_gemma":[0.00013270251,0.00050970004,0.006559021,0.0007922949,0.000013418392,0.000032770244,0.014978317,0.10052769,0.56505966,0.31047776,0.00028837062,0.00062831317],"about_ca_topic_score_codex":0.0002853824,"about_ca_topic_score_gemma":0.00007403781,"teacher_disagreement_score":0.55427104,"about_ca_system_score_codex":0.000069155896,"about_ca_system_score_gemma":0.00019579497,"threshold_uncertainty_score":0.6052952},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95006806,0.00003361863,0.03749076,0.006867819,0.00022275918,0.00032246174,0.000009830429,0.000041415275,0.004943277],"genre_scores_gemma":[0.99867743,0.000035946938,0.0009930865,0.0001550066,0.000020295904,0.00001340882,3.2614744e-7,0.000004573274,0.00009993612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99858636,0.000028299839,0.0003774535,0.00034002896,0.00046655626,0.0002012952],"domain_scores_gemma":[0.99853206,0.00017026177,0.0003265137,0.0002950749,0.00059072615,0.00008534631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006014901,0.0001527097,0.00023406725,0.00015253405,0.00014213736,0.00011251719,0.0012431968,0.000053851327,0.000029072866],"category_scores_gemma":[0.0006492964,0.00008280002,0.00010855518,0.00084926176,0.0003252676,0.00026395594,0.0003563798,0.00018056929,0.000030403256],"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.00011114914,0.0001789558,0.00062324735,0.000038840495,0.00005129825,3.066747e-7,0.0038183327,0.0001717503,0.035769217,0.919747,0.00030968038,0.039180227],"study_design_scores_gemma":[0.000027317004,0.0003479773,0.0006086227,0.0002914086,0.000066263565,0.0000015740402,0.002289178,0.11221147,0.70673084,0.17723636,0.000027696604,0.0001612578],"about_ca_topic_score_codex":0.00009189466,"about_ca_topic_score_gemma":0.000013497384,"teacher_disagreement_score":0.7425106,"about_ca_system_score_codex":0.000013928035,"about_ca_system_score_gemma":0.000054324977,"threshold_uncertainty_score":0.3376487},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.112660974,0.000100329,0.8778299,0.0027673235,0.0035965838,0.0011301031,0.000028371811,0.00016640146,0.0017199861],"genre_scores_gemma":[0.9313929,0.000023256665,0.06695736,0.0002581679,0.0011602069,0.00009722599,9.2187344e-7,0.00004160939,0.0000683589],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99480563,0.00011490674,0.0013344337,0.0016492825,0.0011304949,0.00096522574],"domain_scores_gemma":[0.99648315,0.00024848894,0.0009470956,0.0009552878,0.0010649743,0.00030100116],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012329497,0.0006768814,0.00087046286,0.00028801372,0.0004123285,0.0011909377,0.0052976087,0.00040826178,0.000015497779],"category_scores_gemma":[0.00034156098,0.0004942476,0.00030981927,0.0005826528,0.00032702732,0.00056379044,0.004680851,0.0012473405,0.000020483423],"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.00002913205,0.000033023145,0.000018364346,0.000064874286,0.000031012485,0.0000013504657,0.00084739836,0.28701615,0.010565607,0.68045133,0.00003619968,0.020905567],"study_design_scores_gemma":[0.000014724183,0.000049549802,0.0000035633896,0.0009028941,0.00001748076,0.0000064653577,0.000038356477,0.59538287,0.017825512,0.38540405,0.000014415887,0.00034011592],"about_ca_topic_score_codex":0.0002462331,"about_ca_topic_score_gemma":0.00001011785,"teacher_disagreement_score":0.8187319,"about_ca_system_score_codex":0.0002607259,"about_ca_system_score_gemma":0.00043752082,"threshold_uncertainty_score":0.9998459},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7708454,0.00010805774,0.15043683,0.0035105427,0.0010090326,0.0014644958,0.0000029404541,0.0002264114,0.07239625],"genre_scores_gemma":[0.9952934,0.000018495934,0.0043801256,0.000058792517,0.00004637681,0.000039148217,3.7646365e-7,0.000007586539,0.00015574125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99836063,0.000025627873,0.0005084986,0.00036394212,0.00046172715,0.0002795478],"domain_scores_gemma":[0.9978651,0.000115641626,0.00049834617,0.00028587165,0.0011572539,0.00007783349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004490914,0.00018815078,0.00025750836,0.00010192807,0.00016249536,0.00019385453,0.0016655745,0.00009182969,0.00009947547],"category_scores_gemma":[0.0005021795,0.00012074584,0.000114479335,0.0005373903,0.00033121827,0.00056246325,0.0003737085,0.00017669483,0.00012619136],"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.000016896403,0.00012549636,0.00034661498,0.000030374156,0.0000073939627,8.5186954e-8,0.002056761,0.0000060236634,0.07597376,0.8024847,0.000071790855,0.11888012],"study_design_scores_gemma":[0.000021797876,0.00018772812,0.0007677303,0.00014764938,0.000005905711,0.0000016550679,0.00033138428,0.039328344,0.6219651,0.3371025,0.000019572706,0.00012061236],"about_ca_topic_score_codex":0.000054665263,"about_ca_topic_score_gemma":0.0000074855157,"teacher_disagreement_score":0.54599136,"about_ca_system_score_codex":0.000028821798,"about_ca_system_score_gemma":0.000093070674,"threshold_uncertainty_score":0.49238724},"labels":[],"label_agreement":null}]}