{"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014872186,0.0015773303,0.97569823,0.0004994077,0.0058183772,0.000278878,0.000014718727,0.000697336,0.0005435296],"genre_scores_gemma":[0.99715483,0.0001487212,0.0012336017,0.00043465273,0.0005638926,0.000040925515,0.000009227427,0.000041056574,0.00037306556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99698776,0.00011941909,0.00048282914,0.0011847537,0.0004582585,0.00076698326],"domain_scores_gemma":[0.9981716,0.00026017576,0.000064148866,0.0013426973,0.000025850815,0.00013549093],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012579306,0.00028530497,0.00029071636,0.00038528658,0.00038970605,0.00063497503,0.0015355959,0.0001268319,0.000011209516],"category_scores_gemma":[0.000002472696,0.00028867906,0.00015880898,0.0010409064,0.000025981122,0.0003552622,0.000065945074,0.000855629,0.00004171117],"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.0000860665,0.00046859626,0.00009651792,0.00008458191,0.00019366799,0.0005304985,0.004012673,0.62275606,0.0012692757,0.0047814082,0.0007274417,0.36499318],"study_design_scores_gemma":[0.00037634425,0.000040867268,0.000015207962,0.0010466921,0.000028587452,0.00004119608,0.00017404147,0.98936117,0.00012787411,0.00026822343,0.00820746,0.0003123407],"about_ca_topic_score_codex":0.00011558644,"about_ca_topic_score_gemma":0.00036745326,"teacher_disagreement_score":0.9822827,"about_ca_system_score_codex":0.00020576971,"about_ca_system_score_gemma":0.000055953995,"threshold_uncertainty_score":0.99995655},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010761115,0.00066044135,0.9818124,0.0006345423,0.0045986795,0.00071948115,0.00000193461,0.00042284015,0.00038854918],"genre_scores_gemma":[0.99640393,0.00007050679,0.0023438921,0.00030017187,0.00048781434,0.00027684853,0.0000053759204,0.000027305055,0.00008414454],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978427,0.00017343422,0.00042288328,0.0006196924,0.000541256,0.000399994],"domain_scores_gemma":[0.9991499,0.00020979074,0.000086451284,0.00034465423,0.00011884698,0.000090310765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013996147,0.00022485599,0.00017737287,0.0003235457,0.00050128845,0.00087294134,0.00021163751,0.00009063543,0.00005662697],"category_scores_gemma":[0.0000022975287,0.00021272888,0.0001126056,0.00074823335,0.000027724804,0.00056063716,0.0000027802769,0.00027973956,0.000027654878],"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.000033283985,0.000075059506,0.00003745934,0.00006537792,0.00011901508,0.0000061358787,0.00060622365,0.2133389,0.0004935016,0.0021167824,0.00043030674,0.78267795],"study_design_scores_gemma":[0.0007682334,0.00024893563,0.000016863536,0.0005515946,0.000057476605,0.00001093099,0.00018907401,0.98249394,0.0040117353,0.0005931726,0.010797049,0.000261021],"about_ca_topic_score_codex":0.00007103668,"about_ca_topic_score_gemma":0.00012734115,"teacher_disagreement_score":0.98564285,"about_ca_system_score_codex":0.00022456406,"about_ca_system_score_gemma":0.00012328931,"threshold_uncertainty_score":0.86748314},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000057893812,0.000074020594,0.9676136,0.00042640485,0.0014761465,0.029303871,0.000005584518,0.00069720903,0.00034528325],"genre_scores_gemma":[0.5275774,0.000026432212,0.19236238,0.002575418,0.0030172577,0.27283573,0.000016186192,0.00019735371,0.001391851],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99745834,0.0001468792,0.00053754036,0.0007561192,0.00043990527,0.0006612211],"domain_scores_gemma":[0.998218,0.00094184565,0.00010933419,0.0005149564,0.000063820604,0.00015204409],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007325805,0.00034719077,0.0003369157,0.00018430098,0.0006160283,0.00063596497,0.0005363556,0.00016314226,0.00008014462],"category_scores_gemma":[0.0000015258015,0.00030894208,0.00037827904,0.000776384,0.000042248197,0.0006083486,0.0000037398722,0.00043125518,0.000019213632],"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.00035808113,0.00020982813,0.000006510503,0.0004117867,0.0001025104,0.000026272844,0.00047465652,0.29617825,0.00056213076,0.00083660986,0.00385925,0.6969741],"study_design_scores_gemma":[0.0016850288,0.00019635563,0.0000073770357,0.0013914595,0.000048225942,0.0000043536793,0.000012628061,0.8298771,0.0028667273,0.00074685074,0.1628268,0.00033708737],"about_ca_topic_score_codex":0.000035549332,"about_ca_topic_score_gemma":0.000030737185,"teacher_disagreement_score":0.7752512,"about_ca_system_score_codex":0.00015599077,"about_ca_system_score_gemma":0.00023901118,"threshold_uncertainty_score":0.9999363},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94540673,0.0017201754,0.048164222,0.0015697633,0.0015599694,0.00039169283,0.000024531766,0.00023973975,0.000923183],"genre_scores_gemma":[0.99882454,0.0006649218,0.000059088903,0.000016309501,0.0002993788,0.000023722845,5.260505e-7,0.000013999802,0.00009753676],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990673,0.00009210321,0.00021080115,0.0002282008,0.00017787618,0.00022369261],"domain_scores_gemma":[0.9995496,0.00017652467,0.000059180016,0.00011507896,0.000036680784,0.000062892446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055341097,0.000094127325,0.00014587597,0.00006509647,0.00060677173,0.0002601013,0.000100278936,0.00007669712,0.000010047756],"category_scores_gemma":[0.0000073533824,0.00008789159,0.00004097451,0.00023260225,0.00008854606,0.00035397595,0.0000024455328,0.00015428086,0.0000032345008],"study_design_candidate":"design_other","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.0000857463,0.00005763019,0.0015730639,0.00040363372,0.0001650201,0.000014557092,0.032224018,0.0009674676,0.013875213,0.0006701469,0.000022872731,0.9499406],"study_design_scores_gemma":[0.0054323752,0.00084172224,0.03186616,0.020758167,0.0016102564,0.00012917035,0.03656709,0.53795975,0.16915785,0.0057193968,0.1852338,0.0047242516],"about_ca_topic_score_codex":0.00021806042,"about_ca_topic_score_gemma":0.0009663219,"teacher_disagreement_score":0.94521636,"about_ca_system_score_codex":0.00004378259,"about_ca_system_score_gemma":0.000029497307,"threshold_uncertainty_score":0.4666859},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045416723,0.010938606,0.98184043,0.0016339355,0.00034208148,0.00031751444,4.117849e-7,0.00017846221,0.0002069144],"genre_scores_gemma":[0.97473675,0.0051340535,0.01984666,0.0000796582,0.00003164342,0.000040495597,0.0000015616633,0.00001535727,0.00011381443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788624,0.0008964805,0.0004583591,0.00032004772,0.0001479524,0.0002909387],"domain_scores_gemma":[0.9981667,0.0010999814,0.00009740265,0.00051577727,0.00005783988,0.00006233248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010773673,0.00015409969,0.00023302619,0.00021870088,0.00030355068,0.000112232476,0.00037331603,0.00008933419,0.000014591555],"category_scores_gemma":[0.000010839808,0.00015993611,0.00005813868,0.0010010102,0.00012823773,0.00006482469,0.000018111223,0.0005072644,0.0000051275106],"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.000025313482,0.000053750668,0.000018844272,0.000013299019,0.000025917236,0.0000034921334,0.0013897015,0.910685,0.0003243751,0.0117973145,0.00014121909,0.07552178],"study_design_scores_gemma":[0.00032055908,0.00006679667,0.00008762871,0.00044974068,0.000013868493,0.000021551128,0.000071785544,0.9916987,0.00023690233,0.00039050874,0.006491407,0.00015056621],"about_ca_topic_score_codex":0.000014933357,"about_ca_topic_score_gemma":0.000057904705,"teacher_disagreement_score":0.97019506,"about_ca_system_score_codex":0.00009087776,"about_ca_system_score_gemma":0.00007501242,"threshold_uncertainty_score":0.6522006},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003350151,0.00029755066,0.98327583,0.012284303,0.00050325715,0.00028863217,0.0000063957873,0.0017223225,0.0012867082],"genre_scores_gemma":[0.78680074,0.00056651485,0.21199113,0.0002875243,0.000012365649,0.00010121037,0.00001726949,0.00001700103,0.000206262],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983191,0.00032629512,0.00029764956,0.00049621554,0.00019030807,0.00037046682],"domain_scores_gemma":[0.9950059,0.00056240126,0.00013114899,0.004155353,0.00009569002,0.00004952853],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0003800119,0.00022283693,0.00024345484,0.00021186595,0.0009716452,0.00039848013,0.009227519,0.00014442045,0.0000084838985],"category_scores_gemma":[0.00009505173,0.00021782686,0.000058648082,0.0012513871,0.00014545968,0.00048392016,0.00058433024,0.0008696391,0.000012273267],"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.00035199596,0.00058812834,0.00007045666,0.000057234385,0.0005560527,0.000017624301,0.00025338988,0.5019183,0.0052102753,0.0010504851,0.06936302,0.42056304],"study_design_scores_gemma":[0.0008757044,0.00007300627,0.000009716082,0.00025874286,0.000028539258,0.000004525171,0.00003728491,0.98205835,0.0057096845,0.002016048,0.008696914,0.00023147141],"about_ca_topic_score_codex":0.00006224906,"about_ca_topic_score_gemma":0.00003350703,"teacher_disagreement_score":0.7864657,"about_ca_system_score_codex":0.00013166465,"about_ca_system_score_gemma":0.0000748649,"threshold_uncertainty_score":0.996133},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036577147,0.000118005104,0.9935875,0.0010077785,0.0007630236,0.0006183673,0.00004620706,0.00017877445,0.000022620676],"genre_scores_gemma":[0.93823117,0.000108770306,0.06122704,0.00009081804,0.000029956786,0.00018321414,0.00011191838,0.000008693684,0.000008441068],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987431,0.00014698724,0.00043092677,0.00032697874,0.00012517642,0.0002268298],"domain_scores_gemma":[0.9991432,0.0002788304,0.00012238573,0.00031835676,0.00009310144,0.00004417018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039566422,0.00014770009,0.0002180459,0.00022914357,0.00028225774,0.00016324829,0.00024148115,0.00007101209,5.011765e-7],"category_scores_gemma":[0.000009770187,0.0001692303,0.00005905245,0.00067173765,0.000022172728,0.0005508654,0.0000051892534,0.00020262027,3.9866606e-7],"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.000023793511,0.0001286547,0.00015233169,0.000027635204,0.000022156562,6.914059e-7,0.00012750692,0.9496541,0.000039832445,0.00040888222,0.000030093544,0.04938432],"study_design_scores_gemma":[0.0011643133,0.00003060223,0.0007328254,0.0003035426,0.000015968082,0.000001219622,0.00007186242,0.9968026,0.00019356719,0.0003035888,0.00024572207,0.00013416592],"about_ca_topic_score_codex":0.000095991374,"about_ca_topic_score_gemma":0.00022620325,"teacher_disagreement_score":0.9345734,"about_ca_system_score_codex":0.00017713507,"about_ca_system_score_gemma":0.00003996996,"threshold_uncertainty_score":0.69010115},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007934244,0.000007155574,0.9617648,0.00036858403,0.0007249662,0.036234576,0.00000998729,0.0002481005,0.0005624929],"genre_scores_gemma":[0.5904623,0.000007797672,0.09579054,0.00435012,0.0003401735,0.30656323,0.000003785532,0.000052344963,0.002429694],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810636,0.00015672405,0.00040081656,0.0006173245,0.00023386163,0.00048494185],"domain_scores_gemma":[0.9984534,0.0006580032,0.00013758011,0.0005155478,0.00013159841,0.00010389928],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036432972,0.00027246878,0.00027865445,0.00024582897,0.0005534651,0.00027327493,0.00044950173,0.0001090393,0.000012684241],"category_scores_gemma":[0.00000548012,0.00026440268,0.00020187636,0.0005516458,0.000048699447,0.00036292974,0.000006295045,0.00035410098,0.00002952701],"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.0012056294,0.0023498284,0.00004647755,0.0003690724,0.0006723717,0.000054282835,0.005595575,0.1816608,0.0022207217,0.0084274355,0.0026703253,0.7947275],"study_design_scores_gemma":[0.004224177,0.00070789113,0.00010009234,0.0013391452,0.00004784337,0.000003155435,0.000218394,0.9548179,0.022057384,0.0007694116,0.015202709,0.0005119208],"about_ca_topic_score_codex":0.00006684455,"about_ca_topic_score_gemma":0.0001545254,"teacher_disagreement_score":0.86597425,"about_ca_system_score_codex":0.00016571791,"about_ca_system_score_gemma":0.00021307851,"threshold_uncertainty_score":0.9999808},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022622656,0.00081309315,0.9735425,0.000060971866,0.0010511329,0.00028202366,0.0000015776048,0.00083689514,0.0007891314],"genre_scores_gemma":[0.9715748,0.0014372197,0.026644142,0.000062023195,0.000050617607,0.00009614183,0.0000018294486,0.000060315346,0.00007292864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834996,0.000028173567,0.0003495457,0.0003676815,0.00016626502,0.000738341],"domain_scores_gemma":[0.99936795,0.0002073982,0.000037091882,0.00033226467,0.0000060815637,0.000049199432],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013859321,0.0003155585,0.00030606517,0.00024371089,0.00018767896,0.00004140498,0.00023237147,0.00019650579,0.000008248351],"category_scores_gemma":[0.0000014518952,0.00032203755,0.00007706533,0.0012425035,0.0000950245,0.00015692037,0.0000041197295,0.0008336664,0.000008605311],"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.000029194649,0.00002284561,0.00026435888,0.000015844347,0.00005491521,0.00001520351,0.000044847962,0.91538864,0.00009875418,0.00016259046,0.00003002665,0.08387279],"study_design_scores_gemma":[0.0006995521,0.00005483908,0.0003942963,0.0010369302,0.00004154825,0.000006320696,0.00015417213,0.9930806,0.0004355224,0.0020869526,0.0015258477,0.00048338313],"about_ca_topic_score_codex":0.0000028248562,"about_ca_topic_score_gemma":0.00007234268,"teacher_disagreement_score":0.94895214,"about_ca_system_score_codex":0.00033777245,"about_ca_system_score_gemma":0.00000808334,"threshold_uncertainty_score":0.99992317},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009587821,0.000114886985,0.9767683,0.00024293868,0.012751978,0.0003028152,7.3096834e-7,0.00014146802,0.00008902251],"genre_scores_gemma":[0.84835106,0.000004902007,0.14903314,0.00025956082,0.0023060236,0.000008175321,0.0000020179773,0.000015773123,0.00001936734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837184,0.00010220402,0.00039797075,0.0004770698,0.00012662081,0.0005242762],"domain_scores_gemma":[0.9984214,0.0011691602,0.00006896324,0.00021959763,0.000051703966,0.00006919257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039185627,0.00020344624,0.00027506836,0.00021594598,0.00061782263,0.00027733302,0.00028763994,0.00020806878,0.0000019990807],"category_scores_gemma":[0.000027381308,0.00022690232,0.00006469337,0.0007857979,0.000053368934,0.00012628906,0.000012903568,0.0004720315,8.9658e-7],"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.000024133406,0.000018275636,0.00007837021,0.000018664492,0.000013385409,0.0000030297658,0.000107053806,0.81092614,0.00001827009,0.000164591,0.00010661367,0.18852146],"study_design_scores_gemma":[0.0006779845,0.000056821624,0.000026092264,0.00052612746,0.000024515271,0.000008215825,0.0000059668732,0.996997,0.000093526265,0.0009862914,0.0003963232,0.00020112256],"about_ca_topic_score_codex":0.0000059371223,"about_ca_topic_score_gemma":0.00000468501,"teacher_disagreement_score":0.83876324,"about_ca_system_score_codex":0.00008105814,"about_ca_system_score_gemma":0.00009056678,"threshold_uncertainty_score":0.9252808},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041085,0.00033331625,0.9893519,0.001093578,0.0022279408,0.0006503467,0.0000021404828,0.00037333232,0.001858921],"genre_scores_gemma":[0.9954402,0.000079168734,0.0025870956,0.00096293923,0.0002526881,0.000318394,0.0000012050648,0.000019644456,0.0003386581],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978135,0.0002396017,0.0003833429,0.0006631075,0.00028567543,0.0006147676],"domain_scores_gemma":[0.99859804,0.0005465914,0.00011900955,0.00052376656,0.00011513286,0.000097444485],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004144294,0.00031148602,0.00038700708,0.000253614,0.00040760357,0.00016459289,0.00052122585,0.00016640147,0.000008267671],"category_scores_gemma":[0.0000026192372,0.00028667555,0.000094202274,0.001515521,0.000078937905,0.00037804004,0.0000037422478,0.0005660668,0.000013674842],"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.00022981604,0.00011178158,0.00071874174,0.000007282602,0.00010461249,0.000018289173,0.00007279327,0.6405394,0.000005778039,0.0038618215,0.00013989887,0.35418975],"study_design_scores_gemma":[0.0042813714,0.00024957373,0.0022306454,0.000771234,0.00010052651,0.00001793277,0.00003379029,0.9860236,0.00017074496,0.0012261099,0.004370399,0.0005240813],"about_ca_topic_score_codex":0.00003251021,"about_ca_topic_score_gemma":0.00050395593,"teacher_disagreement_score":0.9913317,"about_ca_system_score_codex":0.0001773353,"about_ca_system_score_gemma":0.000262267,"threshold_uncertainty_score":0.9999585},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013468006,0.00074612926,0.99494255,0.00044610316,0.00039831662,0.00045891487,0.00007620968,0.00006884609,0.0015161549],"genre_scores_gemma":[0.9654757,0.000063813844,0.032714438,0.00032259568,0.00012400595,0.00035474607,0.0000035519947,0.000027563,0.00091361266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987771,0.000002601233,0.00044988914,0.00044498252,0.000028325288,0.00029712723],"domain_scores_gemma":[0.9994303,0.00012737386,0.00014624686,0.00020672895,0.00003589996,0.00005346236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026823062,0.00015808566,0.00028489006,0.00025161382,0.0005225146,0.00008312859,0.00011935806,0.000108182714,0.0000033143535],"category_scores_gemma":[0.000013999458,0.00018400082,0.00010825674,0.0003630946,0.000043401185,0.00009120427,0.0000045845454,0.00020791036,0.000007875177],"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.00010338748,0.00016617597,0.000037444486,0.00012963652,0.000087766566,5.4609006e-7,0.0006951902,0.49710822,0.00006682847,0.36846793,0.0004806967,0.13265619],"study_design_scores_gemma":[0.00043029178,0.000038898543,0.000042603213,0.00016033191,0.000020923204,0.0000018077556,0.000054528453,0.95867145,0.00015431743,0.03363706,0.0065954328,0.00019234601],"about_ca_topic_score_codex":0.000034716195,"about_ca_topic_score_gemma":0.000025847654,"teacher_disagreement_score":0.96412885,"about_ca_system_score_codex":0.00007928473,"about_ca_system_score_gemma":0.000038375198,"threshold_uncertainty_score":0.75033355},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008885629,0.00005741155,0.9885253,0.00045108178,0.0007790571,0.0003399235,0.0000016287777,0.00023382778,0.00072618556],"genre_scores_gemma":[0.93617755,0.000023073806,0.06269784,0.0007128692,0.000092676295,0.00013648931,0.0000013503478,0.000014668734,0.0001434663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985474,0.000054208147,0.00030053058,0.0004477932,0.00022643134,0.00042363832],"domain_scores_gemma":[0.99902505,0.00030120794,0.00007570448,0.0004466726,0.00009594917,0.000055441913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003697112,0.00019992435,0.00020593262,0.00021415217,0.00068781537,0.00024296288,0.00041884888,0.000067894165,0.0000027097776],"category_scores_gemma":[0.0000017638844,0.00018880221,0.000103543425,0.00058537535,0.00002107101,0.00047674045,0.000003256856,0.00024185971,0.0000025353156],"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.00005174265,0.000059098664,0.000024202789,0.000060993065,0.00003645319,0.000001655969,0.00017886522,0.83721876,0.00020113286,0.00036237668,0.000019907842,0.16178478],"study_design_scores_gemma":[0.0007760976,0.00012985403,0.000009006455,0.000601606,0.00003182136,0.0000017579196,0.00006336974,0.9881468,0.00943101,0.000109639564,0.00048518903,0.00021387881],"about_ca_topic_score_codex":0.000036119694,"about_ca_topic_score_gemma":0.0000701585,"teacher_disagreement_score":0.9272919,"about_ca_system_score_codex":0.00013454258,"about_ca_system_score_gemma":0.00018008526,"threshold_uncertainty_score":0.769913},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006309758,0.000020179115,0.9890987,0.00023686123,0.00056999363,0.00061211013,0.000003198661,0.00021370074,0.008614259],"genre_scores_gemma":[0.80724585,0.000024767887,0.19135657,0.0007076585,0.000053548214,0.0000669774,0.00002907551,0.000012733191,0.00050281564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794173,0.00011075017,0.000923032,0.0002874729,0.00031744209,0.0004195724],"domain_scores_gemma":[0.9987808,0.00018861932,0.00024688643,0.00047426982,0.00019808,0.000111338515],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006464183,0.00025378965,0.00032886423,0.0011114895,0.0002385009,0.00034765858,0.0006944619,0.00019104805,0.000012653951],"category_scores_gemma":[0.000029352546,0.00026711627,0.00009796354,0.004129226,0.000031755797,0.0020572806,0.000016266726,0.00047216166,0.000015183365],"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.000028838564,0.000050051214,0.000017906637,0.000022724895,0.000022397518,7.382156e-7,0.0020224212,0.8329552,0.0000057973725,0.0011044304,0.00067129295,0.16309822],"study_design_scores_gemma":[0.00081191515,0.00003741175,0.000069009446,0.00042712604,0.000012519076,0.0000035131516,0.00031415393,0.9958078,0.00014745072,0.0001222714,0.0020313538,0.00021542987],"about_ca_topic_score_codex":0.00018752273,"about_ca_topic_score_gemma":0.00003515186,"teacher_disagreement_score":0.8066149,"about_ca_system_score_codex":0.000271561,"about_ca_system_score_gemma":0.00021957488,"threshold_uncertainty_score":0.9999781},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034476433,0.000022659095,0.961657,0.00023862485,0.00069123704,0.0003725961,0.0000017355208,0.00028476925,0.0022549755],"genre_scores_gemma":[0.9966917,0.000003272388,0.00092210126,0.00069759734,0.00039196457,0.00017390463,0.000007299434,0.000034773442,0.0010773821],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990035,0.000014872267,0.00021572705,0.00033559155,0.00015314504,0.00027713113],"domain_scores_gemma":[0.99929017,0.00016420822,0.00012705353,0.0002929512,0.00011579945,0.000009819234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028136082,0.00019011648,0.00020777057,0.00029885798,0.00051249133,0.00015068651,0.00015876669,0.0000680772,0.000020387033],"category_scores_gemma":[0.000003674552,0.00017319448,0.000117029536,0.0008189544,0.00003093526,0.0004349926,0.0000017667662,0.00015441785,0.000034864035],"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.00045069962,0.000064626576,0.000029768018,0.00017429671,0.00014060634,0.000004056063,0.000013646955,0.9632309,0.000025601745,0.029616399,0.00014860916,0.006100796],"study_design_scores_gemma":[0.0013650876,0.000051387633,0.00002414242,0.0013960942,0.0005582553,0.000002581462,0.00026509113,0.98419666,0.0006485488,0.002093056,0.009001385,0.00039772308],"about_ca_topic_score_codex":0.000060818755,"about_ca_topic_score_gemma":0.00014127034,"teacher_disagreement_score":0.96221524,"about_ca_system_score_codex":0.0001270429,"about_ca_system_score_gemma":0.00001696803,"threshold_uncertainty_score":0.7062666},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010361063,0.000028313478,0.9970764,0.00037536494,0.0008966116,0.00068471424,0.000050936873,0.0002688695,0.0005151804],"genre_scores_gemma":[0.41307402,0.00019080982,0.58516306,0.00044252127,0.00007996233,0.00013064362,0.0007994159,0.000018318757,0.000101239275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986358,0.000041539264,0.0006007161,0.00021463458,0.00025531015,0.0002520007],"domain_scores_gemma":[0.9986289,0.00018944062,0.0003481762,0.0003718368,0.0004082461,0.000053408992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015534644,0.00020433073,0.00021869845,0.00042568802,0.0003230884,0.00016495382,0.0003624251,0.00013522586,0.000008549359],"category_scores_gemma":[0.000011239933,0.00019761994,0.00008150456,0.0013135547,0.000042673044,0.0018545314,0.0000033150045,0.00013679347,0.0000025430027],"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.00007462817,0.00008061137,0.000011211074,0.00006281223,0.00004429155,3.829443e-7,0.00025059082,0.94638956,0.000006016914,0.00082349166,0.00019824717,0.05205815],"study_design_scores_gemma":[0.0010624046,0.0001422697,0.000028710241,0.00024818198,0.000045354565,0.0000036250426,0.000047533125,0.9941267,0.001605749,0.00007764009,0.0024217137,0.00019014797],"about_ca_topic_score_codex":0.000005217125,"about_ca_topic_score_gemma":0.000013489601,"teacher_disagreement_score":0.4129704,"about_ca_system_score_codex":0.00016594892,"about_ca_system_score_gemma":0.0001513355,"threshold_uncertainty_score":0.8058708},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15049423,0.000066649045,0.8473862,0.00016048054,0.00026155208,0.00019557535,9.3245524e-7,0.00014853559,0.001285835],"genre_scores_gemma":[0.9973908,0.000031866006,0.0012780699,0.0010172271,0.00016742952,0.0000383842,0.0000028848876,0.000022340057,0.00005100428],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987349,0.00004639369,0.00027483844,0.00042789374,0.00012048279,0.00039547574],"domain_scores_gemma":[0.9992887,0.00033799108,0.00009862062,0.0002006636,0.000051991035,0.000022080027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005189681,0.00020613626,0.00026813458,0.00033662442,0.00039942993,0.00015809646,0.00011947768,0.000070297065,0.000053115404],"category_scores_gemma":[0.000021827524,0.00020448709,0.000050648287,0.0014584933,0.00010018275,0.00038345947,0.0000065283484,0.00043897727,0.000006436523],"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.00017944316,0.000038115544,0.02029241,0.00003230699,0.000047162415,0.000011969915,0.00008119812,0.8757799,0.000030105966,0.0005134328,0.00001596905,0.102977976],"study_design_scores_gemma":[0.00063099514,0.000021988504,0.0013449036,0.000896856,0.00010878847,0.0000020696373,0.0003892775,0.9895434,0.000052648655,0.0010223164,0.00564259,0.00034418408],"about_ca_topic_score_codex":0.00024931759,"about_ca_topic_score_gemma":0.001358701,"teacher_disagreement_score":0.8468966,"about_ca_system_score_codex":0.00005030633,"about_ca_system_score_gemma":0.000014538065,"threshold_uncertainty_score":0.83387417},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02688934,0.003604596,0.958419,0.0005804095,0.008780602,0.0009975652,0.000006789264,0.00053616066,0.0001854935],"genre_scores_gemma":[0.98701954,0.0056639863,0.005664313,0.00048161257,0.0006165829,0.00021815102,0.000010911023,0.0000757134,0.00024921852],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944385,0.00066592084,0.0013974899,0.0017553038,0.00053128996,0.0012114887],"domain_scores_gemma":[0.99658203,0.001369994,0.00048130617,0.0011504978,0.00017826699,0.00023788284],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0013182539,0.0008171341,0.0007726333,0.0010831604,0.0014058321,0.0009330098,0.0006743399,0.0007886391,0.000021602938],"category_scores_gemma":[0.0000317076,0.00092654035,0.00027961863,0.0040764827,0.00016277602,0.0010518631,0.000025805946,0.0016147022,0.000016381542],"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.00015205798,0.00023640766,0.0010177451,0.000065699845,0.000082283164,0.000008139263,0.00040439997,0.37347856,0.00010061025,0.00028996283,0.00008574938,0.6240784],"study_design_scores_gemma":[0.0016602975,0.00025857054,0.0039855246,0.0021084545,0.00019815724,0.000021105428,0.000046024827,0.98690146,0.0016296864,0.001009054,0.0012839584,0.00089772465],"about_ca_topic_score_codex":0.00015548812,"about_ca_topic_score_gemma":0.0002968183,"teacher_disagreement_score":0.96013016,"about_ca_system_score_codex":0.00051933504,"about_ca_system_score_gemma":0.00017402705,"threshold_uncertainty_score":0.9998942},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067991093,0.000113903276,0.98661864,0.0007846292,0.003977819,0.0008337428,0.00023273475,0.0002912408,0.0003481998],"genre_scores_gemma":[0.92936915,0.00014515163,0.06778927,0.00076043676,0.0005210945,0.00048377345,0.0000962241,0.000027690618,0.0008072201],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99670315,0.00017458279,0.00074507244,0.0013047886,0.00044850583,0.00062387885],"domain_scores_gemma":[0.9970441,0.0008246402,0.0002686409,0.0015390248,0.00015957185,0.00016403836],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056288944,0.00050335116,0.00079172384,0.0007987865,0.0005349329,0.0005984456,0.0014656513,0.00033063343,0.000013620977],"category_scores_gemma":[0.0000054798957,0.0005637577,0.00071170094,0.001468485,0.000028616341,0.00029073708,0.00004047453,0.0008561349,0.000010667045],"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.00005036516,0.000102466125,0.00008335903,0.000099541205,0.0010480415,0.00000330056,0.0012376282,0.81524295,0.000010236584,0.00014865451,0.00012853912,0.1818449],"study_design_scores_gemma":[0.00036344395,0.00007937517,0.00014960725,0.0007266681,0.00078880845,6.0773556e-7,0.00012327338,0.9948718,0.00074198627,0.00048322108,0.0011067931,0.00056443585],"about_ca_topic_score_codex":0.0012001536,"about_ca_topic_score_gemma":0.0030430383,"teacher_disagreement_score":0.92257005,"about_ca_system_score_codex":0.00063307694,"about_ca_system_score_gemma":0.0003215905,"threshold_uncertainty_score":0.9996814},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007631443,0.0013695393,0.98474795,0.00021158186,0.0008013663,0.00056673744,0.000011624657,0.00030920765,0.004350524],"genre_scores_gemma":[0.9816022,0.0039052542,0.013015206,0.00016943201,0.00011074247,0.0003598296,0.000026629697,0.00010394987,0.00070678623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973176,0.00025411,0.00094997964,0.0006148446,0.00019480287,0.00066863984],"domain_scores_gemma":[0.9977694,0.00084871304,0.00023289428,0.00092619576,0.00013747379,0.00008533515],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061422685,0.00048471228,0.00044951905,0.000619351,0.0008881039,0.000563369,0.0005864783,0.0003061091,0.00004356042],"category_scores_gemma":[0.0000075887247,0.0005674949,0.000115359755,0.0027161336,0.000093457376,0.00075969123,0.000010598263,0.0008781032,0.0000066539774],"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.00008499313,0.00014565645,0.0005653975,0.000077898614,0.00009942395,0.0000021758942,0.00024098493,0.7491809,0.00018393395,0.00019869818,0.000019092124,0.24920085],"study_design_scores_gemma":[0.0014651135,0.00004125339,0.00050385355,0.0023458207,0.0001272852,0.0000031503623,0.00013263094,0.9866993,0.0032761644,0.00016335791,0.00471603,0.00052605796],"about_ca_topic_score_codex":0.0012893792,"about_ca_topic_score_gemma":0.005235395,"teacher_disagreement_score":0.9739707,"about_ca_system_score_codex":0.00044669304,"about_ca_system_score_gemma":0.00012102679,"threshold_uncertainty_score":0.99967766},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00075256167,0.0006434435,0.98191077,0.010031356,0.003686797,0.001324831,0.000030530755,0.0012261964,0.00039349042],"genre_scores_gemma":[0.8721425,0.0011924444,0.1254985,0.00041873404,0.00006769454,0.00024429182,0.00005435781,0.00005602172,0.0003254538],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99571186,0.0006844777,0.0010760161,0.0012147159,0.00038323252,0.0009296906],"domain_scores_gemma":[0.99203837,0.00196328,0.00051991217,0.0049940217,0.00036517018,0.000119270626],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010190273,0.00059384824,0.00059486175,0.0006504526,0.0036337401,0.0014890321,0.009277064,0.0006641508,0.000076062504],"category_scores_gemma":[0.0009922803,0.0007333131,0.00024135337,0.0021387541,0.000752144,0.00076420815,0.00067634013,0.0014732043,0.000014872478],"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.000096160904,0.00025286607,0.0000186586,0.0000998205,0.00016241916,0.000003594683,0.00015346322,0.6129727,0.00007804551,0.00029356545,0.0014415473,0.3844272],"study_design_scores_gemma":[0.0013527867,0.00031641073,0.000017305083,0.0017378043,0.00019975506,0.000019547562,0.00028478377,0.9888748,0.0008275382,0.0046175104,0.0011754548,0.0005762978],"about_ca_topic_score_codex":0.00004193935,"about_ca_topic_score_gemma":0.00008884207,"teacher_disagreement_score":0.8713899,"about_ca_system_score_codex":0.00058130315,"about_ca_system_score_gemma":0.0005384995,"threshold_uncertainty_score":0.99954754},"labels":[],"label_agreement":null}]}