{"meta":{"query_hash":"20285f8f8584","filters":{"venue":"Proceedings of the ACM on Networking"},"cohort_total":3,"direct_labels_cover":0,"predictions_cover":3,"exported":3,"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/20285f8f8584","api":"https://metacan.xera.ac/api/v1/cohort?venue=Proceedings+of+the+ACM+on+Networking"},"results":[{"id":"W4389075867","doi":"10.1145/3629140","title":"Enhancing the Unlinkability of Circuit-Based Anonymous Communications with k-Funnels","year":2023,"lang":"en","type":"article","venue":"Proceedings of the ACM on Networking","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Fundação para a Ciência e a Tecnologia; NOVA Laboratory for Computer Science and Informatics","keywords":"Anonymity; Computer science; Computer security; Traffic analysis; Limiting; Group signature; Computer network; Internet privacy; Public-key cryptography; Engineering","score_opus":0.03553274511225134,"score_gpt":0.2540156187271382,"score_spread":0.21848287361488683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389075867","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9635302,0.00014313815,0.027774287,0.005181122,0.00030893998,0.00042582795,0.0000014955159,0.00024396981,0.0023910291],"genre_scores_gemma":[0.99712175,0.000009545154,0.0025165784,0.00020325444,0.00008825597,0.000013670498,6.9086377e-7,0.000011371946,0.00003490363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986261,0.000033939472,0.00040403206,0.000265453,0.00040199468,0.0002684815],"domain_scores_gemma":[0.99753827,0.00065364374,0.00048286535,0.0010205117,0.00027588662,0.0000288083],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0015331388,0.000132412,0.00023252914,0.00007970906,0.00030684975,0.00008241182,0.00573833,0.000046746067,0.0000017242113],"category_scores_gemma":[0.0002743245,0.0000739326,0.00015010704,0.0014394941,0.00018707974,0.00011143786,0.0012466182,0.0002845908,0.0000027272465],"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.00009329376,0.0004989226,0.035241544,0.00047204967,0.00054808205,0.0000018215525,0.021118423,0.119325206,0.013080772,0.75924635,0.0028665126,0.04750701],"study_design_scores_gemma":[0.00019608777,0.00010206276,0.0023048338,0.0005724193,0.000048162266,0.0000026481007,0.00045836347,0.98615754,0.007961102,0.0016628756,0.0003793312,0.00015455681],"about_ca_topic_score_codex":0.0000128154425,"about_ca_topic_score_gemma":0.000029143886,"teacher_disagreement_score":0.8668324,"about_ca_system_score_codex":0.000033701042,"about_ca_system_score_gemma":0.00004829207,"threshold_uncertainty_score":0.9996411},"labels":[],"label_agreement":null},{"id":"W4408177436","doi":"10.1145/3709373","title":"Spotlight: Shining a Light on Pivot Attacks Using In-network Computing","year":2025,"lang":"en","type":"article","venue":"Proceedings of the ACM on Networking","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Computer security","score_opus":0.020524038235276043,"score_gpt":0.2653279175767413,"score_spread":0.24480387934146525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408177436","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9673453,0.00048467517,0.0029952184,0.003756716,0.0048205205,0.0005110287,1.9043435e-7,0.00027407,0.019812288],"genre_scores_gemma":[0.99132884,0.000026166017,0.0063256216,0.0013301545,0.0009069723,0.0000050070767,1.2347012e-7,0.00001846873,0.00005866508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774957,0.000040149596,0.0005729674,0.0005940136,0.00042935082,0.00061395956],"domain_scores_gemma":[0.99843013,0.00030533064,0.0004537921,0.00064032053,0.000117774005,0.000052672407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012066283,0.0002697402,0.00036766403,0.00027109467,0.0005556778,0.000246316,0.0030254629,0.00016054032,0.000002414504],"category_scores_gemma":[0.00025596342,0.00021969482,0.00015527426,0.0025019317,0.000050702984,0.00031926585,0.0021882257,0.0007075543,0.0000038220946],"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.00056372344,0.00050904753,0.07506454,0.00039673224,0.00021610461,0.00001331231,0.0058319992,0.22644193,0.0055309455,0.43518868,0.018552471,0.23169051],"study_design_scores_gemma":[0.0010421235,0.0002788265,0.0070219687,0.009996968,0.000038837992,0.000020798698,0.000118513315,0.8584577,0.012109388,0.09108787,0.019150179,0.0006768194],"about_ca_topic_score_codex":0.000013289917,"about_ca_topic_score_gemma":0.000007093114,"teacher_disagreement_score":0.63201576,"about_ca_system_score_codex":0.0001713484,"about_ca_system_score_gemma":0.000041481693,"threshold_uncertainty_score":0.8958895},"labels":[],"label_agreement":null},{"id":"W4416649506","doi":"10.1145/3768985","title":"Harmonics: Scalable Collective Scheduling in Multi-Tenant GPU Clusters","year":2025,"lang":"en","type":"article","venue":"Proceedings of the ACM on Networking","topic":"Big Data and Digital Economy","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":"University of Calgary; Huawei Technologies (Canada)","funders":"","keywords":"Scalability; Scheduling (production processes); Fair-share scheduling; Dynamic priority scheduling; Two-level scheduling; Cloud computing; Latency (audio); Fixed-priority pre-emptive scheduling","score_opus":0.042281285465119424,"score_gpt":0.2621340072771946,"score_spread":0.21985272181207519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416649506","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8059858,0.0025080608,0.029036,0.025914611,0.0062296474,0.002922036,0.000011806554,0.00057550875,0.12681651],"genre_scores_gemma":[0.97285175,0.000033698034,0.025412528,0.0010459387,0.00004734234,0.000027125994,3.9078438e-7,0.000008449569,0.0005727491],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988339,0.0000066593307,0.00029151037,0.0003887419,0.00013552111,0.0003436869],"domain_scores_gemma":[0.9991454,0.00012608308,0.00017736059,0.00042179244,0.0000903872,0.000038981034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004135451,0.00013945058,0.00021102754,0.0001664857,0.00014856459,0.00025259797,0.0027952855,0.00006781287,5.340076e-7],"category_scores_gemma":[0.00030823998,0.000095742966,0.00007324545,0.001115434,0.000054798154,0.0005943437,0.0022601348,0.00023271676,0.0000038971716],"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.0006804078,0.0014539529,0.3611809,0.0008888194,0.00045172535,0.000010917952,0.0075384667,0.027699197,0.005129394,0.18454303,0.028808793,0.3816144],"study_design_scores_gemma":[0.0022724913,0.00013366711,0.011413613,0.0027912138,0.000022037553,0.0000068044674,0.00044930083,0.89481777,0.017916478,0.060379066,0.009270008,0.0005275792],"about_ca_topic_score_codex":0.00001700337,"about_ca_topic_score_gemma":0.000007730742,"teacher_disagreement_score":0.86711854,"about_ca_system_score_codex":0.00016664856,"about_ca_system_score_gemma":0.00010569949,"threshold_uncertainty_score":0.51943827},"labels":[],"label_agreement":null}]}