{"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11799797,0.00021943757,0.8724007,0.0003609302,0.00007098947,0.00013561577,0.00015848695,0.0036221573,0.005033699],"genre_scores_gemma":[0.94935787,0.000128379,0.047627367,0.00012367559,0.000028608483,0.00006890257,0.00011878928,0.00013039721,0.00241603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970487,0.0007496185,0.00024545233,0.0004937497,0.00096827524,0.0004942368],"domain_scores_gemma":[0.9884743,0.0038610175,0.0016495391,0.0044248,0.0011914584,0.00039882833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032651268,0.0005280262,0.00090348383,0.0009288723,0.0014270718,0.002964269,0.0018527242,0.0014118751,0.002658341],"category_scores_gemma":[0.013721558,0.00037752977,0.0007602199,0.00094615127,0.0026443414,0.006212378,0.0056176228,0.0021423632,0.0009556376],"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.0016240049,0.00033709264,0.0068095275,0.0003405424,0.00014602397,0.00065079937,0.0015831537,0.33184376,0.053398326,0.35388315,0.005592629,0.24379107],"study_design_scores_gemma":[0.00006491951,0.00022670334,0.00053234986,0.000047695576,0.000052083666,0.0003721171,0.000218281,0.82941216,0.03658077,0.12415042,0.008262797,0.00007970917],"about_ca_topic_score_codex":0.0010663546,"about_ca_topic_score_gemma":0.00095673226,"teacher_disagreement_score":0.0032651268,"about_ca_system_score_codex":0.0011548948,"about_ca_system_score_gemma":0.0016890286,"threshold_uncertainty_score":0.017267823},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13856132,0.000891609,0.7200787,0.0012133835,0.00047615377,0.0006309234,0.0003612959,0.10462601,0.033160586],"genre_scores_gemma":[0.864326,0.00048222567,0.12037175,0.00077946385,0.00011161488,0.00016621339,0.00039066892,0.0025545137,0.010817513],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983353,0.00041211717,0.00006982862,0.0002337466,0.0006229368,0.00032612064],"domain_scores_gemma":[0.99654716,0.00086107815,0.00031851782,0.001546878,0.00041218268,0.00031416665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014537105,0.0012203685,0.00078549376,0.0015459659,0.0010760326,0.0022107605,0.0019926832,0.0012285876,0.0047841202],"category_scores_gemma":[0.005370237,0.0006453512,0.0003954947,0.0007692226,0.001968745,0.0043296763,0.0033298589,0.0014741907,0.0022610377],"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.0047431905,0.0009692034,0.021456683,0.0006944502,0.0004175602,0.0020740938,0.0034961586,0.03696901,0.1698114,0.045474775,0.06933727,0.64455616],"study_design_scores_gemma":[0.00029725232,0.001520268,0.006009489,0.00022074627,0.00019270915,0.001630165,0.00076126284,0.60816324,0.23321633,0.049421713,0.098303944,0.0002629765],"about_ca_topic_score_codex":0.0028336155,"about_ca_topic_score_gemma":0.002282057,"teacher_disagreement_score":0.0047841202,"about_ca_system_score_codex":0.00082147744,"about_ca_system_score_gemma":0.0010024245,"threshold_uncertainty_score":0.016004443},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37370077,0.0012503916,0.5733015,0.0011489212,0.00070701615,0.00040355316,0.00067916804,0.032243524,0.016565206],"genre_scores_gemma":[0.851401,0.00018137961,0.14339322,0.00018187882,0.0000767762,0.00018336844,0.000719811,0.00084664236,0.0030160723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992513,0.0001919769,0.000030158844,0.00015451956,0.00017809159,0.00019400327],"domain_scores_gemma":[0.9988212,0.00028748615,0.0000767554,0.00034927003,0.00019652775,0.00026865644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012935053,0.00072419987,0.00064689905,0.00035685019,0.0010489168,0.0010077188,0.0022517594,0.0004707203,0.0026870742],"category_scores_gemma":[0.0026600598,0.00036951952,0.00037767735,0.00055843306,0.0007266246,0.0011205075,0.0015840348,0.0009657301,0.0005820603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.0013459704,0.00033397175,0.0055116457,0.00017249167,0.00014010708,0.00025885203,0.00040367,0.8009554,0.021992022,0.015474715,0.034890316,0.118520804],"study_design_scores_gemma":[0.000083693616,0.00008365723,0.00042796548,0.0000035724893,0.0000089422465,0.000015862843,0.00005173059,0.990108,0.0028219647,0.003278052,0.0031051529,0.000011408005],"about_ca_topic_score_codex":0.011371263,"about_ca_topic_score_gemma":0.015936866,"teacher_disagreement_score":0.011371263,"about_ca_system_score_codex":0.0012948199,"about_ca_system_score_gemma":0.0021220904,"threshold_uncertainty_score":0.022610128},"labels":[],"label_agreement":null}]}