{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":7,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":7,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"b96d558db8cd","filters":{"venue":"Proceedings of the ACM Web Conference 2022"}},"results":[{"id":"W4224313461","doi":"10.1145/3485447.3512205","title":"FirmCore Decomposition of Multilayer Networks","year":2022,"lang":"en","type":"article","venue":"Proceedings of the ACM Web Conference 2022","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":26,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Modular decomposition; Computer science; Decomposition; Approximation algorithm; Matching (statistics); Key (lock); Core (optical fiber); Cograph; Theoretical computer science; Time complexity; Algorithm; Graph; Mathematics; Pathwidth; Line graph","retraction":null,"screen_n_in":null,"score":{"opus":0.0151240366878883,"gpt":0.2636987550694495,"spread":0.2485747183815612,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002679484,0.0001247781,0.0002519308,0.00007065936,0.0002047717,0.00002182746,0.001620058,0.00001817128,0.001907464],"category_scores_gemma":[0.0000217541,0.0001070517,0.0002016161,0.0004543039,0.00007026025,0.00008580692,0.002082644,0.0002847589,7.593227e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002837542,"about_ca_system_score_gemma":0.00004482978,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008105134,"about_ca_topic_score_gemma":0.000002116938,"domain_scores_codex":[0.9989947,0.00001741513,0.0003109689,0.0002087298,0.0002917491,0.0001764041],"domain_scores_gemma":[0.9988838,0.00004966885,0.0004431754,0.000369882,0.0002240857,0.00002937514],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001673646,0.0006696751,0.5696095,0.00007105788,0.0004519199,2.633067e-7,0.001132218,0.003670344,0.1872335,0.1617395,0.05066673,0.024588],"study_design_scores_gemma":[0.001579959,0.0005083806,0.0358745,0.0002232005,0.0006308927,0.000007227934,0.005264836,0.5810378,0.1098268,0.2473616,0.01658898,0.001095877],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.990764,0.00005417376,0.0005116968,0.000632828,0.0000934827,0.0002918004,0.00003650419,0.00004171399,0.007573753],"genre_scores_gemma":[0.9982671,0.000004518354,0.001296972,0.0000300456,0.00007463423,0.00009571636,0.0000117083,0.00001311349,0.0002061944],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5773675,"threshold_uncertainty_score":0.9990049,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4224316621","doi":"10.1145/3485447.3512223","title":"Et tu, Brute? Privacy Analysis of Government Websites and Mobile Apps","year":2022,"lang":"en","type":"article","venue":"Proceedings of the ACM Web Conference 2022","topic":"Privacy, Security, and Data Protection","field":"Social Sciences","cited_by":24,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Android (operating system); Internet privacy; BitTorrent tracker; Password; World Wide Web; Computer security; The Internet; Computer science; Government (linguistics)","retraction":null,"screen_n_in":null,"score":{"opus":0.02479004339928924,"gpt":0.2849386553110434,"spread":0.2601486119117541,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014245,0.0001047628,0.0002662784,0.0001051593,0.0005186832,0.0000769155,0.00220882,0.00004076493,0.0009215033],"category_scores_gemma":[0.002054639,0.00009186792,0.0001167468,0.001107646,0.0002415065,0.0003211908,0.004563584,0.0002318081,0.000001256194],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001175442,"about_ca_system_score_gemma":0.0001425558,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001055201,"about_ca_topic_score_gemma":0.000203896,"domain_scores_codex":[0.9982439,0.00006523094,0.0002597262,0.0002816488,0.000954427,0.0001950137],"domain_scores_gemma":[0.9989026,0.0001116126,0.0003891142,0.0003943394,0.0001443084,0.00005808303],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0003474737,0.001047092,0.5232797,0.0003581854,0.001574866,9.633427e-7,0.1091192,0.00008841848,0.1600429,0.1615759,0.03097815,0.01158714],"study_design_scores_gemma":[0.001761956,0.0009424976,0.122682,0.000116299,0.002510932,0.000006569016,0.1682592,0.008381416,0.02856252,0.133811,0.5317951,0.001170483],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9874351,0.0002486916,0.0000113533,0.003970703,0.0001119391,0.0004452511,0.000261005,0.00002955662,0.007486419],"genre_scores_gemma":[0.9983835,0.00049488,0.0003898705,0.0000964293,0.0000258403,0.0001298902,0.000005606886,0.00000636811,0.0004675989],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.500817,"threshold_uncertainty_score":0.9999918,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4224324779","doi":"10.1145/3485447.3512043","title":"A Contrastive Sharing Model for Multi-Task Recommendation","year":2022,"lang":"en","type":"article","venue":"Proceedings of the ACM Web Conference 2022","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Subnet; Computer science; Task (project management); Artificial intelligence; Collaborative filtering; Machine learning; Recommender system; Channel (broadcasting); Scale (ratio)","retraction":null,"screen_n_in":null,"score":{"opus":0.09269183884231441,"gpt":0.2982117770841838,"spread":0.2055199382418694,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007811199,0.0001367019,0.00021477,0.00009694379,0.0003932803,0.0001360445,0.004050173,0.00003235679,0.00002822487],"category_scores_gemma":[0.0002516155,0.0001141564,0.0001151302,0.0002834824,0.00002700022,0.0004450517,0.004044333,0.0002204211,5.815448e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001013555,"about_ca_system_score_gemma":0.00009153802,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002612052,"about_ca_topic_score_gemma":0.000005136844,"domain_scores_codex":[0.9987893,0.000009715962,0.0003171772,0.0004152716,0.0002322112,0.0002363934],"domain_scores_gemma":[0.9988055,0.00005539059,0.0003875881,0.0004119516,0.000298831,0.00004079215],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007827697,0.0003780509,0.005684856,0.0002253009,0.000135933,2.710174e-7,0.009004919,0.0001619929,0.09213077,0.8215732,0.03168963,0.03893679],"study_design_scores_gemma":[0.0003916536,0.00008369947,0.0001209983,0.00002146015,0.000009423274,0.000006334296,0.0004028925,0.9258133,0.004621992,0.06564296,0.002743412,0.0001419407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0366166,0.00006791848,0.9362468,0.01886914,0.0008715919,0.002503975,0.000160068,0.0004727318,0.004191226],"genre_scores_gemma":[0.9278442,0.000008636763,0.07038303,0.000254488,0.00001954631,0.0007710839,0.000003267807,0.00001211665,0.0007036019],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9256513,"threshold_uncertainty_score":0.7526298,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4224308858","doi":"10.1145/3485447.3511943","title":"QEN: Applicable Taxonomy Completion via Evaluating Full Taxonomic Relations","year":2022,"lang":"en","type":"article","venue":"Proceedings of the ACM Web Conference 2022","topic":"Biomedical Text Mining and Ontologies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal","funders":"","keywords":"Taxonomy (biology); Computer science; Artificial intelligence; Information retrieval; Natural language processing; Biology; Zoology","retraction":null,"screen_n_in":null,"score":{"opus":0.05760903710980053,"gpt":0.2750879658355946,"spread":0.2174789287257941,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005543743,0.0001186026,0.0001597249,0.00004019549,0.0003765989,0.00002250157,0.001216375,0.00006900918,0.00043124],"category_scores_gemma":[0.0005803392,0.0001021668,0.00009302022,0.0001797491,0.0001665084,0.000005002556,0.001870974,0.0002412946,0.000007745653],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004008401,"about_ca_system_score_gemma":0.000139949,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001909653,"about_ca_topic_score_gemma":0.000005658171,"domain_scores_codex":[0.9989654,0.00002638008,0.00024881,0.0003130311,0.0002440889,0.0002022777],"domain_scores_gemma":[0.9991835,0.00002817738,0.0002727412,0.000350027,0.0001236197,0.00004194357],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000080697,0.00005755728,0.00556905,0.00002214502,0.00003838748,7.25523e-8,0.00005656636,0.00006560876,0.9578848,0.0008970298,0.02572675,0.009601359],"study_design_scores_gemma":[0.001756493,0.001727687,0.007195609,0.00004829076,0.0001449753,0.00008320584,0.004323257,0.02167211,0.07670179,0.009246317,0.8763687,0.0007315731],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9885533,0.0002485216,0.0008136832,0.002806855,0.0002045898,0.0005140625,0.000045005,0.00003510093,0.00677892],"genre_scores_gemma":[0.9894087,0.00001407895,0.008975886,0.0001410235,0.0000770386,0.0004875069,0.00002774467,0.00001141008,0.0008565907],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.881183,"threshold_uncertainty_score":0.4721775,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4224313642","doi":"10.1145/3485447.3514193","title":"Following Good Examples - Health Goal-Oriented Food Recommendation based on Behavior Data","year":2022,"lang":"en","type":"article","venue":"Proceedings of the ACM Web Conference 2022","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; Université de Montréal","funders":"","keywords":"Recommender system; Computer science; Control (management); Consumption (sociology); World Wide Web; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.07630876727910414,"gpt":0.3025454647466594,"spread":0.2262366974675553,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.001906958,0.000196613,0.0003147497,0.0001783249,0.0006057718,0.0001698444,0.00723447,0.00003627445,0.0001003132],"category_scores_gemma":[0.0003038686,0.0001656954,0.0001138525,0.0007219856,0.00002462288,0.0006074282,0.006560613,0.0003808018,0.000001495873],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001667484,"about_ca_system_score_gemma":0.0003248856,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001347372,"about_ca_topic_score_gemma":0.00001834799,"domain_scores_codex":[0.9977472,0.00008863803,0.0004834002,0.0006791528,0.0006678398,0.0003337408],"domain_scores_gemma":[0.997461,0.0001083523,0.0005946879,0.001633458,0.0001220276,0.0000804998],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001050068,0.002619151,0.09486274,0.0004668646,0.0002642063,0.000003850892,0.004932656,0.00002059351,0.02460548,0.3779083,0.2218759,0.2723353],"study_design_scores_gemma":[0.004565829,0.007772204,0.01906648,0.0007342181,0.0001760464,0.00007783378,0.006380585,0.2877115,0.02522475,0.02680659,0.6191734,0.00231055],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5774361,0.0004750774,0.08186133,0.28481,0.01128395,0.01122206,0.002200955,0.003422084,0.0272884],"genre_scores_gemma":[0.9802728,0.000009179784,0.01842794,0.0007744647,0.00002987965,0.0003395566,0.00005727106,0.00001793927,0.00007091001],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4028367,"threshold_uncertainty_score":0.9981369,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3165481174","doi":"10.1145/3485447.3512262","title":"Exposing Query Identification for Search Transparency","year":2022,"lang":"en","type":"article","venue":"Proceedings of the ACM Web Conference 2022","topic":"Mobile Crowdsensing and Crowdsourcing","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Computer science; Transparency (behavior); Information retrieval; Web search query; Ranking (information retrieval); Metric (unit); Search engine; Identification (biology); Web query classification; Query expansion; Data mining; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.03571598258330556,"gpt":0.2552929820244484,"spread":0.2195769994411429,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001147341,0.0001227096,0.0001693756,0.000117405,0.0007559808,0.0002307534,0.003956228,0.00002998782,0.00003508524],"category_scores_gemma":[0.0003401947,0.0001102591,0.0001293161,0.0005805322,0.00007156498,0.0003451579,0.001430963,0.0002595491,0.000001708638],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007493259,"about_ca_system_score_gemma":0.0001941312,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002034557,"about_ca_topic_score_gemma":0.000001769034,"domain_scores_codex":[0.9983914,0.00002187872,0.0003420292,0.0004253684,0.0005295522,0.0002897062],"domain_scores_gemma":[0.9986004,0.0001009178,0.0002315016,0.0006742788,0.0003453464,0.0000475854],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00002838824,0.00009382888,0.001792938,0.0001636845,0.00002524566,3.43359e-7,0.006017732,0.0002446889,0.8587367,0.1086472,0.003510781,0.02073847],"study_design_scores_gemma":[0.001240546,0.0004238964,0.004623498,0.000196794,0.00008725117,0.00008677853,0.008574129,0.295049,0.5884944,0.09069116,0.009702628,0.0008298571],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.961457,0.0001528792,0.02701389,0.008072921,0.0007811535,0.0007604886,0.00002624478,0.000173534,0.001561887],"genre_scores_gemma":[0.9922745,0.000009397344,0.006927331,0.00009052585,0.00003950242,0.0001599541,0.0000020255,0.00001280582,0.0004839646],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2948044,"threshold_uncertainty_score":0.7351721,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4224313808","doi":"10.1145/3485447.3512106","title":"MCL: Mixed-Centric Loss for Collaborative Filtering","year":2022,"lang":"en","type":"article","venue":"Proceedings of the ACM Web Conference 2022","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Pairwise comparison; Weighting; Collaborative filtering; Representation (politics); Information loss; Process (computing); Code (set theory); Machine learning; Graph; Preference; Data mining; Artificial intelligence; Theoretical computer science; Recommender system; Statistics; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03186525361109577,"gpt":0.2522746499838609,"spread":0.2204093963727651,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006582358,0.0001491213,0.0002426281,0.0001170149,0.0004269022,0.000168717,0.004991117,0.000032065,0.00004932014],"category_scores_gemma":[0.0002966749,0.0001204497,0.00010717,0.0008310528,0.00004409798,0.0003658289,0.004642037,0.000201783,0.000001231798],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009251538,"about_ca_system_score_gemma":0.0001845398,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001447686,"about_ca_topic_score_gemma":0.000002120246,"domain_scores_codex":[0.9986241,0.00002299081,0.0003048213,0.0003755619,0.0003917444,0.0002807891],"domain_scores_gemma":[0.9985021,0.00009255145,0.0003769823,0.0005472975,0.0004329578,0.00004810645],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00005697322,0.000230962,0.006759933,0.0003215933,0.0001149344,0.000001722862,0.00467068,0.00001366873,0.07267976,0.7415432,0.1521369,0.02146968],"study_design_scores_gemma":[0.001612703,0.001021131,0.00144007,0.0001634277,0.0000511543,0.0001082721,0.005932056,0.03150219,0.2776571,0.2107112,0.4688005,0.001000272],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8005448,0.001350555,0.06633074,0.07864061,0.007675886,0.008420743,0.000583809,0.001659261,0.03479362],"genre_scores_gemma":[0.9764377,0.00002503927,0.02223441,0.0001588055,0.00004276301,0.0006063471,0.000001313529,0.00001287276,0.0004806714],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5308321,"threshold_uncertainty_score":0.9274821,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}