{"meta":{"query_hash":"00d632f4daa4","filters":{"venue":"Proceedings of the 31st ACM International Conference on Information & Knowledge Management"},"cohort_total":13,"direct_labels_cover":0,"predictions_cover":13,"exported":13,"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/00d632f4daa4","api":"https://metacan.xera.ac/api/v1/cohort?venue=Proceedings+of+the+31st+ACM+International+Conference+on+Information+%26amp%3B+Knowledge+Management"},"results":[{"id":"W4296559601","doi":"10.1145/3511808.3557229","title":"Adapting Triplet Importance of Implicit Feedback for Personalized Recommendation","year":2022,"lang":"en","type":"article","venue":"Proceedings of the 31st ACM International Conference on Information & Knowledge Management","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada); McGill University","funders":"","keywords":"Computer science; Pairwise comparison; Matrix decomposition; Recommender system; Machine learning; Graph; Precision and recall; Ranking (information retrieval); Information retrieval; Artificial intelligence; Theoretical computer science","score_opus":0.0763719245103032,"score_gpt":0.3153775664848288,"score_spread":0.2390056419745256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296559601","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033505958,0.0005708359,0.9629175,0.00015743956,0.00009532622,0.00011066782,0.00013047516,0.0010963808,0.0014153975],"genre_scores_gemma":[0.7882604,0.00038360283,0.2066058,0.00031329764,0.0002032251,0.00021892358,0.0006570317,0.00014046818,0.0032171875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984969,0.00043513623,0.000082497325,0.00038296173,0.00044278937,0.00015969633],"domain_scores_gemma":[0.99590707,0.0021903233,0.0002914734,0.0005436313,0.0008874178,0.00018008177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022888537,0.0012297303,0.0022134106,0.0011991675,0.0004826493,0.00073633273,0.0022522404,0.0016149046,0.002278476],"category_scores_gemma":[0.010536903,0.0007069501,0.0009569834,0.0014878836,0.0007311051,0.0028076556,0.0010940409,0.0021566327,0.0008396771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000626745,0.00069821713,0.0060668867,0.000303296,0.00015054637,0.0001553273,0.00024804112,0.48426792,0.009180482,0.009174073,0.0065763984,0.4825521],"study_design_scores_gemma":[0.000018303439,0.00006736417,0.00030268854,0.000007791412,0.000013029843,0.000025025924,0.0000062995946,0.99607193,0.0006788293,0.0024779083,0.00032155705,0.000009297979],"about_ca_topic_score_codex":0.00854905,"about_ca_topic_score_gemma":0.013776181,"teacher_disagreement_score":0.00854905,"about_ca_system_score_codex":0.001075888,"about_ca_system_score_gemma":0.0011824403,"threshold_uncertainty_score":0.016998589},"labels":[],"label_agreement":null},{"id":"W4306316908","doi":"10.1145/3511808.3557117","title":"BLUTune: Query-informed Multi-stage IBM Db2 Tuning via ML","year":2022,"lang":"en","type":"article","venue":"Proceedings of the 31st ACM International Conference on Information & Knowledge Management","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); Ontario Tech University; York University","funders":"","keywords":"Computer science; IBM; Reinforcement learning; Embedding; Process (computing); Artificial intelligence; Resource (disambiguation); Machine learning; Operating system","score_opus":0.07434386009228877,"score_gpt":0.3228954959479354,"score_spread":0.2485516358556466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4306316908","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20767008,0.0009730284,0.7293915,0.00065242854,0.00017474827,0.00022136055,0.0005233042,0.05270953,0.0076840534],"genre_scores_gemma":[0.8939593,0.000081317696,0.10201502,0.00032359507,0.000029978224,0.00012106737,0.0005418322,0.00075764663,0.0021703306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992061,0.00018257585,0.00003312189,0.00024449505,0.00021972711,0.00011389653],"domain_scores_gemma":[0.99880624,0.0005889706,0.00008059211,0.0002446467,0.0001837895,0.00009574666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013758995,0.0010906912,0.000801422,0.00036358647,0.0003840059,0.0009085905,0.002222434,0.00079207215,0.0026555413],"category_scores_gemma":[0.0043498576,0.0005449298,0.00035588245,0.00040819874,0.00065895927,0.0015215056,0.0012008745,0.0017697983,0.00075782393],"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.00061171904,0.00046517717,0.0039536157,0.00008537928,0.000099055775,0.00011859121,0.00011452774,0.79269123,0.016904455,0.002523329,0.009508924,0.17292391],"study_design_scores_gemma":[0.000021151787,0.000029669189,0.00013478177,0.000001323286,0.0000026571192,0.000006756657,0.0000063688535,0.9973117,0.001533792,0.00060185604,0.00034543365,0.000004492396],"about_ca_topic_score_codex":0.010806963,"about_ca_topic_score_gemma":0.011009999,"teacher_disagreement_score":0.010806963,"about_ca_system_score_codex":0.0010042016,"about_ca_system_score_gemma":0.0014765749,"threshold_uncertainty_score":0.02148813},"labels":[],"label_agreement":null},{"id":"W4306317001","doi":"10.1145/3511808.3557529","title":"SEERa: A Framework for Community Prediction","year":2022,"lang":"en","type":"article","venue":"Proceedings of the 31st ACM International Conference on Information & Knowledge Management","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science","score_opus":0.05973768506499032,"score_gpt":0.32152476974497834,"score_spread":0.261787084679988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4306317001","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004770315,0.0006040045,0.9873296,0.00034992534,0.000083594015,0.0001536676,0.0017182266,0.0037845029,0.001206132],"genre_scores_gemma":[0.20962511,0.0010142684,0.7728392,0.00051818334,0.00032678735,0.0007688719,0.00817012,0.00074919953,0.0059883143],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983968,0.0005014189,0.000066121196,0.000527131,0.0003460046,0.00016245004],"domain_scores_gemma":[0.9967836,0.0016491816,0.00028552426,0.00046606403,0.0005487179,0.0002668164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022933816,0.0015730349,0.0014209517,0.0038297446,0.0015024993,0.0018147029,0.0034069149,0.0021546858,0.004220058],"category_scores_gemma":[0.00974695,0.0008848706,0.0019825217,0.0029569734,0.0009852923,0.0041188896,0.003048322,0.0032576693,0.0026767168],"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.00046308208,0.00045073562,0.01126992,0.00057546835,0.00047258675,0.0005173676,0.000745487,0.48772395,0.004782562,0.110945225,0.054061603,0.32799196],"study_design_scores_gemma":[0.000013125172,0.000020046582,0.00032038,0.000020467773,0.000013755652,0.000050801627,0.000035692923,0.95210296,0.00033872563,0.043827377,0.0032434254,0.00001322795],"about_ca_topic_score_codex":0.019954585,"about_ca_topic_score_gemma":0.035168614,"teacher_disagreement_score":0.019954585,"about_ca_system_score_codex":0.001514141,"about_ca_system_score_gemma":0.0018331611,"threshold_uncertainty_score":0.039676905},"labels":[],"label_agreement":null},{"id":"W4306317066","doi":"10.1145/3511808.3557526","title":"OpeNTF: A Benchmark Library for Neural Team Formation","year":2022,"lang":"en","type":"article","venue":"Proceedings of the 31st ACM International Conference on Information & Knowledge Management","topic":"Expert finding and Q&A systems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Benchmark (surveying); Computer science; Artificial intelligence; Computer architecture; Geology","score_opus":0.04937004160800148,"score_gpt":0.28399999509923,"score_spread":0.23462995349122853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4306317066","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085776195,0.0041746413,0.46047276,0.0025749665,0.0020826212,0.0014038789,0.1473104,0.20658201,0.08962256],"genre_scores_gemma":[0.23919417,0.0017943602,0.42203385,0.0012978478,0.00023229705,0.0034221823,0.29483056,0.019358829,0.017835906],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979159,0.0005112986,0.00021181394,0.00040684897,0.0006286592,0.00032531284],"domain_scores_gemma":[0.99529773,0.0019465612,0.00031055225,0.0010579933,0.0009992078,0.00038794533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028311305,0.0021463404,0.0010003047,0.0023090006,0.0012008934,0.0023360325,0.005635289,0.0025730052,0.019234577],"category_scores_gemma":[0.017337782,0.0008948909,0.001604507,0.0028454713,0.00082612847,0.0029246109,0.0024765132,0.002353047,0.011455074],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065187237,0.0007335023,0.007210785,0.0027801832,0.00037186075,0.00039520022,0.0002290959,0.33282802,0.002611424,0.024269404,0.47576421,0.15215443],"study_design_scores_gemma":[0.0003181946,0.00019542642,0.0025496276,0.00025070956,0.0000628004,0.0002213876,0.00013385936,0.8574341,0.006526909,0.044624623,0.08761443,0.00006789229],"about_ca_topic_score_codex":0.014191271,"about_ca_topic_score_gemma":0.01825424,"teacher_disagreement_score":0.019234577,"about_ca_system_score_codex":0.0019516384,"about_ca_system_score_gemma":0.0038033414,"threshold_uncertainty_score":0.064346015},"labels":[],"label_agreement":null},{"id":"W4306317280","doi":"10.1145/3511808.3557673","title":"Probing the Robustness of Pre-trained Language Models for Entity Matching","year":2022,"lang":"en","type":"article","venue":"Proceedings of the 31st ACM International Conference on Information & Knowledge Management","topic":"Data Quality and Management","field":"Decision Sciences","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 Alberta","funders":"","keywords":"Robustness (evolution); Computer science; Spurious relationship; Machine learning; Software deployment; Artificial intelligence; Training set; Data modeling; Data mining; Database; Software engineering","score_opus":0.15254733957015623,"score_gpt":0.3846648573911663,"score_spread":0.23211751782101006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4306317280","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41967475,0.0033566107,0.561591,0.0028925985,0.00044620666,0.00029848333,0.0015921601,0.005446408,0.0047018155],"genre_scores_gemma":[0.9158394,0.00054127915,0.077345036,0.00073882594,0.00014998755,0.00016881785,0.0031043796,0.0003184832,0.0017937187],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9945226,0.0030375163,0.00034812657,0.0012880863,0.00043560044,0.00036816392],"domain_scores_gemma":[0.9729321,0.020540765,0.00082783407,0.00400708,0.0013593073,0.00033279296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014512142,0.001844272,0.0013421068,0.0014121595,0.0007871662,0.0020516152,0.0033867592,0.002768425,0.0016314144],"category_scores_gemma":[0.056601558,0.0009723156,0.0013802744,0.0012049995,0.0014272722,0.005574816,0.0028732328,0.004939722,0.0014562169],"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.00058122666,0.00025351808,0.008761658,0.00021393932,0.00039990424,0.00014354389,0.00020106636,0.8857884,0.00315513,0.0034775278,0.00369897,0.09332519],"study_design_scores_gemma":[0.000014514611,0.000054884873,0.00055414345,0.000017437711,0.000023300168,0.00003685615,0.000038165857,0.99412316,0.002288756,0.002405498,0.00043033276,0.000013030036],"about_ca_topic_score_codex":0.011774336,"about_ca_topic_score_gemma":0.0101235425,"teacher_disagreement_score":0.014512142,"about_ca_system_score_codex":0.0018861423,"about_ca_system_score_gemma":0.0015940367,"threshold_uncertainty_score":0.07674843},"labels":[],"label_agreement":null},{"id":"W4306317318","doi":"10.1145/3511808.3557688","title":"Sampling Enclosing Subgraphs for Link Prediction","year":2022,"lang":"en","type":"article","venue":"Proceedings of the 31st ACM International Conference on Information & Knowledge Management","topic":"Advanced Graph Neural Networks","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":"Ontario Tech University","funders":"","keywords":"Scalability; Computer science; Overhead (engineering); Link (geometry); Graph; Theoretical computer science; Representation (politics); Induced subgraph isomorphism problem; Line graph; Computer network","score_opus":0.06510801511284907,"score_gpt":0.30575703596044224,"score_spread":0.24064902084759315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4306317318","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11620029,0.0008496318,0.87062275,0.00043864138,0.000061828534,0.000121397876,0.0021721935,0.0069274595,0.002605833],"genre_scores_gemma":[0.78270113,0.00051978196,0.20570415,0.00024610525,0.00008552866,0.00015170754,0.007692682,0.00040112276,0.0024978162],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.999448,0.00012297943,0.000020087447,0.00021654509,0.0001351853,0.000057077363],"domain_scores_gemma":[0.998453,0.00072021864,0.00018667648,0.00041768613,0.0001548664,0.00006762702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045616785,0.0010015387,0.0008633368,0.0017576889,0.0005148491,0.0005755079,0.00117548,0.00094889605,0.0019504367],"category_scores_gemma":[0.004183988,0.00040362045,0.00073048944,0.0021092591,0.0005624903,0.0021684358,0.0009992217,0.001064768,0.00093111733],"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.00027202707,0.00018700924,0.011945368,0.00022506104,0.00013924809,0.00032408405,0.00020594377,0.64107394,0.011279049,0.013670139,0.016578186,0.3041],"study_design_scores_gemma":[0.000008793172,0.000024175655,0.00076197326,0.0000098230375,0.00001558769,0.000054415978,0.000033880613,0.9795084,0.0021575103,0.01591856,0.0014998486,0.0000069942334],"about_ca_topic_score_codex":0.0073377574,"about_ca_topic_score_gemma":0.014116674,"teacher_disagreement_score":0.0073377574,"about_ca_system_score_codex":0.00058042654,"about_ca_system_score_gemma":0.0006826707,"threshold_uncertainty_score":0.014590085},"labels":[],"label_agreement":null},{"id":"W4306317362","doi":"10.1145/3511808.3557590","title":"Effective Neural Team Formation via Negative Samples","year":2022,"lang":"en","type":"article","venue":"Proceedings of the 31st ACM International Conference on Information & Knowledge Management","topic":"Innovative Teaching and Learning Methods","field":"Psychology","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 Windsor","funders":"","keywords":"Computer science; Artificial neural network; Artificial intelligence","score_opus":0.07437080274635709,"score_gpt":0.3672565965355531,"score_spread":0.292885793789196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4306317362","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34160975,0.0009851186,0.64745456,0.0020380598,0.00022159681,0.00024229,0.00037128376,0.0018161089,0.0052612755],"genre_scores_gemma":[0.9373009,0.00014828023,0.058074486,0.0005092088,0.00010809583,0.00023029499,0.0007406217,0.00009817694,0.0027900343],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985858,0.00057955587,0.00006789866,0.00039465516,0.00018133716,0.0001908891],"domain_scores_gemma":[0.99336857,0.0039951988,0.0007206386,0.0006667243,0.0008026078,0.0004461374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040283264,0.001619322,0.0016572129,0.00081176375,0.0010526548,0.0014884645,0.0034651174,0.0021994684,0.0017549511],"category_scores_gemma":[0.017110225,0.00094807235,0.0008642042,0.0005662331,0.0016459038,0.0030800414,0.0022357246,0.0025802955,0.0005678567],"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.00040103297,0.0002662345,0.008215779,0.000103269376,0.000075652264,0.00010900951,0.00020593581,0.89676327,0.0011826954,0.0050731613,0.0044763386,0.08312761],"study_design_scores_gemma":[0.000013957134,0.000031030322,0.00019525993,0.000008534046,0.000006384699,0.000008580514,0.000018182021,0.9964462,0.00032113842,0.0028115339,0.00013595275,0.0000033290594],"about_ca_topic_score_codex":0.0074242745,"about_ca_topic_score_gemma":0.010276063,"teacher_disagreement_score":0.0074242745,"about_ca_system_score_codex":0.001626347,"about_ca_system_score_gemma":0.0015579818,"threshold_uncertainty_score":0.021304071},"labels":[],"label_agreement":null},{"id":"W4306317391","doi":"10.1145/3511808.3557572","title":"CS-MLGCN: Multiplex Graph Convolutional Networks for Community Search in Multiplex Networks","year":2022,"lang":"en","type":"article","venue":"Proceedings of the 31st ACM International Conference on Information & Knowledge Management","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Graph; Embedding; Theoretical computer science; Data mining; Artificial intelligence","score_opus":0.06545522068589847,"score_gpt":0.3190323919863216,"score_spread":0.2535771713004231,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4306317391","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09809609,0.0011652027,0.891893,0.0010250906,0.00008884199,0.00012859986,0.0012510372,0.002780544,0.003571556],"genre_scores_gemma":[0.8112962,0.0006737298,0.17802092,0.0006752643,0.00008278925,0.00020431433,0.0024212226,0.00019231334,0.006433231],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997161,0.000053276497,0.0000120334125,0.00010141274,0.00006026227,0.000056813227],"domain_scores_gemma":[0.99934596,0.0002518407,0.00009269979,0.000098089746,0.00013953041,0.00007192034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073044345,0.0009360108,0.0006737319,0.0012600488,0.0006594798,0.00083960674,0.001980659,0.0013487398,0.0018958524],"category_scores_gemma":[0.003313632,0.0004333728,0.00060345826,0.0013376927,0.0008114958,0.0023052765,0.0012906773,0.001402328,0.00040112375],"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.00026585898,0.0001998924,0.0042289803,0.00017516855,0.00013183396,0.00015770305,0.00017617778,0.763694,0.008742564,0.033399243,0.010133789,0.17869477],"study_design_scores_gemma":[0.000004173576,0.0000076176466,0.00015258834,0.0000038089154,0.00000561008,0.000011700141,0.000006169081,0.99353856,0.0005251521,0.005387734,0.00035330118,0.000003546354],"about_ca_topic_score_codex":0.03441153,"about_ca_topic_score_gemma":0.052918278,"teacher_disagreement_score":0.03441153,"about_ca_system_score_codex":0.0028227565,"about_ca_system_score_gemma":0.0013947517,"threshold_uncertainty_score":0.06842244},"labels":[],"label_agreement":null},{"id":"W4306317442","doi":"10.1145/3511808.3557181","title":"PyDHNet: A Python Library for Dynamic Heterogeneous Network Representation Learning and Evaluation","year":2022,"lang":"en","type":"article","venue":"Proceedings of the 31st ACM International Conference on Information & Knowledge Management","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Python (programming language); Computer science; Representation (politics); Architecture; Software engineering; Theoretical computer science; Artificial intelligence; Programming language","score_opus":0.042516795527662604,"score_gpt":0.318841784027764,"score_spread":0.27632498850010134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4306317442","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008284614,0.0003058205,0.7214891,0.0005803962,0.00029598142,0.00042154008,0.010861843,0.2475587,0.0102020735],"genre_scores_gemma":[0.19078931,0.0008814103,0.71307015,0.0012594262,0.00016441318,0.0021606586,0.035486497,0.04204114,0.014146926],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99899226,0.0002415246,0.00008602082,0.0002058622,0.0003608924,0.00011347603],"domain_scores_gemma":[0.9985275,0.00057935325,0.00013976732,0.00030623985,0.00030372458,0.0001433759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020247735,0.0016119429,0.0008670511,0.0014933634,0.00061937334,0.0016435737,0.0037855778,0.00096682296,0.025866153],"category_scores_gemma":[0.007976426,0.0008151372,0.00120587,0.0011342625,0.00087980443,0.0032873673,0.002482023,0.0027798463,0.009166335],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075161824,0.00038873992,0.005348346,0.0016283016,0.00043174543,0.0007103621,0.00032085332,0.21968746,0.01065501,0.038745526,0.3740179,0.34731412],"study_design_scores_gemma":[0.000109405344,0.00006445006,0.00094278686,0.0000735981,0.000029954888,0.00018088572,0.000037339698,0.9175538,0.009507319,0.03109965,0.04033906,0.00006182398],"about_ca_topic_score_codex":0.0075851274,"about_ca_topic_score_gemma":0.010369482,"teacher_disagreement_score":0.025866153,"about_ca_system_score_codex":0.0013133611,"about_ca_system_score_gemma":0.0029861704,"threshold_uncertainty_score":0.086530924},"labels":[],"label_agreement":null},{"id":"W4306317452","doi":"10.1145/3511808.3557209","title":"Named Entity-based Question-Answering Pair Generator","year":2022,"lang":"en","type":"article","venue":"Proceedings of the 31st ACM International Conference on Information & Knowledge Management","topic":"Topic Modeling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Pipeline (software); Paragraph; Question answering; Generator (circuit theory); Task (project management); Context (archaeology); Abstraction; Simple (philosophy); Text generation; Natural language processing; Argument (complex analysis); Artificial intelligence; Programming language; Engineering; World Wide Web","score_opus":0.045095399802941936,"score_gpt":0.2833785768154452,"score_spread":0.23828317701250326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4306317452","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046177506,0.00009459643,0.97003525,0.0002953246,0.00012809885,0.00058557256,0.0014460478,0.020701405,0.002095946],"genre_scores_gemma":[0.13940625,0.000109010194,0.8399238,0.0004254933,0.00011928515,0.001443091,0.009396971,0.0029019401,0.006274046],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.995666,0.002139225,0.00027462232,0.000994851,0.00071974756,0.0002054646],"domain_scores_gemma":[0.99091303,0.005523609,0.0002582547,0.0016095327,0.0014509341,0.00024467692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056491415,0.0018355218,0.0010365221,0.0019780037,0.0007890068,0.001408177,0.0031809756,0.0021718463,0.023262452],"category_scores_gemma":[0.017096499,0.00085079466,0.0016947848,0.0011835333,0.000887506,0.0035988207,0.0040639704,0.0018607005,0.009585091],"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.0021884697,0.0007497321,0.005234408,0.0019978895,0.0002931121,0.0024628022,0.003276229,0.036230434,0.070249565,0.12178329,0.11549504,0.6400391],"study_design_scores_gemma":[0.00044060487,0.00051807234,0.0013973179,0.00010769587,0.00017569629,0.0013040059,0.0006870131,0.6634192,0.10417069,0.121833384,0.10577483,0.00017149589],"about_ca_topic_score_codex":0.0010719105,"about_ca_topic_score_gemma":0.0009091084,"teacher_disagreement_score":0.023262452,"about_ca_system_score_codex":0.0008689616,"about_ca_system_score_gemma":0.0010886509,"threshold_uncertainty_score":0.0778206},"labels":[],"label_agreement":null},{"id":"W4306317496","doi":"10.1145/3511808.3557436","title":"Risk-Aware Bid Optimization for Online Display Advertisement","year":2022,"lang":"en","type":"article","venue":"Proceedings of the 31st ACM International Conference on Information & Knowledge Management","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Mitacs","keywords":"Bidding; Real-time bidding; Profit (economics); Budget constraint; Display advertising; Computer science; Common value auction; Lagrangian relaxation; Online advertising; Operations research; Mathematical optimization; Microeconomics; The Internet; Economics; Engineering; Mathematics","score_opus":0.1311048228999324,"score_gpt":0.41385315945114975,"score_spread":0.28274833655121734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4306317496","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036670856,0.0008914362,0.95688665,0.00061776495,0.00007237472,0.00013112984,0.00022881557,0.0003496502,0.004151324],"genre_scores_gemma":[0.8163956,0.00059902895,0.17571668,0.00029651186,0.00010396981,0.00023057387,0.00045577047,0.00021630687,0.00598557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99842656,0.0008083248,0.000060035265,0.00025939647,0.00027447054,0.00017125501],"domain_scores_gemma":[0.9966445,0.0024144764,0.00026467053,0.00021443445,0.0002608464,0.00020100384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038766004,0.0010985228,0.0019599502,0.00060385437,0.00046282832,0.0020638215,0.0018470206,0.0013812424,0.0034432528],"category_scores_gemma":[0.007387777,0.0009765956,0.0010429805,0.00090095005,0.00094479055,0.0026702236,0.0010980049,0.0022652089,0.00059134496],"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.00018007493,0.00016976077,0.00085537013,0.000105944724,0.00005681812,0.000082071296,0.000107541906,0.9408894,0.0009948841,0.024837494,0.0030137212,0.028706895],"study_design_scores_gemma":[0.000010958707,0.000020373176,0.00010355741,0.0000044105063,0.0000054841557,0.000012204121,0.0000108760505,0.99097264,0.000118339034,0.008386879,0.0003489504,0.000005436431],"about_ca_topic_score_codex":0.00440542,"about_ca_topic_score_gemma":0.004041007,"teacher_disagreement_score":0.00440542,"about_ca_system_score_codex":0.0017643899,"about_ca_system_score_gemma":0.0019684387,"threshold_uncertainty_score":0.020501673},"labels":[],"label_agreement":null},{"id":"W4306317500","doi":"10.1145/3511808.3557588","title":"Early Stage Sparse Retrieval with Entity Linking","year":2022,"lang":"en","type":"article","venue":"Proceedings of the 31st ACM International Conference on Information & Knowledge Management","topic":"Topic Modeling","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Information retrieval; Question answering; Boosting (machine learning); Artificial intelligence; Task (project management); Ranking (information retrieval); Natural language processing","score_opus":0.05496141773196674,"score_gpt":0.27540141818841524,"score_spread":0.2204400004564485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4306317500","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06778096,0.0012324497,0.8983613,0.00030962395,0.00012697153,0.0006124886,0.0014136137,0.024679366,0.005483081],"genre_scores_gemma":[0.33934486,0.0007476377,0.63275987,0.00051758345,0.00020750758,0.00029703867,0.008613119,0.0008165161,0.01669584],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998723,0.00024135705,0.00012339182,0.00030316267,0.00046066788,0.00014850643],"domain_scores_gemma":[0.99732876,0.00067173876,0.00016228382,0.0013076103,0.00045381952,0.000075827185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017151574,0.0012337473,0.0016003005,0.002927542,0.0007057323,0.0017922898,0.0023460882,0.0013689675,0.006752098],"category_scores_gemma":[0.005650797,0.00052819814,0.0011263834,0.0035131073,0.0007875248,0.006290796,0.0032371846,0.0011957581,0.006641953],"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.00070087705,0.0007517256,0.0035675678,0.0006168268,0.00020132217,0.00042793175,0.000474772,0.048112407,0.056503113,0.00998266,0.028508076,0.8501527],"study_design_scores_gemma":[0.00022775614,0.000895071,0.002937778,0.000056583547,0.0002338926,0.0013181872,0.0003458598,0.837341,0.09633876,0.028525645,0.031638116,0.0001413078],"about_ca_topic_score_codex":0.0043069515,"about_ca_topic_score_gemma":0.008328473,"teacher_disagreement_score":0.006752098,"about_ca_system_score_codex":0.0005510416,"about_ca_system_score_gemma":0.001233929,"threshold_uncertainty_score":0.022588015},"labels":[],"label_agreement":null},{"id":"W4306317650","doi":"10.1145/3511808.3557719","title":"Unsupervised Question Clarity Prediction through Retrieved Item Coherency","year":2022,"lang":"en","type":"article","venue":"Proceedings of the 31st ACM International Conference on Information & Knowledge Management","topic":"Topic Modeling","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Ambiguity; Computer science; CLARITY; Generalization; Context (archaeology); Artificial intelligence; Ask price; Graph; Machine learning; Similarity (geometry); Open domain; Information retrieval; Question answering; Natural language processing; Theoretical computer science; Mathematics","score_opus":0.06448416126311513,"score_gpt":0.29336109989716924,"score_spread":0.22887693863405412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4306317650","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.7192603,0.0058351317,0.250825,0.0010498957,0.00013567734,0.0005234069,0.0075628245,0.007918127,0.006889749],"genre_scores_gemma":[0.91354585,0.0004828729,0.06912764,0.00017207736,0.0001128879,0.00017329487,0.013817697,0.00015105984,0.0024166715],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983342,0.0005522562,0.00013204201,0.00054985663,0.0002954112,0.00013633251],"domain_scores_gemma":[0.9933555,0.0040762653,0.0005236068,0.00051145715,0.0012908246,0.00024232373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021226802,0.0009489417,0.00089187466,0.004417122,0.0005379682,0.001197417,0.0013580763,0.0013820304,0.0012075589],"category_scores_gemma":[0.0108595835,0.0002915529,0.0008947094,0.0021388433,0.0005223381,0.0029869117,0.001369463,0.0012718872,0.0010894368],"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.0023712816,0.0011414626,0.13933122,0.0016809942,0.000816518,0.00064649637,0.003351554,0.06821698,0.06273989,0.0047639366,0.028249357,0.6866903],"study_design_scores_gemma":[0.0000766503,0.00031228602,0.047783416,0.00006496491,0.00027458038,0.00032834426,0.0008324197,0.9149299,0.018114436,0.008543884,0.008664644,0.00007442768],"about_ca_topic_score_codex":0.008384282,"about_ca_topic_score_gemma":0.016468152,"teacher_disagreement_score":0.008384282,"about_ca_system_score_codex":0.00072848937,"about_ca_system_score_gemma":0.0009421289,"threshold_uncertainty_score":0.016670942},"labels":[],"label_agreement":null}]}