{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":21,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":21,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"59fe791cdce3","filters":{"venue":"IEEE Transactions on Networking"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.06189477862698434,"gpt":0.3648135516108576,"spread":0.3029187729838733,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007325805,0.0003471908,0.0003369157,0.000184301,0.0006160283,0.000635965,0.0005363556,0.0001631423,0.00008014462],"category_scores_gemma":[0.000001525802,0.0003089421,0.000378279,0.000776384,0.0000422482,0.0006083486,0.000003739872,0.0004312552,0.00001921363],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001559908,"about_ca_system_score_gemma":0.0002390112,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003554933,"about_ca_topic_score_gemma":0.00003073718,"domain_scores_codex":[0.9974583,0.0001468792,0.0005375404,0.0007561192,0.0004399053,0.0006612211],"domain_scores_gemma":[0.998218,0.0009418456,0.0001093342,0.0005149564,0.0000638206,0.0001520441],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003580811,0.0002098281,0.000006510503,0.0004117867,0.0001025104,0.00002627284,0.0004746565,0.2961783,0.0005621308,0.0008366099,0.00385925,0.6969741],"study_design_scores_gemma":[0.001685029,0.0001963556,0.000007377036,0.001391459,0.00004822594,0.000004353679,0.00001262806,0.8298771,0.002866727,0.0007468507,0.1628268,0.0003370874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00005789381,0.00007402059,0.9676136,0.0004264048,0.001476147,0.02930387,0.000005584518,0.000697209,0.0003452832],"genre_scores_gemma":[0.5275774,0.00002643221,0.1923624,0.002575418,0.003017258,0.2728357,0.00001618619,0.0001973537,0.001391851],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7752512,"threshold_uncertainty_score":0.9999363,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0420380402731293,"gpt":0.2724648518237101,"spread":0.2304268115505808,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0003800119,0.0002228369,0.0002434548,0.0002118659,0.0009716452,0.0003984801,0.009227519,0.0001444205,0.000008483898],"category_scores_gemma":[0.00009505173,0.0002178269,0.00005864808,0.001251387,0.0001454597,0.0004839202,0.0005843302,0.0008696391,0.00001227327],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001316647,"about_ca_system_score_gemma":0.0000748649,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006224906,"about_ca_topic_score_gemma":0.00003350703,"domain_scores_codex":[0.9983191,0.0003262951,0.0002976496,0.0004962155,0.0001903081,0.0003704668],"domain_scores_gemma":[0.9950059,0.0005624013,0.000131149,0.004155353,0.00009569002,0.00004952853],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000351996,0.0005881283,0.00007045666,0.00005723439,0.0005560527,0.0000176243,0.0002533899,0.5019183,0.005210275,0.001050485,0.06936302,0.420563],"study_design_scores_gemma":[0.0008757044,0.00007300627,0.000009716082,0.0002587429,0.00002853926,0.000004525171,0.00003728491,0.9820583,0.005709684,0.002016048,0.008696914,0.0002314714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0003350151,0.0002975507,0.9832758,0.0122843,0.0005032571,0.0002886322,0.000006395787,0.001722323,0.001286708],"genre_scores_gemma":[0.7868007,0.0005665148,0.2119911,0.0002875243,0.00001236565,0.0001012104,0.00001726949,0.00001700103,0.000206262],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7864657,"threshold_uncertainty_score":0.996133,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.007340580237367521,"gpt":0.2278824791033344,"spread":0.2205418988659669,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001385932,0.0003155585,0.0003060652,0.0002437109,0.000187679,0.00004140498,0.0002323715,0.0001965058,0.000008248351],"category_scores_gemma":[0.000001451895,0.0003220376,0.00007706533,0.001242504,0.0000950245,0.0001569204,0.00000411973,0.0008336664,0.000008605311],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003377724,"about_ca_system_score_gemma":0.00000808334,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002824856,"about_ca_topic_score_gemma":0.00007234268,"domain_scores_codex":[0.99835,0.00002817357,0.0003495457,0.0003676815,0.000166265,0.000738341],"domain_scores_gemma":[0.999368,0.0002073982,0.00003709188,0.0003322647,0.000006081564,0.00004919943],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002919465,0.00002284561,0.0002643589,0.00001584435,0.00005491521,0.00001520351,0.00004484796,0.9153886,0.00009875418,0.0001625905,0.00003002665,0.08387279],"study_design_scores_gemma":[0.0006995521,0.00005483908,0.0003942963,0.00103693,0.00004154825,0.000006320696,0.0001541721,0.9930806,0.0004355224,0.002086953,0.001525848,0.0004833831],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02262266,0.0008130932,0.9735425,0.00006097187,0.001051133,0.0002820237,0.000001577605,0.0008368951,0.0007891314],"genre_scores_gemma":[0.9715748,0.00143722,0.02664414,0.00006202319,0.00005061761,0.00009614183,0.000001829449,0.00006031535,0.00007292864],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9489521,"threshold_uncertainty_score":0.9999232,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.07088437641741967,"gpt":0.2639037212132092,"spread":0.1930193447957895,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001257931,0.000285305,0.0002907164,0.0003852866,0.0003897061,0.000634975,0.001535596,0.0001268319,0.00001120952],"category_scores_gemma":[0.000002472696,0.0002886791,0.000158809,0.001040906,0.00002598112,0.0003552622,0.00006594507,0.000855629,0.00004171117],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002057697,"about_ca_system_score_gemma":0.00005595399,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001155864,"about_ca_topic_score_gemma":0.0003674533,"domain_scores_codex":[0.9969878,0.0001194191,0.0004828291,0.001184754,0.0004582585,0.0007669833],"domain_scores_gemma":[0.9981716,0.0002601758,0.00006414887,0.001342697,0.00002585082,0.0001354909],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000860665,0.0004685963,0.00009651792,0.00008458191,0.000193668,0.0005304985,0.004012673,0.6227561,0.001269276,0.004781408,0.0007274417,0.3649932],"study_design_scores_gemma":[0.0003763443,0.00004086727,0.00001520796,0.001046692,0.00002858745,0.00004119608,0.0001740415,0.9893612,0.0001278741,0.0002682234,0.00820746,0.0003123407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01487219,0.00157733,0.9756982,0.0004994077,0.005818377,0.000278878,0.00001471873,0.000697336,0.0005435296],"genre_scores_gemma":[0.9971548,0.0001487212,0.001233602,0.0004346527,0.0005638926,0.00004092552,0.000009227427,0.00004105657,0.0003730656],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9822827,"threshold_uncertainty_score":0.9999565,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02139506897830762,"gpt":0.2736101373479478,"spread":0.2522150683696401,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003918563,0.0002034462,0.0002750684,0.000215946,0.0006178226,0.000277333,0.0002876399,0.0002080688,0.000001999081],"category_scores_gemma":[0.00002738131,0.0002269023,0.00006469337,0.0007857979,0.00005336893,0.0001262891,0.00001290357,0.0004720315,8.9658e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008105814,"about_ca_system_score_gemma":0.00009056678,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005937122,"about_ca_topic_score_gemma":0.00000468501,"domain_scores_codex":[0.9983718,0.000102204,0.0003979708,0.0004770698,0.0001266208,0.0005242762],"domain_scores_gemma":[0.9984214,0.00116916,0.00006896324,0.0002195976,0.00005170397,0.00006919257],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002413341,0.00001827564,0.00007837021,0.00001866449,0.00001338541,0.000003029766,0.0001070538,0.8109261,0.00001827009,0.000164591,0.0001066137,0.1885215],"study_design_scores_gemma":[0.0006779845,0.00005682162,0.00002609226,0.0005261275,0.00002451527,0.000008215825,0.000005966873,0.996997,0.00009352627,0.0009862914,0.0003963232,0.0002011226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009587821,0.000114887,0.9767683,0.0002429387,0.01275198,0.0003028152,7.309683e-7,0.000141468,0.00008902251],"genre_scores_gemma":[0.8483511,0.000004902007,0.1490331,0.0002595608,0.002306024,0.000008175321,0.000002017977,0.00001577312,0.00001936734],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8387632,"threshold_uncertainty_score":0.9252808,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05843924637607877,"gpt":0.3312098925092904,"spread":0.2727706461332116,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001399615,0.000224856,0.0001773729,0.0003235457,0.0005012885,0.0008729413,0.0002116375,0.00009063543,0.00005662697],"category_scores_gemma":[0.000002297529,0.0002127289,0.0001126056,0.0007482333,0.0000277248,0.0005606372,0.000002780277,0.0002797396,0.00002765488],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002245641,"about_ca_system_score_gemma":0.0001232893,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007103668,"about_ca_topic_score_gemma":0.0001273411,"domain_scores_codex":[0.9978427,0.0001734342,0.0004228833,0.0006196924,0.000541256,0.000399994],"domain_scores_gemma":[0.9991499,0.0002097907,0.00008645128,0.0003446542,0.000118847,0.00009031076],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003328398,0.00007505951,0.00003745934,0.00006537792,0.0001190151,0.000006135879,0.0006062236,0.2133389,0.0004935016,0.002116782,0.0004303067,0.7826779],"study_design_scores_gemma":[0.0007682334,0.0002489356,0.00001686354,0.0005515946,0.00005747661,0.00001093099,0.000189074,0.9824939,0.004011735,0.0005931726,0.01079705,0.000261021],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01076111,0.0006604414,0.9818124,0.0006345423,0.004598679,0.0007194811,0.00000193461,0.0004228402,0.0003885492],"genre_scores_gemma":[0.9964039,0.00007050679,0.002343892,0.0003001719,0.0004878143,0.0002768485,0.00000537592,0.00002730506,0.00008414454],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9856429,"threshold_uncertainty_score":0.8674831,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03345995724569627,"gpt":0.3115114443347758,"spread":0.2780514870890795,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005628894,0.0005033512,0.0007917238,0.0007987865,0.0005349329,0.0005984456,0.001465651,0.0003306334,0.00001362098],"category_scores_gemma":[0.000005479896,0.0005637577,0.0007117009,0.001468485,0.00002861634,0.0002907371,0.00004047453,0.0008561349,0.00001066704],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006330769,"about_ca_system_score_gemma":0.0003215905,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001200154,"about_ca_topic_score_gemma":0.003043038,"domain_scores_codex":[0.9967031,0.0001745828,0.0007450724,0.001304789,0.0004485058,0.0006238788],"domain_scores_gemma":[0.9970441,0.0008246402,0.0002686409,0.001539025,0.0001595718,0.0001640384],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005036516,0.0001024661,0.00008335903,0.0000995412,0.001048042,0.00000330056,0.001237628,0.8152429,0.00001023658,0.0001486545,0.0001285391,0.1818449],"study_design_scores_gemma":[0.0003634439,0.00007937517,0.0001496073,0.0007266681,0.0007888085,6.077356e-7,0.0001232734,0.9948718,0.0007419863,0.0004832211,0.001106793,0.0005644358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006799109,0.0001139033,0.9866186,0.0007846292,0.003977819,0.0008337428,0.0002327347,0.0002912408,0.0003481998],"genre_scores_gemma":[0.9293692,0.0001451516,0.06778927,0.0007604368,0.0005210945,0.0004837734,0.0000962241,0.00002769062,0.0008072201],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.92257,"threshold_uncertainty_score":0.9996814,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Public key infrastructure; Reuse; Computer science; Computer security; Public-key cryptography; Ecology; Biology","retraction":null,"screen_n_in":null,"score":{"opus":0.05725401636371177,"gpt":0.2926534729287527,"spread":0.2353994565650409,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000553411,0.00009412732,0.000145876,0.00006509647,0.0006067717,0.0002601013,0.0001002789,0.00007669712,0.00001004776],"category_scores_gemma":[0.000007353382,0.00008789159,0.00004097451,0.0002326023,0.00008854606,0.0003539759,0.000002445533,0.0001542809,0.000003234501],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004378259,"about_ca_system_score_gemma":0.00002949731,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002180604,"about_ca_topic_score_gemma":0.0009663219,"domain_scores_codex":[0.9990673,0.00009210321,0.0002108012,0.0002282008,0.0001778762,0.0002236926],"domain_scores_gemma":[0.9995496,0.0001765247,0.00005918002,0.000115079,0.00003668078,0.00006289245],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000857463,0.00005763019,0.001573064,0.0004036337,0.0001650201,0.00001455709,0.03222402,0.0009674676,0.01387521,0.0006701469,0.00002287273,0.9499406],"study_design_scores_gemma":[0.005432375,0.0008417222,0.03186616,0.02075817,0.001610256,0.0001291704,0.03656709,0.5379598,0.1691578,0.005719397,0.1852338,0.004724252],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9454067,0.001720175,0.04816422,0.001569763,0.001559969,0.0003916928,0.00002453177,0.0002397397,0.000923183],"genre_scores_gemma":[0.9988245,0.0006649218,0.0000590889,0.0000163095,0.0002993788,0.00002372285,5.260505e-7,0.0000139998,0.00009753676],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9452164,"threshold_uncertainty_score":0.4666859,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.07147286545131806,"gpt":0.2445094101378791,"spread":0.173036544686561,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002682306,0.0001580857,0.0002848901,0.0002516138,0.0005225146,0.00008312859,0.0001193581,0.0001081827,0.000003314354],"category_scores_gemma":[0.00001399946,0.0001840008,0.0001082567,0.0003630946,0.00004340119,0.00009120427,0.000004584545,0.0002079104,0.000007875177],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007928473,"about_ca_system_score_gemma":0.0000383752,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003471619,"about_ca_topic_score_gemma":0.00002584765,"domain_scores_codex":[0.9987771,0.000002601233,0.0004498891,0.0004449825,0.00002832529,0.0002971272],"domain_scores_gemma":[0.9994303,0.0001273739,0.0001462469,0.0002067289,0.00003589996,0.00005346236],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001033875,0.000166176,0.00003744449,0.0001296365,0.00008776657,5.460901e-7,0.0006951902,0.4971082,0.00006682847,0.3684679,0.0004806967,0.1326562],"study_design_scores_gemma":[0.0004302918,0.00003889854,0.00004260321,0.0001603319,0.0000209232,0.000001807756,0.00005452845,0.9586715,0.0001543174,0.03363706,0.006595433,0.000192346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001346801,0.0007461293,0.9949425,0.0004461032,0.0003983166,0.0004589149,0.00007620968,0.00006884609,0.001516155],"genre_scores_gemma":[0.9654757,0.00006381384,0.03271444,0.0003225957,0.000124006,0.0003547461,0.000003551995,0.000027563,0.0009136127],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9641289,"threshold_uncertainty_score":0.7503335,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04805965462570868,"gpt":0.2926105841077031,"spread":0.2445509294819944,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001077367,0.0001540997,0.0002330262,0.0002187009,0.0003035507,0.0001122325,0.000373316,0.00008933419,0.00001459155],"category_scores_gemma":[0.00001083981,0.0001599361,0.00005813868,0.00100101,0.0001282377,0.00006482469,0.00001811122,0.0005072644,0.000005127511],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009087776,"about_ca_system_score_gemma":0.00007501242,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001493336,"about_ca_topic_score_gemma":0.0000579047,"domain_scores_codex":[0.9978862,0.0008964805,0.0004583591,0.0003200477,0.0001479524,0.0002909387],"domain_scores_gemma":[0.9981667,0.001099981,0.00009740265,0.0005157773,0.00005783988,0.00006233248],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002531348,0.00005375067,0.00001884427,0.00001329902,0.00002591724,0.000003492133,0.001389702,0.910685,0.0003243751,0.01179731,0.0001412191,0.07552178],"study_design_scores_gemma":[0.0003205591,0.00006679667,0.00008762871,0.0004497407,0.00001386849,0.00002155113,0.00007178554,0.9916987,0.0002369023,0.0003905087,0.006491407,0.0001505662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004541672,0.01093861,0.9818404,0.001633935,0.0003420815,0.0003175144,4.117849e-7,0.0001784622,0.0002069144],"genre_scores_gemma":[0.9747368,0.005134054,0.01984666,0.0000796582,0.00003164342,0.0000404956,0.000001561663,0.00001535727,0.0001138144],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9701951,"threshold_uncertainty_score":0.6522006,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.009984052237595681,"gpt":0.2268956300171319,"spread":0.2169115777795362,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001553464,0.0002043307,0.0002186984,0.000425688,0.0003230884,0.0001649538,0.0003624251,0.0001352259,0.000008549359],"category_scores_gemma":[0.00001123993,0.0001976199,0.00008150456,0.001313555,0.00004267304,0.001854531,0.000003315005,0.0001367935,0.000002543003],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001659489,"about_ca_system_score_gemma":0.0001513355,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005217125,"about_ca_topic_score_gemma":0.0000134896,"domain_scores_codex":[0.9986358,0.00004153926,0.0006007161,0.0002146346,0.0002553102,0.0002520007],"domain_scores_gemma":[0.9986289,0.0001894406,0.0003481762,0.0003718368,0.0004082461,0.00005340899],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007462817,0.00008061137,0.00001121107,0.00006281223,0.00004429155,3.829443e-7,0.0002505908,0.9463896,0.000006016914,0.0008234917,0.0001982472,0.05205815],"study_design_scores_gemma":[0.001062405,0.0001422697,0.00002871024,0.000248182,0.00004535457,0.000003625043,0.00004753313,0.9941267,0.001605749,0.00007764009,0.002421714,0.000190148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001036106,0.00002831348,0.9970764,0.0003753649,0.0008966116,0.0006847142,0.00005093687,0.0002688695,0.0005151804],"genre_scores_gemma":[0.413074,0.0001908098,0.5851631,0.0004425213,0.00007996233,0.0001306436,0.0007994159,0.00001831876,0.0001012393],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4129704,"threshold_uncertainty_score":0.8058708,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02056570086020206,"gpt":0.2341141865148691,"spread":0.213548485654667,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006464183,0.0002537897,0.0003288642,0.001111489,0.0002385009,0.0003476586,0.0006944619,0.000191048,0.00001265395],"category_scores_gemma":[0.00002935255,0.0002671163,0.00009796354,0.004129226,0.0000317558,0.002057281,0.00001626673,0.0004721617,0.00001518336],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000271561,"about_ca_system_score_gemma":0.0002195749,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001875227,"about_ca_topic_score_gemma":0.00003515186,"domain_scores_codex":[0.9979417,0.0001107502,0.000923032,0.0002874729,0.0003174421,0.0004195724],"domain_scores_gemma":[0.9987808,0.0001886193,0.0002468864,0.0004742698,0.00019808,0.0001113385],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002883856,0.00005005121,0.00001790664,0.00002272489,0.00002239752,7.382156e-7,0.002022421,0.8329552,0.000005797373,0.00110443,0.0006712929,0.1630982],"study_design_scores_gemma":[0.0008119151,0.00003741175,0.00006900945,0.000427126,0.00001251908,0.000003513152,0.0003141539,0.9958078,0.0001474507,0.0001222714,0.002031354,0.0002154299],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0006309758,0.00002017912,0.9890987,0.0002368612,0.0005699936,0.0006121101,0.000003198661,0.0002137007,0.008614259],"genre_scores_gemma":[0.8072459,0.00002476789,0.1913566,0.0007076585,0.00005354821,0.0000669774,0.00002907551,0.00001273319,0.0005028156],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8066149,"threshold_uncertainty_score":0.9999781,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.008432641474071963,"gpt":0.2258628167576893,"spread":0.2174301752836174,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004144294,0.000311486,0.0003870071,0.000253614,0.0004076036,0.0001645929,0.0005212259,0.0001664015,0.000008267671],"category_scores_gemma":[0.000002619237,0.0002866756,0.00009420227,0.001515521,0.0000789379,0.00037804,0.000003742248,0.0005660668,0.00001367484],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001773353,"about_ca_system_score_gemma":0.000262267,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003251021,"about_ca_topic_score_gemma":0.0005039559,"domain_scores_codex":[0.9978135,0.0002396017,0.0003833429,0.0006631075,0.0002856754,0.0006147676],"domain_scores_gemma":[0.998598,0.0005465914,0.0001190095,0.0005237666,0.0001151329,0.00009744448],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000229816,0.0001117816,0.0007187417,0.000007282602,0.0001046125,0.00001828917,0.00007279327,0.6405394,0.000005778039,0.003861821,0.0001398989,0.3541898],"study_design_scores_gemma":[0.004281371,0.0002495737,0.002230645,0.000771234,0.0001005265,0.00001793277,0.00003379029,0.9860236,0.000170745,0.00122611,0.004370399,0.0005240813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0041085,0.0003333162,0.9893519,0.001093578,0.002227941,0.0006503467,0.000002140483,0.0003733323,0.001858921],"genre_scores_gemma":[0.9954402,0.00007916873,0.002587096,0.0009629392,0.0002526881,0.000318394,0.000001205065,0.00001964446,0.0003386581],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9913317,"threshold_uncertainty_score":0.9999585,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.07004308864662626,"gpt":0.3600312389024541,"spread":0.2899881502558278,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003643297,0.0002724688,0.0002786545,0.000245829,0.0005534651,0.0002732749,0.0004495017,0.0001090393,0.00001268424],"category_scores_gemma":[0.00000548012,0.0002644027,0.0002018764,0.0005516458,0.00004869945,0.0003629297,0.000006295045,0.000354101,0.00002952701],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001657179,"about_ca_system_score_gemma":0.0002130785,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006684455,"about_ca_topic_score_gemma":0.0001545254,"domain_scores_codex":[0.9981064,0.0001567241,0.0004008166,0.0006173245,0.0002338616,0.0004849418],"domain_scores_gemma":[0.9984534,0.0006580032,0.0001375801,0.0005155478,0.0001315984,0.0001038993],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001205629,0.002349828,0.00004647755,0.0003690724,0.0006723717,0.00005428283,0.005595575,0.1816608,0.002220722,0.008427436,0.002670325,0.7947275],"study_design_scores_gemma":[0.004224177,0.0007078911,0.0001000923,0.001339145,0.00004784337,0.000003155435,0.000218394,0.9548179,0.02205738,0.0007694116,0.01520271,0.0005119208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00007934244,0.000007155574,0.9617648,0.000368584,0.0007249662,0.03623458,0.00000998729,0.0002481005,0.0005624929],"genre_scores_gemma":[0.5904623,0.000007797672,0.09579054,0.00435012,0.0003401735,0.3065632,0.000003785532,0.00005234496,0.002429694],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8659742,"threshold_uncertainty_score":0.9999808,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01536674993878548,"gpt":0.2390692082809612,"spread":0.2237024583421758,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006142269,0.0004847123,0.0004495191,0.000619351,0.0008881039,0.000563369,0.0005864783,0.0003061091,0.00004356042],"category_scores_gemma":[0.000007588725,0.0005674949,0.0001153598,0.002716134,0.00009345738,0.0007596912,0.00001059826,0.0008781032,0.000006653977],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000446693,"about_ca_system_score_gemma":0.0001210268,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001289379,"about_ca_topic_score_gemma":0.005235395,"domain_scores_codex":[0.9973176,0.00025411,0.0009499796,0.0006148446,0.0001948029,0.0006686398],"domain_scores_gemma":[0.9977694,0.000848713,0.0002328943,0.0009261958,0.0001374738,0.00008533515],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008499313,0.0001456564,0.0005653975,0.00007789861,0.00009942395,0.000002175894,0.0002409849,0.7491809,0.000183934,0.0001986982,0.00001909212,0.2492009],"study_design_scores_gemma":[0.001465113,0.00004125339,0.0005038535,0.002345821,0.0001272852,0.000003150362,0.0001326309,0.9866993,0.003276164,0.0001633579,0.00471603,0.000526058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007631443,0.001369539,0.9847479,0.0002115819,0.0008013663,0.0005667374,0.00001162466,0.0003092077,0.004350524],"genre_scores_gemma":[0.9816022,0.003905254,0.01301521,0.000169432,0.0001107425,0.0003598296,0.0000266297,0.0001039499,0.0007067862],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9739707,"threshold_uncertainty_score":0.9996777,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.0112403844052351,"gpt":0.2257025475345371,"spread":0.214462163129302,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002813608,0.0001901165,0.0002077706,0.000298858,0.0005124913,0.0001506865,0.0001587667,0.0000680772,0.00002038703],"category_scores_gemma":[0.000003674552,0.0001731945,0.0001170295,0.0008189544,0.00003093526,0.0004349926,0.000001766766,0.0001544179,0.00003486404],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001270429,"about_ca_system_score_gemma":0.00001696803,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006081875,"about_ca_topic_score_gemma":0.0001412703,"domain_scores_codex":[0.9990035,0.00001487227,0.0002157271,0.0003355916,0.000153145,0.0002771311],"domain_scores_gemma":[0.9992902,0.0001642082,0.0001270535,0.0002929512,0.0001157994,0.000009819234],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004506996,0.00006462658,0.00002976802,0.0001742967,0.0001406063,0.000004056063,0.00001364696,0.9632309,0.00002560174,0.0296164,0.0001486092,0.006100796],"study_design_scores_gemma":[0.001365088,0.00005138763,0.00002414242,0.001396094,0.0005582553,0.000002581462,0.0002650911,0.9841967,0.0006485488,0.002093056,0.009001385,0.0003977231],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03447643,0.00002265909,0.961657,0.0002386249,0.000691237,0.0003725961,0.000001735521,0.0002847693,0.002254975],"genre_scores_gemma":[0.9966917,0.000003272388,0.0009221013,0.0006975973,0.0003919646,0.0001739046,0.000007299434,0.00003477344,0.001077382],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9622152,"threshold_uncertainty_score":0.7062666,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.009794529342139794,"gpt":0.2280464038434332,"spread":0.2182518745012934,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005189681,0.0002061363,0.0002681346,0.0003366244,0.0003994299,0.0001580965,0.0001194777,0.00007029706,0.0000531154],"category_scores_gemma":[0.00002182752,0.0002044871,0.00005064829,0.001458493,0.0001001827,0.0003834595,0.000006528348,0.0004389773,0.000006436523],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005030633,"about_ca_system_score_gemma":0.00001453807,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002493176,"about_ca_topic_score_gemma":0.001358701,"domain_scores_codex":[0.9987349,0.00004639369,0.0002748384,0.0004278937,0.0001204828,0.0003954757],"domain_scores_gemma":[0.9992887,0.0003379911,0.00009862062,0.0002006636,0.00005199104,0.00002208003],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001794432,0.00003811554,0.02029241,0.00003230699,0.00004716242,0.00001196992,0.00008119812,0.8757799,0.00003010597,0.0005134328,0.00001596905,0.102978],"study_design_scores_gemma":[0.0006309951,0.0000219885,0.001344904,0.000896856,0.0001087885,0.000002069637,0.0003892775,0.9895434,0.00005264865,0.001022316,0.00564259,0.0003441841],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1504942,0.00006664905,0.8473862,0.0001604805,0.0002615521,0.0001955754,9.324552e-7,0.0001485356,0.001285835],"genre_scores_gemma":[0.9973908,0.00003186601,0.00127807,0.001017227,0.0001674295,0.0000383842,0.000002884888,0.00002234006,0.00005100428],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8468966,"threshold_uncertainty_score":0.8338742,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01809593909102343,"gpt":0.2449918824473731,"spread":0.2268959433563497,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.001318254,0.0008171341,0.0007726333,0.00108316,0.001405832,0.0009330098,0.0006743399,0.0007886391,0.00002160294],"category_scores_gemma":[0.0000317076,0.0009265403,0.0002796186,0.004076483,0.000162776,0.001051863,0.00002580595,0.001614702,0.00001638154],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000519335,"about_ca_system_score_gemma":0.0001740271,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001554881,"about_ca_topic_score_gemma":0.0002968183,"domain_scores_codex":[0.9944385,0.0006659208,0.00139749,0.001755304,0.00053129,0.001211489],"domain_scores_gemma":[0.996582,0.001369994,0.0004813062,0.001150498,0.000178267,0.0002378828],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000152058,0.0002364077,0.001017745,0.00006569985,0.00008228316,0.000008139263,0.0004044,0.3734786,0.0001006102,0.0002899628,0.00008574938,0.6240784],"study_design_scores_gemma":[0.001660298,0.0002585705,0.003985525,0.002108454,0.0001981572,0.00002110543,0.00004602483,0.9869015,0.001629686,0.001009054,0.001283958,0.0008977246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02688934,0.003604596,0.958419,0.0005804095,0.008780602,0.0009975652,0.000006789264,0.0005361607,0.0001854935],"genre_scores_gemma":[0.9870195,0.005663986,0.005664313,0.0004816126,0.0006165829,0.000218151,0.00001091102,0.0000757134,0.0002492185],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9601302,"threshold_uncertainty_score":0.9998942,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03567703929807289,"gpt":0.2848560527987774,"spread":0.2491790135007045,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003697112,0.0001999244,0.0002059326,0.0002141522,0.0006878154,0.0002429629,0.0004188489,0.00006789417,0.000002709778],"category_scores_gemma":[0.000001763884,0.0001888022,0.0001035434,0.0005853754,0.00002107101,0.0004767404,0.000003256856,0.0002418597,0.000002535316],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001345426,"about_ca_system_score_gemma":0.0001800853,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003611969,"about_ca_topic_score_gemma":0.0000701585,"domain_scores_codex":[0.9985474,0.00005420815,0.0003005306,0.0004477932,0.0002264313,0.0004236383],"domain_scores_gemma":[0.999025,0.0003012079,0.00007570448,0.0004466726,0.00009594917,0.00005544191],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005174265,0.00005909866,0.00002420279,0.00006099306,0.00003645319,0.000001655969,0.0001788652,0.8372188,0.0002011329,0.0003623767,0.00001990784,0.1617848],"study_design_scores_gemma":[0.0007760976,0.000129854,0.000009006455,0.000601606,0.00003182136,0.00000175792,0.00006336974,0.9881468,0.00943101,0.0001096396,0.000485189,0.0002138788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008885629,0.00005741155,0.9885253,0.0004510818,0.0007790571,0.0003399235,0.000001628778,0.0002338278,0.0007261856],"genre_scores_gemma":[0.9361776,0.00002307381,0.06269784,0.0007128692,0.0000926763,0.0001364893,0.000001350348,0.00001466873,0.0001434663],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9272919,"threshold_uncertainty_score":0.769913,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04050586423524514,"gpt":0.2979850448790511,"spread":0.257479180643806,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.001019027,0.0005938482,0.0005948617,0.0006504526,0.00363374,0.001489032,0.009277064,0.0006641508,0.0000760625],"category_scores_gemma":[0.0009922803,0.0007333131,0.0002413534,0.002138754,0.000752144,0.0007642081,0.0006763401,0.001473204,0.00001487248],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005813031,"about_ca_system_score_gemma":0.0005384995,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004193935,"about_ca_topic_score_gemma":0.00008884207,"domain_scores_codex":[0.9957119,0.0006844777,0.001076016,0.001214716,0.0003832325,0.0009296906],"domain_scores_gemma":[0.9920384,0.00196328,0.0005199122,0.004994022,0.0003651702,0.0001192706],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000961609,0.0002528661,0.0000186586,0.0000998205,0.0001624192,0.000003594683,0.0001534632,0.6129727,0.00007804551,0.0002935654,0.001441547,0.3844272],"study_design_scores_gemma":[0.001352787,0.0003164107,0.00001730508,0.001737804,0.0001997551,0.00001954756,0.0002847838,0.9888748,0.0008275382,0.00461751,0.001175455,0.0005762978],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0007525617,0.0006434435,0.9819108,0.01003136,0.003686797,0.001324831,0.00003053075,0.001226196,0.0003934904],"genre_scores_gemma":[0.8721425,0.001192444,0.1254985,0.000418734,0.00006769454,0.0002442918,0.00005435781,0.00005602172,0.0003254538],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8713899,"threshold_uncertainty_score":0.9995475,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1065553545176779,"gpt":0.2887770755511856,"spread":0.1822217210335076,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003956642,0.0001477001,0.0002180459,0.0002291436,0.0002822577,0.0001632483,0.0002414811,0.00007101209,5.011765e-7],"category_scores_gemma":[0.000009770187,0.0001692303,0.00005905245,0.0006717377,0.00002217273,0.0005508654,0.000005189253,0.0002026203,3.986661e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001771351,"about_ca_system_score_gemma":0.00003996996,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009599137,"about_ca_topic_score_gemma":0.0002262033,"domain_scores_codex":[0.9987431,0.0001469872,0.0004309268,0.0003269787,0.0001251764,0.0002268298],"domain_scores_gemma":[0.9991432,0.0002788304,0.0001223857,0.0003183568,0.00009310144,0.00004417018],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002379351,0.0001286547,0.0001523317,0.0000276352,0.00002215656,6.914059e-7,0.0001275069,0.9496541,0.00003983244,0.0004088822,0.00003009354,0.04938432],"study_design_scores_gemma":[0.001164313,0.00003060223,0.0007328254,0.0003035426,0.00001596808,0.000001219622,0.00007186242,0.9968026,0.0001935672,0.0003035888,0.0002457221,0.0001341659],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003657715,0.0001180051,0.9935875,0.001007778,0.0007630236,0.0006183673,0.00004620706,0.0001787745,0.00002262068],"genre_scores_gemma":[0.9382312,0.0001087703,0.06122704,0.00009081804,0.00002995679,0.0001832141,0.0001119184,0.000008693684,0.000008441068],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9345734,"threshold_uncertainty_score":0.6901011,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}