{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":4,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":4,"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","author_layer_release":"2026-06-26"},"query_hash":"2683bd646c00","filters":{"venue":"Proceedings of the 2022 ACM on Asia Conference on Computer and Communications Security"}},"results":[{"id":"W4281398044","doi":"10.1145/3488932.3497769","title":"On Measuring Vulnerable JavaScript Functions in the Wild","year":2022,"lang":"en","type":"article","venue":"Proceedings of the 2022 ACM on Asia Conference on Computer and Communications Security","topic":"Software Engineering Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"JavaScript; Unobtrusive JavaScript; Computer science; Vulnerability (computing); Secure coding; Exploit; Web application; Popularity; Computer security; Rich Internet application; World Wide Web; Cross-site scripting; Source code; Web application security; Web page; Software security assurance; Programming language; Information security; Web development","authors":[{"name":"Maryna Kluban","is_ca":true},{"name":"Mohammad Mannan","is_ca":true},{"name":"Amr Youssef","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04772153059830603,"gpt":0.2654061366848843,"spread":0.2176846060865782,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002589892,0.0009061512,0.0006383869,0.007467256,0.0006344108,0.001051627,0.001101901,0.001280306,0.0003705902],"category_scores_gemma":[0.01599445,0.0003199897,0.0005773049,0.004030826,0.000837147,0.003052366,0.001589747,0.000733919,0.0007116222],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006944805,"about_ca_system_score_gemma":0.0006505715,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004722769,"about_ca_topic_score_gemma":0.006323332,"domain_scores_codex":[0.995103,0.0008483627,0.0005385619,0.00143958,0.001696037,0.0003745382],"domain_scores_gemma":[0.9814449,0.007103608,0.004900707,0.002637316,0.003121806,0.0007915957],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.0004104016,0.0009318475,0.7644084,0.000803643,0.0002850427,0.0008077804,0.00156511,0.0206719,0.02810531,0.001685896,0.009577939,0.1707467],"study_design_scores_gemma":[0.00003023047,0.0007323342,0.8240215,0.0001729025,0.0001642964,0.002111144,0.001826385,0.1304261,0.02868851,0.002394819,0.009303187,0.0001285573],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9744952,0.0008094453,0.01675615,0.0001092372,0.00004320305,0.0001019698,0.004960667,0.001215093,0.001508895],"genre_scores_gemma":[0.9578916,0.0003993046,0.02710409,0.00008347582,0.00003480706,0.0001301667,0.01342123,0.000156045,0.0007793333],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007467256,"threshold_uncertainty_score":0.01369685,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4281386732","doi":"10.1145/3488932.3497765","title":"Driving Execution of Target Paths in Android Applications with (a) CAR","year":2022,"lang":"en","type":"article","venue":"Proceedings of the 2022 ACM on Asia Conference on Computer and Communications Security","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Static analysis; Soundness; False positive paradox; Android (operating system); Taint checking; Data-flow analysis; Completeness (order theory); Path (computing); Symbolic execution; Distributed computing; Real-time computing; Data mining; Programming language; Machine learning; Operating system; Data flow diagram; Database","authors":[{"name":"Michelle Y. Wong","is_ca":true},{"name":"David Lie","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.014237452070534,"gpt":0.2505326675623472,"spread":0.2362952154918132,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006218093,0.001003574,0.0003973459,0.0009328439,0.0005144427,0.0007843442,0.0007991932,0.0007007178,0.00169875],"category_scores_gemma":[0.006593212,0.0005090568,0.0007153453,0.0004265993,0.0008415467,0.001400137,0.001451801,0.001041965,0.000562972],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005866927,"about_ca_system_score_gemma":0.001498757,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008979418,"about_ca_topic_score_gemma":0.01901394,"domain_scores_codex":[0.9986833,0.0001824495,0.00005948119,0.0002914359,0.00063384,0.0001494831],"domain_scores_gemma":[0.996512,0.001725179,0.0003932536,0.0006834222,0.0006064263,0.00007971371],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001326661,0.000234214,0.05974998,0.001089315,0.000149379,0.00209471,0.002488419,0.2163201,0.1470295,0.02370834,0.006624371,0.5391851],"study_design_scores_gemma":[0.00003168059,0.0003108554,0.007173134,0.0001264217,0.00009536722,0.0007076841,0.0003002092,0.8681423,0.09896751,0.01051124,0.01354373,0.00008983167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3285267,0.001456841,0.6347882,0.0004428559,0.0001025764,0.0002705789,0.0006138871,0.02829353,0.005504885],"genre_scores_gemma":[0.7990492,0.0003529149,0.1970793,0.000176148,0.00001614566,0.0000965564,0.0004291596,0.00105573,0.001744767],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008979418,"threshold_uncertainty_score":0.01785427,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4281390966","doi":"10.1145/3488932.3517402","title":"InfoCensor","year":2022,"lang":"en","type":"article","venue":"Proceedings of the 2022 ACM on Asia Conference on Computer and Communications Security","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":3,"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":"Mutual information; Computer science; Artificial intelligence; Machine learning; Inference; Interaction information; Deep learning; Adversary; Adversarial system; Bounded function; Softmax function; Mathematics; Computer security","authors":[{"name":"Tianhang Zheng","is_ca":true},{"name":"Baochun Li","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02784295292011382,"gpt":0.2723720666151164,"spread":0.2445291136950026,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00291277,0.001671325,0.001463306,0.002395458,0.001346326,0.00491054,0.004323754,0.002673254,0.2828968],"category_scores_gemma":[0.01800187,0.0009092712,0.001815233,0.002209735,0.001379981,0.006735273,0.005987963,0.004087173,0.1743402],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001358857,"about_ca_system_score_gemma":0.003303956,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002193314,"about_ca_topic_score_gemma":0.003134946,"domain_scores_codex":[0.997393,0.0004814476,0.0001657317,0.0004653733,0.001150778,0.000343568],"domain_scores_gemma":[0.993298,0.001236973,0.0003401524,0.003690245,0.0009774567,0.0004571153],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005273387,0.0001052108,0.0007883128,0.0006404218,0.0001117065,0.0002823616,0.0001031493,0.003325884,0.002055309,0.04890063,0.6979102,0.2452495],"study_design_scores_gemma":[0.0001454189,0.00009381088,0.0004351697,0.0002420794,0.00005082642,0.0004581211,0.00004814688,0.03020524,0.01093239,0.06763923,0.8896725,0.0000771922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.006071171,0.004790181,0.3351064,0.0130893,0.007793467,0.0009684626,0.06597333,0.2251618,0.3410458],"genre_scores_gemma":[0.1731233,0.008919221,0.1441618,0.01031624,0.004091891,0.002142585,0.1629513,0.04250858,0.4517851],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.2828968,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4281400786","doi":"10.1145/3488932.3517404","title":"Lures for Money","year":2022,"lang":"en","type":"article","venue":"Proceedings of the 2022 ACM on Asia Conference on Computer and Communications Security","topic":"Spam and Phishing Detection","field":"Computer Science","cited_by":2,"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":"Variety (cybernetics); Internet privacy; Incentive; Computer science; Population; World Wide Web; Business","authors":[{"name":"Noshaba Nasir","is_ca":false},{"name":"Faqia Iqbal","is_ca":true},{"name":"Mahnoor Zaheer","is_ca":false},{"name":"Mariam Shahjahan","is_ca":false},{"name":"Mobin Javed","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03730800453416453,"gpt":0.2711671590825407,"spread":0.2338591545483762,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001220844,0.0009963845,0.0007653372,0.002114856,0.003794012,0.009336155,0.001105343,0.002776262,0.533159],"category_scores_gemma":[0.008501739,0.0003152556,0.000527211,0.001385215,0.001271974,0.007069021,0.004189561,0.003361757,0.386644],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002048951,"about_ca_system_score_gemma":0.002711547,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003481635,"about_ca_topic_score_gemma":0.005430968,"domain_scores_codex":[0.9982534,0.0002606182,0.00005860273,0.0001664626,0.000861819,0.0003991022],"domain_scores_gemma":[0.9967777,0.0002569138,0.0002344847,0.0003844193,0.001175749,0.001170794],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"observational","study_design_scores_codex":[0.00002607542,0.00002380317,0.000348144,0.00005403297,0.00000550149,0.000136579,0.000172136,0.00002254495,0.0001325294,0.02122903,0.9376312,0.04021835],"study_design_scores_gemma":[0.000002403554,0.000009588369,0.0002219722,0.00004756295,0.000001429567,0.0001113113,0.0001801861,0.00002231881,0.0000354525,0.001233911,0.9981293,0.000004579495],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.002586161,0.002670551,0.0007914925,0.04541162,0.007953328,0.0001006294,0.001169977,0.001340074,0.9379762],"genre_scores_gemma":[0.01320299,0.001853898,0.0003787811,0.01065501,0.001739217,0.00004413737,0.0007072979,0.0004336867,0.9709849],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.533159,"threshold_uncertainty_score":0.665892,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}