{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":1183,"total_is_capped":false,"direct_labels_cover":1,"predictions_cover":1183,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"8fb43236dcdc","filters":{"topic":"Network Traffic and Congestion Control"}},"results":[{"id":"W2140490525","doi":"10.1109/90.842137","title":"Modeling TCP Reno performance: a simple model and its empirical validation","year":2000,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1181,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Computer science; H-TCP; TCP acceleration; Flow (mathematics); Communication source; TCP global synchronization; File Transfer Protocol; Zeta-TCP; CUBIC TCP; Transfer (computing); Simple (philosophy); Computer network; Network congestion; Operating system; Mechanics; The Internet; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.04610366903569576,"gpt":0.2720498297292525,"spread":0.2259461606935567,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000279543,0.0002331271,0.0002190229,0.0001154474,0.0005928735,0.0001894777,0.0004799818,0.000134861,0.00005862398],"category_scores_gemma":[0.000002639398,0.0002369771,0.0000871055,0.0004387541,0.00002246856,0.0005863941,0.000007765963,0.0003731343,0.00004963252],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005309984,"about_ca_system_score_gemma":0.00006608979,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004139325,"about_ca_topic_score_gemma":0.000008454645,"domain_scores_codex":[0.9982628,0.00007816716,0.0003471641,0.0005455809,0.0003167102,0.0004495987],"domain_scores_gemma":[0.9991139,0.0001070776,0.00004501068,0.0005056254,0.00006632223,0.0001621103],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002088476,0.0000268236,0.000009727057,0.000003706211,0.00001127979,0.000001208449,0.0001351606,0.5923687,0.00001484465,0.00004593603,0.00004789873,0.4073138],"study_design_scores_gemma":[0.0005103399,0.00007417695,0.00001289144,0.00005529985,0.00002746866,0.0000199863,0.000006661024,0.9972359,0.00007588955,0.0007601094,0.0009596107,0.0002616638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2483481,0.0001895089,0.7497128,0.0005393955,0.0003231675,0.0001706256,0.000001785902,0.0003090939,0.0004055655],"genre_scores_gemma":[0.9926538,0.000696704,0.005234919,0.0005630789,0.000309274,0.00005193306,0.000002986763,0.0000224475,0.0004647982],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7444779,"threshold_uncertainty_score":0.9663647,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2103701891","doi":"10.1145/633025.633035","title":"Congestion control for high bandwidth-delay product networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1095,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Tellabs (Canada)","funders":"","keywords":"Network congestion; Computer science; Bandwidth (computing); Computer network; Network packet","retraction":null,"screen_n_in":null,"score":{"opus":0.01133866544013113,"gpt":0.1974424321398333,"spread":0.1861037666997022,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003185882,0.0001819336,0.0002334387,0.00005428596,0.0001795479,0.0001690344,0.0005168183,0.0000797043,0.0001118708],"category_scores_gemma":[0.00005017735,0.0001535214,0.00008702587,0.0002230497,0.00004108541,0.0003578996,0.00003342254,0.0001250458,0.00008641154],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002628333,"about_ca_system_score_gemma":0.0000129809,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005231618,"about_ca_topic_score_gemma":0.000008651854,"domain_scores_codex":[0.9985827,0.00006756445,0.0002391485,0.000506978,0.0001791578,0.0004244288],"domain_scores_gemma":[0.9988298,0.0002955021,0.0000899154,0.0004987693,0.0001584331,0.0001275347],"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.0000230361,0.00007308313,0.0001416669,0.000004345243,0.00004345288,0.00000494949,0.00002880505,0.02513175,0.00001595506,0.2572525,0.07635752,0.640923],"study_design_scores_gemma":[0.001977296,0.0001402521,0.0003110344,0.000008429592,0.00002150179,0.0000154918,0.000001693148,0.9694327,0.00002180456,0.0009105283,0.02693579,0.0002234728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0005780496,0.0008313712,0.9810339,0.01335105,0.001229701,0.0007070647,0.000002173877,0.0005300484,0.001736609],"genre_scores_gemma":[0.9816102,0.00004515314,0.01025642,0.001887293,0.0007449926,0.0001868302,0.000003718209,0.00001235731,0.005253079],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9810321,"threshold_uncertainty_score":0.6260419,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1841750659","doi":"10.1007/978-1-4614-1406-3_2","title":"Introduction to Network Simulator 2 (NS2)","year":2011,"lang":"en","type":"book-chapter","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":828,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Network simulation; Computer science; Computer network; Wireless network; Routing protocol; Event (particle physics); Distributed computing; Routing (electronic design automation); Wireless; Simulation; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.01263572205133217,"gpt":0.1963360421896505,"spread":0.1837003201383184,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0002109115,0.0003302082,0.0003465153,0.0001009799,0.0001056074,0.0001084945,0.0008343105,0.0002605675,0.002105438],"category_scores_gemma":[0.000009303138,0.0003042434,0.0001426786,0.00007471418,0.00002820771,0.0001642349,0.0002511434,0.0002939086,0.004286122],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005143777,"about_ca_system_score_gemma":0.00007665824,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003482574,"about_ca_topic_score_gemma":0.00001380176,"domain_scores_codex":[0.9982411,0.00001631097,0.0003271657,0.0007863019,0.0002713587,0.0003577683],"domain_scores_gemma":[0.9983955,0.0000534496,0.0001232123,0.00103795,0.0001528341,0.0002370767],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000006260757,0.000003384821,3.644999e-7,0.000001593711,0.00002452416,0.000004047496,0.00001496054,0.002894835,2.495899e-7,0.5504941,0.2184916,0.2280641],"study_design_scores_gemma":[0.0001137685,0.00009467299,0.00000330804,0.0000236659,0.00002063442,0.00000787496,2.655453e-7,0.01117617,0.000001260998,0.03319012,0.9550063,0.0003619628],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[5.013533e-7,0.0002281655,0.5291066,0.002920933,0.002622399,0.0002554587,0.000001104647,0.0004433182,0.4644215],"genre_scores_gemma":[0.00186781,0.000044126,0.0111818,0.002454846,0.01202695,0.00001532203,0.0000075529,0.00003960909,0.972362],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.7365147,"threshold_uncertainty_score":0.999941,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2124920704","doi":"10.1109/infcom.2000.832541","title":"A study of active queue management for congestion control","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":411,"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":"Random early detection; Active queue management; Computer science; Network congestion; Computer network; Explicit Congestion Notification; The Internet; Overhead (engineering); Queue; Path (computing); Slow-start; Distributed computing; Network packet","retraction":null,"screen_n_in":null,"score":{"opus":0.0200924775204729,"gpt":0.2325164092386842,"spread":0.2124239317182113,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001252159,0.00008440766,0.0001506275,0.00005886894,0.00005425098,0.00002838308,0.0003084017,0.00002473531,0.00003300153],"category_scores_gemma":[0.000008038591,0.00007233276,0.00004336193,0.0001389462,0.00001375972,0.0001522268,0.00003238068,0.00003700708,0.00001504994],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000161799,"about_ca_system_score_gemma":0.000003695285,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006677828,"about_ca_topic_score_gemma":0.00002017846,"domain_scores_codex":[0.9992419,0.00004713283,0.000179027,0.0002347415,0.0001493081,0.0001478639],"domain_scores_gemma":[0.9993827,0.0001332537,0.00007525264,0.0002714588,0.0000954819,0.00004188099],"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.00003451118,0.0005641058,0.00008531273,0.000006020869,0.0001199723,0.000004857764,0.0005663087,0.001186222,0.000006767425,0.1210069,0.001775194,0.8746439],"study_design_scores_gemma":[0.01088046,0.001396194,0.003987992,0.00001577379,0.00009196594,0.000004083113,0.0009884442,0.9773916,0.00004881284,0.0009579461,0.003999808,0.0002369368],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02261932,0.00005101732,0.9662616,0.0009340045,0.0002403098,0.001525318,0.000001875917,0.0001501131,0.008216415],"genre_scores_gemma":[0.9948322,0.000005932022,0.003086652,0.0002150891,0.00003474636,0.0002186718,2.871748e-7,0.000003960262,0.001602482],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9762053,"threshold_uncertainty_score":0.2949645,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2112947567","doi":"10.1109/tnet.2005.852876","title":"Non-convex optimization and rate control for multi-class services in the Internet","year":2005,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":284,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Mathematical optimization; Sigmoid function; The Internet; Concave function; Convergence (economics); Network congestion; Dual (grammatical number); Class (philosophy); Convex function; Transmission (telecommunications); Function (biology); Regular polygon; Computer network; Telecommunications; Artificial neural network; Artificial intelligence; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01933816349824027,"gpt":0.2448934649100482,"spread":0.2255553014118079,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005783368,0.0001910744,0.0002048751,0.0001095368,0.0002122851,0.0002586835,0.0006853866,0.00009726387,0.000006350968],"category_scores_gemma":[0.000002557376,0.0001563307,0.00007698104,0.0002975285,0.00003594936,0.0003677419,0.000005306272,0.0002426049,0.000006999774],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004208077,"about_ca_system_score_gemma":0.00002408732,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001744843,"about_ca_topic_score_gemma":0.0003825094,"domain_scores_codex":[0.998712,0.000123353,0.0003005108,0.000393351,0.0001336451,0.0003371098],"domain_scores_gemma":[0.9989095,0.0004741499,0.00009900801,0.0004026722,0.00005465472,0.00006002574],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000393966,0.00006867809,0.00004549678,0.000008421811,0.00002400816,0.000001621082,0.0006381022,0.7483197,0.000009404403,0.0002029186,0.00005917102,0.250583],"study_design_scores_gemma":[0.002289432,0.0000748841,0.0001251963,0.00007546343,0.00002707136,0.000008049691,0.00005706154,0.9924671,0.00003622083,0.00006215968,0.004611401,0.0001659689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00257362,0.0002199464,0.9925183,0.003098761,0.00077851,0.0006421603,0.000003017524,0.0001049198,0.00006075198],"genre_scores_gemma":[0.9721674,0.00009370369,0.02394998,0.003027171,0.0003892083,0.00022712,0.000002355943,0.00001524108,0.0001278358],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9695938,"threshold_uncertainty_score":0.637498,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3159989400","doi":"10.1145/964725.633035","title":"Congestion control for high bandwidth-delay product networks","year":2002,"lang":"en","type":"article","venue":"ACM SIGCOMM Computer Communication Review","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":265,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Tellabs (Canada)","funders":"","keywords":"Computer science; Computer network; Network congestion; Bandwidth (computing); Queuing delay; Network packet; Flow control (data); Scalability; Active queue management; HSTCP; Bandwidth management; Bandwidth allocation; Queueing theory; Distributed computing; TCP Friendly Rate Control","retraction":null,"screen_n_in":null,"score":{"opus":0.02451723703655837,"gpt":0.2449468099596335,"spread":0.2204295729230751,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001273094,0.0003695255,0.000713022,0.00008458524,0.0004515988,0.0002493377,0.004406806,0.0001074866,0.00006525332],"category_scores_gemma":[0.0002190874,0.000342122,0.0002396278,0.0005436526,0.00009575752,0.0005961612,0.0006084339,0.0004007054,0.0001256358],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006353584,"about_ca_system_score_gemma":0.00002863968,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006938387,"about_ca_topic_score_gemma":0.000005735895,"domain_scores_codex":[0.9969801,0.0008264522,0.0007747381,0.0006462361,0.0002959777,0.0004765305],"domain_scores_gemma":[0.9924486,0.001678178,0.0004837314,0.004708006,0.0005062161,0.0001752382],"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.000005665752,0.0001171952,0.00005123077,0.0001494848,0.00007040489,0.000001469274,0.0000333043,0.002581466,0.000001129369,0.04293093,0.135088,0.8189697],"study_design_scores_gemma":[0.001477837,0.0001360543,0.0002600956,0.001080134,0.0001021091,0.00003889807,6.205085e-7,0.7113427,0.000001899366,0.001130096,0.2840061,0.0004234631],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00003376612,0.1575665,0.7753445,0.06408174,0.0005385019,0.001774339,0.000004062815,0.0004685256,0.0001881211],"genre_scores_gemma":[0.6580371,0.1139694,0.1992082,0.02627974,0.0006992811,0.001227757,0.0001027804,0.00005213036,0.0004236271],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8185462,"threshold_uncertainty_score":0.9999031,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2162968606","doi":"10.1109/comst.2000.5340798","title":"An overview of pricing concepts for broadband IP networks","year":2000,"lang":"en","type":"article","venue":"IEEE Communications Surveys & Tutorials","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":237,"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; Quality of service; Pricing strategies; Admission control; Network congestion; Variable pricing; Computer network; Broadband; Dynamic pricing; Operations research; Telecommunications; Microeconomics; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.08824674015699609,"gpt":0.3651896240061283,"spread":0.2769428838491322,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003781237,0.0001748062,0.0004202509,0.00005883455,0.000329157,0.0001304248,0.002827381,0.0001200271,0.00005286328],"category_scores_gemma":[0.00008076127,0.00017595,0.0001279928,0.0004784775,0.0001760059,0.0004916103,0.00008224952,0.0001471433,0.00001440305],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003667308,"about_ca_system_score_gemma":0.0001399972,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001154831,"about_ca_topic_score_gemma":0.0001200195,"domain_scores_codex":[0.9965072,0.002028814,0.000644764,0.0003192158,0.0001986233,0.0003014296],"domain_scores_gemma":[0.9942635,0.001986139,0.000252711,0.003031153,0.0003515705,0.0001149044],"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.00001581533,0.0002121622,0.0001986147,0.00001281354,0.00005598053,2.707201e-7,0.0004573137,0.01712978,0.0002496922,0.04022089,0.001668135,0.9397785],"study_design_scores_gemma":[0.002697631,0.0003928017,0.005833773,0.000211987,0.000095663,0.000007373929,0.00004389377,0.8229908,0.0004050749,0.003081728,0.1634975,0.000741775],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009750681,0.01004911,0.9748561,0.0006368794,0.002065758,0.0009840496,0.0000335376,0.00030412,0.001319742],"genre_scores_gemma":[0.9804416,0.002437513,0.01591576,0.0001778726,0.0005260357,0.0001477451,0.00003831618,0.00001777662,0.0002973871],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9706909,"threshold_uncertainty_score":0.7175032,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2032667132","doi":"10.1016/s1389-1286(00)00206-1","title":"A control theoretic approach to active queue management","year":2001,"lang":"en","type":"article","venue":"Computer Networks","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":235,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Computer science; Active queue management; Computer network; Random early detection; Queue; Router; Traffic intensity; Network packet; Queue management system; Distributed computing; Network congestion","retraction":null,"screen_n_in":null,"score":{"opus":0.006530364747959269,"gpt":0.1969023178851752,"spread":0.1903719531372159,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002906722,0.0002780043,0.000306311,0.0001235106,0.000171758,0.0002716189,0.001363132,0.00009748639,0.00001308458],"category_scores_gemma":[0.000002302265,0.0002525044,0.0001227483,0.0006612778,0.00004983973,0.0002208029,0.0003471279,0.0002439761,0.0001163404],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005996531,"about_ca_system_score_gemma":0.00001567068,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002811795,"about_ca_topic_score_gemma":0.000001199013,"domain_scores_codex":[0.9979204,0.0001627515,0.0002808478,0.0007276008,0.0002747,0.0006337283],"domain_scores_gemma":[0.9986088,0.0001350401,0.00007839895,0.0008154524,0.00007549702,0.0002867755],"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.00003517299,0.00008150413,0.00003917796,0.000002998785,0.00006244642,0.00003414153,0.00009788043,0.2321561,1.36259e-7,0.2323378,0.005669198,0.5294835],"study_design_scores_gemma":[0.001086454,0.00009466722,0.001071009,0.00002956695,0.00002227468,0.00004907661,0.000007862543,0.9738289,4.557874e-7,0.001460903,0.02204709,0.0003017269],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00049175,0.000152651,0.9765111,0.001003913,0.001039311,0.0006990068,6.157753e-7,0.0004768936,0.01962476],"genre_scores_gemma":[0.9297339,0.00004109612,0.06272089,0.005917655,0.001018843,0.0001568149,0.000003824189,0.00002025501,0.0003867516],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9292421,"threshold_uncertainty_score":0.9999927,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2152536325","doi":"10.1109/infcom.1995.515974","title":"Analysis of an ATM buffer with self-similar (\"fractal\") input traffic","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":222,"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; Fractal; Buffer (optical fiber); Self-similarity; Computer network; Mathematics; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.008847057121624844,"gpt":0.1980919491273537,"spread":0.1892448920057288,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000152814,0.0001514572,0.0003151695,0.0002171643,0.00006624212,0.00007569885,0.0005924682,0.00006139729,0.0003940277],"category_scores_gemma":[0.00000426948,0.0001118091,0.0001151043,0.001526305,0.00003702288,0.000432632,0.00003788703,0.00009597662,0.00003265778],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001705077,"about_ca_system_score_gemma":0.00002073463,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008455126,"about_ca_topic_score_gemma":0.0000893649,"domain_scores_codex":[0.9987416,0.00007241941,0.0002357269,0.0003862231,0.000319651,0.0002443604],"domain_scores_gemma":[0.9989185,0.00008381665,0.00009490534,0.0006520898,0.0001095657,0.0001411706],"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.00002234206,0.0008136426,0.001493131,0.000008119095,0.001649161,0.00003842632,0.001477041,0.1353497,0.00003252229,0.009931992,0.001412171,0.8477718],"study_design_scores_gemma":[0.0004263115,0.0002051325,0.001864401,0.000003434235,0.0002954697,0.000005828217,0.00002045101,0.9950613,0.00004061414,0.000008324832,0.001903374,0.0001653732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7556581,0.0001793752,0.2355197,0.001019939,0.00008899108,0.0001714861,0.000002089901,0.0006185217,0.006741769],"genre_scores_gemma":[0.9815716,0.00001893434,0.01725857,0.0004937695,0.000038598,0.000008397841,0.000002575654,0.000007262261,0.0006003088],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8597116,"threshold_uncertainty_score":0.4559443,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1998103163","doi":"10.1109/4236.968834","title":"Internet traffic measurement","year":2001,"lang":"en","type":"article","venue":"IEEE Internet Computing","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":184,"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; The Internet; Internet layer; Protocol stack; Packet analyzer; Computer network; Internet traffic engineering; Internet traffic; Network packet; Internet Connection Sharing; Communications protocol; Internet transit; Internet Protocol; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.03939153127542008,"gpt":0.2353731715165785,"spread":0.1959816402411584,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006930138,0.0002435228,0.0002534206,0.0001191437,0.00006138672,0.0003163357,0.001319377,0.0000754633,0.00005124136],"category_scores_gemma":[0.00003205277,0.0002343282,0.000136794,0.0003079516,0.00004175875,0.0002364855,0.0001778094,0.0002761318,0.0004094766],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001394168,"about_ca_system_score_gemma":0.00005535327,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003142388,"about_ca_topic_score_gemma":0.00004447176,"domain_scores_codex":[0.9978206,0.0001189861,0.0004448236,0.0005696294,0.0005344871,0.0005114315],"domain_scores_gemma":[0.9989459,0.0001001452,0.0001501479,0.0004478842,0.0001967022,0.0001592231],"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.00001617571,0.00008995543,0.0003988627,0.000006190617,0.00006413296,0.00009669748,0.0008249962,0.01446447,0.00008157479,0.005332298,0.01589411,0.9627305],"study_design_scores_gemma":[0.0005471879,0.0001000172,0.0003286379,0.0001229729,0.000008725499,0.0001377104,0.00001594661,0.9704239,0.0002255752,0.00008714287,0.02772646,0.0002757059],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1991863,0.0002623451,0.7934836,0.0006188152,0.00232289,0.0001413552,1.505371e-7,0.0006274161,0.003357148],"genre_scores_gemma":[0.993618,0.000006719018,0.00382753,0.0008535485,0.000576321,0.00000650479,7.18399e-7,0.00001705399,0.001093652],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9624549,"threshold_uncertainty_score":0.9555625,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1999288870","doi":"10.1145/511334.511337","title":"Maximum likelihood network topology identification from edge-based unicast measurements","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":167,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Network tomography; Network topology; Computer science; Topology (electrical circuits); Unicast; Logical topology; Markov chain Monte Carlo; Identification (biology); Markov chain; Process (computing); Distributed computing; Computer network; Mathematics; Machine learning; Artificial intelligence; Multicast","retraction":null,"screen_n_in":null,"score":{"opus":0.03497306590581862,"gpt":0.2263673906572073,"spread":0.1913943247513887,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002991975,0.0001488294,0.0001693001,0.00004731428,0.0001691003,0.0001616701,0.0008565234,0.00009690218,0.0006458325],"category_scores_gemma":[0.00002195501,0.0001405042,0.0000735866,0.0003390078,0.00004575911,0.000224826,0.00007876544,0.0001240964,0.0009148681],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004199069,"about_ca_system_score_gemma":0.00002752702,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003545329,"about_ca_topic_score_gemma":0.0000791897,"domain_scores_codex":[0.9983565,0.0001542054,0.0003232658,0.0004727682,0.0003014707,0.0003918407],"domain_scores_gemma":[0.9987454,0.000117483,0.000113779,0.0007634403,0.0001268114,0.000133035],"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.000009904474,0.0001814431,0.001779374,0.000002120204,0.00005460732,0.000007785465,0.00006804516,0.003653174,0.0002372899,0.01368916,0.04991778,0.9303993],"study_design_scores_gemma":[0.001320296,0.00007198213,0.003164523,0.00001828014,0.00002914347,0.000002812143,0.0000090397,0.9549195,0.000219554,0.01636773,0.0235459,0.0003312684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001628215,0.0007701117,0.9786412,0.006540216,0.001528755,0.0001949721,0.000001584949,0.0004249022,0.01027009],"genre_scores_gemma":[0.9791945,0.00001701004,0.01740169,0.002254808,0.0004174881,0.00003084723,0.00000944216,0.000009539728,0.0006647007],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9775662,"threshold_uncertainty_score":0.999863,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2159743267","doi":"10.1109/tnet.2007.896507","title":"Distributed Rate Allocation for Inelastic Flows","year":2007,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":142,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Air Force Office of Scientific Research; Defense Advanced Research Projects Agency; California Institute of Technology; University of Toronto; Purdue University; Yonsei University; National Science Foundation","keywords":"Mathematical optimization; Computer science; Heuristics; Limit (mathematics); Maximization; Utility maximization; Rate of convergence; Provisioning; Utility maximization problem; Convergence (economics); Mathematical economics; Mathematics; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.02166859084377924,"gpt":0.2531395800328795,"spread":0.2314709891891003,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007974697,0.0002203919,0.0002046571,0.0001413377,0.0004613138,0.0001435659,0.0006579819,0.0001250712,0.000009588955],"category_scores_gemma":[0.0000210437,0.0002252445,0.000149461,0.0006808635,0.00002998853,0.0002628454,0.000005574946,0.0002525399,0.00003195457],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001022162,"about_ca_system_score_gemma":0.00006502528,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005117638,"about_ca_topic_score_gemma":0.0001123702,"domain_scores_codex":[0.9983025,0.00006501727,0.0003999658,0.0004704398,0.0002041179,0.0005579796],"domain_scores_gemma":[0.9979225,0.00105047,0.0001149112,0.0006156269,0.0001402123,0.0001563042],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007820316,0.00007547703,0.000009020078,0.000006785729,0.00004355637,0.000004598171,0.00006956494,0.2723538,0.0001923765,0.001491124,0.0003127629,0.7253627],"study_design_scores_gemma":[0.001100412,0.0001905646,0.0001879075,0.00007599926,0.00004934258,0.00001131138,0.00001712373,0.9702513,0.0005041828,0.001794326,0.02548935,0.0003282515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002290294,0.000104966,0.9916437,0.0009727375,0.003962386,0.0004507182,0.000008984761,0.0004625267,0.0001036927],"genre_scores_gemma":[0.9769107,0.00002487737,0.0214583,0.000484069,0.0008128597,0.0001002286,0.0000155286,0.00002236727,0.0001710926],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9746204,"threshold_uncertainty_score":0.9185204,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2167027757","doi":"10.1109/glocom.2003.1258975","title":"Speech quality prediction in VoIP using the extended E-model","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":133,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Voice over IP; Mean opinion score; Computer science; Jitter; Packet loss; Codec; Network packet; Quality (philosophy); Speech recognition; Quality of service; Computer network; The Internet; Real-time computing; Telecommunications; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.03939706469711466,"gpt":0.2974680440759093,"spread":0.2580709793787946,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004801097,0.00007037644,0.00008017356,0.00003426183,0.00008440475,0.0000631197,0.000360346,0.0000402077,0.000007575185],"category_scores_gemma":[0.00001194221,0.0000479521,0.00003477075,0.0002525583,0.00002715803,0.0002532907,0.00005921412,0.0001160292,0.00001501248],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006761416,"about_ca_system_score_gemma":0.0001052139,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002411771,"about_ca_topic_score_gemma":0.000236978,"domain_scores_codex":[0.9991796,0.00005723192,0.0001932775,0.000210424,0.0001885135,0.0001709707],"domain_scores_gemma":[0.9995257,0.0000374382,0.00003889925,0.0003262377,0.00003646928,0.00003527461],"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.000008840525,0.00008033379,0.0002124364,0.000002487717,0.000006295312,0.000005164294,0.0004643011,0.4397594,0.0004039253,0.3693382,0.00007634154,0.1896423],"study_design_scores_gemma":[0.000466727,0.00001120035,0.001729123,0.00000718186,0.000002032188,0.000008436706,0.00003090683,0.9747089,0.0000849539,0.02282701,0.00006155582,0.00006203471],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08719252,0.00003554864,0.907381,0.002622059,0.0001673746,0.0001194021,4.810273e-7,0.0001382744,0.002343332],"genre_scores_gemma":[0.970915,0.000002752837,0.02781837,0.0007271752,0.00006781273,0.000005882773,2.818615e-7,0.000002818747,0.0004599355],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8837224,"threshold_uncertainty_score":0.195543,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2050316560","doi":"10.1109/tmm.2009.2036294","title":"Impact of Network Dynamics on User's Video Quality: Analytical Framework and QoS Provision","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Multimedia","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":125,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Jitter; Network packet; Quality of service; FIFO (computing and electronics); Throughput; Computer network; Packet loss; Queue; Quality (philosophy); Video quality; Real-time computing; Queueing theory; Operating system; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01458557399586114,"gpt":0.3024400945836951,"spread":0.287854520587834,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003114069,0.0002396559,0.0003561812,0.0001401948,0.0001488333,0.00007819423,0.0003459122,0.0002055851,0.00002745348],"category_scores_gemma":[0.00002810903,0.000201413,0.0002149459,0.000501155,0.00008465003,0.0002201831,0.000002303263,0.0004880267,0.00002473722],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009933936,"about_ca_system_score_gemma":0.00008692699,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002802777,"about_ca_topic_score_gemma":0.00002303013,"domain_scores_codex":[0.9982486,0.0001463751,0.0004026542,0.0004572956,0.0003780373,0.0003670079],"domain_scores_gemma":[0.9981177,0.0008596672,0.0001217476,0.0005683433,0.00009220888,0.0002403251],"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.0001859772,0.0003578678,0.0001992037,0.000004355412,0.00006826322,0.000005619479,0.0001683241,0.1275403,0.0000219815,0.005344519,0.0002549526,0.8658486],"study_design_scores_gemma":[0.0007753817,0.001030334,0.01357587,0.0001008731,0.00003526675,0.000004900153,0.000008941825,0.9832265,0.0000405559,0.0009256005,0.00004759376,0.0002282076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05511289,0.00003998541,0.9426492,0.001025444,0.0005884026,0.0002849057,0.00001484148,0.0001665847,0.0001177664],"genre_scores_gemma":[0.977628,0.00004894367,0.02169923,0.0003257752,0.0001744235,0.00001075923,0.000002113383,0.0000111642,0.00009962133],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9225151,"threshold_uncertainty_score":0.8213382,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1598519330","doi":"10.1109/icc.2003.1203886","title":"Wireless traffic modeling and prediction using seasonal ARIMA models","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":123,"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":"Autoregressive integrated moving average; Computer science; GSM; Data modeling; Wireless; Time series; Computer network; Telecommunications; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.02408701842193299,"gpt":0.216448071007658,"spread":0.192361052585725,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001248038,0.0001047174,0.0001064535,0.00004459242,0.0001471834,0.0001333646,0.0001805797,0.0000562168,0.000002374368],"category_scores_gemma":[0.000001687222,0.00009697135,0.00003248901,0.000140077,0.00002276014,0.0006649221,0.00005334005,0.00009567691,0.000002853214],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004393279,"about_ca_system_score_gemma":0.00009750261,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001693282,"about_ca_topic_score_gemma":0.000008659206,"domain_scores_codex":[0.9991422,0.00001793919,0.0001463369,0.0003019889,0.0001873081,0.0002042764],"domain_scores_gemma":[0.9996391,0.00001543043,0.00002616269,0.000162658,0.00005463205,0.000102008],"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.000003600277,0.00001687595,0.000006091235,0.00000200386,0.000006411441,0.000002251631,0.0001086743,0.8141987,0.00003839397,0.07655602,0.000004675029,0.1090564],"study_design_scores_gemma":[0.0005856443,0.00002282554,0.000008600418,0.00002060372,0.000007891895,0.00003675905,0.00002049566,0.9938098,0.000009964856,0.005366536,0.000007181048,0.0001036527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3814452,0.0001158086,0.6176028,0.000264226,0.0001047789,0.0000593659,5.864571e-7,0.0001938675,0.0002133633],"genre_scores_gemma":[0.965614,0.00002212899,0.03403489,0.0001889261,0.00009943762,0.000004521462,9.252526e-7,0.000006218622,0.00002897856],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5841688,"threshold_uncertainty_score":0.3954377,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2155348805","doi":"10.1109/infcom.2003.1208917","title":"Bandwidth allocation in ad hoc networks: a price-based approach","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":122,"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; Bandwidth (computing); Bandwidth allocation; Network packet; Mathematical optimization; Iterative method; Computer network; Set (abstract data type); Channel allocation schemes; Wireless; Algorithm; Telecommunications; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01004168599621928,"gpt":0.2004057463697273,"spread":0.1903640603735081,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004365575,0.0001147021,0.0001272691,0.00008131818,0.00005119783,0.00009433422,0.0003516484,0.00006703337,0.00002789312],"category_scores_gemma":[0.00002265993,0.0001005816,0.00003975077,0.0006080367,0.00001899096,0.0002014509,0.00001809679,0.0001199505,0.00002289571],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004150195,"about_ca_system_score_gemma":0.0001122388,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002048926,"about_ca_topic_score_gemma":0.00001621668,"domain_scores_codex":[0.9988911,0.0001307341,0.0001951232,0.0003376962,0.0001621764,0.0002831793],"domain_scores_gemma":[0.9993751,0.00009101293,0.00004803786,0.0003604727,0.00004565857,0.00007968714],"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.00001482574,0.0002481516,0.0007976185,0.00000674444,0.000009678552,0.000005294819,0.0001144835,0.2844134,0.00000685867,0.2406975,0.001757347,0.471928],"study_design_scores_gemma":[0.0008241393,0.00003575856,0.0005703209,0.000008073169,0.000002183367,0.000002868518,0.00001260972,0.9845114,0.00001235707,0.0003172962,0.01356262,0.0001403983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.000922444,0.001076553,0.9796194,0.0005283417,0.0001731881,0.000222605,6.293106e-8,0.0001783108,0.01727911],"genre_scores_gemma":[0.9298088,0.00004009563,0.06834055,0.001086687,0.00002957143,0.0000638831,0.000002420568,0.000006045861,0.0006219634],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9288864,"threshold_uncertainty_score":0.4101597,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2136453240","doi":"10.1109/glocom.1999.832471","title":"Bandwidth assurance issues for TCP flows in a differentiated services network","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":116,"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 network; Differentiated services; Computer science; Throughput; Network packet; Bandwidth (computing); Differentiated service; Service (business); Telecommunications; Service provider; Business; Wireless","retraction":null,"screen_n_in":null,"score":{"opus":0.007654079166757839,"gpt":0.2258132274392229,"spread":0.218159148272465,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002724789,0.0001442452,0.0002140659,0.00004179382,0.0000848678,0.0001380398,0.0004486922,0.00006447633,0.0000623031],"category_scores_gemma":[0.00001263125,0.0001206746,0.0000605952,0.000368548,0.000009787216,0.000241703,0.00003041572,0.00007479369,0.00003626789],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001320603,"about_ca_system_score_gemma":0.00003384135,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002032052,"about_ca_topic_score_gemma":0.0005933294,"domain_scores_codex":[0.9988012,0.00009169988,0.0002339415,0.000347352,0.0001334154,0.0003924359],"domain_scores_gemma":[0.9993255,0.0001792042,0.00005284833,0.0003094901,0.00006241517,0.00007061045],"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.00008460445,0.0003239501,0.0178917,0.0001133034,0.0001056747,0.0000129596,0.0006786886,0.04638593,0.0001620888,0.6778495,0.02203273,0.2343589],"study_design_scores_gemma":[0.001607797,0.00006344959,0.003536397,0.00006774611,0.000006430565,0.000002457709,0.00001818453,0.9123114,0.00008454159,0.006524219,0.07549533,0.0002820854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03579471,0.001837464,0.9553617,0.001674818,0.000988738,0.0005381879,0.000001704932,0.0003574122,0.003445273],"genre_scores_gemma":[0.9593784,0.00005887996,0.03774493,0.0008003398,0.000127319,0.00009508686,0.000003714176,0.000009095489,0.001782235],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9235837,"threshold_uncertainty_score":0.4920967,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2106860967","doi":"10.1109/infcom.2004.1354575","title":"Multiple source, multiple destination network tomography","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":108,"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; National Science Foundation","keywords":"Network tomography; Network topology; Computer science; Topology (electrical circuits); Network packet; Synchronization (alternating current); Variance (accounting); Algorithm; Data mining; Distributed computing; Computer network; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.007518463221891531,"gpt":0.1911479843792994,"spread":0.1836295211574079,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002130087,0.0001464697,0.0001325277,0.00007797997,0.0002203055,0.0001416752,0.0005220768,0.00006763558,0.00001591962],"category_scores_gemma":[0.00005344494,0.0001328211,0.0000977466,0.0006632407,0.00003888854,0.0003489637,0.00009363393,0.0001162191,0.0001208729],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002928222,"about_ca_system_score_gemma":0.00004792162,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004786756,"about_ca_topic_score_gemma":0.0001601331,"domain_scores_codex":[0.9987823,0.000040316,0.0002093629,0.0003563957,0.0002292517,0.0003823126],"domain_scores_gemma":[0.9991168,0.0002033175,0.00006864974,0.0003843249,0.00009554297,0.0001313288],"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.00001184488,0.0001040995,0.01723792,0.000003348666,0.00002359068,0.00000864124,0.0001498687,0.2495595,0.00005323592,0.08794156,0.002028167,0.6428782],"study_design_scores_gemma":[0.003183377,0.0001310152,0.02053359,0.00003714406,0.00001191811,0.00002556476,0.00002259264,0.9372542,0.0002315251,0.00920767,0.02889558,0.0004658282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01749659,0.0001698822,0.9773402,0.001047249,0.000452853,0.0002056304,3.498012e-7,0.0008284805,0.002458722],"genre_scores_gemma":[0.8952233,0.00000634611,0.1032789,0.0008246491,0.0002628198,0.00003025355,0.000003105867,0.000009074973,0.0003615482],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8777267,"threshold_uncertainty_score":0.5416287,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W196807934","doi":"10.1007/0-387-27727-7_1","title":"Web Workload Characterization: Ten Years Later","year":2005,"lang":"en","type":"book-chapter","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":107,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Workload; Scripting language; World Wide Web; Computer science; The Internet; Web application; Web server; Server; Web development; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.009033757645429288,"gpt":0.1914611711647771,"spread":0.1824274135193478,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00009441217,0.0002773018,0.0002867125,0.0001183664,0.00005500649,0.0002084677,0.0007686206,0.0002937032,0.002169605],"category_scores_gemma":[0.00000174398,0.0002584447,0.0001355482,0.00004731182,0.00003881214,0.0002503956,0.0001682999,0.0002822634,0.003201185],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003824755,"about_ca_system_score_gemma":0.0001053703,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.83131e-7,"about_ca_topic_score_gemma":0.000006546898,"domain_scores_codex":[0.9986336,0.00001201371,0.0003000208,0.0005021115,0.0002969155,0.0002552921],"domain_scores_gemma":[0.9990078,0.00003291103,0.0001384858,0.0006249881,0.00007468778,0.0001211387],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000002733128,0.000005922304,0.000005083715,0.000001944804,0.00003325483,0.00002487564,0.00002020234,0.00001099351,0.00000926884,0.1913529,0.00430506,0.8042277],"study_design_scores_gemma":[0.0002649057,0.00002214285,0.0001798434,0.00007808321,0.00001715973,0.00001541103,2.506591e-7,0.01455908,0.000001632532,0.0009087336,0.9835838,0.0003689769],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.00002253794,0.0004189661,0.07035559,0.003448014,0.001043465,0.0002617755,0.000008900493,0.0007082167,0.9237325],"genre_scores_gemma":[0.006748314,0.0003949725,0.00236456,0.002533591,0.001330486,0.00001136494,0.00002792655,0.00003396685,0.9865548],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.9792787,"threshold_uncertainty_score":0.9999868,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2108169811","doi":"10.1109/tmm.2005.843360","title":"Performance analysis of TCP-friendly AIMD algorithms for multimedia applications","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Multimedia","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":105,"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; Algorithm; Environmentally friendly; Computer network; Distributed computing","retraction":null,"screen_n_in":null,"score":{"opus":0.01372683371030007,"gpt":0.2554394679309254,"spread":0.2417126342206254,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002364579,0.0002197131,0.0003751405,0.0005137029,0.0002261058,0.00003741773,0.0006556594,0.0001238069,0.00007499569],"category_scores_gemma":[0.000005710591,0.0002159783,0.0003444366,0.00137029,0.000103239,0.0003668065,0.000002601071,0.00019502,0.00008715916],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000618574,"about_ca_system_score_gemma":0.0000839799,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001101856,"about_ca_topic_score_gemma":0.00006385606,"domain_scores_codex":[0.9983001,0.00003833423,0.0004743085,0.0005006354,0.0003296561,0.0003570034],"domain_scores_gemma":[0.9982151,0.000529197,0.000159621,0.0006782446,0.0002377774,0.0001800899],"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.00002216843,0.0002555416,0.00002040372,0.000007359674,0.0003091519,2.0395e-7,0.0002856254,0.1670099,0.0002276006,0.00006695605,0.00012268,0.8316724],"study_design_scores_gemma":[0.0009987765,0.0001205805,0.0003836644,0.000008954966,0.0004224072,0.0000013135,0.00001915513,0.9871463,0.00385486,0.000005440586,0.006820732,0.0002177755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003259832,0.00006776533,0.9946141,0.0004938761,0.0003882642,0.0006776669,0.00009778795,0.0002318652,0.0001687885],"genre_scores_gemma":[0.7474286,0.00006654397,0.2510651,0.0001287608,0.0001414925,0.0006811976,0.0000140281,0.00001423845,0.0004600809],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8314546,"threshold_uncertainty_score":0.8807341,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2162932658","doi":"10.1109/tnet.2005.852881","title":"Load balancing for parallel forwarding","year":2005,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":104,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Load balancing (electrical power); Scheduling (production processes); Distributed computing; Computer network; The Internet; Network packet; Hash function; Packet forwarding; Workload; Internet traffic; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.02064640572757671,"gpt":0.2499197595625509,"spread":0.2292733538349742,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004784904,0.0002521768,0.0002704473,0.0001077189,0.0006014961,0.0002084822,0.0008428274,0.0001227158,0.0000178508],"category_scores_gemma":[0.00001051816,0.0002591509,0.0002573422,0.0003845891,0.00002850459,0.0004487232,0.000008377041,0.0002947242,0.00006059827],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002006435,"about_ca_system_score_gemma":0.000107544,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005468301,"about_ca_topic_score_gemma":0.00007550932,"domain_scores_codex":[0.9980413,0.00005426899,0.0003705835,0.0005534207,0.0003354808,0.000644942],"domain_scores_gemma":[0.9983834,0.0005250028,0.0001103883,0.0007165333,0.0001098149,0.0001548634],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000259607,0.00003727255,0.000009387561,0.000004548424,0.00003772972,0.000001698549,0.0001313859,0.3377772,0.00003087108,0.0009908938,0.00088024,0.6600729],"study_design_scores_gemma":[0.001148508,0.00009040957,0.00001682051,0.0000925164,0.00003653689,0.0000178777,0.00001767461,0.8733096,0.0001608536,0.001117404,0.1236596,0.0003322164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0005752668,0.000425672,0.9918877,0.002800095,0.002545813,0.0004151366,0.000002751901,0.0005496246,0.0007978985],"genre_scores_gemma":[0.8734871,0.00008544732,0.1226195,0.001194772,0.001682739,0.000186682,0.000001242702,0.00002785722,0.0007146511],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8729119,"threshold_uncertainty_score":0.9999861,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2143506299","doi":"10.1145/633025.633048","title":"Route oscillations in I-BGP with route reflection","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":100,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Bell (Canada)","funders":"","keywords":"Border Gateway Protocol; Computer science; Reflection (computer programming); Computer network; Default-free zone; Protocol (science); Routing protocol; Routing (electronic design automation); Distributed computing; Medicine; Dynamic Source Routing","retraction":null,"screen_n_in":null,"score":{"opus":0.01792107238593472,"gpt":0.202857104726347,"spread":0.1849360323404123,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008345453,0.00007830324,0.0000839486,0.00008571395,0.00007643976,0.00008969617,0.0002056586,0.00003463082,0.00009130785],"category_scores_gemma":[0.000005447707,0.00006170337,0.0000202607,0.0005611872,0.00001557186,0.0003756908,0.00002521783,0.00009047792,0.0001256374],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004775214,"about_ca_system_score_gemma":0.00001679367,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004299007,"about_ca_topic_score_gemma":0.0006688925,"domain_scores_codex":[0.9992825,0.00003345126,0.0001281394,0.0002332406,0.0001433737,0.0001792322],"domain_scores_gemma":[0.9995863,0.00003925451,0.00003208797,0.0002519748,0.00003911585,0.00005119593],"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.000009725845,0.00009743901,0.01050227,0.00000216162,0.00001659156,0.00002153039,0.0005079666,0.01885192,0.00004108,0.1623163,0.004459308,0.8031737],"study_design_scores_gemma":[0.0006296908,0.00006710811,0.01157738,0.00001154266,0.000003318085,0.00001999894,0.00001233813,0.9687288,0.00001304202,0.0004727205,0.01831374,0.0001503042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02350067,0.0001075827,0.8621645,0.006301856,0.0002690888,0.000188206,4.962203e-7,0.0004464158,0.1070212],"genre_scores_gemma":[0.9793314,0.0000143884,0.01225393,0.0004430718,0.00005977854,0.00001564308,4.868995e-7,0.00000408734,0.007877271],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9558307,"threshold_uncertainty_score":0.251619,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2141992945","doi":"10.1109/glocom.1996.591988","title":"Feasibility of fluid event-driven simulation for ATM networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":94,"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; Discrete event simulation; Markov chain; Bandwidth (computing); Asynchronous Transfer Mode; Markov process; Simulation; Distributed computing; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.04210811825454394,"gpt":0.2776287114664875,"spread":0.2355205932119436,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001601806,0.00007594362,0.0001272845,0.00002189206,0.0000563592,0.00002610205,0.0002857563,0.00005179092,0.00007996494],"category_scores_gemma":[0.00002973676,0.00006654951,0.00009356313,0.000151578,0.00002079748,0.0001860331,0.00003740401,0.00003915713,0.00001023231],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001803277,"about_ca_system_score_gemma":0.000007454905,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001619896,"about_ca_topic_score_gemma":0.000005767683,"domain_scores_codex":[0.9992304,0.00003734828,0.0002321304,0.0002247495,0.000113288,0.0001621108],"domain_scores_gemma":[0.9991648,0.0002717272,0.00007318817,0.0003320535,0.00010575,0.00005249996],"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.00001266024,0.00005689649,0.0008618254,0.000003699497,0.000008985613,2.108155e-7,0.00004060099,0.7788085,0.00001525777,0.0176118,0.001688981,0.2008906],"study_design_scores_gemma":[0.0008433463,0.00006959391,0.0006616856,0.000005068301,0.000005734035,4.162177e-7,0.000002293579,0.9970759,0.00001330695,0.0004488764,0.0008004823,0.00007331315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006057587,0.0001447821,0.9918271,0.0004227418,0.0002310309,0.0003940756,8.506555e-7,0.0001111867,0.000810671],"genre_scores_gemma":[0.9879371,0.000006987839,0.01117628,0.0001693023,0.0001032845,0.00001821855,0.000001384509,0.000003798646,0.0005836292],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9818795,"threshold_uncertainty_score":0.271381,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2773740107","doi":"10.17487/rfc2884","title":"Performance Evaluation of Explicit Congestion Notification (ECN) in IP Networks","year":2000,"lang":"en","type":"report","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":92,"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":"Explicit Congestion Notification; Computer science; Computer network; Network congestion; Slow-start","retraction":null,"screen_n_in":null,"score":{"opus":0.05427740368329733,"gpt":0.2902547687433616,"spread":0.2359773650600643,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003775349,0.0002807394,0.0004695701,0.0003190807,0.0000554226,0.00006645313,0.0006937665,0.0004267113,0.0002244999],"category_scores_gemma":[0.00008550782,0.0002715799,0.0001026603,0.0006477203,0.0000353481,0.000419616,0.00005624203,0.0003930416,0.00003974082],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004026727,"about_ca_system_score_gemma":0.001263537,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001147429,"about_ca_topic_score_gemma":0.0001175288,"domain_scores_codex":[0.9961764,0.0002628496,0.0009148427,0.0006492421,0.001684659,0.0003120214],"domain_scores_gemma":[0.9973746,0.0001438237,0.0005332626,0.0008672416,0.001012456,0.00006864702],"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.00001156326,0.00005259311,0.0006955764,0.00002002469,0.00001635886,7.505525e-7,0.00005311676,0.1335217,0.000001671564,0.0008981349,0.00166831,0.8630602],"study_design_scores_gemma":[0.0005348829,0.00005711602,0.0284184,0.0002582009,0.00006062828,0.00001081523,0.000006856762,0.9663746,0.00001341363,0.00005246516,0.003947465,0.0002651099],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1567562,0.007873655,0.4021527,0.001049773,0.008003106,0.005080929,0.00001178175,0.0008849414,0.4181868],"genre_scores_gemma":[0.9940276,0.002690521,0.00056459,0.00004585734,0.0003671407,0.0002215331,0.00008620547,0.00001852418,0.001978101],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8627951,"threshold_uncertainty_score":0.9999737,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2073410927","doi":"10.1145/1452520.1452545","title":"Experimental study of router buffer sizing","year":2008,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":90,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"University of Toronto","funders":"","keywords":"Sizing; Router; Computer network; Computer science; Backbone network; Network packet; Packet loss; Throughput; Buffer (optical fiber); The Internet; Telecommunications; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.02382756225994257,"gpt":0.2387430955186314,"spread":0.2149155332586888,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004980724,0.00006050993,0.00009774618,0.00002722862,0.00006071697,0.00001320956,0.0002905143,0.00001534606,0.00004641328],"category_scores_gemma":[0.000001830274,0.0000487578,0.00002728344,0.0001002681,0.00001676753,0.0001634839,0.00008329346,0.00003635903,0.0000239201],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007913498,"about_ca_system_score_gemma":0.00001413496,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002231509,"about_ca_topic_score_gemma":0.000003130334,"domain_scores_codex":[0.9994136,0.0000296085,0.0001317574,0.0001613486,0.0001575664,0.0001061268],"domain_scores_gemma":[0.9996383,0.00003045582,0.00002843554,0.0002393421,0.0000266652,0.00003676741],"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.0001701778,0.02183326,0.08582564,0.000013876,0.0004937159,0.0005989693,0.09139021,0.005627158,0.01547833,0.1868094,0.02226132,0.5694979],"study_design_scores_gemma":[0.01833164,0.008475334,0.0785147,0.00004339981,0.00004214628,0.0003099187,0.009052756,0.8263017,0.04936081,0.0002773326,0.00747396,0.001816338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8806431,0.0001096964,0.1148457,0.00008394787,0.0001750369,0.0001226593,4.899142e-8,0.0001020431,0.003917845],"genre_scores_gemma":[0.9964429,0.000001050642,0.00260239,0.0001674779,0.00004271994,0.00001051568,7.336567e-8,0.000002698906,0.0007302366],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8206745,"threshold_uncertainty_score":0.1988285,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2765444119","doi":"10.1016/j.isatra.2017.10.004","title":"Adaptive backstepping H∞ tracking control with prescribed performance for internet congestion","year":2017,"lang":"en","type":"article","venue":"ISA Transactions","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":86,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Lakehead University","funders":"China Scholarship Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Active queue management; Backstepping; Network congestion; Control theory (sociology); Computer science; Transient (computer programming); Tracking error; Queue; Controller (irrigation); Transmission Control Protocol; Packet loss; Adaptive control; Network packet; Control (management); Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.02677749278496168,"gpt":0.2346270701720457,"spread":0.207849577387084,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001856526,0.0001660884,0.000195898,0.00005520048,0.0007064284,0.0004147397,0.0006437734,0.00007078117,0.00001922209],"category_scores_gemma":[0.00001315562,0.0001468396,0.0000851001,0.00005658321,0.0001058588,0.001311491,0.000006860605,0.0001796141,0.00001536923],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004085365,"about_ca_system_score_gemma":0.00007204319,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002793778,"about_ca_topic_score_gemma":0.0001427723,"domain_scores_codex":[0.9989491,0.00003408483,0.0001907805,0.0003622094,0.0001612301,0.0003025911],"domain_scores_gemma":[0.9988981,0.0001556502,0.0001564277,0.0004952649,0.0001999962,0.00009455415],"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.0003552701,0.00008835681,0.0003592759,0.00002247841,0.0001816106,0.000004805866,0.0007827243,0.02247457,0.0001361021,0.0112478,0.0001765097,0.9641705],"study_design_scores_gemma":[0.003172942,0.0003957505,0.005924059,0.0001370486,0.00008441909,0.00002485558,0.00003922147,0.9856864,0.0004097958,0.00009208576,0.003769471,0.0002639708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007125831,0.00006657575,0.9891033,0.001563517,0.0005310942,0.0005603211,0.00001143025,0.0002062596,0.0008317168],"genre_scores_gemma":[0.9882619,0.0000119534,0.0103251,0.0001493508,0.0001173057,0.0002281034,0.000001654051,0.00001413063,0.0008904757],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9811361,"threshold_uncertainty_score":0.5987945,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2108863067","doi":"10.1145/1272996.1273021","title":"Comparing the performance of web server architectures","year":2007,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":84,"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; Operating system; Server; Thread (computing); Web server; Architecture; Application server; Server farm; Client–server model; The Internet","retraction":null,"screen_n_in":null,"score":{"opus":0.01242480548305661,"gpt":0.2153264032283625,"spread":0.2029015977453059,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003918638,0.00005029125,0.00007075367,0.00002599575,0.00006226437,0.00002094962,0.0005171673,0.00001518112,0.00001322114],"category_scores_gemma":[0.000003581305,0.00002901772,0.00003003938,0.0001557584,0.00003671271,0.00004656446,0.00007615578,0.00007798185,0.00001311431],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004426437,"about_ca_system_score_gemma":0.0000186762,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006338716,"about_ca_topic_score_gemma":0.00006616371,"domain_scores_codex":[0.9994813,0.00001568154,0.0001251859,0.00009502724,0.0001383195,0.000144442],"domain_scores_gemma":[0.9995342,0.0001116185,0.00003717997,0.0002589346,0.00003014609,0.00002789736],"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.00003392736,0.00004827345,0.08290216,0.00001643075,0.00003506835,0.000003094113,0.0005895999,0.03271759,0.0004717516,0.1797044,0.001033796,0.7024439],"study_design_scores_gemma":[0.000241962,0.00003768357,0.07710365,0.000009836554,0.000002717898,0.000008334359,0.00001335884,0.9187029,0.001383255,0.0001072398,0.002320876,0.00006818692],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8713734,0.00007545303,0.1188797,0.0004043655,0.0001279301,0.00004997649,3.398142e-8,0.00006819506,0.009020964],"genre_scores_gemma":[0.9971583,0.000002987794,0.00209414,0.0003364005,0.00005428361,0.000001187113,6.922806e-8,0.000001760059,0.0003508273],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8859853,"threshold_uncertainty_score":0.1183308,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2101917791","doi":"10.1007/3-540-45551-5_46","title":"Intelligent Traffic Conditioners for Assured Forwarding Based Differentiated Services Networks","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Computer science; Bandwidth (computing); Computer network; Enhanced Data Rates for GSM Evolution; Conditioners; Intelligent Network; Service (business); Telecommunications; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01109782146976253,"gpt":0.2249901650555645,"spread":0.213892343585802,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006743124,0.000692415,0.0007385965,0.0006959079,0.0004331091,0.0008098487,0.002805847,0.0004667171,0.00006506684],"category_scores_gemma":[0.00001537265,0.0006477825,0.0003166729,0.0005656327,0.0003630562,0.0004370291,0.0002448118,0.0006605627,0.00002166648],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000231956,"about_ca_system_score_gemma":0.0003469805,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005361439,"about_ca_topic_score_gemma":0.00006569536,"domain_scores_codex":[0.9958861,0.00005442519,0.0007073222,0.001670982,0.0007631298,0.0009180011],"domain_scores_gemma":[0.9972155,0.0008552771,0.0003544144,0.001036841,0.0002803759,0.0002576036],"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.00001569716,0.00001910507,0.000002982769,0.0000219625,0.00002032914,0.000009483555,0.00006640273,0.519168,0.000002747018,0.003248889,0.0000201284,0.4774042],"study_design_scores_gemma":[0.0006973114,0.0001721784,0.00001729197,0.0004572796,0.00003764029,0.00001143422,1.630027e-7,0.981155,0.0000555939,0.01323926,0.003462875,0.0006939408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0001123378,0.0005837368,0.9947127,0.0005743423,0.002243794,0.0009434879,0.00001463228,0.0004067726,0.0004082727],"genre_scores_gemma":[0.9234017,0.0000590126,0.07262296,0.00269584,0.0008214741,0.00008104798,0.00009821534,0.00006341509,0.0001563947],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9232893,"threshold_uncertainty_score":0.9995974,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W198328412","doi":"","title":"Trickle: rate limiting YouTube video streaming","year":2012,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":83,"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; TRICKLE; Computer network; Network congestion; TCP Friendly Rate Control; TCP Westwood plus; Queue; Network packet; Real-time computing; Router; Limiting; Engineering; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.0158071323304731,"gpt":0.2241551543110969,"spread":0.2083480219806238,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004692495,0.0001039591,0.0001112265,0.00005025628,0.0001220929,0.0001179202,0.0003674678,0.00003174546,0.00006328423],"category_scores_gemma":[0.00005278694,0.00008583531,0.00005047592,0.0002731415,0.00001388776,0.0007390543,0.0001011192,0.00009664812,0.000235958],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001951613,"about_ca_system_score_gemma":0.00002633559,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007230345,"about_ca_topic_score_gemma":0.000002299362,"domain_scores_codex":[0.9990259,0.00007183318,0.0001689533,0.0001877584,0.0001303446,0.0004152517],"domain_scores_gemma":[0.9992324,0.0002347166,0.00005000287,0.0002850458,0.00004448249,0.0001533913],"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.000002085628,0.00003361021,0.002853785,0.000001951556,0.00001144885,0.000003166903,0.0002287214,0.0001115855,0.00008784684,0.1124473,0.001894846,0.8823236],"study_design_scores_gemma":[0.001929691,0.0001177877,0.01993237,0.00005099107,0.00004273801,0.00007713829,0.0004165591,0.8925154,0.001556468,0.0009054905,0.08149028,0.0009651303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03985787,0.0005160355,0.9198083,0.001329451,0.0009338006,0.0001120679,3.650239e-7,0.0005757598,0.03686641],"genre_scores_gemma":[0.9857498,0.00001064657,0.01072959,0.0009668082,0.0004529278,0.000009934141,7.009605e-7,0.000006150272,0.002073382],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.945892,"threshold_uncertainty_score":0.3500262,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2097247867","doi":"10.1109/glocom.1999.830189","title":"Differentiated services on Linux","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","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":"Nortel (Canada)","funders":"","keywords":"Computer science; Operating system; Modular design; Variety (cybernetics); Linux kernel; Linux Unified Key Setup; Control (management); Differentiated services; Embedded system; The Internet","retraction":null,"screen_n_in":null,"score":{"opus":0.005572579569756598,"gpt":0.1899110524645111,"spread":0.1843384728947545,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006273709,0.0000716178,0.00006817412,0.00002865411,0.00005566873,0.00008597618,0.000293195,0.0000296247,0.0001380284],"category_scores_gemma":[0.000003177545,0.00005384794,0.00002909553,0.0001376673,0.000006299772,0.00009502003,0.00001836574,0.00005537928,0.00036757],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006012986,"about_ca_system_score_gemma":0.00001290988,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002624532,"about_ca_topic_score_gemma":0.000008727709,"domain_scores_codex":[0.9994304,0.00004316488,0.00008246428,0.000185268,0.0001137972,0.0001448838],"domain_scores_gemma":[0.9995878,0.00004359904,0.0000212823,0.0002619223,0.00002706133,0.00005837435],"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.000002486724,0.00005950705,0.0003232655,0.0000025278,0.00001144608,0.000003960458,0.00005541204,0.0002152183,0.00003585801,0.8723512,0.0008105466,0.1261286],"study_design_scores_gemma":[0.002591515,0.0003576129,0.008064108,0.00005918542,0.00001788486,0.00001826551,0.00006140163,0.8309425,0.002914817,0.01552398,0.1386961,0.0007527351],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1008466,0.0001385159,0.7457194,0.001421995,0.001051612,0.0001605411,3.852639e-7,0.0008643874,0.1497965],"genre_scores_gemma":[0.9934398,0.000005014896,0.002071701,0.00159142,0.00002651039,0.000005175545,5.356789e-7,0.000002948119,0.002856875],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8925931,"threshold_uncertainty_score":0.4724492,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2013174072","doi":"10.1109/tnet.2003.818196","title":"Priority service and max-min fairness","year":2003,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Game theory; Computer network; Nash equilibrium; Bandwidth allocation; Bandwidth (computing); Max-min fairness; Service (business); Quality of service; Mathematical optimization; Resource allocation; Microeconomics","retraction":null,"screen_n_in":null,"score":{"opus":0.0188926864910351,"gpt":0.2288178971658632,"spread":0.2099252106748281,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000375127,0.0002357415,0.0002291283,0.0000990819,0.000465466,0.0002134099,0.0005491894,0.0001277635,0.00002623481],"category_scores_gemma":[0.000006547084,0.0002414056,0.00007518913,0.0007152979,0.00003991565,0.0003263507,0.000008124863,0.0003756019,0.00004186707],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004647283,"about_ca_system_score_gemma":0.00007337859,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001804589,"about_ca_topic_score_gemma":0.0001339163,"domain_scores_codex":[0.9983053,0.0001753988,0.0002650124,0.0005448545,0.0002602327,0.0004492336],"domain_scores_gemma":[0.998639,0.000295177,0.00007765984,0.0007277308,0.00008391392,0.0001765467],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001850973,0.0001017328,0.0001478298,0.00001670431,0.00004952776,0.00001806331,0.0003747496,0.02570246,0.00005918173,0.007032047,0.0001388092,0.9663404],"study_design_scores_gemma":[0.004186928,0.0003352147,0.001314542,0.0004122684,0.0001783671,0.0003584476,0.0002286896,0.7753425,0.00119473,0.01576429,0.1987786,0.001905394],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01043478,0.0004365726,0.9835333,0.001291821,0.002474558,0.000230625,0.000001522363,0.0003624087,0.001234472],"genre_scores_gemma":[0.9857188,0.0001344662,0.01238621,0.001147228,0.0002249074,0.0000421905,5.575026e-7,0.00001896617,0.0003267154],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.975284,"threshold_uncertainty_score":0.9844236,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2016840637","doi":"10.1016/s0166-5316(99)00070-x","title":"Use of α-stable self-similar stochastic processes for modeling traffic in broadband networks","year":2000,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa; Western University","funders":"","keywords":"Burstiness; Self-similarity; Computer science; Traffic generation model; Queue; Aggregate (composite); Range (aeronautics); Queueing theory; Marginal distribution; Real-time computing; Network packet; Mathematics; Statistics; Computer network; Random variable","retraction":null,"screen_n_in":null,"score":{"opus":0.04134902406865253,"gpt":0.2602165361400509,"spread":0.2188675120713984,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000844694,0.0001201593,0.0001725788,0.00009246811,0.00009556391,0.00006958151,0.0002324674,0.00006344765,0.00002320293],"category_scores_gemma":[0.00005332341,0.0001175762,0.00003148567,0.0004760153,0.00001322088,0.001055878,0.00001248885,0.00008366854,0.000003604084],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005596699,"about_ca_system_score_gemma":0.0002265708,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003778923,"about_ca_topic_score_gemma":0.00002627502,"domain_scores_codex":[0.9988252,0.00005040631,0.0003377441,0.0002733881,0.0002504675,0.000262784],"domain_scores_gemma":[0.9991738,0.0001480758,0.00008370965,0.0002225765,0.0003339267,0.00003789871],"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.00003254035,0.00003724568,0.00006184691,0.00002190506,0.000004915186,3.380035e-8,0.0002280873,0.6418568,0.000001699957,0.00003377012,0.00002791776,0.3576932],"study_design_scores_gemma":[0.0008523263,0.0000933629,0.0002893684,0.00008837206,0.00002638063,0.0000014296,0.000005429943,0.9983577,0.000009496345,0.00007406808,0.00007329938,0.0001288025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5413751,0.0003915775,0.4574732,0.00009006749,0.00008042746,0.0005066922,8.30424e-7,0.00006048912,0.00002155173],"genre_scores_gemma":[0.9931542,0.000162695,0.006265393,0.00005359953,0.00008265108,0.0002154118,0.00001095364,0.000008902746,0.00004618306],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4517791,"threshold_uncertainty_score":0.4794619,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2115663543","doi":"10.1109/tsmcb.2009.2032363","title":"Random Early Detection for Congestion Avoidance in Wired Networks: A Discretized Pursuit Learning-Automata-Like Solution","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":80,"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":"Random early detection; Learning automata; Queue; Computer science; Active queue management; Network congestion; Packet loss; Network packet; Discretization; Mathematical optimization; Computer network; Automaton; Mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01052042621077978,"gpt":0.2161661643263207,"spread":0.205645738115541,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008971164,0.0004875674,0.0006404754,0.0002917979,0.0004331903,0.0005777357,0.0004794129,0.0003571203,0.000005338989],"category_scores_gemma":[0.00001979756,0.0005054264,0.0001988173,0.0005207755,0.0001295113,0.000360205,0.000006630903,0.000528688,0.00002332254],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001454854,"about_ca_system_score_gemma":0.00005349788,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001057746,"about_ca_topic_score_gemma":0.0003223049,"domain_scores_codex":[0.9964752,0.0004569649,0.0008698304,0.0009261321,0.0005251591,0.0007467247],"domain_scores_gemma":[0.9982063,0.0004241446,0.000332458,0.000569843,0.0001928388,0.0002743946],"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.001084664,0.0004608596,0.00006851109,0.00006027796,0.0001144739,0.00001679012,0.0008094138,0.4536445,0.0007827473,0.003404837,0.0005837032,0.5389692],"study_design_scores_gemma":[0.006987603,0.001198577,0.001375957,0.0002975783,0.00009758354,0.00004578606,0.00005184727,0.9803876,0.0002346105,0.0002836407,0.008436831,0.0006023697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03091649,0.0009612512,0.9629928,0.0005837673,0.002120038,0.001661254,0.00001021098,0.0004965938,0.0002576093],"genre_scores_gemma":[0.9950099,0.0007598667,0.0006675099,0.0001637201,0.0002591302,0.0004323421,0.000008687925,0.00004005188,0.002658797],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9640934,"threshold_uncertainty_score":0.9997397,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1979865356","doi":"10.1002/nem.421","title":"An adaptive load balancing scheme for web servers","year":2002,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":72,"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; Server; Round-robin DNS; Web server; Scheme (mathematics); Load balancing (electrical power); Computer network; Client–server model; Process (computing); Control (management); Distributed computing; World Wide Web; Operating system; The Internet; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01618493320392848,"gpt":0.2421719836117736,"spread":0.2259870504078451,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005368168,0.0001162775,0.0001497827,0.00009783621,0.00006852065,0.0001839246,0.001316633,0.00003084868,0.00005420403],"category_scores_gemma":[0.000009135045,0.0001081575,0.0001360244,0.0001431591,0.00001691243,0.0006003659,0.00009837125,0.0001131717,0.00001841175],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001700282,"about_ca_system_score_gemma":0.00002633471,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.375168e-7,"about_ca_topic_score_gemma":0.000004757865,"domain_scores_codex":[0.9985339,0.00004416129,0.000378596,0.0001861954,0.0006284254,0.000228714],"domain_scores_gemma":[0.9987941,0.00007748695,0.0003191105,0.0001859695,0.0005190801,0.0001042299],"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.0001474978,0.0001777854,0.0003316449,0.000005806833,0.0006912829,0.0001980033,0.0001481011,0.1207913,0.0000183648,0.1241822,0.08132181,0.6719862],"study_design_scores_gemma":[0.001436087,0.0002531399,0.0004156105,0.00008486036,0.00002330867,0.00003864731,0.00003959245,0.9047091,0.000002482368,0.002127204,0.09074252,0.0001274727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003311512,0.0006343148,0.9843164,0.003417915,0.003470581,0.0001986154,0.000001865358,0.00005762383,0.004591173],"genre_scores_gemma":[0.8953578,0.0001599618,0.1010805,0.001258861,0.001625033,0.00001099586,9.680065e-7,0.000008915334,0.0004969894],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8920463,"threshold_uncertainty_score":0.4410536,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3012290046","doi":"10.1145/511399.511337","title":"Maximum likelihood network topology identification from edge-based unicast measurements","year":2002,"lang":"en","type":"article","venue":"ACM SIGMETRICS Performance Evaluation Review","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Network tomography; Network topology; Topology (electrical circuits); Computer science; Unicast; Markov chain Monte Carlo; Logical topology; Identification (biology); Markov chain; Process (computing); Algorithm; Distributed computing; Mathematics; Computer network; Machine learning; Artificial intelligence; Multicast","retraction":null,"screen_n_in":null,"score":{"opus":0.1049826747153926,"gpt":0.3029572159233934,"spread":0.1979745412080008,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00430089,0.0002590806,0.0004173662,0.0002241305,0.0002990834,0.0001501591,0.001780277,0.0001203742,0.0008767406],"category_scores_gemma":[0.00139906,0.0002477912,0.0001361271,0.003031647,0.00004670944,0.0006340234,0.0001743652,0.0002433835,0.001179443],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000194002,"about_ca_system_score_gemma":0.0001323045,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005331585,"about_ca_topic_score_gemma":0.000004803386,"domain_scores_codex":[0.996022,0.0005836976,0.0008774746,0.0006651164,0.0013744,0.0004772736],"domain_scores_gemma":[0.996077,0.0004283205,0.0005474997,0.001874137,0.0009206791,0.0001523511],"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.000002561427,0.00007473186,0.001791262,0.00007491952,0.00002894176,5.382713e-7,0.00001603315,0.002529981,0.00000934519,0.0001617365,0.01550119,0.9798087],"study_design_scores_gemma":[0.001089435,0.0001084052,0.006803147,0.0007074084,0.0002318042,0.000002972477,0.000001667258,0.9549492,0.00004117612,0.001474929,0.03421466,0.0003752107],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"review","genre_gemma":"empirical","genre_scores_codex":[0.00899368,0.5096775,0.4516567,0.01682748,0.004872767,0.003495979,0.000008714425,0.0005993433,0.003867799],"genre_scores_gemma":[0.9157757,0.05758513,0.0184397,0.006939875,0.0005604096,0.000455285,0.0001092413,0.00002692265,0.0001077044],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9794335,"threshold_uncertainty_score":0.9999974,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2107631978","doi":"10.1109/tnet.2009.2035115","title":"A System-Theoretic Approach to Bandwidth Estimation","year":2009,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Network calculus; Computer science; Bandwidth (computing); Network packet; Nonlinear system; Testbed; Robustness (evolution); Algorithm; Computer network; Quality of service","retraction":null,"screen_n_in":null,"score":{"opus":0.01373783591961571,"gpt":0.2264381860413313,"spread":0.2127003501217156,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004033709,0.0002595398,0.0002735988,0.000214815,0.0004290661,0.000267162,0.0009168689,0.0001143735,0.000005046729],"category_scores_gemma":[0.000005878441,0.0002531426,0.0001375101,0.0009270152,0.00002636943,0.0002690155,0.000005304452,0.0002965773,0.0001053376],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001371715,"about_ca_system_score_gemma":0.00005036959,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003687599,"about_ca_topic_score_gemma":0.000002529903,"domain_scores_codex":[0.9980305,0.0001343063,0.0003553605,0.0005936073,0.0003914304,0.0004948104],"domain_scores_gemma":[0.9985192,0.0001746984,0.00008795746,0.000929163,0.00006296521,0.000225988],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001691792,0.00007937339,0.000001310696,0.000007220189,0.00001358886,0.000003540779,0.0002365738,0.4361868,0.00001365649,0.01693634,0.0001787849,0.5463259],"study_design_scores_gemma":[0.0004684329,0.0001915362,0.00004150952,0.0001621637,0.00003374559,0.00004926818,0.00003228314,0.9954495,0.0000811167,0.001883563,0.00130088,0.0003060128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0007990462,0.0001014545,0.9902207,0.001200395,0.001593502,0.000464858,0.000001297078,0.0008731912,0.004745539],"genre_scores_gemma":[0.92463,0.00001016544,0.07391005,0.0008000317,0.0003764515,0.00008007963,0.000001822219,0.00001587122,0.0001755388],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9238309,"threshold_uncertainty_score":0.9999921,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3151453676","doi":"10.1109/tpds.2007.253279","title":"LRED: A Robust and Responsive AQM Algorithm Using Packet Loss Ratio Measurement","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","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":"Simon Fraser University","funders":"Microsoft Research Asia","keywords":"Active queue management; Goodput; Computer science; Random early detection; Network congestion; Robustness (evolution); Queue; Packet loss; Network packet; Computer network; Algorithm; Queueing theory; Flow control (data); Real-time computing; Throughput; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.02608444353472715,"gpt":0.2182216668738476,"spread":0.1921372233391204,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000357236,0.0002375006,0.0002911931,0.0001010991,0.0004331574,0.000312784,0.0001627466,0.0001169921,0.000004334487],"category_scores_gemma":[0.000003494246,0.0002167872,0.0000664008,0.0002895565,0.00008247036,0.0003240367,0.000003109905,0.0001691708,0.000007036303],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009918943,"about_ca_system_score_gemma":0.00009412121,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000230181,"about_ca_topic_score_gemma":0.00004656429,"domain_scores_codex":[0.9982247,0.0002043602,0.0003742393,0.0004650694,0.0004108106,0.0003207621],"domain_scores_gemma":[0.9991242,0.00009616056,0.0001133,0.0003003481,0.0002117786,0.000154171],"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.00008852169,0.0001632254,0.00002176706,0.00002763891,0.00008932776,0.00005961238,0.00007477529,0.9707419,0.0002292765,0.001705334,0.001576858,0.02522179],"study_design_scores_gemma":[0.001396165,0.0001031535,0.0001542185,0.00007868052,0.00005004082,0.0001655752,0.00009334048,0.9957545,0.00005147058,0.00009052853,0.001779991,0.0002822676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002832136,0.002054464,0.9932988,0.0004779858,0.0005874378,0.0004043063,0.0001457209,0.0001630999,0.0000360737],"genre_scores_gemma":[0.9963325,0.0000802369,0.003125447,0.0000761319,0.0001044091,0.00007153331,0.00001040639,0.00001054675,0.0001887604],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9935004,"threshold_uncertainty_score":0.8840327,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1663605321","doi":"10.1109/icc.2001.936986","title":"Impact of self-similarity on wireless data network performance","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":64,"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":"Simon Fraser University","keywords":"Computer science; TRACE (psycholinguistics); Computer network; Traffic generation model; Network packet; Wireless network; Cellular network; Queue; Network traffic simulation; Wireless; Network traffic control; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.03498647411698588,"gpt":0.2517601557899028,"spread":0.2167736816729169,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002418538,0.0001189404,0.0001707641,0.00002892243,0.0000823375,0.00004697897,0.001452139,0.00005000864,0.000154713],"category_scores_gemma":[0.000005854287,0.00008976453,0.00005392299,0.0003168274,0.00002329762,0.0004067592,0.0002439701,0.0001310158,0.00008579565],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002195931,"about_ca_system_score_gemma":0.00003163629,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008948124,"about_ca_topic_score_gemma":0.000005187378,"domain_scores_codex":[0.9989406,0.00004532421,0.0001885334,0.0003305667,0.0002160514,0.0002788717],"domain_scores_gemma":[0.9983905,0.0001018372,0.00007345112,0.001300283,0.00005056438,0.00008336503],"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.00001378775,0.0002739046,0.01895504,0.000008288372,0.00008469654,0.000004498271,0.00008249208,0.01868141,0.000003334603,0.01568982,0.08328432,0.8629184],"study_design_scores_gemma":[0.0002861682,0.0001982901,0.01624838,0.00001390156,0.000006033357,0.000004211494,5.370766e-7,0.9817504,0.000004755208,0.00003266304,0.00134608,0.0001085566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6864789,0.0004312801,0.2631066,0.00134563,0.0009529243,0.000442158,0.00001420709,0.001038043,0.04619029],"genre_scores_gemma":[0.9942449,0.0001168906,0.004916929,0.0002203755,0.0001763918,0.000002546828,0.000003014061,0.000004967174,0.0003139683],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.963069,"threshold_uncertainty_score":0.3660491,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2054092574","doi":"10.1109/tpds.2007.1016","title":"Design of Adaptive PI Rate Controller for Best-Effort Traffic in the Internet Based on Phase Margin","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; University of Ottawa","keywords":"Active queue management; Computer science; Router; Phase margin; Robustness (evolution); Controller (irrigation); Network congestion; Control theory (sociology); PID controller; Adaptive control; Queue; Real-time computing; Packet loss; Network packet; Computer network; Bandwidth (computing); Control engineering; Amplifier; Engineering; Control (management)","retraction":null,"screen_n_in":null,"score":{"opus":0.03307635050854029,"gpt":0.2640754187643328,"spread":0.2309990682557925,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013149,0.0002131839,0.0003486981,0.0001462901,0.0001116084,0.00007828846,0.0003457368,0.0001078814,0.000002959658],"category_scores_gemma":[0.000005966309,0.0001529451,0.0001103307,0.0003182746,0.00006369889,0.0001095028,8.592537e-7,0.0001835928,0.000005083159],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004524883,"about_ca_system_score_gemma":0.00005676712,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002984024,"about_ca_topic_score_gemma":0.00002800354,"domain_scores_codex":[0.9984181,0.0002340721,0.0004844636,0.0003443188,0.0001970467,0.0003219827],"domain_scores_gemma":[0.9982232,0.001185297,0.0001434824,0.0002638963,0.00009397366,0.00009010797],"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.002003224,0.000664625,0.000002253641,0.00001762287,0.00004479887,0.0000114403,0.0001814315,0.9652084,0.00003755493,0.001720998,0.0003355876,0.02977214],"study_design_scores_gemma":[0.007364235,0.001371392,0.00002641641,0.00009185566,0.00003628329,0.000008260243,0.0002176634,0.9902614,0.00004486259,0.00003265577,0.0003842351,0.0001607821],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004196475,0.0001354198,0.9932819,0.0002571398,0.0003537354,0.001567492,0.0001128001,0.00005400349,0.00004104502],"genre_scores_gemma":[0.9984276,0.00001078555,0.0008703311,0.0001648908,0.00003372877,0.0003725429,0.00001109268,0.000008760265,0.0001003035],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9942311,"threshold_uncertainty_score":0.6236919,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2011112929","doi":"10.1145/1052812.1052823","title":"An analysis of TCP reset behaviour on the internet","year":2005,"lang":"en","type":"article","venue":"ACM SIGCOMM Computer Communication Review","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":63,"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":"Solar Energy Technologies Office; Lawrence Berkeley National Laboratory; University of Calgary","keywords":"Reset (finance); Computer science; Handshake; Computer network; TCP hole punching; The Internet; Zeta-TCP; TCP global synchronization; TCP tuning; TCP acceleration; Network packet; Transmission Control Protocol; World Wide Web; Business","retraction":null,"screen_n_in":null,"score":{"opus":0.033193816146021,"gpt":0.3043915626423954,"spread":0.2711977464963744,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.001461354,0.0001852236,0.0005052069,0.000164443,0.0001304629,0.0001154144,0.007224332,0.0000515562,0.0001362013],"category_scores_gemma":[0.00006791228,0.0001315683,0.0002742018,0.001154197,0.00008212758,0.0003109361,0.0008516296,0.000306889,0.00007735987],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000385897,"about_ca_system_score_gemma":0.00003084242,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003254076,"about_ca_topic_score_gemma":0.00007763218,"domain_scores_codex":[0.9972531,0.001234371,0.0006721669,0.0003204686,0.0003325726,0.0001873155],"domain_scores_gemma":[0.9918587,0.001055913,0.0004063685,0.006365411,0.0002235144,0.00009004342],"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.000004009909,0.0002728565,0.0009697321,0.00002980795,0.00026195,6.147512e-7,0.0002867932,0.002298369,0.000001998008,0.09613293,0.0236631,0.8760778],"study_design_scores_gemma":[0.0002375042,0.0001540861,0.008516914,0.0009700491,0.0004463876,0.000004222372,0.000007603321,0.9078267,0.00001868405,0.0002653204,0.08129077,0.0002618266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01356938,0.07991125,0.7683777,0.1345789,0.000224853,0.001396611,0.00001334848,0.0005060727,0.001421794],"genre_scores_gemma":[0.9332591,0.01320911,0.03874382,0.01455704,0.0000535237,0.00006996926,0.00004146635,0.000009596067,0.00005634319],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9196898,"threshold_uncertainty_score":0.9981471,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2145208701","doi":"10.1109/icnp.2000.896301","title":"Time-lined TCP for the TCP-friendly delivery of streaming media","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":62,"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; Unicast; Computer network; TCP Friendly Rate Control; Real Time Streaming Protocol; Network congestion; Compound TCP; The Internet; Network packet; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.01444850369905156,"gpt":0.1992092592374261,"spread":0.1847607555383745,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001729024,0.00008782748,0.0001250405,0.00003214501,0.00009498687,0.00003777588,0.0006038914,0.00003784299,0.0003132958],"category_scores_gemma":[0.0000427489,0.0000568424,0.00008134697,0.0001660789,0.00005502299,0.0001481348,0.00006602859,0.00005387106,0.00007210745],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008162644,"about_ca_system_score_gemma":0.00001852704,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008357854,"about_ca_topic_score_gemma":0.00001912278,"domain_scores_codex":[0.9992349,0.00002467047,0.0001924574,0.0001873241,0.00016977,0.0001909193],"domain_scores_gemma":[0.9984295,0.0009958787,0.00006846777,0.0003478898,0.0001078959,0.00005040543],"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.000007514934,0.00004385874,0.00001848328,0.000003736533,0.00003150497,0.000001329303,0.0003063772,0.00101727,0.0001107294,0.02452561,0.02901939,0.9449142],"study_design_scores_gemma":[0.0004726601,0.00006021456,0.00009162562,0.000008315172,0.0000141645,0.000002255988,0.0000442796,0.9873624,0.0001476658,0.0001268815,0.01158804,0.00008144623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009625901,0.0009822177,0.9797477,0.003689241,0.0004836839,0.0003182138,0.00000493163,0.0002022815,0.004945825],"genre_scores_gemma":[0.9808932,0.00005073694,0.01497096,0.0004014153,0.000180574,0.00002541812,0.000001142309,0.000006146069,0.003470385],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9863452,"threshold_uncertainty_score":0.343037,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3047438757","doi":"10.1109/infocom41043.2020.9155250","title":"Eagle: Refining Congestion Control by Learning from the Experts","year":2020,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":61,"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":"Eagle; Computer science; Reinforcement learning; Network congestion; Heuristics; Control (management); Artificial intelligence; Heuristic; Margin (machine learning); Machine learning; Artificial neural network; Network packet; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.01538462053915904,"gpt":0.1912059353069693,"spread":0.1758213147678103,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001657978,0.0001256367,0.0001507605,0.000007573987,0.0002182939,0.0002198452,0.0006087819,0.00005669396,0.0001724122],"category_scores_gemma":[0.0001278074,0.00008546065,0.00005194831,0.0001387297,0.00003456543,0.0002406405,0.00007535821,0.0002140218,0.0002174466],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001181195,"about_ca_system_score_gemma":0.00003157954,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005213022,"about_ca_topic_score_gemma":0.000005415443,"domain_scores_codex":[0.9988257,0.0001891478,0.0001905325,0.0003556834,0.0002210493,0.000217888],"domain_scores_gemma":[0.9988759,0.0006439402,0.00007814926,0.0002239415,0.0000502158,0.000127836],"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.00003611177,0.00001831682,0.002032435,0.000001014068,0.00005463268,0.000009684608,0.001387596,0.005804662,0.002215835,0.01668905,0.1024833,0.8692673],"study_design_scores_gemma":[0.001055565,0.0000898659,0.0004642415,0.000009168048,0.00001139271,0.000001729565,0.0001607705,0.7795246,0.00008495726,0.00006327065,0.2183656,0.0001688895],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006505273,0.0009810993,0.9286713,0.05992337,0.000260318,0.00009344923,0.000001690176,0.0005819199,0.002981608],"genre_scores_gemma":[0.9798626,0.00001948145,0.001339688,0.01777545,0.0003056506,0.00002161782,0.000006016147,0.000008143093,0.0006613343],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9733573,"threshold_uncertainty_score":0.3484984,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2038044579","doi":"10.1016/j.comcom.2005.02.004","title":"Stochastic processes for computer network traffic modeling","year":2005,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Traffic generation model; Fractional Brownian motion; Fractal; Wireless network; Stochastic process; Network traffic simulation; Gaussian; Computer network; Noise (video); Wireless; Distributed computing; Network traffic control; Artificial intelligence; Telecommunications; Brownian motion; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03840745799832609,"gpt":0.2658558960908141,"spread":0.227448438092488,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003186817,0.000233342,0.0002756696,0.00008723125,0.0006927909,0.0003210419,0.003395149,0.00008503877,0.000003058132],"category_scores_gemma":[0.00001592614,0.000238844,0.000123136,0.000510122,0.00007728073,0.0005009182,0.0007214245,0.0002291532,0.00005106782],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005174336,"about_ca_system_score_gemma":0.0001864889,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001243486,"about_ca_topic_score_gemma":0.00004422118,"domain_scores_codex":[0.9983704,0.0001048126,0.0004520342,0.0004445261,0.0001526662,0.0004755332],"domain_scores_gemma":[0.996505,0.0007519203,0.0001260421,0.002062903,0.0004058958,0.0001481917],"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.000002800905,0.0000729826,0.000001653323,0.00000732995,0.0000212465,9.386529e-8,0.0001875986,0.5970702,2.247956e-7,0.0233918,0.00329936,0.3759447],"study_design_scores_gemma":[0.0005679064,0.00007066027,0.00001014757,0.00006391847,0.00002052509,0.00001326043,0.000003229341,0.9797403,2.439667e-7,0.001134585,0.01810527,0.0002699732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000379285,0.00221035,0.9850994,0.01046783,0.0004429707,0.0005704255,0.000004143438,0.0007143886,0.0001112046],"genre_scores_gemma":[0.467539,0.00004259267,0.5299668,0.001131842,0.001080955,0.0001630557,0.00002054236,0.00001580749,0.00003940433],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4671597,"threshold_uncertainty_score":0.9739778,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2107245740","doi":"10.5555/824475.825861","title":"Hybrid packet/fluid flow network simulation","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":59,"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; Network packet; Jitter; Emulation; Network traffic control; Traffic generation model; Latency (audio); Computer network; Speedup; Network traffic simulation; Real-time computing; Distributed computing; Parallel computing; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01123634135228756,"gpt":0.2198580850870152,"spread":0.2086217437347276,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002820445,0.000108942,0.00011264,0.00002485944,0.0001277148,0.0001147871,0.0002788214,0.00003122534,0.0001820704],"category_scores_gemma":[0.00003516317,0.00009599351,0.00005621463,0.0001999746,0.00001568885,0.0002678022,0.00003028881,0.00007336528,0.0002812357],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001720217,"about_ca_system_score_gemma":0.00004431348,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001067551,"about_ca_topic_score_gemma":0.000002189783,"domain_scores_codex":[0.9989871,0.00009552135,0.0001701867,0.0002737668,0.000175714,0.0002976806],"domain_scores_gemma":[0.99924,0.0001743273,0.0000372251,0.0003847856,0.00006636867,0.00009727944],"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.000001989831,0.00001287363,0.00009084134,6.868494e-7,0.000006879054,0.000005012129,0.00001206148,0.5926723,0.000002592009,0.1677164,0.008499855,0.2309785],"study_design_scores_gemma":[0.000262143,0.00002434772,0.00008601791,0.000003911133,0.000003396619,0.000006521267,0.000001395055,0.9204407,0.00003544894,0.006608154,0.07240442,0.0001235793],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001669861,0.0002060777,0.9748773,0.0003721021,0.0007268548,0.0001141847,2.424293e-7,0.000343282,0.0216901],"genre_scores_gemma":[0.9546936,0.000008252977,0.04226358,0.001199776,0.0002133655,0.000007831421,0.00000142952,0.000006344536,0.001605863],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9530237,"threshold_uncertainty_score":0.3914502,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2156806957","doi":"10.1109/vetecf.2002.1040804","title":"Distributed call admission control for ad hoc networks","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":57,"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; Computer network; Service (business); Controller (irrigation); Wireless ad hoc network; Function (biology); Telecommunications; Wireless","retraction":null,"screen_n_in":null,"score":{"opus":0.00876255915241955,"gpt":0.220807138057594,"spread":0.2120445789051744,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002985548,0.0001437308,0.0001857191,0.00002629668,0.0001518263,0.000109609,0.0003895742,0.00009460152,0.00004650848],"category_scores_gemma":[0.00009043285,0.0001150077,0.0001039598,0.000192215,0.00001971403,0.000164217,0.0000218417,0.00009827817,0.00001921271],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002693453,"about_ca_system_score_gemma":0.00006632886,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.613978e-7,"about_ca_topic_score_gemma":0.000005963733,"domain_scores_codex":[0.9988433,0.00007876616,0.0002159537,0.0003398401,0.0001344358,0.0003877475],"domain_scores_gemma":[0.9989639,0.0002901191,0.00006286669,0.0003591447,0.0001044092,0.0002195859],"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.00006629931,0.00009548086,0.0001646224,0.000004865579,0.00004338509,0.000007209414,0.00002252146,0.0162489,0.00002961301,0.2740662,0.06489256,0.6443584],"study_design_scores_gemma":[0.001804881,0.0001021986,0.0001099013,0.000007213871,0.0000107998,0.00000603707,0.000003684861,0.7142594,0.00002051325,0.0008381378,0.2826841,0.0001531421],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0001649642,0.001405819,0.9943358,0.001758365,0.0005549934,0.0003979973,0.000005489414,0.0003017664,0.001074747],"genre_scores_gemma":[0.9785951,0.00005385472,0.01750514,0.001719483,0.00009377702,0.00009134307,0.00001076272,0.000009602471,0.001920885],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9784302,"threshold_uncertainty_score":0.4689878,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2048384452","doi":"10.1145/2096149.2096155","title":"Modeling on quicksand","year":2012,"lang":"en","type":"article","venue":"ACM SIGCOMM Computer Communication Review","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":57,"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":"Research England; Microsoft Research; National Science Foundation","keywords":"Computer science; Scalability; Robustness (evolution); Network topology; Scarcity; Distributed computing; Routing (electronic design automation); Sensitivity (control systems); Ground truth; Empirical research; Topology (electrical circuits); Machine learning; Computer network; Database","retraction":null,"screen_n_in":null,"score":{"opus":0.04288801640100692,"gpt":0.2883414826358308,"spread":0.2454534662348238,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001087755,0.0002179594,0.0003608429,0.00006558255,0.0002576401,0.0001094382,0.003695946,0.00005935133,0.00003527823],"category_scores_gemma":[0.0000735435,0.0001919969,0.0001427391,0.0003668893,0.00002981979,0.0006172464,0.001099873,0.0003304648,0.0004636928],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004313238,"about_ca_system_score_gemma":0.00003159037,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006769035,"about_ca_topic_score_gemma":0.000001451763,"domain_scores_codex":[0.9980264,0.0005785454,0.0004801639,0.0002605441,0.0002827275,0.0003716286],"domain_scores_gemma":[0.9949245,0.000500189,0.0001431446,0.004117628,0.0001252842,0.0001892557],"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.000002012732,0.0001338232,0.00008363144,0.00009405605,0.00002471178,4.20471e-7,0.0001344499,0.00187034,8.584715e-7,0.08774994,0.01387434,0.8960314],"study_design_scores_gemma":[0.0003854643,0.00005614648,0.0001208565,0.001862228,0.00003028267,0.00002298986,0.000002797516,0.8095465,0.00000291181,0.0009184749,0.1866944,0.0003570096],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004311236,0.1623022,0.815805,0.01824111,0.0004075898,0.0004560162,6.12412e-7,0.0004049885,0.001951358],"genre_scores_gemma":[0.7354602,0.06585856,0.1694138,0.02869176,0.0003279514,0.0001280827,0.00002071994,0.00002339064,0.00007555803],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8956744,"threshold_uncertainty_score":0.7829406,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2086258679","doi":"10.1007/s12243-011-0254-y","title":"An analytical model for jitter in IP networks","year":2011,"lang":"fr","type":"article","venue":"Annals of Telecommunications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; Institut National de la Recherche Scientifique","funders":"","keywords":"Jitter; Computer science; Voice over IP; Real-time computing; Network packet; Quality of service; Poisson distribution; Computer network; Path (computing); Queueing theory; Queue; Telecommunications; Mathematics; The Internet","retraction":null,"screen_n_in":null,"score":{"opus":0.2705238557929741,"gpt":0.3737620049254415,"spread":0.1032381491324674,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000853952,0.0001732797,0.0003156883,0.0001428306,0.0001429147,0.00005725414,0.001975436,0.0001925784,0.00006520101],"category_scores_gemma":[0.00006137216,0.0001960461,0.0001784885,0.0004774506,0.0002439755,0.0006441909,0.0001797139,0.0003264878,0.00001333794],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001405833,"about_ca_system_score_gemma":0.0001703615,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000146402,"about_ca_topic_score_gemma":0.0005575817,"domain_scores_codex":[0.9982122,0.0002611025,0.0006110264,0.0003098196,0.0001147763,0.0004910502],"domain_scores_gemma":[0.9970121,0.0003479108,0.0001916342,0.001831548,0.0004386559,0.0001781553],"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.00003860534,0.001090799,0.0007125397,0.00001326433,0.0000616535,0.000001000855,0.001935221,0.1396195,0.000001642657,0.4718996,0.008136263,0.3764899],"study_design_scores_gemma":[0.0003231186,0.0001619834,0.003528031,0.00006784814,0.00002975311,0.000002712774,0.00003739767,0.979862,0.00001032819,0.01200487,0.003779266,0.0001927345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002757647,0.005451178,0.9616081,0.02622423,0.0001955692,0.000380912,0.00001965203,0.00005014381,0.003312643],"genre_scores_gemma":[0.9064245,0.001560198,0.08816613,0.002162017,0.00008220719,0.0001044363,0.00001760167,0.00001700369,0.001465897],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9036669,"threshold_uncertainty_score":0.7994529,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2147282464","doi":"10.1109/infcom.1995.515945","title":"Modelling prioritized MPEG video using TES and a frame spreading strategy for transmission in ATM networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Instituto de Telecomunicações","keywords":"Multiplexer; Computer science; Variable bitrate; Real-time computing; Asynchronous Transfer Mode; Frame (networking); Encoder; Statistical time division multiplexing; MPEG-4; Transmission (telecommunications); MPEG-2; Computer network; Multiplexing; Telecommunications; Mathematics; Bit rate; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.04785401598280571,"gpt":0.2496202899254072,"spread":0.2017662739426014,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002218215,0.0001415367,0.0002067628,0.00007051634,0.0001246954,0.0001936428,0.0002024157,0.000106072,0.00001704296],"category_scores_gemma":[0.000006008171,0.0001278353,0.00004935947,0.0002188253,0.00002190728,0.0003838153,0.00002544807,0.000138215,0.000001014962],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002297943,"about_ca_system_score_gemma":0.00001421921,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003116396,"about_ca_topic_score_gemma":0.000006248986,"domain_scores_codex":[0.9988921,0.00004030368,0.0002565756,0.0003658367,0.0001052485,0.0003399753],"domain_scores_gemma":[0.9993795,0.0002823035,0.00004494159,0.0001562425,0.00003319982,0.0001037674],"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.000009578698,0.00001871244,0.00005720927,0.000007256306,0.00000510417,0.000003004254,0.0001298396,0.679893,0.00007114128,0.008479012,0.00002767888,0.3112984],"study_design_scores_gemma":[0.001004501,0.00004116952,0.000009064665,0.00008778227,0.000008656636,0.000008204895,0.00001890526,0.9966649,0.00001682946,0.00167836,0.0002955851,0.0001659887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02488229,0.001970286,0.9720163,0.0002918842,0.0000797692,0.0003144018,2.858778e-7,0.0001268385,0.0003178912],"genre_scores_gemma":[0.8652478,0.0001692431,0.1341634,0.0001279096,0.00008090561,0.0000147728,4.111614e-7,0.000009257449,0.0001862527],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8403655,"threshold_uncertainty_score":0.5212974,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2947464159","doi":"10.1016/j.isatra.2019.05.015","title":"Adaptive fuzzy funnel congestion control for TCP/AQM network","year":2019,"lang":"en","type":"article","venue":"ISA Transactions","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Lakehead University","funders":"National Natural Science Foundation of China","keywords":"Active queue management; Control theory (sociology); Backstepping; Transmission Control Protocol; Fuzzy logic; Computer science; Fuzzy control system; Network congestion; Transient (computer programming); Queue; Controller (irrigation); Adaptive control; Network packet; Control (management); Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.01087331978030513,"gpt":0.2094389208189413,"spread":0.1985656010386362,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002736305,0.0002049769,0.0002779967,0.00006641706,0.000276833,0.0001095915,0.0004254344,0.000135077,0.0001104655],"category_scores_gemma":[0.000007156196,0.0002044246,0.0002133916,0.000316576,0.00004411511,0.0004847037,0.000005816358,0.0002183158,0.0002758566],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005366235,"about_ca_system_score_gemma":0.0001053665,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001391896,"about_ca_topic_score_gemma":0.00005542348,"domain_scores_codex":[0.9984758,0.00008675357,0.0002811723,0.0004745437,0.0002023918,0.0004793155],"domain_scores_gemma":[0.9985982,0.0005377821,0.000095172,0.0004480749,0.0001758241,0.0001449225],"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.0002189043,0.000139134,0.000128436,0.00001517017,0.0002189975,0.000003088308,0.0002496028,0.3916564,0.0001300975,0.163223,0.003768489,0.4402486],"study_design_scores_gemma":[0.004311997,0.0004496032,0.001278077,0.00005010718,0.0001173606,0.00002115926,0.0000729424,0.9516422,0.00002770506,0.006942506,0.03462741,0.0004589233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0008363268,0.000279151,0.9902125,0.00276274,0.002291977,0.0009902454,0.00002930523,0.0004099729,0.002187789],"genre_scores_gemma":[0.9843786,0.00002102242,0.01190906,0.0008605723,0.0003668035,0.0002694834,0.000005482919,0.00001923797,0.002169723],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9835423,"threshold_uncertainty_score":0.8336192,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2111757536","doi":"10.1142/s0218127405013587","title":"HOPF BIFURCATION CONTROL FOR AN INTERNET CONGESTION MODEL","year":2005,"lang":"en","type":"article","venue":"International Journal of Bifurcation and Chaos","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hopf bifurcation; Control theory (sociology); Mathematics; Bifurcation diagram; Saddle-node bifurcation; Transcritical bifurcation; Biological applications of bifurcation theory; Controller (irrigation); Infinite-period bifurcation; Period-doubling bifurcation; Bogdanov–Takens bifurcation; Bifurcation theory; Delay differential equation; Applied mathematics; Bifurcation; Mathematical analysis; Differential equation; Control (management); Computer science; Physics; Nonlinear system","retraction":null,"screen_n_in":null,"score":{"opus":0.01793773157464332,"gpt":0.2735177468944576,"spread":0.2555800153198142,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005054158,0.0001182588,0.0001564986,0.000228559,0.00005000976,0.0002093509,0.0005827453,0.00007143239,0.000009755131],"category_scores_gemma":[0.00006911282,0.0001079465,0.00008095504,0.0000685929,0.00003486339,0.001207708,0.00002625164,0.0001156383,0.000006718657],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008070259,"about_ca_system_score_gemma":0.0001075961,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003307687,"about_ca_topic_score_gemma":0.00001518425,"domain_scores_codex":[0.9988112,0.00005028697,0.0004685634,0.0001900338,0.0003514941,0.0001283666],"domain_scores_gemma":[0.9981863,0.0001024479,0.0004285643,0.0001369713,0.001017684,0.0001280044],"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.0001879637,0.0001681673,0.0002167236,0.000003870174,0.00009542789,0.000001275437,0.0007668106,0.0325059,0.0006685108,0.09580506,0.002100935,0.8674794],"study_design_scores_gemma":[0.002255345,0.0002098006,0.0006374035,0.00003005824,0.0000225142,0.0000884,0.00003324265,0.9824103,0.0004036332,0.003086161,0.01070033,0.0001228184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0396566,0.0002385478,0.9450027,0.01402943,0.0006804965,0.0001713742,0.000006916818,0.00004179701,0.0001721246],"genre_scores_gemma":[0.9808778,0.00008009896,0.01599275,0.001838929,0.000858269,0.00002038144,0.00001016203,0.000008512967,0.0003130891],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9499044,"threshold_uncertainty_score":0.4401929,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}