{"meta":{"query_hash":"fca9349e28ed","filters":{"venue":"ACM Transactions on Information Systems"},"cohort_total":57,"direct_labels_cover":0,"predictions_cover":57,"exported":57,"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/fca9349e28ed","api":"https://metacan.xera.ac/api/v1/cohort?venue=ACM+Transactions+on+Information+Systems"},"results":[{"id":"W1969806156","doi":"10.1145/1055709.1055712","title":"A methodology for analyzing SAGE libraries for cancer profiling","year":2005,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","topic":"Gene expression and cancer classification","field":"Biochemistry, Genetics and Molecular Biology","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":"Genome British Columbia; University of British Columbia; University of Alberta","funders":"","keywords":"Serial analysis of gene expression; Breast cancer; Computer science; Prostate cancer; Computational biology; SAGE; Cancer; Ovarian cancer; Gene expression profiling; Preprocessor; Bioinformatics; Gene expression; Biology; Artificial intelligence; Gene; Genetics","score_opus":0.06054475317927263,"score_gpt":0.33295577610078814,"score_spread":0.27241102292151553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969806156","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025754578,0.00017635964,0.99099064,0.00009126437,0.000165418,0.0005502141,0.000966366,0.0037219585,0.0007622861],"genre_scores_gemma":[0.004128092,0.00016803043,0.9916114,0.000075785225,0.00003486308,0.0010922708,0.0013792167,0.00032631442,0.0011840584],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99717593,0.0006431398,0.00032545466,0.0004924106,0.0012127182,0.00015033444],"domain_scores_gemma":[0.99760485,0.00056105555,0.00028226175,0.00086208736,0.000553421,0.0001363213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026762406,0.001395404,0.001217869,0.0039195325,0.0015178048,0.0015065136,0.0012721175,0.00082394964,0.0048565487],"category_scores_gemma":[0.0037906938,0.0010131134,0.0017793509,0.0042533935,0.0009495079,0.00071309746,0.0012335024,0.0030681533,0.0038594182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021454532,0.00021868858,0.0024410603,0.0007424107,0.00024511074,0.0003505191,0.00044622406,0.0042137858,0.651056,0.01658497,0.014183994,0.3093027],"study_design_scores_gemma":[0.00022953826,0.0013166436,0.016836163,0.00017865712,0.00031191923,0.00481425,0.00027400427,0.0790451,0.5345177,0.040651888,0.32134405,0.00048013337],"about_ca_topic_score_codex":0.0006570651,"about_ca_topic_score_gemma":0.0023015868,"teacher_disagreement_score":0.0048565487,"about_ca_system_score_codex":0.00048764233,"about_ca_system_score_gemma":0.0011079863,"threshold_uncertainty_score":0.016246796},"labels":[],"label_agreement":null},{"id":"W1999003664","doi":"10.1145/2735629","title":"A General SIMD-Based Approach to Accelerating Compression Algorithms","year":2015,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"SIMD; Computer science; Data compression; Decoding methods; Algorithm; Compression ratio; Compression (physics); Parallel computing; Encoding (memory); Group (periodic table); Artificial intelligence","score_opus":0.06561336432163029,"score_gpt":0.2778084545504484,"score_spread":0.2121950902288181,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999003664","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017337749,0.0012097184,0.96556836,0.00047986011,0.00027190917,0.00018222297,0.0003447546,0.0053492435,0.009256084],"genre_scores_gemma":[0.16068634,0.00084020296,0.8295766,0.00054768025,0.00018671594,0.0003296504,0.0010695718,0.00036159655,0.006401673],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990621,0.000110128465,0.000081319886,0.00018884716,0.00047581556,0.00008178864],"domain_scores_gemma":[0.99905354,0.00017183517,0.000051103594,0.0003715615,0.00031635357,0.000035646197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006944527,0.0010171047,0.00058019045,0.001695532,0.0006597397,0.0014580507,0.0018619107,0.00066594064,0.004925209],"category_scores_gemma":[0.0022523776,0.0003539948,0.0006340732,0.0026376771,0.0010164818,0.002517666,0.0014955563,0.0013758261,0.0022020356],"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.0007490219,0.0002369484,0.0022461389,0.00044651193,0.00009802285,0.00023276552,0.00025620722,0.1120053,0.08621914,0.11180464,0.021067034,0.6646382],"study_design_scores_gemma":[0.00013403052,0.0003710444,0.0004812573,0.000054703378,0.000041039413,0.00046097228,0.000084473955,0.7805342,0.1288283,0.044355858,0.044590868,0.00006329016],"about_ca_topic_score_codex":0.0017173568,"about_ca_topic_score_gemma":0.0023498847,"teacher_disagreement_score":0.004925209,"about_ca_system_score_codex":0.0010834788,"about_ca_system_score_gemma":0.0014404717,"threshold_uncertainty_score":0.016476512},"labels":[],"label_agreement":null},{"id":"W2035512259","doi":"10.1145/333135.333137","title":"Shortest-substring retrieval and ranking","year":2000,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Toronto","funders":"","keywords":"Computer science; Ranking (information retrieval); Information retrieval; Relevance (law); Boolean conjunctive query; Substring; Matching (statistics); Standard Boolean model; Phrase; Learning to rank; Simple (philosophy); Theoretical computer science; Data mining; Boolean expression; Algorithm; Boolean function; And-inverter graph; Search engine; Data structure; Artificial intelligence; Web search query; Mathematics; Statistics; Web query classification","score_opus":0.013760319804854381,"score_gpt":0.2269255291116297,"score_spread":0.21316520930677532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035512259","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033750837,0.00056344416,0.9890428,0.00048421303,0.000074344665,0.00019464681,0.0005252195,0.001695304,0.0040449086],"genre_scores_gemma":[0.15226388,0.0018338137,0.81724083,0.00046201277,0.0004834269,0.00085895194,0.003558653,0.00063889695,0.0226595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995939,0.0011981673,0.0003603443,0.0006736077,0.0015761512,0.00025267218],"domain_scores_gemma":[0.995965,0.0015734658,0.00027725118,0.0013792892,0.0006716146,0.00013334499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030533196,0.001060554,0.0020095587,0.0033452509,0.0014119281,0.0046874145,0.004409795,0.0024261638,0.008790111],"category_scores_gemma":[0.011460092,0.0006662733,0.0018505757,0.006578992,0.0016092483,0.010442583,0.0018036076,0.0017836901,0.0074054035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028547866,0.00021064265,0.0011158399,0.0004926844,0.00011009348,0.0004128224,0.0003610577,0.1399338,0.0053081713,0.62382895,0.018844882,0.2090956],"study_design_scores_gemma":[0.000058006564,0.000144021,0.00020595535,0.00003593201,0.000055970773,0.00041065417,0.00006401873,0.65079623,0.0033654282,0.31560448,0.02918219,0.00007713698],"about_ca_topic_score_codex":0.0070970603,"about_ca_topic_score_gemma":0.005785719,"teacher_disagreement_score":0.008790111,"about_ca_system_score_codex":0.0023589334,"about_ca_system_score_gemma":0.0021430687,"threshold_uncertainty_score":0.029405832},"labels":[],"label_agreement":null},{"id":"W2046353967","doi":"10.1145/1740592.1740594","title":"Exploiting query logs for cross-lingual query suggestions","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","topic":"Topic Modeling","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":"Université de Montréal","funders":"Microsoft Research Asia; Chinese University of Hong Kong; Innovation and Technology Commission","keywords":"Computer science; Cross-language information retrieval; Query expansion; Query language; RDF query language; Query optimization; Information retrieval; Web query classification; Sargable; Natural language processing; Relevance (law); Web search query; Discriminative model; Query by Example; Artificial intelligence; Search engine","score_opus":0.027786355921336915,"score_gpt":0.2897494147459037,"score_spread":0.2619630588245668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046353967","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15674108,0.005383803,0.7637402,0.0025693239,0.0004349156,0.0016486059,0.0069594323,0.05466308,0.007859611],"genre_scores_gemma":[0.69882447,0.0013162754,0.27968967,0.0005582467,0.0002844184,0.00073734793,0.014046262,0.001414001,0.0031293563],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9915353,0.0038295118,0.0007176275,0.0010733542,0.0025169877,0.0003272876],"domain_scores_gemma":[0.95759994,0.027358532,0.0022227785,0.005802633,0.0063659055,0.000650103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007814266,0.002422083,0.002437064,0.0055109696,0.0012460272,0.003119016,0.0022491768,0.0013263121,0.0034122667],"category_scores_gemma":[0.042332273,0.0012698016,0.00091907807,0.004314958,0.0006778713,0.0091549,0.0025852274,0.002520194,0.003177269],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0039820955,0.0020892294,0.030157465,0.002504461,0.0004433674,0.0011182622,0.0029673895,0.036595244,0.07507897,0.006487144,0.04029147,0.7982849],"study_design_scores_gemma":[0.00024969876,0.0007000424,0.008089249,0.00012984654,0.00027433565,0.00073127775,0.0011029857,0.9113534,0.03740725,0.012850291,0.02686367,0.0002479376],"about_ca_topic_score_codex":0.008908823,"about_ca_topic_score_gemma":0.012763482,"teacher_disagreement_score":0.008908823,"about_ca_system_score_codex":0.0010832853,"about_ca_system_score_gemma":0.0031007638,"threshold_uncertainty_score":0.041326344},"labels":[],"label_agreement":null},{"id":"W2052842594","doi":"10.1145/2590988","title":"Modeling Term Associations for Probabilistic Information Retrieval","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","topic":"Information Retrieval and Search Behavior","field":"Computer Science","cited_by":51,"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; International Business Machines Corporation","keywords":"Term Discrimination; Computer science; Term (time); Bigram; Divergence-from-randomness model; Probabilistic logic; Ranking (information retrieval); Query expansion; Information retrieval; Data mining; Artificial intelligence; Web search query; Search engine; Concept search; Trigram","score_opus":0.03054072446624775,"score_gpt":0.26785701334439205,"score_spread":0.2373162888781443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052842594","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01150598,0.0014162783,0.98416626,0.00033885814,0.000056892277,0.00009500788,0.00025781748,0.0006733853,0.0014894928],"genre_scores_gemma":[0.6159866,0.0037963346,0.36500892,0.00047258675,0.0005371277,0.0009243336,0.0020494782,0.00036847554,0.0108561525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99546117,0.0015142164,0.00036518517,0.0009759381,0.0013297144,0.00035384734],"domain_scores_gemma":[0.9926813,0.0046387226,0.0009394166,0.0008443351,0.0007646119,0.00013163147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043336106,0.0014863259,0.00192702,0.003842405,0.00092748477,0.0025246823,0.0032742508,0.002701929,0.002743546],"category_scores_gemma":[0.019838283,0.00097254117,0.002314277,0.006262755,0.0014495129,0.0079173455,0.0020724444,0.0021966854,0.0022537133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023664912,0.00013237329,0.0029658924,0.00039226824,0.00019765366,0.0003128555,0.00040967486,0.6860224,0.0056416905,0.15638,0.004194378,0.14311413],"study_design_scores_gemma":[0.000011995925,0.00004251246,0.00027371975,0.000011127234,0.00003313255,0.00011266814,0.000018525654,0.9534232,0.0004575095,0.04411577,0.0014726381,0.000027160375],"about_ca_topic_score_codex":0.0076212212,"about_ca_topic_score_gemma":0.0071632094,"teacher_disagreement_score":0.0076212212,"about_ca_system_score_codex":0.0020353138,"about_ca_system_score_gemma":0.0014861766,"threshold_uncertainty_score":0.022918642},"labels":[],"label_agreement":null},{"id":"W2058737869","doi":"10.1145/1247715.1247717","title":"Online supervised spam filter evaluation","year":2007,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","topic":"Spam and Phishing Detection","field":"Computer Science","cited_by":117,"is_retracted":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; Filter (signal processing); Set (abstract data type); Software; Receiver operating characteristic; Confidence interval; Information retrieval; Data mining; Machine learning; Artificial intelligence; Statistics; Mathematics; Operating system","score_opus":0.03922481280749248,"score_gpt":0.2785531126448064,"score_spread":0.23932829983731393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058737869","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8385979,0.0015913902,0.13403022,0.0004104247,0.0004297313,0.0008312212,0.002160532,0.01426054,0.0076879608],"genre_scores_gemma":[0.90220135,0.00018243815,0.08380874,0.00021157747,0.00014320418,0.0003589398,0.005601462,0.0002696189,0.00722253],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99365705,0.0021334433,0.00052618486,0.0012200673,0.0018552352,0.00060797913],"domain_scores_gemma":[0.98232687,0.0076344428,0.0010599247,0.0025410238,0.0055629485,0.0008747604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009281714,0.0019714527,0.0023023952,0.0026551674,0.001147934,0.0012772176,0.0021796965,0.003620149,0.0037430034],"category_scores_gemma":[0.016418627,0.00039390326,0.00081109966,0.0010415377,0.0007611739,0.0020858252,0.001292199,0.0012404071,0.0025050605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005432546,0.004897409,0.044321317,0.00067215133,0.001080869,0.00048197832,0.0003759146,0.21056803,0.019276688,0.0015748012,0.032556776,0.6787615],"study_design_scores_gemma":[0.00022248452,0.0011481228,0.011668957,0.000026006674,0.00012714234,0.00030760866,0.00012630182,0.9514154,0.029890757,0.0009477662,0.0040629636,0.000056474302],"about_ca_topic_score_codex":0.0044824486,"about_ca_topic_score_gemma":0.0061419797,"teacher_disagreement_score":0.009281714,"about_ca_system_score_codex":0.0016153927,"about_ca_system_score_gemma":0.0016064484,"threshold_uncertainty_score":0.049086988},"labels":[],"label_agreement":null},{"id":"W2063529879","doi":"10.1145/358108.358114","title":"Beyond intratransaction association analysis","year":2000,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":153,"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":"Badan Riset dan Inovasi Nasional; Helsingin Yliopisto","keywords":"Association rule learning; Apriori algorithm; Database transaction; Computer science; Association (psychology); Transaction data; Affinity analysis; Data mining; Data science; Psychology; Database","score_opus":0.007761500766622136,"score_gpt":0.22556361950399387,"score_spread":0.21780211873737174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063529879","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041743524,0.002331823,0.94706273,0.00085884234,0.00020196429,0.0001958377,0.0011896086,0.001032099,0.0053835325],"genre_scores_gemma":[0.5820517,0.0016869123,0.40500385,0.0009091166,0.00061021664,0.00040938915,0.0049740407,0.00040899462,0.003945802],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9759803,0.005716295,0.0022951758,0.0064044804,0.008728353,0.00087539206],"domain_scores_gemma":[0.93066114,0.03607225,0.009458841,0.013144942,0.009642364,0.0010205079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01113132,0.0018759372,0.002302752,0.008572572,0.0017142092,0.006259198,0.004534108,0.0019306072,0.003162001],"category_scores_gemma":[0.053748995,0.00076053216,0.0026025702,0.011217042,0.0021348626,0.0096499985,0.0048948308,0.003945418,0.0022049546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000577142,0.0004845112,0.13669473,0.0010624127,0.0017932756,0.002047279,0.0017174154,0.07279047,0.0037161238,0.1138321,0.00889225,0.65639234],"study_design_scores_gemma":[0.000054830893,0.00025756765,0.018463032,0.00035926912,0.00056552055,0.0025784597,0.0013398591,0.5614007,0.0074684634,0.3578354,0.049481455,0.00019538731],"about_ca_topic_score_codex":0.002621876,"about_ca_topic_score_gemma":0.0018159195,"teacher_disagreement_score":0.01113132,"about_ca_system_score_codex":0.0008298,"about_ca_system_score_gemma":0.0019511824,"threshold_uncertainty_score":0.058868706},"labels":[],"label_agreement":null},{"id":"W2067662418","doi":"10.1145/1344411.1344415","title":"Locality-Based pruning methods for web search","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","topic":"Algorithms and Data Compression","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":"Fundação para a Ciência e a Tecnologia; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Pruning; Computer science; Locality; Search engine; Simple (philosophy); Reduction (mathematics); Data mining; Artificial intelligence; Phrase; Information retrieval; Machine learning; Mathematics","score_opus":0.0624142167311531,"score_gpt":0.34392714943000924,"score_spread":0.28151293269885613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067662418","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023591658,0.0042655757,0.9671649,0.00023538093,0.00008216256,0.000156405,0.00015405127,0.0015902682,0.002759665],"genre_scores_gemma":[0.22578208,0.0023803995,0.765236,0.0001788744,0.00027728622,0.00042681163,0.0006296634,0.00036908136,0.0047198464],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978167,0.00048067977,0.00015253907,0.00020662916,0.001236699,0.00010684763],"domain_scores_gemma":[0.99611974,0.002174235,0.00029880152,0.0007603745,0.00058636494,0.00006049785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014936841,0.0006104015,0.0011430085,0.0031964171,0.00088274386,0.0010720877,0.001475164,0.0008994366,0.0017758716],"category_scores_gemma":[0.009582659,0.00041338467,0.0006276796,0.0035962549,0.0008079034,0.0024643992,0.0012421813,0.0009222531,0.00090599793],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025770455,0.00014729482,0.0016999487,0.000457982,0.00011414694,0.00033178463,0.0004467225,0.052921083,0.028931197,0.04168283,0.007419673,0.8655897],"study_design_scores_gemma":[0.00013978439,0.00034123615,0.0029041816,0.00013886279,0.00018798727,0.0020106675,0.00022583119,0.8187744,0.044447232,0.08799371,0.042731658,0.00010448689],"about_ca_topic_score_codex":0.0021078675,"about_ca_topic_score_gemma":0.0028650027,"teacher_disagreement_score":0.0031964171,"about_ca_system_score_codex":0.00072147965,"about_ca_system_score_gemma":0.000891291,"threshold_uncertainty_score":0.007899404},"labels":[],"label_agreement":null},{"id":"W2069870183","doi":"10.1145/582415.582418","title":"Cumulated gain-based evaluation of IR techniques","year":2002,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","topic":"Information Retrieval and Search Behavior","field":"Computer Science","cited_by":4634,"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":"Tampereen Yliopisto; McGill University","keywords":"Relevance (law); Computer science; Information retrieval; Precision and recall; Recall; Data mining","score_opus":0.05912903173965583,"score_gpt":0.31352136319328217,"score_spread":0.25439233145362633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069870183","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27714464,0.010025701,0.67937124,0.0005101059,0.00040926997,0.0009312058,0.0011729125,0.0046880743,0.025746776],"genre_scores_gemma":[0.8209091,0.0011025798,0.17215745,0.00013077029,0.00027720505,0.00044255584,0.0013726723,0.0003870563,0.0032205498],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9740858,0.010192226,0.0012082658,0.0016614299,0.012316727,0.0005355356],"domain_scores_gemma":[0.92743737,0.052506268,0.0041367025,0.006833653,0.008365315,0.00072066014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015779562,0.0015506927,0.0013415867,0.006118166,0.0005098194,0.0025387057,0.0016358007,0.0013070456,0.002495575],"category_scores_gemma":[0.07454475,0.0002580684,0.00081670104,0.0034747531,0.0011461814,0.0036094135,0.0018768777,0.0010155191,0.0010842248],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033829522,0.0005307753,0.012050593,0.0014191739,0.0007455303,0.00017300004,0.00044805484,0.22834352,0.029666489,0.020561198,0.006204493,0.6964742],"study_design_scores_gemma":[0.00015299369,0.0019814542,0.014641606,0.00008702091,0.00021104653,0.0004728742,0.00011920228,0.94133174,0.021910626,0.014398706,0.004558822,0.00013392756],"about_ca_topic_score_codex":0.0016276328,"about_ca_topic_score_gemma":0.0020519667,"teacher_disagreement_score":0.015779562,"about_ca_system_score_codex":0.0023233416,"about_ca_system_score_gemma":0.0010540923,"threshold_uncertainty_score":0.08345133},"labels":[],"label_agreement":null},{"id":"W2070641109","doi":"10.1145/1777432.1777433","title":"Dynamic lightweight text compression","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Agencia Española de Cooperación Internacional para el Desarrollo; Fondo Nacional de Desarrollo Científico y Tecnológico; Xunta de Galicia; Mountain Equipment Co-operative","keywords":"Computer science; Uncompressed video; Communication source; Novelty; Lossless compression; Gas compressor; Compression (physics); Compression ratio; Natural language; Data compression; Semantic compression; Artificial intelligence; Telecommunications; Video processing","score_opus":0.008293689010632505,"score_gpt":0.23601764425665225,"score_spread":0.22772395524601974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070641109","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03636772,0.0014290917,0.951376,0.0007183749,0.00024587757,0.00018499729,0.00024817305,0.0020435927,0.0073861154],"genre_scores_gemma":[0.4522831,0.0021600549,0.5249498,0.0006779355,0.0008545179,0.00033329433,0.00079116184,0.00041298347,0.017537147],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991246,0.000111081536,0.000052536598,0.00016200262,0.0004802328,0.00006962611],"domain_scores_gemma":[0.9969445,0.0011551006,0.00027366192,0.001138779,0.00040648706,0.000081444305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005862818,0.00054771523,0.0005777635,0.0013789429,0.0006375411,0.0010723926,0.0014215432,0.00080153573,0.0041874205],"category_scores_gemma":[0.004413724,0.000223176,0.00033690527,0.0015409023,0.0010184704,0.0028221055,0.0017905573,0.0010095946,0.0020387608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004215559,0.00016186442,0.0008267781,0.00048509173,0.000044063952,0.0005333702,0.00036621344,0.01865732,0.16220401,0.047698304,0.009539738,0.7590617],"study_design_scores_gemma":[0.00014494068,0.0005299193,0.002193959,0.00017409112,0.00012065818,0.0044075223,0.0003688065,0.49384803,0.34627914,0.07996229,0.07186128,0.00010938736],"about_ca_topic_score_codex":0.00039088918,"about_ca_topic_score_gemma":0.0005486766,"teacher_disagreement_score":0.0041874205,"about_ca_system_score_codex":0.00039441316,"about_ca_system_score_gemma":0.00061581837,"threshold_uncertainty_score":0.014008343},"labels":[],"label_agreement":null},{"id":"W2089201173","doi":"10.1145/2629530","title":"Trust Prediction via Belief Propagation","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","topic":"Advanced Graph Neural Networks","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":"University of Ottawa","funders":"Ministry of Science and Technology of the People's Republic of China; National Natural Science Foundation of China","keywords":"Computer science; Belief propagation; Graphical model; Factor graph; Probabilistic logic; Inference; Exploit; Machine learning; Expectation propagation; Artificial intelligence; Solver; Propagation of uncertainty; Theoretical computer science; Approximate inference; Data mining; Algorithm","score_opus":0.00904383903233889,"score_gpt":0.21179865925749425,"score_spread":0.20275482022515537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089201173","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03755257,0.000686564,0.95737743,0.00089278095,0.00008218361,0.00006995136,0.00038025892,0.0007686498,0.0021896795],"genre_scores_gemma":[0.87901103,0.0006888906,0.11670334,0.00016554832,0.00014740413,0.00013717529,0.0009280889,0.00008643488,0.002132107],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998204,0.0006789929,0.00010840092,0.0004075074,0.00044053025,0.00016053591],"domain_scores_gemma":[0.98620194,0.010360451,0.0010239215,0.0006983111,0.0014803187,0.00023503255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027000615,0.0011626285,0.001284379,0.002131873,0.000826453,0.0020731606,0.0019140663,0.0015783972,0.0022798032],"category_scores_gemma":[0.023902064,0.0007076784,0.00091398164,0.00236327,0.0010240927,0.004046094,0.0014566401,0.0025923008,0.00076314283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023035763,0.00010453974,0.006129575,0.00014387228,0.00014573685,0.0001412612,0.000267231,0.84481925,0.0006483581,0.026699463,0.004810773,0.115859576],"study_design_scores_gemma":[0.0000060238044,0.000007668629,0.00017942274,0.000007656834,0.000009827857,0.000009443492,0.0000090885105,0.9867534,0.0001762142,0.01262876,0.00020755842,0.0000049640803],"about_ca_topic_score_codex":0.022742368,"about_ca_topic_score_gemma":0.016382903,"teacher_disagreement_score":0.022742368,"about_ca_system_score_codex":0.0017284753,"about_ca_system_score_gemma":0.001252539,"threshold_uncertainty_score":0.045219958},"labels":[],"label_agreement":null},{"id":"W2142905080","doi":"10.1145/2094072.2094073","title":"Word-based self-indexes for natural language text","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":79,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Fondo Nacional de Desarrollo Científico y Tecnológico; Xunta de Galicia; Ministerio de Ciencia e Innovación","keywords":"Computer science; Word (group theory); Phrase; Search engine indexing; Inverted index; Natural language processing; Space (punctuation); Artificial intelligence; Natural language; Index (typography); Sequence (biology); Full text search; Information retrieval; Search engine; Linguistics; World Wide Web","score_opus":0.01209488053201561,"score_gpt":0.2518274829218977,"score_spread":0.23973260238988212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142905080","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037386417,0.0029244309,0.9331111,0.00032632923,0.00037497314,0.0005629993,0.0027102144,0.013173218,0.009430313],"genre_scores_gemma":[0.12112075,0.0015591297,0.8613623,0.00018489969,0.00028336377,0.0006134513,0.0056300573,0.0012959021,0.007950197],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852693,0.00021264981,0.0003198749,0.00017522601,0.0006836397,0.000081702194],"domain_scores_gemma":[0.9955047,0.0013559884,0.0004379973,0.0014085969,0.001158451,0.00013430655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087164383,0.000644444,0.00073551043,0.0044225063,0.0008684902,0.0021299548,0.001207211,0.00055460574,0.0054549193],"category_scores_gemma":[0.007670279,0.00038543952,0.00056723563,0.0053335354,0.00090429286,0.006394855,0.0019375539,0.00063001673,0.0046342756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040803762,0.00011288225,0.0019602547,0.0010331477,0.00007019085,0.0003387892,0.0008259866,0.0048754252,0.058098823,0.08866899,0.018876562,0.82473093],"study_design_scores_gemma":[0.00016358196,0.00093336334,0.004137134,0.00036908648,0.00019115278,0.002469921,0.0007588504,0.18876165,0.29003736,0.21393175,0.29798394,0.00026209094],"about_ca_topic_score_codex":0.0011957568,"about_ca_topic_score_gemma":0.001451055,"teacher_disagreement_score":0.0054549193,"about_ca_system_score_codex":0.0009085741,"about_ca_system_score_gemma":0.001184312,"threshold_uncertainty_score":0.018248558},"labels":[],"label_agreement":null},{"id":"W2168625136","doi":"10.1145/944012.944013","title":"Measuring praise and criticism","year":2003,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","topic":"Sentiment Analysis and Opinion Mining","field":"Computer Science","cited_by":1509,"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":"National Aeronautics and Space Administration","keywords":"Computer science; Praise; Natural language processing; Artificial intelligence; Orientation (vector space); Pointwise mutual information; Noun; Set (abstract data type); Word (group theory); Latent semantic analysis; Criticism; Semantics (computer science); Linguistics; Psychology; Mutual information; Mathematics","score_opus":0.03905183252988257,"score_gpt":0.24862510286070227,"score_spread":0.2095732703308197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168625136","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9543831,0.0003378367,0.019371713,0.00029821522,0.00006510548,0.00022820862,0.0006457847,0.00017880127,0.024491359],"genre_scores_gemma":[0.99120015,0.00013675455,0.0067294333,0.000051256597,0.00003247756,0.0001159688,0.00040653147,0.000018767712,0.0013087764],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99505496,0.0016094358,0.000498367,0.0004476615,0.0021573857,0.00023222412],"domain_scores_gemma":[0.9774327,0.00944686,0.0067352764,0.0011778933,0.004491852,0.0007154675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003876772,0.00046441663,0.00040278325,0.0030162926,0.00047844497,0.0017622019,0.00046799026,0.00079849403,0.0021128512],"category_scores_gemma":[0.03181303,0.00017392167,0.00050303724,0.0017332184,0.0012645262,0.0019120878,0.0016714886,0.0008936687,0.0007852385],"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.00074446516,0.00033878683,0.71742016,0.0006400787,0.00036133072,0.00025594054,0.014338439,0.0019410516,0.01869633,0.0073097437,0.0024255672,0.23552808],"study_design_scores_gemma":[0.00002570586,0.0006415847,0.95469356,0.00011178039,0.00012837116,0.0006182718,0.009283147,0.010756728,0.00849066,0.0076629147,0.007451966,0.00013534215],"about_ca_topic_score_codex":0.00065801165,"about_ca_topic_score_gemma":0.0009657931,"teacher_disagreement_score":0.003876772,"about_ca_system_score_codex":0.0006829122,"about_ca_system_score_gemma":0.00042739022,"threshold_uncertainty_score":0.020502567},"labels":[],"label_agreement":null},{"id":"W2271008577","doi":"10.1145/2838731","title":"A Tensor-Based Information Framework for Predicting the Stock Market","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","topic":"Stock Market Forecasting Methods","field":"Decision Sciences","cited_by":98,"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; Fundamental Research Funds for the Central Universities; National Science Foundation","keywords":"Computer science; Stock market; Stock (firearms); Tensor (intrinsic definition); Curse of dimensionality; Data mining; Dimensionality reduction; Artificial intelligence; Econometrics; Machine learning; Economics; Mathematics; Engineering; Geography","score_opus":0.08894259654104707,"score_gpt":0.365239191310019,"score_spread":0.2762965947689719,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2271008577","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015252448,0.0009964748,0.98117805,0.0004867057,0.00009119228,0.000036636782,0.00045452398,0.00046815045,0.0010359001],"genre_scores_gemma":[0.5629367,0.0029068834,0.42712167,0.00023340652,0.00048517642,0.00018324438,0.0019100639,0.00012618571,0.004096678],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994497,0.00017479199,0.000048404156,0.00013156173,0.00012933936,0.00006625636],"domain_scores_gemma":[0.9985838,0.0006248914,0.0002644443,0.000152398,0.00028558745,0.00008901988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017890969,0.0011587401,0.00089777674,0.001903194,0.000534779,0.0014033634,0.0012492816,0.000918443,0.001524025],"category_scores_gemma":[0.004167562,0.00038801448,0.0011142589,0.0021067143,0.000768088,0.0028052493,0.00078462367,0.0015589085,0.00043205926],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015064937,0.0001104228,0.00343363,0.00014476429,0.00012407475,0.00018234242,0.00013417995,0.7996627,0.004886608,0.080629505,0.004077081,0.10646409],"study_design_scores_gemma":[0.0000020251298,0.000017007773,0.00017864571,0.0000039896668,0.000007778338,0.000010784302,0.000004326268,0.98941725,0.00018981188,0.0097266575,0.00043423328,0.000007546577],"about_ca_topic_score_codex":0.015955573,"about_ca_topic_score_gemma":0.01128593,"teacher_disagreement_score":0.015955573,"about_ca_system_score_codex":0.0011417167,"about_ca_system_score_gemma":0.0014760224,"threshold_uncertainty_score":0.031725407},"labels":[],"label_agreement":null},{"id":"W2507254902","doi":"10.1145/2956234","title":"TopPRF","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","topic":"Information Retrieval and Search Behavior","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":"York University","funders":"","keywords":"Computer science; Relevance feedback; Relevance (law); Information retrieval; Selection (genetic algorithm); Probabilistic logic; Reliability (semiconductor); Key (lock); Entropy (arrow of time); Identification (biology); Data mining; Artificial intelligence","score_opus":0.02379832225572686,"score_gpt":0.252434260286498,"score_spread":0.22863593803077115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2507254902","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072823353,0.004281903,0.7940867,0.0017313227,0.0014405162,0.0009553001,0.014466632,0.06670347,0.109051876],"genre_scores_gemma":[0.16066818,0.0042028297,0.6493951,0.0031386132,0.00090634794,0.0014190674,0.059554443,0.009526636,0.111188695],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973563,0.00036825627,0.00016374298,0.0005846245,0.0011711243,0.00035602157],"domain_scores_gemma":[0.9979473,0.0005215181,0.00010154825,0.0006565348,0.00068872335,0.00008438781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016805024,0.0018949269,0.0015789173,0.002993983,0.0019480648,0.0030978762,0.0033026326,0.0022324042,0.083440535],"category_scores_gemma":[0.0063639325,0.000701005,0.002089639,0.0027752076,0.0006782551,0.0038455692,0.002430403,0.0020135918,0.052781284],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029537996,0.00017744044,0.00110882,0.00092428364,0.00012779605,0.00032465835,0.00014160041,0.019701855,0.0056761834,0.037158027,0.3310191,0.6033448],"study_design_scores_gemma":[0.00018442463,0.00026414837,0.0009533236,0.00017596695,0.00012748432,0.0017779457,0.0002028317,0.29580235,0.014878916,0.09511133,0.59037703,0.00014427473],"about_ca_topic_score_codex":0.005399233,"about_ca_topic_score_gemma":0.00706692,"teacher_disagreement_score":0.083440535,"about_ca_system_score_codex":0.0013353779,"about_ca_system_score_gemma":0.0024627938,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2515155379","doi":"10.1145/2948065","title":"Trip Recommendation Meets Real-World Constraints","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","topic":"Recommender Systems and Techniques","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":"Simon Fraser University","funders":"Higher Education Discipline Innovation Project; Natural Sciences and Engineering Research Council of Canada; Renmin University of China","keywords":"Computer science; Constraint (computer-aided design); Time constraint; Point of interest; Window (computing); Recommender system; Sequence (biology); Space (punctuation); Budget constraint; Diversity (politics); Information retrieval; World Wide Web; Operations research; Artificial intelligence; Mathematics","score_opus":0.030090377110567636,"score_gpt":0.2725916044633616,"score_spread":0.24250122735279397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2515155379","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27514455,0.007453992,0.61522895,0.009235265,0.00078933424,0.00081839773,0.040631477,0.004926283,0.045771748],"genre_scores_gemma":[0.69475234,0.001724376,0.26894888,0.00075020565,0.00027201843,0.00038805194,0.024547482,0.00039998078,0.00821665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968503,0.00081299065,0.00031853662,0.0010722986,0.0005782648,0.00036754346],"domain_scores_gemma":[0.99216366,0.0042244727,0.0005560906,0.0016099282,0.0011274246,0.00031842105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019051424,0.0013085515,0.0024737406,0.0013637631,0.0019750409,0.0030560829,0.003577621,0.0038095668,0.008531677],"category_scores_gemma":[0.018006798,0.0010506975,0.0011827913,0.0066979127,0.000650415,0.0060059465,0.0014787046,0.0022795182,0.0034375747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006849604,0.0005030488,0.016123995,0.0018151349,0.00029598924,0.0015658115,0.00056276476,0.70522404,0.0039483304,0.02855929,0.090604916,0.15011178],"study_design_scores_gemma":[0.000058726557,0.00008639641,0.0026255953,0.000048593018,0.000052361607,0.0010260008,0.00043221566,0.95804924,0.00080313446,0.019640183,0.017135143,0.000042391872],"about_ca_topic_score_codex":0.034045506,"about_ca_topic_score_gemma":0.059274603,"teacher_disagreement_score":0.034045506,"about_ca_system_score_codex":0.0014164384,"about_ca_system_score_gemma":0.0019064985,"threshold_uncertainty_score":0.06769472},"labels":[],"label_agreement":null},{"id":"W2560965260","doi":"10.1145/2988230","title":"Time-Aware Click Model","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","topic":"Information Retrieval and Search Behavior","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"National Natural Science Foundation of China","keywords":"Computer science; Perplexity; Relevance (law); Click-through rate; Information retrieval; Learning to rank; Search engine; Dwell time; Artificial intelligence; Language model","score_opus":0.024924444805847993,"score_gpt":0.2537497258937442,"score_spread":0.22882528108789624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2560965260","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24066307,0.0031672495,0.7262994,0.0018324847,0.00046007131,0.0004013085,0.0048599867,0.003854726,0.018461697],"genre_scores_gemma":[0.94819444,0.0011851077,0.026404765,0.0002612678,0.00024964157,0.00027808448,0.0014437672,0.00016181741,0.021821033],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986324,0.00024317903,0.00009289218,0.00039161934,0.00036944126,0.00027058375],"domain_scores_gemma":[0.99504614,0.0029002607,0.0005554546,0.00040990923,0.00081757293,0.00027065622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017663093,0.0016911839,0.0017531175,0.0025024668,0.00053060456,0.0017855732,0.0033757556,0.0028790666,0.008585923],"category_scores_gemma":[0.0070939697,0.00066875847,0.001778915,0.0027400076,0.0009536171,0.0042338385,0.00088026817,0.0016255884,0.0027597921],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014173504,0.00067900034,0.016421175,0.00048553746,0.00024577722,0.0010512624,0.00042773774,0.78580904,0.01118787,0.08258491,0.01033903,0.08935128],"study_design_scores_gemma":[0.000027913822,0.00007175939,0.0010537778,0.000009836799,0.0000468567,0.00015217027,0.000011484733,0.99098927,0.00042267705,0.006270625,0.00091887324,0.000024831945],"about_ca_topic_score_codex":0.012833725,"about_ca_topic_score_gemma":0.008402812,"teacher_disagreement_score":0.012833725,"about_ca_system_score_codex":0.0013931798,"about_ca_system_score_gemma":0.0012911482,"threshold_uncertainty_score":0.028722823},"labels":[],"label_agreement":null},{"id":"W2585936885","doi":"10.1145/3007186","title":"Inverted Treaps","year":2017,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","topic":"Algorithms and Data Compression","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":"Computer science; Inverted index; Merge (version control); Identifier; ENCODE; Intersection (aeronautics); Thresholding; Representation (politics); Index (typography); Data mining; Information retrieval; Search engine indexing; Theoretical computer science; Artificial intelligence; Image (mathematics)","score_opus":0.02721772894203236,"score_gpt":0.2607516944946491,"score_spread":0.2335339655526167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2585936885","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033885617,0.0015767926,0.89444864,0.0005375368,0.0008868058,0.00069156656,0.01987669,0.018907933,0.029188365],"genre_scores_gemma":[0.20260128,0.0012562622,0.7214019,0.0005281541,0.0005711238,0.0010097022,0.045687392,0.0027168214,0.024227493],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99755883,0.00021654325,0.00031571495,0.000442718,0.0011895332,0.00027661194],"domain_scores_gemma":[0.9931722,0.0010407699,0.0005097171,0.0028395029,0.0021779698,0.00025977826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011378656,0.0012011182,0.0017347918,0.0058542746,0.0014308487,0.004240888,0.0028449276,0.0011226523,0.01620859],"category_scores_gemma":[0.010539912,0.0006629422,0.0013292421,0.010288121,0.00096756977,0.00751753,0.0032285077,0.0017601036,0.008602586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009246802,0.00030428285,0.0026634587,0.00070593343,0.00017389012,0.00043071024,0.00048884825,0.041065928,0.02799455,0.12322185,0.080766186,0.7212597],"study_design_scores_gemma":[0.00021961065,0.000993196,0.00266837,0.0002778753,0.00020373073,0.0021646698,0.00068653765,0.4867764,0.08604645,0.17552565,0.24405876,0.00037885114],"about_ca_topic_score_codex":0.006262681,"about_ca_topic_score_gemma":0.006518181,"teacher_disagreement_score":0.01620859,"about_ca_system_score_codex":0.0014141997,"about_ca_system_score_gemma":0.0027329961,"threshold_uncertainty_score":0.05422312},"labels":[],"label_agreement":null},{"id":"W2674238586","doi":"10.1145/3091107","title":"Search by Screenshots for Universal Article Clipping in Mobile Apps","year":2017,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","topic":"Web Data Mining and Analysis","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","funders":"","keywords":"Computer science; Information retrieval; Chunking (psychology); Usability; Clipping (morphology); Rank (graph theory); Learning to rank; Key (lock); Artificial intelligence; Human–computer interaction; Ranking (information retrieval)","score_opus":0.029745840002553325,"score_gpt":0.28246270193654077,"score_spread":0.25271686193398746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2674238586","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19634454,0.006087406,0.6551557,0.0011557685,0.00051529624,0.0025558555,0.010734816,0.10193511,0.025515521],"genre_scores_gemma":[0.36591813,0.0013368855,0.60608107,0.000514795,0.0003234268,0.0009857392,0.010297353,0.0018994387,0.012643146],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991404,0.00018469503,0.00006398889,0.00019684945,0.00030572285,0.00010837137],"domain_scores_gemma":[0.9964379,0.0018226852,0.00024342738,0.00058485643,0.00063190196,0.00027925326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006953799,0.0021402685,0.0013386008,0.0046945317,0.0007877069,0.001683909,0.0010326181,0.0010142694,0.011766221],"category_scores_gemma":[0.005920581,0.00046007909,0.00089612947,0.002061674,0.0005616792,0.003227294,0.002094809,0.00074096833,0.0049979524],"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.0018597784,0.0005601875,0.003890076,0.0023267104,0.00018011304,0.0013877718,0.0017784674,0.0052913358,0.09023091,0.0044937464,0.074982256,0.8130186],"study_design_scores_gemma":[0.00042126802,0.002819408,0.02893196,0.0005531135,0.00042838548,0.0043150065,0.0050226473,0.56386715,0.18767305,0.026617458,0.178857,0.00049349206],"about_ca_topic_score_codex":0.0034769932,"about_ca_topic_score_gemma":0.0093339905,"teacher_disagreement_score":0.011766221,"about_ca_system_score_codex":0.0005753562,"about_ca_system_score_gemma":0.00070331164,"threshold_uncertainty_score":0.039361954},"labels":[],"label_agreement":null},{"id":"W2751820697","doi":"10.1145/3091995","title":"Modeling and Mining Domain Shared Knowledge for Sentiment Analysis","year":2017,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","topic":"Sentiment Analysis and Opinion Mining","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":"York University","funders":"Fundamental Research Funds for the Central Universities","keywords":"Computer science; Sentiment analysis; Domain (mathematical analysis); Sentence; Artificial intelligence; Data mining; Natural language processing; Mathematics","score_opus":0.040456273623900925,"score_gpt":0.2987172456892563,"score_spread":0.25826097206535537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751820697","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03186138,0.0009805394,0.96435124,0.00031924734,0.000052383475,0.00010054189,0.00042510347,0.0005068876,0.001402705],"genre_scores_gemma":[0.6041291,0.0014095258,0.38635027,0.0003443513,0.00032231337,0.0004324863,0.0041498276,0.00011529217,0.0027467518],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838996,0.00048730028,0.00010675547,0.00057940296,0.00032233918,0.00011430777],"domain_scores_gemma":[0.99775285,0.0010609577,0.00038149318,0.00031254243,0.00040965714,0.00008254277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018528644,0.0013820357,0.0010709118,0.0031273328,0.0006505458,0.0011329608,0.0012180512,0.0008375707,0.00090603856],"category_scores_gemma":[0.004774803,0.0005322219,0.0018556744,0.0023392076,0.0007570289,0.0022102809,0.001395002,0.0013635352,0.0006677178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031512105,0.00064767693,0.015547226,0.000734073,0.0006343056,0.00087996357,0.0011751639,0.24196595,0.029780377,0.021202393,0.014882837,0.67223495],"study_design_scores_gemma":[0.000014130193,0.00004829515,0.0016018916,0.000027096447,0.000053432937,0.00012747834,0.00013710331,0.9696083,0.0026114564,0.022318715,0.003429038,0.000023010869],"about_ca_topic_score_codex":0.004194541,"about_ca_topic_score_gemma":0.0066130054,"teacher_disagreement_score":0.004194541,"about_ca_system_score_codex":0.00088604377,"about_ca_system_score_gemma":0.0013492865,"threshold_uncertainty_score":0.009799004},"labels":[],"label_agreement":null},{"id":"W2898640137","doi":"10.1145/3231937","title":"Learning to Adaptively Rank Document Retrieval System Configurations","year":2018,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","topic":"Information Retrieval and Search Behavior","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":"Université de Montréal","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Ranking (information retrieval); Set (abstract data type); Rank (graph theory); Selection (genetic algorithm); Exploit; Information retrieval; Query expansion; Task (project management); Learning to rank; Data mining; Grid; Document retrieval; Artificial intelligence; Mathematics","score_opus":0.021105244454159438,"score_gpt":0.2655919473717483,"score_spread":0.24448670291758887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898640137","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41544157,0.0028846634,0.5646365,0.00059039146,0.00014172748,0.00050144596,0.00049174007,0.010612932,0.0046989922],"genre_scores_gemma":[0.90834296,0.00024396116,0.08899902,0.00015521672,0.000060500133,0.00018509457,0.0007386427,0.00023051609,0.001044021],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99610436,0.0014596347,0.00028332399,0.0011695623,0.00062025624,0.00036298233],"domain_scores_gemma":[0.99030006,0.00559934,0.0008312851,0.0013295545,0.0015946836,0.00034500443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043576793,0.0019928862,0.0020097329,0.0021654356,0.0007574203,0.0019789885,0.00178287,0.0013976163,0.0015822321],"category_scores_gemma":[0.021187838,0.00085672643,0.0005997119,0.0014966584,0.0010316476,0.0031461318,0.0012230467,0.0016970728,0.0017389925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00091474876,0.00056344207,0.017444022,0.00046156073,0.00027479322,0.00022057378,0.00032440526,0.43850124,0.022504514,0.0022228332,0.007063752,0.5095041],"study_design_scores_gemma":[0.00007991043,0.00039990133,0.0020401813,0.00002274712,0.0000923011,0.00018187969,0.00010711568,0.98265463,0.010157126,0.0032331487,0.0009788015,0.00005227416],"about_ca_topic_score_codex":0.0029949995,"about_ca_topic_score_gemma":0.004125541,"teacher_disagreement_score":0.0043576793,"about_ca_system_score_codex":0.0013926751,"about_ca_system_score_gemma":0.0017127605,"threshold_uncertainty_score":0.023045897},"labels":[],"label_agreement":null},{"id":"W2904119337","doi":"10.1145/3233773","title":"A Deep Bayesian Tensor-Based System for Video Recommendation","year":2018,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","topic":"Tensor decomposition and applications","field":"Mathematics","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":"Simon Fraser University","funders":"Tencent","keywords":"Computer science; Recommender system; Surprise; Exploit; Artificial intelligence; Ranking (information retrieval); Machine learning; Tensor (intrinsic definition); Metric (unit); Cluster analysis; Bayesian probability; Information retrieval; Collaborative filtering; Latent variable","score_opus":0.038135568599120005,"score_gpt":0.306795895461837,"score_spread":0.268660326862717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904119337","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007774687,0.00046617497,0.9866419,0.00028746322,0.000083402534,0.000063380416,0.00029800905,0.0026132434,0.0017716752],"genre_scores_gemma":[0.38893217,0.00073641684,0.59947264,0.00039276836,0.00016552252,0.00024692388,0.0012872411,0.00017777493,0.008588481],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992919,0.0001746651,0.000053845262,0.00018872044,0.0001896297,0.000101192956],"domain_scores_gemma":[0.99909973,0.00023395882,0.00007239817,0.00015953495,0.00034713725,0.00008717875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012140839,0.0009105227,0.0012801852,0.0008321449,0.00073585147,0.0011389338,0.0022815024,0.0013828402,0.0058953767],"category_scores_gemma":[0.0032309315,0.000553688,0.0008980095,0.0013606228,0.00054180215,0.0019824707,0.0011771265,0.0016605224,0.0026628422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065788283,0.00025738575,0.0020502969,0.00022654785,0.000177484,0.00024431132,0.00021308521,0.39699847,0.012836604,0.03335395,0.018762896,0.5342211],"study_design_scores_gemma":[0.000007839508,0.000019797022,0.000052916657,0.000002964662,0.0000075483686,0.00001954441,0.000004561929,0.996336,0.0004985736,0.0024031417,0.0006392095,0.000007990776],"about_ca_topic_score_codex":0.039419953,"about_ca_topic_score_gemma":0.04718378,"teacher_disagreement_score":0.039419953,"about_ca_system_score_codex":0.0016265869,"about_ca_system_score_gemma":0.0018880507,"threshold_uncertainty_score":0.078381},"labels":[],"label_agreement":null},{"id":"W2973947483","doi":"10.1145/3345557","title":"Question Answering in Knowledge Bases","year":2019,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","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":"University of Ottawa","funders":"Dream Project of Ministry of Science and Technology of the People's Republic of China; Fundamental Research Funds for the Central Universities; Foundation for Innovative Research Groups of the National Natural Science Foundation of China; State Key Laboratory of Software Development Environment","keywords":"Computer science; Correctness; Question answering; Bottleneck; Knowledge base; Relation (database); Information bottleneck method; Artificial intelligence; Information retrieval; Machine learning; Data mining; Programming language","score_opus":0.018027592806274667,"score_gpt":0.2547266321229922,"score_spread":0.2366990393167175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2973947483","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012261815,0.0009982993,0.9774239,0.001435195,0.00006566902,0.00027491772,0.0007667118,0.0039333478,0.0028401662],"genre_scores_gemma":[0.26572996,0.001421546,0.7230825,0.0010210393,0.00019142579,0.000554246,0.0038261947,0.00034496657,0.003828107],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99337476,0.0033689274,0.00051321,0.0012983357,0.0011153579,0.00032934893],"domain_scores_gemma":[0.98118275,0.01415622,0.0005231279,0.0024763388,0.0013905993,0.00027101656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064654374,0.0009435865,0.0012868525,0.0026028154,0.0011541437,0.004231533,0.0033049895,0.002440982,0.005597431],"category_scores_gemma":[0.032495465,0.0010740019,0.0018905847,0.002651701,0.0018891797,0.010184543,0.004265396,0.0030027267,0.0021085145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046597264,0.00049568055,0.0037484702,0.0019502934,0.00036464696,0.00040445197,0.0023689603,0.16484994,0.00937726,0.22465442,0.023069376,0.56825054],"study_design_scores_gemma":[0.00004903931,0.00008291614,0.00065288116,0.00017133157,0.000100631354,0.00019718752,0.0003307926,0.6059222,0.0067227096,0.36130217,0.024428392,0.000039706774],"about_ca_topic_score_codex":0.007240842,"about_ca_topic_score_gemma":0.006052153,"teacher_disagreement_score":0.007240842,"about_ca_system_score_codex":0.0016209054,"about_ca_system_score_gemma":0.0018694912,"threshold_uncertainty_score":0.03419292},"labels":[],"label_agreement":null},{"id":"W3081520483","doi":"10.1145/3406116","title":"Pairwise Link Prediction Model for Out of Vocabulary Knowledge Base Entities","year":2020,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","topic":"Advanced Graph Neural Networks","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 Ottawa","funders":"Foundation for Innovative Research Groups of the National Natural Science Foundation of China","keywords":"Computer science; Pairwise comparison; Discriminative model; Relation (database); Artificial intelligence; Benchmark (surveying); Dependency (UML); Word (group theory); Machine learning; A priori and a posteriori; Representation (politics); Theoretical computer science; Data mining; Mathematics","score_opus":0.041519174015214017,"score_gpt":0.25393608106521703,"score_spread":0.21241690705000302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081520483","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08093785,0.00150821,0.90516436,0.0009312847,0.00017809986,0.00014439151,0.0031969452,0.0033244996,0.0046142796],"genre_scores_gemma":[0.84771717,0.00094813626,0.12736431,0.000432151,0.0002169756,0.00038593012,0.008175395,0.00029325808,0.014466627],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936134,0.00009229535,0.000031488908,0.00034172036,0.000107499094,0.000065792075],"domain_scores_gemma":[0.99852717,0.0008164462,0.00016106965,0.00022205364,0.00021970515,0.000053526463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010151694,0.0010637013,0.00094663945,0.001630437,0.00049995806,0.0009425944,0.0030236694,0.0016531346,0.004223933],"category_scores_gemma":[0.004388866,0.0004932257,0.00082281313,0.0022859408,0.00049447076,0.003932427,0.0012224232,0.002488978,0.002176371],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033452295,0.00035932622,0.0067804535,0.00020440097,0.00017087154,0.00039297921,0.00022508395,0.58941305,0.0037529522,0.023660006,0.0141874105,0.36051902],"study_design_scores_gemma":[0.0000073246865,0.000022217684,0.0004037661,0.000008998639,0.000018985063,0.000036258498,0.000011254244,0.9867379,0.00057783624,0.011126592,0.0010413975,0.000007495012],"about_ca_topic_score_codex":0.012760857,"about_ca_topic_score_gemma":0.021513892,"teacher_disagreement_score":0.012760857,"about_ca_system_score_codex":0.0009308596,"about_ca_system_score_gemma":0.0009613883,"threshold_uncertainty_score":0.02537316},"labels":[],"label_agreement":null},{"id":"W3102793640","doi":"10.1145/3423322","title":"Neural Feature-aware Recommendation with Signed Hypergraph Convolutional Network","year":2020,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","topic":"Recommender Systems and Techniques","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":"York University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Collaborative filtering; Recommender system; Bridging (networking); Hypergraph; Profiling (computer programming); Feature (linguistics); Convolutional neural network; Embedding; Graph; Information retrieval; Preference; Artificial intelligence; Machine learning; Data mining; Theoretical computer science","score_opus":0.02140057928735824,"score_gpt":0.22119482330704704,"score_spread":0.1997942440196888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3102793640","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07520994,0.0013309798,0.9155638,0.000701973,0.00010627755,0.00006184895,0.0004901199,0.0018710579,0.004663914],"genre_scores_gemma":[0.88614297,0.0007668038,0.10153125,0.00040246025,0.00009392546,0.00010010879,0.000873012,0.000097366916,0.009992079],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974996,0.000060182414,0.000012784743,0.000082332284,0.000058042464,0.000036782876],"domain_scores_gemma":[0.9993325,0.00031756354,0.00008036817,0.00009845299,0.00013293505,0.000038163904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042140274,0.00080687704,0.00085533527,0.00079613307,0.0003484795,0.0006956119,0.0015105509,0.0013127401,0.0014503725],"category_scores_gemma":[0.0020428135,0.0005559328,0.0007143159,0.0013063605,0.0004445477,0.0016762703,0.0005832143,0.0013394355,0.00061598624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014979733,0.00014398519,0.0020884953,0.000098513636,0.00012876211,0.00012625766,0.000088850895,0.80687404,0.0051106936,0.010965194,0.004805564,0.16941985],"study_design_scores_gemma":[0.0000030112217,0.000010703948,0.000114991504,0.0000023317389,0.000006966367,0.000009402493,0.0000018487558,0.99755657,0.00022083243,0.0019068253,0.00016277184,0.0000037646628],"about_ca_topic_score_codex":0.023515655,"about_ca_topic_score_gemma":0.03462221,"teacher_disagreement_score":0.023515655,"about_ca_system_score_codex":0.0011261146,"about_ca_system_score_gemma":0.00072041847,"threshold_uncertainty_score":0.04675752},"labels":[],"label_agreement":null},{"id":"W3159852056","doi":"10.1145/3451161","title":"Assessing Top- Preferences","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","topic":"Mobile Crowdsensing and Crowdsourcing","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 Waterloo","funders":"","keywords":"Computer science; Crowdsourcing; Preference; Learning to rank; Artificial intelligence; Information retrieval; Rank (graph theory); Measure (data warehouse); Quality (philosophy); Machine learning; Natural language processing; Data mining; Ranking (information retrieval); Statistics; Mathematics; World Wide Web","score_opus":0.030429623778512566,"score_gpt":0.26641945636743347,"score_spread":0.2359898325889209,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3159852056","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4566419,0.0030042073,0.42879537,0.0014782933,0.0004165236,0.0009287878,0.011819119,0.004243605,0.09267222],"genre_scores_gemma":[0.9147259,0.0003397591,0.07329802,0.00024909087,0.00014232945,0.00022943737,0.0032401402,0.0003536384,0.007421747],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9863732,0.0038040546,0.0012273977,0.0021737367,0.0057408405,0.00068075577],"domain_scores_gemma":[0.96189195,0.0154315755,0.0031951263,0.0053363927,0.012256742,0.0018881868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009768994,0.0012372619,0.0011036316,0.0050270376,0.0012481654,0.004345824,0.00091618014,0.0013821523,0.011863855],"category_scores_gemma":[0.06458999,0.00033175145,0.000921298,0.004005476,0.0007695613,0.0046977904,0.002393749,0.0013470311,0.0058659473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021341622,0.00043319323,0.23120408,0.0010494206,0.000790916,0.0002871069,0.0016889971,0.014816017,0.016107997,0.016204618,0.026193963,0.68908954],"study_design_scores_gemma":[0.0004001119,0.0030832728,0.4221509,0.0005196202,0.0009273153,0.002281611,0.006488335,0.27647176,0.05180804,0.11186498,0.123219416,0.0007845481],"about_ca_topic_score_codex":0.0042940006,"about_ca_topic_score_gemma":0.0066215782,"teacher_disagreement_score":0.011863855,"about_ca_system_score_codex":0.0008841041,"about_ca_system_score_gemma":0.0015518079,"threshold_uncertainty_score":0.051663995},"labels":[],"label_agreement":null},{"id":"W3164333934","doi":"10.1145/3450289","title":"CoSam: An Efficient Collaborative Adaptive Sampler for Recommendation","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","topic":"Recommender Systems and 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":"Simon Fraser University","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Computer science; Recommender system; Collaborative filtering; Sampling (signal processing); Heuristic; Normalization (sociology); Machine learning; Offset (computer science); Sampling bias; Data mining; Convergence (economics); Stability (learning theory); Domain (mathematical analysis); Artificial intelligence; Sample size determination; Statistics","score_opus":0.040938741939123655,"score_gpt":0.28908844000881745,"score_spread":0.24814969806969378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3164333934","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004317443,0.0003194151,0.99350363,0.000101761856,0.000059800695,0.00010812409,0.00009810292,0.00095621176,0.0005356072],"genre_scores_gemma":[0.22245295,0.00049948285,0.77024525,0.0004643137,0.00029025477,0.00062627083,0.0010122181,0.0002686568,0.0041406057],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976325,0.00080552156,0.000121978956,0.0005509727,0.00072301476,0.00016595688],"domain_scores_gemma":[0.993277,0.0038575078,0.0002885204,0.0011872462,0.0011190788,0.00027055352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004122044,0.0011964651,0.0022120052,0.0014428337,0.0009636346,0.0012518085,0.0043885224,0.001993019,0.0034215008],"category_scores_gemma":[0.016529463,0.00089163636,0.0012819574,0.0020158112,0.0009690386,0.002350342,0.0021584004,0.0023770719,0.0016972909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007131508,0.00044712928,0.0061599594,0.0003267944,0.0003005751,0.0001801285,0.0002866119,0.36856657,0.0055870167,0.03297288,0.01593698,0.5685222],"study_design_scores_gemma":[0.000034714274,0.000039543484,0.00013091676,0.000008746536,0.00001590477,0.000042268526,0.000008741156,0.9929219,0.0007764092,0.0046984632,0.0013120023,0.000010387639],"about_ca_topic_score_codex":0.0130530195,"about_ca_topic_score_gemma":0.0248473,"teacher_disagreement_score":0.0130530195,"about_ca_system_score_codex":0.0011488304,"about_ca_system_score_gemma":0.00261491,"threshold_uncertainty_score":0.025954127},"labels":[],"label_agreement":null},{"id":"W3198536471","doi":"10.1145/3446426","title":"Multi-Stage Conversational Passage Retrieval: An Approach to Fusing Term Importance Estimation and Neural Query Rewriting","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","topic":"Topic Modeling","field":"Computer Science","cited_by":55,"is_retracted":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":"Canada First Research Excellence Fund; Natural Sciences and Engineering Research Council of Canada; Ministry of Science and Technology, Taiwan","keywords":"Computer science; Information retrieval; Leverage (statistics); Query expansion; Term (time); Artificial intelligence; Query language; Rewriting; Context (archaeology); Natural language processing; Programming language","score_opus":0.059295514660712485,"score_gpt":0.2863921894774662,"score_spread":0.22709667481675372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198536471","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009907813,0.0011075189,0.986388,0.00021220038,0.00008140452,0.0001555261,0.000089408095,0.0011877074,0.0008704045],"genre_scores_gemma":[0.31503895,0.0009658606,0.6757134,0.00036382276,0.0005882493,0.00035267955,0.0007313958,0.00035485905,0.005890726],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973309,0.0010319696,0.00020964534,0.0007158914,0.00054034137,0.00017125657],"domain_scores_gemma":[0.99725467,0.0013373437,0.00022849032,0.00043220178,0.00061931304,0.00012805854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031429315,0.0013730623,0.0016636582,0.002006054,0.0006960273,0.0013361458,0.0028554206,0.00166488,0.0021140913],"category_scores_gemma":[0.007915975,0.00065158855,0.0016520473,0.0016284225,0.00085809367,0.002709312,0.0017679031,0.0016984459,0.0011735277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054965325,0.00048761757,0.0014806816,0.000550738,0.00031636452,0.0005804274,0.0012202966,0.10987189,0.08651904,0.018181084,0.0069357227,0.77330655],"study_design_scores_gemma":[0.000020516462,0.00020027148,0.0006005541,0.000015089794,0.00011307302,0.00018455891,0.00008721006,0.97237,0.013845848,0.008039986,0.0044635623,0.000059237016],"about_ca_topic_score_codex":0.0076600434,"about_ca_topic_score_gemma":0.0075337593,"teacher_disagreement_score":0.0076600434,"about_ca_system_score_codex":0.0009827052,"about_ca_system_score_gemma":0.0014371332,"threshold_uncertainty_score":0.01662165},"labels":[],"label_agreement":null},{"id":"W3214350751","doi":"10.1145/3466754","title":"Direction-Aware User Recommendation Based on Asymmetric Network Embedding","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","topic":"Recommender Systems and 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":"Simon Fraser University","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Computer science; Embedding; Random walk; Benchmark (surveying); Social network (sociolinguistics); Degree (music); Theoretical computer science; Friendship; Interpersonal ties; Social network analysis; Data mining; Artificial intelligence; Machine learning; World Wide Web; Social media; Mathematics","score_opus":0.019931366156918727,"score_gpt":0.2647543712801226,"score_spread":0.24482300512320385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3214350751","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05375071,0.0013986772,0.938669,0.0002835235,0.00008605071,0.00013365292,0.0008066594,0.0012375071,0.0036342433],"genre_scores_gemma":[0.723993,0.0012220561,0.26275414,0.000276427,0.000120741504,0.00019751802,0.0024575905,0.00014588199,0.008832593],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992306,0.00022307191,0.000045652043,0.00024231253,0.00020338957,0.000055094715],"domain_scores_gemma":[0.9984377,0.0006695082,0.00017621697,0.00034664135,0.00028206586,0.00008777239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005881674,0.0010812753,0.0013188312,0.00200228,0.0004304705,0.00087773916,0.0014865559,0.0011026658,0.0015008978],"category_scores_gemma":[0.0034170453,0.0005425344,0.0008780738,0.00266604,0.00046843523,0.002917575,0.0010240932,0.0011111599,0.001183091],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004600898,0.00047065568,0.010712232,0.0005185714,0.00032670583,0.000323906,0.000381952,0.41939658,0.013095047,0.030292526,0.01026985,0.5137519],"study_design_scores_gemma":[0.000016464823,0.00006363026,0.0007007303,0.000016804492,0.000028733406,0.00012833896,0.000031972577,0.98867095,0.0013400675,0.0073763942,0.0016019819,0.000023896508],"about_ca_topic_score_codex":0.0057550627,"about_ca_topic_score_gemma":0.015104227,"teacher_disagreement_score":0.0057550627,"about_ca_system_score_codex":0.000519337,"about_ca_system_score_gemma":0.0005578737,"threshold_uncertainty_score":0.011443138},"labels":[],"label_agreement":null},{"id":"W3215214493","doi":"10.1145/3473973","title":"Graph Neural Collaborative Topic Model for Citation Recommendation","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","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":"Université de Montréal","funders":"","keywords":"Computer science; Citation; Pairwise comparison; Graph; Information retrieval; Knowledge graph; Artificial neural network; Information overload; Data science; Artificial intelligence; Machine learning; Theoretical computer science; World Wide Web","score_opus":0.042966983719350094,"score_gpt":0.276904698131039,"score_spread":0.23393771441168892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3215214493","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065534115,0.0060940827,0.9143344,0.0017466584,0.0002816149,0.00012023316,0.0018982504,0.0021035986,0.0078869155],"genre_scores_gemma":[0.82381433,0.0053486656,0.14187306,0.0006147679,0.0007119492,0.0004542647,0.0044454373,0.0002382417,0.022499233],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993394,0.00020408246,0.0000399118,0.00021039775,0.00013684941,0.00006933927],"domain_scores_gemma":[0.99862576,0.0008141765,0.00013857035,0.00011153825,0.00025504324,0.000054964832],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0013106195,0.0008877128,0.0013577092,0.002563164,0.0005530996,0.0012364961,0.0024274047,0.0022070622,0.00351356],"category_scores_gemma":[0.0054871584,0.0004851269,0.001255994,0.00431988,0.0005256552,0.0030792612,0.0006452528,0.0017571637,0.0016934122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029261853,0.00028369066,0.0040402487,0.00035685478,0.00032315144,0.00017680626,0.00026565048,0.7455272,0.0021528222,0.052448057,0.014211293,0.17992152],"study_design_scores_gemma":[0.000010754821,0.000012855397,0.00026582432,0.0000074230593,0.000027440752,0.000017333092,0.0000064626447,0.98723674,0.00013093237,0.011417237,0.0008592271,0.000007758222],"about_ca_topic_score_codex":0.026032526,"about_ca_topic_score_gemma":0.027777351,"teacher_disagreement_score":0.9974368,"about_ca_system_score_codex":0.0015189846,"about_ca_system_score_gemma":0.0010694513,"threshold_uncertainty_score":0.051762044},"labels":[],"label_agreement":null},{"id":"W3215411791","doi":"10.1145/3478285","title":"Embedding Hierarchical Structures for Venue Category Representation","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","topic":"Advanced Graph Neural Networks","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":"York University; Wilfrid Laurier University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Embedding; Context (archaeology); Hierarchy; Representation (politics); Semantics (computer science); Information retrieval; Theoretical computer science; Artificial intelligence","score_opus":0.02585947478299782,"score_gpt":0.2997060619374764,"score_spread":0.27384658715447857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3215411791","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072477125,0.0022630699,0.9132767,0.0004164135,0.00011085109,0.00016491077,0.005280545,0.002387485,0.0036228576],"genre_scores_gemma":[0.7272247,0.00091907673,0.25702697,0.00017586294,0.000101384656,0.0003263259,0.010546636,0.00020453836,0.003474604],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945194,0.00017424913,0.000033345204,0.00018143302,0.00009117416,0.00006784339],"domain_scores_gemma":[0.999086,0.00032778265,0.00009957869,0.00026006537,0.00016513775,0.00006139138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003965094,0.0007051969,0.0006308817,0.0030700206,0.0005837751,0.0007719918,0.0012474557,0.001008934,0.0026789235],"category_scores_gemma":[0.0030285676,0.0003035505,0.0008339948,0.0037536924,0.0005460789,0.0024131862,0.0013688423,0.0010667492,0.0010044752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046023735,0.0003363686,0.013879179,0.000827454,0.00025739655,0.00032060264,0.001226601,0.1776881,0.013517862,0.08284324,0.028164461,0.68047845],"study_design_scores_gemma":[0.000023529097,0.000086232234,0.0031067831,0.00006985157,0.000046480083,0.00016857918,0.00036801366,0.9084129,0.0023246317,0.07441385,0.010933676,0.00004552947],"about_ca_topic_score_codex":0.012268184,"about_ca_topic_score_gemma":0.0273934,"teacher_disagreement_score":0.012268184,"about_ca_system_score_codex":0.0007807628,"about_ca_system_score_gemma":0.00067250186,"threshold_uncertainty_score":0.024393559},"labels":[],"label_agreement":null},{"id":"W3217040326","doi":"10.1145/3471165","title":"Dual Gated Graph Attention Networks with Dynamic Iterative Training for Cross-Lingual Entity Alignment","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","topic":"Advanced Graph Neural Networks","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":"York University","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China; National Research Foundation Singapore","keywords":"Computer science; Attention network; Graph; Embedding; Iterative and incremental development; Benchmark (surveying); Dual (grammatical number); Process (computing); Machine learning; Artificial intelligence; Theoretical computer science; Data mining","score_opus":0.0196459319324312,"score_gpt":0.27745233427603794,"score_spread":0.25780640234360674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3217040326","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079362996,0.0021041618,0.9044634,0.0008095075,0.00021374441,0.00016088903,0.00037517393,0.0060586683,0.0064513874],"genre_scores_gemma":[0.82346815,0.00061945966,0.16459422,0.00095852115,0.00010389219,0.00021575097,0.0015853526,0.00037197705,0.008082715],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993292,0.00019220842,0.00002896983,0.0002724828,0.000082627135,0.00009455467],"domain_scores_gemma":[0.99883956,0.0005812141,0.00008448759,0.00021059878,0.00021310686,0.000070927475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009887434,0.0014020243,0.0010772239,0.0010787824,0.0007655739,0.00080032763,0.0028709525,0.0016811825,0.0029610656],"category_scores_gemma":[0.004456244,0.0006809248,0.0007597976,0.0016393305,0.0007975723,0.0025816984,0.0020636625,0.0022674322,0.00096401706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023094418,0.00025016986,0.003295612,0.00013781643,0.00014328264,0.00024672804,0.00029283253,0.5945234,0.005244368,0.009983409,0.008744049,0.37690744],"study_design_scores_gemma":[0.000008814662,0.00002492102,0.00024321598,0.000007175132,0.000019968975,0.000024941182,0.000022376073,0.9925694,0.00068536244,0.0055194716,0.0008681514,0.0000062026047],"about_ca_topic_score_codex":0.024754448,"about_ca_topic_score_gemma":0.04707427,"teacher_disagreement_score":0.024754448,"about_ca_system_score_codex":0.0015814684,"about_ca_system_score_gemma":0.0016727669,"threshold_uncertainty_score":0.04922068},"labels":[],"label_agreement":null},{"id":"W4200199191","doi":"10.1145/3476106","title":"Are Topics Interesting or Not? An LDA-based Topic-graph Probabilistic Model for Web Search Personalization","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","topic":"Information Retrieval and Search Behavior","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":"York University; Wilfrid Laurier University","funders":"Wilfrid Laurier University","keywords":"Latent Dirichlet allocation; Computer science; Personalization; Topic model; Information retrieval; Web page; Graph; Probabilistic logic; Web search query; Personalized search; User modeling; World Wide Web; User interface; Data mining; Search engine; Theoretical computer science; Artificial intelligence","score_opus":0.11641684713239055,"score_gpt":0.3228678552276038,"score_spread":0.20645100809521327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200199191","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06286655,0.0034306417,0.9265,0.0015588516,0.00011330038,0.00018177739,0.0010956428,0.0010187111,0.0032344498],"genre_scores_gemma":[0.873003,0.0025620507,0.113079116,0.00054786867,0.00034916602,0.00043057752,0.0016930108,0.00019715607,0.00813807],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984011,0.0006562373,0.00007684482,0.00048644256,0.000237467,0.00014184388],"domain_scores_gemma":[0.996608,0.0024457085,0.00023479605,0.0002902108,0.00032019505,0.00010117848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020032371,0.0009793871,0.0015528692,0.0023523655,0.0007116053,0.0017563459,0.0017063941,0.0017156393,0.0021266828],"category_scores_gemma":[0.007315936,0.0007998366,0.0018229324,0.002901858,0.0011446112,0.0038547977,0.0010020875,0.002158641,0.0011889356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010190001,0.00048517573,0.018145667,0.0006843683,0.0006278874,0.00056277105,0.001602853,0.5951419,0.007822831,0.10857768,0.014693864,0.25063607],"study_design_scores_gemma":[0.000021573689,0.000032808537,0.0014068483,0.00001711935,0.00006911063,0.00012498719,0.000045947956,0.96460575,0.00032433882,0.031575043,0.0017463069,0.000030165607],"about_ca_topic_score_codex":0.014141992,"about_ca_topic_score_gemma":0.015940344,"teacher_disagreement_score":0.014141992,"about_ca_system_score_codex":0.0016445372,"about_ca_system_score_gemma":0.00091303297,"threshold_uncertainty_score":0.028119326},"labels":[],"label_agreement":null},{"id":"W4220896903","doi":"10.1145/3507356","title":"Leveraging Narrative to Generate Movie Script","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","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":"Thomson Reuters (Canada); Université de Montréal","funders":"","keywords":"Computer science; Narrative; Scripting language; Context (archaeology); Upload; Unavailability; Task (project management); Construct (python library); Information retrieval; Artificial intelligence; Natural language processing; World Wide Web; Linguistics; Programming language","score_opus":0.03357747367188199,"score_gpt":0.24551363434961782,"score_spread":0.21193616067773582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220896903","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19913226,0.0055119353,0.6519421,0.0023979913,0.0007547352,0.0031516596,0.06144606,0.058506146,0.01715713],"genre_scores_gemma":[0.28473267,0.0010243439,0.59312737,0.0006304219,0.00015959215,0.0008682896,0.10859724,0.0013781668,0.009481948],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99888605,0.000376968,0.00011516122,0.00041126923,0.0001586242,0.000051921194],"domain_scores_gemma":[0.99771047,0.0011632855,0.00021599985,0.00045820716,0.0003121934,0.00013987662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001006298,0.0015474637,0.0006471928,0.0014175086,0.00046062324,0.001031738,0.0012862239,0.0011058089,0.003305051],"category_scores_gemma":[0.007260557,0.0003497479,0.0009467202,0.00083477644,0.00030057394,0.0023963342,0.00081151095,0.0010070878,0.0040784692],"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.0013509454,0.00084435346,0.021741437,0.003527634,0.00026010856,0.002078766,0.0020966479,0.040653985,0.060608394,0.008855675,0.13302061,0.7249614],"study_design_scores_gemma":[0.0002559425,0.0008183273,0.0111497445,0.00028747888,0.00016586274,0.0018874931,0.0014343271,0.71079725,0.0683767,0.016668884,0.18797837,0.00017963773],"about_ca_topic_score_codex":0.003101846,"about_ca_topic_score_gemma":0.0073796026,"teacher_disagreement_score":0.003305051,"about_ca_system_score_codex":0.0006596388,"about_ca_system_score_gemma":0.0007117531,"threshold_uncertainty_score":0.011056483},"labels":[],"label_agreement":null},{"id":"W4282569005","doi":"10.1145/3544103","title":"GDESA: Greedy Diversity Encoder with Self-attention for Search Results Diversification","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","topic":"Information Retrieval and Search Behavior","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é de Montréal","funders":"National Natural Science Foundation of China","keywords":"Computer science; Diversification (marketing strategy); Leverage (statistics); Greedy algorithm; Selection (genetic algorithm); Encoder; Ranking (information retrieval); Machine learning; Artificial intelligence; Data mining; Information retrieval; Algorithm; Business","score_opus":0.03631250601771496,"score_gpt":0.2487990638902549,"score_spread":0.21248655787253995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4282569005","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064184025,0.0016208001,0.9273155,0.0003513037,0.00010934971,0.00013481875,0.0002168348,0.0027763802,0.003290984],"genre_scores_gemma":[0.74305546,0.00071219995,0.24629124,0.00060094136,0.00014964007,0.00026363754,0.00060832145,0.00024052824,0.008078041],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994411,0.00014178947,0.000030596966,0.00011439266,0.00020366555,0.000068456444],"domain_scores_gemma":[0.9988984,0.0005783785,0.00008512131,0.00013881017,0.00022274673,0.000076477816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009949347,0.0008179406,0.0010092735,0.00093315734,0.00035587177,0.00064908765,0.0013737666,0.0009944921,0.0016207048],"category_scores_gemma":[0.0030142656,0.00036135004,0.0005380951,0.00079819356,0.0005941319,0.0014057753,0.0013239848,0.0011636673,0.0007914629],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004561336,0.00038219852,0.005122396,0.00019618873,0.0001620705,0.0003091148,0.00033001517,0.24609983,0.025869954,0.013094539,0.008391589,0.69958603],"study_design_scores_gemma":[0.000035129244,0.00009367888,0.00045902748,0.000012306808,0.000025949215,0.00011148795,0.000018062337,0.98716366,0.0049659596,0.005742091,0.0013583301,0.000014294319],"about_ca_topic_score_codex":0.0031584997,"about_ca_topic_score_gemma":0.006071839,"teacher_disagreement_score":0.0031584997,"about_ca_system_score_codex":0.00063779275,"about_ca_system_score_gemma":0.0012280792,"threshold_uncertainty_score":0.0062802434},"labels":[],"label_agreement":null},{"id":"W4288080293","doi":"10.1145/3385186","title":"OutdoorSent","year":2020,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","topic":"Sentiment Analysis and Opinion Mining","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":"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; Sentiment analysis; Generalization; Class (philosophy); Artificial intelligence; Context (archaeology); Information retrieval; Machine learning; Data science; Geography","score_opus":0.03513477824408741,"score_gpt":0.24907013153895155,"score_spread":0.21393535329486413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288080293","genre_codex":"dataset","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07698869,0.002548857,0.031193126,0.0013663386,0.0017975577,0.001065855,0.64780074,0.10619442,0.13104445],"genre_scores_gemma":[0.08711065,0.00065542106,0.031552654,0.00060103874,0.0002675717,0.00047412072,0.833451,0.0036932747,0.042194206],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948585,0.00006084509,0.00003040826,0.00019252658,0.00014531007,0.00008506276],"domain_scores_gemma":[0.99944586,0.000078566874,0.000057649184,0.00020257864,0.0001474449,0.00006787295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059432955,0.0015129491,0.000601338,0.0014375384,0.00056038005,0.0014887609,0.0011671243,0.0008974693,0.043757293],"category_scores_gemma":[0.0018361099,0.0003556335,0.0008170568,0.0013468337,0.00028016075,0.0015907246,0.001668335,0.00073980726,0.03565536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060036615,0.00020135577,0.007123306,0.0010317968,0.00010788965,0.00025673362,0.0002623461,0.001974337,0.007858192,0.0025233391,0.83308214,0.14497814],"study_design_scores_gemma":[0.00023554258,0.00037632114,0.023751635,0.00022032655,0.00009147051,0.0008526375,0.0004851372,0.039337233,0.015678208,0.0053111203,0.9135667,0.00009363806],"about_ca_topic_score_codex":0.009200886,"about_ca_topic_score_gemma":0.027934562,"teacher_disagreement_score":0.043757293,"about_ca_system_score_codex":0.0005851979,"about_ca_system_score_gemma":0.000553981,"threshold_uncertainty_score":0.14638269},"labels":[],"label_agreement":null},{"id":"W4293083978","doi":"10.1145/3533020","title":"Learning Implicit and Explicit Multi-task Interactions for Information Extraction","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","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":"University of Ottawa","funders":"National Key Research and Development Program of China","keywords":"Computer science; Multi-task learning; Generalization; Leverage (statistics); Artificial intelligence; Task (project management); Machine learning; Sequence learning; Unobservable; Representation (politics)","score_opus":0.027401701728496257,"score_gpt":0.27734139878757036,"score_spread":0.2499396970590741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293083978","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0320079,0.0006685317,0.96343565,0.00039342948,0.00006142252,0.00008167795,0.00014762077,0.0012254299,0.001978412],"genre_scores_gemma":[0.72526646,0.000668671,0.26714063,0.00043673426,0.00012509961,0.00029508534,0.0010482906,0.0002221979,0.0047968756],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988242,0.0003354883,0.00006866879,0.00042599565,0.00020839904,0.00013730608],"domain_scores_gemma":[0.9974469,0.0014162936,0.00024541924,0.0004675387,0.0002993586,0.0001244251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020461048,0.0017822252,0.0009503917,0.00058855885,0.0006145194,0.0009032622,0.0020282045,0.0013061129,0.0016333252],"category_scores_gemma":[0.007025431,0.000654783,0.001265249,0.00072418194,0.0007797832,0.0038392087,0.0023731636,0.0032743318,0.00081359525],"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.00048410197,0.00061035994,0.005945704,0.0003428423,0.00034435978,0.00058627845,0.0006781832,0.4529666,0.03813067,0.028020948,0.006107283,0.46578267],"study_design_scores_gemma":[0.000007064311,0.000055409637,0.00048412662,0.000007127169,0.000027171589,0.0000413275,0.000012897872,0.9842481,0.004296119,0.009989522,0.00081834313,0.000012757726],"about_ca_topic_score_codex":0.0031140563,"about_ca_topic_score_gemma":0.0062022447,"teacher_disagreement_score":0.0031140563,"about_ca_system_score_codex":0.00092146604,"about_ca_system_score_gemma":0.0010324302,"threshold_uncertainty_score":0.010820985},"labels":[],"label_agreement":null},{"id":"W4296448351","doi":"10.1145/3564285","title":"A Multi-Objective Optimization Framework for Multi-Stakeholder Fairness-Aware Recommendation","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","topic":"Recommender Systems and Techniques","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":"Google (Canada); Microsoft (Canada); McGill University","funders":"","keywords":"Computer science; Stakeholder; Pareto principle; Ranking (information retrieval); Multi-objective optimization; Set (abstract data type); Rank (graph theory); Order (exchange); Mathematical optimization; Business; Artificial intelligence; Machine learning; Economics; Mathematics","score_opus":0.09382313345199016,"score_gpt":0.30968547861339896,"score_spread":0.2158623451614088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296448351","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004505774,0.00026792948,0.9931791,0.0001980865,0.000034652243,0.000047957787,0.00005866706,0.00018545912,0.001522313],"genre_scores_gemma":[0.52481097,0.0004480494,0.46730453,0.0004457673,0.00013572011,0.00045764953,0.000301998,0.00015224535,0.005943125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985428,0.0005941486,0.000067708614,0.00029810806,0.00030441416,0.00019287156],"domain_scores_gemma":[0.9982919,0.0010201052,0.00013654429,0.00009959182,0.00033733403,0.00011449379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034700506,0.0015357651,0.0019522625,0.00080031843,0.0008144788,0.0013511871,0.0024437634,0.0024605142,0.0040597324],"category_scores_gemma":[0.0041030166,0.00081533566,0.0013532329,0.001079448,0.0007682358,0.0014052023,0.0013097117,0.0024266036,0.0006629631],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004149792,0.000055175347,0.0004119774,0.000066410124,0.000044937566,0.000064779684,0.000044866567,0.9698457,0.0005997421,0.007816579,0.0012227267,0.019785631],"study_design_scores_gemma":[0.00000663728,0.0000137606885,0.000038415223,0.000004169748,0.000005623304,0.000006397532,0.000004223908,0.9979436,0.000073354895,0.0016686202,0.0002310788,0.0000039980937],"about_ca_topic_score_codex":0.015427094,"about_ca_topic_score_gemma":0.0130253695,"teacher_disagreement_score":0.015427094,"about_ca_system_score_codex":0.0013739191,"about_ca_system_score_gemma":0.0021433206,"threshold_uncertainty_score":0.030674577},"labels":[],"label_agreement":null},{"id":"W4297816431","doi":"10.1145/3555371","title":"Learning to Ask: Conversational Product Search via Representation Learning","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","topic":"Information Retrieval and Search Behavior","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":"York University","funders":"","keywords":"Ask price; Product (mathematics); Computer science; Representation (politics); Human–computer interaction; Artificial intelligence; Mathematics; Business; Political science","score_opus":0.031508617344332475,"score_gpt":0.2849817503115045,"score_spread":0.25347313296717205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297816431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06594338,0.0017954507,0.9203028,0.0010405651,0.000097373944,0.00019687945,0.0008254966,0.0043153567,0.0054827025],"genre_scores_gemma":[0.8743323,0.00068225886,0.11362898,0.00074409146,0.000097799035,0.0002696196,0.0021521002,0.00023902969,0.007853879],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991812,0.0003223028,0.00002996814,0.0002755819,0.00010070715,0.000090204376],"domain_scores_gemma":[0.9987633,0.00083902845,0.00006993748,0.00016781641,0.00009557387,0.00006429695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010426432,0.0010609799,0.0009862751,0.000621932,0.00043912846,0.0010421611,0.0023062231,0.0016879459,0.0034520763],"category_scores_gemma":[0.0040024044,0.0005706332,0.0014934536,0.0007875132,0.0008026054,0.002994692,0.0017383562,0.0025237915,0.0011152083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086588215,0.00064033654,0.004779772,0.0004941431,0.00034054133,0.00048601846,0.0012050037,0.39669785,0.009943069,0.02691868,0.01865506,0.53897357],"study_design_scores_gemma":[0.000017719327,0.000054395474,0.00026261035,0.000010833251,0.000029523835,0.00005529994,0.00004523589,0.9850971,0.0011540583,0.011992648,0.0012671968,0.000013365062],"about_ca_topic_score_codex":0.009805598,"about_ca_topic_score_gemma":0.009735475,"teacher_disagreement_score":0.009805598,"about_ca_system_score_codex":0.0010727018,"about_ca_system_score_gemma":0.00092762226,"threshold_uncertainty_score":0.019497037},"labels":[],"label_agreement":null},{"id":"W4308605908","doi":"10.1145/3570500","title":"Modeling User Reviews through Bayesian Graph Attention Networks for Recommendation","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","topic":"Recommender Systems and 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; Huawei Technologies (Canada)","funders":"","keywords":"Computer science; Inference; Semantics (computer science); Graph; Recommender system; Bayesian network; User modeling; Machine learning; Theoretical computer science; Information retrieval; Artificial intelligence; User interface","score_opus":0.045832603855943496,"score_gpt":0.28289566840317415,"score_spread":0.23706306454723064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308605908","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04443741,0.0047083986,0.9401145,0.0013531626,0.00021964067,0.00018219568,0.0015002001,0.0024249693,0.005059515],"genre_scores_gemma":[0.8016312,0.003087704,0.17885785,0.0009722941,0.00051422854,0.00033011372,0.003956928,0.0002401152,0.01040958],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986779,0.0005062457,0.00005886492,0.00040866842,0.00025605652,0.000092228096],"domain_scores_gemma":[0.9964462,0.002289697,0.00029444706,0.0002733971,0.00060824247,0.00008790485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015200075,0.0016541035,0.0012905636,0.0025641322,0.00059177267,0.0011990503,0.0019172381,0.0018247684,0.0025782664],"category_scores_gemma":[0.010046315,0.001044387,0.0013630274,0.002643929,0.00049257634,0.0029463435,0.0006552793,0.0023277747,0.0013820844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003148036,0.00018450871,0.0070961677,0.0002796164,0.00036100807,0.00012595956,0.00022440247,0.7774041,0.0018388835,0.017852936,0.013588009,0.18072952],"study_design_scores_gemma":[0.0000059694366,0.000012059836,0.00053990714,0.000009135193,0.000029041334,0.000013918843,0.0000048225934,0.9916658,0.00011517594,0.006837577,0.00075925275,0.000007322778],"about_ca_topic_score_codex":0.0633875,"about_ca_topic_score_gemma":0.08895086,"teacher_disagreement_score":0.0633875,"about_ca_system_score_codex":0.002169028,"about_ca_system_score_gemma":0.0010469896,"threshold_uncertainty_score":0.12603712},"labels":[],"label_agreement":null},{"id":"W4311609640","doi":"10.1145/3576922","title":"Efficient Document-at-a-Time and Score-at-a-Time Query Evaluation for Learned Sparse Representations","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","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":"University of Waterloo","funders":"","keywords":"Computer science; Exploit; Transformer; Pareto principle; Ranking (information retrieval); Software deployment; Information retrieval; Data mining; Software engineering; Mathematical optimization","score_opus":0.03333565260937324,"score_gpt":0.30646139235857817,"score_spread":0.27312573974920495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311609640","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.086728066,0.00070975494,0.8901686,0.00057997747,0.00008968507,0.00040134668,0.0005940512,0.01589205,0.004836431],"genre_scores_gemma":[0.5137633,0.00040540728,0.47796136,0.000199782,0.00010898774,0.00018829157,0.0017488134,0.0006665213,0.004957467],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979686,0.00057993387,0.00014224196,0.0003088048,0.00070260494,0.00029774604],"domain_scores_gemma":[0.99404705,0.0024154522,0.00038271127,0.001768593,0.0011353048,0.00025078264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026465745,0.0014259905,0.0014909926,0.0014575579,0.0006954687,0.0028557153,0.0018519069,0.0010277579,0.006013706],"category_scores_gemma":[0.0131165115,0.0005218509,0.00087004824,0.002436101,0.0009417039,0.00574322,0.0021387984,0.0018629495,0.0041445917],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013761893,0.00056879636,0.0043440503,0.00034713448,0.00012057793,0.00019582409,0.00033742178,0.087752104,0.03137011,0.02648973,0.023627194,0.8234709],"study_design_scores_gemma":[0.0000735465,0.000269434,0.00069474056,0.000011538812,0.000034582532,0.00021171868,0.00014014558,0.96111643,0.016239818,0.018269647,0.002904866,0.000033433396],"about_ca_topic_score_codex":0.007892223,"about_ca_topic_score_gemma":0.0142123215,"teacher_disagreement_score":0.007892223,"about_ca_system_score_codex":0.0013609929,"about_ca_system_score_gemma":0.002696366,"threshold_uncertainty_score":0.02011782},"labels":[],"label_agreement":null},{"id":"W4313426558","doi":"10.1145/3533769","title":"Knowledge Base Embedding for Sampling-Based Prediction","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","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":"University of Ottawa","funders":"National Key Research and Development Program of China; Fundamental Research Funds for the Central Universities; State Key Laboratory of Software Development Environment","keywords":"Computer science; Latent variable; Protocol (science); Task (project management); Ranking (information retrieval); Machine learning; Sampling (signal processing); Rank (graph theory); Artificial intelligence; Data mining; Embedding; Variable (mathematics); Link (geometry); Mathematics","score_opus":0.038179926302878586,"score_gpt":0.2914206615433705,"score_spread":0.2532407352404919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313426558","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054050468,0.00119866,0.9386565,0.0006170097,0.000112493835,0.00015658131,0.0008557292,0.0019402106,0.0024122405],"genre_scores_gemma":[0.84351134,0.00067309634,0.14685859,0.00041757285,0.00016913243,0.00033266455,0.0030725745,0.00015011708,0.0048149927],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998618,0.00043803963,0.00008154151,0.0003991029,0.00033181274,0.00013155433],"domain_scores_gemma":[0.9940655,0.00401933,0.00029734307,0.00075387413,0.00073543476,0.0001285126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002017311,0.0011110647,0.0011933236,0.0013734906,0.00046909053,0.0010666572,0.0017949629,0.0014993865,0.0030504267],"category_scores_gemma":[0.011186436,0.00042551203,0.0006199677,0.0014955713,0.00067581615,0.003199074,0.0012480589,0.0021300775,0.0010281507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041707902,0.0004734163,0.0038303356,0.0002607282,0.00014285542,0.00016587725,0.0001796411,0.52746946,0.0032974996,0.014205869,0.008219786,0.44133747],"study_design_scores_gemma":[0.000008003129,0.000028486915,0.00020843947,0.000008887579,0.000010912732,0.000013350631,0.000010033684,0.9923644,0.0006355253,0.0063765845,0.00032932757,0.0000059660874],"about_ca_topic_score_codex":0.009778523,"about_ca_topic_score_gemma":0.012093051,"teacher_disagreement_score":0.009778523,"about_ca_system_score_codex":0.0010613257,"about_ca_system_score_gemma":0.0013163051,"threshold_uncertainty_score":0.019443214},"labels":[],"label_agreement":null},{"id":"W4317209756","doi":"10.1145/3580489","title":"Contrastive Learning for Legal Judgment Prediction","year":2023,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","topic":"Artificial Intelligence in Law","field":"Social Sciences","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":"Université de Montréal","funders":"","keywords":"Computer science; Task (project management); Representation (politics); Artificial intelligence; Range (aeronautics); Focus (optics); Machine learning; Law; Political science","score_opus":0.05367930586555467,"score_gpt":0.3340259175124735,"score_spread":0.2803466116469188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317209756","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25232232,0.0072869053,0.703815,0.0053714747,0.00080556714,0.0005643219,0.0045344,0.006983018,0.01831709],"genre_scores_gemma":[0.9134531,0.00052115746,0.07515404,0.00095430383,0.0003560135,0.0001671561,0.0046064854,0.00012352619,0.0046642465],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820614,0.0005125211,0.00011538835,0.0006270485,0.00037972577,0.00015917397],"domain_scores_gemma":[0.99432606,0.0036787747,0.00047018396,0.0005297619,0.0007458568,0.00024933397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002860843,0.0011736624,0.0012229792,0.0024077306,0.00074503076,0.0016228536,0.0024489125,0.002277464,0.0036308959],"category_scores_gemma":[0.013097792,0.00038813177,0.00094668684,0.0014997856,0.0013502133,0.0028753441,0.001441923,0.0049329433,0.0015554242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00096567476,0.0014609252,0.022867426,0.0004190048,0.00026897807,0.0006562998,0.00033985186,0.35227683,0.004726958,0.02098662,0.049585626,0.54544586],"study_design_scores_gemma":[0.000028112168,0.000045972694,0.0011900654,0.000022399234,0.000017965278,0.000044029064,0.000021013877,0.98249316,0.0014264077,0.012769878,0.0019267187,0.0000142905055],"about_ca_topic_score_codex":0.006818128,"about_ca_topic_score_gemma":0.010342496,"teacher_disagreement_score":0.006818128,"about_ca_system_score_codex":0.0023627495,"about_ca_system_score_gemma":0.0015358143,"threshold_uncertainty_score":0.017142951},"labels":[],"label_agreement":null},{"id":"W4318617465","doi":"10.1145/3582426","title":"A Dense Representation Framework for Lexical and Semantic Matching","year":2023,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","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":"University of Waterloo","funders":"","keywords":"Computer science; Natural language processing; Artificial intelligence; Representation (politics); Matching (statistics); Semantic matching; Lexical database; Information retrieval; WordNet; Mathematics","score_opus":0.040472218124865324,"score_gpt":0.3386158581131831,"score_spread":0.2981436399883178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318617465","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053366795,0.00038984098,0.99044716,0.00016898566,0.00004529574,0.00009216331,0.00030458844,0.0014735039,0.0017418414],"genre_scores_gemma":[0.3583828,0.0010732715,0.62480456,0.00059926766,0.00025392356,0.00058261177,0.003392113,0.00052220025,0.010389268],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863607,0.0003845712,0.00009546386,0.00032331867,0.0004046883,0.00015591636],"domain_scores_gemma":[0.99870574,0.0004945679,0.00012644762,0.00033625145,0.00028224385,0.000054709206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014293417,0.0010179816,0.0012968071,0.0026580999,0.0005427002,0.0020731802,0.0022739884,0.0015200612,0.0052596894],"category_scores_gemma":[0.0061922856,0.0005652129,0.0013706373,0.0035418742,0.0010109402,0.005432134,0.0024211167,0.0017407002,0.002652319],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035215227,0.0003122949,0.0012835652,0.0003869695,0.00016958601,0.00027615324,0.00036031188,0.16270427,0.01771687,0.12899856,0.014385808,0.67305344],"study_design_scores_gemma":[0.000034724395,0.00011417605,0.0003570529,0.000030493862,0.000041884738,0.00021993532,0.000077168486,0.9040404,0.00393622,0.08395989,0.0071554496,0.000032538963],"about_ca_topic_score_codex":0.007327286,"about_ca_topic_score_gemma":0.008302698,"teacher_disagreement_score":0.007327286,"about_ca_system_score_codex":0.0011753758,"about_ca_system_score_gemma":0.0013568657,"threshold_uncertainty_score":0.01759541},"labels":[],"label_agreement":null},{"id":"W4318775883","doi":"10.1145/3582553","title":"TME: Tree-guided Multi-task Embedding Learning towards Semantic Venue Annotation","year":2023,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","topic":"Human Mobility and Location-Based Analysis","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":"York University; Wilfrid Laurier University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Task (project management); Annotation; Information retrieval; Embedding; Feature (linguistics); Semantic similarity; Natural language processing; Artificial intelligence; Hierarchy; Tree (set theory); Exploit","score_opus":0.04848614744543105,"score_gpt":0.34552204317668656,"score_spread":0.2970358957312555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318775883","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10464506,0.0038480032,0.8735614,0.0009712718,0.00044927167,0.0002799008,0.004319403,0.007939965,0.003985793],"genre_scores_gemma":[0.65504503,0.0011067,0.3123667,0.0009846366,0.00034408257,0.0005095138,0.01902681,0.0007194964,0.009897026],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988116,0.00042533613,0.000047441838,0.0004327504,0.0001347594,0.00014819986],"domain_scores_gemma":[0.99809426,0.0010317873,0.0001249631,0.00034182947,0.00024177857,0.00016546606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012506316,0.0018965184,0.0015104889,0.0021659394,0.00071386027,0.00095996587,0.002489255,0.0027889144,0.0032319543],"category_scores_gemma":[0.0048919516,0.00051615713,0.0017055643,0.00281301,0.00071568415,0.0037810225,0.0024007896,0.0029489277,0.0021931243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009511239,0.0013729676,0.011595152,0.00096603,0.0003809933,0.0005888125,0.0008825372,0.23796435,0.011855518,0.012669259,0.06944522,0.651328],"study_design_scores_gemma":[0.000039344857,0.00015359584,0.0009329724,0.00004021525,0.000030416979,0.00014950175,0.00012213294,0.97656244,0.0015398097,0.016228927,0.0041721384,0.000028431563],"about_ca_topic_score_codex":0.0073115113,"about_ca_topic_score_gemma":0.013212343,"teacher_disagreement_score":0.0073115113,"about_ca_system_score_codex":0.0008270256,"about_ca_system_score_gemma":0.0009894586,"threshold_uncertainty_score":0.0145379305},"labels":[],"label_agreement":null},{"id":"W4362554832","doi":"10.1145/3589762","title":"A Variational Neural Architecture for Skill-based Team Formation","year":2023,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","topic":"Mobile Crowdsensing and Crowdsourcing","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Windsor; Toronto Metropolitan University","funders":"","keywords":"Computer science; Heuristics; Machine learning; Bayesian network; Task (project management); Set (abstract data type); Identification (biology); Artificial intelligence; Architecture; Artificial neural network; Range (aeronautics); Cover (algebra); Space (punctuation); Bayesian optimization; Theoretical computer science","score_opus":0.015551157534069838,"score_gpt":0.23988162223202208,"score_spread":0.22433046469795226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362554832","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023027819,0.00024498563,0.97289795,0.00047437754,0.000048298076,0.0000433018,0.00010472047,0.00029876444,0.002859826],"genre_scores_gemma":[0.8032135,0.0002874739,0.18591401,0.00033241694,0.000083975414,0.0002131546,0.0004815866,0.00009751255,0.009376368],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947125,0.00016078587,0.000019997524,0.00015441023,0.00011088487,0.00008268824],"domain_scores_gemma":[0.9992853,0.00034751248,0.00008254349,0.00006861903,0.00014961042,0.00006645478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011480494,0.0007376584,0.00074020895,0.00061633537,0.0005143971,0.00076151954,0.002109973,0.0018376652,0.002548013],"category_scores_gemma":[0.0039394055,0.0006322095,0.00069582206,0.00066201505,0.001035912,0.001444581,0.0017820935,0.0017008593,0.0006225609],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046475274,0.000045454213,0.0010279827,0.000039240487,0.000044638564,0.000039202223,0.00009402376,0.9329003,0.0013137771,0.016840186,0.0016384693,0.045970112],"study_design_scores_gemma":[0.0000026469759,0.000006425018,0.000054751836,0.000003160899,0.0000020354612,0.0000039568895,0.0000043696346,0.99550855,0.00010001855,0.0041585607,0.00015346792,0.000002061514],"about_ca_topic_score_codex":0.013531601,"about_ca_topic_score_gemma":0.012902873,"teacher_disagreement_score":0.013531601,"about_ca_system_score_codex":0.0012527872,"about_ca_system_score_gemma":0.0015247929,"threshold_uncertainty_score":0.026905656},"labels":[],"label_agreement":null},{"id":"W4382396965","doi":"10.1145/3606369","title":"Coarse-to-Fine Knowledge-Enhanced Multi-Interest Learning Framework for Multi-Behavior Recommendation","year":2023,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","topic":"Recommender Systems and Techniques","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":"McGill University; Huawei Technologies (Canada)","funders":"","keywords":"Computer science; Purchasing; Preference; Artificial intelligence; Machine learning","score_opus":0.12479876670118102,"score_gpt":0.3673304309339685,"score_spread":0.2425316642327875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382396965","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019054882,0.0007215009,0.9776969,0.0002718807,0.00002645844,0.00007472905,0.00020089732,0.0010602489,0.0008924535],"genre_scores_gemma":[0.66124016,0.00055592455,0.3321655,0.000520404,0.00011710821,0.00026401316,0.001115507,0.0001304554,0.0038908403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986234,0.00037210208,0.000086986234,0.00051951193,0.00026038682,0.00013765592],"domain_scores_gemma":[0.99795806,0.001056005,0.00020506547,0.00038704366,0.00027554552,0.00011831563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018926024,0.0012118078,0.0019259884,0.0015763959,0.000512201,0.0010383386,0.0031469963,0.0018847067,0.0015007469],"category_scores_gemma":[0.004609769,0.00078722805,0.0015605898,0.0018298215,0.0007754183,0.002632017,0.0013658024,0.002516835,0.00077515683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033329133,0.00075095904,0.009060451,0.00030630274,0.00036162874,0.00032674923,0.00039873208,0.6274047,0.0067843725,0.011358803,0.0053692143,0.3375449],"study_design_scores_gemma":[0.0000093291255,0.000038587692,0.00041034122,0.0000066220755,0.00002114633,0.000031446067,0.000008809916,0.99530244,0.0004881604,0.0032560297,0.00041731246,0.000009707872],"about_ca_topic_score_codex":0.013002597,"about_ca_topic_score_gemma":0.018833183,"teacher_disagreement_score":0.013002597,"about_ca_system_score_codex":0.0011805834,"about_ca_system_score_gemma":0.0011202679,"threshold_uncertainty_score":0.025853813},"labels":[],"label_agreement":null},{"id":"W4385780698","doi":"10.1145/3613447","title":"Toward Best Practices for Training Multilingual Dense Retrieval Models","year":2023,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada First Research Excellence Fund; Compute Canada","keywords":"Computer science; Transformer; Language model; Architecture; Encoder; Relevance (law); Natural language processing; Artificial intelligence; Transfer of learning; Training set; Information retrieval; Variety (cybernetics); Data science","score_opus":0.2134837990183883,"score_gpt":0.3481269699009422,"score_spread":0.13464317088255393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385780698","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008722712,0.0017719964,0.9820004,0.0010965351,0.000063642714,0.0001557008,0.00022979421,0.003985376,0.0019737992],"genre_scores_gemma":[0.11912721,0.0012796231,0.8730247,0.0008610594,0.00010841284,0.00056191866,0.001727281,0.0009376808,0.002372096],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99439985,0.0033194898,0.00039530144,0.0008355748,0.0007906802,0.0002590369],"domain_scores_gemma":[0.9873017,0.007896454,0.00033121937,0.0022296838,0.0019383988,0.00030248525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011247408,0.0019932059,0.0015359919,0.0021171868,0.00097441644,0.0033521866,0.0054405443,0.0024233356,0.003930444],"category_scores_gemma":[0.031637,0.001845071,0.0012346596,0.0017995661,0.001361848,0.0067508956,0.004347054,0.005186656,0.003966081],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042345806,0.00048089566,0.0028293133,0.000718314,0.00036890703,0.00022298578,0.0007023633,0.2639135,0.007959372,0.038232088,0.01615703,0.6679917],"study_design_scores_gemma":[0.000102784004,0.00010407277,0.00022845507,0.0001306106,0.00006537911,0.00009816083,0.00018457959,0.93686825,0.0047490345,0.051162593,0.006273232,0.000032823056],"about_ca_topic_score_codex":0.0106134135,"about_ca_topic_score_gemma":0.025082622,"teacher_disagreement_score":0.011247408,"about_ca_system_score_codex":0.001967122,"about_ca_system_score_gemma":0.0031254026,"threshold_uncertainty_score":0.059482694},"labels":[],"label_agreement":null},{"id":"W4391680357","doi":"10.1145/3640460","title":"Revisiting Bag of Words Document Representations for Efficient Ranking with Transformers","year":2024,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","topic":"Topic Modeling","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":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Canadian Institute of Steel Construction","keywords":"Computer science; Transformer; Search engine indexing; Inference; ENCODE; Artificial intelligence; Question answering; Information retrieval; Machine learning; Natural language processing; Voltage","score_opus":0.01808328787664678,"score_gpt":0.2747271749205496,"score_spread":0.25664388704390284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391680357","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021344563,0.00075238314,0.96886337,0.0004104358,0.00009733298,0.00012148235,0.0007541176,0.005766901,0.0018894015],"genre_scores_gemma":[0.4349084,0.0012432147,0.5524042,0.00039514533,0.00024516584,0.00027580236,0.0036510066,0.0006606335,0.0062163603],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985863,0.00051293534,0.00012963373,0.00022175866,0.0004187786,0.00013055642],"domain_scores_gemma":[0.9970489,0.0013723214,0.00018844001,0.00082921836,0.00048558827,0.00007565438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019057274,0.000965622,0.0014159003,0.0019362109,0.00043848925,0.002566481,0.0019167236,0.0008113269,0.0044460064],"category_scores_gemma":[0.009744365,0.0004510947,0.00084602175,0.0032035888,0.00078233494,0.006673744,0.0015836465,0.001889517,0.0040550525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000537569,0.0002724984,0.0013435963,0.00044006598,0.00009212266,0.000115712675,0.00027262472,0.14950787,0.015935384,0.07433572,0.01776751,0.7393792],"study_design_scores_gemma":[0.00006751157,0.00017565211,0.00023747377,0.000024597175,0.00003275599,0.00010699955,0.00008598909,0.91654956,0.0071161976,0.07019403,0.005374593,0.00003457674],"about_ca_topic_score_codex":0.005040421,"about_ca_topic_score_gemma":0.0073216767,"teacher_disagreement_score":0.005040421,"about_ca_system_score_codex":0.001008998,"about_ca_system_score_gemma":0.001992778,"threshold_uncertainty_score":0.014873326},"labels":[],"label_agreement":null},{"id":"W4400650325","doi":"10.1145/3678003","title":"A Knowledge Graph Embedding Model for Answering Factoid Entity Questions","year":2024,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","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 Guelph; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Question answering; Computer science; Embedding; Knowledge graph; Information retrieval; Graph; Artificial intelligence; Natural language processing; Theoretical computer science","score_opus":0.03891582147792144,"score_gpt":0.30215229729600357,"score_spread":0.2632364758180821,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400650325","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014839797,0.0014391423,0.9747021,0.0010579387,0.00011245337,0.0002073453,0.0027306203,0.0019725314,0.0029380375],"genre_scores_gemma":[0.39432955,0.0022377463,0.5692882,0.0009820805,0.00028774457,0.00059368886,0.021135224,0.00029615915,0.01084961],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925274,0.00021478639,0.00005494115,0.00027197026,0.00015952272,0.00004608362],"domain_scores_gemma":[0.9987155,0.00077125814,0.000089481924,0.00016500159,0.00021571263,0.000043000604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082469743,0.00088588125,0.00058817276,0.0018240544,0.00041691953,0.0010885074,0.001304488,0.0016139515,0.0033395914],"category_scores_gemma":[0.0047013992,0.00032095914,0.001238884,0.0018394592,0.00044439247,0.004218193,0.0010879547,0.0016797787,0.0015703809],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036849637,0.00060174544,0.004557539,0.0009338883,0.000302885,0.00048620562,0.0009628263,0.2510891,0.0095305685,0.077862814,0.043365028,0.6099389],"study_design_scores_gemma":[0.000021256923,0.00006433253,0.0006543196,0.000042709944,0.000053961037,0.00015789537,0.00013000598,0.9210511,0.0014448133,0.06502626,0.011329757,0.000023554594],"about_ca_topic_score_codex":0.0080407,"about_ca_topic_score_gemma":0.014171173,"teacher_disagreement_score":0.0080407,"about_ca_system_score_codex":0.00089460285,"about_ca_system_score_gemma":0.00094291335,"threshold_uncertainty_score":0.015987813},"labels":[],"label_agreement":null},{"id":"W4400976991","doi":"10.1145/3681784","title":"A Self-Distilled Learning to Rank Model for <i>Ad Hoc</i> Retrieval","year":2024,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Outlier; Generalizability theory; Artificial intelligence; Rank (graph theory); Sample (material); Learning to rank; Machine learning; Feature (linguistics); Information retrieval; Ranking (information retrieval); Statistics; Mathematics","score_opus":0.022097195304718847,"score_gpt":0.2622081396623819,"score_spread":0.24011094435766303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400976991","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014753549,0.000852929,0.9795155,0.00043258074,0.00008336522,0.00016136207,0.00043946266,0.002150202,0.0016110458],"genre_scores_gemma":[0.52346194,0.0011783661,0.45212927,0.00092991214,0.00055175315,0.00069161475,0.0030193888,0.00045317598,0.017584538],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99724364,0.00095737237,0.00020381904,0.00059782644,0.00071908906,0.00027828224],"domain_scores_gemma":[0.9948891,0.0021867955,0.0005361429,0.0010814314,0.0011358592,0.00017075503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004008277,0.0015176053,0.0022195766,0.0015957123,0.0007240222,0.0025156396,0.0034445797,0.0021156743,0.0042232615],"category_scores_gemma":[0.01107359,0.00064119266,0.0013072111,0.0021445244,0.0014422025,0.0038047184,0.0017269761,0.0025088727,0.0040660826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005397818,0.00040363052,0.0025485603,0.0004061915,0.00016166276,0.00016235339,0.00021857601,0.5418393,0.0058898544,0.033904653,0.014239771,0.39968568],"study_design_scores_gemma":[0.000024068588,0.0001545483,0.00019336397,0.000014481015,0.000024596486,0.0000670614,0.000018800043,0.9853395,0.0015764157,0.010879899,0.0016795461,0.000027688326],"about_ca_topic_score_codex":0.00611718,"about_ca_topic_score_gemma":0.0070167044,"teacher_disagreement_score":0.00611718,"about_ca_system_score_codex":0.00122069,"about_ca_system_score_gemma":0.0017323493,"threshold_uncertainty_score":0.021198034},"labels":[],"label_agreement":null},{"id":"W4405553425","doi":"10.1145/3704438","title":"The In-Situ Effect of Offensive Ads on Search Engine Users","year":2024,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","topic":"Digital Communication and Language","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":"Microsoft (Canada)","funders":"","keywords":"Offensive; In situ; Advertising; Computer science; Business; Engineering; Chemistry; Operations research","score_opus":0.013390246452844907,"score_gpt":0.26318151220803726,"score_spread":0.24979126575519237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405553425","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9945469,0.00007296654,0.0004628083,0.00004865466,0.000014953446,0.000028700364,0.0000724481,0.000025376434,0.004727226],"genre_scores_gemma":[0.998247,0.000042453048,0.00061855157,0.00007212834,0.000019408935,0.000021194352,0.000072208735,0.000011525697,0.0008954472],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9979741,0.0010114972,0.00016288113,0.00026957016,0.0004585018,0.0001234746],"domain_scores_gemma":[0.9698186,0.02258874,0.0032257035,0.0020235868,0.0016237585,0.0007196745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021487826,0.00037368856,0.0002927869,0.0004887834,0.0006247536,0.0014497587,0.00026131113,0.00055731536,0.0034814882],"category_scores_gemma":[0.016996803,0.0002269122,0.00036495453,0.00026182036,0.0006121434,0.00083464355,0.000667755,0.0005788584,0.0005155322],"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.006409581,0.0023177399,0.72319293,0.0013852844,0.00047503895,0.0010477287,0.030967824,0.0017404356,0.13184468,0.0012170093,0.0023794344,0.097022384],"study_design_scores_gemma":[0.00014153533,0.003952403,0.9305914,0.00011372596,0.00043505573,0.00076148217,0.010656316,0.0045272023,0.040601354,0.00087300525,0.0072170626,0.00012945979],"about_ca_topic_score_codex":0.0016110289,"about_ca_topic_score_gemma":0.0022458248,"teacher_disagreement_score":0.0034814882,"about_ca_system_score_codex":0.00032490573,"about_ca_system_score_gemma":0.00016424089,"threshold_uncertainty_score":0.011646688},"labels":[],"label_agreement":null},{"id":"W4408930227","doi":"10.1145/3726864","title":"Enhancing Sequential Personalized Product Search with External Out-of-sequence Knowledge","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","topic":"Recommender Systems and 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é de Montréal; Hôtel-Dieu de Montréal","funders":"National Natural Science Foundation of China","keywords":"Sequence (biology); Product (mathematics); Computer science; Information retrieval; Computational biology; Mathematics; Biology; Genetics","score_opus":0.04322400138114205,"score_gpt":0.3138986129252901,"score_spread":0.270674611544148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408930227","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12139415,0.0022990608,0.8691382,0.00034550185,0.00006249399,0.000117516676,0.0005697012,0.003096205,0.0029771172],"genre_scores_gemma":[0.79579425,0.0010477573,0.19283085,0.0003667414,0.00017300804,0.0001339322,0.0021832641,0.00024690962,0.007223323],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901915,0.00024423422,0.000062241925,0.00029972242,0.000295575,0.000079074896],"domain_scores_gemma":[0.9972256,0.0015555866,0.0002067395,0.0005480515,0.0003534153,0.00011060302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011293138,0.0011084905,0.0018990211,0.0017339241,0.00039942513,0.00083267986,0.0017250091,0.0012610994,0.0016171325],"category_scores_gemma":[0.005350204,0.00066817395,0.0009551069,0.0024495684,0.00048167058,0.003139045,0.0011261072,0.0011420589,0.0014023447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010444926,0.0011132832,0.011481528,0.0004386157,0.00036509155,0.0004209962,0.00055174466,0.2694014,0.020161122,0.0057137324,0.007376871,0.681931],"study_design_scores_gemma":[0.00002591717,0.0001360746,0.0014637351,0.000009497676,0.000058365655,0.00020886339,0.000028067245,0.99078184,0.0024449949,0.0033840665,0.0014393514,0.00001926085],"about_ca_topic_score_codex":0.009859724,"about_ca_topic_score_gemma":0.017290695,"teacher_disagreement_score":0.009859724,"about_ca_system_score_codex":0.00058078323,"about_ca_system_score_gemma":0.0013006602,"threshold_uncertainty_score":0.019604623},"labels":[],"label_agreement":null},{"id":"W4410502462","doi":"10.1145/3736402","title":"Query Performance Prediction Using Relevance Judgments Generated by Large Language Models","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","topic":"Information Retrieval and Search Behavior","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":"HORIZON EUROPE Framework Programme; Ministerie van Economische Zaken en Klimaat; China Scholarship Council; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Ministerie van Onderwijs, Cultuur en Wetenschap; European Commission","keywords":"Relevance (law); Computer science; Interpretability; Recall; Metric (unit); Measure (data warehouse); Precision and recall; Scalar (mathematics); Information retrieval; Data mining; Machine learning; Artificial intelligence; Cognitive psychology; Mathematics; Psychology","score_opus":0.021212261811749022,"score_gpt":0.26395895870168035,"score_spread":0.24274669688993133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410502462","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.101344824,0.0014289097,0.88083434,0.0006757977,0.00015192186,0.00040607768,0.0016136011,0.010546338,0.0029982727],"genre_scores_gemma":[0.73060715,0.0004598366,0.25957638,0.00039593913,0.0002792382,0.00051173364,0.004713565,0.0009437276,0.0025124273],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994769,0.001995681,0.00035872657,0.0012446379,0.0013301725,0.00030178364],"domain_scores_gemma":[0.9765114,0.015449335,0.0017067933,0.0020538908,0.003834331,0.00044428292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00570071,0.0021139123,0.0014647731,0.002863818,0.00055302895,0.0026083903,0.0019492034,0.0015780275,0.0016719445],"category_scores_gemma":[0.04108148,0.0007414091,0.0013882291,0.0015635332,0.00089295494,0.0037178264,0.0016701443,0.0029092666,0.0020174917],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014320603,0.00066309236,0.027570393,0.0011355166,0.00038504382,0.00054479763,0.00081507134,0.46694556,0.049418394,0.009189326,0.018337697,0.4235631],"study_design_scores_gemma":[0.000026183909,0.00009169131,0.0016143844,0.000017574317,0.000026370657,0.00004316816,0.000035127407,0.98858726,0.0047387853,0.0040454967,0.00073908904,0.0000348881],"about_ca_topic_score_codex":0.0077054845,"about_ca_topic_score_gemma":0.009770912,"teacher_disagreement_score":0.0077054845,"about_ca_system_score_codex":0.0015817943,"about_ca_system_score_gemma":0.0017889012,"threshold_uncertainty_score":0.030148566},"labels":[],"label_agreement":null},{"id":"W4411644201","doi":"10.1145/3742423","title":"Utilizing Large Language Model for Conversational Information Seeking via Dual-Query Generation and Joint-Encoding","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","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; Western University","funders":"","keywords":"Computer science; Encoding (memory); Joint (building); Dual (grammatical number); Natural language processing; Language model; Artificial intelligence; Linguistics; Engineering","score_opus":0.033160082311940495,"score_gpt":0.2612312934812345,"score_spread":0.22807121116929402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411644201","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022536172,0.00061995455,0.96868616,0.00063985796,0.00007668478,0.00029902032,0.00052271,0.0044494644,0.0021698738],"genre_scores_gemma":[0.44851735,0.00046221874,0.54139316,0.00058362115,0.00013252693,0.00052114663,0.00253908,0.00061922765,0.0052316664],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969284,0.0013591577,0.00020208841,0.0005921909,0.00071879936,0.00019948235],"domain_scores_gemma":[0.9964994,0.001868005,0.00015849016,0.0007460819,0.0005900986,0.00013791285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026153713,0.0012055953,0.0010342081,0.0012400481,0.0007444914,0.0015071844,0.0019417503,0.001261536,0.0027899768],"category_scores_gemma":[0.009566088,0.0004763349,0.0015320698,0.0011541685,0.0009107739,0.0042846305,0.002432634,0.0019918724,0.0016801778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010681177,0.0007171085,0.004687105,0.0009368248,0.00022846904,0.00095075765,0.0031207516,0.14106418,0.06954293,0.0662528,0.02683374,0.6845972],"study_design_scores_gemma":[0.000058723675,0.00013138117,0.00025567733,0.000015512574,0.00006891129,0.00025763692,0.00029938325,0.9576972,0.011722473,0.022756673,0.006676468,0.000059968188],"about_ca_topic_score_codex":0.0067344657,"about_ca_topic_score_gemma":0.008161385,"teacher_disagreement_score":0.0067344657,"about_ca_system_score_codex":0.0012357198,"about_ca_system_score_gemma":0.001920524,"threshold_uncertainty_score":0.013831615},"labels":[],"label_agreement":null},{"id":"W4413243547","doi":"10.1145/3759453","title":"A Survey of Conversational Search","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","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":"Université de Montréal","funders":"","keywords":"Computer science; Semantic search; Context (archaeology); Unison; Search engine; Natural language; Data science; Human–computer interaction; World Wide Web; Information retrieval; Artificial intelligence","score_opus":0.0433947417254156,"score_gpt":0.28226504420324516,"score_spread":0.23887030247782956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413243547","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0206901,0.7653645,0.08779073,0.0059234677,0.0009176594,0.00055451354,0.001759994,0.0013398129,0.11565909],"genre_scores_gemma":[0.18475333,0.67945313,0.086832926,0.0033062773,0.0022914642,0.00069946214,0.005853734,0.00062883284,0.036180828],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99790204,0.000663822,0.00023173254,0.00029810262,0.0006846209,0.00021970776],"domain_scores_gemma":[0.9942082,0.0039460347,0.0002546532,0.00033106055,0.0010506223,0.00020937195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021095362,0.000976689,0.0011194913,0.006117749,0.0014621873,0.0037851357,0.0018902041,0.0016361916,0.012535036],"category_scores_gemma":[0.009987826,0.0006061095,0.00083624007,0.008871275,0.0007391242,0.009207413,0.0020624294,0.0010933601,0.004308348],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020243379,0.00013488097,0.0042151874,0.006518687,0.0000886029,0.00022698205,0.0017491196,0.002355804,0.00131571,0.04448105,0.03982554,0.89888597],"study_design_scores_gemma":[0.000026369813,0.00017058568,0.005071667,0.0026122867,0.00016104663,0.002033196,0.0022946245,0.016022079,0.0017797607,0.02814687,0.9415833,0.00009812134],"about_ca_topic_score_codex":0.008032735,"about_ca_topic_score_gemma":0.005784577,"teacher_disagreement_score":0.012535036,"about_ca_system_score_codex":0.0019053274,"about_ca_system_score_gemma":0.0033606181,"threshold_uncertainty_score":0.041933894},"labels":[],"label_agreement":null},{"id":"W4413418666","doi":"10.1145/3748719","title":"SparseFraudNet: A Graph-based Approach for Cold-start Fraud Detection with Information Aggregation","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","topic":"Spam and Phishing Detection","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","funders":"National Natural Science Foundation of China","keywords":"Computer science; Spectral clustering; Leverage (statistics); Graph; Cluster analysis; Adjacency matrix; Purchasing; Data mining; Machine learning; Artificial intelligence; Theoretical computer science","score_opus":0.0131978670232608,"score_gpt":0.21174336607158148,"score_spread":0.19854549904832067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413418666","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0751499,0.003090016,0.90480584,0.0014002129,0.0003737654,0.0007095433,0.001762623,0.0076385518,0.0050694724],"genre_scores_gemma":[0.5691036,0.0010514734,0.41544744,0.0010549588,0.00042815506,0.00039469003,0.005179636,0.00038007498,0.006959993],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980488,0.0005991034,0.00011643326,0.0005744972,0.000509206,0.00015193409],"domain_scores_gemma":[0.9965636,0.0014483694,0.0004846699,0.0004435547,0.00089092593,0.00016889762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018872533,0.002089476,0.0025837854,0.0055180225,0.0012414763,0.0016044964,0.0030640024,0.002327737,0.0012407498],"category_scores_gemma":[0.00676069,0.00075741345,0.0012108727,0.0027952339,0.00095295097,0.0026220307,0.0016433679,0.0016365016,0.0008276685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006449921,0.0008584345,0.0139652435,0.00069469534,0.00050863565,0.00080612005,0.0005937436,0.27512848,0.008162376,0.013195347,0.039854925,0.6455869],"study_design_scores_gemma":[0.000018912366,0.00006928704,0.00083423266,0.00002096041,0.00003383637,0.00012595582,0.00004617268,0.98827213,0.0014178095,0.0059951902,0.0031482487,0.000017352413],"about_ca_topic_score_codex":0.014213937,"about_ca_topic_score_gemma":0.020444069,"teacher_disagreement_score":0.014213937,"about_ca_system_score_codex":0.0016905313,"about_ca_system_score_gemma":0.0015269666,"threshold_uncertainty_score":0.028262436},"labels":[],"label_agreement":null}]}