{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Jitendra Padhye","is_ca":false},{"name":"Victor Firoiu","is_ca":true},{"name":"Don Towsley","is_ca":false},{"name":"James F. Kurose","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004686982,0.001416722,0.001107479,0.001476993,0.0006449887,0.001190339,0.00277742,0.002570181,0.0007166117],"category_scores_gemma":[0.02601794,0.0005774961,0.0006435365,0.00193519,0.001115038,0.003176715,0.0009052787,0.001941389,0.0003491905],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002247549,"about_ca_system_score_gemma":0.001052987,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01834754,"about_ca_topic_score_gemma":0.007461596,"domain_scores_codex":[0.9981817,0.0006854022,0.0001120185,0.0002920018,0.0005393087,0.0001896723],"domain_scores_gemma":[0.9857191,0.00918125,0.00149171,0.001797877,0.001620916,0.0001890858],"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.0001822431,0.0004563101,0.01386486,0.0001437285,0.00006318356,0.0001044555,0.0002374216,0.9602542,0.002761687,0.007249598,0.001162715,0.01351955],"study_design_scores_gemma":[0.00001152282,0.00006139147,0.001854458,0.00001143049,0.000008653634,0.00002522456,0.00001744051,0.9956956,0.0005045546,0.001585716,0.0002087809,0.00001527475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8739188,0.001006989,0.117098,0.0007789906,0.0000779722,0.0003450936,0.001214683,0.001066496,0.004492927],"genre_scores_gemma":[0.9846234,0.0005237942,0.01340912,0.000064632,0.00003541139,0.000190197,0.0005367384,0.00005901429,0.0005578068],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01834754,"threshold_uncertainty_score":0.0364815,"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","authors":[{"name":"Chung Kei Wong","is_ca":false},{"name":"Mohamed G. Gouda","is_ca":false},{"name":"Simon S. Lam","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002616267,0.0009649245,0.0008099477,0.001553955,0.001393447,0.003251252,0.00117671,0.001199932,0.002481037],"category_scores_gemma":[0.007472319,0.0005206413,0.0007828436,0.001794434,0.002643763,0.008748216,0.003453505,0.001428953,0.0009179775],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001923883,"about_ca_system_score_gemma":0.001669709,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002129173,"about_ca_topic_score_gemma":0.001481473,"domain_scores_codex":[0.9960146,0.001556448,0.0002867691,0.0005447452,0.001177177,0.0004203155],"domain_scores_gemma":[0.9925171,0.003097421,0.0009735367,0.002503135,0.0006226524,0.0002860372],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004720939,0.000114168,0.000808371,0.0002493906,0.00007781731,0.000375637,0.0007232694,0.1706148,0.01442145,0.7019685,0.005579649,0.1045948],"study_design_scores_gemma":[0.0001258814,0.0001717162,0.0002718776,0.00005108633,0.00005653819,0.0002613611,0.0002137592,0.4080753,0.01143044,0.5556073,0.02366429,0.00007042978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0238481,0.0003905004,0.9680046,0.0006130355,0.00007385331,0.0001927289,0.0001318875,0.001832238,0.004912971],"genre_scores_gemma":[0.7188197,0.001055373,0.2743408,0.0003372079,0.000147397,0.0004876165,0.0004555426,0.0002953947,0.004060999],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003251252,"threshold_uncertainty_score":0.01395887,"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","authors":[{"name":"Jang-Won Lee","is_ca":false},{"name":"Ravi R. Mazumdar","is_ca":true},{"name":"Ness B. Shroff","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003075732,0.001132552,0.001223083,0.0006629185,0.000621461,0.001996602,0.001350058,0.001236628,0.002097073],"category_scores_gemma":[0.007421045,0.000521037,0.0006123226,0.001027757,0.001752309,0.002434063,0.00105968,0.001621086,0.0002910657],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00223209,"about_ca_system_score_gemma":0.001079731,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004518956,"about_ca_topic_score_gemma":0.002398143,"domain_scores_codex":[0.9984198,0.0008616549,0.00004236696,0.0002144966,0.0002660574,0.0001957467],"domain_scores_gemma":[0.9973804,0.001958986,0.0002481207,0.0001063678,0.0001951056,0.0001109437],"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.00007007458,0.00005018121,0.0002642613,0.00005291651,0.00001943219,0.00009107099,0.00005963987,0.9076252,0.0009733142,0.07603087,0.0007643093,0.01399871],"study_design_scores_gemma":[0.000008038001,0.000009376114,0.00005515728,0.000002741197,0.000002344458,0.00001045388,0.00000853036,0.9850091,0.0001546998,0.01450699,0.0002292434,0.000003385343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03277287,0.0008867844,0.9600007,0.0008042809,0.00006991903,0.0000525366,0.00003174786,0.00007951946,0.005301692],"genre_scores_gemma":[0.9038283,0.001306702,0.08667465,0.0001932218,0.0001856421,0.0001645721,0.00005541771,0.0001034712,0.007488059],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004518956,"threshold_uncertainty_score":0.01626623,"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","authors":[{"name":"Yongmin Zhang","is_ca":false},{"name":"Xiaolong Lan","is_ca":false},{"name":"Ju Ren","is_ca":false},{"name":"Lin Cai","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008196778,0.0005668584,0.0006226704,0.0004263985,0.001080591,0.001188089,0.001346551,0.0005228442,0.0018376],"category_scores_gemma":[0.001542058,0.0002256062,0.0003486905,0.0008513093,0.0006050337,0.001574225,0.001301193,0.0005349324,0.0002981778],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001939668,"about_ca_system_score_gemma":0.001567259,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005029273,"about_ca_topic_score_gemma":0.007738906,"domain_scores_codex":[0.999195,0.0002163204,0.00002762524,0.0001273345,0.0002338687,0.0001998835],"domain_scores_gemma":[0.999685,0.0001113587,0.00003812351,0.00006800265,0.00006799267,0.0000294022],"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.0001924049,0.0000928146,0.0006301463,0.00009691211,0.0000449691,0.0002597121,0.0001107995,0.6909346,0.007376177,0.2054446,0.005616216,0.08920064],"study_design_scores_gemma":[0.000005828792,0.00001736156,0.0001315757,0.000005055794,0.000005602918,0.00003734148,0.00002542139,0.9745714,0.0007016424,0.02230504,0.002188552,0.000005209034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04707702,0.0009813373,0.9397953,0.0005223502,0.00008904779,0.000141873,0.00009828887,0.0001913215,0.01110348],"genre_scores_gemma":[0.9102332,0.0005502779,0.08573716,0.0001012323,0.00004942974,0.00009844763,0.00008372291,0.00003701163,0.003109448],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005029273,"threshold_uncertainty_score":0.01407337,"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","authors":[{"name":"Jérôme François","is_ca":true},{"name":"Issam Aib","is_ca":true},{"name":"Raouf Boutaba","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001537489,0.0008483855,0.0006753291,0.002299213,0.0007402615,0.0008214058,0.002234892,0.001161409,0.001923396],"category_scores_gemma":[0.003772643,0.0002914356,0.00033803,0.0009232857,0.0006742126,0.002179289,0.002673737,0.0007262218,0.0007982978],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008235756,"about_ca_system_score_gemma":0.0009443482,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002755829,"about_ca_topic_score_gemma":0.003142525,"domain_scores_codex":[0.9992736,0.0001671384,0.00002942729,0.0001673312,0.0002543918,0.0001080741],"domain_scores_gemma":[0.9979987,0.0006164756,0.000296715,0.0005825586,0.0002742438,0.0002312917],"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.003289053,0.001192379,0.02092408,0.000464698,0.0003064646,0.0009613003,0.000481478,0.2068605,0.04800263,0.01655566,0.05394785,0.6470138],"study_design_scores_gemma":[0.000229814,0.0004639145,0.004282928,0.0000278681,0.00006133779,0.0005939036,0.00009069513,0.9506965,0.01732481,0.004990477,0.02117925,0.00005865057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1765529,0.001265073,0.7646034,0.0006885191,0.0002379751,0.0009281903,0.001587301,0.04413327,0.0100033],"genre_scores_gemma":[0.735772,0.000316641,0.2574082,0.0002046586,0.00007075714,0.0002985174,0.002241469,0.0003021968,0.00338554],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002755829,"threshold_uncertainty_score":0.008131087,"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","authors":[{"name":"Petar Djukic","is_ca":true},{"name":"Shahrokh Valaee","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007439148,0.0004858928,0.0003558865,0.0005642314,0.000593354,0.0007368518,0.0008612124,0.0003597812,0.002017966],"category_scores_gemma":[0.002531227,0.0002911812,0.0003055487,0.0009226428,0.0003520829,0.0007647499,0.0004402154,0.0006978745,0.0004020538],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001188742,"about_ca_system_score_gemma":0.001570611,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002572084,"about_ca_topic_score_gemma":0.003699998,"domain_scores_codex":[0.9996124,0.0001243243,0.00002550135,0.00005409336,0.0001530185,0.00003070218],"domain_scores_gemma":[0.9993418,0.0003925544,0.00006629863,0.0000781241,0.00009356144,0.00002768811],"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.0001780628,0.00009572225,0.0006967951,0.0003894954,0.00004979074,0.00008977998,0.0001292016,0.573741,0.01267065,0.06343639,0.004293219,0.3442299],"study_design_scores_gemma":[0.00003764864,0.00009290433,0.0002051683,0.00002451732,0.00001854012,0.00005655147,0.00002917104,0.9546719,0.004191556,0.02975512,0.01090337,0.00001350168],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0100238,0.001944799,0.9834104,0.0001854981,0.0001602755,0.0001133947,0.00009710673,0.0004261321,0.003638634],"genre_scores_gemma":[0.295294,0.002807876,0.6968279,0.0001005345,0.0001722287,0.0002866166,0.0003447497,0.0001602376,0.004005766],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002572084,"threshold_uncertainty_score":0.008624971,"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","authors":[{"name":"Prashanth Hande","is_ca":false},{"name":"Shengyu Zhang","is_ca":false},{"name":"Mung Chiang","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002640704,0.0005300539,0.0009485097,0.0005617319,0.0005475354,0.00146698,0.00187588,0.0008359844,0.001998711],"category_scores_gemma":[0.007147789,0.0004411757,0.0004955244,0.0006767426,0.001454287,0.002038176,0.001797255,0.001444521,0.0004041737],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001443316,"about_ca_system_score_gemma":0.001225239,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001194547,"about_ca_topic_score_gemma":0.0009010521,"domain_scores_codex":[0.9981924,0.0005835302,0.0000874695,0.0004015108,0.0005332553,0.0002019629],"domain_scores_gemma":[0.9978573,0.0009876515,0.000217937,0.000454104,0.0003971858,0.00008584168],"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.0001018515,0.0000819737,0.0003233705,0.00004696238,0.00002014348,0.0000765799,0.0001214297,0.7570593,0.003949546,0.1821008,0.00116463,0.05495337],"study_design_scores_gemma":[0.00001524003,0.00001817166,0.0000418889,0.000003228206,0.000003407819,0.00002560041,0.00001070984,0.9653159,0.0008339509,0.03304097,0.0006854821,0.000005456159],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01281369,0.00009893241,0.9846631,0.0001037406,0.00002311691,0.00002694006,0.000009384574,0.0001256213,0.002135484],"genre_scores_gemma":[0.7865798,0.000226339,0.2086766,0.0001094177,0.00005951417,0.0001238113,0.00005484616,0.00009107931,0.004078582],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002640704,"threshold_uncertainty_score":0.01396555,"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","authors":[{"name":"Liang Song","is_ca":true},{"name":"Dimitrios Hatzinakos","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004738091,0.0003986132,0.0001386814,0.000278448,0.0003337112,0.0009872335,0.001032204,0.0004436983,0.002359611],"category_scores_gemma":[0.000561139,0.0002362809,0.0002513037,0.0002966653,0.0002894025,0.001240763,0.0007079381,0.0006894239,0.000854688],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003273408,"about_ca_system_score_gemma":0.0004382392,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007159605,"about_ca_topic_score_gemma":0.00162678,"domain_scores_codex":[0.9997743,0.00005561997,0.00001856833,0.00003240885,0.0001003222,0.0000188057],"domain_scores_gemma":[0.9998091,0.000033298,0.00001976498,0.00004661095,0.00007240889,0.00001871929],"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.0002284747,0.000179183,0.002030266,0.0005604513,0.0001634843,0.0006248069,0.0005516011,0.1726604,0.1531312,0.2290332,0.01892636,0.4219107],"study_design_scores_gemma":[0.00002834379,0.0003408533,0.001111642,0.00006971776,0.00009023336,0.0005411359,0.0001118701,0.779396,0.05104968,0.03312797,0.1340859,0.00004659537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01782813,0.001314324,0.9619779,0.0006919188,0.0002570245,0.0001168183,0.00006543235,0.001922893,0.01582557],"genre_scores_gemma":[0.3958372,0.002523364,0.5753881,0.0006332605,0.0002234916,0.0003024161,0.0004768381,0.0001960138,0.02441934],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002359611,"threshold_uncertainty_score":0.007893622,"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","authors":[{"name":"Vijay Kumar Adhikari","is_ca":false},{"name":"Yang Guo","is_ca":false},{"name":"Hao Fang","is_ca":false},{"name":"Volker Hilt","is_ca":false},{"name":"Zhi-Li Zhang","is_ca":false},{"name":"Matteo Varvello","is_ca":false},{"name":"Moritz Steiner","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001452616,0.000552361,0.0002707805,0.001355463,0.0007186431,0.0007812738,0.0009435302,0.0005592363,0.0004983463],"category_scores_gemma":[0.00444183,0.0001582485,0.0001248301,0.001505343,0.0004895747,0.001696757,0.000646142,0.0008004565,0.0001647272],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002315685,"about_ca_system_score_gemma":0.0006041396,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02261033,"about_ca_topic_score_gemma":0.01501948,"domain_scores_codex":[0.9987864,0.0002395497,0.0000702072,0.0002657348,0.0004405271,0.0001975356],"domain_scores_gemma":[0.9968562,0.0008579098,0.0003793099,0.0002956915,0.001244312,0.0003665772],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.002101755,0.002234908,0.5021325,0.0004394284,0.0002972678,0.00205714,0.003947339,0.08275134,0.104957,0.01367095,0.01303335,0.272377],"study_design_scores_gemma":[0.0001163525,0.001851346,0.4302394,0.0000734596,0.0001410835,0.001119556,0.003397868,0.484324,0.06589048,0.001590354,0.011114,0.0001421135],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9910546,0.00007813164,0.004533556,0.0001618146,0.00001311822,0.0000909016,0.0003318197,0.0003911257,0.003345004],"genre_scores_gemma":[0.9967907,0.0000290382,0.002394399,0.00003707365,0.000005010368,0.00002960907,0.0003583603,0.000008280806,0.0003475476],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02261033,"threshold_uncertainty_score":0.04495746,"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","authors":[{"name":"Dong Yang","is_ca":false},{"name":"Zongrong Cheng","is_ca":false},{"name":"Weiting Zhang","is_ca":false},{"name":"Hongke Zhang","is_ca":false},{"name":"Xuemin Shen","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001713465,0.0007420286,0.0007924337,0.0005929752,0.0005646629,0.0007502478,0.001396078,0.0005092958,0.0006084429],"category_scores_gemma":[0.002584223,0.0003553371,0.0005333173,0.0007054604,0.0005441518,0.001118808,0.0008275865,0.000891777,0.00008488329],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001314489,"about_ca_system_score_gemma":0.002093711,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006991202,"about_ca_topic_score_gemma":0.004983648,"domain_scores_codex":[0.9991205,0.0002281796,0.00005729067,0.0001783974,0.0002415033,0.0001740034],"domain_scores_gemma":[0.9989297,0.0004733943,0.0001649273,0.00009961231,0.0002227318,0.0001096419],"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.0001646056,0.00007013941,0.0005436979,0.000085691,0.00003088294,0.0001002519,0.0001228531,0.9323431,0.009374335,0.01690405,0.0008903969,0.03936999],"study_design_scores_gemma":[0.000007242458,0.00002800536,0.00004404512,0.000002867415,0.000003824432,0.00001205731,0.00000543747,0.9974251,0.0004981413,0.001740492,0.0002283529,0.000004555476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02718337,0.0003763268,0.9711635,0.0001046448,0.00006902135,0.00005845572,0.00003831628,0.0002249363,0.0007814955],"genre_scores_gemma":[0.8573471,0.0003628785,0.1411079,0.0001455476,0.00006742524,0.0001055667,0.00008200397,0.00005051776,0.000731058],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006991202,"threshold_uncertainty_score":0.01390105,"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","authors":[{"name":"Weiguang Shi","is_ca":true},{"name":"M.H. MacGregor","is_ca":true},{"name":"Paweł Gburzyński","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001406583,0.000600926,0.0005879071,0.0009033238,0.001449057,0.001117416,0.00120616,0.0005830689,0.003084418],"category_scores_gemma":[0.005564358,0.0002687889,0.0003115756,0.0008290131,0.0006525145,0.001753875,0.00120423,0.0004902063,0.0006982174],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001390198,"about_ca_system_score_gemma":0.001169874,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001374176,"about_ca_topic_score_gemma":0.001442568,"domain_scores_codex":[0.9990165,0.000153997,0.00005845634,0.0001811115,0.0004512207,0.0001386576],"domain_scores_gemma":[0.9976403,0.0008121562,0.0002734231,0.0006115723,0.0005625515,0.0001000493],"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.0007775638,0.0004216714,0.005211557,0.0002413259,0.00007674074,0.0002530174,0.0004048666,0.3435819,0.09330042,0.07891842,0.007833646,0.4689789],"study_design_scores_gemma":[0.00003322262,0.00009073696,0.0006110804,0.000008564001,0.00001813134,0.000142655,0.00005001513,0.9459029,0.01312125,0.03536031,0.004645813,0.00001539033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1662585,0.0004710778,0.81888,0.0003884869,0.0001802293,0.0002592973,0.0001121186,0.002451184,0.01099905],"genre_scores_gemma":[0.8755483,0.0002045924,0.1203447,0.0001107813,0.0001680162,0.0001715574,0.0001618527,0.0001670351,0.003123154],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003084418,"threshold_uncertainty_score":0.0103184,"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","authors":[{"name":"Zhenhua Han","is_ca":false},{"name":"Haisheng Tan","is_ca":false},{"name":"Xiang‐Yang Li","is_ca":false},{"name":"Shaofeng H.-C. Jiang","is_ca":false},{"name":"Yupeng Li","is_ca":true},{"name":"Francis C. M. Lau","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001829971,0.00116439,0.001345343,0.0005587848,0.00141338,0.001270843,0.003223468,0.0009659174,0.001681855],"category_scores_gemma":[0.003215362,0.0005456128,0.0006303287,0.001230717,0.0008976014,0.0015485,0.002070189,0.001286503,0.0004280744],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001827945,"about_ca_system_score_gemma":0.003729409,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01146252,"about_ca_topic_score_gemma":0.009062422,"domain_scores_codex":[0.9986607,0.0002420757,0.00007637049,0.0002291866,0.0003688969,0.0004226595],"domain_scores_gemma":[0.9982566,0.0006550816,0.0001733738,0.0002837229,0.0002977116,0.0003334539],"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.0005738724,0.0002928621,0.001035974,0.0001792721,0.00004234913,0.0001915599,0.0001256628,0.8913292,0.007625712,0.01672915,0.006295816,0.0755787],"study_design_scores_gemma":[0.00002012411,0.00002976375,0.00008576299,0.000003749576,0.000004391946,0.00002141244,0.00001981249,0.9939067,0.00117487,0.003868058,0.0008594705,0.000005997871],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07020961,0.0007152609,0.91979,0.0004583665,0.0003201122,0.0003042205,0.0002484058,0.001884472,0.006069542],"genre_scores_gemma":[0.7227024,0.0004278887,0.2713866,0.000366651,0.000137053,0.000181031,0.0004248136,0.0002835872,0.004089997],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01146252,"threshold_uncertainty_score":0.02279156,"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","authors":[{"name":"Nicolas Huin","is_ca":false},{"name":"Brigitte Jaumard","is_ca":true},{"name":"Frédéric Giroire","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00128721,0.001324684,0.001543306,0.0007489788,0.001100956,0.001592456,0.001088531,0.001647167,0.005832217],"category_scores_gemma":[0.005761792,0.0009801193,0.0007853509,0.00104305,0.0009790405,0.002279432,0.001316502,0.001243888,0.0005903592],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002557993,"about_ca_system_score_gemma":0.002976787,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008994783,"about_ca_topic_score_gemma":0.00780161,"domain_scores_codex":[0.9988651,0.0003846447,0.00004427181,0.0002187826,0.0002017155,0.0002854865],"domain_scores_gemma":[0.997708,0.001438134,0.0002169541,0.0001775187,0.0002621963,0.0001971962],"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.00004146361,0.00002079072,0.0001652442,0.0000477297,0.000008730805,0.00002774292,0.00001864134,0.9863724,0.0004619592,0.006215075,0.0008358356,0.005784325],"study_design_scores_gemma":[0.000005531417,0.00001223068,0.0000391052,0.000003402524,0.000002787981,0.00000806143,0.00001656311,0.9957793,0.000135085,0.003693974,0.0003013949,0.000002551906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09413283,0.0009796992,0.8873915,0.0009066187,0.0001655808,0.0002366693,0.000427321,0.0004993793,0.01526028],"genre_scores_gemma":[0.7878435,0.0007004541,0.2054296,0.0001739393,0.00005442803,0.0002199524,0.0004430417,0.0001667149,0.004968435],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008994783,"threshold_uncertainty_score":0.01951075,"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","authors":[{"name":"Abdallah Jarray","is_ca":true},{"name":"Ahmed Karmouch","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001204691,0.001448659,0.001013904,0.0008649329,0.0005068516,0.001300773,0.001518813,0.0009174682,0.005068011],"category_scores_gemma":[0.00281844,0.0006494428,0.001049104,0.00123832,0.0007707333,0.00189837,0.001742916,0.001548749,0.0007165761],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001106765,"about_ca_system_score_gemma":0.001034169,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002030503,"about_ca_topic_score_gemma":0.002155001,"domain_scores_codex":[0.9991766,0.0003787471,0.00003074146,0.0001238752,0.0001739971,0.0001160658],"domain_scores_gemma":[0.9987457,0.0007580833,0.0001055902,0.000180747,0.0001323188,0.00007760951],"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.00005363002,0.00008708723,0.0001908234,0.0001415477,0.00003961594,0.00006776089,0.0000692067,0.8815945,0.002028421,0.05882118,0.002056203,0.05485],"study_design_scores_gemma":[0.000004154481,0.00002018804,0.00002562923,0.00000695685,0.000004992333,0.00001971883,0.00001290529,0.9812179,0.000296974,0.01769432,0.000692338,0.000004049451],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002992948,0.0001626295,0.9945889,0.00005913521,0.00002309014,0.00003413191,0.0000318368,0.0001056137,0.002001724],"genre_scores_gemma":[0.2922329,0.0007232344,0.7011955,0.0001257026,0.00006950224,0.00032393,0.0003030788,0.0002157001,0.004810445],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005068011,"threshold_uncertainty_score":0.01695418,"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","authors":[{"name":"Xiaoxi Zhang","is_ca":false},{"name":"Zhiyi Huang","is_ca":false},{"name":"Chuan Wu","is_ca":false},{"name":"Zongpeng Li","is_ca":true},{"name":"Francis C. M. Lau","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006684779,0.001653298,0.002085738,0.0008697664,0.001406954,0.005669024,0.003061371,0.001832103,0.003166171],"category_scores_gemma":[0.02132913,0.0009082954,0.001367988,0.001728252,0.003296302,0.006846578,0.002335496,0.004124517,0.0005101845],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003696768,"about_ca_system_score_gemma":0.004319747,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002241435,"about_ca_topic_score_gemma":0.001391632,"domain_scores_codex":[0.9943894,0.003163324,0.0001668675,0.0005419277,0.001054442,0.0006840463],"domain_scores_gemma":[0.9890668,0.007636077,0.0008453479,0.001164955,0.0008269855,0.0004597456],"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.0002235283,0.0002620408,0.0006446488,0.0001500494,0.00005458487,0.0001771982,0.0001828034,0.5969896,0.002236496,0.3700564,0.001854553,0.02716806],"study_design_scores_gemma":[0.00002269905,0.00003707143,0.000092863,0.00001405592,0.00001089608,0.00005004817,0.00005070133,0.8724281,0.0006830865,0.1258978,0.0007005534,0.00001214956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03813371,0.0004501774,0.9486853,0.0007399537,0.00007325251,0.0001862809,0.00009186014,0.0002040534,0.01143541],"genre_scores_gemma":[0.8681244,0.0005673068,0.1258953,0.0001698634,0.0001109861,0.0003302411,0.0000826246,0.0001487705,0.004570608],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006684779,"threshold_uncertainty_score":0.03535295,"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","authors":[{"name":"Sarhad Arisdakessian","is_ca":false},{"name":"Omar Abdel Wahab","is_ca":true},{"name":"Azzam Mourad","is_ca":false},{"name":"Hadi Otrok","is_ca":false},{"name":"Nadjia Kara","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001327943,0.001113141,0.001223078,0.0006824073,0.0007758111,0.001406384,0.001933705,0.001146129,0.002406785],"category_scores_gemma":[0.00138139,0.0004824221,0.001301923,0.0006789662,0.0008587292,0.001215214,0.001417715,0.001084342,0.0002378973],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001564921,"about_ca_system_score_gemma":0.002323177,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006929944,"about_ca_topic_score_gemma":0.006583213,"domain_scores_codex":[0.9991999,0.0003411452,0.00003107076,0.0001175041,0.0001677259,0.0001425964],"domain_scores_gemma":[0.9994769,0.0002661177,0.00006025015,0.00002629038,0.00008331721,0.00008719994],"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.0000769938,0.00009943083,0.0004229816,0.00008366985,0.00009763775,0.00014974,0.00009176959,0.9184474,0.001918255,0.05384981,0.001650687,0.02311167],"study_design_scores_gemma":[0.00001075599,0.00002882422,0.00004922895,0.000005155605,0.00001010937,0.00001854361,0.00001692821,0.9888461,0.0001806727,0.01011985,0.0007067475,0.000007114837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007790547,0.0001346899,0.9875809,0.0001596438,0.00006145141,0.0001089034,0.0000396,0.0001044556,0.00401987],"genre_scores_gemma":[0.6846516,0.0003684749,0.3096501,0.0002706674,0.00008106382,0.0003026103,0.00009618584,0.00007433027,0.004505008],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006929944,"threshold_uncertainty_score":0.01377922,"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","authors":[{"name":"Kaiming Shen","is_ca":true},{"name":"Wei Yu","is_ca":true},{"name":"Licheng Zhao","is_ca":false},{"name":"Daniel P. Palomar","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001095113,0.00125091,0.00095926,0.0003935418,0.0003884438,0.0009727256,0.0007170847,0.0007344119,0.001854157],"category_scores_gemma":[0.001865578,0.0004341131,0.0005344863,0.00066977,0.0007930539,0.0008007704,0.0009663339,0.0009392218,0.000258707],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001008389,"about_ca_system_score_gemma":0.001056982,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002374063,"about_ca_topic_score_gemma":0.001758451,"domain_scores_codex":[0.9995491,0.0002076162,0.00001239011,0.00006995794,0.00009383734,0.00006707582],"domain_scores_gemma":[0.9992453,0.0005217665,0.00007031439,0.00003514229,0.00009282908,0.00003480164],"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.00002971408,0.00001784596,0.0001272167,0.00003910079,0.00001471586,0.00003836065,0.00002312057,0.9714964,0.001061383,0.01636579,0.000724763,0.0100616],"study_design_scores_gemma":[0.000003001165,0.00001738135,0.00002326064,0.000002472819,0.000002485689,0.000007825965,0.000006260062,0.994853,0.0001965704,0.004497937,0.0003877152,0.000002211071],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007424328,0.0002167916,0.9888514,0.0001941313,0.00003369103,0.00002454071,0.00003289376,0.00007486426,0.003147441],"genre_scores_gemma":[0.7092581,0.0008030353,0.281912,0.000327829,0.0001308783,0.0002552961,0.0001304658,0.0001404339,0.007042018],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002374063,"threshold_uncertainty_score":0.007316411,"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","authors":[{"name":"Peter Marbach","is_ca":true},{"name":"Ying Qiu","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002908946,0.000958123,0.00114283,0.001032433,0.001168576,0.002367816,0.002536839,0.002580292,0.003301211],"category_scores_gemma":[0.005428179,0.0005151397,0.0009635574,0.001390544,0.002721077,0.004220168,0.001719497,0.001598596,0.0003775733],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001680931,"about_ca_system_score_gemma":0.00145828,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002335098,"about_ca_topic_score_gemma":0.002300818,"domain_scores_codex":[0.9982225,0.001140013,0.00003655441,0.0001287253,0.0003278762,0.0001443369],"domain_scores_gemma":[0.9975189,0.001730748,0.0001935866,0.00009921507,0.0003213391,0.0001362591],"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.00003225234,0.00007569374,0.0002463977,0.0001067285,0.00005044829,0.0002311561,0.000111912,0.5809804,0.0008346859,0.4086552,0.001200454,0.007474691],"study_design_scores_gemma":[0.00002292433,0.00003991015,0.00005618334,0.00001234074,0.00001031545,0.00004367708,0.00003930077,0.8993962,0.0001230241,0.09910005,0.0011441,0.00001196742],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02910784,0.002586329,0.9439325,0.002146512,0.0002102731,0.0002109974,0.00005734747,0.00007449082,0.02167375],"genre_scores_gemma":[0.8734734,0.003644444,0.1107854,0.0003930804,0.0006328144,0.0005115449,0.00004803477,0.00006284178,0.01044839],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003301211,"threshold_uncertainty_score":0.01538414,"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","authors":[{"name":"Peter Marbach","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004020841,0.001232271,0.001131628,0.0006564335,0.001644144,0.003685366,0.002239025,0.001699678,0.005235863],"category_scores_gemma":[0.01070283,0.0006449159,0.0006695578,0.001163983,0.002690333,0.005683972,0.001692371,0.002111936,0.0006631764],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002999391,"about_ca_system_score_gemma":0.003100472,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003887518,"about_ca_topic_score_gemma":0.001864918,"domain_scores_codex":[0.9963315,0.001313969,0.00009708948,0.0005057552,0.0009706675,0.0007810251],"domain_scores_gemma":[0.9952531,0.00305012,0.0005179893,0.0002703518,0.0005261974,0.0003822751],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002223474,0.00007413534,0.0004311509,0.00009630751,0.00003144955,0.0001677273,0.0002676816,0.08751976,0.001373281,0.897642,0.002044631,0.01012958],"study_design_scores_gemma":[0.00007585231,0.00009644776,0.0002233533,0.00002684707,0.00003330502,0.0002037904,0.0001027096,0.4418154,0.0008042018,0.5487029,0.007890996,0.0000241887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07331382,0.00210954,0.8706701,0.002664037,0.0004665939,0.000110591,0.0001409444,0.0002279578,0.05029632],"genre_scores_gemma":[0.9340519,0.001289134,0.04866744,0.0004182617,0.0007947644,0.0001323424,0.00006413138,0.00009066324,0.01449139],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005235863,"threshold_uncertainty_score":0.02176225,"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","authors":[{"name":"Shuihai Hu","is_ca":false},{"name":"Kai Chen","is_ca":false},{"name":"Haitao Wu","is_ca":false},{"name":"Wei Bai","is_ca":false},{"name":"Chang Lan","is_ca":false},{"name":"Hao Wang","is_ca":true},{"name":"Hongze Zhao","is_ca":false},{"name":"Chuanxiong Guo","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001354622,0.000415406,0.0002368307,0.0004921284,0.0003749393,0.001360887,0.002281478,0.0003830728,0.002763183],"category_scores_gemma":[0.002345593,0.0003935493,0.0001812189,0.0009537398,0.0007064574,0.001523413,0.0009762713,0.0008611411,0.0004158286],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001056498,"about_ca_system_score_gemma":0.0009632357,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001832891,"about_ca_topic_score_gemma":0.001547877,"domain_scores_codex":[0.9990597,0.0001781101,0.00005742661,0.0001461527,0.0004470856,0.0001114834],"domain_scores_gemma":[0.9988456,0.0002559249,0.0001321322,0.0003709982,0.000309915,0.00008540042],"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.0008987694,0.0004341695,0.007072673,0.0006893049,0.00008724419,0.0005192668,0.000580179,0.2998956,0.06872138,0.116135,0.01536905,0.4895974],"study_design_scores_gemma":[0.0001051759,0.0006091569,0.001305822,0.00005626212,0.00005533674,0.0003846588,0.0001375049,0.8743836,0.06200785,0.02106995,0.03983453,0.00005017226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06610215,0.00070156,0.9189522,0.0003403508,0.0001000732,0.0003471818,0.0001109551,0.004658552,0.008686969],"genre_scores_gemma":[0.6545174,0.0007092478,0.3392682,0.000174624,0.00005160561,0.0001853964,0.0002244277,0.0003022814,0.00456695],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002763183,"threshold_uncertainty_score":0.009243786,"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","authors":[{"name":"Yong Cui","is_ca":false},{"name":"Jian Song","is_ca":false},{"name":"Kui Ren","is_ca":false},{"name":"Minming Li","is_ca":false},{"name":"Zongpeng Li","is_ca":true},{"name":"Qingmei Ren","is_ca":false},{"name":"Yangjun Zhang","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005831365,0.0005919992,0.000553678,0.0002419997,0.0006283195,0.0006605932,0.001006874,0.0005042944,0.0009961516],"category_scores_gemma":[0.001320414,0.0002184584,0.0004486504,0.0003868103,0.0005261613,0.0007893664,0.0009540901,0.0006634997,0.0001854931],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009105947,"about_ca_system_score_gemma":0.001121342,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003245673,"about_ca_topic_score_gemma":0.005178364,"domain_scores_codex":[0.9994868,0.0001081678,0.00001520219,0.0001010952,0.0001306845,0.0001579483],"domain_scores_gemma":[0.9994135,0.0002254439,0.00007283289,0.000126928,0.00009658695,0.00006475717],"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.000211266,0.0002090657,0.0008741753,0.00007155748,0.00002423136,0.000201797,0.00009929751,0.8871279,0.02245366,0.03094659,0.002382447,0.05539805],"study_design_scores_gemma":[0.000004248643,0.00002441819,0.00005648177,0.000001269354,0.000001824043,0.00001269475,0.000006413577,0.9962542,0.000807418,0.002544594,0.0002841495,0.00000223873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07150532,0.0001696742,0.9231557,0.0002074982,0.00008133792,0.00007989992,0.00003611452,0.0004381481,0.004326314],"genre_scores_gemma":[0.9507289,0.00007219366,0.04780713,0.00006659341,0.00002170723,0.00005527873,0.0000356679,0.00003344413,0.001179131],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003245673,"threshold_uncertainty_score":0.006606877,"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","authors":[{"name":"Reza Abdolee","is_ca":true},{"name":"Benoı̂t Champagne","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001559687,0.0008872004,0.000755618,0.0004671748,0.0003543402,0.0007012747,0.000851611,0.001116411,0.0005786805],"category_scores_gemma":[0.00789592,0.0003713686,0.0002739308,0.0005977964,0.0008339878,0.001423547,0.0008773612,0.0006425842,0.0001660652],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007890764,"about_ca_system_score_gemma":0.0005084933,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002119827,"about_ca_topic_score_gemma":0.00129417,"domain_scores_codex":[0.9993427,0.000277307,0.00003795754,0.000122198,0.0001734215,0.00004631597],"domain_scores_gemma":[0.9962515,0.002954104,0.0002912082,0.0001323412,0.0003321709,0.00003868816],"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.00009830853,0.00003011322,0.0005136763,0.0001103839,0.00003264995,0.00009953768,0.0001187987,0.9390218,0.007274506,0.01534663,0.0004185768,0.03693509],"study_design_scores_gemma":[0.00001035328,0.000025813,0.00006429512,0.000004129733,0.000003812814,0.00001180786,0.000007005866,0.9948808,0.001205339,0.003599393,0.0001823841,0.000004840009],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04151964,0.0008711832,0.9547209,0.0004434039,0.0000437409,0.00003332527,0.00002883946,0.0001819431,0.002157174],"genre_scores_gemma":[0.8883597,0.0009448254,0.1074721,0.0001467855,0.00007169483,0.0001232573,0.00004981553,0.00004065686,0.002791229],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002119827,"threshold_uncertainty_score":0.008248508,"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","authors":[{"name":"Duong Tung Nguyen","is_ca":true},{"name":"Long Bao Le","is_ca":true},{"name":"Vijay K. Bhargava","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002220652,0.0008845112,0.00115263,0.0007777657,0.001357909,0.002546286,0.002917839,0.001668099,0.004816557],"category_scores_gemma":[0.002363076,0.000499199,0.001167708,0.001202762,0.002074805,0.003402005,0.002083882,0.002232491,0.0004729556],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002717972,"about_ca_system_score_gemma":0.002878609,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004306771,"about_ca_topic_score_gemma":0.006177446,"domain_scores_codex":[0.9989197,0.0004080367,0.00003978925,0.0001828997,0.0002674754,0.000182105],"domain_scores_gemma":[0.9994121,0.0002772839,0.00005335679,0.00005882881,0.0001173498,0.00008113577],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003845997,0.00006946105,0.0001361497,0.00008145221,0.00003076119,0.0001720906,0.0001209537,0.2929627,0.001580578,0.686657,0.002746697,0.01540366],"study_design_scores_gemma":[0.00001664822,0.0000260188,0.0000420588,0.00001102038,0.000008941421,0.00004557236,0.00003184942,0.8848557,0.000275195,0.111254,0.003419474,0.0000135415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003007686,0.0002106304,0.9912024,0.0003133064,0.00006369069,0.00007761196,0.00003111214,0.00007492854,0.005018691],"genre_scores_gemma":[0.5286312,0.0009589226,0.4584658,0.0003742994,0.0002309763,0.0004981909,0.00009146557,0.0001183795,0.01063068],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004816557,"threshold_uncertainty_score":0.01972038,"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","authors":[{"name":"Ahmad R. Dhaini","is_ca":false},{"name":"Pin‐Han Ho","is_ca":true},{"name":"Gangxiang Shen","is_ca":false},{"name":"Basem Shihada","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007831581,0.0002677974,0.0002843316,0.0003327984,0.0002931913,0.0006362789,0.0007852352,0.0003058081,0.0006136096],"category_scores_gemma":[0.001156941,0.0001471429,0.0001684872,0.0003548578,0.0002976175,0.0008523575,0.0003427,0.0003065518,0.0001339023],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009313049,"about_ca_system_score_gemma":0.0008664663,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002678995,"about_ca_topic_score_gemma":0.003272174,"domain_scores_codex":[0.9995794,0.00009894009,0.00001738795,0.00005764353,0.0001759618,0.00007064606],"domain_scores_gemma":[0.9996013,0.0002055242,0.00003644349,0.00005376699,0.00008684536,0.00001614055],"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.0008734685,0.0003114481,0.004482643,0.0001335577,0.00005988585,0.0001478888,0.0001259443,0.6306421,0.06307864,0.03966638,0.001693852,0.2587842],"study_design_scores_gemma":[0.00001401127,0.00009107281,0.0005732205,0.000005180176,0.00001261141,0.00003007852,0.00002777455,0.9786552,0.01294413,0.006206248,0.001433136,0.000007285419],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3270821,0.003048917,0.6575981,0.0004684315,0.0001123159,0.00005699341,0.00005434901,0.0007476187,0.01083114],"genre_scores_gemma":[0.9623207,0.0002653436,0.03606259,0.00004589921,0.00001229943,0.00002101924,0.00002263447,0.00002461874,0.001224926],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002678995,"threshold_uncertainty_score":0.00675714,"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","authors":[{"name":"Y. d’Halluin","is_ca":true},{"name":"Peter Forsyth","is_ca":true},{"name":"K.R. Vetzal","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003493289,0.001177882,0.001204347,0.000948568,0.001172015,0.003365566,0.001515599,0.002349793,0.002699889],"category_scores_gemma":[0.01258449,0.0008458638,0.0007080184,0.001291486,0.001590232,0.005289449,0.001955434,0.002163615,0.0001990838],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003299462,"about_ca_system_score_gemma":0.002101311,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006670103,"about_ca_topic_score_gemma":0.004455673,"domain_scores_codex":[0.9982094,0.0007331824,0.0000759367,0.0002368931,0.0003460502,0.000398626],"domain_scores_gemma":[0.9940062,0.004580565,0.0006750499,0.0001319758,0.0002921078,0.0003141516],"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.00004107658,0.00001411522,0.0003237428,0.0000394486,0.00002651016,0.0001061474,0.00006139879,0.9596298,0.0003451392,0.03437882,0.0004746153,0.004559225],"study_design_scores_gemma":[0.00001342519,0.00002608657,0.000194272,0.00001524081,0.00001403373,0.00003155335,0.00006273643,0.9280779,0.0003058336,0.07061733,0.0006216237,0.00001991945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1951538,0.002519751,0.7821448,0.003719361,0.0001410317,0.0001779122,0.0003830423,0.0002905397,0.0154697],"genre_scores_gemma":[0.9806917,0.0009080208,0.01626432,0.0000790466,0.00009139585,0.0001070892,0.00009151246,0.00004580223,0.001721152],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006670103,"threshold_uncertainty_score":0.02393937,"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","authors":[{"name":"Rui Zhu","is_ca":true},{"name":"Bang Liu","is_ca":true},{"name":"Di Niu","is_ca":true},{"name":"Zongpeng Li","is_ca":true},{"name":"H. Vicky Zhao","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00114944,0.00168077,0.001017464,0.001020704,0.0005267303,0.0009171945,0.001334184,0.0007987033,0.001635265],"category_scores_gemma":[0.004927715,0.0005144929,0.0008657579,0.001372231,0.0006198667,0.002297059,0.001117975,0.002227612,0.0008094284],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007258229,"about_ca_system_score_gemma":0.001861569,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01178731,"about_ca_topic_score_gemma":0.008189576,"domain_scores_codex":[0.9990626,0.0002370928,0.00005367788,0.000230257,0.0002949469,0.0001213102],"domain_scores_gemma":[0.9979737,0.0007932422,0.0002647959,0.0002590181,0.0005820456,0.0001272212],"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.000219101,0.0001566358,0.001872238,0.0001573471,0.00008857076,0.0001484138,0.0001842656,0.7616718,0.01103129,0.010764,0.004594885,0.2091115],"study_design_scores_gemma":[0.000004005642,0.00002190366,0.0001568346,0.000003539865,0.000003845646,0.00002123956,0.00001756216,0.9952868,0.0009853718,0.003021244,0.000469036,0.000008579117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006488366,0.0001275389,0.9925658,0.00008845876,0.00002184859,0.00002658921,0.00007404256,0.0003257385,0.0002815893],"genre_scores_gemma":[0.3904859,0.0008332341,0.6031199,0.0001384703,0.0002289061,0.0002191008,0.0012383,0.0002596865,0.003476542],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01178731,"threshold_uncertainty_score":0.02343744,"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","authors":[{"name":"Jörg Liebeherr","is_ca":true},{"name":"Markus Fidler","is_ca":false},{"name":"Shahrokh Valaee","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002481552,0.001400958,0.001316587,0.001549423,0.0007915281,0.003051578,0.001984391,0.001430108,0.0041048],"category_scores_gemma":[0.007061578,0.0007021697,0.001462474,0.001425823,0.00237203,0.004700663,0.002225913,0.003512925,0.0008329168],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001937043,"about_ca_system_score_gemma":0.001599748,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003601108,"about_ca_topic_score_gemma":0.0017854,"domain_scores_codex":[0.9978568,0.0007368656,0.0001252517,0.0004483421,0.0006732758,0.0001595008],"domain_scores_gemma":[0.9971884,0.001924646,0.000220741,0.0002572448,0.0003554819,0.00005359415],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002183489,0.00003133448,0.0003823839,0.0001354638,0.00006383023,0.0001046224,0.0001614584,0.3656151,0.001059509,0.6093246,0.001308317,0.02179164],"study_design_scores_gemma":[0.000005993481,0.00002927762,0.0001053178,0.00002779343,0.00002096318,0.00005324344,0.00003854517,0.7122641,0.0006020222,0.2814927,0.005333141,0.0000269161],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.000599835,0.0002203254,0.9971465,0.0001988116,0.0000362842,0.00001045005,0.00002743421,0.00005019526,0.001710082],"genre_scores_gemma":[0.4851536,0.003710057,0.4969573,0.0007453928,0.001418829,0.000419808,0.000382855,0.0002486009,0.01096367],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0041048,"threshold_uncertainty_score":0.0140543,"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","authors":[{"name":"Jihong Yu","is_ca":true},{"name":"Wei Gong","is_ca":true},{"name":"Jiangchuan Liu","is_ca":true},{"name":"Lin Chen","is_ca":false},{"name":"Kehao Wang","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001476496,0.001041784,0.001933458,0.001221815,0.001059552,0.00172691,0.001870277,0.001384739,0.005259565],"category_scores_gemma":[0.00872948,0.0005955449,0.0009407524,0.003560318,0.0009104533,0.003590251,0.001871118,0.001417185,0.001652161],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001171099,"about_ca_system_score_gemma":0.00182319,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005408326,"about_ca_topic_score_gemma":0.004861317,"domain_scores_codex":[0.998587,0.0004329068,0.00008177611,0.0001847178,0.0004817147,0.0002318653],"domain_scores_gemma":[0.9938444,0.004864332,0.0002529452,0.000386949,0.0005139689,0.0001374235],"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.0002974092,0.00009297034,0.0008082609,0.0003331108,0.00005180375,0.0001893057,0.0002020024,0.8376934,0.002469916,0.05434466,0.01039816,0.09311896],"study_design_scores_gemma":[0.00001344221,0.00003636988,0.00008910082,0.0000134704,0.000008129538,0.00004577834,0.00002042556,0.9777575,0.000258762,0.02052439,0.001224758,0.000007852736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01731366,0.002457638,0.9729272,0.0004600614,0.0001159346,0.00009181641,0.0002750997,0.0005737344,0.005784935],"genre_scores_gemma":[0.5952371,0.003663105,0.3872826,0.0005932956,0.0003217138,0.000348779,0.001503838,0.0004105445,0.01063905],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005408326,"threshold_uncertainty_score":0.01759505,"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","authors":[{"name":"Hazem Gomaa","is_ca":true},{"name":"Geoffrey G. Messier","is_ca":true},{"name":"Carey Williamson","is_ca":true},{"name":"Robert J. Davies","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002900225,0.0008278121,0.001110018,0.002024271,0.000468523,0.001231664,0.001344128,0.001086749,0.00112212],"category_scores_gemma":[0.01603122,0.0006468118,0.0007095612,0.001513665,0.0007171435,0.002635707,0.0007591998,0.001098378,0.0004015614],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001547132,"about_ca_system_score_gemma":0.001211767,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009539532,"about_ca_topic_score_gemma":0.004413016,"domain_scores_codex":[0.9986518,0.0004459711,0.00008182471,0.0002542138,0.0003717117,0.0001945292],"domain_scores_gemma":[0.9885944,0.008607063,0.0009992239,0.0007082458,0.0009149731,0.0001760079],"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.0001134599,0.00005960094,0.008448909,0.0000547205,0.00005877638,0.0001263242,0.00006264081,0.9528158,0.00246983,0.01590397,0.0005541762,0.01933179],"study_design_scores_gemma":[0.000002755248,0.000008895883,0.0003610669,0.000003313249,0.00000554061,0.00002147523,0.000004164775,0.9969273,0.0003693693,0.002212227,0.0000768726,0.000006989188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1007335,0.0003697054,0.8960181,0.0001169034,0.00002202731,0.00008549928,0.0002567687,0.0008401948,0.001557334],"genre_scores_gemma":[0.9155977,0.0006021526,0.08205648,0.00006064984,0.00004110954,0.0001761682,0.0005611684,0.0000693354,0.0008352172],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009539532,"threshold_uncertainty_score":0.01896805,"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","authors":[{"name":"Shiva Raj Pokhrel","is_ca":false},{"name":"Carey Williamson","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006571735,0.0006139056,0.0005072878,0.0005230724,0.0006917782,0.001128509,0.0009958626,0.001213834,0.001299923],"category_scores_gemma":[0.002859388,0.0003528042,0.0005749905,0.0005678521,0.0007676328,0.002223436,0.0007621762,0.0008545944,0.0002091468],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001321287,"about_ca_system_score_gemma":0.001248757,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01241619,"about_ca_topic_score_gemma":0.006771473,"domain_scores_codex":[0.9996843,0.00006640591,0.0000154142,0.00007348173,0.0000876014,0.00007285935],"domain_scores_gemma":[0.9993072,0.0003515123,0.0001087917,0.00005785326,0.0001350856,0.00003959555],"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.00002053249,0.00002146388,0.0008320013,0.00001663265,0.000009351913,0.00008355891,0.0000528521,0.9701107,0.001063607,0.02287703,0.0003930788,0.004519218],"study_design_scores_gemma":[0.000001391332,0.000004984835,0.00007774626,0.000002060567,0.00000217352,0.00001299627,0.000004718349,0.9962077,0.00006842415,0.003388689,0.0002263893,0.000002677698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1433907,0.0007245279,0.8442529,0.0004778365,0.0001419597,0.0001127918,0.0002594727,0.0005308163,0.01010886],"genre_scores_gemma":[0.9688496,0.0006732938,0.02621394,0.00006078652,0.00007250349,0.0001569424,0.0001043072,0.00005227328,0.003816367],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01241619,"threshold_uncertainty_score":0.02468783,"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","authors":[{"name":"Bingnan Hou","is_ca":false},{"name":"Zhiping Cai","is_ca":false},{"name":"Kui Wu","is_ca":true},{"name":"Tao Yang","is_ca":false},{"name":"Tongqing Zhou","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006463197,0.0006924067,0.00090161,0.00142746,0.0005567308,0.001013371,0.00209586,0.0009576985,0.003475437],"category_scores_gemma":[0.002626965,0.0004737071,0.0005194917,0.001368059,0.0006081947,0.002680421,0.002017574,0.0009758552,0.001743021],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005143179,"about_ca_system_score_gemma":0.001083156,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00116473,"about_ca_topic_score_gemma":0.00150947,"domain_scores_codex":[0.9992742,0.0001392527,0.00004925938,0.0001263714,0.0003164132,0.00009444277],"domain_scores_gemma":[0.9986717,0.0003600201,0.000121341,0.0004245111,0.0003336043,0.00008892182],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001897155,0.0004875857,0.007353168,0.0005450035,0.0001749834,0.0007753542,0.0004293497,0.06501746,0.1316229,0.03656721,0.05005361,0.7050763],"study_design_scores_gemma":[0.0002176487,0.0006417864,0.001483035,0.00004610228,0.00009552623,0.001318284,0.0001725489,0.8590204,0.07821823,0.01359705,0.04503051,0.0001588997],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06878001,0.00141495,0.8706317,0.0003997605,0.0002881842,0.0003851832,0.001169147,0.04187841,0.01505264],"genre_scores_gemma":[0.4720815,0.0006604938,0.5131432,0.0004376055,0.0001042646,0.0004195826,0.003862178,0.001021392,0.008269734],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003475437,"threshold_uncertainty_score":0.01162648,"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","authors":[{"name":"Mohamed Hefeeda","is_ca":true},{"name":"Cheng-Hsin Hsu","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001921214,0.0009960614,0.001032339,0.0006548477,0.001069729,0.001196717,0.001014871,0.000695093,0.001908184],"category_scores_gemma":[0.005551097,0.0004723933,0.0003350184,0.001396634,0.001166242,0.001951959,0.001069584,0.001298135,0.0003373396],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001835083,"about_ca_system_score_gemma":0.001471855,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005081151,"about_ca_topic_score_gemma":0.003571378,"domain_scores_codex":[0.9989439,0.000470908,0.00004268777,0.000102025,0.0002810127,0.0001596036],"domain_scores_gemma":[0.9964389,0.002845918,0.0001923659,0.0001787332,0.0002571115,0.00008702903],"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.000340777,0.00008620614,0.0004926522,0.0001546907,0.00002529238,0.00009300036,0.0001569731,0.8880491,0.003804653,0.05915646,0.003108095,0.04453205],"study_design_scores_gemma":[0.00002578488,0.00004099504,0.00006921884,0.00001263744,0.000005752231,0.00002439899,0.00003058137,0.9773821,0.0007692519,0.02041551,0.001218429,0.000005288097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0278832,0.001720289,0.96393,0.0005490235,0.0001214098,0.0001329714,0.0000722231,0.0001918219,0.005399056],"genre_scores_gemma":[0.7245629,0.00439901,0.2667039,0.0002977971,0.0004008472,0.0002544538,0.0001989245,0.0001643706,0.003017747],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005081151,"threshold_uncertainty_score":0.01331449,"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","authors":[{"name":"Long Bao Le","is_ca":true},{"name":"Eytan Modiano","is_ca":false},{"name":"Ness B. Shroff","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001682774,0.001255787,0.0009101849,0.0006191782,0.0004866846,0.001907621,0.001079994,0.0009378797,0.001366432],"category_scores_gemma":[0.007727128,0.0003913737,0.0004235953,0.0006317905,0.002281098,0.001954093,0.001137142,0.001039304,0.0001277848],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002179493,"about_ca_system_score_gemma":0.001559839,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00797337,"about_ca_topic_score_gemma":0.002969483,"domain_scores_codex":[0.9990937,0.0003139636,0.00003218677,0.000195123,0.0001738553,0.0001911987],"domain_scores_gemma":[0.997062,0.002177726,0.0003196378,0.00007992241,0.0002353851,0.0001254012],"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.00009473821,0.00002622954,0.000262942,0.00006013216,0.00002455414,0.00005019115,0.0000425732,0.9373385,0.00110434,0.05484692,0.0003953503,0.005753594],"study_design_scores_gemma":[0.0000159377,0.00002477957,0.00005614161,0.000005500784,0.000006198042,0.000004244641,0.00001056305,0.9841534,0.0002484873,0.01526082,0.0002092337,0.000004599278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09106209,0.001901055,0.8961475,0.0009591468,0.000184484,0.0000617431,0.00009982127,0.0002296716,0.00935451],"genre_scores_gemma":[0.9793953,0.0008947374,0.0159897,0.0001099771,0.00008686548,0.00009883897,0.000043969,0.00003458201,0.003346045],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00797337,"threshold_uncertainty_score":0.01585394,"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","authors":[{"name":"Chris Develder","is_ca":false},{"name":"Jens Buysse","is_ca":false},{"name":"Bart Dhoedt","is_ca":false},{"name":"Brigitte Jaumard","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006888591,0.0006487936,0.0006718353,0.0003657036,0.0005194423,0.00112076,0.001043082,0.0005703377,0.002471403],"category_scores_gemma":[0.001296929,0.0003522305,0.0005460638,0.0004864577,0.0008872451,0.001443452,0.0014369,0.00103011,0.000312629],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008953818,"about_ca_system_score_gemma":0.001023678,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001693726,"about_ca_topic_score_gemma":0.002406025,"domain_scores_codex":[0.9994804,0.0001647314,0.00001711479,0.00009394837,0.000093043,0.000150694],"domain_scores_gemma":[0.9994019,0.0002138143,0.0001137619,0.0001264763,0.00006823931,0.00007577979],"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.00007933778,0.00008689834,0.0006959857,0.00008681344,0.00002197239,0.00009574756,0.00006080672,0.9274918,0.006217776,0.02779894,0.001097397,0.03626645],"study_design_scores_gemma":[0.00001111108,0.0000645463,0.000140886,0.000008221386,0.000009417518,0.00004491947,0.0000542702,0.9806489,0.002837104,0.01426136,0.001910531,0.000008691956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06541251,0.0003395268,0.9279158,0.0004339439,0.00004982648,0.00008601644,0.00008144036,0.000329926,0.005351008],"genre_scores_gemma":[0.814161,0.0002210349,0.1831087,0.0001031708,0.00003281023,0.0001037869,0.00008853998,0.00007104888,0.002109924],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002471403,"threshold_uncertainty_score":0.008267701,"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","authors":[{"name":"Sameh Sorour","is_ca":true},{"name":"Shahrokh Valaee","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007459465,0.0004482462,0.0003485587,0.0006155698,0.000441344,0.0002809249,0.001146175,0.0004333672,0.0005354196],"category_scores_gemma":[0.003554373,0.0001163363,0.0002126242,0.0004526967,0.0004309519,0.000723216,0.000655811,0.0004468294,0.0001199096],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005105474,"about_ca_system_score_gemma":0.0006034404,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001899712,"about_ca_topic_score_gemma":0.00318603,"domain_scores_codex":[0.9995572,0.0001474911,0.00001897151,0.00005682836,0.0001617272,0.0000578203],"domain_scores_gemma":[0.9987952,0.0005057849,0.0001883951,0.0001919698,0.000275814,0.00004297837],"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.0008509614,0.0002500043,0.00185982,0.0002664558,0.00009277988,0.000566454,0.0003891488,0.4264877,0.07390434,0.06021141,0.003311556,0.4318095],"study_design_scores_gemma":[0.00003042456,0.0002142579,0.0004821763,0.00001148538,0.00002727684,0.0002939636,0.00002830334,0.9834451,0.008243827,0.005647533,0.0015462,0.00002944081],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09728976,0.0005133362,0.8979636,0.0002179076,0.00006741065,0.0001410366,0.00007118001,0.0005574096,0.003178343],"genre_scores_gemma":[0.9206421,0.0002274034,0.0776651,0.00009157015,0.00003559791,0.00008929399,0.00005982441,0.00002075556,0.001168396],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001899712,"threshold_uncertainty_score":0.003944993,"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","authors":[{"name":"Le Zhang","is_ca":true},{"name":"Shahrokh Valaee","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007671297,0.0004971492,0.0005589888,0.0004418887,0.0006158723,0.0009177602,0.001105364,0.000432754,0.0009804299],"category_scores_gemma":[0.002126833,0.0002693995,0.0003450655,0.0005558581,0.0006073771,0.0008740461,0.0007685144,0.000666749,0.0001313252],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001054306,"about_ca_system_score_gemma":0.001258948,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0074909,"about_ca_topic_score_gemma":0.00651224,"domain_scores_codex":[0.9996118,0.0001422288,0.00001839885,0.00007060457,0.0001085975,0.00004851309],"domain_scores_gemma":[0.9995389,0.0002420574,0.00005326563,0.00002666015,0.0001123716,0.00002682843],"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.00005623975,0.00003036808,0.00039359,0.0001031761,0.00003110852,0.00009038806,0.00006906113,0.9202862,0.002222482,0.03493541,0.001930005,0.03985186],"study_design_scores_gemma":[0.000006277314,0.00001800536,0.0000839869,0.000004837078,0.000006633188,0.00001121162,0.000009836012,0.9915358,0.000144982,0.007181978,0.0009913833,0.000005043098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02237363,0.004765766,0.9649653,0.0005634432,0.00030914,0.0001353746,0.00005844855,0.0003974774,0.006431423],"genre_scores_gemma":[0.9529492,0.002249236,0.04034013,0.00007529373,0.0002090529,0.000165752,0.00008269784,0.00005041631,0.003878218],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0074909,"threshold_uncertainty_score":0.0148946,"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","authors":[{"name":"Sara Ayoubi","is_ca":true},{"name":"Yiheng Chen","is_ca":true},{"name":"Chadi Assi","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001417457,0.0007616636,0.0004234966,0.0004264422,0.0003618975,0.0007948842,0.001365007,0.0006749617,0.0009280011],"category_scores_gemma":[0.002485786,0.0003414876,0.0004052729,0.0002785672,0.001073352,0.001723849,0.001342809,0.001160194,0.0002479167],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000635464,"about_ca_system_score_gemma":0.0008448014,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000568703,"about_ca_topic_score_gemma":0.0006989214,"domain_scores_codex":[0.9993355,0.000234349,0.00003337027,0.0001124824,0.0002075853,0.00007663602],"domain_scores_gemma":[0.9991261,0.000227252,0.0001344229,0.0002256262,0.000224209,0.00006242849],"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.0001206699,0.00008936302,0.001340562,0.0002513625,0.00004257281,0.0002262268,0.0003373493,0.685446,0.03070782,0.1255664,0.001442722,0.1544289],"study_design_scores_gemma":[0.00001745321,0.0001929735,0.0001656073,0.00004468651,0.00002323972,0.0001632947,0.00006251944,0.9279178,0.008958239,0.0514592,0.01097866,0.00001621578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01249763,0.000271818,0.9843416,0.0001855244,0.00004472894,0.00003549747,0.0000102075,0.0001834803,0.002429564],"genre_scores_gemma":[0.6098434,0.0007973158,0.3861433,0.0002323226,0.00006967937,0.0001233029,0.00005814361,0.00009195731,0.002640561],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001417457,"threshold_uncertainty_score":0.007496297,"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","authors":[{"name":"Xuehong Sun","is_ca":true},{"name":"Sartaj Sahni","is_ca":false},{"name":"Y.Q. Zhao","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005279887,0.001333952,0.001251345,0.001943946,0.001077565,0.002851587,0.00341305,0.0009676749,0.01851182],"category_scores_gemma":[0.003468305,0.0006314158,0.0008160111,0.002422827,0.000441478,0.004534547,0.001295045,0.001045821,0.01399298],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001298167,"about_ca_system_score_gemma":0.001722378,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004640172,"about_ca_topic_score_gemma":0.004383175,"domain_scores_codex":[0.998589,0.0001173655,0.0001098657,0.0003666202,0.0006125855,0.0002045582],"domain_scores_gemma":[0.9972844,0.0007873766,0.0001502588,0.0009487351,0.0007220377,0.0001071905],"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.0006585187,0.0002027751,0.001679761,0.0002238231,0.0001032061,0.0001980786,0.00006575369,0.01259645,0.02725232,0.004548457,0.02566612,0.9268047],"study_design_scores_gemma":[0.0003931246,0.0005402284,0.005062222,0.0001187286,0.0003925229,0.001346034,0.0002879424,0.7324094,0.1408662,0.02053982,0.09788821,0.0001556429],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07504954,0.002881451,0.8489774,0.001575578,0.0008923253,0.0006468692,0.001107096,0.03100931,0.03786046],"genre_scores_gemma":[0.4084292,0.00140175,0.5327566,0.0008898782,0.0004528441,0.0008330202,0.003891099,0.0008749134,0.05047064],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01851182,"threshold_uncertainty_score":0.06192827,"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","authors":[{"name":"Jie Lian","is_ca":true},{"name":"Kshirasagar Naik","is_ca":true},{"name":"Gordon B. Agnew","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01275386,0.001926761,0.001692115,0.005362681,0.001435719,0.002454225,0.002391675,0.002496924,0.001414885],"category_scores_gemma":[0.04228688,0.0004616046,0.001531342,0.004692946,0.001828236,0.003245038,0.001985192,0.001848925,0.0003983011],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002764471,"about_ca_system_score_gemma":0.001804575,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004968696,"about_ca_topic_score_gemma":0.002481091,"domain_scores_codex":[0.9898193,0.004972227,0.0005962154,0.0006818022,0.003285351,0.0006451053],"domain_scores_gemma":[0.9782813,0.01413496,0.001747928,0.002904788,0.002605804,0.0003253671],"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.000420059,0.0004061469,0.004146945,0.0002923923,0.0002994589,0.00005899063,0.0001406525,0.889811,0.00580067,0.04901013,0.001974532,0.04763908],"study_design_scores_gemma":[0.00005997399,0.000841941,0.001660677,0.00003867665,0.00005387084,0.00007059065,0.0001136294,0.9773747,0.004632099,0.01323409,0.001871598,0.00004797439],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07229095,0.0008617713,0.9180148,0.0002433955,0.00009875777,0.001118599,0.0006751183,0.001389775,0.005306771],"genre_scores_gemma":[0.4385336,0.0004946403,0.5572809,0.0001196679,0.00005623188,0.001823152,0.0007074468,0.000259161,0.0007251591],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01275386,"threshold_uncertainty_score":0.06744969,"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","authors":[{"name":"Fidan Mehmeti","is_ca":true},{"name":"Thrasyvoulos Spyropoulos","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009965682,0.0008728249,0.000609931,0.000399494,0.0003859098,0.001065194,0.0008480302,0.0008029756,0.001144079],"category_scores_gemma":[0.003096179,0.0004047285,0.0004296606,0.0005767972,0.0008344988,0.0009299186,0.0005968852,0.0007242164,0.0001401037],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002444854,"about_ca_system_score_gemma":0.001364468,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01425831,"about_ca_topic_score_gemma":0.006042929,"domain_scores_codex":[0.9994922,0.0001444111,0.00001598153,0.00009431214,0.0001107422,0.0001424802],"domain_scores_gemma":[0.9987025,0.0007896002,0.0001601459,0.00006574757,0.0002169268,0.00006508802],"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.00002719431,0.0000143732,0.0003547924,0.00001569847,0.000004659133,0.00003547466,0.00002106257,0.9929371,0.001206047,0.00348303,0.0001399142,0.001760592],"study_design_scores_gemma":[0.000001121826,0.000009035789,0.00009628914,0.000001099847,0.000001570334,0.000005070876,0.000006669591,0.9990236,0.0001329696,0.0006681124,0.0000526355,0.000001935487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3265821,0.0009285258,0.6603392,0.001024096,0.00007827607,0.0001074458,0.0002502329,0.0002876937,0.01040239],"genre_scores_gemma":[0.9914426,0.0002328554,0.00671906,0.00002389228,0.00001246881,0.0000301742,0.00003121673,0.00002287424,0.001484919],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01425831,"threshold_uncertainty_score":0.02835065,"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","authors":[{"name":"C. Yuen","is_ca":true},{"name":"Peter Marbach","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005172001,0.0009580919,0.001208309,0.0008839239,0.0006369508,0.002054662,0.002608499,0.001552906,0.002004863],"category_scores_gemma":[0.01846684,0.0005647883,0.000660214,0.0009676482,0.002700565,0.003432552,0.001407844,0.00180884,0.0004299817],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001543548,"about_ca_system_score_gemma":0.0008190481,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001401781,"about_ca_topic_score_gemma":0.000661289,"domain_scores_codex":[0.9971408,0.001271987,0.0001134892,0.0003483693,0.0007335556,0.0003918996],"domain_scores_gemma":[0.990038,0.006882286,0.001369982,0.000505138,0.0009175537,0.0002870288],"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.0002515051,0.000137133,0.0005571191,0.0001183328,0.00007012029,0.0002857562,0.0002123765,0.6833273,0.007486766,0.2859747,0.001342976,0.02023595],"study_design_scores_gemma":[0.00004406383,0.00006101912,0.00005646453,0.000005454022,0.00001153449,0.00004886854,0.000009426609,0.9566665,0.0005440754,0.0421708,0.0003646394,0.00001713805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06439193,0.00116497,0.9279768,0.0008958125,0.0002214754,0.0000860927,0.00005142369,0.0003183445,0.004893093],"genre_scores_gemma":[0.9636491,0.0006556862,0.03251646,0.0001430336,0.000203655,0.0001084973,0.00002586349,0.000058524,0.002639147],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005172001,"threshold_uncertainty_score":0.02735245,"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","authors":[{"name":"Abdelhamid Eshoul","is_ca":true},{"name":"Hussein T. Mouftah","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009414433,0.0007068487,0.0004696858,0.000910109,0.000550112,0.0008893971,0.001000009,0.0007306555,0.001545919],"category_scores_gemma":[0.0017537,0.0003606937,0.0007128895,0.0009536867,0.0007788193,0.0015062,0.0009503044,0.0007865888,0.0001343366],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001141116,"about_ca_system_score_gemma":0.0009861017,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003068893,"about_ca_topic_score_gemma":0.003253784,"domain_scores_codex":[0.9996327,0.0001374931,0.00001520462,0.00006594955,0.00009239695,0.00005624906],"domain_scores_gemma":[0.9994011,0.0003698537,0.00008109713,0.00004100849,0.00008147037,0.00002536863],"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.00003226582,0.00003174323,0.0003037139,0.00006857173,0.00002011153,0.00009530834,0.00006022962,0.9021325,0.001637117,0.06065049,0.0004478049,0.0345201],"study_design_scores_gemma":[0.000004127692,0.00003207449,0.00005375489,0.000009461917,0.000006178851,0.00002386638,0.000026733,0.9660752,0.0004412534,0.03236857,0.0009535278,0.000005130206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02354401,0.0004894529,0.9709852,0.0002336369,0.00002119891,0.00005453479,0.00002948745,0.00006881671,0.004573551],"genre_scores_gemma":[0.7418663,0.001368872,0.2507763,0.000141374,0.00009429939,0.0002467325,0.000114626,0.00008730455,0.005304187],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003068893,"threshold_uncertainty_score":0.008279443,"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","authors":[{"name":"Fangxin Wang","is_ca":true},{"name":"Cong Zhang","is_ca":false},{"name":"Feng Wang","is_ca":true},{"name":"Jiangchuan Liu","is_ca":true},{"name":"Yifei Zhu","is_ca":true},{"name":"Haitian Pang","is_ca":false},{"name":"Lifeng Sun","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001294132,0.0007440881,0.0008721689,0.0003359537,0.0004641971,0.0009117489,0.001693308,0.00124448,0.002134916],"category_scores_gemma":[0.002501794,0.0003325035,0.0004694504,0.0002873372,0.000710009,0.001235708,0.002130707,0.00191641,0.0004948744],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008886899,"about_ca_system_score_gemma":0.001200634,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007460174,"about_ca_topic_score_gemma":0.01000555,"domain_scores_codex":[0.9996618,0.0001070594,0.00001228186,0.00007347475,0.00007684052,0.00006851232],"domain_scores_gemma":[0.999405,0.0002990183,0.00003512794,0.00004848576,0.0001309705,0.000081406],"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.0003461824,0.0003339181,0.001393514,0.00008691606,0.00006825054,0.0001214132,0.0001922802,0.8030715,0.004733591,0.01388066,0.007972174,0.1677995],"study_design_scores_gemma":[0.00001344934,0.00002039282,0.00003912004,0.000002728654,0.000002803078,0.000004258422,0.000008938767,0.9965324,0.0004067793,0.002502054,0.0004639169,0.000003083386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02643286,0.0003195489,0.9668513,0.0003643592,0.0001107832,0.00008286613,0.00009396332,0.001714622,0.004029713],"genre_scores_gemma":[0.7606765,0.0002841745,0.2318207,0.0004728255,0.0001122484,0.0001718131,0.0002298111,0.0001894572,0.006042561],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007460174,"threshold_uncertainty_score":0.01483351,"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","authors":[{"name":"James Aweya","is_ca":true},{"name":"Michel Ouellette","is_ca":true},{"name":"Delfin Y. Montuno","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001781074,0.0009018948,0.0008405553,0.0006348868,0.0005523273,0.001269633,0.0008363394,0.001090809,0.00234332],"category_scores_gemma":[0.003874232,0.0003904231,0.0006125047,0.0003524305,0.0008604287,0.0009411662,0.0006436553,0.0008967847,0.0007020145],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008999037,"about_ca_system_score_gemma":0.001209191,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001775315,"about_ca_topic_score_gemma":0.0009447892,"domain_scores_codex":[0.9991754,0.0001995367,0.00004686569,0.000172667,0.000336668,0.00006887713],"domain_scores_gemma":[0.9985593,0.0006572614,0.0002044534,0.00007767906,0.0004672515,0.00003399786],"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.0001382067,0.00006212406,0.0004551706,0.0001720748,0.00005880358,0.0001661863,0.0002725764,0.7918897,0.03200982,0.0914039,0.0009170551,0.08245444],"study_design_scores_gemma":[0.00002005445,0.00008077252,0.00006452232,0.000009188965,0.00000970103,0.00003570952,0.000007434953,0.9909161,0.003619471,0.004364446,0.0008603662,0.00001234265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005877252,0.0001295566,0.9914569,0.00007344128,0.00002899946,0.00005517498,0.000008367184,0.0001662891,0.002204039],"genre_scores_gemma":[0.6529499,0.0006228247,0.340324,0.0001130977,0.0001193801,0.000420541,0.00005963027,0.0001573442,0.005233257],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00234332,"threshold_uncertainty_score":0.009419322,"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","authors":[{"name":"Hanine Tout","is_ca":true},{"name":"Azzam Mourad","is_ca":false},{"name":"Nadjia Kara","is_ca":true},{"name":"Chamseddine Talhi","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004442377,0.0007720197,0.0008996585,0.0003730312,0.000502297,0.0008644283,0.001087553,0.0008060425,0.001514155],"category_scores_gemma":[0.0008894213,0.0003066729,0.0006865856,0.0004521064,0.0003835054,0.0008519666,0.001189582,0.000665741,0.0002184107],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000539717,"about_ca_system_score_gemma":0.001019221,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004496403,"about_ca_topic_score_gemma":0.004496059,"domain_scores_codex":[0.999648,0.00007846034,0.00001249115,0.00006193684,0.00007788472,0.0001211528],"domain_scores_gemma":[0.9997802,0.00007657828,0.00003493423,0.00003125544,0.00003502947,0.00004192259],"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.00007914974,0.00007843051,0.00082737,0.00004042998,0.00003570346,0.0001272408,0.0000490668,0.9384336,0.003728225,0.006048451,0.001082438,0.04947002],"study_design_scores_gemma":[0.000003469758,0.00002140035,0.0001022058,0.000002343068,0.000005719409,0.00001887482,0.00001220982,0.9979259,0.0003064523,0.001254738,0.0003433675,0.000003331127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04861461,0.0003375048,0.9448836,0.0003606198,0.00008509245,0.00005255238,0.00003875118,0.0004025767,0.005224598],"genre_scores_gemma":[0.929847,0.0001482584,0.06716762,0.00009615635,0.00002982745,0.00005871253,0.00004725523,0.0000455019,0.002559665],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004496403,"threshold_uncertainty_score":0.008940458,"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","authors":[{"name":"Jun Li","is_ca":true},{"name":"Y.Q. Zhao","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001925874,0.0006435068,0.0005771481,0.0007957102,0.0005777648,0.0006180368,0.0009580823,0.0005270395,0.002156316],"category_scores_gemma":[0.007253992,0.0003607866,0.0004150115,0.000462531,0.0009734228,0.001517139,0.000611765,0.0007502782,0.0002142431],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001891217,"about_ca_system_score_gemma":0.001365878,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008351387,"about_ca_topic_score_gemma":0.003873551,"domain_scores_codex":[0.9991251,0.0002032409,0.00002211886,0.0001155914,0.000344575,0.0001894377],"domain_scores_gemma":[0.9954427,0.003102661,0.0005022362,0.0001959972,0.0006539322,0.0001023961],"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.0001586432,0.00004730296,0.000955201,0.00005109542,0.00002690019,0.000206653,0.0001603809,0.9504315,0.01249131,0.02851249,0.0003141391,0.00664436],"study_design_scores_gemma":[0.000003288937,0.00002516876,0.0002245587,0.000001873582,0.000006204879,0.00002596121,0.00001944657,0.9967787,0.001135785,0.001686064,0.00008656231,0.000006489957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4320222,0.0009655174,0.5614418,0.0004011127,0.00004323063,0.00008861504,0.0001000589,0.0003422575,0.004595221],"genre_scores_gemma":[0.9877566,0.0001894772,0.01058949,0.00004739406,0.00001298871,0.00003784,0.00003091942,0.0000330512,0.001302208],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008351387,"threshold_uncertainty_score":0.01660556,"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","authors":[{"name":"Sajad Shirali-Shahreza","is_ca":true},{"name":"Yashar Ganjali","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001503884,0.001025499,0.001130727,0.0008647058,0.0006519992,0.001093228,0.00312343,0.0007883891,0.001360313],"category_scores_gemma":[0.003351913,0.0005300865,0.0005395959,0.000768282,0.0005901435,0.001809436,0.001534022,0.001037268,0.0002328193],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007728063,"about_ca_system_score_gemma":0.002051168,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002616466,"about_ca_topic_score_gemma":0.004196808,"domain_scores_codex":[0.9985733,0.0002676881,0.0001007797,0.0002625448,0.0004657405,0.0003299139],"domain_scores_gemma":[0.9974728,0.0008460961,0.0003721201,0.0005861851,0.0004468342,0.0002759253],"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.000762604,0.000726388,0.006454083,0.0002178195,0.0001486086,0.0003081829,0.0004720035,0.5667682,0.0459119,0.008452417,0.003368597,0.3664092],"study_design_scores_gemma":[0.00006720952,0.000495645,0.001501339,0.00002018225,0.00005376424,0.0002075075,0.00009038917,0.9748975,0.01709303,0.00303793,0.002500247,0.00003526537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1527444,0.0005883414,0.8408681,0.0003667249,0.0001207336,0.0001566538,0.00007617139,0.002768555,0.002310368],"genre_scores_gemma":[0.8103321,0.0001297577,0.1873253,0.0001762661,0.00005240904,0.00005813071,0.0001046681,0.0001226304,0.00169869],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00312343,"threshold_uncertainty_score":0.007953405,"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","authors":[{"name":"Chuan Wu","is_ca":false},{"name":"Baochun Li","is_ca":true},{"name":"Shuqiao Zhao","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002015833,0.0007818346,0.0008080297,0.0006959076,0.001140304,0.0009015211,0.001315431,0.0009175744,0.0005799654],"category_scores_gemma":[0.008354182,0.0003846232,0.0002547729,0.0006230426,0.001027546,0.002116929,0.0007576076,0.0008929282,0.000156261],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009904966,"about_ca_system_score_gemma":0.0009349042,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007630719,"about_ca_topic_score_gemma":0.005218125,"domain_scores_codex":[0.9986712,0.000480896,0.00007395817,0.0002481399,0.0003710867,0.0001548409],"domain_scores_gemma":[0.9951522,0.0034211,0.0002165257,0.0005088035,0.0005167206,0.0001846382],"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.0005279965,0.000306158,0.004728882,0.0001005171,0.00004925334,0.0002393318,0.0002243159,0.8566793,0.0115911,0.004380341,0.001055907,0.1201169],"study_design_scores_gemma":[0.00000797631,0.00004671261,0.000490302,0.000002706773,0.000005611875,0.0000416705,0.00002885135,0.995266,0.00278413,0.001052137,0.0002664193,0.000007488565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5450209,0.001401752,0.4469487,0.0009771722,0.0001197919,0.0002080607,0.0001190211,0.001908966,0.003295576],"genre_scores_gemma":[0.9429071,0.0002771157,0.05597928,0.00005246486,0.00004421495,0.00003635802,0.00006706084,0.00007826566,0.0005582481],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007630719,"threshold_uncertainty_score":0.0151726,"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","authors":[{"name":"Qingfeng Tan","is_ca":false},{"name":"Xuebin Wang","is_ca":false},{"name":"Wei Shi","is_ca":true},{"name":"Jian Tang","is_ca":false},{"name":"Zhihong Tian","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001537984,0.000462705,0.0006085548,0.0008567105,0.002198676,0.001921314,0.001044504,0.001369976,0.001722519],"category_scores_gemma":[0.007284435,0.0002701202,0.0007306858,0.000770621,0.002785692,0.004082467,0.003108991,0.001312753,0.0003762704],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001312917,"about_ca_system_score_gemma":0.0008818766,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001689275,"about_ca_topic_score_gemma":0.0009064802,"domain_scores_codex":[0.9963039,0.001142811,0.0001590219,0.0005448322,0.001205383,0.0006439878],"domain_scores_gemma":[0.994017,0.001965664,0.0008747269,0.002141672,0.0007934704,0.0002074503],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.001417657,0.0001650718,0.02590577,0.0007623013,0.0003805005,0.006308516,0.007951829,0.2956557,0.06652663,0.4519509,0.01599484,0.1269803],"study_design_scores_gemma":[0.00003720499,0.0005052701,0.008815948,0.000162768,0.0002825973,0.0088799,0.003875184,0.6831741,0.103974,0.1315321,0.0584627,0.0002981944],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6570909,0.00088342,0.3087054,0.001017436,0.0002262351,0.0002360775,0.0005327247,0.003093273,0.02821452],"genre_scores_gemma":[0.9917994,0.00009718585,0.006636316,0.00007591084,0.00001182882,0.00003309762,0.00005685417,0.00004127674,0.001248113],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002198676,"threshold_uncertainty_score":0.009525895,"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","authors":[{"name":"Bin Wu","is_ca":true},{"name":"King Lun Yeung","is_ca":false},{"name":"Mounir Hamdi","is_ca":false},{"name":"Xin Li","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007921789,0.0007078025,0.0004378924,0.0003403405,0.0005207448,0.0006899353,0.0005881139,0.0003240572,0.001530873],"category_scores_gemma":[0.001815848,0.0002161769,0.0003000096,0.0004396922,0.0006584916,0.0009179915,0.0006797169,0.0004719606,0.0001177976],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001266148,"about_ca_system_score_gemma":0.0008038097,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001190775,"about_ca_topic_score_gemma":0.001734186,"domain_scores_codex":[0.9996065,0.00008746004,0.00001177071,0.00005228058,0.0001048923,0.0001371319],"domain_scores_gemma":[0.9994861,0.0002568813,0.00007867434,0.00006822444,0.00005004905,0.00006012856],"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.0003436067,0.0001064622,0.001015189,0.00008417208,0.00001904564,0.0001265141,0.0000654547,0.8987339,0.02372941,0.04780578,0.0007556861,0.02721472],"study_design_scores_gemma":[0.00001785817,0.00005249864,0.0001933076,0.000002447943,0.000005111091,0.00001175063,0.000009504348,0.9901079,0.002304238,0.007036943,0.0002563698,0.000002172309],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5883536,0.0003290852,0.4005644,0.0004859544,0.00005571534,0.00006501254,0.00006600158,0.0004999757,0.009580328],"genre_scores_gemma":[0.9481642,0.0002010695,0.05016324,0.00003137586,0.00003396813,0.00004092691,0.00004551841,0.00006160989,0.00125799],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001530873,"threshold_uncertainty_score":0.009186625,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}