{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Jitendra Padhye","is_ca":false},{"name":"Victor Firoiu","is_ca":true},{"name":"Don Towsley","is_ca":false},{"name":"James F. Kurose","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04610366903569576,"gpt":0.2720498297292525,"spread":0.2259461606935567,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004686982,0.001416722,0.001107479,0.001476993,0.0006449887,0.001190339,0.00277742,0.002570181,0.0007166117],"category_scores_gemma":[0.02601794,0.0005774961,0.0006435365,0.00193519,0.001115038,0.003176715,0.0009052787,0.001941389,0.0003491905],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002247549,"about_ca_system_score_gemma":0.001052987,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01834754,"about_ca_topic_score_gemma":0.007461596,"domain_scores_codex":[0.9981817,0.0006854022,0.0001120185,0.0002920018,0.0005393087,0.0001896723],"domain_scores_gemma":[0.9857191,0.00918125,0.00149171,0.001797877,0.001620916,0.0001890858],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001822431,0.0004563101,0.01386486,0.0001437285,0.00006318356,0.0001044555,0.0002374216,0.9602542,0.002761687,0.007249598,0.001162715,0.01351955],"study_design_scores_gemma":[0.00001152282,0.00006139147,0.001854458,0.00001143049,0.000008653634,0.00002522456,0.00001744051,0.9956956,0.0005045546,0.001585716,0.0002087809,0.00001527475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8739188,0.001006989,0.117098,0.0007789906,0.0000779722,0.0003450936,0.001214683,0.001066496,0.004492927],"genre_scores_gemma":[0.9846234,0.0005237942,0.01340912,0.000064632,0.00003541139,0.000190197,0.0005367384,0.00005901429,0.0005578068],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01834754,"threshold_uncertainty_score":0.0364815,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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","authors":[{"name":"Dina Katabi","is_ca":false},{"name":"Mark Handley","is_ca":false},{"name":"Charlie Rohrs","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00213407,0.0005484037,0.0004279985,0.0005978657,0.0007701985,0.001367593,0.001289519,0.0006955164,0.001119256],"category_scores_gemma":[0.005632628,0.0002917881,0.0002832002,0.0005522946,0.001797624,0.002225173,0.0007656501,0.0009942671,0.0001007259],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001886425,"about_ca_system_score_gemma":0.00118122,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003979269,"about_ca_topic_score_gemma":0.002562938,"domain_scores_codex":[0.9989722,0.000375544,0.00004735833,0.0001271035,0.0003718224,0.0001060606],"domain_scores_gemma":[0.9981819,0.001156835,0.0002114352,0.0001351882,0.0002503553,0.00006427289],"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.000119764,0.00007560111,0.0006724598,0.0001107773,0.00003795261,0.0001298048,0.0001728557,0.6830344,0.008153656,0.2718742,0.001448717,0.03416988],"study_design_scores_gemma":[0.00001828169,0.0000298425,0.0001072695,0.000005372896,0.0000102732,0.00002542355,0.00001016686,0.9497159,0.001242212,0.04774919,0.001077993,0.000008043496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05030005,0.0008087439,0.9448051,0.0003786942,0.0001142976,0.0000714005,0.00002752955,0.0003099814,0.003184244],"genre_scores_gemma":[0.9567167,0.0005570166,0.04034655,0.00005985609,0.00007608292,0.0001059787,0.00003001203,0.00002872485,0.002078984],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003979269,"threshold_uncertainty_score":0.01368707,"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","authors":[{"name":"Teerawat Issariyakul","is_ca":false},{"name":"Ekram Hossain","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005956491,0.001444378,0.0008343867,0.0009875726,0.0004688558,0.001460579,0.001979279,0.0009414972,0.07395723],"category_scores_gemma":[0.002537512,0.0008949464,0.0006467057,0.001461379,0.0002521228,0.002114279,0.0006809709,0.002657367,0.03222511],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008525561,"about_ca_system_score_gemma":0.001194679,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005965739,"about_ca_topic_score_gemma":0.007042353,"domain_scores_codex":[0.999582,0.00006371702,0.00002732595,0.00004429758,0.0002343997,0.00004836774],"domain_scores_gemma":[0.9991954,0.0002904832,0.00002759857,0.0001586189,0.0002758109,0.00005199709],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001630276,0.0001878678,0.0005452204,0.0007274735,0.0000932258,0.00008374338,0.0001067966,0.1563751,0.005902862,0.04238509,0.6090556,0.184374],"study_design_scores_gemma":[0.0000811452,0.00004436584,0.0003004362,0.0001586165,0.00004162582,0.0001232609,0.00002555552,0.2737471,0.006422886,0.03444725,0.6845407,0.00006704577],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003980884,0.003600344,0.6830269,0.001365144,0.002311732,0.000369432,0.03634906,0.09552926,0.1734673],"genre_scores_gemma":[0.07091403,0.01055427,0.5447463,0.002298377,0.0008767627,0.001928299,0.07276796,0.04590486,0.2500092],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.07395723,"threshold_uncertainty_score":0.2474116,"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","authors":[{"name":"Victor Firoiu","is_ca":true},{"name":"M. Borden","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002692809,0.0008329751,0.0007994685,0.0006163565,0.001126932,0.00251753,0.002673835,0.001789713,0.00535519],"category_scores_gemma":[0.01051581,0.000450482,0.0006415487,0.0008082754,0.002556956,0.006093772,0.001036314,0.002690765,0.0004708868],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001917772,"about_ca_system_score_gemma":0.001186773,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001729995,"about_ca_topic_score_gemma":0.0007172751,"domain_scores_codex":[0.9987711,0.0003692615,0.0000493411,0.0002256936,0.0004273059,0.0001572672],"domain_scores_gemma":[0.9962269,0.002462469,0.0003159324,0.0002330395,0.0005948163,0.0001668216],"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.00003130411,0.00005122114,0.0001568584,0.0001398218,0.00001859453,0.00004158479,0.00014987,0.02717195,0.001902346,0.9562857,0.001624653,0.0124261],"study_design_scores_gemma":[0.00005899234,0.0001614013,0.0002634395,0.00009810163,0.00005062734,0.0000620369,0.00007182638,0.4326139,0.001413679,0.551614,0.01356183,0.00003008664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03000491,0.00940323,0.9233587,0.004435789,0.001176166,0.0001109486,0.00007476416,0.0001764057,0.03125907],"genre_scores_gemma":[0.8929711,0.008581699,0.07789348,0.001392297,0.003711611,0.0003072445,0.00008189182,0.0001252808,0.01493537],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00535519,"threshold_uncertainty_score":0.01791483,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2112947567","doi":"10.1109/tnet.2005.852876","title":"Non-convex optimization and rate control for multi-class services in the Internet","year":2005,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":284,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Mathematical optimization; Sigmoid function; The Internet; Concave function; Convergence (economics); Network congestion; Dual (grammatical number); Class (philosophy); Convex function; Transmission (telecommunications); Function (biology); Regular polygon; Computer network; Telecommunications; Artificial neural network; Artificial intelligence; Mathematics","authors":[{"name":"Jang-Won Lee","is_ca":false},{"name":"Ravi R. Mazumdar","is_ca":true},{"name":"Ness B. Shroff","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01933816349824027,"gpt":0.2448934649100482,"spread":0.2255553014118079,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003075732,0.001132552,0.001223083,0.0006629185,0.000621461,0.001996602,0.001350058,0.001236628,0.002097073],"category_scores_gemma":[0.007421045,0.000521037,0.0006123226,0.001027757,0.001752309,0.002434063,0.00105968,0.001621086,0.0002910657],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00223209,"about_ca_system_score_gemma":0.001079731,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004518956,"about_ca_topic_score_gemma":0.002398143,"domain_scores_codex":[0.9984198,0.0008616549,0.00004236696,0.0002144966,0.0002660574,0.0001957467],"domain_scores_gemma":[0.9973804,0.001958986,0.0002481207,0.0001063678,0.0001951056,0.0001109437],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007007458,0.00005018121,0.0002642613,0.00005291651,0.00001943219,0.00009107099,0.00005963987,0.9076252,0.0009733142,0.07603087,0.0007643093,0.01399871],"study_design_scores_gemma":[0.000008038001,0.000009376114,0.00005515728,0.000002741197,0.000002344458,0.00001045388,0.00000853036,0.9850091,0.0001546998,0.01450699,0.0002292434,0.000003385343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03277287,0.0008867844,0.9600007,0.0008042809,0.00006991903,0.0000525366,0.00003174786,0.00007951946,0.005301692],"genre_scores_gemma":[0.9038283,0.001306702,0.08667465,0.0001932218,0.0001856421,0.0001645721,0.00005541771,0.0001034712,0.007488059],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004518956,"threshold_uncertainty_score":0.01626623,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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","authors":[{"name":"Dina Katabi","is_ca":false},{"name":"Mark Handley","is_ca":false},{"name":"Charlie Rohrs","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002286709,0.0005038204,0.0004253539,0.0006930524,0.0007003649,0.001460225,0.001315472,0.0007427195,0.00113292],"category_scores_gemma":[0.006339919,0.0002896909,0.0002896826,0.0006570425,0.00179293,0.002498209,0.0006296833,0.001065253,0.0001073986],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002150673,"about_ca_system_score_gemma":0.001241115,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004125555,"about_ca_topic_score_gemma":0.002540827,"domain_scores_codex":[0.9989018,0.0003757622,0.00004912602,0.0001332242,0.0004370623,0.000102931],"domain_scores_gemma":[0.9980751,0.001216001,0.000210006,0.0001435094,0.0002943325,0.00006100039],"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.00009247584,0.00007465739,0.0007347796,0.0001511761,0.00004071714,0.0001348626,0.0001676558,0.5368384,0.006553199,0.4079561,0.002187887,0.04506813],"study_design_scores_gemma":[0.00002408504,0.0000383656,0.0001856932,0.00001032535,0.00001583502,0.00003986162,0.00001651205,0.8975636,0.001408348,0.09797758,0.002707429,0.00001233317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04961315,0.001907232,0.9419498,0.000703665,0.0001773349,0.00008031284,0.00003628943,0.0003318753,0.005200444],"genre_scores_gemma":[0.9485154,0.001426062,0.04699635,0.0000922444,0.0001428806,0.0001168513,0.00003789904,0.00003570145,0.002636628],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004125555,"threshold_uncertainty_score":0.01560426,"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","authors":[{"name":"Matthias Falkner","is_ca":true},{"name":"Michael Devetsikiotis","is_ca":false},{"name":"Ioannis Lambadaris","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00129917,0.001109174,0.0007650754,0.001657304,0.0009664168,0.003227267,0.001343312,0.002101666,0.005740057],"category_scores_gemma":[0.002830432,0.0005167213,0.0007296765,0.003846943,0.001008339,0.005694184,0.001183123,0.003081709,0.001815943],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001550443,"about_ca_system_score_gemma":0.0008198528,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00123111,"about_ca_topic_score_gemma":0.0005823117,"domain_scores_codex":[0.9986533,0.0003174391,0.000099139,0.0001545653,0.0006677345,0.0001077645],"domain_scores_gemma":[0.9994548,0.0002651426,0.00005537629,0.00005958871,0.0001391602,0.00002590587],"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.00001666941,0.00004258501,0.0001783897,0.0003489562,0.00001446033,0.0001198026,0.00009070284,0.006609143,0.0007211741,0.8146774,0.01886292,0.1583178],"study_design_scores_gemma":[0.0000123493,0.0000492611,0.000397195,0.0002955206,0.00002153803,0.0007204505,0.00007637817,0.02927628,0.0006481288,0.5855382,0.3829177,0.00004703266],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.00612516,0.1977203,0.6269363,0.009382356,0.003666567,0.0002709686,0.0005040743,0.0005476582,0.1548466],"genre_scores_gemma":[0.178925,0.3446895,0.4072499,0.004679926,0.0135618,0.0008553133,0.0009568537,0.000434372,0.04864736],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.005740057,"threshold_uncertainty_score":0.01920235,"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","authors":[{"name":"James Aweya","is_ca":true},{"name":"Michel Ouellette","is_ca":true},{"name":"Delfin Y. Montuno","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006530364747959269,"gpt":0.1969023178851752,"spread":0.1903719531372159,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00166121,0.001379497,0.001316168,0.001423405,0.0009849201,0.00361811,0.003658487,0.001712338,0.004130324],"category_scores_gemma":[0.004363233,0.0006843503,0.001095247,0.001590685,0.002790182,0.004052628,0.001589379,0.003529637,0.0005894745],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002267622,"about_ca_system_score_gemma":0.001767612,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003499246,"about_ca_topic_score_gemma":0.002403134,"domain_scores_codex":[0.9987801,0.000344478,0.00005510223,0.0001852731,0.0004955396,0.0001394964],"domain_scores_gemma":[0.9984972,0.000838501,0.0001005039,0.0001298436,0.0003407086,0.00009333557],"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.00001463584,0.00005476727,0.00007094335,0.00005419088,0.00002065239,0.0000344274,0.00007252552,0.09348889,0.0007363303,0.8925439,0.001823727,0.01108497],"study_design_scores_gemma":[0.00001253289,0.00002834585,0.00003856947,0.00001471826,0.00001892084,0.00001952123,0.00001685101,0.4930198,0.0002544334,0.5033447,0.003217692,0.0000140016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002085745,0.0008362601,0.9873317,0.0006675397,0.0002601773,0.00003206698,0.00004802938,0.0001011959,0.008637276],"genre_scores_gemma":[0.7127748,0.00516855,0.2519575,0.001093185,0.003111869,0.0004478026,0.0001770166,0.0002130626,0.02505625],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004130324,"threshold_uncertainty_score":0.01645285,"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","authors":[{"name":"N. Likhanov","is_ca":false},{"name":"B. Tsybakov","is_ca":false},{"name":"N.D. Georganas","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007663275,0.0003091605,0.0003975267,0.0007371795,0.0003846819,0.0007560941,0.001002352,0.0007360601,0.0009966475],"category_scores_gemma":[0.003272871,0.0002819074,0.0003419712,0.0004006666,0.001073555,0.0007537794,0.0003533133,0.0003550767,0.0000654406],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001585509,"about_ca_system_score_gemma":0.0006657378,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003163211,"about_ca_topic_score_gemma":0.000974314,"domain_scores_codex":[0.9995878,0.0001108259,0.00001197397,0.0000477836,0.0001632901,0.00007845854],"domain_scores_gemma":[0.9981187,0.001204956,0.0002702796,0.00006676785,0.0002534822,0.00008578444],"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.0001979848,0.00007982208,0.002518677,0.0001035686,0.00005315852,0.0004802621,0.0001379441,0.8802968,0.0168226,0.09332789,0.000581969,0.005399336],"study_design_scores_gemma":[0.000002908808,0.00001398772,0.0002572832,0.000002650344,0.000005681103,0.00003985141,0.000006879335,0.9968761,0.0006018144,0.00211794,0.00007153108,0.000003378797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7723312,0.001061642,0.2171492,0.0004560521,0.00006007737,0.0000656528,0.000128502,0.0002523685,0.008495221],"genre_scores_gemma":[0.996794,0.000126853,0.002274394,0.00002463396,0.00001919845,0.00001010203,0.00001752601,0.00001197393,0.0007211137],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003163211,"threshold_uncertainty_score":0.01150376,"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","authors":[{"name":"Carey Williamson","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008861236,0.0008781236,0.0007107743,0.004120735,0.0008919596,0.001054146,0.001145223,0.0007800151,0.004635475],"category_scores_gemma":[0.003615115,0.0002767979,0.0003061614,0.004157622,0.0002204365,0.001567218,0.0007832496,0.0007603133,0.003247931],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001128585,"about_ca_system_score_gemma":0.0006464091,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003955801,"about_ca_topic_score_gemma":0.002592003,"domain_scores_codex":[0.997335,0.0003542998,0.0001002804,0.0003489751,0.001660926,0.0002004906],"domain_scores_gemma":[0.9975104,0.0002660844,0.0001192797,0.0003621172,0.001627244,0.0001148377],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.0005517459,0.0011063,0.03870454,0.0005444865,0.0001851187,0.0002922509,0.0004315462,0.02779511,0.07680156,0.03530862,0.1236961,0.6945826],"study_design_scores_gemma":[0.0001092783,0.001634841,0.06912577,0.000286164,0.0002152294,0.002162139,0.0005813639,0.4105208,0.1716826,0.01618822,0.3271827,0.000310853],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2086072,0.006101885,0.528869,0.001450204,0.001827931,0.001922215,0.01781847,0.02857746,0.2048256],"genre_scores_gemma":[0.7980229,0.00396531,0.1246831,0.0005246449,0.0004288099,0.001124638,0.0200094,0.000906633,0.05033454],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004635475,"threshold_uncertainty_score":0.01550722,"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","authors":[{"name":"Mark Coates","is_ca":true},{"name":"Rui Castro","is_ca":false},{"name":"Robert Nowak","is_ca":false},{"name":"Manik Gadhiok","is_ca":false},{"name":"Ryan King","is_ca":false},{"name":"Yolanda Tsang","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001842117,0.0005661462,0.0006974037,0.001023105,0.0004962109,0.0009852035,0.001075956,0.0008729526,0.0008519244],"category_scores_gemma":[0.01378065,0.0005299041,0.000297286,0.0008521082,0.000920428,0.002107657,0.001360725,0.001027449,0.0003343987],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006938451,"about_ca_system_score_gemma":0.0006535791,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001271689,"about_ca_topic_score_gemma":0.001496269,"domain_scores_codex":[0.9991583,0.0004421713,0.00002443033,0.0001188856,0.0002009399,0.00005528172],"domain_scores_gemma":[0.9942162,0.004131416,0.0006723963,0.0004836037,0.0003677118,0.0001285811],"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.000283772,0.00008254117,0.005619891,0.00009054617,0.00004319565,0.0001461141,0.0002055344,0.8898696,0.009937465,0.02652245,0.0005901014,0.06660873],"study_design_scores_gemma":[0.000006359526,0.00001143954,0.0003641596,0.000003050534,0.000002271041,0.00002977325,0.000009900354,0.9913531,0.00169345,0.00638177,0.0001377756,0.000006848246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03421743,0.00004721521,0.9647855,0.00006925356,0.000003702723,0.0000267222,0.00004179906,0.0002417747,0.0005667041],"genre_scores_gemma":[0.6591192,0.0001051878,0.3393445,0.00002786481,0.0000128156,0.0001039276,0.0002813112,0.00008118738,0.0009240068],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001842117,"threshold_uncertainty_score":0.009742141,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2159743267","doi":"10.1109/tnet.2007.896507","title":"Distributed Rate Allocation for Inelastic Flows","year":2007,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":142,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Air Force Office of Scientific Research; Defense Advanced Research Projects Agency; California Institute of Technology; University of Toronto; Purdue University; Yonsei University; National Science Foundation","keywords":"Mathematical optimization; Computer science; Heuristics; Limit (mathematics); Maximization; Utility maximization; Rate of convergence; Provisioning; Utility maximization problem; Convergence (economics); Mathematical economics; Mathematics; Economics","authors":[{"name":"Prashanth Hande","is_ca":false},{"name":"Shengyu Zhang","is_ca":false},{"name":"Mung Chiang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02166859084377924,"gpt":0.2531395800328795,"spread":0.2314709891891003,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002640704,0.0005300539,0.0009485097,0.0005617319,0.0005475354,0.00146698,0.00187588,0.0008359844,0.001998711],"category_scores_gemma":[0.007147789,0.0004411757,0.0004955244,0.0006767426,0.001454287,0.002038176,0.001797255,0.001444521,0.0004041737],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001443316,"about_ca_system_score_gemma":0.001225239,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001194547,"about_ca_topic_score_gemma":0.0009010521,"domain_scores_codex":[0.9981924,0.0005835302,0.0000874695,0.0004015108,0.0005332553,0.0002019629],"domain_scores_gemma":[0.9978573,0.0009876515,0.000217937,0.000454104,0.0003971858,0.00008584168],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001018515,0.0000819737,0.0003233705,0.00004696238,0.00002014348,0.0000765799,0.0001214297,0.7570593,0.003949546,0.1821008,0.00116463,0.05495337],"study_design_scores_gemma":[0.00001524003,0.00001817166,0.0000418889,0.000003228206,0.000003407819,0.00002560041,0.00001070984,0.9653159,0.0008339509,0.03304097,0.0006854821,0.000005456159],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01281369,0.00009893241,0.9846631,0.0001037406,0.00002311691,0.00002694006,0.000009384574,0.0001256213,0.002135484],"genre_scores_gemma":[0.7865798,0.000226339,0.2086766,0.0001094177,0.00005951417,0.0001238113,0.00005484616,0.00009107931,0.004078582],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002640704,"threshold_uncertainty_score":0.01396555,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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","authors":[{"name":"Lizhong Ding","is_ca":true},{"name":"Rafik Goubran","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000507988,0.0003562698,0.0003978052,0.0002209792,0.0001643382,0.0004763395,0.0004231004,0.0006318216,0.0004902841],"category_scores_gemma":[0.001992604,0.0001632228,0.0003155527,0.0001908721,0.0002622623,0.0006620154,0.0003662338,0.0004390671,0.0001273509],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003385925,"about_ca_system_score_gemma":0.0002680253,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006806268,"about_ca_topic_score_gemma":0.002742979,"domain_scores_codex":[0.9997998,0.00006358459,0.00001309485,0.00004223385,0.00005733005,0.00002396484],"domain_scores_gemma":[0.9993427,0.0004330943,0.00005892001,0.0000319819,0.0001130418,0.00002017227],"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.00004960798,0.00001557269,0.0007294684,0.00000785232,0.000007343876,0.00003707566,0.000009858111,0.9910851,0.0009709165,0.0006438822,0.0000476183,0.006395646],"study_design_scores_gemma":[0.00000217823,0.0000140262,0.0001656567,9.341676e-7,0.000001818832,0.000004675812,0.000001293238,0.9993555,0.0001878947,0.0002426867,0.00002141483,0.000001884213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.468065,0.0003187785,0.5278327,0.000185244,0.00003962191,0.00003089285,0.0001122586,0.000281618,0.003133869],"genre_scores_gemma":[0.9893969,0.0001182306,0.009826733,0.00002297806,0.000009238947,0.00001376615,0.00005429436,0.000009943357,0.0005479612],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006806268,"threshold_uncertainty_score":0.01353329,"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","authors":[{"name":"Tom H. Luan","is_ca":true},{"name":"Lin Cai","is_ca":true},{"name":"Xuemin Shen","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001344723,0.001102756,0.0006894463,0.0007867755,0.0005109388,0.00126144,0.001288573,0.001167179,0.001408921],"category_scores_gemma":[0.006466486,0.0004105524,0.0006354129,0.0006907152,0.001074331,0.001822421,0.001100789,0.001142802,0.0001786196],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002314982,"about_ca_system_score_gemma":0.001477713,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01456687,"about_ca_topic_score_gemma":0.006621215,"domain_scores_codex":[0.999356,0.0002446689,0.00001779088,0.00008321915,0.0001687266,0.0001297135],"domain_scores_gemma":[0.9984647,0.0009859351,0.0002011742,0.00006466496,0.000229007,0.0000545101],"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.00005313632,0.00006942825,0.001699029,0.00007900801,0.00002628934,0.0003194784,0.0002208931,0.9423595,0.005361424,0.04270223,0.0006776823,0.006431875],"study_design_scores_gemma":[0.000001545951,0.000007570136,0.0001199988,0.000005624457,0.00000497262,0.00001960331,0.00002348316,0.9981064,0.0002491319,0.001362472,0.00009513129,0.00000413302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2198966,0.003055559,0.7525573,0.00176102,0.0001122571,0.0002022674,0.0002313269,0.0003333874,0.02185031],"genre_scores_gemma":[0.9824696,0.001531027,0.01381699,0.00008257819,0.00005588122,0.00008417751,0.00004122589,0.00003233815,0.001886283],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01456687,"threshold_uncertainty_score":0.02896416,"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","authors":[{"name":"Yantai Shu","is_ca":false},{"name":"Minfang Yu","is_ca":false},{"name":"Jiakun Liu","is_ca":false},{"name":"Ou Yang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001179726,0.0005917512,0.0005456125,0.0006661383,0.0004016717,0.0007351131,0.001086769,0.0006577483,0.001039132],"category_scores_gemma":[0.003326147,0.0003506156,0.0008462044,0.0009653235,0.0002947783,0.001438176,0.000461019,0.001122131,0.0003547617],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004813656,"about_ca_system_score_gemma":0.0006317186,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01398386,"about_ca_topic_score_gemma":0.01303375,"domain_scores_codex":[0.9993586,0.0002313894,0.0000419611,0.0001442089,0.0001416263,0.00008224442],"domain_scores_gemma":[0.9992754,0.0002927327,0.0001117334,0.00008493527,0.0002032949,0.00003188452],"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.00008218986,0.00006394168,0.005427465,0.00004517583,0.00006803785,0.00008057503,0.00008364482,0.920447,0.003931089,0.01434332,0.001700779,0.05372678],"study_design_scores_gemma":[0.000001954895,0.000009348209,0.0003291375,0.000001587993,0.000006258279,0.000009976059,0.000005840428,0.9965179,0.0002429883,0.002472621,0.0003966659,0.000005610988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03640781,0.0001576147,0.9609032,0.0001844977,0.00005591118,0.00004235078,0.0002689117,0.0005460806,0.001433541],"genre_scores_gemma":[0.8061575,0.0006869133,0.1868544,0.00008734846,0.0001387013,0.000137178,0.0009778893,0.0001188585,0.004841174],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01398386,"threshold_uncertainty_score":0.02780497,"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","authors":[{"name":"Ying Qiu","is_ca":true},{"name":"Peter Marbach","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002673349,0.001057971,0.001225203,0.001118738,0.001043355,0.002482936,0.003031531,0.002531895,0.002202913],"category_scores_gemma":[0.008281586,0.0006405871,0.0006283892,0.001576443,0.002301151,0.004090598,0.001581376,0.001788243,0.0003155738],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00197767,"about_ca_system_score_gemma":0.001440673,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002616085,"about_ca_topic_score_gemma":0.002355708,"domain_scores_codex":[0.9979078,0.001108723,0.00005201692,0.0001659344,0.0006326636,0.0001329766],"domain_scores_gemma":[0.9980433,0.001291323,0.0001345008,0.0001147641,0.0003081136,0.0001079747],"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.00002992741,0.00004937509,0.0002963917,0.00006205439,0.00004020028,0.0001128503,0.00007312882,0.7903448,0.0005731608,0.1824313,0.001138932,0.02484788],"study_design_scores_gemma":[0.00001146397,0.0000218221,0.00005483162,0.000007825895,0.000009941557,0.00003984861,0.00002237012,0.9257503,0.0001384051,0.07288217,0.001051499,0.000009528942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01509629,0.001609341,0.9709125,0.001392542,0.0001920074,0.000109947,0.00002425022,0.0000763647,0.01058675],"genre_scores_gemma":[0.8283025,0.002675536,0.1587167,0.0002531438,0.0005996215,0.0002954751,0.00003942141,0.0001088627,0.00900866],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003031531,"threshold_uncertainty_score":0.01434904,"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","authors":[{"name":"Nabil Seddigh","is_ca":true},{"name":"B. Nandy","is_ca":true},{"name":"Peter Pieda","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005068061,0.0004214628,0.0003916863,0.0006550754,0.0009561772,0.001517072,0.0006337134,0.0007215893,0.0006452309],"category_scores_gemma":[0.02598921,0.0003727111,0.0002350654,0.0005633294,0.001277366,0.002167874,0.0007701769,0.001189186,0.0001288403],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001265156,"about_ca_system_score_gemma":0.0005327549,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001091165,"about_ca_topic_score_gemma":0.0004708868,"domain_scores_codex":[0.9963407,0.001394003,0.0002262887,0.000214572,0.001541322,0.0002831643],"domain_scores_gemma":[0.9734471,0.01853601,0.003468245,0.002036367,0.002049812,0.0004625231],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.004732977,0.0006647256,0.02233516,0.0005460754,0.00009958449,0.001603033,0.003905094,0.07200778,0.7721745,0.04514628,0.0009228932,0.07586192],"study_design_scores_gemma":[0.0002795977,0.002750575,0.02326944,0.0001688337,0.0003485442,0.002150818,0.0009847383,0.3776642,0.5517431,0.03544683,0.005012732,0.0001806685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9518002,0.001136112,0.04403302,0.0003160222,0.00004545721,0.0000672462,0.00004153208,0.0001441837,0.002416153],"genre_scores_gemma":[0.9955396,0.0002106657,0.003987215,0.00002634324,0.00001388742,0.00001342113,0.00001684711,0.00001103553,0.0001810181],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005068061,"threshold_uncertainty_score":0.02680278,"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","authors":[{"name":"Michael Rabbat","is_ca":false},{"name":"Robert Nowak","is_ca":false},{"name":"Mark Coates","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001950567,0.0005669105,0.0007928938,0.0007631039,0.0004625559,0.0009775199,0.001012321,0.0009748701,0.0006398908],"category_scores_gemma":[0.01096758,0.0003266646,0.0004610867,0.0009501111,0.001171922,0.001977211,0.001489437,0.0009230442,0.0001610389],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006627736,"about_ca_system_score_gemma":0.0007666956,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006706445,"about_ca_topic_score_gemma":0.000800421,"domain_scores_codex":[0.9983547,0.0007643022,0.00005296671,0.0002518303,0.0004994713,0.00007660609],"domain_scores_gemma":[0.9958204,0.002598636,0.0005771607,0.0006665367,0.0002596659,0.00007763343],"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.0003489821,0.0001125447,0.00561899,0.0001303179,0.00007837354,0.0004266095,0.0002444174,0.8299327,0.02004347,0.05634351,0.0008485761,0.08587149],"study_design_scores_gemma":[0.00002167167,0.00005904565,0.0005579481,0.000005635677,0.000008732455,0.0001552758,0.00002705277,0.9723368,0.007037791,0.01921983,0.0005568585,0.00001331764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02640129,0.00007972508,0.9721137,0.0001079829,0.00001231759,0.00004810158,0.00004417474,0.0003297717,0.0008628887],"genre_scores_gemma":[0.725358,0.0001061248,0.2733152,0.00006060152,0.0000200223,0.0001347392,0.00007838263,0.00004053466,0.0008863595],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001950567,"threshold_uncertainty_score":0.01031566,"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","authors":[{"name":"Adepele Williams","is_ca":true},{"name":"Martin Arlitt","is_ca":true},{"name":"Carey Williamson","is_ca":true},{"name":"Ken Barker","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001424288,0.001530108,0.0008937449,0.003071037,0.0005451426,0.003988156,0.001074135,0.001016911,0.006698522],"category_scores_gemma":[0.003548772,0.0004934199,0.0004795753,0.003983496,0.00100342,0.005602609,0.0009770837,0.002249447,0.005110618],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001872786,"about_ca_system_score_gemma":0.0009610539,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005814612,"about_ca_topic_score_gemma":0.005344997,"domain_scores_codex":[0.9990987,0.0001244793,0.00005677949,0.0002984715,0.0003449394,0.00007670515],"domain_scores_gemma":[0.9980742,0.0004063719,0.0000583383,0.000274796,0.001089078,0.00009726671],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.0001278659,0.000254691,0.002387922,0.0002389023,0.00003776855,0.00009901558,0.0004915819,0.003983266,0.008760737,0.08922863,0.1410828,0.7533069],"study_design_scores_gemma":[0.00001860896,0.0001443453,0.00888293,0.000477331,0.00008045111,0.0006500505,0.0005241355,0.05956595,0.02226024,0.09717429,0.8100498,0.0001718626],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02937185,0.04471495,0.7175147,0.01010352,0.009499515,0.0003725092,0.002979086,0.006127081,0.1793168],"genre_scores_gemma":[0.2114149,0.02194837,0.2522334,0.005317206,0.005596187,0.0004104262,0.004083059,0.003716443,0.4952801],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006698522,"threshold_uncertainty_score":0.02240878,"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","authors":[{"name":"Lin Cai","is_ca":true},{"name":"Xuemin Shen","is_ca":true},{"name":"Jianping Pan","is_ca":true},{"name":"J.W. Mark","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004036685,0.001083206,0.0008034207,0.001622545,0.0007128841,0.001740771,0.001326626,0.0008868301,0.001439104],"category_scores_gemma":[0.01764032,0.0003971635,0.0005665479,0.0008001617,0.0006506742,0.001718116,0.001299819,0.001121241,0.0003568524],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001109389,"about_ca_system_score_gemma":0.0009393069,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008431543,"about_ca_topic_score_gemma":0.0006152294,"domain_scores_codex":[0.9972771,0.0009040756,0.0001662509,0.0002067275,0.001179547,0.0002663242],"domain_scores_gemma":[0.9917203,0.004992478,0.0005687162,0.0007501365,0.001772665,0.0001956452],"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.001877484,0.0004092573,0.007641019,0.0006917773,0.0002893852,0.0004410936,0.0003558359,0.6270481,0.04784829,0.03626335,0.0025581,0.2745762],"study_design_scores_gemma":[0.00001872061,0.00016264,0.0005060998,0.00001051837,0.00003176834,0.0001322626,0.00001892937,0.9895946,0.00678798,0.002186272,0.000534344,0.00001593547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1129881,0.003301497,0.8768864,0.0002906562,0.0001586162,0.0002132516,0.00006917596,0.001230669,0.00486166],"genre_scores_gemma":[0.9159815,0.0009586886,0.08186582,0.0001033342,0.00009329844,0.0001057914,0.00008731207,0.00007727487,0.000727027],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004036685,"threshold_uncertainty_score":0.02134824,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2162932658","doi":"10.1109/tnet.2005.852881","title":"Load balancing for parallel forwarding","year":2005,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":104,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Load balancing (electrical power); Scheduling (production processes); Distributed computing; Computer network; The Internet; Network packet; Hash function; Packet forwarding; Workload; Internet traffic; Operating system","authors":[{"name":"Weiguang Shi","is_ca":true},{"name":"M.H. MacGregor","is_ca":true},{"name":"Paweł Gburzyński","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02064640572757671,"gpt":0.2499197595625509,"spread":0.2292733538349742,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001406583,0.000600926,0.0005879071,0.0009033238,0.001449057,0.001117416,0.00120616,0.0005830689,0.003084418],"category_scores_gemma":[0.005564358,0.0002687889,0.0003115756,0.0008290131,0.0006525145,0.001753875,0.00120423,0.0004902063,0.0006982174],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001390198,"about_ca_system_score_gemma":0.001169874,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001374176,"about_ca_topic_score_gemma":0.001442568,"domain_scores_codex":[0.9990165,0.000153997,0.00005845634,0.0001811115,0.0004512207,0.0001386576],"domain_scores_gemma":[0.9976403,0.0008121562,0.0002734231,0.0006115723,0.0005625515,0.0001000493],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007775638,0.0004216714,0.005211557,0.0002413259,0.00007674074,0.0002530174,0.0004048666,0.3435819,0.09330042,0.07891842,0.007833646,0.4689789],"study_design_scores_gemma":[0.00003322262,0.00009073696,0.0006110804,0.000008564001,0.00001813134,0.000142655,0.00005001513,0.9459029,0.01312125,0.03536031,0.004645813,0.00001539033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1662585,0.0004710778,0.81888,0.0003884869,0.0001802293,0.0002592973,0.0001121186,0.002451184,0.01099905],"genre_scores_gemma":[0.8755483,0.0002045924,0.1203447,0.0001107813,0.0001680162,0.0001715574,0.0001618527,0.0001670351,0.003123154],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003084418,"threshold_uncertainty_score":0.0103184,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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","authors":[{"name":"Anindya Basu","is_ca":true},{"name":"April Rasala","is_ca":false},{"name":"F. Bruce Shepherd","is_ca":true},{"name":"Gordon Wilfong","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004338631,0.0005976532,0.0009396296,0.0005457035,0.001039298,0.001880237,0.002105701,0.001773527,0.00108243],"category_scores_gemma":[0.01688058,0.0006189921,0.0008670998,0.0009387477,0.003223895,0.004633688,0.002376657,0.002667964,0.0001550026],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00127191,"about_ca_system_score_gemma":0.0009972308,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001462191,"about_ca_topic_score_gemma":0.0009239264,"domain_scores_codex":[0.9970272,0.001366005,0.0001289046,0.0004985202,0.0005936599,0.000385625],"domain_scores_gemma":[0.9893954,0.007373149,0.001341397,0.001185996,0.0004754349,0.0002286498],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002703529,0.0001558364,0.002698258,0.0001447879,0.00007457223,0.0005702096,0.0005579003,0.6726153,0.005891871,0.2930482,0.001574614,0.02239816],"study_design_scores_gemma":[0.00005877895,0.0001042225,0.0002245604,0.00001335057,0.00003172478,0.0001618398,0.0001222293,0.8563846,0.002832093,0.138882,0.001166688,0.00001793957],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1439917,0.0002903026,0.8494566,0.0009289428,0.0000670906,0.00009662852,0.00005039337,0.0003466635,0.004771676],"genre_scores_gemma":[0.8663887,0.0003358478,0.1310908,0.0002031253,0.00008518923,0.0001455536,0.00008351881,0.00008595085,0.00158136],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004338631,"threshold_uncertainty_score":0.02294517,"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","authors":[{"name":"George Kesidis","is_ca":true},{"name":"Abhishek Singh","is_ca":true},{"name":"Donny Cheung","is_ca":true},{"name":"W.W. Kwok","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001931124,0.0004996508,0.0006292766,0.0002928807,0.0008161119,0.001344116,0.001417178,0.001352699,0.003518039],"category_scores_gemma":[0.008118287,0.0004348849,0.0006588425,0.0003208964,0.0009202153,0.001556367,0.0009119396,0.001265482,0.0004303915],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009919915,"about_ca_system_score_gemma":0.002197755,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006735087,"about_ca_topic_score_gemma":0.002633089,"domain_scores_codex":[0.9990568,0.0004366076,0.00004054757,0.00007127268,0.0003024426,0.00009247062],"domain_scores_gemma":[0.9971581,0.002056854,0.0000805292,0.0001829016,0.0003663411,0.0001553522],"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.0001046778,0.00006767066,0.000652679,0.00003934566,0.00002224929,0.0000675758,0.00004586159,0.9531671,0.002026015,0.0346742,0.0004535537,0.008679072],"study_design_scores_gemma":[0.00001764919,0.00001641942,0.0000241327,0.00000367673,0.000003093118,0.000005316556,0.000004483667,0.9948274,0.0004463465,0.003395904,0.001251454,0.000004107074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06751018,0.0002402688,0.9190579,0.001259775,0.0001906812,0.0002976155,0.0002132435,0.001254629,0.009975787],"genre_scores_gemma":[0.7765334,0.0003294761,0.2191834,0.0001939345,0.00004930611,0.0005108154,0.0003162445,0.0001016858,0.002781606],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006735087,"threshold_uncertainty_score":0.01339179,"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","authors":[{"name":"Jebril Hadi","is_ca":true},{"name":"Uvaiz Ahmed","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004775961,0.0008230496,0.0006929275,0.0006572317,0.000550615,0.000971546,0.001152391,0.0005507357,0.0008535404],"category_scores_gemma":[0.01431395,0.0002272896,0.0001572576,0.0008343832,0.000665629,0.001847397,0.0008680202,0.0006934604,0.0001357359],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009681494,"about_ca_system_score_gemma":0.0006481116,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00389098,"about_ca_topic_score_gemma":0.00180219,"domain_scores_codex":[0.9957992,0.001513873,0.000312279,0.000380634,0.001506883,0.0004869705],"domain_scores_gemma":[0.9874572,0.007626439,0.0008896373,0.001074878,0.002483794,0.0004680563],"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.00792403,0.001831526,0.03121619,0.001370792,0.0003684299,0.0006158682,0.0007302981,0.5767156,0.1165793,0.005837447,0.004103183,0.2527074],"study_design_scores_gemma":[0.0001330347,0.003194038,0.009573006,0.00004341132,0.0001044611,0.0002737974,0.0001091551,0.941335,0.04343497,0.0005363147,0.001204321,0.00005846006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9606673,0.001527501,0.03092418,0.0001526496,0.0001228493,0.0001314893,0.0001330768,0.001314093,0.005026865],"genre_scores_gemma":[0.9938323,0.000192408,0.005346345,0.00002285744,0.00002443172,0.00002172749,0.00009901067,0.00003903105,0.0004219032],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004775961,"threshold_uncertainty_score":0.02525795,"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","authors":[{"name":"Neda Beheshti","is_ca":false},{"name":"Yashar Ganjali","is_ca":true},{"name":"Monia Ghobadi","is_ca":true},{"name":"Nick McKeown","is_ca":false},{"name":"Geoff Salmon","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001620642,0.0007880083,0.0004632099,0.0006949609,0.0003893542,0.0007149472,0.001697827,0.0007412169,0.003518709],"category_scores_gemma":[0.006722757,0.000286025,0.0001702455,0.0008188799,0.0006435445,0.001359997,0.0005633826,0.0007945922,0.0003936028],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006454339,"about_ca_system_score_gemma":0.0002876398,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006919605,"about_ca_topic_score_gemma":0.0005562704,"domain_scores_codex":[0.9983178,0.0003914697,0.0001840553,0.0003642774,0.0004647975,0.0002775255],"domain_scores_gemma":[0.9924874,0.004082859,0.0008577744,0.001015095,0.001304031,0.0002527873],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.003464091,0.003391551,0.009688553,0.0008987397,0.0001673922,0.0005944367,0.0005011467,0.09155627,0.8048742,0.005996423,0.003414284,0.07545292],"study_design_scores_gemma":[0.0003108259,0.006403474,0.00462497,0.00006257828,0.0001056944,0.0003735239,0.0003479011,0.1709658,0.8102745,0.002358526,0.004097131,0.00007515627],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.974928,0.0005497675,0.01822245,0.0002210353,0.0001553851,0.0001205119,0.0006186578,0.0007188238,0.004465418],"genre_scores_gemma":[0.9833129,0.0001917857,0.01460709,0.00007943463,0.00002254835,0.00007710179,0.0004833084,0.00005417525,0.001171635],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003518709,"threshold_uncertainty_score":0.0117712,"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","authors":[{"name":"Yang Liu","is_ca":true},{"name":"Xiaoping Liu","is_ca":true},{"name":"Yuanwei Jing","is_ca":false},{"name":"Shaowei Zhou","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009265344,0.0007424895,0.0006559166,0.0003634244,0.000405158,0.0007753426,0.0006988345,0.001051665,0.0012732],"category_scores_gemma":[0.003685403,0.0002583269,0.0004092309,0.0003766181,0.0008342103,0.000566436,0.001146423,0.001009095,0.0001522972],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007584756,"about_ca_system_score_gemma":0.0009808976,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007928934,"about_ca_topic_score_gemma":0.002896642,"domain_scores_codex":[0.9995614,0.0001168624,0.00002119655,0.00008103513,0.0001551387,0.00006437104],"domain_scores_gemma":[0.9988843,0.0004992097,0.0001241485,0.00007404057,0.0003799616,0.00003828783],"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.0001847144,0.00007026911,0.0003175581,0.0001425107,0.00002988384,0.0001268641,0.000138874,0.9430674,0.009131565,0.01507198,0.0007766116,0.03094184],"study_design_scores_gemma":[0.00001053718,0.00005252282,0.00007935779,0.000002478936,0.000004289427,0.000006483554,0.000005857883,0.9978124,0.0006439165,0.001259891,0.0001178561,0.000004377204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07087867,0.000204967,0.9229994,0.0002243306,0.0001236158,0.00005044083,0.0000258176,0.0002725305,0.005220198],"genre_scores_gemma":[0.9871752,0.00008949122,0.009915464,0.00004271666,0.00002488114,0.00005379065,0.00001984038,0.00001496179,0.002663647],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007928934,"threshold_uncertainty_score":0.01576555,"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","authors":[{"name":"David Pariag","is_ca":true},{"name":"Tim Brecht","is_ca":true},{"name":"Ashif S. Harji","is_ca":true},{"name":"Peter A. Buhr","is_ca":true},{"name":"Amol Shukla","is_ca":true},{"name":"David R. Cheriton","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00273166,0.001514155,0.001204132,0.002584122,0.000958626,0.002052742,0.002350722,0.001345688,0.003000178],"category_scores_gemma":[0.01106931,0.0006084124,0.0006085366,0.002935866,0.000665285,0.003477368,0.001315783,0.001397576,0.001229488],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001356317,"about_ca_system_score_gemma":0.001010659,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003758084,"about_ca_topic_score_gemma":0.002128152,"domain_scores_codex":[0.9955422,0.000835346,0.0003985717,0.0005028458,0.001955618,0.0007654919],"domain_scores_gemma":[0.9912273,0.003152059,0.0003466906,0.001456649,0.003211414,0.0006059012],"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.007948758,0.002891374,0.04294986,0.00144552,0.001027968,0.0006241381,0.0005871247,0.5581679,0.108828,0.009467557,0.01394377,0.252118],"study_design_scores_gemma":[0.0003926113,0.004143013,0.03755502,0.00007881058,0.0003238285,0.0004368029,0.0006881549,0.8170564,0.1261072,0.004703684,0.008334466,0.0001801217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9669028,0.001220608,0.01590213,0.0002428254,0.0002250186,0.0001401396,0.0004945207,0.00537893,0.00949309],"genre_scores_gemma":[0.98361,0.0005004438,0.01183513,0.00007774556,0.00006648617,0.00009238326,0.001252507,0.000506927,0.002058394],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003758084,"threshold_uncertainty_score":0.01444662,"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","authors":[{"name":"Biswajit Nandy","is_ca":true},{"name":"Nabil Seddigh","is_ca":true},{"name":"Peter Pieda","is_ca":true},{"name":"Jeremy Ethridge","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000399368,0.0005082621,0.0005408842,0.000394923,0.0004330061,0.0009422187,0.001272331,0.00064486,0.003537397],"category_scores_gemma":[0.0008555395,0.0003237064,0.0001889367,0.0002358854,0.0003938561,0.0007611985,0.0003895248,0.0009309062,0.000646936],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006105996,"about_ca_system_score_gemma":0.000285974,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008779002,"about_ca_topic_score_gemma":0.001672577,"domain_scores_codex":[0.9997762,0.00002565958,0.00001163362,0.00004455075,0.0001128557,0.0000290139],"domain_scores_gemma":[0.9996941,0.0001104913,0.00003775003,0.00004814705,0.00009354294,0.00001597685],"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.0007774527,0.0002449617,0.0004943035,0.0002087846,0.00003389957,0.0002103595,0.0003237909,0.1051314,0.1731058,0.06053848,0.01339701,0.6455337],"study_design_scores_gemma":[0.0001099847,0.0004398616,0.0006294225,0.00004624662,0.00008107837,0.0002439752,0.00003716119,0.8827144,0.06242373,0.02285842,0.03036555,0.00005010949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03314057,0.001589066,0.9513596,0.0002578232,0.000322244,0.000130025,0.00007811248,0.003753218,0.009369361],"genre_scores_gemma":[0.7663651,0.001090282,0.2140486,0.0002563892,0.0002634079,0.0001253309,0.0001672486,0.0001552177,0.01752857],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003537397,"threshold_uncertainty_score":0.01183373,"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","authors":[{"name":"Monia Ghobadi","is_ca":true},{"name":"Yuchung Cheng","is_ca":false},{"name":"Ankur Jain","is_ca":false},{"name":"Matt Mathis","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008512058,0.0009186271,0.0005951945,0.001051555,0.0005444561,0.0008867143,0.002403202,0.000705004,0.002165942],"category_scores_gemma":[0.004390937,0.0002833234,0.0002540074,0.0004486163,0.0006067083,0.001793376,0.001571666,0.000967255,0.0004995903],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008767885,"about_ca_system_score_gemma":0.000646637,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006226386,"about_ca_topic_score_gemma":0.004945395,"domain_scores_codex":[0.9991884,0.0001149275,0.00006105271,0.0001419396,0.0003080194,0.0001856496],"domain_scores_gemma":[0.9981147,0.0005341126,0.0002686767,0.0003783121,0.0004765063,0.0002277089],"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.00567054,0.001738449,0.03078243,0.001711568,0.000574138,0.002725672,0.001034095,0.1045585,0.3780695,0.008121922,0.06752425,0.3974889],"study_design_scores_gemma":[0.000675007,0.002579959,0.02020427,0.0001575793,0.0001743405,0.001714916,0.0002458769,0.6804609,0.2610014,0.002398703,0.03004685,0.0003401357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7780525,0.003286249,0.1372064,0.0007156368,0.0004695009,0.001105866,0.001717518,0.06160351,0.01584278],"genre_scores_gemma":[0.9776474,0.0003209938,0.01822003,0.0002357484,0.00005509902,0.0001917718,0.0005387429,0.0003970163,0.002393098],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006226386,"threshold_uncertainty_score":0.0123803,"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","authors":[{"name":"W. Almesberger","is_ca":false},{"name":"J. Hadi Salim","is_ca":true},{"name":"A. L. Kuznetsov","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001036851,0.0007538024,0.0006088246,0.001099992,0.0008934389,0.003041356,0.001448083,0.0007413314,0.01062554],"category_scores_gemma":[0.003919196,0.0005705758,0.00047509,0.001349417,0.000800941,0.002951368,0.002957145,0.001665621,0.006178374],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001935471,"about_ca_system_score_gemma":0.001295826,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007368309,"about_ca_topic_score_gemma":0.002264095,"domain_scores_codex":[0.9985952,0.0001691685,0.00009054359,0.0001304094,0.0007329231,0.000281746],"domain_scores_gemma":[0.9986185,0.0001506999,0.00006801229,0.0005665341,0.0004225244,0.0001738124],"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.001199797,0.0002219486,0.0026392,0.0003585571,0.00005553594,0.000718124,0.001000335,0.0261252,0.04013167,0.4480067,0.09620838,0.3833345],"study_design_scores_gemma":[0.0003747629,0.0003063306,0.003873256,0.0002490113,0.00009197784,0.0008837239,0.0002153283,0.185066,0.04113705,0.1628494,0.6047607,0.0001924295],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07072102,0.004484734,0.6968087,0.001757341,0.0009268338,0.0005488955,0.001438481,0.06652588,0.1567882],"genre_scores_gemma":[0.6782954,0.004508215,0.2206917,0.0009100859,0.0005620308,0.0004355082,0.004593109,0.004012207,0.08599176],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01062554,"threshold_uncertainty_score":0.035546,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2013174072","doi":"10.1109/tnet.2003.818196","title":"Priority service and max-min fairness","year":2003,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Game theory; Computer network; Nash equilibrium; Bandwidth allocation; Bandwidth (computing); Max-min fairness; Service (business); Quality of service; Mathematical optimization; Resource allocation; Microeconomics","authors":[{"name":"Peter Marbach","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0188926864910351,"gpt":0.2288178971658632,"spread":0.2099252106748281,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004020841,0.001232271,0.001131628,0.0006564335,0.001644144,0.003685366,0.002239025,0.001699678,0.005235863],"category_scores_gemma":[0.01070283,0.0006449159,0.0006695578,0.001163983,0.002690333,0.005683972,0.001692371,0.002111936,0.0006631764],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002999391,"about_ca_system_score_gemma":0.003100472,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003887518,"about_ca_topic_score_gemma":0.001864918,"domain_scores_codex":[0.9963315,0.001313969,0.00009708948,0.0005057552,0.0009706675,0.0007810251],"domain_scores_gemma":[0.9952531,0.00305012,0.0005179893,0.0002703518,0.0005261974,0.0003822751],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002223474,0.00007413534,0.0004311509,0.00009630751,0.00003144955,0.0001677273,0.0002676816,0.08751976,0.001373281,0.897642,0.002044631,0.01012958],"study_design_scores_gemma":[0.00007585231,0.00009644776,0.0002233533,0.00002684707,0.00003330502,0.0002037904,0.0001027096,0.4418154,0.0008042018,0.5487029,0.007890996,0.0000241887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07331382,0.00210954,0.8706701,0.002664037,0.0004665939,0.000110591,0.0001409444,0.0002279578,0.05029632],"genre_scores_gemma":[0.9340519,0.001289134,0.04866744,0.0004182617,0.0007947644,0.0001323424,0.00006413138,0.00009066324,0.01449139],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005235863,"threshold_uncertainty_score":0.02176225,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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","authors":[{"name":"José R. Gallardo","is_ca":true},{"name":"Dimitrios Makrakis","is_ca":true},{"name":"Luis Orozco–Barbosa","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002607864,0.000601608,0.0005681771,0.0007829764,0.0004427713,0.0007743923,0.0007329492,0.0008130733,0.0004253873],"category_scores_gemma":[0.008769869,0.0003299306,0.0004879327,0.0006101368,0.0006909533,0.0008644761,0.0004725798,0.0006363303,0.00007827768],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001036793,"about_ca_system_score_gemma":0.0005393912,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004326454,"about_ca_topic_score_gemma":0.002282528,"domain_scores_codex":[0.9992682,0.00043675,0.00003779513,0.00005579827,0.0001487962,0.00005271511],"domain_scores_gemma":[0.9966067,0.002452554,0.0003006611,0.0001528495,0.0003992925,0.00008789906],"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.00003624694,0.00004310831,0.0007819621,0.00001672002,0.00001986945,0.00004819185,0.00002846564,0.971023,0.001654539,0.02153696,0.0001032921,0.004707711],"study_design_scores_gemma":[0.000001335757,0.000007062079,0.00003734383,9.148064e-7,0.000002238914,0.000003255263,0.000001268894,0.9986545,0.0001342637,0.001138061,0.00001858994,0.00000124823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2771008,0.0003590339,0.7180364,0.0002116743,0.00006847911,0.00008824192,0.00005568029,0.0001766222,0.003903222],"genre_scores_gemma":[0.9875137,0.0001323733,0.01182296,0.00002205179,0.0000142341,0.00002344251,0.00002214327,0.00001314565,0.0004359181],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004326454,"threshold_uncertainty_score":0.01379186,"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","authors":[{"name":"Sudip Misra","is_ca":false},{"name":"B. John Oommen","is_ca":true},{"name":"Sreekeerthy Yanamandra","is_ca":false},{"name":"Mohammad S. Obaidat","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00109137,0.0005269801,0.0008256941,0.0004072715,0.0004378125,0.0009015013,0.001307635,0.001161128,0.00158611],"category_scores_gemma":[0.003135764,0.0003143148,0.0005811274,0.0003212827,0.001103618,0.0007691834,0.001284331,0.001415228,0.0001981668],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001158177,"about_ca_system_score_gemma":0.001395138,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005114462,"about_ca_topic_score_gemma":0.004016202,"domain_scores_codex":[0.9995846,0.0001324718,0.00002105874,0.00009540157,0.00009905446,0.00006734794],"domain_scores_gemma":[0.9985927,0.0009338006,0.0001259278,0.00008014983,0.0001825083,0.00008493845],"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.00003094667,0.00003084928,0.000481242,0.00003589069,0.00001996386,0.00003801173,0.00005285768,0.964485,0.0008150132,0.02031856,0.0003556864,0.01333587],"study_design_scores_gemma":[0.000004355391,0.00001149464,0.00001834516,0.00000198047,0.000002041902,0.000004550364,0.000002865979,0.9971481,0.00008678735,0.002615814,0.0001014449,0.000002229669],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01833719,0.0001768497,0.978056,0.0003511149,0.00004209479,0.00004349647,0.00002053744,0.0002230517,0.002749776],"genre_scores_gemma":[0.870674,0.0002215715,0.1240556,0.0002115214,0.00004279491,0.0002339239,0.00004771163,0.00004104904,0.004471807],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005114462,"threshold_uncertainty_score":0.01016939,"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","authors":[{"name":"James Aweya","is_ca":true},{"name":"Michel Ouellette","is_ca":true},{"name":"Delfin Y. Montuno","is_ca":true},{"name":"Bernard Doray","is_ca":true},{"name":"Kent Felske","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007827015,0.000462141,0.0004711993,0.0009170548,0.0009581604,0.001051324,0.00140477,0.0006155015,0.003347598],"category_scores_gemma":[0.001752193,0.0002062952,0.0001980082,0.0006892298,0.0005193863,0.00132336,0.001380296,0.0009106945,0.0009046661],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006674557,"about_ca_system_score_gemma":0.0004191184,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009103406,"about_ca_topic_score_gemma":0.0007107435,"domain_scores_codex":[0.9991915,0.0001929818,0.00005498957,0.0001304726,0.0003162241,0.0001137678],"domain_scores_gemma":[0.9990414,0.000195661,0.00008187497,0.0002433652,0.0002957775,0.0001418673],"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.001730382,0.0009686589,0.002755559,0.0002015666,0.0001086479,0.0005031091,0.0006260732,0.1573933,0.1996702,0.05458118,0.01073806,0.5707232],"study_design_scores_gemma":[0.0001630348,0.0001658899,0.0008495837,0.00001598948,0.00003419286,0.0001634698,0.00004630576,0.9425068,0.02637154,0.01759579,0.01203883,0.00004851312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1454752,0.0005429812,0.8351462,0.0004114601,0.0002619108,0.0002690142,0.00009658473,0.00721064,0.01058601],"genre_scores_gemma":[0.9323398,0.0001267047,0.06226232,0.0001632859,0.0001426641,0.0001191955,0.0001077027,0.0001314118,0.004606883],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003347598,"threshold_uncertainty_score":0.01119888,"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","authors":[{"name":"Mark Coates","is_ca":true},{"name":"Rui Castro","is_ca":false},{"name":"Robert Nowak","is_ca":false},{"name":"Manik Gadhiok","is_ca":false},{"name":"Ryan King","is_ca":false},{"name":"Yolanda Tsang","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002321606,0.0006020069,0.0008453014,0.001575833,0.0004772177,0.001167438,0.001172169,0.0008568819,0.0007852426],"category_scores_gemma":[0.01664646,0.0005211683,0.0003338066,0.0012472,0.0007479649,0.002406439,0.001357257,0.00100001,0.0003703601],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007025777,"about_ca_system_score_gemma":0.0007054449,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001397309,"about_ca_topic_score_gemma":0.001813769,"domain_scores_codex":[0.9986777,0.0007113949,0.00004352277,0.0001651186,0.0003300711,0.00007208435],"domain_scores_gemma":[0.9933928,0.00455902,0.0008120939,0.0005590666,0.0005599406,0.0001171546],"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.0002844006,0.0001041745,0.008993882,0.0001397824,0.00007241851,0.0001597549,0.0002316261,0.8338389,0.01002393,0.02660491,0.0009642034,0.118582],"study_design_scores_gemma":[0.000007139422,0.00001708477,0.0006946829,0.000005233954,0.000004774035,0.000040893,0.00001631615,0.9892895,0.002244899,0.007408417,0.0002613873,0.00000962788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02695513,0.00007930679,0.9719543,0.00007500271,0.000004065644,0.00003017038,0.00005941668,0.0002610839,0.0005814714],"genre_scores_gemma":[0.6040366,0.0002185949,0.3940352,0.00003274289,0.00001962872,0.0001304031,0.0004457902,0.0000859456,0.000995049],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002321606,"threshold_uncertainty_score":0.01227796,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2107631978","doi":"10.1109/tnet.2009.2035115","title":"A System-Theoretic Approach to Bandwidth Estimation","year":2009,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Network calculus; Computer science; Bandwidth (computing); Network packet; Nonlinear system; Testbed; Robustness (evolution); Algorithm; Computer network; Quality of service","authors":[{"name":"Jörg Liebeherr","is_ca":true},{"name":"Markus Fidler","is_ca":false},{"name":"Shahrokh Valaee","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01373783591961571,"gpt":0.2264381860413313,"spread":0.2127003501217156,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002481552,0.001400958,0.001316587,0.001549423,0.0007915281,0.003051578,0.001984391,0.001430108,0.0041048],"category_scores_gemma":[0.007061578,0.0007021697,0.001462474,0.001425823,0.00237203,0.004700663,0.002225913,0.003512925,0.0008329168],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001937043,"about_ca_system_score_gemma":0.001599748,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003601108,"about_ca_topic_score_gemma":0.0017854,"domain_scores_codex":[0.9978568,0.0007368656,0.0001252517,0.0004483421,0.0006732758,0.0001595008],"domain_scores_gemma":[0.9971884,0.001924646,0.000220741,0.0002572448,0.0003554819,0.00005359415],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002183489,0.00003133448,0.0003823839,0.0001354638,0.00006383023,0.0001046224,0.0001614584,0.3656151,0.001059509,0.6093246,0.001308317,0.02179164],"study_design_scores_gemma":[0.000005993481,0.00002927762,0.0001053178,0.00002779343,0.00002096318,0.00005324344,0.00003854517,0.7122641,0.0006020222,0.2814927,0.005333141,0.0000269161],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.000599835,0.0002203254,0.9971465,0.0001988116,0.0000362842,0.00001045005,0.00002743421,0.00005019526,0.001710082],"genre_scores_gemma":[0.4851536,0.003710057,0.4969573,0.0007453928,0.001418829,0.000419808,0.000382855,0.0002486009,0.01096367],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0041048,"threshold_uncertainty_score":0.0140543,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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","authors":[{"name":"Chonggang Wang","is_ca":false},{"name":"Jiangchuan Liu","is_ca":true},{"name":"Bo Li","is_ca":false},{"name":"K. Sohraby","is_ca":false},{"name":"Y. Thomas Hou","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002002818,0.0009451633,0.001070894,0.001304929,0.000457539,0.0008933742,0.003386854,0.001158132,0.000712808],"category_scores_gemma":[0.004696239,0.0003426933,0.0005312726,0.0006349682,0.0007117321,0.001346316,0.001325726,0.001612774,0.0003293941],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009039462,"about_ca_system_score_gemma":0.001054764,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002014279,"about_ca_topic_score_gemma":0.001107439,"domain_scores_codex":[0.9989272,0.000249754,0.00008729314,0.0002693892,0.0003894584,0.00007686009],"domain_scores_gemma":[0.9986235,0.0005206479,0.0003115466,0.0001503433,0.00033126,0.0000627366],"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.0005259605,0.0003116379,0.003046923,0.0002861405,0.0002049151,0.0001818945,0.0002019622,0.4272003,0.03728135,0.01640081,0.005030842,0.5093272],"study_design_scores_gemma":[0.00005184454,0.00008924635,0.0002306938,0.000007146476,0.00001651551,0.00005336599,0.000008877865,0.9915748,0.004597478,0.001826673,0.001517645,0.00002574907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01049144,0.0004862814,0.9853683,0.0001845815,0.000126163,0.00009311688,0.00004028645,0.002417771,0.0007920261],"genre_scores_gemma":[0.5154095,0.0003832268,0.4809515,0.0004211207,0.0001538093,0.0002430851,0.0002048741,0.000142128,0.002090754],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003386854,"threshold_uncertainty_score":0.01059204,"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","authors":[{"name":"Ming Jiang","is_ca":true},{"name":"Mladen Nikolić","is_ca":true},{"name":"Stephen Hardy","is_ca":true},{"name":"Ljiljana Trajković","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001755834,0.0003256541,0.0004737055,0.0008041828,0.0006225479,0.001095225,0.0007012659,0.0007442839,0.0007224825],"category_scores_gemma":[0.02158668,0.0002317774,0.0002630238,0.0005389975,0.0008797018,0.002023156,0.001041663,0.0005066342,0.0002124372],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008687488,"about_ca_system_score_gemma":0.0004598495,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007796149,"about_ca_topic_score_gemma":0.0006277544,"domain_scores_codex":[0.9985347,0.0004034887,0.00009927519,0.0001778697,0.0005396688,0.0002449292],"domain_scores_gemma":[0.9794756,0.01331824,0.002085551,0.001886387,0.002254474,0.0009798477],"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.001636938,0.001200009,0.1942753,0.0003049988,0.0004798961,0.001839008,0.0007165323,0.6424784,0.0733589,0.009154796,0.001218599,0.07333663],"study_design_scores_gemma":[0.00005138491,0.001056714,0.03573171,0.00002209584,0.00009911249,0.00118909,0.00036573,0.9106636,0.04423014,0.005778745,0.0007594028,0.0000522593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9912363,0.0002105443,0.006915333,0.00009592824,0.00001712164,0.00001987305,0.00003118266,0.0001409121,0.001332722],"genre_scores_gemma":[0.9994625,0.00003586827,0.0003580813,0.00001123777,0.000005074062,0.000002976054,0.00002427262,0.00001156161,0.00008835277],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001755834,"threshold_uncertainty_score":0.009285867,"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)","authors":[{"name":"Yang Hong","is_ca":true},{"name":"Oliver Yang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006012657,0.0005410716,0.0004689215,0.0004449163,0.0004225711,0.0007181677,0.001483391,0.0006602221,0.001261606],"category_scores_gemma":[0.00123329,0.0002500179,0.0003166871,0.0002395765,0.0003509055,0.000628385,0.0003399176,0.0007557145,0.0003854508],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003637392,"about_ca_system_score_gemma":0.0005367164,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001071003,"about_ca_topic_score_gemma":0.0007415215,"domain_scores_codex":[0.9995841,0.00005936747,0.00002762034,0.0001085539,0.000179892,0.00004040291],"domain_scores_gemma":[0.9995071,0.000119866,0.00007013415,0.00003443566,0.0002454683,0.00002295063],"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.0005312025,0.0003925853,0.002301788,0.0005305646,0.0001583229,0.0005832399,0.0004564874,0.3105229,0.1928617,0.04162958,0.004843354,0.4451883],"study_design_scores_gemma":[0.0001015764,0.0002019818,0.000309585,0.00001167099,0.00003693677,0.0001366409,0.00001248637,0.9776084,0.01620269,0.002255486,0.003100633,0.00002196733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009147059,0.0002118013,0.9876654,0.0001008122,0.00009361876,0.00007993187,0.000009725379,0.0007939591,0.001897687],"genre_scores_gemma":[0.7953507,0.0004026643,0.2011967,0.0002089921,0.0001873016,0.0002889193,0.00005173431,0.00005855746,0.002254454],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001483391,"threshold_uncertainty_score":0.004220426,"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","authors":[{"name":"Martin Arlitt","is_ca":true},{"name":"Carey Williamson","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008576133,0.0003057766,0.0003833619,0.003570908,0.0004369481,0.0007660997,0.0005135275,0.0004719434,0.0005429314],"category_scores_gemma":[0.00580954,0.0002108748,0.0002767198,0.002799569,0.000347174,0.0009600588,0.0003801379,0.0008127511,0.0002293943],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006717658,"about_ca_system_score_gemma":0.0002289014,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004510356,"about_ca_topic_score_gemma":0.002845778,"domain_scores_codex":[0.9992242,0.0001635682,0.0000511056,0.0001103339,0.0003421812,0.0001086278],"domain_scores_gemma":[0.9955477,0.001594581,0.000757685,0.00056281,0.001257753,0.0002795098],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.0009067088,0.000535896,0.7964526,0.0002704107,0.0003013484,0.00230866,0.002513992,0.04259632,0.04539599,0.002729562,0.003713281,0.1022752],"study_design_scores_gemma":[0.00001364439,0.0004538717,0.8348597,0.00004205871,0.0001310037,0.001732156,0.0009819049,0.1468297,0.01018258,0.0007733414,0.003939647,0.00006052731],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9974687,0.0002107237,0.0009576241,0.00003287988,0.000007399592,0.0000160835,0.0002197322,0.00009091569,0.0009959709],"genre_scores_gemma":[0.9987795,0.0001317159,0.0003701023,0.000007630375,0.00001048212,0.000007919881,0.0004707522,0.00001585866,0.0002061496],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004510356,"threshold_uncertainty_score":0.008968174,"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","authors":[{"name":"Biswanath Mukherjee","is_ca":true},{"name":"Tim Brecht","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002095574,0.001048378,0.00071211,0.001094063,0.001221767,0.002451864,0.002412583,0.002260926,0.0127614],"category_scores_gemma":[0.007264397,0.0006943627,0.0007996392,0.001568374,0.001111097,0.002841126,0.001977472,0.004301932,0.007933485],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001152231,"about_ca_system_score_gemma":0.001726165,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001166126,"about_ca_topic_score_gemma":0.0009334311,"domain_scores_codex":[0.9970825,0.0006616689,0.0002683878,0.0003367185,0.001410453,0.0002402342],"domain_scores_gemma":[0.9976727,0.0006427614,0.0002836148,0.0005261184,0.0007175608,0.0001572553],"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.0003022734,0.0001788385,0.0009548558,0.001708649,0.0001543043,0.001503509,0.0006644604,0.0143591,0.03835152,0.3781169,0.1438877,0.4198178],"study_design_scores_gemma":[0.00006596473,0.0002064846,0.0004556787,0.0003849344,0.00009933247,0.001474442,0.0000579189,0.06932169,0.01129628,0.03388754,0.8826259,0.0001238268],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002926269,0.01247346,0.9318777,0.001528237,0.005471064,0.0007180565,0.0003551178,0.008546966,0.03610317],"genre_scores_gemma":[0.1359368,0.02306452,0.7729326,0.003783936,0.00662835,0.002217902,0.001786979,0.004373118,0.04927583],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0127614,"threshold_uncertainty_score":0.04269111,"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","authors":[{"name":"Salma Emara","is_ca":true},{"name":"Baochun Li","is_ca":true},{"name":"Yanjiao Chen","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002478099,0.001171522,0.0008693231,0.0005834859,0.0003985621,0.000748607,0.002008879,0.001007606,0.001947097],"category_scores_gemma":[0.007454079,0.0005066808,0.0004410763,0.0002375028,0.001045841,0.001932549,0.001515464,0.002103631,0.0003280838],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008875275,"about_ca_system_score_gemma":0.001631343,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00573661,"about_ca_topic_score_gemma":0.006053739,"domain_scores_codex":[0.9992612,0.0001948842,0.0000436459,0.0002086195,0.0001656587,0.0001259493],"domain_scores_gemma":[0.9976994,0.001127697,0.0002592588,0.0003012015,0.0004491259,0.0001633098],"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.0001877464,0.0001379392,0.001985749,0.00009493558,0.00006886085,0.00008314423,0.0001753793,0.8666089,0.005437457,0.01045502,0.00280287,0.1119619],"study_design_scores_gemma":[0.00002380135,0.00005253782,0.0000894424,0.00000850217,0.00000889724,0.00001544013,0.00001177108,0.9952363,0.001442726,0.002479233,0.0006245272,0.000006770342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05046346,0.0002380709,0.9423484,0.0003482573,0.0001103685,0.0001308466,0.00004926063,0.002366611,0.00394469],"genre_scores_gemma":[0.7910411,0.0001279842,0.2048425,0.0004896142,0.00006201944,0.0001381458,0.000113856,0.0001866572,0.002998104],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00573661,"threshold_uncertainty_score":0.01310557,"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","authors":[{"name":"Ian W. C. Lee","is_ca":true},{"name":"Abraham O. Fapojuwo","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002493344,0.001751885,0.0026471,0.001601878,0.0007705516,0.002170353,0.002221843,0.002563017,0.004013201],"category_scores_gemma":[0.0100166,0.0009923304,0.001457736,0.002856789,0.001466639,0.002801433,0.001684608,0.004395524,0.001235462],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001964116,"about_ca_system_score_gemma":0.001871112,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008699196,"about_ca_topic_score_gemma":0.005599265,"domain_scores_codex":[0.9986756,0.0005388424,0.0001023188,0.0001687812,0.0004076801,0.0001068498],"domain_scores_gemma":[0.9956855,0.002895475,0.0003776127,0.0003283912,0.000548437,0.000164584],"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.00002084328,0.00005678822,0.000318428,0.0001559459,0.00006980389,0.00007383638,0.00004823788,0.3770422,0.0005759925,0.5960801,0.004146784,0.02141105],"study_design_scores_gemma":[0.000008556381,0.000008026838,0.00007393312,0.00001990107,0.0000144761,0.00001834802,0.000007975279,0.7854598,0.00008648663,0.2109321,0.003360899,0.000009463638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003985728,0.004887731,0.9862652,0.0008697813,0.0004567708,0.00004567814,0.0002574926,0.0002054557,0.003026143],"genre_scores_gemma":[0.5894673,0.0340365,0.332803,0.001181888,0.00434167,0.001000261,0.001958699,0.000688702,0.03452197],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008699196,"threshold_uncertainty_score":0.01729715,"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","authors":[{"name":"Cameron Kiddle","is_ca":true},{"name":"Rob Simmonds","is_ca":true},{"name":"Carey Williamson","is_ca":true},{"name":"Brian Unger","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004806377,0.0004362011,0.0005653034,0.0004933776,0.0003260647,0.0008499488,0.001083221,0.0008172765,0.003076797],"category_scores_gemma":[0.001000584,0.0002494008,0.000482807,0.0004175607,0.0003965283,0.0008175638,0.0007889242,0.000522249,0.0003759409],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005659075,"about_ca_system_score_gemma":0.0007062043,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006257217,"about_ca_topic_score_gemma":0.002661861,"domain_scores_codex":[0.9996344,0.00008801505,0.00001637546,0.00004597727,0.0001654772,0.00004981865],"domain_scores_gemma":[0.999508,0.0002622175,0.00003001559,0.00006949519,0.0000982326,0.00003205887],"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.00009964667,0.00007294228,0.0006928377,0.00003070916,0.00002146318,0.00004503282,0.00002918194,0.9740301,0.003806458,0.006294234,0.0004922114,0.01438513],"study_design_scores_gemma":[0.0000109232,0.00001909659,0.00006922321,0.000001039808,0.000002601621,0.000007000222,0.000002565445,0.9971937,0.001103004,0.001045765,0.0005416559,0.000003341293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1560954,0.0001981927,0.825412,0.0001763673,0.0001120567,0.0002599295,0.0005027239,0.002557059,0.01468629],"genre_scores_gemma":[0.8258915,0.0001877616,0.1644851,0.00008675546,0.00003031292,0.0004455144,0.0004472687,0.00009782462,0.008327953],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006257217,"threshold_uncertainty_score":0.01244158,"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","authors":[{"name":"Shahrokh Valaee","is_ca":true},{"name":"Baochun Li","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001054345,0.0006396259,0.0007134716,0.0005704834,0.001021336,0.001673877,0.001777504,0.0008800342,0.001782772],"category_scores_gemma":[0.002925737,0.0002158811,0.0002890123,0.0006043688,0.001061971,0.001416662,0.001239656,0.001495156,0.0004062866],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001581994,"about_ca_system_score_gemma":0.001309186,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003981534,"about_ca_topic_score_gemma":0.002461212,"domain_scores_codex":[0.9984958,0.0003130542,0.00006121794,0.0001892886,0.0007950644,0.0001455551],"domain_scores_gemma":[0.9989139,0.0004487336,0.00008840075,0.0001719675,0.0002855522,0.00009151314],"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.0003767157,0.0002310662,0.001177683,0.0002109831,0.0000990948,0.0002927604,0.0002986041,0.3346892,0.02121124,0.1405204,0.008101689,0.4927906],"study_design_scores_gemma":[0.00004992673,0.00005750259,0.0002106386,0.00001340654,0.00002175014,0.00007153965,0.00002147604,0.9523566,0.003543541,0.03407257,0.009558806,0.00002220307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01130715,0.001466252,0.9801005,0.0003266973,0.0002861235,0.0001003999,0.00003219003,0.002004585,0.004376095],"genre_scores_gemma":[0.8561661,0.001336589,0.1322235,0.000248411,0.0005115636,0.0003062302,0.0001277142,0.0001134564,0.008966412],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003981534,"threshold_uncertainty_score":0.01147825,"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","authors":[{"name":"Phillipa Gill","is_ca":true},{"name":"Michael Schapira","is_ca":false},{"name":"Sharon Goldberg","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002216546,0.0008055968,0.0008685134,0.00186353,0.00189542,0.004115616,0.003106088,0.002105971,0.04932909],"category_scores_gemma":[0.008817703,0.0007773934,0.001132486,0.00166403,0.002243992,0.007850212,0.003514674,0.002329094,0.00336996],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004129732,"about_ca_system_score_gemma":0.004427247,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02030531,"about_ca_topic_score_gemma":0.01385138,"domain_scores_codex":[0.9986688,0.0003447301,0.00006442253,0.0002821182,0.0003441674,0.0002957645],"domain_scores_gemma":[0.9968352,0.001254395,0.0002962684,0.0006105161,0.0006418241,0.0003619324],"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.00004407024,0.00003398249,0.0006069215,0.00004945753,0.00001482941,0.0001157772,0.0001452169,0.2069642,0.0002883874,0.7803949,0.005014942,0.006327365],"study_design_scores_gemma":[0.00004856218,0.0000407383,0.0002567729,0.00005272693,0.00002330915,0.00009032535,0.0001565404,0.6262709,0.0004546453,0.3239192,0.04865221,0.00003420392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07560626,0.001767172,0.6654258,0.009835995,0.001042046,0.0004693455,0.004911045,0.002698057,0.2382444],"genre_scores_gemma":[0.7666003,0.002578739,0.1054535,0.001081347,0.0002939963,0.0006734707,0.002372476,0.0009381164,0.120008],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.04932909,"threshold_uncertainty_score":0.1650223,"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","authors":[{"name":"Hamza Dahmouni","is_ca":false},{"name":"A. Girard","is_ca":true},{"name":"Brunilde Sansò","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001246084,0.0009604741,0.0005777728,0.001190483,0.000557487,0.001301625,0.002017187,0.001157147,0.00199255],"category_scores_gemma":[0.006015912,0.0005051806,0.0006283973,0.001442738,0.0009738833,0.002398072,0.0006681039,0.001305365,0.0006200924],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002085316,"about_ca_system_score_gemma":0.001098932,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004407114,"about_ca_topic_score_gemma":0.001820643,"domain_scores_codex":[0.9991907,0.0001641381,0.00003955221,0.0001104776,0.000388665,0.0001064703],"domain_scores_gemma":[0.9990395,0.0004899578,0.0001141551,0.00009985668,0.0002200478,0.00003638474],"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.0000310481,0.00002549508,0.0003176822,0.00005096,0.00001176993,0.0001387643,0.0001067584,0.8345395,0.002655024,0.1517317,0.0009639677,0.009427302],"study_design_scores_gemma":[0.000002939598,0.00001378635,0.00005159177,0.000008939496,0.000005736756,0.00004629608,0.000009191401,0.9804976,0.0003042491,0.01784465,0.001209552,0.000005473507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01312608,0.001027285,0.9772034,0.0002829824,0.0001201508,0.00005176151,0.00009533672,0.0003473047,0.007745799],"genre_scores_gemma":[0.8434328,0.004789779,0.133479,0.0003866581,0.0004327554,0.00031345,0.0002540908,0.0002636651,0.01664788],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004407114,"threshold_uncertainty_score":0.0151301,"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","authors":[{"name":"Mohammed Ismail","is_ca":true},{"name":"Ioannis Lambadaris","is_ca":true},{"name":"Michael Devetsikiotis","is_ca":true},{"name":"A.R. Kaye","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004199026,0.0004411301,0.0002512035,0.0005155705,0.0001917996,0.0004873024,0.0004954108,0.0006405871,0.0006160288],"category_scores_gemma":[0.001970378,0.0002262863,0.0003324157,0.0003621822,0.0003811282,0.0006825422,0.000184939,0.0003489013,0.0001078103],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007325477,"about_ca_system_score_gemma":0.0004573181,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01096249,"about_ca_topic_score_gemma":0.005970459,"domain_scores_codex":[0.9997805,0.00008644236,0.00001069731,0.00002849395,0.00006383211,0.0000300346],"domain_scores_gemma":[0.9992523,0.0005231427,0.00009578512,0.00002232533,0.00008692041,0.00001954739],"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.00002523828,0.00001693088,0.0004579431,0.00001206951,0.000006526,0.0000386091,0.00002292182,0.9891502,0.001898314,0.005668041,0.00004880433,0.00265434],"study_design_scores_gemma":[0.000001299589,0.000007502163,0.00007486179,9.461232e-7,0.000001693042,0.000006387572,0.000003227363,0.9992065,0.0002606171,0.000385244,0.00005005137,0.000001652506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3562934,0.0002935156,0.6388589,0.0001468016,0.00002970685,0.00007949064,0.0001176104,0.0002384421,0.003942288],"genre_scores_gemma":[0.9768844,0.0003100922,0.02090887,0.00001689556,0.00001974014,0.00007182665,0.00006553976,0.00002691789,0.001695632],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01096249,"threshold_uncertainty_score":0.02179736,"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","authors":[{"name":"Kun Wang","is_ca":false},{"name":"Yang Liu","is_ca":false},{"name":"Xiaoping Liu","is_ca":true},{"name":"Yuanwei Jing","is_ca":false},{"name":"Siying Zhang","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008772375,0.000469886,0.0005347191,0.0004799,0.0005879715,0.00114013,0.001021956,0.0007212008,0.001274575],"category_scores_gemma":[0.001675886,0.0001951777,0.0003335308,0.0003689013,0.0005609209,0.0006009727,0.0006393547,0.0006958509,0.00009571628],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001008863,"about_ca_system_score_gemma":0.0006991639,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008630418,"about_ca_topic_score_gemma":0.00496216,"domain_scores_codex":[0.9996941,0.00006071817,0.00001806367,0.00006939632,0.00009999522,0.00005774616],"domain_scores_gemma":[0.9994729,0.0001300015,0.00006711511,0.00002562722,0.0002773537,0.00002701799],"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.0006561692,0.0001915105,0.001089807,0.0002369264,0.00008595091,0.0001668065,0.0001579578,0.8056052,0.02714761,0.01892996,0.00263951,0.1430926],"study_design_scores_gemma":[0.00001432583,0.00004267483,0.0001181969,0.000003034391,0.0000113295,0.000006806271,0.000004357201,0.9978174,0.0007631507,0.001066628,0.00014726,0.000004862154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09935738,0.0008346495,0.8927407,0.0003236567,0.0003412382,0.00008039083,0.00004709956,0.0005389986,0.00573582],"genre_scores_gemma":[0.988884,0.000106094,0.009856459,0.00003146119,0.00004118595,0.0000230636,0.00001140345,0.000007446054,0.001038938],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008630418,"threshold_uncertainty_score":0.01716036,"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","authors":[{"name":"Zhongli Chen","is_ca":true},{"name":"Peter Yu","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004357105,0.0004369229,0.0004555334,0.0003614213,0.0004022731,0.0005634159,0.0005331643,0.0005434435,0.001310328],"category_scores_gemma":[0.0007919635,0.0001343547,0.0003886235,0.000201457,0.0006161518,0.0006179299,0.0006739364,0.0004569083,0.00008772139],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009766401,"about_ca_system_score_gemma":0.0005559736,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006492857,"about_ca_topic_score_gemma":0.003032354,"domain_scores_codex":[0.9998698,0.00003937038,0.000005062246,0.0000221095,0.00003854855,0.00002522176],"domain_scores_gemma":[0.9998431,0.00006515539,0.00003060355,0.000007390805,0.00003734921,0.00001631803],"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.00006833934,0.00003617208,0.0004596761,0.00006776841,0.0000343837,0.0002240342,0.000153606,0.8735645,0.01164949,0.1028586,0.001024521,0.009858803],"study_design_scores_gemma":[0.00001054194,0.00001641825,0.00006527126,0.000002394745,0.000005218328,0.000007349792,0.000007806678,0.9917766,0.0002989019,0.007550079,0.0002558426,0.000003558516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2151612,0.0007230384,0.7657284,0.0006345244,0.0001190911,0.00007493968,0.00008575144,0.0002168224,0.01725636],"genre_scores_gemma":[0.9894371,0.000224489,0.007376058,0.00003350226,0.00002203992,0.00004694524,0.00002324381,0.000011115,0.002825486],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006492857,"threshold_uncertainty_score":0.01291013,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}