{"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017641855,0.00003546052,0.266321,0.018201709,0.0029342214,0.003652956,0.00021715196,0.00032497031,0.69067067],"genre_scores_gemma":[0.95713687,0.000031625386,0.038218383,0.00041352827,0.000056889123,0.0008279202,0.00009026201,0.000011762112,0.0032127877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983463,0.000018764773,0.0007831377,0.00021481643,0.0004637899,0.00017316018],"domain_scores_gemma":[0.9976667,0.000060944392,0.001142784,0.00028528337,0.0008120347,0.000032215696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010795703,0.00016051818,0.00021191717,0.00033359582,0.00023137032,0.00016348671,0.002343407,0.000032584117,0.00015529364],"category_scores_gemma":[0.0001422377,0.0001388063,0.00015304347,0.0003594949,0.000032719476,0.0010111858,0.0014319444,0.00014147014,0.000009986852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063852225,0.00008521386,0.00057933485,0.00020237123,0.000083864375,1.0787097e-8,0.0018623482,0.000012161262,0.000254074,0.9510192,0.022812165,0.023025392],"study_design_scores_gemma":[0.0019937886,0.00022127488,0.0013863376,0.0002560453,0.00003247483,0.000010302,0.0037444308,0.020950716,0.0019744737,0.0470829,0.92192906,0.00041820467],"about_ca_topic_score_codex":0.000009234143,"about_ca_topic_score_gemma":0.000004635418,"teacher_disagreement_score":0.93949497,"about_ca_system_score_codex":0.00023584996,"about_ca_system_score_gemma":0.000037821428,"threshold_uncertainty_score":0.5660357},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029300808,0.000016876682,0.5626501,0.0026340408,0.0013194219,0.0008168053,0.00002301871,0.00058608147,0.4290236],"genre_scores_gemma":[0.8427862,0.00007016472,0.13571654,0.00086498825,0.000059554117,0.00032023314,0.000074961594,0.000017749937,0.020089587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978054,0.00002533265,0.00073697057,0.00027946124,0.0008705893,0.0002822284],"domain_scores_gemma":[0.99774927,0.000049783906,0.0007955469,0.0004792196,0.0008557986,0.0000703853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076630845,0.0002463619,0.00019862468,0.0006313839,0.000505707,0.00043589793,0.0043858713,0.00004984965,0.00022003404],"category_scores_gemma":[0.00023357716,0.00021978629,0.00013632064,0.00066811586,0.00006623215,0.001573996,0.0039204103,0.00033834745,0.0001440255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057485755,0.0002446452,0.0005788713,0.00020065729,0.00013179712,2.5970903e-7,0.006570144,0.005313573,0.0001724833,0.94304085,0.02194396,0.0217453],"study_design_scores_gemma":[0.0013450058,0.0001083004,0.0012429481,0.00019881298,0.000022300259,0.000012700247,0.0014261547,0.55470407,0.00092053425,0.0075539737,0.4318624,0.0006028053],"about_ca_topic_score_codex":0.000016268601,"about_ca_topic_score_gemma":0.0000065887257,"teacher_disagreement_score":0.93548685,"about_ca_system_score_codex":0.00037958115,"about_ca_system_score_gemma":0.00008276253,"threshold_uncertainty_score":0.89626247},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06561154,0.000007842567,0.100449316,0.0026495478,0.0011911244,0.0018750896,0.00045722513,0.00021394755,0.82754433],"genre_scores_gemma":[0.9889442,0.0000037538152,0.007905508,0.000117217256,0.00012242615,0.0007792645,0.0002448336,0.0000091662305,0.0018736768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885356,0.000023099183,0.00045559724,0.00011469141,0.0004045917,0.00014844998],"domain_scores_gemma":[0.9984981,0.00007604139,0.0004843037,0.00029088062,0.00062116067,0.00002953791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006172297,0.00014799855,0.00015057262,0.0002433148,0.0005615407,0.00014333162,0.0015162927,0.000023283163,0.00071466976],"category_scores_gemma":[0.00006390405,0.00013339313,0.00016963722,0.00030928012,0.00004475588,0.0004034192,0.0013812337,0.00038699355,0.000028546889],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000631025,0.00018980521,0.0026233182,0.00005817962,0.00020249182,2.2340803e-9,0.0016269124,0.00016712377,0.000031541156,0.96393126,0.021262538,0.009843716],"study_design_scores_gemma":[0.00067369617,0.00010162988,0.002951357,0.00018401856,0.00011225195,6.370142e-7,0.006855366,0.010121207,0.00035477185,0.5679298,0.41044652,0.00026873642],"about_ca_topic_score_codex":0.000019643845,"about_ca_topic_score_gemma":0.00000303959,"teacher_disagreement_score":0.92333263,"about_ca_system_score_codex":0.00017264509,"about_ca_system_score_gemma":0.000020679125,"threshold_uncertainty_score":0.78251326},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018628038,0.00003909175,0.020152831,0.0122312475,0.0047800154,0.0024961182,0.00012659529,0.0003707664,0.9411753],"genre_scores_gemma":[0.9793246,0.000020903013,0.009065026,0.00069280394,0.000108289496,0.00091633515,0.00014700175,0.000012646525,0.009712404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982156,0.000019653251,0.00063419034,0.00022020911,0.0006818369,0.00022851134],"domain_scores_gemma":[0.99853796,0.00005026626,0.0006192281,0.00034930056,0.00038996502,0.000053273587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053536805,0.00018654534,0.00016546056,0.00044145834,0.00045195263,0.0006050112,0.0038212081,0.00003570609,0.00012120898],"category_scores_gemma":[0.00010575185,0.00015507416,0.00014406514,0.0004405468,0.00003311289,0.0036634817,0.0026577723,0.00018114258,0.00008278398],"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.00006540698,0.00010943344,0.00023804304,0.00020618555,0.000055419438,3.782282e-8,0.005013467,0.0001877596,0.00010869922,0.83566344,0.14687903,0.011473054],"study_design_scores_gemma":[0.001093906,0.00014271955,0.0004954783,0.0001773846,0.000015817972,0.000015476746,0.0026991605,0.10395956,0.00079017616,0.0138221,0.87645525,0.00033294898],"about_ca_topic_score_codex":0.0000033813287,"about_ca_topic_score_gemma":0.0000013508346,"teacher_disagreement_score":0.9606966,"about_ca_system_score_codex":0.00018864416,"about_ca_system_score_gemma":0.00003963923,"threshold_uncertainty_score":0.7100819},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22621213,0.000034959536,0.19894972,0.014525772,0.0038444402,0.0054124678,0.00083862134,0.00013973033,0.55004215],"genre_scores_gemma":[0.9870851,0.000010636499,0.0030726846,0.00024880306,0.000051090363,0.0004601219,0.0000761438,0.000007960501,0.008987467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99686956,0.000046704314,0.0010067311,0.00024272522,0.0016432769,0.0001909966],"domain_scores_gemma":[0.9970588,0.00023150425,0.0011323406,0.00051469036,0.0010305294,0.000032097705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004558297,0.00016165442,0.00021522274,0.00040925064,0.00041572878,0.00041258452,0.0044810805,0.000027241449,0.0003302906],"category_scores_gemma":[0.0008270525,0.00010564143,0.0001783285,0.00052229007,0.00009992437,0.0015189783,0.0032486876,0.00017788951,0.000026917764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002042132,0.00016532684,0.000028316614,0.0002484307,0.00012261244,2.4261496e-8,0.014245321,0.018179517,0.000112026806,0.93375325,0.017637819,0.015303162],"study_design_scores_gemma":[0.0024119136,0.0001618744,0.0013035475,0.0003902251,0.00015660223,0.0000054445372,0.12053072,0.17646834,0.00085623964,0.40662882,0.29047832,0.0006079737],"about_ca_topic_score_codex":0.000021247479,"about_ca_topic_score_gemma":0.000029765764,"teacher_disagreement_score":0.76087296,"about_ca_system_score_codex":0.00014042914,"about_ca_system_score_gemma":0.000038242004,"threshold_uncertainty_score":0.8327037},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019461725,0.00006166957,0.677238,0.010651505,0.008198593,0.003222151,0.00016266978,0.00060951186,0.2803942],"genre_scores_gemma":[0.9394374,0.00006165777,0.05741103,0.00054235896,0.00016666982,0.00068228063,0.000080512385,0.000015157772,0.0016029184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998243,0.000011826774,0.00057332823,0.00027069225,0.00065782596,0.00024334001],"domain_scores_gemma":[0.9981992,0.00007724102,0.00057989423,0.00034055862,0.00075497414,0.000048125316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053422485,0.00018633022,0.00014556962,0.00047494884,0.0005097811,0.00028294104,0.0029246088,0.00003797958,0.00004740079],"category_scores_gemma":[0.00016054297,0.0001671814,0.00015302245,0.0006312837,0.000052123698,0.0016283283,0.0020040637,0.00026379112,0.000021030306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000665567,0.0000623679,0.00035902797,0.0001037659,0.000068241774,2.5774227e-8,0.0012110927,0.0028052013,0.00027372915,0.9504565,0.0044970564,0.04009644],"study_design_scores_gemma":[0.0017838978,0.00024021356,0.0025679127,0.00035424117,0.0000545253,0.000015454725,0.0011996112,0.16482447,0.0011255416,0.25450924,0.57272464,0.0006002375],"about_ca_topic_score_codex":0.0000014033285,"about_ca_topic_score_gemma":0.0000014111021,"teacher_disagreement_score":0.9199757,"about_ca_system_score_codex":0.0002187864,"about_ca_system_score_gemma":0.00002651801,"threshold_uncertainty_score":0.68174595},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13822994,0.000009521761,0.0101425685,0.0017414608,0.0026109468,0.0011933182,0.000052344465,0.00014585584,0.8458741],"genre_scores_gemma":[0.98911935,0.000002669925,0.003088593,0.00041564985,0.00009904032,0.0006388601,0.000086966786,0.000014517919,0.0065343413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99812335,0.00018671846,0.0006066653,0.0002213607,0.0006173076,0.0002446172],"domain_scores_gemma":[0.9978406,0.00018118549,0.0008523576,0.0002626174,0.00082714815,0.00003612796],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001785494,0.00022903415,0.00020448148,0.0005695786,0.0005178185,0.0001291224,0.0013724708,0.00005042643,0.0012219491],"category_scores_gemma":[0.00056662393,0.00019142104,0.00012641377,0.00054018945,0.00010446869,0.0007660198,0.0009977693,0.00063535036,0.0003174153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062127004,0.00033930014,0.0022408785,0.00017295816,0.0003746211,1.1942666e-7,0.05151319,0.0002826567,0.0006093029,0.78312105,0.032816965,0.1279077],"study_design_scores_gemma":[0.0044667134,0.0007177679,0.09650817,0.00033180794,0.0001596303,0.000053754306,0.047541045,0.01006459,0.0018135493,0.055100195,0.7821503,0.0010924677],"about_ca_topic_score_codex":0.00003187106,"about_ca_topic_score_gemma":0.00000365438,"teacher_disagreement_score":0.85088944,"about_ca_system_score_codex":0.0003983762,"about_ca_system_score_gemma":0.000015895917,"threshold_uncertainty_score":0.99969107},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26884314,0.00007536358,0.23681729,0.0031282362,0.0022216858,0.0068973205,0.0005371604,0.0003712265,0.48110858],"genre_scores_gemma":[0.99485797,0.000013584837,0.0023008615,0.00012418005,0.00014232533,0.00092084514,0.0005895734,0.00001557751,0.0010350809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980693,0.0000682845,0.0007728967,0.00020847817,0.00054191326,0.00033911256],"domain_scores_gemma":[0.99806213,0.00017988986,0.00050952693,0.00035623132,0.00083617936,0.000056052882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012845225,0.00025106923,0.00027295822,0.00050596136,0.0006118739,0.00017201754,0.0021410296,0.000044465945,0.0005722326],"category_scores_gemma":[0.000053134565,0.000237973,0.00025553655,0.0006410531,0.000120243276,0.0004884071,0.0021099693,0.00070982805,0.000014375977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037639635,0.0007489483,0.040545765,0.000109034445,0.00044706135,3.533912e-8,0.0020751166,0.07975708,0.000044874647,0.8354535,0.022599237,0.017842932],"study_design_scores_gemma":[0.0026861061,0.00011049098,0.025241712,0.00023743401,0.0000806457,0.0000012066238,0.006910369,0.8485467,0.00008208704,0.03551621,0.07998988,0.0005971566],"about_ca_topic_score_codex":0.00016308507,"about_ca_topic_score_gemma":0.00007761661,"teacher_disagreement_score":0.7999373,"about_ca_system_score_codex":0.0002932643,"about_ca_system_score_gemma":0.00003672539,"threshold_uncertainty_score":0.9704257},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2393444,0.0005887916,0.29759496,0.022620117,0.010409219,0.013033116,0.00012300203,0.0016228195,0.41466355],"genre_scores_gemma":[0.9775802,0.00011046428,0.019469526,0.00023643763,0.00006423308,0.0007078343,0.00012079639,0.000015402227,0.0016951398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835694,0.000039277696,0.00046254255,0.00028456174,0.0006487418,0.00020791958],"domain_scores_gemma":[0.9986103,0.00008841533,0.00060011045,0.00022640955,0.0004329501,0.00004177937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005621272,0.00016627963,0.0001379623,0.00026722383,0.00042501473,0.0003136343,0.0014257135,0.00003332518,0.00006376708],"category_scores_gemma":[0.00013540262,0.00015308925,0.00008848741,0.00050585525,0.000044399887,0.001758407,0.0020108856,0.00021568873,0.000011628602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030032685,0.0001158485,0.002256639,0.00020864884,0.00018951506,1.3318667e-7,0.0029951718,0.08174906,0.0001829731,0.698911,0.009302546,0.20378815],"study_design_scores_gemma":[0.0010705135,0.00015081062,0.0018404733,0.0001240547,0.000039654784,0.000014235055,0.00059281127,0.7959221,0.00016372534,0.10356229,0.09622373,0.00029561],"about_ca_topic_score_codex":7.2709616e-7,"about_ca_topic_score_gemma":0.000002210916,"teacher_disagreement_score":0.7382358,"about_ca_system_score_codex":0.00013604251,"about_ca_system_score_gemma":0.000026037633,"threshold_uncertainty_score":0.62427986},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11858014,0.000038392256,0.44737136,0.019076783,0.006837462,0.0016683463,0.000052908763,0.0006367526,0.40573785],"genre_scores_gemma":[0.96469724,0.00000737848,0.03203985,0.00063478644,0.00007087065,0.00026439203,0.000024734427,0.0000080499485,0.0022526942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813867,0.000022763108,0.00053016446,0.00024666806,0.0008627236,0.00019902895],"domain_scores_gemma":[0.9984057,0.000028123904,0.0004330047,0.0004158997,0.00066437403,0.000052932228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073988904,0.00017149755,0.00013675091,0.0004071582,0.0003299642,0.0003693423,0.0033137472,0.000031154897,0.00019506145],"category_scores_gemma":[0.00016109087,0.00015595519,0.00010579892,0.00039289633,0.000037112874,0.0011092053,0.0021590227,0.00023492984,0.00012020897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002182189,0.00010200348,0.0009054601,0.00012215291,0.00005397036,1.08563086e-7,0.0014089767,0.0034135943,0.00027566066,0.97815776,0.00431303,0.011225455],"study_design_scores_gemma":[0.0015137828,0.00009195526,0.0016902057,0.00028897577,0.000034659446,0.000007230557,0.0011762637,0.49567997,0.0029349574,0.024613943,0.47134584,0.0006222185],"about_ca_topic_score_codex":0.000009894462,"about_ca_topic_score_gemma":0.000004747569,"teacher_disagreement_score":0.95354384,"about_ca_system_score_codex":0.0003487328,"about_ca_system_score_gemma":0.000072211114,"threshold_uncertainty_score":0.6359668},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06299778,0.00007391806,0.7413202,0.016583707,0.0075668152,0.008273478,0.0041820114,0.00031340087,0.1586887],"genre_scores_gemma":[0.9314655,0.00021044901,0.042188883,0.00037521133,0.0002298635,0.0014548389,0.00065489294,0.00003599803,0.023384359],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99575555,0.00003927346,0.0010522896,0.0003552727,0.002514256,0.00028335475],"domain_scores_gemma":[0.9953591,0.00025574092,0.001135747,0.00046187383,0.0027094053,0.00007811009],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0019035873,0.00021548937,0.00022971809,0.0008174571,0.0005133985,0.00036175194,0.0035979392,0.000041794276,0.001485479],"category_scores_gemma":[0.0024215109,0.00016106901,0.00018542875,0.0008633451,0.000095462565,0.0012732054,0.002631045,0.0002968893,0.00015892951],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00140195,0.0013035635,0.0028299042,0.00029606035,0.00045608156,2.5883787e-7,0.006235208,0.30160376,0.00009126233,0.20027041,0.104456,0.38105553],"study_design_scores_gemma":[0.0019145581,0.00018516649,0.0026586966,0.000109774344,0.000043077776,0.0000031308575,0.0065561035,0.44224134,0.0002427285,0.026199503,0.51949275,0.00035314885],"about_ca_topic_score_codex":0.000005310049,"about_ca_topic_score_gemma":0.000011777624,"teacher_disagreement_score":0.86846775,"about_ca_system_score_codex":0.00046222899,"about_ca_system_score_gemma":0.000052973555,"threshold_uncertainty_score":0.9994273},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33830398,0.000011207611,0.094945945,0.0035473697,0.002179806,0.0010215366,0.000031446223,0.00025189956,0.5597068],"genre_scores_gemma":[0.9792453,0.000011809184,0.014159692,0.00022688438,0.000050233455,0.00006192575,0.000013198028,0.000007223499,0.006223731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.997985,0.000015145346,0.0004645174,0.00025227372,0.0010738703,0.00020918003],"domain_scores_gemma":[0.9982912,0.000023789135,0.00052074477,0.00043272914,0.0006832876,0.000048272323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068188715,0.00016808962,0.00013806141,0.0003539641,0.0003102029,0.0004615068,0.0035261328,0.000029173128,0.00016221787],"category_scores_gemma":[0.000087304434,0.00013792848,0.00007415767,0.00047395626,0.000047065874,0.0016167797,0.0031260652,0.0003082911,0.00010096178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008296829,0.00008512811,0.0019183097,0.00011148221,0.000076470125,2.1958355e-7,0.003927718,0.0007649125,0.00007958174,0.98690635,0.00069848134,0.005348364],"study_design_scores_gemma":[0.004907182,0.0005636548,0.021363689,0.0010026266,0.000109911016,0.000034381334,0.0062684263,0.20397568,0.0026197042,0.06237598,0.69509375,0.0016850383],"about_ca_topic_score_codex":0.000013456753,"about_ca_topic_score_gemma":0.0000059010063,"teacher_disagreement_score":0.9245304,"about_ca_system_score_codex":0.00027410034,"about_ca_system_score_gemma":0.000057271936,"threshold_uncertainty_score":0.65524906},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08253288,0.000036896992,0.15464154,0.009961689,0.005228383,0.0018379625,0.00008663453,0.00055912783,0.74511486],"genre_scores_gemma":[0.98108953,0.000046562713,0.015143335,0.0003956349,0.00008262738,0.00024299392,0.00006315372,0.00000861292,0.0029275466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99769783,0.00003717297,0.0007053541,0.00030652588,0.0010381388,0.00021499688],"domain_scores_gemma":[0.9979649,0.000040902913,0.0005404445,0.0004892189,0.00091839215,0.00004615227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008409054,0.00019936894,0.00016557869,0.00022570358,0.0003829642,0.00032306404,0.0031828147,0.000061006438,0.00020432187],"category_scores_gemma":[0.0002883866,0.00017989492,0.00010804941,0.00057814486,0.000046421243,0.002267861,0.002475221,0.00037700185,0.00009512067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005085386,0.00013315791,0.0017988731,0.00011909554,0.000065414046,7.240862e-8,0.0035442112,0.00033871687,0.00016293695,0.9781524,0.0051411055,0.010493151],"study_design_scores_gemma":[0.003286628,0.00030330656,0.023763618,0.0005887077,0.000086975706,0.000025899559,0.0041100876,0.29201245,0.0012911687,0.22413051,0.44945556,0.0009450755],"about_ca_topic_score_codex":0.000020418207,"about_ca_topic_score_gemma":0.000004506362,"teacher_disagreement_score":0.89855665,"about_ca_system_score_codex":0.00045961174,"about_ca_system_score_gemma":0.00006241342,"threshold_uncertainty_score":0.7335902},"labels":[],"label_agreement":null}]}