{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":3,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":3,"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":"775274601d62","filters":{"venue":"Network and Distributed System Security Symposium"}},"results":[{"id":"W2128031609","doi":"","title":"Army of Botnets","year":2007,"lang":"en","type":"article","venue":"Network and Distributed System Security Symposium","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":99,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Botnet; Computer security; Adversary; Computer science; Command and control; Telecommunications; World Wide Web; The Internet","retraction":null,"screen_n_in":null,"score":{"opus":0.006135995132162434,"gpt":0.2101569304419114,"spread":0.204020935309749,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001315757,0.0002164481,0.0003726064,0.00008214508,0.0002681531,0.0001022452,0.0004601575,0.0002185969,0.000005705931],"category_scores_gemma":[0.00001437003,0.0002076676,0.0001046861,0.0007820348,0.00007839408,0.0003173624,0.0002673446,0.0002252673,0.000009854161],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006606508,"about_ca_system_score_gemma":0.00003294977,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006744984,"about_ca_topic_score_gemma":0.000051254,"domain_scores_codex":[0.9978874,0.0001274438,0.0006202058,0.0004447664,0.0003675,0.0005527262],"domain_scores_gemma":[0.9986096,0.000178986,0.0002829231,0.0005235826,0.0001637458,0.0002411858],"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.0003093511,0.0003575355,0.01012147,0.0009228728,0.0001812567,0.0001471085,0.002855577,0.003350982,0.001925248,0.9440686,0.02518227,0.01057771],"study_design_scores_gemma":[0.00509078,0.001852726,0.01807363,0.001790319,0.0002049565,0.001309832,0.001354536,0.689568,0.01359782,0.02479552,0.2396204,0.002741477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1180155,0.002220527,0.8666334,0.0003896808,0.002467838,0.0005017106,0.00004570701,0.00054485,0.009180884],"genre_scores_gemma":[0.9983261,0.00008991557,0.0009392735,0.00007299284,0.0005125806,0.000006295614,0.00002962311,0.000009212937,0.0000140386],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9192731,"threshold_uncertainty_score":0.8468441,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3168804","doi":"","title":"Two-Party Computation Model for Privacy-Preserving Queries over Distributed Databases.","year":2009,"lang":"en","type":"article","venue":"Network and Distributed System Security Symposium","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":73,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Scalability; Cryptography; Key (lock); Private information retrieval; Protocol (science); Information privacy; Database; Computer security; Computation; Cryptographic primitive; Secure multi-party computation; Distributed database; Information sensitivity; Cryptographic protocol; Distributed computing; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.01736873921906464,"gpt":0.2633924308716324,"spread":0.2460236916525678,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007589296,0.0004494727,0.0005854049,0.00008872246,0.0007958045,0.0006045937,0.0009539881,0.0001603603,0.000002182078],"category_scores_gemma":[0.00006177524,0.0004422016,0.000200355,0.0007928858,0.00008402498,0.001468849,0.0005988283,0.0002569944,0.000002261169],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000104089,"about_ca_system_score_gemma":0.00009790736,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008970177,"about_ca_topic_score_gemma":0.00008126771,"domain_scores_codex":[0.9968153,0.0001871146,0.0007144443,0.0009830133,0.0004441456,0.000855943],"domain_scores_gemma":[0.9976674,0.0002777031,0.0003341299,0.001095494,0.0002558937,0.0003693934],"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.0002509715,0.0003252923,0.003001473,0.0005204321,0.0001015749,0.00002316494,0.001560752,0.05322176,0.0002209797,0.8797221,0.06035251,0.0006990249],"study_design_scores_gemma":[0.001474996,0.0001070408,0.0009264954,0.0001782294,0.00005788242,0.00002864864,0.0001122835,0.9667875,0.00005352515,0.02469669,0.005059358,0.0005174012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01526934,0.0007927599,0.9755897,0.0007778461,0.0004540375,0.0008964966,0.00534181,0.0006480936,0.0002299224],"genre_scores_gemma":[0.9738946,0.00005407229,0.01826192,0.0002169448,0.0003543709,0.00006143463,0.007139396,0.00001526106,0.000001986847],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9586253,"threshold_uncertainty_score":0.9998029,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2575714565","doi":"","title":"Killed by Proxy: Analyzing Client-end TLS Interce.","year":2016,"lang":"en","type":"article","venue":"Network and Distributed System Security Symposium","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Proxy (statistics); Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.003860537646584409,"gpt":0.2018529503828525,"spread":0.1979924127362681,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001119188,0.0003674022,0.0005870811,0.00006530345,0.0004186231,0.0002879837,0.0007646842,0.0002629509,0.000011226],"category_scores_gemma":[0.00003860214,0.000237034,0.0001627149,0.0005776589,0.0001200343,0.0006486642,0.0004338872,0.0001805912,0.0000642724],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002362323,"about_ca_system_score_gemma":0.00006962074,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000545513,"about_ca_topic_score_gemma":0.00001053085,"domain_scores_codex":[0.9968237,0.0003176637,0.0007571595,0.0008881287,0.0004176076,0.000795798],"domain_scores_gemma":[0.9979583,0.0002571476,0.0002958651,0.000946437,0.0001937234,0.0003485529],"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.0003195083,0.000607797,0.7099225,0.002601428,0.0006179771,0.0001081262,0.004028982,0.0002729548,0.003824215,0.04626134,0.2136068,0.01782841],"study_design_scores_gemma":[0.0260584,0.003443202,0.03246958,0.0173469,0.0007347512,0.001729152,0.002473046,0.26872,0.008283407,0.008839071,0.6192394,0.01066297],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3441889,0.002899404,0.639948,0.003351182,0.00400974,0.001566767,0.0004086676,0.001745675,0.001881646],"genre_scores_gemma":[0.998929,0.0001354506,0.0002129857,0.00006872477,0.0004041857,0.00007198708,0.00006357654,0.00001667008,0.00009748068],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6774529,"threshold_uncertainty_score":0.9665965,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}