{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":117,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":117,"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":"23d21b3c2611","filters":{"venue":"IEEE/ACM Transactions on Networking"}},"results":[{"id":"W2140490525","doi":"10.1109/90.842137","title":"Modeling TCP Reno performance: a simple model and its empirical validation","year":2000,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1181,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Computer science; H-TCP; TCP acceleration; Flow (mathematics); Communication source; TCP global synchronization; File Transfer Protocol; Zeta-TCP; CUBIC TCP; Transfer (computing); Simple (philosophy); Computer network; Network congestion; Operating system; Mechanics; The Internet; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.04610366903569576,"gpt":0.2720498297292525,"spread":0.2259461606935567,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000279543,0.0002331271,0.0002190229,0.0001154474,0.0005928735,0.0001894777,0.0004799818,0.000134861,0.00005862398],"category_scores_gemma":[0.000002639398,0.0002369771,0.0000871055,0.0004387541,0.00002246856,0.0005863941,0.000007765963,0.0003731343,0.00004963252],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005309984,"about_ca_system_score_gemma":0.00006608979,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004139325,"about_ca_topic_score_gemma":0.000008454645,"domain_scores_codex":[0.9982628,0.00007816716,0.0003471641,0.0005455809,0.0003167102,0.0004495987],"domain_scores_gemma":[0.9991139,0.0001070776,0.00004501068,0.0005056254,0.00006632223,0.0001621103],"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.00002088476,0.0000268236,0.000009727057,0.000003706211,0.00001127979,0.000001208449,0.0001351606,0.5923687,0.00001484465,0.00004593603,0.00004789873,0.4073138],"study_design_scores_gemma":[0.0005103399,0.00007417695,0.00001289144,0.00005529985,0.00002746866,0.0000199863,0.000006661024,0.9972359,0.00007588955,0.0007601094,0.0009596107,0.0002616638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2483481,0.0001895089,0.7497128,0.0005393955,0.0003231675,0.0001706256,0.000001785902,0.0003090939,0.0004055655],"genre_scores_gemma":[0.9926538,0.000696704,0.005234919,0.0005630789,0.000309274,0.00005193306,0.000002986763,0.0000224475,0.0004647982],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7444779,"threshold_uncertainty_score":0.9663647,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2019267322","doi":"10.1109/90.836475","title":"Secure group communications using key graphs","year":2000,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":1096,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Cairo University; York University","keywords":"Rekeying; Computer science; Communication in small groups; Group key; Secure multicast; Key (lock); Key management; Multicast; Scalability; Computer network; Joins; Computer security; Distributed computing; Encryption; Source-specific multicast; Database; Reliable multicast","retraction":null,"screen_n_in":null,"score":{"opus":0.0416883586162558,"gpt":0.2717763594392165,"spread":0.2300880008229607,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003174658,0.0003532304,0.0003159103,0.0002450645,0.001212586,0.0003316893,0.003151102,0.000246317,0.0001319339],"category_scores_gemma":[0.000003399171,0.000399254,0.0002603984,0.00159516,0.0001830687,0.0005914363,0.0000312695,0.0009564949,0.0001033333],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001413241,"about_ca_system_score_gemma":0.00004203249,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009966441,"about_ca_topic_score_gemma":0.000264381,"domain_scores_codex":[0.9973963,0.0003032234,0.0004925892,0.0006440923,0.0004461074,0.0007177272],"domain_scores_gemma":[0.9956354,0.0004836204,0.0001255189,0.00348478,0.00007119701,0.0001995039],"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.00003344193,0.0004769741,0.0001122826,0.00001643284,0.0001566658,0.00003007097,0.002428155,0.3831496,0.0002810629,0.006696667,0.0004380031,0.6061806],"study_design_scores_gemma":[0.0006262637,0.0001040225,0.00009005388,0.0002891131,0.00006866436,0.0001419012,0.00006226976,0.9440047,0.0002251501,0.01010634,0.0435353,0.0007461881],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02791005,0.0009958459,0.9635932,0.001050983,0.002415374,0.0004113887,0.000008312893,0.0009382092,0.002676567],"genre_scores_gemma":[0.9036347,0.001276725,0.09377337,0.0007967375,0.0003275164,0.00003586405,0.000006641907,0.00005004026,0.0000984225],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8757246,"threshold_uncertainty_score":0.9998459,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2112947567","doi":"10.1109/tnet.2005.852876","title":"Non-convex optimization and rate control for multi-class services in the Internet","year":2005,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":284,"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; Mathematical optimization; Sigmoid function; The Internet; Concave function; Convergence (economics); Network congestion; Dual (grammatical number); Class (philosophy); Convex function; Transmission (telecommunications); Function (biology); Regular polygon; Computer network; Telecommunications; Artificial neural network; Artificial intelligence; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01933816349824027,"gpt":0.2448934649100482,"spread":0.2255553014118079,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005783368,0.0001910744,0.0002048751,0.0001095368,0.0002122851,0.0002586835,0.0006853866,0.00009726387,0.000006350968],"category_scores_gemma":[0.000002557376,0.0001563307,0.00007698104,0.0002975285,0.00003594936,0.0003677419,0.000005306272,0.0002426049,0.000006999774],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004208077,"about_ca_system_score_gemma":0.00002408732,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001744843,"about_ca_topic_score_gemma":0.0003825094,"domain_scores_codex":[0.998712,0.000123353,0.0003005108,0.000393351,0.0001336451,0.0003371098],"domain_scores_gemma":[0.9989095,0.0004741499,0.00009900801,0.0004026722,0.00005465472,0.00006002574],"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.0000393966,0.00006867809,0.00004549678,0.000008421811,0.00002400816,0.000001621082,0.0006381022,0.7483197,0.000009404403,0.0002029186,0.00005917102,0.250583],"study_design_scores_gemma":[0.002289432,0.0000748841,0.0001251963,0.00007546343,0.00002707136,0.000008049691,0.00005706154,0.9924671,0.00003622083,0.00006215968,0.004611401,0.0001659689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00257362,0.0002199464,0.9925183,0.003098761,0.00077851,0.0006421603,0.000003017524,0.0001049198,0.00006075198],"genre_scores_gemma":[0.9721674,0.00009370369,0.02394998,0.003027171,0.0003892083,0.00022712,0.000002355943,0.00001524108,0.0001278358],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9695938,"threshold_uncertainty_score":0.637498,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3013536937","doi":"10.1109/tnet.2020.2979807","title":"Efficient Computing Resource Sharing for Mobile Edge-Cloud Computing Networks","year":2020,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":251,"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":"Higher Education Discipline Innovation Project; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Compute Canada","keywords":"Cloud computing; Utility computing; Computer science; Mobile edge computing; Distributed computing; Profit maximization; Edge computing; Mobile cloud computing; Cloud testing; Cloud computing security; Computer network; Profit (economics); Microeconomics; Economics; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.03509039645127045,"gpt":0.2591921747431791,"spread":0.2241017782919087,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0009455246,0.0005253579,0.0005710587,0.0001881669,0.001869037,0.0006024839,0.002207877,0.0002217178,0.00000332759],"category_scores_gemma":[0.00003016912,0.0005826147,0.0004189672,0.001433876,0.00007181369,0.0001322852,0.0001628072,0.0009424278,0.00002944947],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001678003,"about_ca_system_score_gemma":0.00006246965,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001118167,"about_ca_topic_score_gemma":0.000001332429,"domain_scores_codex":[0.9957727,0.0001316678,0.0008578243,0.00141884,0.0004545826,0.001364428],"domain_scores_gemma":[0.9969382,0.001195543,0.0003314626,0.001004814,0.0001322754,0.0003977419],"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.00002809573,0.00006572354,0.00005701426,0.00004028205,0.00004757609,0.000009540433,0.001845647,0.7904276,0.00004553238,0.00005838712,0.00135871,0.2060159],"study_design_scores_gemma":[0.0007556719,0.0002310299,0.00003061956,0.000321084,0.00003763501,0.00002124586,0.00008540262,0.972948,0.000272409,0.00009546476,0.02459884,0.0006026399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0191274,0.000374373,0.9595454,0.0006012223,0.01790654,0.0008235594,8.865269e-7,0.001185636,0.0004349805],"genre_scores_gemma":[0.9311091,0.000007612638,0.05147619,0.001750339,0.01548717,0.00002852939,0.000006228402,0.00009293656,0.00004187175],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9119817,"threshold_uncertainty_score":0.9996625,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1971246165","doi":"10.1109/tnet.2012.2194508","title":"FireCol: A Collaborative Protection Network for the Detection of Flooding DDoS Attacks","year":2012,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":161,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Public Works and Government Services Canada; University of Waterloo","funders":"","keywords":"Denial-of-service attack; Botnet; Computer science; Computer security; Software deployment; Flooding (psychology); Application layer DDoS attack; Computer network; The Internet; Overhead (engineering); World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.03682731981442335,"gpt":0.2635017878676642,"spread":0.2266744680532408,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0010669,0.0002529548,0.0002643324,0.0001407108,0.001442395,0.0001266064,0.0005710604,0.0002024112,0.00001262746],"category_scores_gemma":[0.00003686914,0.0002143698,0.0002195794,0.001743645,0.00006974177,0.0007332876,0.00001647435,0.0004679815,0.00001086936],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001375494,"about_ca_system_score_gemma":0.00004799498,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004383426,"about_ca_topic_score_gemma":0.0001639191,"domain_scores_codex":[0.9979728,0.0002244019,0.0004666071,0.0003745061,0.0003274777,0.0006342084],"domain_scores_gemma":[0.9977946,0.0007803586,0.0004156959,0.0006963838,0.00020768,0.0001053327],"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.0002177051,0.000154098,0.00003474367,0.00003429335,0.0001476288,3.140862e-7,0.001265733,0.151013,0.002224302,0.0004521495,0.0002401366,0.8442159],"study_design_scores_gemma":[0.001063725,0.0008733307,0.0003761934,0.0002988618,0.0001597934,0.00004001089,0.0001677651,0.8585576,0.05137226,0.003112134,0.08338158,0.0005966855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005223933,0.0009329313,0.9824183,0.0004108239,0.009265378,0.001429033,0.000004491463,0.0002356433,0.00007948411],"genre_scores_gemma":[0.9867715,0.0002911637,0.009841548,0.0001420053,0.002192455,0.0006694091,0.000001044107,0.00002940153,0.00006151628],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9815475,"threshold_uncertainty_score":0.9998576,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2104354412","doi":"10.1109/tnet.2008.2005219","title":"Delay Aware Link Scheduling for Multi-Hop TDMA Wireless Networks","year":2008,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":161,"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":"","keywords":"Computer science; Time division multiple access; Computer network; Scheduling (production processes); Router; Transmission delay; Wireless network; Distributed computing; Wireless; Mathematical optimization; Network packet; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.05488659881913505,"gpt":0.2781040589740816,"spread":0.2232174601549466,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.000536221,0.0005815789,0.0005788429,0.0002360136,0.001702481,0.0002304551,0.002006205,0.0004732539,0.00001670786],"category_scores_gemma":[0.0000123185,0.0006263771,0.000471279,0.001215567,0.0001430773,0.0006351276,0.00004063512,0.001099102,0.00003369396],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002083737,"about_ca_system_score_gemma":0.0001551488,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002639136,"about_ca_topic_score_gemma":0.0001024793,"domain_scores_codex":[0.9960136,0.0001677544,0.0007802419,0.001226293,0.0004803575,0.001331743],"domain_scores_gemma":[0.9964725,0.0008396753,0.000278509,0.001805575,0.0002448225,0.0003588786],"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.00003837807,0.0001286705,0.00009992158,0.0000154169,0.00008436234,0.00004933589,0.0002696796,0.7576395,0.00003408938,0.0002225886,0.0002176457,0.2412004],"study_design_scores_gemma":[0.001304812,0.0001967638,0.00008066962,0.0002430325,0.00004384622,0.0001456129,0.00001985852,0.9904557,0.0003008616,0.0001802756,0.006347666,0.0006808595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004332479,0.0006325388,0.9862902,0.0004343365,0.006331661,0.0009761995,0.000005847435,0.0009220662,0.00007463873],"genre_scores_gemma":[0.8081184,0.0006619347,0.1874116,0.0006410347,0.002289378,0.000427306,0.00001036415,0.0001088565,0.0003310937],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8037859,"threshold_uncertainty_score":0.9996188,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2159743267","doi":"10.1109/tnet.2007.896507","title":"Distributed Rate Allocation for Inelastic Flows","year":2007,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":142,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Air Force Office of Scientific Research; Defense Advanced Research Projects Agency; California Institute of Technology; University of Toronto; Purdue University; Yonsei University; National Science Foundation","keywords":"Mathematical optimization; Computer science; Heuristics; Limit (mathematics); Maximization; Utility maximization; Rate of convergence; Provisioning; Utility maximization problem; Convergence (economics); Mathematical economics; Mathematics; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.02166859084377924,"gpt":0.2531395800328795,"spread":0.2314709891891003,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007974697,0.0002203919,0.0002046571,0.0001413377,0.0004613138,0.0001435659,0.0006579819,0.0001250712,0.000009588955],"category_scores_gemma":[0.0000210437,0.0002252445,0.000149461,0.0006808635,0.00002998853,0.0002628454,0.000005574946,0.0002525399,0.00003195457],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001022162,"about_ca_system_score_gemma":0.00006502528,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005117638,"about_ca_topic_score_gemma":0.0001123702,"domain_scores_codex":[0.9983025,0.00006501727,0.0003999658,0.0004704398,0.0002041179,0.0005579796],"domain_scores_gemma":[0.9979225,0.00105047,0.0001149112,0.0006156269,0.0001402123,0.0001563042],"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.00007820316,0.00007547703,0.000009020078,0.000006785729,0.00004355637,0.000004598171,0.00006956494,0.2723538,0.0001923765,0.001491124,0.0003127629,0.7253627],"study_design_scores_gemma":[0.001100412,0.0001905646,0.0001879075,0.00007599926,0.00004934258,0.00001131138,0.00001712373,0.9702513,0.0005041828,0.001794326,0.02548935,0.0003282515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002290294,0.000104966,0.9916437,0.0009727375,0.003962386,0.0004507182,0.000008984761,0.0004625267,0.0001036927],"genre_scores_gemma":[0.9769107,0.00002487737,0.0214583,0.000484069,0.0008128597,0.0001002286,0.0000155286,0.00002236727,0.0001710926],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9746204,"threshold_uncertainty_score":0.9185204,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2091941493","doi":"10.1109/tnet.2006.890084","title":"A Cross-Layer Architecture of Wireless Sensor Networks for Target Tracking","year":2007,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":135,"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":"","keywords":"Computer science; Protocol stack; Wireless sensor network; Computer network; OSI model; Quality of service; Key distribution in wireless sensor networks; Energy consumption; Wireless network; Interconnection; Wireless; Protocol (science); Network architecture; Distributed computing; Application layer; Layer (electronics); Telecommunications; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02583868173835125,"gpt":0.2816126805396503,"spread":0.2557739988012991,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001209198,0.0005036272,0.000582345,0.0004098213,0.000638674,0.0002255341,0.001538186,0.0004210011,0.00001532584],"category_scores_gemma":[0.0000191661,0.0005123867,0.0004852147,0.001375646,0.0001838602,0.0002905621,0.00002536337,0.0008327161,0.00000366881],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001158458,"about_ca_system_score_gemma":0.00005873014,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000232802,"about_ca_topic_score_gemma":0.00008746218,"domain_scores_codex":[0.9960669,0.0001209963,0.0009377376,0.0009659222,0.0005835214,0.001324867],"domain_scores_gemma":[0.9958593,0.001766478,0.0004137561,0.00142271,0.0002848167,0.0002528861],"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.0001337034,0.0001504238,0.0001812564,0.00002660937,0.00007279719,0.00001702254,0.0002788536,0.7934381,0.001018469,0.0003192942,0.0000317612,0.2043318],"study_design_scores_gemma":[0.001294865,0.0002677328,0.0003737471,0.0003511859,0.00004897038,0.00006324834,0.00003526839,0.9624088,0.02801402,0.0004874615,0.005890875,0.0007637735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03405119,0.0003458065,0.9598308,0.0001558771,0.004318056,0.0005407488,0.000009517405,0.0004415289,0.0003064949],"genre_scores_gemma":[0.8452377,0.00005843582,0.1530303,0.0002796916,0.001053852,0.0000384392,0.000006488669,0.00008376421,0.0002113783],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8111865,"threshold_uncertainty_score":0.9997328,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2012493153","doi":"10.1109/tnet.2014.2354262","title":"Measurement Study of Netflix, Hulu, and a Tale of Three CDNs","year":2014,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":124,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"Defense Threat Reduction Agency; National Science Foundation","keywords":"Computer science; Cloud computing; Service provider; Content delivery network; Bandwidth (computing); Key (lock); Quality of service; Content delivery; Video streaming; Computer network; Service (business); Multimedia; World Wide Web; Server; Computer security; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.04813788733683651,"gpt":0.2341376430844861,"spread":0.1859997557476497,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005557686,0.0001285726,0.0002323941,0.0001241469,0.000150749,0.00003698304,0.0004422165,0.00004132219,0.00000254936],"category_scores_gemma":[0.000007164295,0.0001238293,0.00007598472,0.0002732649,0.00003500521,0.0001206266,0.00001391343,0.000162443,0.000001416553],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002550254,"about_ca_system_score_gemma":0.00001986637,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002805377,"about_ca_topic_score_gemma":0.0007189698,"domain_scores_codex":[0.9987065,0.00008724714,0.0002952121,0.0002928414,0.000432342,0.0001858749],"domain_scores_gemma":[0.998966,0.0001018065,0.000120706,0.0006576186,0.00009731201,0.00005656151],"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.00007270762,0.001216214,0.004482881,0.0000544631,0.0002415926,0.000004265944,0.00180229,0.06100157,0.006403578,0.0002632537,0.00004572919,0.9244115],"study_design_scores_gemma":[0.007607202,0.006514119,0.02801007,0.001516061,0.0004910101,0.00005066659,0.0008605272,0.9400764,0.007289177,0.004304048,0.00192167,0.001359089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3383192,0.0001549114,0.6604609,0.00006602299,0.0006199503,0.0001649046,6.469597e-7,0.0000516271,0.0001617943],"genre_scores_gemma":[0.9990225,0.00002125357,0.0007978866,0.00004116055,0.00007560715,0.00001359122,9.840092e-8,0.00000902851,0.00001883879],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9230524,"threshold_uncertainty_score":0.5049614,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4365790250","doi":"10.1109/tnet.2023.3264583","title":"Burst-Aware Time-Triggered Flow Scheduling With Enhanced Multi-CQF in Time-Sensitive Networks","year":2023,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Time Synchronization Technologies","field":"Computer Science","cited_by":112,"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; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Scheduling (production processes); Computer science; Queue; Real-time computing; Distributed computing; Mathematical optimization; Mathematics; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.01633553470396573,"gpt":0.2364913146131851,"spread":0.2201557799092194,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005450998,0.000495764,0.0005213118,0.0007655559,0.0005271849,0.0002726916,0.001460005,0.0003332842,0.00004660644],"category_scores_gemma":[0.00001980468,0.0004988299,0.0001372334,0.005380368,0.0001576261,0.0005485885,0.00006529011,0.0009159718,0.0006441441],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002580404,"about_ca_system_score_gemma":0.0001273138,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001721458,"about_ca_topic_score_gemma":0.00005429247,"domain_scores_codex":[0.9965712,0.0002016648,0.00055193,0.001061282,0.0005346712,0.001079234],"domain_scores_gemma":[0.9975738,0.0006056503,0.0002121831,0.00130673,0.0001618081,0.0001398358],"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.00003383551,0.00008348466,0.0000610426,0.000006915106,0.00006795437,0.00005860325,0.0002070238,0.8796518,0.0002192648,0.00001361765,0.000121853,0.1194746],"study_design_scores_gemma":[0.001120637,0.0001206737,0.0001370437,0.0004778781,0.0000231573,0.00001434592,0.00006219582,0.9928557,0.004253345,0.0002031475,0.0001547523,0.0005770822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006503944,0.00008731936,0.9885792,0.0004485675,0.0008701443,0.0006241351,0.000006540423,0.002781369,0.00009874807],"genre_scores_gemma":[0.8936753,0.0001689098,0.1041974,0.0001581148,0.0003239408,0.0001505945,0.00003180529,0.0001006047,0.00119342],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8871713,"threshold_uncertainty_score":0.9997463,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2162932658","doi":"10.1109/tnet.2005.852881","title":"Load balancing for parallel forwarding","year":2005,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":104,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Load balancing (electrical power); Scheduling (production processes); Distributed computing; Computer network; The Internet; Network packet; Hash function; Packet forwarding; Workload; Internet traffic; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.02064640572757671,"gpt":0.2499197595625509,"spread":0.2292733538349742,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004784904,0.0002521768,0.0002704473,0.0001077189,0.0006014961,0.0002084822,0.0008428274,0.0001227158,0.0000178508],"category_scores_gemma":[0.00001051816,0.0002591509,0.0002573422,0.0003845891,0.00002850459,0.0004487232,0.000008377041,0.0002947242,0.00006059827],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002006435,"about_ca_system_score_gemma":0.000107544,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005468301,"about_ca_topic_score_gemma":0.00007550932,"domain_scores_codex":[0.9980413,0.00005426899,0.0003705835,0.0005534207,0.0003354808,0.000644942],"domain_scores_gemma":[0.9983834,0.0005250028,0.0001103883,0.0007165333,0.0001098149,0.0001548634],"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.0000259607,0.00003727255,0.000009387561,0.000004548424,0.00003772972,0.000001698549,0.0001313859,0.3377772,0.00003087108,0.0009908938,0.00088024,0.6600729],"study_design_scores_gemma":[0.001148508,0.00009040957,0.00001682051,0.0000925164,0.00003653689,0.0000178777,0.00001767461,0.8733096,0.0001608536,0.001117404,0.1236596,0.0003322164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0005752668,0.000425672,0.9918877,0.002800095,0.002545813,0.0004151366,0.000002751901,0.0005496246,0.0007978985],"genre_scores_gemma":[0.8734871,0.00008544732,0.1226195,0.001194772,0.001682739,0.000186682,0.000001242702,0.00002785722,0.0007146511],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8729119,"threshold_uncertainty_score":0.9999861,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2990839184","doi":"10.1109/tnet.2019.2953806","title":"OnDisc: Online Latency-Sensitive Job Dispatching and Scheduling in Heterogeneous Edge-Clouds","year":2019,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":99,"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":"China National Funds for Distinguished Young Scientists; National Natural Science Foundation of China","keywords":"Computer science; Server; Cloud computing; Upload; Response time; Latency (audio); Job scheduler; Scheduling (production processes); Schedule; Mobile edge computing; Distributed computing; Online algorithm; Scalability; Job shop scheduling; Computer network; Mathematical optimization; Algorithm; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.01763931128292279,"gpt":0.2452361231883151,"spread":0.2275968119053923,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003455982,0.0002972694,0.0003377394,0.0002616681,0.0003384655,0.0002099409,0.0005346818,0.0001419343,0.000002924959],"category_scores_gemma":[0.000007573467,0.0003065795,0.0001164317,0.0006286963,0.00003895371,0.0003482442,0.00004687729,0.0006746466,0.0000349184],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001106544,"about_ca_system_score_gemma":0.0000531248,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001093498,"about_ca_topic_score_gemma":0.000127284,"domain_scores_codex":[0.9978662,0.0001237516,0.0004020093,0.0007050416,0.0002578889,0.0006451364],"domain_scores_gemma":[0.9987949,0.0003513677,0.0001056308,0.0005738239,0.00004577704,0.0001285041],"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.00005649441,0.0002506375,0.008306406,0.00006486525,0.00009659919,0.0001689821,0.004681895,0.4831567,0.001852685,0.00009179208,0.00002540445,0.5012475],"study_design_scores_gemma":[0.0008285811,0.0001560092,0.004618911,0.0006919848,0.00002088407,0.0001344147,0.00008480862,0.989843,0.001287642,0.001118615,0.0005968973,0.0006182572],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6187465,0.0001625502,0.3719966,0.0002652452,0.008342124,0.0001798848,6.881135e-7,0.0001494433,0.0001568963],"genre_scores_gemma":[0.9760548,0.00007901663,0.0222301,0.0002928662,0.001209984,0.000005563403,0.000002624029,0.00003275318,0.00009232928],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5066863,"threshold_uncertainty_score":0.9999386,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2804263917","doi":"10.1109/tnet.2018.2833815","title":"Optimal Network Service Chain Provisioning","year":2018,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":92,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Concordia University; Agence Nationale de la Recherche","keywords":"Computer science; Provisioning; Computer network; Scalability; Distributed computing; Virtual network; Server; Service (business); Network virtualization; Network service; Bandwidth (computing); Virtualization; Cloud computing; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.02551980842782342,"gpt":0.2518965565975303,"spread":0.2263767481697069,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0006187084,0.0003911381,0.0003375235,0.0001601173,0.001306967,0.0003899248,0.001624299,0.0002190988,0.0000720337],"category_scores_gemma":[0.00001099623,0.000386439,0.0001716149,0.002099011,0.0000841661,0.0004934626,0.00005088978,0.0005984049,0.0002519528],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009501584,"about_ca_system_score_gemma":0.0001002464,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005669056,"about_ca_topic_score_gemma":0.0001434655,"domain_scores_codex":[0.9969528,0.0001462189,0.00047093,0.0008815087,0.0004763805,0.001072178],"domain_scores_gemma":[0.9974406,0.0004816744,0.0001716805,0.001468932,0.0001949682,0.0002421643],"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.00006567008,0.000111425,0.0001689484,0.00001429378,0.00008035181,0.00002402377,0.0007991789,0.6230351,0.00004089141,0.0007160688,0.003340517,0.3716035],"study_design_scores_gemma":[0.0008406807,0.0005199843,0.0003391543,0.0005139704,0.00004717698,0.00007792887,0.00003770383,0.9305351,0.0004709223,0.002599212,0.06315859,0.0008595535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00538662,0.0002744162,0.9843208,0.001318665,0.00639816,0.0003248365,0.00000197924,0.001006618,0.0009678935],"genre_scores_gemma":[0.8123543,0.00008204686,0.1785492,0.003445267,0.005111567,0.00007590657,0.0000033982,0.00006912003,0.0003091859],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8069677,"threshold_uncertainty_score":0.9999932,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2038021311","doi":"10.1109/tnet.2014.2312928","title":"Decomposition Approaches for Virtual Network Embedding With One-Shot Node and Link Mapping","year":2014,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":90,"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":"","keywords":"Computer science; Network virtualization; Embedding; Heuristic; Node (physics); Network topology; Virtualization; Distributed computing; Virtual network; Computer network; Cloud computing; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.07766406967826003,"gpt":0.269455083827348,"spread":0.191791014149088,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005931391,0.0003347897,0.0003666133,0.0001531007,0.0009665475,0.0003725405,0.0005453792,0.0001779975,0.000003243697],"category_scores_gemma":[0.000007891499,0.0003243447,0.0001184938,0.0006090717,0.00007180146,0.0004045137,0.00002018142,0.0003890812,0.000002976653],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006149917,"about_ca_system_score_gemma":0.00003119396,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007931834,"about_ca_topic_score_gemma":0.00003143778,"domain_scores_codex":[0.9977837,0.0001141202,0.0003600064,0.0007608966,0.0002735326,0.0007078081],"domain_scores_gemma":[0.9978905,0.001014411,0.0001623608,0.0007001397,0.00005916567,0.0001734133],"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.00006868187,0.00005109221,0.0001772403,0.00002334368,0.00007690814,0.000001494923,0.0002656447,0.6327827,0.00003248361,0.002235766,0.00008785023,0.3641968],"study_design_scores_gemma":[0.001020139,0.000451526,0.000410835,0.0004531825,0.00006364636,0.00003750708,0.00003357243,0.9872979,0.0001731954,0.00381929,0.005704713,0.0005344977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00500246,0.0001809436,0.9915124,0.0009959291,0.001269892,0.000418005,0.000003287043,0.0004392903,0.0001778282],"genre_scores_gemma":[0.71573,0.00005160675,0.2820927,0.0005363459,0.001392488,0.0001182129,0.000007700089,0.0000431406,0.00002781857],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7107276,"threshold_uncertainty_score":0.9999208,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2546477115","doi":"10.1109/tnet.2016.2619743","title":"Online Auctions in IaaS Clouds: Welfare and Profit Maximization With Server Costs","year":2016,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Profit maximization; Cloud computing; Provisioning; Server; Common value auction; Combinatorial auction; Profit (economics); Social Welfare; Online algorithm; Maximization; Virtual machine; Competitive analysis; Mathematical optimization; Microeconomics; Computer network; Economics; Operating system; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01636443136747415,"gpt":0.2254923019600104,"spread":0.2091278705925362,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001849874,0.0001815754,0.0001556233,0.0002063898,0.000342514,0.0001001138,0.0003938757,0.00006893719,0.000009685697],"category_scores_gemma":[0.000003713769,0.0001291891,0.0000416536,0.0007014486,0.00005000575,0.00007712798,0.00002372606,0.0001863605,0.000006504523],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001429895,"about_ca_system_score_gemma":0.00001925322,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006356713,"about_ca_topic_score_gemma":0.0004771435,"domain_scores_codex":[0.9986432,0.00008398348,0.0002326607,0.0004786217,0.0002349614,0.0003265314],"domain_scores_gemma":[0.9991152,0.00009771892,0.00007933057,0.0005806549,0.00004584194,0.00008130594],"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.00003918535,0.0002032704,0.002515051,0.00002172969,0.00005481368,0.00002660091,0.0003768395,0.2184582,0.00002675376,0.0009795116,0.00005504751,0.777243],"study_design_scores_gemma":[0.008286167,0.001214275,0.07234082,0.004013477,0.0001626658,0.0002906263,0.0006367654,0.8684247,0.0006463103,0.002625176,0.03910138,0.002257711],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2280516,0.00006428011,0.7629405,0.007520874,0.0006768602,0.0002866979,0.000002955973,0.0002636002,0.0001926531],"genre_scores_gemma":[0.989901,0.00004664511,0.00919849,0.00016805,0.0001676661,0.0000266326,0.000001152908,0.00001972612,0.0004706265],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7749853,"threshold_uncertainty_score":0.5268179,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3033036004","doi":"10.1109/tnet.2020.2994015","title":"FoGMatch: An Intelligent Multi-Criteria IoT-Fog Scheduling Approach Using Game Theory","year":2020,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":86,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"École de Technologie Supérieure; Université du Québec en Outaouais","funders":"Lebanese American University","keywords":"Computer science; Distributed computing; Cloud computing; Internet of Things; Scheduling (production processes); Fog computing; Job shop scheduling; Latency (audio); Computer network; Mathematical optimization; Embedded system; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.1552664304438902,"gpt":0.3199529412789779,"spread":0.1646865108350877,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008507415,0.0004097861,0.0003914159,0.0001954317,0.0006818957,0.0005172977,0.001537497,0.0001791346,0.000007940564],"category_scores_gemma":[0.00002263737,0.0004305354,0.0002295979,0.0009951617,0.00007325312,0.0004857825,0.00005747167,0.0007424533,0.00003710604],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001213116,"about_ca_system_score_gemma":0.00008860244,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002167402,"about_ca_topic_score_gemma":0.00000155015,"domain_scores_codex":[0.9969123,0.0004168564,0.0005560216,0.0009615308,0.000362963,0.0007903423],"domain_scores_gemma":[0.9981843,0.0002776625,0.000164306,0.0009260112,0.00008455205,0.0003631388],"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.00005565185,0.0002803461,0.00004435449,0.00006014861,0.00009139872,0.00002537678,0.008674349,0.5595925,0.001882912,0.0002317318,0.00003483278,0.4290263],"study_design_scores_gemma":[0.0003566307,0.00009820401,0.000017259,0.0001317165,0.00003695533,0.000036511,0.0001896849,0.9939939,0.002233437,0.0007688505,0.001645209,0.0004916741],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02291867,0.0002078094,0.9647975,0.0002188167,0.01070686,0.0002938646,6.815708e-7,0.0006859165,0.0001699135],"genre_scores_gemma":[0.6380211,0.00001568061,0.357821,0.0007595189,0.003302867,0.0000106942,0.000002675678,0.00005013139,0.00001643487],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6151024,"threshold_uncertainty_score":0.9998146,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2979600268","doi":"10.1109/tnet.2019.2943561","title":"Optimization of MIMO Device-to-Device Networks via Matrix Fractional Programming: A Minorization–Maximization Approach","year":2019,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":84,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Huawei Technologies","keywords":"Computer science; Beamforming; Transmitter; Maximization; Scheduling (production processes); Distributed computing; MIMO; Mathematical optimization; Computer network; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01413115040621825,"gpt":0.2393068298866898,"spread":0.2251756794804715,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002613653,0.0004396355,0.0004748111,0.0004942188,0.0002118285,0.00008458208,0.0003503478,0.0003360485,0.00009699364],"category_scores_gemma":[0.00001347976,0.0005195393,0.0001561905,0.001934932,0.00003037124,0.0005622266,0.000008264322,0.0004076244,0.00004112023],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002870574,"about_ca_system_score_gemma":0.00003894189,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001908378,"about_ca_topic_score_gemma":0.00001490985,"domain_scores_codex":[0.9975353,0.00009539228,0.0008572414,0.0005599147,0.0004167424,0.0005353689],"domain_scores_gemma":[0.9983804,0.0001865136,0.0002676905,0.0006998387,0.0002957854,0.000169746],"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.000058368,0.0001170637,0.0003058736,0.0001696544,0.0001077781,6.510166e-7,0.000192044,0.9836974,0.0002828366,0.00002515513,0.00004458074,0.01499867],"study_design_scores_gemma":[0.0006221581,0.00008834358,0.00003897029,0.0002202232,0.00008797279,0.00001570929,0.00009135214,0.9964196,0.0004244453,0.00002005139,0.001493834,0.0004773497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001058217,0.0002674241,0.9931504,0.00002716871,0.002525068,0.00158544,0.00001087999,0.0006586634,0.0007167674],"genre_scores_gemma":[0.7552533,0.000113782,0.2433904,0.00004597965,0.0004488372,0.0002177928,0.0001628796,0.0001614537,0.0002055506],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7541951,"threshold_uncertainty_score":0.9997256,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2156046876","doi":"10.1109/tnet.2005.860109","title":"Cooperation in wireless ad hoc networks: a market-based approach","year":2005,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":82,"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":"","keywords":"Computer science; Wireless ad hoc network; Convergence (economics); Computer network; Mobile ad hoc network; Network packet; Wireless; Ad hoc wireless distribution service; Wireless network; Iterative method; Optimized Link State Routing Protocol; Mathematical optimization; Telecommunications; Algorithm; Economics; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01717339039060323,"gpt":0.2323033024941641,"spread":0.2151299121035609,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008199924,0.0004202989,0.0004021481,0.0003126013,0.0003973249,0.0003343704,0.001352864,0.0002935989,0.00005227301],"category_scores_gemma":[0.000005359914,0.0004522963,0.0001746759,0.001834548,0.00007295357,0.0006792804,0.00001847995,0.0009009881,0.00002770484],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003494702,"about_ca_system_score_gemma":0.0001274094,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009643252,"about_ca_topic_score_gemma":0.0004032853,"domain_scores_codex":[0.9967026,0.0003555155,0.0006483753,0.0009618759,0.0004435352,0.0008881482],"domain_scores_gemma":[0.9977047,0.0004262859,0.0001597126,0.001434929,0.00008084695,0.0001934877],"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.00004313375,0.0002082826,0.0000366714,0.00000679028,0.00001397553,0.000007353247,0.00008801652,0.6098406,0.00001569168,0.0001467837,0.0003749555,0.3892178],"study_design_scores_gemma":[0.001041313,0.00009946296,0.0001310477,0.0001658588,0.00001573635,0.00001597515,0.00001130157,0.9843673,0.0001406453,0.00005913209,0.01348953,0.0004627169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001999361,0.0009208767,0.9922505,0.000590736,0.001510381,0.0006554148,0.000001520956,0.0004578558,0.001613359],"genre_scores_gemma":[0.9303832,0.0004875223,0.0666911,0.0009808447,0.0007376921,0.0003414728,0.000008730492,0.00005672269,0.0003127372],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9283838,"threshold_uncertainty_score":0.9997929,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2013174072","doi":"10.1109/tnet.2003.818196","title":"Priority service and max-min fairness","year":2003,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":81,"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":"","keywords":"Computer science; Game theory; Computer network; Nash equilibrium; Bandwidth allocation; Bandwidth (computing); Max-min fairness; Service (business); Quality of service; Mathematical optimization; Resource allocation; Microeconomics","retraction":null,"screen_n_in":null,"score":{"opus":0.0188926864910351,"gpt":0.2288178971658632,"spread":0.2099252106748281,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000375127,0.0002357415,0.0002291283,0.0000990819,0.000465466,0.0002134099,0.0005491894,0.0001277635,0.00002623481],"category_scores_gemma":[0.000006547084,0.0002414056,0.00007518913,0.0007152979,0.00003991565,0.0003263507,0.000008124863,0.0003756019,0.00004186707],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004647283,"about_ca_system_score_gemma":0.00007337859,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001804589,"about_ca_topic_score_gemma":0.0001339163,"domain_scores_codex":[0.9983053,0.0001753988,0.0002650124,0.0005448545,0.0002602327,0.0004492336],"domain_scores_gemma":[0.998639,0.000295177,0.00007765984,0.0007277308,0.00008391392,0.0001765467],"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.00001850973,0.0001017328,0.0001478298,0.00001670431,0.00004952776,0.00001806331,0.0003747496,0.02570246,0.00005918173,0.007032047,0.0001388092,0.9663404],"study_design_scores_gemma":[0.004186928,0.0003352147,0.001314542,0.0004122684,0.0001783671,0.0003584476,0.0002286896,0.7753425,0.00119473,0.01576429,0.1987786,0.001905394],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01043478,0.0004365726,0.9835333,0.001291821,0.002474558,0.000230625,0.000001522363,0.0003624087,0.001234472],"genre_scores_gemma":[0.9857188,0.0001344662,0.01238621,0.001147228,0.0002249074,0.0000421905,5.575026e-7,0.00001896617,0.0003267154],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.975284,"threshold_uncertainty_score":0.9844236,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2523950303","doi":"10.1109/tnet.2015.2482988","title":"Explicit Path Control in Commodity Data Centers: Design and Applications","year":2015,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":81,"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":"Microsoft Research Asia","keywords":"XPath; Computer science; Testbed; Path (computing); Network topology; Routing (electronic design automation); Distributed computing; Computer network; Shortest path problem; Theoretical computer science; XML; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.1070603514484862,"gpt":0.2812738668973203,"spread":0.1742135154488341,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007638474,0.0002025507,0.0002455938,0.0001293458,0.0002228611,0.0001942728,0.00141296,0.0001028911,0.000002596846],"category_scores_gemma":[0.000009720714,0.0002051526,0.00003701747,0.0005933992,0.00004306181,0.0005134119,0.00004188271,0.0003520969,0.00001466535],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007780308,"about_ca_system_score_gemma":0.00006891206,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007863316,"about_ca_topic_score_gemma":0.00008149435,"domain_scores_codex":[0.9982081,0.0001983063,0.0003088186,0.000630601,0.0002470911,0.0004070848],"domain_scores_gemma":[0.9973186,0.0006433149,0.00008848296,0.001697564,0.00004750535,0.0002045045],"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.0001323794,0.0005535102,0.002507289,0.00001878848,0.00008223812,0.00003043293,0.0007181637,0.3413532,0.00002771412,0.0009777118,0.005727234,0.6478713],"study_design_scores_gemma":[0.001979349,0.0001277874,0.0003302929,0.0001193289,0.00003025675,0.00002910666,0.00004327467,0.9670671,0.00002869808,0.00520409,0.02466176,0.0003789853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0003078166,0.00053025,0.997047,0.0005674084,0.0006536379,0.0005640846,0.00002136974,0.0002396173,0.00006882251],"genre_scores_gemma":[0.9456868,0.0002054333,0.05270617,0.0008162444,0.000339013,0.0001970837,0.00001293459,0.00002205827,0.0000142486],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.945379,"threshold_uncertainty_score":0.8365879,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2587594232","doi":"10.1109/tnet.2017.2650964","title":"Software Defined Cooperative Offloading for Mobile Cloudlets","year":2017,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Tsinghua National Laboratory for Information Science and Technology; National Natural Science Foundation of China","keywords":"Computer science; Energy consumption; Distributed computing; Knapsack problem; Scheduling (production processes); Mobile device; Software; Embedded system; Operating system; Mathematical optimization; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.04543292871141028,"gpt":0.2943738331846961,"spread":0.2489409044732858,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0003756824,0.0002637731,0.000284195,0.0001137399,0.003173089,0.0007505687,0.001634561,0.0001266481,0.000004154807],"category_scores_gemma":[0.00004749076,0.0002677046,0.0001979261,0.0001847897,0.00006953556,0.0005280057,0.00003668557,0.0003185034,0.00003942228],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009634794,"about_ca_system_score_gemma":0.00008313342,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002375842,"about_ca_topic_score_gemma":0.00001525663,"domain_scores_codex":[0.9982234,0.00005155251,0.00030571,0.0005917846,0.000212104,0.0006155082],"domain_scores_gemma":[0.9976587,0.0005405721,0.0001946609,0.001339398,0.0001414049,0.0001252402],"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.00005040602,0.0001308354,0.0001748494,0.00003644306,0.0001104138,0.00002313254,0.001386972,0.04626178,0.0004191739,0.0002416609,0.003677607,0.9474867],"study_design_scores_gemma":[0.003501336,0.001055729,0.0005547235,0.001020284,0.0001319658,0.000105329,0.00007242608,0.782234,0.01710362,0.007541487,0.1846595,0.002019722],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009081806,0.0001123365,0.963811,0.0003011155,0.02543725,0.0004764606,0.000001874645,0.0003678948,0.0004102552],"genre_scores_gemma":[0.8827676,0.00003266162,0.1120651,0.0003280316,0.004081776,0.0001880901,0.000003071974,0.00004495905,0.0004886492],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.945467,"threshold_uncertainty_score":0.9999775,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1985235227","doi":"10.1109/tnet.2014.2350013","title":"Diffusion LMS Strategies in Sensor Networks With Noisy Input Data","year":2014,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":75,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Noise (video); Convergence (economics); Least mean squares filter; Computer science; Stability (learning theory); Regression; A priori and a posteriori; Algorithm; White noise; Node (physics); Diffusion; Mathematics; Statistics; Artificial intelligence; Adaptive filter; Machine learning; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02630035987811673,"gpt":0.2480888177988877,"spread":0.221788457920771,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002111546,0.000331403,0.0002975366,0.0001858224,0.0001378265,0.00008886583,0.0005992842,0.0001545821,0.00001468653],"category_scores_gemma":[0.000004843146,0.0003178825,0.00003858241,0.0004434526,0.00005467133,0.0004341023,0.00001744731,0.0006837427,0.000007119015],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001074775,"about_ca_system_score_gemma":0.00001319679,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003297158,"about_ca_topic_score_gemma":0.0005044819,"domain_scores_codex":[0.9984819,0.0000617871,0.0003060371,0.0004543364,0.0001961473,0.0004997738],"domain_scores_gemma":[0.9983682,0.0002143204,0.00005068337,0.001260094,0.00002450635,0.0000821717],"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.00003885282,0.00003156458,0.0001024794,0.00002134926,0.00002280714,0.00001068064,0.00006554804,0.9446619,0.001043885,0.0000297706,0.0000622972,0.05390884],"study_design_scores_gemma":[0.0005181708,0.0001444883,0.0006077318,0.0005878691,0.00002728477,0.00002157086,0.00008101734,0.9877819,0.001038,0.000421142,0.008220227,0.0005505967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02095542,0.00008795438,0.9760638,0.00003430742,0.0006806321,0.000252018,0.00001182804,0.001194321,0.0007196822],"genre_scores_gemma":[0.9329283,0.0002807931,0.06613307,0.00004628167,0.0004008723,0.00004565269,0.00002458868,0.0001055594,0.000034931],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9119728,"threshold_uncertainty_score":0.9999273,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2883077902","doi":"10.1109/tnet.2019.2912077","title":"A Market-Based Framework for Multi-Resource Allocation in Fog Computing","year":2019,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Distributed computing; Resource allocation; Preemption; Incentive; Computer network; Microeconomics; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.03929296603729922,"gpt":0.2864870703180051,"spread":0.2471941042807059,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008010459,0.000265811,0.0002908181,0.0003154736,0.0003531031,0.0002066029,0.0009473058,0.000199029,0.000005701088],"category_scores_gemma":[0.00002784078,0.0002963381,0.0001806767,0.0008986137,0.00002500898,0.0002002475,0.00001825044,0.0005306512,0.00003167459],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001679693,"about_ca_system_score_gemma":0.00008211236,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002446393,"about_ca_topic_score_gemma":0.00001357539,"domain_scores_codex":[0.9978053,0.000139255,0.0004493491,0.0006705617,0.0002626309,0.0006729115],"domain_scores_gemma":[0.9974509,0.00139208,0.0001650548,0.0008336807,0.00006482564,0.00009347864],"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.00009029515,0.0003045356,0.00158726,0.0001002507,0.00004064364,0.000005906964,0.001201918,0.4398288,0.0001386515,0.0004075351,0.000609629,0.5556846],"study_design_scores_gemma":[0.0009650686,0.0000926531,0.0008015549,0.0005727613,0.000009696358,0.000003532025,0.0000258746,0.9877284,0.0004231146,0.000833384,0.00820531,0.0003387129],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01086125,0.00007337081,0.976817,0.000551939,0.01049124,0.0006495113,4.024124e-7,0.0003111334,0.0002441378],"genre_scores_gemma":[0.63022,0.000002668101,0.3679279,0.000641568,0.001042456,0.00002890316,0.00000244847,0.00003264828,0.0001013611],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6193588,"threshold_uncertainty_score":0.9999489,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2138720770","doi":"10.1109/tnet.2013.2259596","title":"Energy Efficiency in TDMA-Based Next-Generation Passive Optical Access Networks","year":2013,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Advanced Photonic Communication Systems","field":"Engineering","cited_by":73,"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; Passive optical network; Time division multiple access; Broadband; Computer network; Efficient energy use; Bandwidth (computing); Sleep mode; Transmission (telecommunications); Scheduling (production processes); Overhead (engineering); Sizing; Real-time computing; Telecommunications; Power (physics); Wavelength-division multiplexing; Power consumption; Engineering; Electrical engineering; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.04724419910141661,"gpt":0.2642369650156542,"spread":0.2169927659142376,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001367608,0.000283848,0.0002823496,0.000247994,0.0002051685,0.0002152252,0.0006587565,0.0002008095,0.0001243123],"category_scores_gemma":[0.000006306768,0.0003116186,0.0001041877,0.0008333722,0.00005170671,0.0004820344,0.000008630697,0.0005223124,0.00002734061],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003127374,"about_ca_system_score_gemma":0.00003592168,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001319194,"about_ca_topic_score_gemma":0.0004836181,"domain_scores_codex":[0.9982663,0.0001097118,0.0005500336,0.0003310014,0.0002369824,0.0005059865],"domain_scores_gemma":[0.998407,0.0003951706,0.00007413163,0.0009249047,0.00006937827,0.0001294247],"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.000005212288,0.00005057701,0.00002695816,0.000007650542,0.00001482282,0.000002012905,0.00004461762,0.87707,0.001265125,0.00003394565,0.0001395127,0.1213396],"study_design_scores_gemma":[0.0004340581,0.00002736679,0.00009878627,0.0001260197,0.00001173705,0.000004170787,0.0000289694,0.9918678,0.004164625,0.00008896786,0.002832743,0.0003147721],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01664864,0.0004934928,0.9784824,0.0001382924,0.002441833,0.0003865547,0.00000197492,0.0003883271,0.001018452],"genre_scores_gemma":[0.9964002,0.0002675533,0.00204645,0.0001766181,0.0003719917,0.0005904433,0.00001682281,0.00007267205,0.00005723449],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9797516,"threshold_uncertainty_score":0.9999336,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2115982908","doi":"10.1109/tnet.2002.801416","title":"Managing capacity for telecommunications networks under uncertainty","year":2002,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Capital Investment and Risk Analysis","field":"Economics, Econometrics and Finance","cited_by":67,"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":"University of Waterloo","keywords":"Computer science; Capacity planning; Upgrade; Telecommunications; Revenue; Bandwidth (computing); Broadband; Notice; Operations research; Business; Finance","retraction":null,"screen_n_in":null,"score":{"opus":0.09732849604555749,"gpt":0.2414378003609132,"spread":0.1441093043153557,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002931062,0.0002086624,0.0003459172,0.0002789501,0.0007459497,0.0001221307,0.0004155561,0.0001359311,0.000399483],"category_scores_gemma":[0.000007082466,0.0002431076,0.0003716807,0.0005476305,0.00008287048,0.0001752533,0.000006407188,0.0003274616,0.0001365052],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001840603,"about_ca_system_score_gemma":0.000003519296,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002209927,"about_ca_topic_score_gemma":0.0003985409,"domain_scores_codex":[0.9985533,0.00002552496,0.0005300488,0.0004097652,0.00004273384,0.0004386434],"domain_scores_gemma":[0.9985957,0.0002566003,0.0002144627,0.0008020017,0.00003102443,0.0001002559],"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.00001003871,0.000177962,0.000142602,0.000008676502,0.0002467088,4.449219e-7,0.0002198553,0.9363725,0.000002650928,0.0438907,0.001296436,0.0176314],"study_design_scores_gemma":[0.0004465567,0.00005096932,0.00008688235,0.00003076195,0.00006408625,0.000002265218,0.00006767453,0.8841276,0.00001164935,0.07737387,0.03738826,0.0003494909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005558656,0.008932848,0.9761666,0.00282491,0.001452903,0.0004117603,0.00006525094,0.0001625215,0.004424524],"genre_scores_gemma":[0.9822184,0.008416372,0.0063471,0.0007856208,0.0003850101,0.0001452064,0.00001802621,0.00004519074,0.00163903],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9766598,"threshold_uncertainty_score":0.9913639,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2535315879","doi":"10.1109/tnet.2016.2612695","title":"Network Latency Estimation for Personal Devices: A Matrix Completion Approach","year":2016,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":66,"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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Matrix completion; Completion (oil and gas wells); Estimation; Computer science; Latency (audio); Engineering; Telecommunications; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.04357468200276406,"gpt":0.2692010705119042,"spread":0.2256263885091401,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005320318,0.0003161809,0.0003195706,0.0001399717,0.0007487073,0.0001997795,0.0007132943,0.0001854385,0.000021387],"category_scores_gemma":[0.00001325277,0.0002498048,0.0002328161,0.0007146205,0.00005593834,0.0005257205,0.00001411107,0.0002144742,0.00004243433],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001423927,"about_ca_system_score_gemma":0.00006233752,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001416611,"about_ca_topic_score_gemma":0.00001812037,"domain_scores_codex":[0.9976414,0.0001057848,0.0004380045,0.0007080586,0.0003751537,0.0007315368],"domain_scores_gemma":[0.9980775,0.0008835687,0.0001948189,0.0005830718,0.0001158776,0.0001452068],"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.0001386399,0.000226913,0.0004626368,0.00006599293,0.0001133153,0.00000398984,0.0005656069,0.225386,0.00007099378,0.003024024,0.00328013,0.7666618],"study_design_scores_gemma":[0.001135535,0.0002128116,0.0005123131,0.0003512784,0.00005772341,0.00003751678,0.00001210656,0.977233,0.00003054808,0.01169201,0.008240438,0.0004847521],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0009497844,0.0003255715,0.9940879,0.0010328,0.002253477,0.0005689322,0.00001262931,0.0006025174,0.0001664081],"genre_scores_gemma":[0.7258704,0.00006573054,0.2720552,0.0004302386,0.001072425,0.0002343156,0.00001152365,0.00004026004,0.0002198742],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.766177,"threshold_uncertainty_score":0.9999954,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2107631978","doi":"10.1109/tnet.2009.2035115","title":"A System-Theoretic Approach to Bandwidth Estimation","year":2009,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":65,"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":"","keywords":"Network calculus; Computer science; Bandwidth (computing); Network packet; Nonlinear system; Testbed; Robustness (evolution); Algorithm; Computer network; Quality of service","retraction":null,"screen_n_in":null,"score":{"opus":0.01373783591961571,"gpt":0.2264381860413313,"spread":0.2127003501217156,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004033709,0.0002595398,0.0002735988,0.000214815,0.0004290661,0.000267162,0.0009168689,0.0001143735,0.000005046729],"category_scores_gemma":[0.000005878441,0.0002531426,0.0001375101,0.0009270152,0.00002636943,0.0002690155,0.000005304452,0.0002965773,0.0001053376],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001371715,"about_ca_system_score_gemma":0.00005036959,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003687599,"about_ca_topic_score_gemma":0.000002529903,"domain_scores_codex":[0.9980305,0.0001343063,0.0003553605,0.0005936073,0.0003914304,0.0004948104],"domain_scores_gemma":[0.9985192,0.0001746984,0.00008795746,0.000929163,0.00006296521,0.000225988],"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.00001691792,0.00007937339,0.000001310696,0.000007220189,0.00001358886,0.000003540779,0.0002365738,0.4361868,0.00001365649,0.01693634,0.0001787849,0.5463259],"study_design_scores_gemma":[0.0004684329,0.0001915362,0.00004150952,0.0001621637,0.00003374559,0.00004926818,0.00003228314,0.9954495,0.0000811167,0.001883563,0.00130088,0.0003060128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0007990462,0.0001014545,0.9902207,0.001200395,0.001593502,0.000464858,0.000001297078,0.0008731912,0.004745539],"genre_scores_gemma":[0.92463,0.00001016544,0.07391005,0.0008000317,0.0003764515,0.00008007963,0.000001822219,0.00001587122,0.0001755388],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9238309,"threshold_uncertainty_score":0.9999921,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2903151719","doi":"10.1109/tnet.2018.2879979","title":"On Efficient Tree-Based Tag Search in Large-Scale RFID Systems","year":2018,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"RFID technology advancements","field":"Engineering","cited_by":60,"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":"Beijing Institute of Technology; National Natural Science Foundation of China","keywords":"Notation; Computer science; Scale (ratio); Hash function; Algorithm; Discrete mathematics; Information retrieval; Mathematics; Theoretical computer science; Programming language; Arithmetic","retraction":null,"screen_n_in":null,"score":{"opus":0.0150693897426789,"gpt":0.2470501211893471,"spread":0.2319807314466682,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003115762,0.0002575194,0.0002547214,0.0004876019,0.0002211116,0.00003557079,0.0003557401,0.0002219519,0.00005326366],"category_scores_gemma":[0.00000471084,0.0002832824,0.00007328017,0.0008595912,0.00008348771,0.00005366949,0.000003898143,0.0006465993,0.0001884372],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003584156,"about_ca_system_score_gemma":0.00002015669,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001621353,"about_ca_topic_score_gemma":0.0002800702,"domain_scores_codex":[0.9982088,0.00006340475,0.0003398497,0.0003806317,0.0003022772,0.0007050835],"domain_scores_gemma":[0.9989617,0.0001687409,0.00003142222,0.0007191336,0.00003880406,0.0000802389],"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.00004933722,0.0001587617,0.0002961829,0.00003076681,0.00002876894,0.00001221464,0.0001208805,0.9852977,0.0008614457,0.00003393321,0.0000765687,0.0130334],"study_design_scores_gemma":[0.001333863,0.0002107655,0.0003642729,0.0004255439,0.00001654708,0.000003524224,0.00009017505,0.9804687,0.01339576,0.00005497919,0.003307008,0.0003288622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3541953,0.0001434384,0.6396753,0.00006269883,0.003469573,0.0004256096,0.00001668612,0.0007417809,0.001269553],"genre_scores_gemma":[0.9981216,0.0000253713,0.001257634,0.00006474957,0.0002342072,0.0001233284,0.00000472087,0.00007406591,0.00009432813],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6439263,"threshold_uncertainty_score":0.9999619,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1997932713","doi":"10.1109/tnet.2012.2227338","title":"Estimating Instantaneous Cache Hit Ratio Using Markov Chain Analysis","year":2012,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Cache; FIFO (computing and electronics); Cache algorithms; Cache invalidation; Smart Cache; CPU cache; Cache coloring; Markov chain; Cache pollution; FIFO and LIFO accounting; Parallel computing; Algorithm; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.04008999090234793,"gpt":0.2645258474085417,"spread":0.2244358565061937,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006038969,0.0002491953,0.0003102507,0.000405318,0.0007346865,0.0002489011,0.0006442996,0.0001056009,0.00002263826],"category_scores_gemma":[0.00001244884,0.0002595592,0.0002925776,0.001565106,0.00003284918,0.0005499008,0.0000173553,0.000411004,0.00001658989],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002145214,"about_ca_system_score_gemma":0.00004662794,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000247891,"about_ca_topic_score_gemma":0.00009483286,"domain_scores_codex":[0.9980134,0.000184931,0.0003781707,0.0004165291,0.0003780297,0.0006289337],"domain_scores_gemma":[0.9984692,0.0002956591,0.0001553692,0.0008506572,0.0000534341,0.0001756757],"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.00001576319,0.000117146,0.0008957582,0.000009425746,0.0004014839,0.00002710695,0.0009145214,0.8162796,0.001135793,0.0001111842,0.00002578471,0.1800664],"study_design_scores_gemma":[0.0001756767,0.00002727332,0.0001125512,0.00006113043,0.0003017478,0.00007746485,0.00004864399,0.9984078,0.0002172411,0.00006833655,0.0001985761,0.0003035774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07675033,0.0002740971,0.9194571,0.0001321025,0.002693305,0.000123052,0.000003471351,0.0002852806,0.0002812683],"genre_scores_gemma":[0.936654,0.0000146525,0.06228512,0.0002626022,0.0006002655,0.00001238095,0.000002653767,0.0000212501,0.0001470141],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8599038,"threshold_uncertainty_score":0.9999856,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2791952354","doi":"10.1109/tnet.2018.2806352","title":"Modeling Compound TCP Over WiFi for IoT","year":2018,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Computer network; Throughput; TCP acceleration; TCP Friendly Rate Control; Network packet; CUBIC TCP; TCP tuning; TCP global synchronization; Packet loss; Network congestion; Zeta-TCP; Transmission Control Protocol; Wireless; Real-time computing; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.05769722259922516,"gpt":0.3086903651843955,"spread":0.2509931425851704,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003983915,0.0002620106,0.0002659757,0.000166462,0.0008644664,0.0003292825,0.001043588,0.0001553593,0.00002988206],"category_scores_gemma":[0.000003628823,0.0002611113,0.0001965541,0.0006370345,0.00006797216,0.0002657453,0.00001568061,0.0002991697,0.00003390359],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007597062,"about_ca_system_score_gemma":0.00007689064,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002894489,"about_ca_topic_score_gemma":0.00009438539,"domain_scores_codex":[0.9980374,0.00006967089,0.000376544,0.0006007632,0.0002896049,0.0006260271],"domain_scores_gemma":[0.9983966,0.0002766626,0.00008638418,0.0009663412,0.0001310989,0.0001428787],"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.0001031105,0.0001195059,0.00001717099,0.00002458893,0.00007009991,0.000004320151,0.000378014,0.7149819,0.0002298241,0.003161178,0.001409442,0.2795009],"study_design_scores_gemma":[0.0006401942,0.0002292801,0.000007607081,0.000170174,0.00001570594,0.00001004209,0.000006081491,0.9573317,0.0005963131,0.007698376,0.03297747,0.0003170915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002441064,0.00006106369,0.9907669,0.0004467171,0.003064055,0.00222383,0.000004858072,0.0003224503,0.0006690983],"genre_scores_gemma":[0.9119728,0.00001939483,0.08281257,0.0008209102,0.002626387,0.001352137,0.000001868595,0.00004471505,0.0003492248],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9095317,"threshold_uncertainty_score":0.9999841,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4313887518","doi":"10.1109/tnet.2023.3233953","title":"6Scan: A High-Efficiency Dynamic Internet-Wide IPv6 Scanner With Regional Encoding","year":2023,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":53,"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":"Science and Technology Program of Hunan Province; National Natural Science Foundation of China","keywords":"Computer science; IPv6; Scanner; IPv4; The Internet; Identifier; Encoding (memory); Asynchronous communication; Address space; IPv6 address; Network packet; Computer network; Distributed computing; Artificial intelligence; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.02079359624212916,"gpt":0.2366517616780633,"spread":0.2158581654359341,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004449387,0.0003198868,0.0002698819,0.0005232217,0.0006738941,0.0002759943,0.001096554,0.0001551245,0.00007754115],"category_scores_gemma":[0.000008853665,0.000294045,0.0001509719,0.002642805,0.0001098443,0.0005579598,0.0000326278,0.0006368863,0.0001909067],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002038679,"about_ca_system_score_gemma":0.00008606215,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001361849,"about_ca_topic_score_gemma":0.0004483692,"domain_scores_codex":[0.9973425,0.0001285366,0.0003881845,0.0008164516,0.0006044249,0.0007198816],"domain_scores_gemma":[0.99831,0.0004102785,0.0001524834,0.000868366,0.00008864307,0.000170174],"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.00018505,0.0002463112,0.0001011853,0.00003665033,0.000145151,0.0001454646,0.002202816,0.62015,0.0004592053,0.002636174,0.003418822,0.3702732],"study_design_scores_gemma":[0.000695254,0.0004714953,0.0004185122,0.0004209582,0.00003262407,0.0001139538,0.00008292926,0.9709291,0.0009064063,0.002591483,0.02273345,0.0006038775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04451586,0.00006727014,0.948067,0.001735418,0.003645796,0.0002626801,0.000002178551,0.001064418,0.0006393502],"genre_scores_gemma":[0.9922473,0.0002497582,0.005365453,0.00061003,0.0003564973,0.00007557433,0.000005777201,0.00004030598,0.001049275],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9477314,"threshold_uncertainty_score":0.9999512,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2096299490","doi":"10.1109/tnet.2009.2030326","title":"On Burst Transmission Scheduling in Mobile TV Broadcast Networks","year":2009,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":49,"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":"","keywords":"Computer science; Scheduling (production processes); Computer network; Base station; Testbed; Real-time computing; Schedule","retraction":null,"screen_n_in":null,"score":{"opus":0.01001123022695009,"gpt":0.2332018462787742,"spread":0.2231906160518241,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000187982,0.0004566103,0.0003958328,0.0003570593,0.0002691901,0.00007264409,0.0003212327,0.0003245041,0.00006967752],"category_scores_gemma":[0.000003478337,0.0005166774,0.0001547103,0.00114648,0.00003331312,0.0002865396,0.000001825403,0.001054517,0.00002111579],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003041213,"about_ca_system_score_gemma":0.00001583388,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003965633,"about_ca_topic_score_gemma":0.00001383531,"domain_scores_codex":[0.997798,0.00006733454,0.0005582991,0.0005024131,0.0002945031,0.0007794402],"domain_scores_gemma":[0.9989145,0.0002496839,0.0000670636,0.0005606494,0.0000326227,0.0001754954],"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.00006093687,0.0000765791,0.000007274804,0.000008367096,0.00001240882,0.00001167962,0.00008306987,0.6290365,0.0001574461,0.00001841196,0.0000359,0.3704914],"study_design_scores_gemma":[0.0008284456,0.000203799,0.00006473953,0.0007134034,0.00002344501,0.000009378156,0.00003310002,0.9938791,0.0007452905,0.0006283532,0.002356749,0.0005141282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01893435,0.001542305,0.9757651,0.00006661325,0.001571731,0.0005190725,0.00000312275,0.0008129629,0.0007847569],"genre_scores_gemma":[0.9831653,0.002923634,0.01285455,0.0002025882,0.0005772493,0.0000878898,0.00001938276,0.0001168511,0.00005255613],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.964231,"threshold_uncertainty_score":0.9997285,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2042858188","doi":"10.1109/tnet.2011.2176140","title":"Optimal Control of Wireless Networks With Finite Buffers","year":2011,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":49,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Computer science; Queue; Bounded function; Scheduling (production processes); Flow network; Notation; Algorithm; Theoretical computer science; Discrete mathematics; Computer network; Mathematics; Mathematical optimization; Arithmetic","retraction":null,"screen_n_in":null,"score":{"opus":0.01425126049083637,"gpt":0.1916679615832101,"spread":0.1774167010923738,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001226306,0.0003587567,0.0004149918,0.0001699527,0.0001544276,0.00001989119,0.0003107026,0.0001938001,0.00007180629],"category_scores_gemma":[0.000002136643,0.0003587981,0.000117278,0.0006342501,0.0001145763,0.0002286352,0.000002615394,0.0004889956,0.000006367924],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008220575,"about_ca_system_score_gemma":0.00001815413,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001135877,"about_ca_topic_score_gemma":0.00003431685,"domain_scores_codex":[0.998418,0.00005177837,0.0004380308,0.0003134194,0.0002291343,0.0005496099],"domain_scores_gemma":[0.9988415,0.000265502,0.0001212921,0.0005601624,0.00008257623,0.0001289406],"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.0002433758,0.00005744205,0.000205896,0.0000240761,0.0001778992,0.00001030613,0.0002448711,0.9641876,0.00006457065,0.00002212007,0.00002158414,0.0347403],"study_design_scores_gemma":[0.001102261,0.0001891529,0.0001136788,0.0002527011,0.0001144341,0.00001009105,0.00005513386,0.9959681,0.001581281,0.00002847336,0.0001878794,0.0003967973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01311317,0.0002624626,0.9838193,0.000007788772,0.001111943,0.0003432802,0.00001055401,0.0005081034,0.0008234045],"genre_scores_gemma":[0.9708313,0.0005039733,0.02810181,0.00004343188,0.0002659383,0.00007945193,0.000007588093,0.0001356168,0.00003090719],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9577181,"threshold_uncertainty_score":0.9998864,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2049401533","doi":"10.1109/tnet.2013.2283924","title":"Joint Dimensioning of Server and Network Infrastructure for Resilient Optical Grids/Clouds","year":2013,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":49,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"FP7 Information and Communication Technologies; Natural Sciences and Engineering Research Council of Canada; Universiteit Gent; Concordia University; European Commission","keywords":"Computer science; Cloud computing; Backup; Distributed computing; Computer network; Network topology; Overlay network; Dimensioning; Virtual machine; Virtual network; Grid; Server; Server farm; Node (physics); The Internet; Operating system; Client–server model","retraction":null,"screen_n_in":null,"score":{"opus":0.01191349743740412,"gpt":0.2158486462719548,"spread":0.2039351488345507,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001311096,0.0002932628,0.0004029746,0.00008980286,0.0001971164,0.00004186248,0.0002024505,0.000268474,0.00003061482],"category_scores_gemma":[0.00002303411,0.0002781719,0.0001162491,0.0003632652,0.0001523687,0.0001629134,0.00001589225,0.0005209255,0.000006507503],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007788243,"about_ca_system_score_gemma":0.000009560583,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003396567,"about_ca_topic_score_gemma":0.00001035841,"domain_scores_codex":[0.9984117,0.0000182571,0.0004605976,0.0003252071,0.000181079,0.0006031541],"domain_scores_gemma":[0.9988434,0.0004084701,0.0000601488,0.0004997216,0.00007128541,0.0001169129],"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.00002056775,0.00001392585,0.00009545981,0.00005858085,0.00006550147,0.000001222659,0.00003804096,0.9111933,0.001102484,0.0004557926,0.0009282874,0.08602686],"study_design_scores_gemma":[0.00124867,0.0004337515,0.003280684,0.0008682274,0.0001600194,0.00003346294,0.0001644747,0.9359065,0.008359503,0.04272466,0.005858412,0.0009616325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2458073,0.0008367778,0.749873,0.0001960442,0.001652314,0.0007135028,0.000005571515,0.0006867166,0.0002288453],"genre_scores_gemma":[0.8373756,0.0003191619,0.1617154,0.00005352612,0.0003202572,0.0001205996,0.0000028329,0.00006364219,0.00002896226],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5915684,"threshold_uncertainty_score":0.999967,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2164399652","doi":"10.1109/tnet.2010.2091652","title":"An Adaptive Network Coded Retransmission Scheme for Single-Hop Wireless Multicast Broadcast Services","year":2010,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":46,"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":"","keywords":"Computer science; Linear network coding; Retransmission; Multicast; Computer network; Wireless network; Spectral efficiency; Performance metric; Multiple description coding; Network packet; Distributed computing; Wireless; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.05062227745882194,"gpt":0.2949330877752368,"spread":0.2443108103164149,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0006418741,0.0004124381,0.0003762936,0.0001548688,0.001545852,0.0004486379,0.002169088,0.0002740429,0.00004166457],"category_scores_gemma":[0.000006657726,0.0004169062,0.0002034482,0.0009713937,0.0001111825,0.0008099889,0.00003364611,0.000977089,0.00001742498],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007434643,"about_ca_system_score_gemma":0.00007099022,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001263261,"about_ca_topic_score_gemma":0.000479911,"domain_scores_codex":[0.9973052,0.0002354581,0.00052505,0.0008337771,0.0003499801,0.0007506057],"domain_scores_gemma":[0.9965824,0.0006159882,0.000202441,0.001943451,0.0003272336,0.000328511],"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.000228449,0.0004961124,0.00005845754,0.00002957238,0.00007959543,0.000005441977,0.001406472,0.03290002,0.0731019,0.002087273,0.0001300609,0.8894767],"study_design_scores_gemma":[0.0009830747,0.0004299131,0.00007052135,0.0003303721,0.00003151049,0.0000216129,0.00008021538,0.972473,0.007173699,0.0005043685,0.01732439,0.0005773113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01933859,0.0002228446,0.975256,0.000589882,0.002936897,0.0006682057,0.000009177789,0.0005590505,0.0004193189],"genre_scores_gemma":[0.8254145,0.0002389423,0.1727157,0.0005186471,0.0008615669,0.0001154457,0.00001361292,0.00005231089,0.00006922832],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.939573,"threshold_uncertainty_score":0.9998283,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2344562284","doi":"10.1109/tnet.2016.2521365","title":"Congestion Control for Vehicular Networks With Safety-Awareness","year":2016,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":45,"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 Science Foundation","keywords":"Computer science; Computer network; Beacon; Quality of service; Control channel; Channel (broadcasting); Node (physics); Context (archaeology); Network congestion; Vehicular ad hoc network; Transmission (telecommunications); Power control; Wireless; Wireless ad hoc network; Power (physics); Telecommunications; Base station; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01108818063457605,"gpt":0.2105524872374385,"spread":0.1994643066028624,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004015949,0.0004980155,0.0005025737,0.0001516476,0.0004120686,0.00007937929,0.0003706823,0.0003298022,0.00004722385],"category_scores_gemma":[0.00000842671,0.0003844597,0.0002236604,0.0003951994,0.00009813492,0.0002525264,0.000002823214,0.0003984023,0.00002454016],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003010327,"about_ca_system_score_gemma":0.00004505846,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008398972,"about_ca_topic_score_gemma":0.0001850986,"domain_scores_codex":[0.997611,0.00009369804,0.0004748357,0.0005302338,0.0003099716,0.0009802032],"domain_scores_gemma":[0.9979455,0.0008186804,0.00009070983,0.0007830532,0.0001263134,0.0002356939],"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.0003260596,0.00003351969,0.0001431397,0.00002723995,0.0002833283,0.00001497533,0.00002026777,0.8910429,0.000331148,0.00003873246,0.0002813174,0.1074573],"study_design_scores_gemma":[0.004042791,0.0002448841,0.0002787114,0.0007547771,0.0002744301,0.00005641125,0.00001145603,0.9663773,0.0006602263,0.0001681953,0.02639661,0.0007341898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009553632,0.000580149,0.9847461,0.0003283338,0.002643489,0.001004946,0.00004671648,0.0009544028,0.0001422606],"genre_scores_gemma":[0.9948282,0.0004967609,0.002388227,0.0001674426,0.001320835,0.0004329185,0.00001885936,0.0002067095,0.0001400471],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9852746,"threshold_uncertainty_score":0.9998607,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2323101214","doi":"10.1109/tnet.2015.2510864","title":"Towards Promoting Backup-Sharing in Survivable Virtual Network Design","year":2016,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Backup; Computer science; Computer network; Provisioning; Survivability; Node (physics); Backup software; Distributed computing; Operating system; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.04589320865502491,"gpt":0.251639683623281,"spread":0.2057464749682561,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001613322,0.0004203029,0.0004435292,0.0002440316,0.0005056365,0.0002918862,0.001736343,0.0002321573,0.00005910175],"category_scores_gemma":[0.00003832781,0.0003471415,0.0001785144,0.001658535,0.00006195225,0.0007685042,0.00006210837,0.0005131062,0.00008531455],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002508703,"about_ca_system_score_gemma":0.0001226734,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007895414,"about_ca_topic_score_gemma":0.0001226766,"domain_scores_codex":[0.9962431,0.0002724101,0.0006527943,0.001051644,0.0004797815,0.001300235],"domain_scores_gemma":[0.9970745,0.001142586,0.0001789918,0.001314644,0.00007331498,0.0002159017],"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.00004814367,0.0001057543,0.001083753,0.000008263812,0.0000422366,0.00003998867,0.0002832865,0.3719472,0.0001251299,0.0007880226,0.0003487657,0.6251794],"study_design_scores_gemma":[0.004937532,0.001212012,0.002756143,0.004434155,0.00007715172,0.0001333451,0.00006098344,0.9205383,0.003207545,0.04654172,0.01324699,0.002854139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004218628,0.0002340639,0.9900907,0.0006639604,0.003377557,0.0004046118,0.000001900197,0.0006352073,0.0003733773],"genre_scores_gemma":[0.9011527,0.0002668088,0.09655236,0.0003395846,0.001140277,0.0001204555,9.903257e-7,0.00007233809,0.0003545175],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.896934,"threshold_uncertainty_score":0.9998981,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2150586899","doi":"10.1109/tnet.2005.857070","title":"Packet classification consuming small amount of memory","year":2005,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; Canadian Space Agency","funders":"","keywords":"Computer science; Bottleneck; Router; Network packet; The Internet; Algorithm; Speedup; Computer network; Parallel computing; Embedded system","retraction":null,"screen_n_in":null,"score":{"opus":0.045177678743253,"gpt":0.2589935259185676,"spread":0.2138158471753145,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004128292,0.0001978898,0.0002204149,0.0001990407,0.000338357,0.000128349,0.000669867,0.0001283669,0.00001611805],"category_scores_gemma":[0.000007891746,0.0002068352,0.0001044381,0.0007436739,0.00007799522,0.0003968192,0.000006766548,0.0002835068,0.00002521122],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001063711,"about_ca_system_score_gemma":0.00007592025,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009310926,"about_ca_topic_score_gemma":0.00005922185,"domain_scores_codex":[0.9983973,0.0001044774,0.0004443196,0.0004363054,0.0002690053,0.0003485738],"domain_scores_gemma":[0.9985022,0.0002440182,0.0002527526,0.0007731274,0.0001341121,0.00009382322],"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.00001609089,0.0001149076,0.0000673243,0.00002085604,0.00002667609,0.000001318498,0.0006875741,0.3022881,0.0005179015,0.0002852183,0.0001755066,0.6957985],"study_design_scores_gemma":[0.0005965857,0.00008139162,0.0002591377,0.0003027548,0.00004700911,0.00002022971,0.00008251593,0.9815037,0.01021142,0.0007847192,0.005722235,0.0003883175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01147824,0.0002988205,0.9845263,0.0007175845,0.00113556,0.0001593532,0.000001802775,0.0002798817,0.001402484],"genre_scores_gemma":[0.8776274,0.000230235,0.1211954,0.000241165,0.0003940946,0.00002357958,0.000003658795,0.00002159995,0.0002628002],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8661492,"threshold_uncertainty_score":0.8434494,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2081092554","doi":"10.1109/tnet.2007.896499","title":"A Framework for Evaluating the Performance of Cluster Algorithms for Hierarchical Networks","year":2007,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":40,"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; Cluster analysis; Hierarchical network model; Hierarchical clustering; Scalability; Algorithm; Routing table; Hierarchical routing; Canopy clustering algorithm; Routing (electronic design automation); Hierarchy; Correlation clustering; Routing protocol; Static routing; Machine learning; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.0744156281436579,"gpt":0.33880117369312,"spread":0.264385545549462,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002138246,0.0001863165,0.0002238396,0.0001048835,0.0007126181,0.0000959895,0.0009090347,0.0001498151,0.000001883104],"category_scores_gemma":[0.00003866002,0.0001474701,0.0002830267,0.0004099505,0.00006875811,0.0001644313,0.00001492307,0.0005024973,0.000001132528],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005338209,"about_ca_system_score_gemma":0.00004541775,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008757073,"about_ca_topic_score_gemma":0.00001213191,"domain_scores_codex":[0.9982313,0.0000744596,0.0004454175,0.0003890554,0.0003104419,0.0005493098],"domain_scores_gemma":[0.9952123,0.003688428,0.0001623119,0.0007248839,0.0001369477,0.00007515367],"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.0002580894,0.00005971229,0.00004062906,0.0000225325,0.00005573474,4.082679e-7,0.0003323475,0.3512841,0.00009227249,0.001040141,0.00005513283,0.6467589],"study_design_scores_gemma":[0.0005403393,0.0006384561,0.00007813526,0.0002222891,0.00004365869,0.00001009045,0.00002889175,0.9945543,0.0003432782,0.002763785,0.0005986184,0.0001781077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02855603,0.0001855636,0.9667861,0.0006355215,0.003017967,0.0006835296,0.000003866206,0.0001037921,0.00002757265],"genre_scores_gemma":[0.8247533,0.00003685647,0.1735777,0.000628543,0.0007821979,0.0001210615,0.000001600625,0.00002133398,0.00007743255],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7961972,"threshold_uncertainty_score":0.6013654,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2487311990","doi":"10.1109/tnet.2016.2590320","title":"Performance Modeling, Analysis, and Optimization of Delayed Mobile Data Offloading for Mobile Users","year":2016,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Green IT and Sustainability","field":"Engineering","cited_by":38,"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; Queueing theory; Processor sharing; Computer network; Key (lock); Mobile broadband; Cellular network; Distributed computing; Mobile device; Wireless; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.02397800597879845,"gpt":0.2498403927074172,"spread":0.2258623867286187,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002814049,0.000154878,0.0002461335,0.0002003823,0.0001448033,0.00001894486,0.000258017,0.00009212916,0.00002051166],"category_scores_gemma":[0.000005856871,0.0001347564,0.00008354903,0.0004327538,0.00003581275,0.0002988027,0.000006919667,0.00008865564,4.908325e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007688427,"about_ca_system_score_gemma":0.00001736646,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002367413,"about_ca_topic_score_gemma":0.00007408918,"domain_scores_codex":[0.998992,0.00001581706,0.0003201452,0.0002906915,0.0001166,0.0002647151],"domain_scores_gemma":[0.998969,0.0001531685,0.00004494187,0.0006921219,0.00007916641,0.00006161538],"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.00003896342,0.00001928181,0.0008097279,0.00005999916,0.0002284878,1.487714e-7,0.0001126115,0.9380154,0.0001883203,6.945704e-7,0.00001154075,0.06051484],"study_design_scores_gemma":[0.0003481255,0.00008333475,0.00003071027,0.00004956009,0.0003179463,7.780935e-7,0.00008083657,0.9981062,0.0005971772,0.00002442865,0.0001992294,0.0001616239],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3224646,0.0001327815,0.6767602,0.000004760875,0.0001974708,0.0002874377,0.00004971453,0.00008895946,0.00001405421],"genre_scores_gemma":[0.9847813,0.000706046,0.0142305,0.000004258136,0.00007014893,0.0001256458,0.00002584092,0.00003061416,0.00002568336],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6625297,"threshold_uncertainty_score":0.5495207,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2163400165","doi":"10.1109/tnet.2005.858448","title":"Price-based rate control in random access networks","year":2005,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":37,"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":"","keywords":"Aloha; Computer science; Random access; Throughput; Markov chain; A priori and a posteriori; Network packet; Markov process; Set (abstract data type); Channel (broadcasting); Aggregate (composite); Computer network; Wireless; Telecommunications; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02611470150294075,"gpt":0.2805187479822777,"spread":0.254404046479337,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001128169,0.0003791244,0.0004846549,0.0002933514,0.0003873154,0.0005817314,0.001906635,0.0002333654,0.00006188331],"category_scores_gemma":[0.000007258451,0.0003685981,0.0002264237,0.001383786,0.00005525032,0.000834831,0.00001636428,0.0008035973,0.00003037453],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001920584,"about_ca_system_score_gemma":0.0001430731,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000039478,"about_ca_topic_score_gemma":0.0002517673,"domain_scores_codex":[0.9969475,0.0004468585,0.000642522,0.0007249569,0.0003247143,0.0009134911],"domain_scores_gemma":[0.9972929,0.001119963,0.0002078879,0.001110176,0.00006955957,0.0001995058],"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.0002168922,0.0001312254,0.0002219585,0.000007081098,0.00002679553,0.00001478857,0.00004277726,0.7996037,0.00001854285,0.00009511052,0.0002776748,0.1993435],"study_design_scores_gemma":[0.005784412,0.00008698836,0.0005740114,0.0002613291,0.0000181634,0.000005237227,0.00000188977,0.9722111,0.00022734,0.0003294202,0.02007997,0.0004201088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.000627362,0.0002369007,0.9911782,0.002116901,0.0014445,0.003418173,0.000002245682,0.0003443754,0.0006313689],"genre_scores_gemma":[0.9858189,0.00009348502,0.006661911,0.003520934,0.001223792,0.002538584,0.00000202839,0.00004188982,0.00009847953],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9851915,"threshold_uncertainty_score":0.9998766,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2117668131","doi":"10.1109/tnet.2008.2001467","title":"Survivability Approaches Using p-Cycles in WDM Mesh Networks Under Static Traffic","year":2008,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":36,"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":"","keywords":"Backup; Computer science; Routing and wavelength assignment; Survivability; Wavelength-division multiplexing; Integer programming; Routing (electronic design automation); Metric (unit); Computer network; Distributed computing; Path protection; Network topology; Traffic grooming; Mathematical optimization; Path (computing); Algorithm; Wavelength; Mathematics; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.08503258910870942,"gpt":0.253445848948188,"spread":0.1684132598394786,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002659601,0.0004481722,0.0005110542,0.0002591426,0.0003091136,0.00003728533,0.000431978,0.0003554093,0.00002128707],"category_scores_gemma":[0.00001425462,0.0004858095,0.0001574604,0.001187405,0.0002973164,0.0002681412,0.00001021403,0.001116303,0.000007664485],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000416124,"about_ca_system_score_gemma":0.00002715345,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001730594,"about_ca_topic_score_gemma":0.0002995598,"domain_scores_codex":[0.9975764,0.00009935803,0.0006077298,0.0005268424,0.0002726884,0.000917054],"domain_scores_gemma":[0.9983661,0.0006536397,0.00005953161,0.0007814336,0.00002408586,0.0001152785],"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.00002494153,0.00009333133,0.0002785937,0.00002727272,0.00005060327,0.00001999915,0.0001225002,0.9445137,0.00002573525,0.00004427455,0.00001881673,0.05478028],"study_design_scores_gemma":[0.000421927,0.00003882771,0.0008149731,0.0001345501,0.00003105444,0.00003226656,0.0002354942,0.9963392,0.00009989422,0.001243339,0.00009926898,0.0005092117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3851105,0.0004255347,0.6121439,0.00005488441,0.0008173628,0.0002937421,0.000003370812,0.001025672,0.0001250814],"genre_scores_gemma":[0.9611707,0.0008814845,0.03751714,0.00003736155,0.0001998541,0.0000639845,0.000004677026,0.0001116926,0.00001304907],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5760602,"threshold_uncertainty_score":0.9997594,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3014068862","doi":"10.1109/tnet.2020.2979966","title":"DeepCast: Towards Personalized QoE for Edge-Assisted Crowdcast With Deep Reinforcement Learning","year":2020,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Image and Video Quality Assessment","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Reinforcement learning; Computer science; Enhanced Data Rates for GSM Evolution; Human–computer interaction; Reinforcement; Artificial intelligence; Psychology; Social psychology","retraction":null,"screen_n_in":null,"score":{"opus":0.06871222429529984,"gpt":0.2995165212917906,"spread":0.2308042969964907,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003288893,0.0003187751,0.0003469771,0.0001035066,0.0007639686,0.0003874137,0.0007649152,0.00009701572,0.0000494121],"category_scores_gemma":[0.00001694586,0.0002971312,0.0002262445,0.0006634929,0.0000655785,0.0004686395,0.00002014368,0.0004621292,0.00002315204],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001455529,"about_ca_system_score_gemma":0.0001472472,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002984787,"about_ca_topic_score_gemma":0.00003090721,"domain_scores_codex":[0.9976735,0.0001388619,0.0004194901,0.0006555205,0.0005087774,0.000603872],"domain_scores_gemma":[0.9986745,0.0002412093,0.0001804511,0.0005087316,0.0001520325,0.0002430926],"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.0004079089,0.0001415127,0.00002962071,0.0001244665,0.0002706412,0.00004294882,0.006547209,0.547243,0.0005634641,0.0006212715,0.000302671,0.4437053],"study_design_scores_gemma":[0.002683793,0.001314492,0.00009283322,0.0001894584,0.0001228296,0.00003881098,0.0006187711,0.9494628,0.002904423,0.0001156971,0.0417998,0.0006562903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0005722472,0.0001152881,0.9935089,0.003705008,0.0006263097,0.0005379407,0.000001289402,0.0003620834,0.0005709589],"genre_scores_gemma":[0.9186502,0.00004105803,0.07793238,0.002331786,0.0004465678,0.000190823,0.000008784438,0.000040983,0.0003574165],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9180779,"threshold_uncertainty_score":0.9999481,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2153876525","doi":"10.1109/tnet.2004.833125","title":"Design and Stability Analysis of a Rate Control Algorithm Using the Routh–Hurwitz Stability Criterion","year":2004,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Routh–Hurwitz stability criterion; Stability (learning theory); Computer science; Control theory (sociology); Stability criterion; Transfer function; Flow control (data); Control system; Algorithm; Feedback control; Control (management); Mathematics; Control engineering; Artificial intelligence; Telecommunications; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.0425240423907013,"gpt":0.257357525949143,"spread":0.2148334835584417,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001780362,0.0002653948,0.0005002214,0.0001854526,0.0005340803,0.0001776469,0.0006161439,0.0001126686,0.00002194265],"category_scores_gemma":[0.00001547044,0.00021301,0.0002490314,0.001620564,0.0002019008,0.0003099646,0.00001242981,0.0003469445,0.000001496189],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001610056,"about_ca_system_score_gemma":0.0001358474,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001280493,"about_ca_topic_score_gemma":0.0001097561,"domain_scores_codex":[0.9973555,0.000715847,0.000556136,0.000624379,0.0003251237,0.0004230206],"domain_scores_gemma":[0.9973078,0.001089659,0.0002189601,0.001078272,0.000181736,0.0001235788],"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.00008202267,0.0001311757,0.0001075719,0.000006739446,0.0004630639,0.000003561723,0.0008822888,0.7610548,0.0007619917,0.0001044233,9.643201e-7,0.2364014],"study_design_scores_gemma":[0.00105805,0.0001186317,0.0003824443,0.0000422783,0.0006880466,0.000005739374,0.00008704491,0.9955454,0.0009151992,0.0009121353,0.00003079046,0.0002142234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05005406,0.0002918085,0.9477659,0.0005913133,0.0006068152,0.0005381665,0.00001245954,0.0001331152,0.000006360504],"genre_scores_gemma":[0.9480463,0.00005302435,0.05150319,0.0002441139,0.00009752463,0.00003928195,0.000001225616,0.00001305376,0.000002286302],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8979923,"threshold_uncertainty_score":0.8686298,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3140719572","doi":"10.1109/tnet.2021.3066558","title":"Multi-Persona Mobility: Joint Cost-Effective and Resource-Aware Mobile-Edge Computation Offloading","year":2021,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; École de technologie supérieure; Lebanese American University","keywords":"Computer science; Computation offloading; Mobile device; Mobile computing; Mobile edge computing; Context (archaeology); Edge computing; Computer network; Distributed computing; Enhanced Data Rates for GSM Evolution; Server; Operating system; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.04643610454694119,"gpt":0.2822271360410389,"spread":0.2357910314940977,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005285003,0.0003297166,0.000378195,0.0002084343,0.0009234217,0.0003723502,0.0003681492,0.0001623111,0.000003794199],"category_scores_gemma":[0.00002009404,0.0003630446,0.0001791187,0.0008781427,0.00008341249,0.000356491,0.00005176086,0.0006110558,0.00001918905],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002350549,"about_ca_system_score_gemma":0.00008012451,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002485792,"about_ca_topic_score_gemma":0.0000157772,"domain_scores_codex":[0.9974301,0.0003191628,0.000416481,0.0009324968,0.0003100107,0.000591759],"domain_scores_gemma":[0.998188,0.0006892442,0.0001372892,0.0006310082,0.0001609594,0.0001935587],"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.00001811634,0.0002151648,0.0001544258,0.00005674913,0.00007891209,0.00005977694,0.003157549,0.05838605,0.0009020686,0.000008335757,0.0002690939,0.9366937],"study_design_scores_gemma":[0.001108448,0.0001630968,0.00126041,0.0004237393,0.00004912181,0.0001373717,0.0003284379,0.979179,0.00560227,0.0002576681,0.01094577,0.0005446473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03592203,0.00051148,0.9547081,0.0002043969,0.007125398,0.0009419907,0.000001630323,0.0004052709,0.0001797141],"genre_scores_gemma":[0.9650279,0.00005315855,0.0328742,0.0003810406,0.001264947,0.0002377287,0.000008350662,0.00004256277,0.0001100598],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9361491,"threshold_uncertainty_score":0.9998822,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2122482858","doi":"10.1109/tnet.2009.2020820","title":"Resequencing Analysis of Stop-and-Wait ARQ for Parallel Multichannel Communications","year":2009,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":33,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Automatic repeat request; Hybrid automatic repeat request; Selective Repeat ARQ; Real-time computing; Channel (broadcasting); Go-Back-N ARQ; Computer network; Algorithm; Telecommunications link","retraction":null,"screen_n_in":null,"score":{"opus":0.03913694537516828,"gpt":0.2832195993634902,"spread":0.2440826539883219,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001761861,0.0001946176,0.0003608522,0.0003938451,0.0002597189,0.00002509235,0.0003200136,0.0001180465,0.00000581433],"category_scores_gemma":[0.00001133109,0.0002257375,0.0001686844,0.00109797,0.00005641376,0.0001568364,0.000003748544,0.0002417215,8.14679e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000992847,"about_ca_system_score_gemma":0.00001039443,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008622987,"about_ca_topic_score_gemma":0.0001071865,"domain_scores_codex":[0.9988713,0.00004003871,0.000420187,0.0002285528,0.0001334075,0.0003065663],"domain_scores_gemma":[0.9984563,0.0004668775,0.00009308217,0.0008268209,0.00008237313,0.00007457255],"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.00002402294,0.00003414404,0.00002434601,0.00001152484,0.0002995789,3.219349e-7,0.0003329985,0.9438025,0.0005372032,0.0001320092,0.0000167715,0.05478462],"study_design_scores_gemma":[0.0003677083,0.0000519056,0.0002093867,0.00008560336,0.0005060973,0.000001125999,0.00008116843,0.9969184,0.0004259654,0.000850506,0.0002930614,0.0002091135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005354727,0.0007478868,0.9926879,0.0001637317,0.0002528018,0.0003456949,0.00002410804,0.0002515932,0.0001715165],"genre_scores_gemma":[0.8797308,0.001684144,0.1182822,0.00005471924,0.00008019086,0.00006693216,0.0000344794,0.0000335358,0.00003302286],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8744058,"threshold_uncertainty_score":0.9205307,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2808622696","doi":"10.1109/tnet.2018.2841397","title":"Delayed Installation and Expedited Eviction: An Alternative Approach to Reduce Flow Table Occupancy in SDN Switches","year":2018,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":32,"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":"","keywords":"Computer science; Timeout; Knapsack problem; OpenFlow; Network packet; Table (database); Throughput; Computer network; Real-time computing; Algorithm; Software-defined networking; Operating system; Data mining","retraction":null,"screen_n_in":null,"score":{"opus":0.04438624312030501,"gpt":0.2806499170756158,"spread":0.2362636739553108,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003520286,0.0002632089,0.0002468207,0.0003266968,0.000436758,0.0002438872,0.0005403922,0.0001439794,0.000008708657],"category_scores_gemma":[0.00001098615,0.0002725752,0.00004739578,0.001546769,0.00005389602,0.0008465913,0.00002161738,0.000317674,0.00001155031],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001524963,"about_ca_system_score_gemma":0.00007301329,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00020796,"about_ca_topic_score_gemma":0.0003107059,"domain_scores_codex":[0.9979802,0.0001055268,0.0003635746,0.0007765683,0.0003002643,0.000473841],"domain_scores_gemma":[0.9987301,0.0001485617,0.00009810234,0.0007122166,0.0001190663,0.0001920158],"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.0002713439,0.0004066886,0.001072961,0.00001442045,0.0000731672,0.000007695275,0.008943459,0.3755942,0.000336896,0.000270806,0.0004602346,0.6125481],"study_design_scores_gemma":[0.0008568618,0.000498265,0.001883467,0.0001605901,0.00001940664,0.00003401621,0.0001513839,0.9903823,0.0008980607,0.00149836,0.003141571,0.0004756889],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07723614,0.0001417075,0.9189476,0.0001579598,0.002151617,0.0003624378,0.000004167805,0.0002777337,0.0007206514],"genre_scores_gemma":[0.9150087,0.00007017251,0.08306579,0.0003444375,0.001315963,0.00009400117,0.000007263724,0.00002722969,0.00006647314],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8377725,"threshold_uncertainty_score":0.9999726,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2160955579","doi":"10.1109/tnet.2011.2107563","title":"On Dynamic Server Provisioning in Multichannel P2P Live Streaming","year":2011,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":30,"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":"","keywords":"Computer science; Upload; Server; Computer network; Bandwidth (computing); Real Time Streaming Protocol; Provisioning; Live streaming; The Internet; Quality of service; Channel (broadcasting); Peer-to-peer; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.03435184294614749,"gpt":0.2535558455465969,"spread":0.2192040026004494,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004080617,0.0003781544,0.00032435,0.0006734238,0.0003386473,0.0001344,0.001851688,0.0002301153,0.00001848122],"category_scores_gemma":[0.00003693971,0.0003872476,0.0001251347,0.001415718,0.00005590221,0.0004468771,0.0000666011,0.0008122088,0.0001521982],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003039472,"about_ca_system_score_gemma":0.00005095379,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002068494,"about_ca_topic_score_gemma":0.001085069,"domain_scores_codex":[0.9972743,0.0001039057,0.0004471255,0.0009081027,0.0004185786,0.0008479785],"domain_scores_gemma":[0.9978296,0.0003887342,0.0001260666,0.001452075,0.00006550214,0.0001380066],"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.00008745802,0.000468027,0.0003939088,0.00002159335,0.00006402269,0.0001649304,0.005616819,0.3065368,0.000255918,0.0007432189,0.0001035922,0.6855437],"study_design_scores_gemma":[0.001311947,0.001036236,0.00449662,0.001786894,0.00003562713,0.00003965111,0.0005978979,0.9699347,0.003615233,0.01537159,0.0004216697,0.001351929],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1915937,0.00008195336,0.8037815,0.0003598926,0.002068859,0.0005426655,0.000002989424,0.001074361,0.0004940937],"genre_scores_gemma":[0.9284503,0.00003622145,0.07083578,0.0002991276,0.00006576016,0.0001134236,0.000001189545,0.00004196056,0.0001562237],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7368566,"threshold_uncertainty_score":0.999858,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4285252588","doi":"10.1109/tnet.2022.3174003","title":"An Anonymity Vulnerability in Tor","year":2022,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":29,"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":"Anonymity; Vulnerability (computing); Computer science; Computer security; Internet privacy","retraction":null,"screen_n_in":null,"score":{"opus":0.02414816659440874,"gpt":0.2682630529693672,"spread":0.2441148863749585,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001090421,0.0001763962,0.0002364222,0.0002079139,0.0006325082,0.0001365259,0.001279783,0.00005401494,0.0001924447],"category_scores_gemma":[0.00000580563,0.0001905015,0.0001640198,0.0009482327,0.00002929477,0.0003194454,0.00002312691,0.0007619685,0.000009562494],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002544731,"about_ca_system_score_gemma":0.00005671614,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008742089,"about_ca_topic_score_gemma":0.0006557234,"domain_scores_codex":[0.9976862,0.0004689458,0.0003881291,0.0006316568,0.000405018,0.0004200513],"domain_scores_gemma":[0.9989119,0.0001970777,0.00008869886,0.0006740556,0.00003343775,0.00009478345],"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.00001898005,0.0003312539,0.0002278068,0.000003218642,0.0000194699,0.00002433527,0.0009990974,0.9136376,0.00004668879,0.001726566,0.00005711265,0.08290788],"study_design_scores_gemma":[0.0002574622,0.0001566131,0.0003440311,0.00001269296,0.00001003217,0.00001245814,0.0001365273,0.9963765,0.00009138935,0.0001670007,0.002211785,0.0002235591],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1665221,0.0000407929,0.8310782,0.0002354649,0.001621667,0.0001297727,0.000003201939,0.0001792653,0.0001895089],"genre_scores_gemma":[0.9940099,0.000005332627,0.005257367,0.0003736872,0.0001998566,0.00006127747,0.0000029141,0.00001416786,0.00007547977],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8274878,"threshold_uncertainty_score":0.7768425,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2170110577","doi":"10.1109/tnet.2008.926501","title":"Minimizing Internal Speedup for Performance Guaranteed Switches With Optical Fabrics","year":2008,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":29,"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":"Hong Kong University of Science and Technology","keywords":"Speedup; Computer science; Control reconfiguration; Scheduling (production processes); Network packet; Packet switching; Algorithm; Parallel computing; Overhead (engineering); Computer network; Mathematical optimization; Embedded system; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.04540626732718292,"gpt":0.2371042873803048,"spread":0.1916980200531219,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003263563,0.0002929947,0.000336059,0.0001911715,0.000771417,0.0001717289,0.0008325977,0.0001297496,0.000009028638],"category_scores_gemma":[0.000006317762,0.00025045,0.000193219,0.0005041445,0.00008712548,0.0004120684,0.00001113724,0.000406261,0.00002175753],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001081345,"about_ca_system_score_gemma":0.00008061172,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002209982,"about_ca_topic_score_gemma":0.0000379425,"domain_scores_codex":[0.9979912,0.00003571624,0.0004598655,0.0005600626,0.0003582604,0.0005948959],"domain_scores_gemma":[0.9985979,0.0003496634,0.0001435765,0.0006434199,0.0001365669,0.0001289238],"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.001285508,0.0006752868,0.003416154,0.000194384,0.0006269393,0.0001435082,0.005905149,0.6163095,0.001532747,0.002149784,0.002851081,0.36491],"study_design_scores_gemma":[0.001799865,0.001168053,0.0004009744,0.0007344245,0.00004830425,0.001530426,0.0001792402,0.9680368,0.006875042,0.0001558749,0.01830194,0.0007690768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09762963,0.0000629672,0.8970795,0.000231567,0.003354372,0.000325093,0.000001876222,0.0002373356,0.001077669],"genre_scores_gemma":[0.9642379,0.00006575259,0.03367941,0.0003541134,0.0009455293,0.00008328157,0.000001080238,0.00003576927,0.0005972],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8666083,"threshold_uncertainty_score":0.9999948,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}