{"meta":{"query_hash":"59fe791cdce3","filters":{"venue":"IEEE Transactions on Networking"},"cohort_total":21,"direct_labels_cover":0,"predictions_cover":21,"exported":21,"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/59fe791cdce3","api":"https://metacan.xera.ac/api/v1/cohort?venue=IEEE+Transactions+on+Networking"},"results":[{"id":"W4403420245","doi":"10.1109/tnet.2024.3474888","title":"A Resource-Efficient Content Sharing Mechanism in Large-Scale UAV Named Data Networking","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Networking","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Beijing University of Posts and Telecommunications; National Natural Science Foundation of China","keywords":"Computer science; Mechanism (biology); Resource (disambiguation); Scale (ratio); Shared resource; Content (measure theory); Data sharing; World Wide Web; Distributed computing; Computer network; Geography; Mathematics","score_opus":0.07088437641741967,"score_gpt":0.2639037212132092,"score_spread":0.19301934479578953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403420245","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.07926288,0.0004665213,0.9155591,0.00036495202,0.000082978375,0.00021585812,0.00007632423,0.000286308,0.0036850995],"genre_scores_gemma":[0.9008756,0.00021640949,0.09692144,0.000093425704,0.00004273899,0.00014876202,0.00006397205,0.000023904493,0.0016137258],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983103,0.0007255561,0.000095446194,0.00034096243,0.00036023767,0.00016752623],"domain_scores_gemma":[0.9974362,0.0009729715,0.0005302091,0.00048998836,0.00032900937,0.00024166756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026779543,0.0005574543,0.00088447065,0.0008349749,0.0013299469,0.0011999038,0.0024589451,0.0011887165,0.0012831796],"category_scores_gemma":[0.0040015304,0.0003153049,0.0006030845,0.0011980331,0.0011650365,0.0029158706,0.0018241353,0.00061415345,0.00019961491],"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.00073757116,0.0004206327,0.002532023,0.0005015414,0.00020478018,0.0009845811,0.00073135627,0.45356306,0.036812346,0.3812776,0.006706161,0.1155284],"study_design_scores_gemma":[0.00005549562,0.0001638172,0.00033686336,0.0000193235,0.000028245438,0.0002668336,0.00008573464,0.9533211,0.0032690098,0.037804645,0.004612307,0.000036582132],"about_ca_topic_score_codex":0.0011379957,"about_ca_topic_score_gemma":0.0007045648,"teacher_disagreement_score":0.0026779543,"about_ca_system_score_codex":0.0015261983,"about_ca_system_score_gemma":0.0011804142,"threshold_uncertainty_score":0.014162481},"labels":[],"label_agreement":null},{"id":"W4403863187","doi":"10.1109/tnet.2024.3481152","title":"Enabling Rank-Based P4 Programmable Schedulers: Requirements, Implementation, and Evaluation on BMv2 Switches","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Networking","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Rank (graph theory); Computer architecture; Embedded system; Mathematics","score_opus":0.05843924637607877,"score_gpt":0.3312098925092904,"score_spread":0.2727706461332116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403863187","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8552353,0.00015706196,0.1316936,0.00020557249,0.00008816564,0.00038093823,0.00019461152,0.0054500443,0.0065947836],"genre_scores_gemma":[0.93616116,0.0000964144,0.061175067,0.00008554894,0.000010220659,0.000107473345,0.00017057791,0.00018896062,0.0020045852],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989243,0.00030679427,0.00005540023,0.00009340559,0.0003880855,0.00023205733],"domain_scores_gemma":[0.99843866,0.0005830439,0.00016239008,0.0002741361,0.00039012646,0.00015165593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001735707,0.0005970189,0.00027169107,0.0003059183,0.0003715875,0.0008721373,0.002022111,0.0003386127,0.002002182],"category_scores_gemma":[0.003486672,0.00022063243,0.00019781456,0.00030679512,0.0005467205,0.0011964086,0.0006772494,0.0007760829,0.00023256772],"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.0050902786,0.0024850196,0.017015075,0.0010665369,0.00014534636,0.0011334185,0.0012142666,0.45602173,0.25992614,0.043502066,0.008317426,0.20408273],"study_design_scores_gemma":[0.00026169876,0.0015590746,0.0019708325,0.000025842366,0.000040017956,0.000121078636,0.00021133795,0.8244093,0.16306962,0.001943461,0.0063364063,0.000051301624],"about_ca_topic_score_codex":0.0071068243,"about_ca_topic_score_gemma":0.00469383,"teacher_disagreement_score":0.0071068243,"about_ca_system_score_codex":0.0011037835,"about_ca_system_score_gemma":0.0015892491,"threshold_uncertainty_score":0.01413089},"labels":[],"label_agreement":null},{"id":"W4403936631","doi":"10.1109/tnet.2024.3485583","title":"Customized Transmission Protocol for Tile-Based 360° VR Video Streaming Over Core Network Slices","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Networking","topic":"Image and Video Quality Assessment","field":"Computer Science","cited_by":8,"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 Calgary; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tile; Computer science; Protocol (science); Transmission (telecommunications); Core (optical fiber); Computer network; Computer graphics (images); Telecommunications; Materials science; Medicine","score_opus":0.06189477862698434,"score_gpt":0.3648135516108576,"score_spread":0.30291877298387326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403936631","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.107866414,0.00035911537,0.8867699,0.00008547245,0.000103476916,0.00045518778,0.000102701524,0.001922418,0.0023352802],"genre_scores_gemma":[0.85841656,0.0002493144,0.13918501,0.000098722405,0.00003996471,0.00029082352,0.00034340142,0.000115234616,0.001260881],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996182,0.00009212453,0.000060714374,0.000068265865,0.00010233818,0.000058308757],"domain_scores_gemma":[0.9989831,0.00019692321,0.00015678108,0.0002855875,0.00032099365,0.000056543333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007384374,0.0004903397,0.00037996407,0.00047270794,0.00035509656,0.0006406866,0.00093817775,0.00031451683,0.00068650563],"category_scores_gemma":[0.0018371536,0.0002027063,0.0002660202,0.00033243085,0.00033753394,0.00096674834,0.00079326186,0.0007409051,0.00015103834],"study_design_candidate":"not_applicable","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.0009771241,0.0002443691,0.0049749822,0.0005417389,0.00015719292,0.0015847316,0.0010268522,0.095758855,0.5808401,0.036094803,0.0052829026,0.27251634],"study_design_scores_gemma":[0.00006494212,0.0011429667,0.0026150607,0.000049533493,0.00013760576,0.0019122122,0.00023179039,0.8146687,0.16171804,0.004224277,0.0131092835,0.00012552038],"about_ca_topic_score_codex":0.0012418625,"about_ca_topic_score_gemma":0.0010364797,"teacher_disagreement_score":0.0012418625,"about_ca_system_score_codex":0.00046995678,"about_ca_system_score_gemma":0.00062598055,"threshold_uncertainty_score":0.0039052963},"labels":[],"label_agreement":null},{"id":"W4404520331","doi":"10.1109/tnet.2024.3495617","title":"Measuring and Characterizing Propagation of Reuse RSA Certificates and Keys Across PKI Ecosystem","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Networking","topic":"Access Control and Trust","field":"Social Sciences","cited_by":2,"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 Saskatchewan","funders":"","keywords":"Public key infrastructure; Reuse; Computer science; Computer security; Public-key cryptography; Ecology; Biology","score_opus":0.05725401636371177,"score_gpt":0.2926534729287527,"score_spread":0.23539945656504094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404520331","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9959454,0.00012522927,0.0024793802,0.000063223226,0.000007230955,0.000030372874,0.000309863,0.00011977094,0.00091952813],"genre_scores_gemma":[0.99647933,0.000094091,0.0026390501,0.000014066639,0.00000770523,0.000022174061,0.0004739642,0.000015328706,0.0002543645],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9964445,0.0007856298,0.00033632098,0.0007384833,0.0013231528,0.0003719815],"domain_scores_gemma":[0.9720205,0.01034436,0.008037249,0.0046293577,0.003825151,0.0011434224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00360261,0.00031353664,0.00047344752,0.004816191,0.00093702984,0.001896262,0.00089012587,0.0007746104,0.0005253284],"category_scores_gemma":[0.02238059,0.00031863293,0.00034214059,0.0039045082,0.001160325,0.003492653,0.0019354755,0.0009139952,0.0003713421],"study_design_candidate":"observational","study_design_consensus":"observational","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.00029548758,0.00028213297,0.9064244,0.00018654342,0.00019316646,0.0008640475,0.003919537,0.013066364,0.015781077,0.002922433,0.001038735,0.055026103],"study_design_scores_gemma":[0.000038792696,0.0007627074,0.8466111,0.0000968305,0.00019591888,0.00392438,0.006749768,0.10615917,0.02407803,0.003855819,0.007356433,0.000171032],"about_ca_topic_score_codex":0.0033252002,"about_ca_topic_score_gemma":0.0028677925,"teacher_disagreement_score":0.004816191,"about_ca_system_score_codex":0.00083994685,"about_ca_system_score_gemma":0.000767469,"threshold_uncertainty_score":0.019052625},"labels":[],"label_agreement":null},{"id":"W4405231430","doi":"10.1109/tnet.2024.3511333","title":"Communication-Efficient Network Topology in Decentralized Learning: A Joint Design of Consensus Matrix and Resource Allocation","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Networking","topic":"Cooperative Communication and Network Coding","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":"Ericsson (Canada); University of Toronto","funders":"","keywords":"Distributed computing; Network topology; Computer science; Topology (electrical circuits); Resource allocation; Joint (building); Matrix (chemical analysis); Resource (disambiguation); Computer network; Mathematical optimization; Mathematics; Engineering; Combinatorics","score_opus":0.04805965462570868,"score_gpt":0.29261058410770313,"score_spread":0.24455092948199444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405231430","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.008904948,0.000059222908,0.9901057,0.00011641497,0.000017186527,0.000029879768,0.0000117755735,0.0001353195,0.00061947963],"genre_scores_gemma":[0.7569054,0.00017563347,0.24094528,0.00011079146,0.000055801218,0.00037830017,0.0000784619,0.00008083243,0.0012694994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990709,0.00041142848,0.00004341129,0.00018767838,0.00021599754,0.00007052936],"domain_scores_gemma":[0.9974994,0.0011847229,0.0003330262,0.00029878737,0.00054478104,0.00013929997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017528129,0.0006377453,0.0008170206,0.00057632,0.0005415946,0.0007158479,0.0016662974,0.0009892441,0.0008801789],"category_scores_gemma":[0.007629332,0.00041502487,0.00031558127,0.0006808709,0.0010797319,0.001662758,0.0014970561,0.0009052499,0.00027743148],"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.00005487668,0.00004216539,0.0005098717,0.00006926518,0.000019255445,0.000047397156,0.00008523233,0.92217404,0.0042285253,0.021915486,0.0009738016,0.049880035],"study_design_scores_gemma":[0.000008341757,0.0000238402,0.000034783123,0.000002626105,0.0000020422265,0.000015543696,0.000007964566,0.9941665,0.0005275485,0.0049358024,0.0002707191,0.000004222179],"about_ca_topic_score_codex":0.0013340166,"about_ca_topic_score_gemma":0.0016551118,"teacher_disagreement_score":0.0017528129,"about_ca_system_score_codex":0.0006397951,"about_ca_system_score_gemma":0.0012872571,"threshold_uncertainty_score":0.009269834},"labels":[],"label_agreement":null},{"id":"W4406094227","doi":"10.1109/ton.2024.3520530","title":"Toward Optimized Federated Learning With Compressed Communications by Rate Adaption","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Networking","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; National Natural Science Foundation of China; National Research Foundation","keywords":"Computer science; Multimedia; Human–computer interaction","score_opus":0.042038040273129296,"score_gpt":0.2724648518237101,"score_spread":0.2304268115505808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406094227","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040277217,0.00032123787,0.95427555,0.00059477263,0.000052736996,0.000066947985,0.000086750144,0.0020600487,0.0022645944],"genre_scores_gemma":[0.81754756,0.00020690885,0.17830817,0.00053099473,0.00010725642,0.00020533784,0.00029522818,0.00022811476,0.002570375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838245,0.00055654283,0.00007675879,0.00034431246,0.00043788366,0.00020204048],"domain_scores_gemma":[0.9946824,0.002690619,0.00042008725,0.001353691,0.00066883274,0.00018437051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034535711,0.0014632745,0.0015456731,0.0007447326,0.00067305967,0.001374724,0.0028016225,0.0019005121,0.00144487],"category_scores_gemma":[0.01489921,0.0006083849,0.00054262934,0.0009478606,0.001769555,0.0035369433,0.0029961318,0.0028843416,0.0006821095],"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.0002499664,0.00014894892,0.000971685,0.00004989311,0.00004167728,0.000094666495,0.0001207824,0.8976224,0.0021081497,0.012769447,0.0027951838,0.0830272],"study_design_scores_gemma":[0.000010106155,0.000016400685,0.000032546963,0.0000034666668,0.0000029440166,0.000012684617,0.0000062884374,0.9933382,0.00057468755,0.005862014,0.00013746238,0.0000031355364],"about_ca_topic_score_codex":0.0032700982,"about_ca_topic_score_gemma":0.0029268628,"teacher_disagreement_score":0.0034535711,"about_ca_system_score_codex":0.0012169373,"about_ca_system_score_gemma":0.0019470166,"threshold_uncertainty_score":0.018264413},"labels":[],"label_agreement":null},{"id":"W4406729011","doi":"10.1109/ton.2025.3530460","title":"Exploring Temporal Similarity for Joint Computation and Communication in Online Distributed Optimization","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Networking","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); Ontario Tech University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Joint (building); Computer science; Computation; Similarity (geometry); Artificial intelligence; Distributed computing; Algorithm; Engineering","score_opus":0.10655535451767793,"score_gpt":0.2887770755511856,"score_spread":0.18222172103350764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406729011","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.030014006,0.00024194237,0.9677811,0.00034374188,0.00004226547,0.000031116077,0.000014542605,0.00018134475,0.0013499667],"genre_scores_gemma":[0.89669657,0.00020083178,0.10125049,0.00016188926,0.000071956,0.00011322728,0.000042423682,0.0000816762,0.0013809022],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986382,0.00044804104,0.00006840647,0.00030364934,0.00035730898,0.0001843575],"domain_scores_gemma":[0.9954703,0.0032287561,0.0004190616,0.00032887392,0.00036121233,0.00019180906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002377291,0.00092878344,0.0012386806,0.00044435938,0.0006941245,0.0012838164,0.0017559471,0.001060905,0.0013722191],"category_scores_gemma":[0.008559079,0.00047393178,0.00047982542,0.0008050002,0.001503986,0.002456525,0.0021795272,0.0018308399,0.00019264732],"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.00015251224,0.00008700268,0.0004943963,0.000055011482,0.000027564813,0.00005678231,0.00008281665,0.94815224,0.0016749467,0.024921885,0.00055568793,0.02373923],"study_design_scores_gemma":[0.00000680636,0.000019923249,0.000024645396,0.0000012471986,0.0000018532411,0.0000038717685,0.0000046653436,0.9952673,0.00022376623,0.004371992,0.00007207529,0.0000017998632],"about_ca_topic_score_codex":0.0032974004,"about_ca_topic_score_gemma":0.0025907932,"teacher_disagreement_score":0.0032974004,"about_ca_system_score_codex":0.0012593775,"about_ca_system_score_gemma":0.0020213202,"threshold_uncertainty_score":0.012572467},"labels":[],"label_agreement":null},{"id":"W4411337101","doi":"10.1109/ton.2025.3577974","title":"Conflux: A Multi-Homed Adaptive Bitrate Protocol for On-Site Live Video Streaming","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Networking","topic":"Image and Video Quality Assessment","field":"Computer Science","cited_by":0,"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","keywords":"Computer science; Live streaming; Multimedia; Protocol (science); Computer network; Medicine","score_opus":0.07004308864662626,"score_gpt":0.3600312389024541,"score_spread":0.2899881502558278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411337101","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040416032,0.0020841183,0.92115587,0.00056672224,0.00029069674,0.0011133788,0.00068959105,0.01869474,0.01498886],"genre_scores_gemma":[0.7516757,0.001726841,0.22708695,0.0011739708,0.00025608044,0.0014260793,0.0027497616,0.0009720918,0.012932523],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989524,0.00020880121,0.000069797854,0.00011852493,0.00051048474,0.00014001121],"domain_scores_gemma":[0.99870145,0.000250139,0.00017997842,0.0002609205,0.00051293575,0.00009452701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015468186,0.0006806718,0.0006336548,0.0011618105,0.00068864744,0.0011478765,0.0019153648,0.0007115385,0.0020950732],"category_scores_gemma":[0.0027246238,0.00024873402,0.00036808578,0.0006418631,0.0005310688,0.0014099167,0.0018568601,0.0014238491,0.0006819821],"study_design_candidate":"not_applicable","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.0016755804,0.00062078837,0.002172477,0.00076425367,0.00022628934,0.0011565458,0.0007257173,0.061507616,0.16203627,0.069236614,0.06677988,0.63309795],"study_design_scores_gemma":[0.00041754651,0.0014777851,0.0019053179,0.0001415107,0.000114608454,0.002086649,0.000159331,0.79485464,0.086897045,0.011538064,0.100181535,0.00022605903],"about_ca_topic_score_codex":0.0032245405,"about_ca_topic_score_gemma":0.0024670898,"teacher_disagreement_score":0.0032245405,"about_ca_system_score_codex":0.0010820564,"about_ca_system_score_gemma":0.0013300215,"threshold_uncertainty_score":0.0081804395},"labels":[],"label_agreement":null},{"id":"W4412345723","doi":"10.1109/ton.2025.3586010","title":"Grace: Toward Routing in Dynamic Network Environments With Graph Embedding","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Networking","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":4,"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 Toronto","funders":"National Natural Science Foundation of China","keywords":"Embedding; Computer science; Routing (electronic design automation); Computer network; Artificial intelligence","score_opus":0.007340580237367521,"score_gpt":0.2278824791033344,"score_spread":0.22054189886596687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412345723","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.013874176,0.0001444694,0.9825996,0.00036291903,0.000037322738,0.000034850877,0.000048331185,0.0011988893,0.0016993865],"genre_scores_gemma":[0.5699923,0.0003839953,0.42312992,0.000509282,0.00007673002,0.00024197041,0.000380355,0.00033303344,0.0049524144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996356,0.00011695417,0.0000140475895,0.00010710111,0.00007620819,0.00005005272],"domain_scores_gemma":[0.99908257,0.0004737926,0.00010962836,0.00014101391,0.00011574757,0.00007725045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000884799,0.0012202563,0.0008267053,0.0005460737,0.00041947872,0.0007794563,0.001823538,0.0011456182,0.0017522558],"category_scores_gemma":[0.0030143403,0.0005656236,0.0006018015,0.00043563184,0.0010978088,0.0019672324,0.0017425416,0.0020033885,0.00047033344],"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.000039230028,0.00004263459,0.00050435495,0.00003772849,0.000023975304,0.00003514221,0.00004491701,0.9418124,0.0013977359,0.015186156,0.0021207354,0.03875502],"study_design_scores_gemma":[0.0000026678372,0.000006622624,0.000015307798,0.0000014347968,0.00000136324,0.0000028364066,0.0000026532275,0.99545324,0.00013731528,0.0041633374,0.00021185132,0.0000013049378],"about_ca_topic_score_codex":0.0053157564,"about_ca_topic_score_gemma":0.00663877,"teacher_disagreement_score":0.0053157564,"about_ca_system_score_codex":0.0010746159,"about_ca_system_score_gemma":0.001196759,"threshold_uncertainty_score":0.010569632},"labels":[],"label_agreement":null},{"id":"W4412722433","doi":"10.1109/ton.2025.3587916","title":"Deterministic Scheduling and Network Structure Optimization for Time-Critical Computing Tasks in Industrial IoT","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Networking","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Scheduling (production processes); Distributed computing; Internet of Things; Mathematical optimization; Embedded system; Mathematics","score_opus":0.021395068978307622,"score_gpt":0.27361013734794776,"score_spread":0.25221506836964014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412722433","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.03412797,0.00023399996,0.9609663,0.0003299474,0.00004952473,0.000050873972,0.00005208265,0.00017768466,0.004011674],"genre_scores_gemma":[0.8161243,0.00044139917,0.17965083,0.00012499238,0.00007056193,0.00014210821,0.00014635894,0.0001168782,0.0031825828],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994943,0.00013211126,0.000020485993,0.00012209559,0.00011587569,0.000114986884],"domain_scores_gemma":[0.9992736,0.00040986188,0.000117862044,0.00006216013,0.000082255625,0.000054262855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007339854,0.0007293536,0.0005862438,0.00038186557,0.00063468626,0.00066217687,0.00083800254,0.0005699791,0.0012580239],"category_scores_gemma":[0.0022958498,0.00041974895,0.00051615026,0.0005380377,0.00064000767,0.0009285171,0.00076293777,0.0006983768,0.00014655155],"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.000036172776,0.000018258801,0.0001817412,0.000024992858,0.0000070615774,0.000015866139,0.000024172494,0.9774721,0.0009108933,0.011521873,0.00055261754,0.009234179],"study_design_scores_gemma":[0.000004391772,0.000009057831,0.00006319018,0.0000015947866,0.0000023991045,0.0000034484367,0.000008473164,0.9939772,0.00023350454,0.0054272204,0.00026722963,0.000002282414],"about_ca_topic_score_codex":0.0067529357,"about_ca_topic_score_gemma":0.0069962647,"teacher_disagreement_score":0.0067529357,"about_ca_system_score_codex":0.0016549928,"about_ca_system_score_gemma":0.0018534695,"threshold_uncertainty_score":0.013427258},"labels":[],"label_agreement":null},{"id":"W4412722547","doi":"10.1109/ton.2025.3589553","title":"INCC: In-Network Congestion Control With Proactive Bottleneck Awareness","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Networking","topic":"Network Traffic and Congestion Control","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":"University of Waterloo","funders":"National Key Research and Development Program of China; Beijing Nova Program; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Bottleneck; Network congestion; Control (management); Computer science; Computer network; Business; Artificial intelligence","score_opus":0.008432641474071963,"score_gpt":0.22586281675768932,"score_spread":0.21743017528361736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412722547","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.022866132,0.001005596,0.935733,0.00068436994,0.0007639407,0.0007144017,0.00032389344,0.02298589,0.014922725],"genre_scores_gemma":[0.70251447,0.0010509219,0.27688032,0.000890974,0.00066924427,0.0007369901,0.0011097142,0.001348693,0.0147986375],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985904,0.00021986601,0.0000846327,0.00027625653,0.00059878797,0.00023004565],"domain_scores_gemma":[0.99811757,0.00032550766,0.00024621183,0.00036971417,0.0007168409,0.00022419017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017570382,0.0013205796,0.0006734295,0.0016895907,0.0009296555,0.0017178686,0.0038147655,0.0009498504,0.003952767],"category_scores_gemma":[0.003006126,0.00043128993,0.00047345474,0.0007805817,0.00093666074,0.001792881,0.001792272,0.0014635971,0.0010366011],"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.0008949533,0.001027434,0.004614276,0.0007795008,0.00029921456,0.00074278447,0.0005605888,0.17567652,0.0903396,0.06345088,0.08049606,0.5811182],"study_design_scores_gemma":[0.00021312361,0.0004992061,0.0014576626,0.000051683106,0.00013754693,0.0005651855,0.00007411062,0.8836127,0.052321915,0.008108921,0.052800193,0.00015786805],"about_ca_topic_score_codex":0.00701337,"about_ca_topic_score_gemma":0.00556483,"teacher_disagreement_score":0.00701337,"about_ca_system_score_codex":0.0013506474,"about_ca_system_score_gemma":0.002387784,"threshold_uncertainty_score":0.013945103},"labels":[],"label_agreement":null},{"id":"W4412795602","doi":"10.1109/ton.2025.3589342","title":"A Mixed-Integer Bi-Level Model for Joint Optimal Edge Resource Pricing and Provisioning","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Networking","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","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":"BC Studies","funders":"","keywords":"Provisioning; Enhanced Data Rates for GSM Evolution; Joint (building); Integer programming; Integer (computer science); Resource (disambiguation); Computer science; Mathematical optimization; Business; Mathematics; Computer network; Engineering; Telecommunications","score_opus":0.07147286545131806,"score_gpt":0.2445094101378791,"score_spread":0.17303654468656104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412795602","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.0142603945,0.0005286538,0.97042525,0.0010468584,0.00013637399,0.00008527558,0.0004583664,0.00022783024,0.012830984],"genre_scores_gemma":[0.77469856,0.001049825,0.19833887,0.0006130341,0.00015425125,0.0005849197,0.00077714137,0.00019065039,0.02359276],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987098,0.000494936,0.000046512836,0.00024278008,0.0002488854,0.00025710565],"domain_scores_gemma":[0.9980592,0.0012234662,0.00023073383,0.00006881096,0.00025646665,0.00016124833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022069255,0.0014043669,0.001924472,0.0006987763,0.00068704993,0.0034656494,0.0023588908,0.0030708602,0.008810551],"category_scores_gemma":[0.0041163946,0.0012097677,0.0013323671,0.001401034,0.0014153813,0.0021038735,0.0018769053,0.0034833187,0.0009835815],"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.000032782686,0.000026083648,0.00021082118,0.00004338724,0.000017522725,0.00006480068,0.000019700372,0.9761973,0.00020692914,0.020434266,0.0008059674,0.0019403911],"study_design_scores_gemma":[0.0000056685144,0.0000057323746,0.000026230577,0.0000031005047,0.000003496006,0.00000440508,0.000005546701,0.9971917,0.000028445553,0.0025017818,0.00022101519,0.0000028536942],"about_ca_topic_score_codex":0.012409121,"about_ca_topic_score_gemma":0.009785936,"teacher_disagreement_score":0.012409121,"about_ca_system_score_codex":0.0020208152,"about_ca_system_score_gemma":0.0025705711,"threshold_uncertainty_score":0.029474199},"labels":[],"label_agreement":null},{"id":"W4412795683","doi":"10.1109/ton.2025.3591401","title":"E2E Performance Modeling for Slice-Based Video Streaming With Layered Encoding","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Networking","topic":"Image and Video Quality Assessment","field":"Computer Science","cited_by":0,"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 Calgary; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Encoding (memory); Computer science; Artificial intelligence","score_opus":0.03567703929807289,"score_gpt":0.2848560527987774,"score_spread":0.2491790135007045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412795683","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.049571365,0.00072349637,0.943589,0.00021533476,0.000043285512,0.000069786656,0.00018638301,0.00028778368,0.0053136386],"genre_scores_gemma":[0.95355856,0.001268525,0.041307434,0.000080468686,0.000045427885,0.00011966599,0.00021100428,0.000051098355,0.003357782],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995369,0.00010900448,0.000023370198,0.00008216627,0.00016133372,0.00008730294],"domain_scores_gemma":[0.9995197,0.00018725217,0.000084776846,0.00003309641,0.00015342381,0.000021602873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006831094,0.00095571956,0.0005533585,0.0005395637,0.00041914254,0.00093849015,0.001273682,0.00078688946,0.0012037932],"category_scores_gemma":[0.0014237548,0.000292936,0.0006588381,0.00058887753,0.00040940742,0.0013904393,0.00062746607,0.0008124603,0.00031864172],"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.000028097837,0.000022329603,0.0006393291,0.00003548307,0.000012758236,0.0001235831,0.0000582103,0.9753228,0.0043058707,0.013472063,0.00038121673,0.005598299],"study_design_scores_gemma":[4.865228e-7,0.000006443109,0.00005488088,0.0000013010779,0.0000019687625,0.000010842248,0.000005118146,0.9990012,0.00017428187,0.00064573623,0.000095586234,0.000002149663],"about_ca_topic_score_codex":0.012088739,"about_ca_topic_score_gemma":0.0049059433,"teacher_disagreement_score":0.012088739,"about_ca_system_score_codex":0.001413758,"about_ca_system_score_gemma":0.0010187513,"threshold_uncertainty_score":0.024036765},"labels":[],"label_agreement":null},{"id":"W4412986282","doi":"10.1109/ton.2025.3591933","title":"SC <sup>3</sup> -MDRA: A New Approach to Coordinating Bi-Level Age of Information in AAV-Enabled 6G Integrated Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Networking","topic":"Age of Information Optimization","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":"University of Victoria","funders":"Fundamental Research Funds for the Central Universities; Natural Science Foundation of Hebei Province; National Natural Science Foundation of China","keywords":"Chemistry; Physics","score_opus":0.02056570086020206,"score_gpt":0.23411418651486907,"score_spread":0.213548485654667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412986282","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.013747483,0.00038958646,0.97913045,0.0003398484,0.00008294489,0.000067343426,0.00010746548,0.00037469593,0.005760205],"genre_scores_gemma":[0.7608841,0.0007160667,0.22949891,0.00028225535,0.00012406935,0.00014122893,0.0001960315,0.00009300452,0.0080642365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904436,0.00022586281,0.000047229685,0.000251141,0.00025933233,0.00017190521],"domain_scores_gemma":[0.9991208,0.00017822499,0.0001371517,0.00019912414,0.00024359771,0.00012112509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010792932,0.000869367,0.0008571449,0.00043193178,0.0006827843,0.0024470435,0.0026255397,0.0013816995,0.0015588825],"category_scores_gemma":[0.0015663763,0.0004434805,0.0006019733,0.0010138405,0.0010463333,0.0026234488,0.002279582,0.0019140963,0.00052783726],"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.00017223161,0.00011552976,0.0013323175,0.00011813645,0.00007925779,0.00024259777,0.00022113713,0.7664426,0.014656123,0.13541305,0.004799706,0.076407224],"study_design_scores_gemma":[0.0000051035245,0.000052651136,0.000095298805,0.0000070313204,0.00001756534,0.00004954818,0.00002883259,0.9844328,0.0010853807,0.009825531,0.0043887184,0.000011486687],"about_ca_topic_score_codex":0.011680386,"about_ca_topic_score_gemma":0.014943386,"teacher_disagreement_score":0.011680386,"about_ca_system_score_codex":0.0017900928,"about_ca_system_score_gemma":0.0023515755,"threshold_uncertainty_score":0.02322483},"labels":[],"label_agreement":null},{"id":"W4413359437","doi":"10.1109/ton.2025.3598595","title":"On Optimal Server Allocation for a Loss System With Moldable Jobs","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Networking","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","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 Waterloo","funders":"","keywords":"Computer science; Computer network","score_opus":0.011240384405235103,"score_gpt":0.22570254753453708,"score_spread":0.21446216312930197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413359437","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.31813696,0.00420027,0.6514909,0.0034776707,0.00049335154,0.0004614181,0.00079523074,0.0012352028,0.019709004],"genre_scores_gemma":[0.93961,0.0015175065,0.044190146,0.00043085212,0.00021920189,0.00023903743,0.00042384723,0.0004488974,0.012920468],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858415,0.00039552693,0.000061337305,0.00022244317,0.00018552195,0.0005510927],"domain_scores_gemma":[0.9949582,0.0033208532,0.00043397018,0.00019053914,0.0004793329,0.0006170778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021534571,0.0020041687,0.002647417,0.0013727805,0.0016488855,0.0029557787,0.002274048,0.0021380088,0.009195309],"category_scores_gemma":[0.009692151,0.0011532414,0.00082243653,0.000990918,0.0027498533,0.0030352224,0.0027881279,0.0019303306,0.0011862387],"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.0004173836,0.000069311565,0.0005637038,0.00014596927,0.000028463317,0.00012928128,0.00009340188,0.9709594,0.0019262028,0.018296264,0.0024314988,0.004939122],"study_design_scores_gemma":[0.000026998583,0.000038328104,0.000124175,0.000010706571,0.0000071590307,0.000016469972,0.000041421896,0.9920426,0.00021933569,0.007203846,0.00025749026,0.000011474682],"about_ca_topic_score_codex":0.011961159,"about_ca_topic_score_gemma":0.0075700697,"teacher_disagreement_score":0.011961159,"about_ca_system_score_codex":0.003392784,"about_ca_system_score_gemma":0.0027100272,"threshold_uncertainty_score":0.030761361},"labels":[],"label_agreement":null},{"id":"W4413478210","doi":"10.1109/ton.2025.3583308","title":"Age-of-Information Minimization With Weight Limits for Semi-Asynchronous Online Distributed Optimization","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Networking","topic":"Age of Information Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); Ontario Tech University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Asynchronous communication; Minification; Computer science; Mathematical optimization; Distributed computing; Mathematics; Computer network; World Wide Web","score_opus":0.009984052237595681,"score_gpt":0.22689563001713187,"score_spread":0.21691157777953618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413478210","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.011278576,0.00018413736,0.9867488,0.00020975409,0.000041066854,0.000025858535,0.000024168727,0.00008871921,0.0013989494],"genre_scores_gemma":[0.88530535,0.00041087734,0.10857611,0.00019640286,0.00010376942,0.00020828069,0.00007774231,0.000102756465,0.0050188107],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987324,0.00043342626,0.00006740035,0.00027183405,0.00032792357,0.00016705404],"domain_scores_gemma":[0.99700457,0.0018687567,0.00039555226,0.00018823102,0.0004019154,0.00014099195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002861077,0.0012643419,0.0010675173,0.00045216884,0.00043115654,0.0014039335,0.0014427972,0.0010136251,0.0016637335],"category_scores_gemma":[0.007191847,0.00048708834,0.00048406565,0.00061721826,0.0011593562,0.0017503517,0.001405302,0.0019278299,0.00026585843],"study_design_candidate":"theoretical_or_conceptual","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.000053749216,0.00004177216,0.0002708531,0.00005688766,0.000020753378,0.000046424422,0.000050110386,0.965115,0.0011768414,0.021692885,0.0005039754,0.010970672],"study_design_scores_gemma":[0.0000026736554,0.000011502697,0.000022876893,0.0000019096492,0.0000018135872,0.0000036116883,0.0000030617175,0.9960156,0.00017379051,0.0036537794,0.00010758756,0.000001775657],"about_ca_topic_score_codex":0.0022130958,"about_ca_topic_score_gemma":0.0015229638,"teacher_disagreement_score":0.002861077,"about_ca_system_score_codex":0.0015555004,"about_ca_system_score_gemma":0.0015859251,"threshold_uncertainty_score":0.015131056},"labels":[],"label_agreement":null},{"id":"W4414404930","doi":"10.1109/ton.2025.3605104","title":"Learning to Balance Utility and Delay in Bipartite Queueing Networks With Sample Path Constraints","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Networking","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","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":"Queen's University","funders":"","keywords":"Queueing theory; Layered queueing network; Routing (electronic design automation); Bipartite graph; Regret; Quality of service; Path (computing); Constraint (computer-aided design); Range (aeronautics)","score_opus":0.009794529342139794,"score_gpt":0.2280464038434332,"score_spread":0.2182518745012934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414404930","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.043623157,0.00023954504,0.95342803,0.00039561206,0.00003988946,0.0000798937,0.00008548786,0.0005394983,0.0015689055],"genre_scores_gemma":[0.87247366,0.00026272825,0.12243461,0.0004117951,0.00008861706,0.00019555575,0.00021553188,0.00019632226,0.0037212505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984493,0.00066345424,0.00004946473,0.00029320817,0.00019581169,0.0003487327],"domain_scores_gemma":[0.9923287,0.0060364045,0.0005149697,0.0003018399,0.0004046753,0.0004134296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038770132,0.0014177549,0.0018167341,0.0006579847,0.0007256192,0.0014658922,0.0021964053,0.001832342,0.0025096484],"category_scores_gemma":[0.010621859,0.00093044946,0.0005961521,0.0011325328,0.001575281,0.002672405,0.001837857,0.002404647,0.00045432826],"study_design_candidate":"theoretical_or_conceptual","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.00014519035,0.00008721783,0.00039014692,0.000043642965,0.000022050059,0.000022598808,0.000036961745,0.9719448,0.0004945625,0.009674411,0.00093946216,0.016198976],"study_design_scores_gemma":[0.000010082041,0.000013058322,0.000030280804,0.0000020871466,0.0000024395379,0.0000040088757,0.000004891816,0.9947812,0.00014547266,0.004938562,0.000065847016,0.0000020970388],"about_ca_topic_score_codex":0.0064494223,"about_ca_topic_score_gemma":0.0059915567,"teacher_disagreement_score":0.0064494223,"about_ca_system_score_codex":0.0025868374,"about_ca_system_score_gemma":0.0025902044,"threshold_uncertainty_score":0.020503879},"labels":[],"label_agreement":null},{"id":"W4415743617","doi":"10.1109/ton.2025.3624648","title":"Achieving Lightweight Path Validation and Packet Modification Detection in Software-Defined Networks","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Networking","topic":"Software-Defined Networks and 5G","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 Victoria","funders":"National Natural Science Foundation of China","keywords":"Network packet; Forwarding plane; Payload (computing); Path (computing); Multiprotocol Label Switching; Overhead (engineering); Node (physics); Packet loss","score_opus":0.018095939091023427,"score_gpt":0.2449918824473731,"score_spread":0.2268959433563497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415743617","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.22111993,0.00034750794,0.77427053,0.00017504454,0.00006854764,0.00014741873,0.00005603206,0.0025111972,0.0013038449],"genre_scores_gemma":[0.9472724,0.00007879509,0.052075554,0.000050726027,0.000014248455,0.00004275868,0.00006317358,0.000043306296,0.00035902575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976381,0.00050109514,0.00020006747,0.0003225274,0.0010677243,0.00027054673],"domain_scores_gemma":[0.9939539,0.0019484924,0.0009638145,0.0020262746,0.0009605597,0.0001469994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019070565,0.00066458853,0.0004620994,0.0006811309,0.00056039874,0.0007962207,0.00150881,0.00057449995,0.00050771376],"category_scores_gemma":[0.00655991,0.00032913074,0.00031445205,0.00044786025,0.0009630917,0.0025905482,0.001658812,0.0010737655,0.00014262865],"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.0011934541,0.00030203548,0.013855097,0.000320411,0.0001246178,0.00040668904,0.00032154238,0.41858783,0.21989278,0.027054274,0.0020625603,0.3158787],"study_design_scores_gemma":[0.000025994077,0.00023144265,0.001176667,0.00001731422,0.000021992406,0.00015282856,0.000032970398,0.9357901,0.055150107,0.006186958,0.0011865327,0.000027098165],"about_ca_topic_score_codex":0.001296786,"about_ca_topic_score_gemma":0.0010588185,"teacher_disagreement_score":0.0019070565,"about_ca_system_score_codex":0.00093516486,"about_ca_system_score_gemma":0.0012381314,"threshold_uncertainty_score":0.010085583},"labels":[],"label_agreement":null},{"id":"W4416050529","doi":"10.1109/ton.2025.3646971","title":"From 5G RAN Queue Dynamics to Playback: A Performance Analysis for QUIC Video Streaming","year":2025,"lang":"en","type":"preprint","venue":"IEEE Transactions on Networking","topic":"Image and Video Quality Assessment","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Agenția Națională pentru Cercetare și Dezvoltare","keywords":"Network congestion; Queueing theory; Latency (audio); Queue; Active queue management; Dynamic Adaptive Streaming over HTTP; Cellular network; Quality of experience; Protocol (science); Network dynamics","score_opus":0.033459957245696274,"score_gpt":0.3115114443347758,"score_spread":0.2780514870890795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416050529","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9284499,0.0044319383,0.046119753,0.0008377001,0.0001456053,0.00026928092,0.001121574,0.00091723714,0.017706856],"genre_scores_gemma":[0.9962794,0.00044720367,0.002120765,0.0000781293,0.000032125634,0.000026043288,0.0002967812,0.000033802367,0.00068573054],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989365,0.00014973215,0.000036504585,0.0001595629,0.00043775825,0.00027993188],"domain_scores_gemma":[0.99708384,0.0014508547,0.00024938516,0.00013837486,0.000888841,0.00018871279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016363825,0.00096107234,0.00064167293,0.0015755646,0.0007107154,0.0014109731,0.00090005895,0.0006418518,0.0018077596],"category_scores_gemma":[0.0051372442,0.00023632434,0.00040546746,0.0013748194,0.0005900895,0.0010228733,0.0006850152,0.0010441128,0.00033926024],"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.0017554868,0.0008625976,0.047312498,0.0005660988,0.0002696672,0.0013108926,0.0007579762,0.76730657,0.042266645,0.024205718,0.0065519228,0.106833935],"study_design_scores_gemma":[0.000011150935,0.00041333333,0.011117748,0.000034032328,0.00005133815,0.00016707774,0.00020083471,0.9830224,0.0028561684,0.0012329221,0.0008604023,0.000032577787],"about_ca_topic_score_codex":0.02567749,"about_ca_topic_score_gemma":0.01770664,"teacher_disagreement_score":0.02567749,"about_ca_system_score_codex":0.0022257788,"about_ca_system_score_gemma":0.0015029495,"threshold_uncertainty_score":0.051056087},"labels":[],"label_agreement":null},{"id":"W4417051969","doi":"10.1109/ton.2025.3636013","title":"Energy Harvesting in Solar-Powered UAV Communication With Rate Splitting Multiple Access","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Networking","topic":"UAV Applications and Optimization","field":"Engineering","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 Ottawa","funders":"Nanyang Technological University; Agency for Science, Technology and Research; National Science Foundation","keywords":"Resource allocation; Energy harvesting; Lyapunov optimization; Wireless; Markov decision process; Communications system; Optimization problem; Throughput; Resource management (computing); Adaptability","score_opus":0.015366749938785479,"score_gpt":0.23906920828096123,"score_spread":0.22370245834217575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417051969","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.17171645,0.0013133886,0.8164748,0.00052937004,0.00008259918,0.000043795986,0.000046048004,0.00012799911,0.009665622],"genre_scores_gemma":[0.99382126,0.00016654946,0.0049015773,0.000023299357,0.000009561309,0.000013956336,0.0000070787664,0.0000044988465,0.0010522014],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99985564,0.000047429603,0.0000048598768,0.00003607077,0.000032822365,0.000023192804],"domain_scores_gemma":[0.99985015,0.00008055932,0.000029432675,0.000008811026,0.000020850102,0.000010201007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031554096,0.00028025507,0.000319308,0.00011628336,0.00021336896,0.00042949273,0.0003459718,0.00037831516,0.00068678346],"category_scores_gemma":[0.00045640793,0.00014824784,0.0002620034,0.00016065977,0.0003773894,0.0003423411,0.000418556,0.00036843753,0.00006988709],"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.00005334313,0.000021652242,0.0006263137,0.000043562482,0.000018822238,0.00017887514,0.00004896829,0.9761765,0.0054545174,0.006727062,0.00034147888,0.010308835],"study_design_scores_gemma":[0.0000022235358,0.000019391777,0.00008507884,0.0000013650204,0.0000022144848,0.000010414801,0.000005589766,0.99857044,0.00028792644,0.00092161767,0.000091945236,0.0000017852918],"about_ca_topic_score_codex":0.0023695054,"about_ca_topic_score_gemma":0.0018963595,"teacher_disagreement_score":0.0023695054,"about_ca_system_score_codex":0.00034670316,"about_ca_system_score_gemma":0.0003013136,"threshold_uncertainty_score":0.004711449},"labels":[],"label_agreement":null},{"id":"W7117471539","doi":"10.1109/ton.2025.3649391","title":"Nested Quasi-Newton Optimization for Federated Learning Under Periodic Deterministic Communication Constraints","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Networking","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":0,"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 Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Compute Canada","keywords":"Leverage (statistics); Robustness (evolution); Federated learning; Convergence (economics); Benchmark (surveying); Global optimization; Optimization problem; Premature convergence","score_opus":0.04050586423524514,"score_gpt":0.29798504487905114,"score_spread":0.257479180643806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117471539","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012463755,0.00019085135,0.9851039,0.00026869142,0.000047800968,0.000032643093,0.000060331186,0.00054000935,0.0012919494],"genre_scores_gemma":[0.62074006,0.00020699346,0.37326717,0.0004628735,0.00006986812,0.00027871734,0.0004137258,0.000310433,0.004250206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999295,0.00025136792,0.000031931828,0.00016556766,0.00017696773,0.0000790606],"domain_scores_gemma":[0.99789655,0.0012354704,0.00019827869,0.00021232554,0.000339802,0.00011753238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018881247,0.0011165029,0.0012658915,0.0003499138,0.00052484195,0.000886252,0.0016439438,0.0012671774,0.0019529178],"category_scores_gemma":[0.006340072,0.0006072955,0.0006156244,0.00039872533,0.0011704346,0.0010562078,0.0015693443,0.0019297411,0.00048857124],"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.000055109747,0.000025958718,0.00038880674,0.000045875586,0.000020058864,0.000041912495,0.00003314678,0.9787699,0.00061143393,0.0052014077,0.00094560947,0.013860814],"study_design_scores_gemma":[0.000003820431,0.000005765115,0.000017608743,0.0000018162931,9.1247296e-7,0.000002929352,0.0000017892207,0.9984896,0.00008053037,0.0012970656,0.000096849944,0.0000012679964],"about_ca_topic_score_codex":0.0097235795,"about_ca_topic_score_gemma":0.010378049,"teacher_disagreement_score":0.0097235795,"about_ca_system_score_codex":0.0010838794,"about_ca_system_score_gemma":0.0023960401,"threshold_uncertainty_score":0.019333959},"labels":[],"label_agreement":null}]}