{"meta":{"query_hash":"8fb43236dcdc","filters":{"topic":"Network Traffic and Congestion Control"},"cohort_total":1183,"direct_labels_cover":1,"predictions_cover":1183,"exported":1183,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/8fb43236dcdc","api":"https://metacan.xera.ac/api/v1/cohort?topic=Network+Traffic+and+Congestion+Control"},"results":[{"id":"W106347008","doi":"","title":"SCAR: A Stateless Approach to Achieving Scalable Quality of Service.","year":2005,"lang":"en","type":"article","venue":"International Conference on Internet Computing","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Scalability; Stateless protocol; Computer science; Quality of service; Flexibility (engineering); Differentiated services; Distributed computing; Computer network; The Internet; Computer security; World Wide Web; Database","score_opus":0.06400931084027292,"score_gpt":0.31686972770816324,"score_spread":0.2528604168678903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W106347008","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21797828,0.000014527189,0.73237723,0.0043370905,0.0005322825,0.00017503761,0.0000056530894,0.00016428909,0.044415634],"genre_scores_gemma":[0.96149343,0.0000023208795,0.03547948,0.0021808152,0.00026187283,0.000008237737,0.000008442051,0.000011073687,0.0005543414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773294,0.00013774041,0.0006528965,0.00056162,0.00059824146,0.00031657846],"domain_scores_gemma":[0.9983548,0.00018461265,0.00029062512,0.00039642837,0.0006305853,0.00014295308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006670568,0.00021221081,0.00031190348,0.00019851878,0.000054520882,0.00026710096,0.0019310567,0.000063937754,0.00007143276],"category_scores_gemma":[0.000062948464,0.00020875788,0.000093572184,0.0002965509,0.000031860982,0.00031051392,0.00050108874,0.00024230701,0.0001455021],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059399583,0.00021863391,0.00067702954,0.00001588334,0.00007136929,0.0000012845329,0.001392531,0.0507745,0.0005506022,0.5924287,0.0005754881,0.3532346],"study_design_scores_gemma":[0.0004982602,0.00006319817,0.0015198698,0.0001785958,0.000003127755,0.0000074854734,0.000103016515,0.99495333,0.0005217389,0.00035479077,0.0015665368,0.00023004683],"about_ca_topic_score_codex":0.00014066124,"about_ca_topic_score_gemma":0.00005407366,"teacher_disagreement_score":0.9441788,"about_ca_system_score_codex":0.00010864769,"about_ca_system_score_gemma":0.00008791526,"threshold_uncertainty_score":0.8512899},"labels":[],"label_agreement":null},{"id":"W107983725","doi":"10.1007/978-3-662-46578-3_14","title":"Operational Analysis of Interarrival Rate-based Queuing Management Mechanism for High-speed Networks","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in electrical engineering","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Queueing theory; Computer science; Mechanism (biology); Operations research; Computer network; Engineering; Physics","score_opus":0.009090904588116832,"score_gpt":0.20871024463618265,"score_spread":0.1996193400480658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W107983725","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000023926834,0.0005792864,0.9976856,0.00026375582,0.00038332588,0.0004252736,0.0000066618054,0.00013320483,0.00049893756],"genre_scores_gemma":[0.94976133,0.000030263938,0.04865038,0.00039664234,0.00029866557,0.00005467708,0.000114591676,0.000053737916,0.000639697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981951,0.000024262989,0.0005263962,0.0005463633,0.000324138,0.00038371762],"domain_scores_gemma":[0.998506,0.00065886846,0.00014636791,0.00037284713,0.00021567564,0.0001002403],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003485413,0.00037477163,0.00071126816,0.000873731,0.000034067005,0.00007488319,0.0005940071,0.0003350899,0.000023825427],"category_scores_gemma":[0.00009871903,0.00037093894,0.00025962188,0.00063448935,0.000013243255,0.00007445945,0.00007266554,0.00048995164,0.000001252519],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019875577,0.0000090659205,4.893373e-7,0.000012242407,0.0003513041,0.00000797649,0.00000792663,0.5886924,0.000026243919,0.36905333,0.00001689735,0.04180219],"study_design_scores_gemma":[0.000620861,0.000107355525,0.0000078100975,0.00007058179,0.00034302473,9.2801406e-7,6.7219354e-8,0.98893994,0.00011701541,0.009063554,0.00038144595,0.00034739915],"about_ca_topic_score_codex":0.000005560797,"about_ca_topic_score_gemma":0.0000137284815,"teacher_disagreement_score":0.9497374,"about_ca_system_score_codex":0.00024745284,"about_ca_system_score_gemma":0.000078923156,"threshold_uncertainty_score":0.99987423},"labels":[],"label_agreement":null},{"id":"W110329345","doi":"","title":"Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Saskatchewan","funders":"","keywords":"Computer science; Presentation (obstetrics); Relevance (law); Operations research; Engineering","score_opus":0.06580960663721838,"score_gpt":0.24135001377362886,"score_spread":0.17554040713641048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W110329345","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030828584,0.00019637846,0.95454454,0.0049305973,0.0007317388,0.00026927405,0.0000012583411,0.000052141044,0.008445455],"genre_scores_gemma":[0.9900412,0.000023487448,0.009566195,0.00012580154,0.00013083707,0.0000040982063,6.2485945e-8,0.000002119444,0.00010620109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990425,0.000008920053,0.00022027899,0.00015585215,0.00047872498,0.00009372891],"domain_scores_gemma":[0.9992315,0.00002789522,0.00010509283,0.00014830742,0.00045465925,0.000032498927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037147955,0.00006702534,0.000108342654,0.00006409093,0.000027744763,0.00005844831,0.0006968732,0.000027648477,0.0000046615687],"category_scores_gemma":[0.000026547696,0.000044024753,0.000027812936,0.0001292171,0.00002324236,0.00013957382,0.0001713863,0.00006163268,0.0000012952605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013728288,0.00010650317,0.0005183555,0.000024879195,0.00005220542,1.07563075e-7,0.00023812609,0.13701944,0.00047031697,0.7030837,0.0026659505,0.15580668],"study_design_scores_gemma":[0.0002466801,0.00002859853,0.00011464159,0.000066136236,0.0000039167294,0.0000020723774,0.00002224199,0.99876404,0.00013668687,0.00013242789,0.00043523838,0.00004730425],"about_ca_topic_score_codex":0.000006457566,"about_ca_topic_score_gemma":0.0000032210748,"teacher_disagreement_score":0.9592126,"about_ca_system_score_codex":0.000029076558,"about_ca_system_score_gemma":0.00003418633,"threshold_uncertainty_score":0.17952774},"labels":[],"label_agreement":null},{"id":"W133064789","doi":"10.1007/978-1-4615-0849-6_11","title":"Frame-Based Fair Queueing: A Hardware Design for ATM Networks","year":2002,"lang":"en","type":"book-chapter","venue":"Kluwer international series in engineering and computer science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Asynchronous Transfer Mode; Computer network; Network packet; Queueing theory; Scheduling (production processes); Packet analyzer; Quality of service; Packet switching; Distributed computing; Real-time computing","score_opus":0.012745202759938828,"score_gpt":0.19795005115589337,"score_spread":0.18520484839595455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W133064789","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019134573,0.00037278055,0.99402,0.0005855899,0.0029455584,0.00031945412,0.000006105304,0.00026111715,0.0014702656],"genre_scores_gemma":[0.2656612,0.0003432808,0.70441943,0.0015953259,0.002463763,0.00029402383,0.000027723827,0.0001288398,0.025066435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978476,0.000009969744,0.00037760628,0.0008485171,0.0004927554,0.0004235348],"domain_scores_gemma":[0.9988261,0.00024467031,0.00013225671,0.00042358058,0.00022395597,0.00014945395],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042454913,0.00036317811,0.00032253543,0.00039341752,0.00012105191,0.0005909994,0.0016904384,0.00018451113,0.000016098364],"category_scores_gemma":[0.000028494202,0.0003907128,0.000102057944,0.00016591887,0.00018915776,0.0006358484,0.00033872804,0.00035401294,0.0000051288985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012545815,0.000012828917,0.000007549244,0.000014880793,0.000022366408,0.000026612975,0.00006699144,0.5887292,0.0000021541566,0.32701275,0.00055819086,0.08353394],"study_design_scores_gemma":[0.00037028085,0.00011826284,0.000053046322,0.00027082625,0.0000057568354,0.000028648106,5.029778e-7,0.9398036,0.0000067509013,0.0016547592,0.057291474,0.0003960897],"about_ca_topic_score_codex":0.0000029638747,"about_ca_topic_score_gemma":0.0000019359218,"teacher_disagreement_score":0.35107443,"about_ca_system_score_codex":0.00015112801,"about_ca_system_score_gemma":0.00011373015,"threshold_uncertainty_score":0.9998545},"labels":[],"label_agreement":null},{"id":"W148063212","doi":"10.1007/978-3-319-04645-7_4","title":"Service Response Time of Interactive Data Traffic","year":2014,"lang":"en","type":"book-chapter","venue":"SpringerBriefs in computer science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Service (business); Business","score_opus":0.020082295573004845,"score_gpt":0.2439234432422377,"score_spread":0.22384114766923285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W148063212","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025863582,0.0001996499,0.9816013,0.0017043296,0.0021537628,0.00055676466,0.00002394393,0.0003371188,0.0108367475],"genre_scores_gemma":[0.7132654,0.00011277586,0.24724418,0.0053014085,0.002000065,0.00003541725,0.00004640514,0.00021061616,0.031783696],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954156,0.00013264798,0.00082944235,0.0019487276,0.0010699701,0.00060359965],"domain_scores_gemma":[0.9937782,0.00090853637,0.0005897145,0.0040350854,0.00046177625,0.00022665376],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0035294155,0.0004921892,0.0007573865,0.0007478661,0.00013907584,0.00030635056,0.010104313,0.00022085397,0.00006320953],"category_scores_gemma":[0.000098076074,0.00050700293,0.00010142798,0.00066641934,0.00056224735,0.00096687843,0.0043598805,0.00066269975,0.00031763045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016699832,0.00005650183,0.0000038620196,0.000050229544,0.000039715247,0.00007076563,0.0006493344,0.013812489,0.000115424555,0.061422877,0.0008414011,0.9227704],"study_design_scores_gemma":[0.00047414898,0.00016368656,0.00011427839,0.0005311089,0.00001355654,0.000036665384,0.0000011632947,0.9695947,0.00003837898,0.00080657884,0.027689012,0.000536687],"about_ca_topic_score_codex":0.000014321991,"about_ca_topic_score_gemma":0.000036549754,"teacher_disagreement_score":0.95578223,"about_ca_system_score_codex":0.00018369147,"about_ca_system_score_gemma":0.00096349744,"threshold_uncertainty_score":0.99973816},"labels":[],"label_agreement":null},{"id":"W1481702547","doi":"10.1109/icc.1993.397516","title":"Asymptotic analysis of a leaky bucket controlled ATM multiplexer","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Multiplexer; Leaky bucket; Dimensioning; Queue; Computer science; Queueing theory; Token bucket; Multiplexing; Computer network; Applied mathematics; Mathematical optimization; Algorithm; Mathematics; Engineering; Telecommunications; Quality of service","score_opus":0.015630282261585127,"score_gpt":0.21130664453619047,"score_spread":0.19567636227460533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1481702547","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028632998,0.000608092,0.9470292,0.0015206648,0.00024042322,0.00034263165,0.000002252135,0.00030523184,0.021318525],"genre_scores_gemma":[0.98931134,0.000022049031,0.0046869447,0.00049996405,0.000035553017,0.000021973992,0.0000011136798,0.000004519343,0.005416529],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998716,0.000084542145,0.0003753725,0.00030802362,0.0002734744,0.00024260086],"domain_scores_gemma":[0.99877936,0.0003409215,0.0001314124,0.00052890443,0.00012335826,0.000096036165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022060657,0.00013240616,0.0005619362,0.0002524229,0.000054675354,0.00005688738,0.00053614716,0.00005728021,0.00089748006],"category_scores_gemma":[0.000052722236,0.00010189077,0.00034799054,0.0012485876,0.000042772725,0.0001664894,0.00006173722,0.00007349596,0.00011124237],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001324156,0.00075466116,0.008098457,0.000011159048,0.0056973365,0.000028335799,0.0009452764,0.05705815,0.00040295286,0.26573172,0.0107066985,0.6504328],"study_design_scores_gemma":[0.002958008,0.000047061458,0.001837773,0.0000034427062,0.00034756673,0.0000012139608,0.000009889945,0.99371105,0.000022508093,0.00007296758,0.0008673837,0.00012110178],"about_ca_topic_score_codex":0.00002007088,"about_ca_topic_score_gemma":0.000051004758,"teacher_disagreement_score":0.96067834,"about_ca_system_score_codex":0.000014899511,"about_ca_system_score_gemma":0.000012061991,"threshold_uncertainty_score":0.9826777},"labels":[],"label_agreement":null},{"id":"W1482755404","doi":"10.1109/infocom.2015.7218532","title":"Copula analysis for statistical network calculus","year":2015,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Copula (linguistics); Network calculus; Computer science; Stochastic process; Mathematical optimization; Econometrics; Mathematics; Quality of service; Statistics","score_opus":0.03338914410165001,"score_gpt":0.27399020221389175,"score_spread":0.24060105811224175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1482755404","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011827596,0.00012562658,0.99518776,0.0010051151,0.00033481483,0.00012707744,0.000003459751,0.0001760666,0.0029218101],"genre_scores_gemma":[0.75898975,0.0000018519071,0.23786108,0.0010041519,0.0002854377,0.00003964539,0.00001426155,0.0000044583862,0.0017993947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909705,0.000044677276,0.00016199688,0.00025013695,0.00017245654,0.00027368063],"domain_scores_gemma":[0.9991257,0.00020891521,0.00003298323,0.00028346965,0.0001271141,0.00022179441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036186233,0.000079983634,0.00018143408,0.00004112923,0.000060511964,0.0000992982,0.00033511376,0.000037757636,0.00003646557],"category_scores_gemma":[0.00004597276,0.00006534322,0.0000786832,0.0005496815,0.000022136024,0.00009842415,0.0000536842,0.000043240118,0.000048910562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012359059,0.000018838422,0.000847437,8.462533e-7,0.0001384143,0.0000041744865,0.000026798238,0.05120274,1.549995e-7,0.7349883,0.09974187,0.1130181],"study_design_scores_gemma":[0.0004062362,0.000058737525,0.0004881744,7.902745e-7,0.000085260006,0.000001371744,0.0000059115496,0.9549691,8.704993e-7,0.0053746514,0.038511604,0.000097270124],"about_ca_topic_score_codex":0.000019548525,"about_ca_topic_score_gemma":0.00007649131,"teacher_disagreement_score":0.9037664,"about_ca_system_score_codex":0.000022354516,"about_ca_system_score_gemma":0.0000723213,"threshold_uncertainty_score":0.2664619},"labels":[],"label_agreement":null},{"id":"W1486515899","doi":"10.1109/cec.2003.1299889","title":"A control framework for ant-based routing algorithms","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Network packet; Decoupling (probability); Routing table; Routing (electronic design automation); Ant colony optimization algorithms; Distributed computing; Static routing; Architecture; Ant colony; Computer network; Routing protocol; Algorithm; Engineering","score_opus":0.013373183610455752,"score_gpt":0.2501665534934918,"score_spread":0.23679336988303606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1486515899","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028257913,0.00005924458,0.9900239,0.008045289,0.00046972226,0.00034637027,0.0000023298608,0.00045755637,0.0003130013],"genre_scores_gemma":[0.6096941,4.4446483e-7,0.38678586,0.0032310588,0.0001888406,0.000052122556,6.9803525e-7,0.0000057082257,0.00004117117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989556,0.000021624955,0.00019101556,0.00032153857,0.00016008857,0.00035012778],"domain_scores_gemma":[0.9989972,0.0004313412,0.00006426474,0.000311439,0.00009155868,0.00010417329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025074664,0.00012419399,0.00016482554,0.000040575524,0.00015562797,0.0001452737,0.00047518846,0.00008363007,0.000012367042],"category_scores_gemma":[0.00008667275,0.00010624591,0.00010864834,0.00019043764,0.000024554269,0.00015335779,0.000021430445,0.00011099382,0.000036454403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001027401,0.000036053654,0.00002778421,0.0000021465628,0.000011803157,0.0000034876568,0.000030012936,0.013427942,0.000012751826,0.7990205,0.00009249907,0.18732472],"study_design_scores_gemma":[0.0029718566,0.00012847308,0.00006754064,0.00003382961,0.000009957045,0.0000034063446,0.000009637566,0.9529303,0.00018694138,0.041862793,0.001610755,0.00018453493],"about_ca_topic_score_codex":0.000012038346,"about_ca_topic_score_gemma":0.00000468693,"teacher_disagreement_score":0.93950236,"about_ca_system_score_codex":0.000039403556,"about_ca_system_score_gemma":0.00014723066,"threshold_uncertainty_score":0.43325827},"labels":[],"label_agreement":null},{"id":"W1488910567","doi":"10.1007/11833529_36","title":"A Self-tuning Reliable Dynamic Scheme for Multicast Flow Control","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Multicast; Computer science; Scalability; Distributed computing; Controller (irrigation); Network packet; Computer network; Source-specific multicast; Flow control (data); Pragmatic General Multicast; Scheme (mathematics); Mathematics; Operating system","score_opus":0.007307238211008931,"score_gpt":0.21806304263794699,"score_spread":0.21075580442693806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1488910567","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013979496,0.00069198606,0.9931392,0.0012470094,0.0019574645,0.0011015666,0.000014519381,0.00052057375,0.0013137183],"genre_scores_gemma":[0.10809586,0.000017276803,0.88879925,0.0015140686,0.0006480152,0.00007222865,0.0000116263745,0.000055230594,0.00078642264],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957088,0.000029185276,0.00065793615,0.0017773665,0.00079135544,0.0010353347],"domain_scores_gemma":[0.9968034,0.0009199184,0.00033472912,0.001289394,0.0004406194,0.00021192909],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009472757,0.00065232045,0.0007351909,0.0005591832,0.0004342456,0.0006628013,0.002838933,0.0004166587,0.000008859669],"category_scores_gemma":[0.00007134354,0.0006231175,0.00024665444,0.0004570636,0.00035392883,0.000523512,0.0004475573,0.00074792805,0.00003718336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000185807,0.0000514959,0.000015005603,0.000058286925,0.00003260551,0.000047062877,0.00013175982,0.31377408,0.000047498877,0.014634657,0.00021176576,0.6709772],"study_design_scores_gemma":[0.0013547527,0.00017106389,0.000011863157,0.00024862294,0.0000230026,0.000037394282,6.35879e-8,0.9698816,0.000017554412,0.017025659,0.010556651,0.0006717826],"about_ca_topic_score_codex":0.000009700518,"about_ca_topic_score_gemma":0.000056765246,"teacher_disagreement_score":0.67030543,"about_ca_system_score_codex":0.00038194045,"about_ca_system_score_gemma":0.0006457614,"threshold_uncertainty_score":0.999622},"labels":[],"label_agreement":null},{"id":"W1489398079","doi":"10.1109/atm.1999.786851","title":"VC-merge capable scheduler design","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer network; Quality of service; Scheduling (production processes); Scalability; Distributed computing; Queue; Multicast; Merge (version control); Parallel computing; Operating system","score_opus":0.017967910289834372,"score_gpt":0.2032618800147444,"score_spread":0.18529396972491002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1489398079","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037889325,0.00021446393,0.9428791,0.000566783,0.0003806999,0.00009490697,6.439408e-8,0.0002425575,0.055242576],"genre_scores_gemma":[0.76502866,0.0000117447025,0.22191705,0.0011100197,0.000042032916,0.000019007352,1.5582405e-7,0.0000057524744,0.011865576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915355,0.000096422715,0.00011709665,0.0002384239,0.00013803446,0.00025647448],"domain_scores_gemma":[0.999414,0.00007474828,0.000024487941,0.00034194565,0.00004864269,0.00009617164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003033467,0.000089058674,0.00009175396,0.000033913693,0.0000896422,0.00008539294,0.0003411225,0.000040937142,0.00042222175],"category_scores_gemma":[0.00002678663,0.00007418214,0.00003689786,0.00023662257,0.000017036775,0.00024055144,0.000023196942,0.000072408955,0.00067010697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016206118,0.000033182994,0.00006761101,9.365087e-7,0.000011249229,0.0000059982613,0.00003401634,0.0032503519,0.0000971795,0.9131772,0.019736748,0.06358389],"study_design_scores_gemma":[0.0011178183,0.0001104534,0.00013804669,0.000010212988,0.000011185163,0.00003761668,0.00003077308,0.740184,0.0032910502,0.013014849,0.24156862,0.00048536866],"about_ca_topic_score_codex":0.0000040761483,"about_ca_topic_score_gemma":0.0000023997663,"teacher_disagreement_score":0.90016234,"about_ca_system_score_codex":0.000012903194,"about_ca_system_score_gemma":0.00007744192,"threshold_uncertainty_score":0.86130923},"labels":[],"label_agreement":null},{"id":"W1496338679","doi":"10.1109/glocom.1995.502572","title":"A control engineer's look at ATM congestion avoidance","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Tellabs (Canada)","funders":"","keywords":"Network congestion; Asynchronous Transfer Mode; Computer science; Control (management); Point (geometry); Sample (material); Scheme (mathematics); Scale (ratio); Computer network; Distributed computing; Operations research; Control engineering; Artificial intelligence; Engineering; Mathematics","score_opus":0.008297593635576347,"score_gpt":0.1749616524653883,"score_spread":0.16666405882981195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1496338679","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005665857,0.0010596986,0.9694217,0.006506201,0.00061272585,0.0002481273,0.0000017276684,0.0007983396,0.01568566],"genre_scores_gemma":[0.97989666,0.000035829537,0.0045080287,0.0018448014,0.00017426192,0.000040163883,7.872521e-7,0.000008265916,0.013491213],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988081,0.000058425627,0.00020382756,0.00036513654,0.00023039359,0.00033410694],"domain_scores_gemma":[0.99907976,0.00018148753,0.0000581183,0.00045405692,0.00007825465,0.00014833538],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001522915,0.0001591625,0.00017766187,0.00004820953,0.00012908096,0.00009245287,0.00047353058,0.000074359756,0.00044590322],"category_scores_gemma":[0.000029521701,0.00014128724,0.00007553116,0.0002024825,0.000038872568,0.00031520927,0.00006054364,0.00012191198,0.0015401901],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024596247,0.00016230062,0.0010830205,0.000011076189,0.00008763972,0.000069659975,0.00024453545,0.019464191,0.0005330994,0.36643046,0.08119704,0.5306924],"study_design_scores_gemma":[0.0012661251,0.00006285519,0.00058797206,0.0000100877305,0.000009417701,0.000035464374,0.0000021277513,0.9570728,0.00006862149,0.00019494761,0.040482584,0.00020699107],"about_ca_topic_score_codex":0.0000044142157,"about_ca_topic_score_gemma":0.000013200439,"teacher_disagreement_score":0.97423077,"about_ca_system_score_codex":0.000063296895,"about_ca_system_score_gemma":0.000010882052,"threshold_uncertainty_score":0.99923724},"labels":[],"label_agreement":null},{"id":"W1501975019","doi":"10.1109/tridnt.2005.22","title":"Inter-VLAN VPNs over a High Performance Optical Testbed","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Virtual LAN; Testbed; Computer network; Gigabit Ethernet; Computer science; Gigabit; Private network; Multiprotocol Label Switching; Provisioning; Core network; Ethernet; Quality of service; Telecommunications","score_opus":0.0063057923065089035,"score_gpt":0.20346904603533364,"score_spread":0.19716325372882473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1501975019","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25349665,0.000041839525,0.7070549,0.0072105657,0.00036511588,0.000116635594,3.9896935e-7,0.00052947196,0.031184427],"genre_scores_gemma":[0.96312004,0.000007901541,0.030827506,0.0020397136,0.00031656423,0.000011393128,6.828112e-7,0.000005334382,0.003670878],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991139,0.000016789238,0.00016683407,0.00026153747,0.00016710401,0.00027384044],"domain_scores_gemma":[0.99938965,0.000074130934,0.000027261747,0.0003581623,0.00003925657,0.00011153779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000121803,0.0001089299,0.000115068746,0.00004181928,0.00006348526,0.00010930316,0.00052987534,0.00004736823,0.00024245962],"category_scores_gemma":[0.000010772923,0.000086619606,0.000038060745,0.00015931815,0.000033132317,0.00040513012,0.00011847372,0.0001265132,0.00059489877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056711788,0.000046900845,0.00055251,0.000001467987,0.000007811468,0.0000030467907,0.00004760864,0.00061280397,0.000034469027,0.10632392,0.003840767,0.88852304],"study_design_scores_gemma":[0.0005841977,0.00009716768,0.0057559167,0.000011859703,0.0000046061873,0.000017784001,0.0000035641606,0.9535587,0.00024209596,0.00012695308,0.039420336,0.00017684433],"about_ca_topic_score_codex":0.0000051760335,"about_ca_topic_score_gemma":0.000015481035,"teacher_disagreement_score":0.9529459,"about_ca_system_score_codex":0.000029420335,"about_ca_system_score_gemma":0.00003657128,"threshold_uncertainty_score":0.7646418},"labels":[],"label_agreement":null},{"id":"W1505835431","doi":"10.1109/iscc.2004.1358627","title":"Extended framework for delay-constrained multipoint-to-multipoint communication","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Distributed computing; Span (engineering); Routing (electronic design automation); Range (aeronautics); Quality of service; Computer network; Upper and lower bounds; Path (computing); Mathematics","score_opus":0.015010701731032795,"score_gpt":0.26641316569512147,"score_spread":0.25140246396408866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505835431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018163491,0.00010040059,0.9808053,0.014597936,0.00026368175,0.0009765198,0.0000030015067,0.00053118775,0.000905653],"genre_scores_gemma":[0.5043707,0.000006124791,0.49338618,0.0018912387,0.00005144209,0.0001831324,0.0000029310434,0.000007704559,0.00010053299],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866664,0.000049311995,0.00032769894,0.00040745016,0.00018271324,0.0003662007],"domain_scores_gemma":[0.99809337,0.00044809753,0.000086526685,0.0009784322,0.00018871001,0.00020485042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035573315,0.0001756545,0.00019757777,0.000084533865,0.00023255922,0.00016218434,0.0010614306,0.000114604714,0.000023947481],"category_scores_gemma":[0.0001894642,0.00015999387,0.00011802327,0.00029283186,0.0000553785,0.00027026914,0.00015632124,0.000177197,0.00013177676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022278666,0.00007816194,0.0000062484105,0.0000028497193,0.000017300637,0.0000015199682,0.0003141853,0.0044219987,0.00007817349,0.6892028,0.00023031977,0.3056242],"study_design_scores_gemma":[0.005699086,0.000474967,0.00091444695,0.00020603352,0.000030919,0.000049591785,0.00023222387,0.5943063,0.0017263461,0.383204,0.012278992,0.0008770874],"about_ca_topic_score_codex":0.000025347777,"about_ca_topic_score_gemma":0.00004998319,"teacher_disagreement_score":0.5898843,"about_ca_system_score_codex":0.00007199236,"about_ca_system_score_gemma":0.00011163324,"threshold_uncertainty_score":0.6524361},"labels":[],"label_agreement":null},{"id":"W1506208626","doi":"10.1109/ofc.2001.928433","title":"Optical internet architectures-application fit","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Computer science; The Internet; Computer architecture; World Wide Web","score_opus":0.016174084507932653,"score_gpt":0.21473350635165928,"score_spread":0.19855942184372663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506208626","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004157321,0.000081233055,0.9525499,0.004144116,0.0000960659,0.00008193954,1.017133e-7,0.00028413007,0.038605213],"genre_scores_gemma":[0.97806233,0.0000028347554,0.016175726,0.0010852398,0.000094714196,0.000019559087,2.8035646e-7,0.000003001778,0.004556335],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940354,0.000016448173,0.00010167531,0.00021455328,0.000117226686,0.00014656439],"domain_scores_gemma":[0.9995389,0.000060606286,0.00001856709,0.00028944097,0.000020135483,0.00007234235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005945125,0.00006545183,0.00006444176,0.000029427565,0.000025688216,0.000067207424,0.00044535054,0.00003159309,0.0002389421],"category_scores_gemma":[0.000008471604,0.0000527072,0.000034178844,0.000118653275,0.000021246995,0.00005126995,0.00006422046,0.00008476139,0.0007420574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.8196117e-7,0.000023291428,0.000037096193,5.75171e-7,0.0000038230896,0.0000017013361,0.00005128701,0.00038604252,0.000017442788,0.17806372,0.0065440075,0.8148701],"study_design_scores_gemma":[0.00015240417,0.000029169782,0.00029962885,0.000001954152,0.0000017593819,0.000014173498,0.0000010783273,0.9673821,0.00009830455,0.0010422561,0.030900544,0.00007662623],"about_ca_topic_score_codex":0.00000392324,"about_ca_topic_score_gemma":0.000006434361,"teacher_disagreement_score":0.97390497,"about_ca_system_score_codex":0.00000973783,"about_ca_system_score_gemma":0.0000035142132,"threshold_uncertainty_score":0.9537894},"labels":[],"label_agreement":null},{"id":"W1506658115","doi":"10.1109/icip.2004.1421489","title":"Efficient congestion control for streaming scalable video over unreliable ip networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Computer network; Network congestion; Video streaming; Scalability; Slow-start; Distributed computing; Operating system","score_opus":0.0066877431515215855,"score_gpt":0.2180933587558373,"score_spread":0.2114056156043157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506658115","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004852111,0.0005460332,0.98720884,0.002659049,0.0007670122,0.0006417576,0.000003155857,0.00048119845,0.0028408142],"genre_scores_gemma":[0.9749907,0.000011306519,0.01991558,0.0019960129,0.0006328895,0.00013961109,0.00000431135,0.000016915317,0.0022926314],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981779,0.000056031833,0.00035792924,0.0005345586,0.00025585585,0.00061775866],"domain_scores_gemma":[0.9984964,0.0005866739,0.00011696888,0.00046851864,0.00014798655,0.00018344342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054505613,0.00022104518,0.00026980278,0.00007803332,0.00025611444,0.00024411872,0.0005014545,0.00012997996,0.00009235372],"category_scores_gemma":[0.0000507446,0.00019615538,0.00012538739,0.0002525793,0.000041768195,0.0002449683,0.000061644256,0.00014576201,0.00006665037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002741258,0.00006266112,0.00011416634,0.0000029771536,0.00002025183,8.5888394e-7,0.000014818706,0.66741955,0.000017829832,0.04958717,0.006111892,0.27662042],"study_design_scores_gemma":[0.00254908,0.00009277165,0.00070544315,0.000030080922,0.000026074074,0.0000049294144,0.000006827631,0.9746821,0.00003785976,0.00017998487,0.021438854,0.00024597833],"about_ca_topic_score_codex":0.00002018183,"about_ca_topic_score_gemma":0.000031461088,"teacher_disagreement_score":0.9701386,"about_ca_system_score_codex":0.00009363756,"about_ca_system_score_gemma":0.000061448445,"threshold_uncertainty_score":0.7998984},"labels":[],"label_agreement":null},{"id":"W1506928870","doi":"10.1007/978-3-642-31638-8_36","title":"Enhancing TCP Congestion Control for Improved Performance in Wireless Networks","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Norleaf Networks (Canada); University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"TCP Westwood plus; TCP Friendly Rate Control; Computer science; Computer network; TCP tuning; TCP global synchronization; TCP acceleration; Network congestion; CUBIC TCP; Transmission Control Protocol; H-TCP; Zeta-TCP; HSTCP; Packet loss; Compound TCP; Network packet; Real-time computing","score_opus":0.008678545351211731,"score_gpt":0.21177070811321128,"score_spread":0.20309216276199954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506928870","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036818066,0.0010043938,0.99329484,0.00066688855,0.003095037,0.001188715,0.0000041539497,0.0001834937,0.0001942932],"genre_scores_gemma":[0.95343876,0.00012768236,0.04357236,0.00134093,0.0012543269,0.00009620868,0.0000075798075,0.000041619587,0.00012054502],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961566,0.000052971536,0.00077862875,0.0013621504,0.0004626337,0.0011870306],"domain_scores_gemma":[0.9970485,0.0010435063,0.00041520328,0.00095712475,0.00030621415,0.00022943612],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017610419,0.0006119981,0.0007807619,0.00058041787,0.0002596772,0.00036469474,0.0021430287,0.0005140831,0.00000914522],"category_scores_gemma":[0.000057139638,0.00058844924,0.00015334712,0.0004891221,0.00037667376,0.0008705284,0.00034454864,0.0009619968,0.0000128961965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032869484,0.000023837947,0.00013467814,0.000029977815,0.00001009284,0.000005005433,0.000098470366,0.10793946,0.00009382137,0.012186856,0.000003905214,0.879441],"study_design_scores_gemma":[0.0013050515,0.00019345985,0.00040052258,0.0004510635,0.000015116205,0.00002378297,8.6649294e-8,0.99223024,0.00012734057,0.0038309908,0.00075807393,0.00066424895],"about_ca_topic_score_codex":0.000009545012,"about_ca_topic_score_gemma":0.0001926678,"teacher_disagreement_score":0.9530706,"about_ca_system_score_codex":0.0003650275,"about_ca_system_score_gemma":0.00044433252,"threshold_uncertainty_score":0.9996567},"labels":[],"label_agreement":null},{"id":"W1506932989","doi":"10.1109/iscc.1998.702515","title":"Study of a rate-based ABR scheme supporting bursty data applications","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Ottawa","funders":"","keywords":"Computer science; Protocol stack; Computer network; Asynchronous Transfer Mode; Protocol (science); Scheme (mathematics); Real-time computing","score_opus":0.06741465929229368,"score_gpt":0.2917291103885718,"score_spread":0.22431445109627812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506932989","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017391205,0.00006531362,0.97682494,0.0010097583,0.000054711625,0.0005295984,0.0000031918905,0.00022863141,0.0038926504],"genre_scores_gemma":[0.98316216,0.0000016641516,0.01596958,0.00024654265,0.000046402467,0.00006193701,0.0000052950395,0.0000042497995,0.0005021767],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896055,0.000052954427,0.0002809191,0.00036850775,0.0001680175,0.00016905031],"domain_scores_gemma":[0.99824554,0.00012445844,0.000121654404,0.0013696131,0.00007614648,0.0000625959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036294005,0.00008041212,0.00012844261,0.00004527838,0.00008421653,0.00005276791,0.0012933888,0.0000233822,0.00018445941],"category_scores_gemma":[0.000021884474,0.00007007709,0.000020270096,0.00036938366,0.000021156113,0.00022308787,0.00020012795,0.00007060007,0.000065616325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005239926,0.0019489565,0.004635039,0.000012318555,0.00005731993,0.00001684468,0.00042495696,0.0015689619,0.000121417994,0.024762455,0.009370166,0.9570763],"study_design_scores_gemma":[0.0007648918,0.000080601094,0.0005458045,0.0000026460496,0.000009984384,0.0000016908156,0.00011283098,0.9930665,0.0000310683,0.00004783776,0.0052373796,0.00009878442],"about_ca_topic_score_codex":0.0000139855765,"about_ca_topic_score_gemma":0.000026111067,"teacher_disagreement_score":0.9914975,"about_ca_system_score_codex":0.0000066776156,"about_ca_system_score_gemma":0.000027954322,"threshold_uncertainty_score":0.2857661},"labels":[],"label_agreement":null},{"id":"W1510927957","doi":"10.1109/iscc.2004.1358649","title":"Supporting service differentiation through end-to-end QoS routing","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer network; Differentiated services; Quality of service; Integrated services; Computer science; Scalability; Differentiated service; Admission control; Mobile QoS; End-to-end principle; Distributed computing; Service (business); Service provider; Service design; Business","score_opus":0.01447582348639373,"score_gpt":0.2550466731871349,"score_spread":0.2405708497007412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1510927957","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052505452,0.000019143748,0.93185043,0.009392285,0.0005911953,0.0001746075,6.028321e-7,0.00044230293,0.0050240066],"genre_scores_gemma":[0.95915884,0.0000015874107,0.034551967,0.005598027,0.00030435438,0.00001596028,0.0000041082812,0.000008404494,0.00035677766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986188,0.000032585434,0.00029619728,0.00037874552,0.00027317408,0.00040052462],"domain_scores_gemma":[0.9992741,0.00007303398,0.000106066575,0.00034160004,0.00010281426,0.00010241514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002078361,0.00013722858,0.00014189923,0.00003938953,0.00018408785,0.0002048286,0.0005077474,0.000050541992,0.00011630605],"category_scores_gemma":[0.000028906374,0.0001231161,0.00005112986,0.00044600668,0.000007743482,0.000548085,0.0001603219,0.00011133172,0.00028044273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007889604,0.00009834666,0.0009173722,0.000013135639,0.00003797762,0.00001565458,0.003921982,0.020827835,0.0010998644,0.5352557,0.0006525709,0.43715167],"study_design_scores_gemma":[0.0049292785,0.00030420325,0.020621393,0.00021999142,0.00007517594,0.00007948721,0.00086550036,0.921066,0.009490714,0.026848646,0.013801394,0.0016982422],"about_ca_topic_score_codex":0.00015460594,"about_ca_topic_score_gemma":0.00019572536,"teacher_disagreement_score":0.90665334,"about_ca_system_score_codex":0.000055028122,"about_ca_system_score_gemma":0.00007501327,"threshold_uncertainty_score":0.5020529},"labels":[],"label_agreement":null},{"id":"W1511587374","doi":"10.1109/noms.2004.1317764","title":"Customer-centric network upgrade strategy: maximizing investment benefits for enhanced service quality","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Upgrade; Customer Service Assurance; Service quality; Customer satisfaction; Computer science; Customer profitability; Service level objective; Profitability index; Customer retention; Process management; Service provider; Business; Service (business); Service design; Marketing; Finance","score_opus":0.03539498803217157,"score_gpt":0.2690399091926398,"score_spread":0.23364492116046826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1511587374","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01799399,0.00071188854,0.9686692,0.0049008476,0.0006819328,0.0007509373,0.0000035660323,0.00057662476,0.0057110097],"genre_scores_gemma":[0.93182856,0.000051293813,0.05775571,0.009520076,0.000394129,0.00014453648,0.000009397951,0.000016171138,0.0002801157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979448,0.0000666571,0.00043816312,0.00057357317,0.0003017516,0.0006750794],"domain_scores_gemma":[0.9987225,0.000164104,0.00016113171,0.00053412444,0.0001861706,0.00023199359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004447465,0.00024051004,0.0002863855,0.00005860993,0.00025803476,0.0002039605,0.00076570077,0.00010208348,0.00001697661],"category_scores_gemma":[0.000016536433,0.0002184319,0.000114188035,0.0008336612,0.000020841924,0.0003865063,0.00011932717,0.00013564162,0.00010212629],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016358801,0.00007053668,0.0000162912,0.0000150955175,0.000028158647,0.0000010715919,0.00010544829,0.26776353,0.00005909592,0.6128728,0.00045540012,0.11859624],"study_design_scores_gemma":[0.027937694,0.0011425796,0.009785991,0.0005035841,0.00022437137,0.000048873546,0.0005438569,0.65365994,0.008174393,0.24261285,0.05083382,0.004532058],"about_ca_topic_score_codex":0.00007199586,"about_ca_topic_score_gemma":0.00016919787,"teacher_disagreement_score":0.9138346,"about_ca_system_score_codex":0.00011553521,"about_ca_system_score_gemma":0.0002121485,"threshold_uncertainty_score":0.89073944},"labels":[],"label_agreement":null},{"id":"W1512614264","doi":"10.1109/milcom.2002.1180411","title":"Bandwidth management of MilSatCom links for multimedia network traffic","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Department of National Defence; Communications Research Centre Canada","funders":"Ministère de la Défense Nationale; Defence Research and Development Canada","keywords":"Computer science; Computer network; Bandwidth (computing); Dynamic bandwidth allocation; Network traffic control; Digitization; Multimedia; Bandwidth allocation; Battlefield; Telecommunications; Network packet","score_opus":0.011852433591185442,"score_gpt":0.22560141813560475,"score_spread":0.21374898454441932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512614264","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020627666,0.0004799059,0.9877484,0.0004448564,0.0007748885,0.00047330334,8.391206e-7,0.00015709795,0.00785797],"genre_scores_gemma":[0.6304764,0.000047337595,0.36662552,0.00038210084,0.00008837169,0.00006213701,0.0000017650646,0.0000079632655,0.0023083973],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989319,0.000043893742,0.0002630292,0.00028443974,0.000157208,0.0003195443],"domain_scores_gemma":[0.99923,0.00017920866,0.00007217072,0.0003702112,0.00006279195,0.0000855892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035464021,0.00012224197,0.00018661047,0.00003102503,0.00007233039,0.000033506352,0.00042242566,0.000087928216,0.00004073868],"category_scores_gemma":[0.0000067976353,0.000105017774,0.00010781601,0.00024120268,0.00002753682,0.000094208204,0.00003328566,0.00008920196,0.000017305409],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010532531,0.00006559658,0.000053385338,0.000022513253,0.00006776524,0.0000031652182,0.0000638943,0.030257823,0.0000022267054,0.27395856,0.010055942,0.6854386],"study_design_scores_gemma":[0.002105567,0.00012383163,0.00029691283,0.000042551015,0.00003640404,0.0000032915245,0.00003617106,0.91591173,0.000071037626,0.002173479,0.078957886,0.00024116079],"about_ca_topic_score_codex":6.450435e-7,"about_ca_topic_score_gemma":0.0000040001355,"teacher_disagreement_score":0.8856539,"about_ca_system_score_codex":0.00001143395,"about_ca_system_score_gemma":0.00002643034,"threshold_uncertainty_score":0.42825007},"labels":[],"label_agreement":null},{"id":"W1513275202","doi":"10.1023/a:1014401508703","title":"Managing Quality-of-Service in Internet Applications Using Differentiated Services","year":2002,"lang":"en","type":"article","venue":"Journal of Network and Systems Management","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Quality of service; Computer network; Differentiated services; Mobile QoS; Traffic classification; The Internet; Provisioning; Differentiated service; Integrated services; Network packet; Throughput; Network management; Service (business); Distributed computing; Service provider; Telecommunications; Wireless","score_opus":0.03698256486875612,"score_gpt":0.25681940255268654,"score_spread":0.21983683768393042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1513275202","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09759434,0.007861531,0.8913435,0.00072660885,0.00066241215,0.0003925587,3.358952e-7,0.000027016658,0.0013917144],"genre_scores_gemma":[0.9965164,0.000423803,0.002548633,0.00017006951,0.00017483161,0.000008315469,3.5680753e-7,0.0000054240154,0.00015218407],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850655,0.00015487525,0.000754785,0.00015405011,0.00024652248,0.00018324993],"domain_scores_gemma":[0.9989645,0.00006603496,0.00060281757,0.00020967204,0.00009452577,0.00006245828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006790804,0.00010638585,0.00031220057,0.00015774867,0.000044865268,0.00011956198,0.0004650977,0.000032940847,0.0000045552],"category_scores_gemma":[7.3404397e-7,0.0000917316,0.000049015565,0.00045935126,0.000010892253,0.00021600965,0.00013761593,0.00010669314,0.000002195927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058405003,0.00037024156,0.017422358,0.0019698108,0.000679252,0.00008798277,0.0018915037,0.35818878,0.00004213989,0.1956937,0.0011463476,0.4224495],"study_design_scores_gemma":[0.0006451842,0.00002746681,0.003832958,0.0005302289,0.000031186813,0.000020152134,0.00020697685,0.99075997,3.2869283e-7,0.00061070325,0.0032336216,0.00010119751],"about_ca_topic_score_codex":0.00005379637,"about_ca_topic_score_gemma":0.000024620578,"teacher_disagreement_score":0.898922,"about_ca_system_score_codex":0.000029583249,"about_ca_system_score_gemma":0.0000032464093,"threshold_uncertainty_score":0.3740706},"labels":[],"label_agreement":null},{"id":"W1513383729","doi":"10.1109/hicss.2002.994522","title":"A new buffer management scheme for multimedia terminals in broadband satellite networks","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Computer network; HOL; Quality of service; Broadband networks; Broadband; Bandwidth (computing); Scheme (mathematics); Buffer (optical fiber); Communications satellite; Satellite; Telecommunications; Engineering","score_opus":0.010000131806106288,"score_gpt":0.23156104044876832,"score_spread":0.22156090864266204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1513383729","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006352804,0.0009525756,0.98595595,0.0005103025,0.00037346198,0.00054436974,1.7939924e-7,0.00011399263,0.010913882],"genre_scores_gemma":[0.2591832,0.0002505189,0.716477,0.0016051058,0.00017720729,0.00014560387,0.0000025754764,0.00001630692,0.022142526],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882966,0.000042649754,0.00024530274,0.00037745282,0.00011245442,0.00039245305],"domain_scores_gemma":[0.9993209,0.00013354604,0.000043607382,0.00033996603,0.000025708077,0.00013626016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003071678,0.00014571226,0.00017010108,0.00008282051,0.000044552213,0.000115025745,0.0003738567,0.00006545861,0.000056031462],"category_scores_gemma":[0.000011556199,0.00012869618,0.00006506354,0.00027903725,0.000012940839,0.00018826502,0.000045183864,0.00008271142,0.000025110878],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000119496035,0.00004193305,0.00066387304,0.0000062014574,0.000016816863,0.000010078135,0.000057072382,0.001228992,0.0000036202518,0.081771895,0.005160122,0.91102743],"study_design_scores_gemma":[0.0026955344,0.000048758142,0.0016980524,0.000036504975,0.000008804547,0.0000061960914,0.000017628481,0.86429274,0.000033089545,0.0011904874,0.12971804,0.00025415616],"about_ca_topic_score_codex":0.0000079578895,"about_ca_topic_score_gemma":0.00003507269,"teacher_disagreement_score":0.9107733,"about_ca_system_score_codex":0.000024658924,"about_ca_system_score_gemma":0.000027949696,"threshold_uncertainty_score":0.52480775},"labels":[],"label_agreement":null},{"id":"W1514982098","doi":"10.1023/a:1011118432742","title":"Selective Idling: Experiments in Transport Layer Energy Conservation","year":2001,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Idle; Computer network; Network congestion; Network packet; Node (physics); Transceiver; Distributed computing; Real-time computing; Wireless; Telecommunications","score_opus":0.023625062186739848,"score_gpt":0.24583507421647774,"score_spread":0.2222100120297379,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1514982098","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5943477,0.00037154657,0.4035053,0.0012027094,0.00019348047,0.00003069673,4.527313e-8,0.000017045275,0.0003314814],"genre_scores_gemma":[0.9967738,0.00006837326,0.0021089267,0.00079811394,0.0002109859,6.7616105e-7,1.9952319e-7,0.0000054881784,0.00003346699],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890584,0.0001544686,0.00041295038,0.00009436995,0.00023452661,0.00019785913],"domain_scores_gemma":[0.9993377,0.00020618679,0.00013960684,0.00012601512,0.00014242448,0.000048116905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008735011,0.000091378686,0.0001657208,0.000097903954,0.00009883216,0.000028020999,0.00049702654,0.00003685849,0.000005385734],"category_scores_gemma":[0.000014482858,0.000065254564,0.00005664936,0.00038421756,0.000022985381,0.00036594362,0.00002691947,0.0002021176,0.0000017123049],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041694037,0.0005282639,0.11328853,0.000011155443,0.0002248149,0.000372297,0.02663429,0.15152594,0.017125389,0.026646921,0.0015401696,0.6616853],"study_design_scores_gemma":[0.0026143217,0.00028290274,0.03629991,0.00021761273,0.000029074896,0.0008279842,0.0009223327,0.94962394,0.0031332166,0.0019751778,0.0037565557,0.00031697543],"about_ca_topic_score_codex":0.00008053146,"about_ca_topic_score_gemma":0.000032271306,"teacher_disagreement_score":0.79809797,"about_ca_system_score_codex":0.000050313538,"about_ca_system_score_gemma":0.00008289288,"threshold_uncertainty_score":0.26610038},"labels":[],"label_agreement":null},{"id":"W1518867225","doi":"10.1002/0471643505.ch7","title":"Fluid Flow Analysis","year":2004,"lang":"en","type":"other","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Markov chain; Poisson distribution; Range (aeronautics); Markov process; Aggregate (composite); Computer science; Partial differential equation; Constant (computer programming); Flow (mathematics); Applied mathematics; Mathematical optimization; Mathematics; Algorithm; Mathematical analysis; Statistics; Engineering","score_opus":0.005741421097639794,"score_gpt":0.20419716450930425,"score_spread":0.19845574341166447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1518867225","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.8503707e-8,0.00045637085,0.5358413,0.0002530757,0.00021433922,0.000050992156,0.0000014993245,0.0005497418,0.46263263],"genre_scores_gemma":[0.00069038983,0.0000634467,0.051810376,0.00058907777,0.00031050152,0.000011486196,0.0000100679135,0.000064249914,0.9464504],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99906504,0.000021723483,0.00011978696,0.00038904848,0.00021430288,0.00019007994],"domain_scores_gemma":[0.99914277,0.00001565397,0.000061401544,0.00067858497,0.00001926621,0.000082327926],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000060363123,0.00016792183,0.00028465327,0.0003436835,0.000023648201,0.0000901397,0.00072895293,0.00015464982,0.0042669056],"category_scores_gemma":[0.000002795532,0.0001391735,0.0002023234,0.00078974024,0.000018313365,0.000038203227,0.00006987679,0.00008668611,0.0010032888],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.848913e-7,0.000016110149,0.0000068629092,0.0000029982614,0.0005499407,0.000012466821,0.000009129888,0.0026256137,1.8008924e-7,0.0427544,0.65051407,0.3035078],"study_design_scores_gemma":[0.00019225616,0.0000109979555,0.000010968819,0.000014683009,0.0001835398,0.0000013050724,7.269252e-7,0.19756253,0.0000011289301,0.00020380567,0.8015956,0.00022241514],"about_ca_topic_score_codex":0.00007979988,"about_ca_topic_score_gemma":0.00033772548,"teacher_disagreement_score":0.48403093,"about_ca_system_score_codex":0.000022797078,"about_ca_system_score_gemma":0.00007923478,"threshold_uncertainty_score":0.9997746},"labels":[],"label_agreement":null},{"id":"W1522894013","doi":"10.1007/3-540-47906-6_76","title":"Dynamic Online Routing Algorithm for MPLS Traffic Engineering","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Equal-cost multi-path routing; Multiprotocol Label Switching; Computer network; Static routing; Routing (electronic design automation); Distributed computing; Link-state routing protocol; Bandwidth (computing); Policy-based routing; Dynamic Source Routing; Multipath routing; Algorithm; Routing protocol; Quality of service","score_opus":0.010540313508659303,"score_gpt":0.2189825577600339,"score_spread":0.2084422442513746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522894013","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000037785987,0.00063041266,0.99508727,0.0006688693,0.0024236378,0.0005916253,0.00001925354,0.00042948537,0.00011166175],"genre_scores_gemma":[0.047969814,0.000048297283,0.94981855,0.0007640291,0.0007616514,0.000024557172,0.000015458718,0.000058587077,0.0005390765],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963318,0.00001567072,0.00059530797,0.0015058683,0.00066024956,0.0008911058],"domain_scores_gemma":[0.9976441,0.00073294993,0.00024944686,0.0009525227,0.00022311448,0.00019786855],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005661349,0.0006014027,0.00061229424,0.0005916353,0.00023980837,0.0004621412,0.0026156974,0.00033542715,0.000011947832],"category_scores_gemma":[0.00006267632,0.0005917411,0.00022186952,0.0004896249,0.00020299532,0.00040062526,0.00044749802,0.0007566628,0.000019209525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.270063e-7,0.000017360082,3.3854934e-7,0.000010590284,0.0000093960725,0.000020026624,0.00008725381,0.2807938,0.000005976319,0.003147217,0.000008109071,0.7158991],"study_design_scores_gemma":[0.0004364035,0.00013324326,0.000007504065,0.0003046279,0.000012875774,0.000060970244,6.707642e-8,0.99357975,0.000011525796,0.0025136704,0.002305234,0.0006341555],"about_ca_topic_score_codex":0.0000020508073,"about_ca_topic_score_gemma":0.000018254996,"teacher_disagreement_score":0.715265,"about_ca_system_score_codex":0.0003050937,"about_ca_system_score_gemma":0.00023314678,"threshold_uncertainty_score":0.9996534},"labels":[],"label_agreement":null},{"id":"W1525152908","doi":"10.1109/iscc.1998.702446","title":"Design considerations for link-state routing protocols","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Link-state routing protocol; Computer network; Routing protocol; Zone Routing Protocol; Static routing; Enhanced Interior Gateway Routing Protocol; Dynamic Source Routing; Distributed computing; Wireless Routing Protocol; Interior gateway protocol; Policy-based routing; Routing Information Protocol; Routing (electronic design automation)","score_opus":0.09229484860055066,"score_gpt":0.2784361676113502,"score_spread":0.18614131901079956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1525152908","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009505968,0.000013567553,0.98352903,0.006064171,0.000073288866,0.0077089136,4.984804e-7,0.00031969935,0.002281332],"genre_scores_gemma":[0.39730915,0.0000017265502,0.58258677,0.002114839,0.00016609256,0.01253705,2.821818e-7,0.000008836545,0.005275242],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992457,0.000050231785,0.00018371451,0.00021704166,0.000090124406,0.00021315471],"domain_scores_gemma":[0.99897486,0.00058219937,0.00004939942,0.00023210069,0.00010091353,0.00006052179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023791958,0.00007960096,0.000094050505,0.000027178221,0.0002092449,0.00024059578,0.00018891743,0.000028183611,0.00010915254],"category_scores_gemma":[0.00007830737,0.000068449415,0.00003908649,0.0000945623,0.000014795356,0.00022153984,0.000026460768,0.000054423363,0.00008611004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041755357,0.0000471153,0.000015756319,0.000004607041,0.000017583247,0.00000508972,0.0005051007,0.013808866,0.00010094485,0.26032928,0.03180664,0.69335485],"study_design_scores_gemma":[0.0005117843,0.00007474514,0.0000063989205,0.000008680012,0.000002094325,0.0000069337652,0.0000027656845,0.98139256,0.0002859152,0.012155304,0.005451939,0.000100890655],"about_ca_topic_score_codex":9.1448106e-7,"about_ca_topic_score_gemma":0.000002905923,"teacher_disagreement_score":0.96758366,"about_ca_system_score_codex":0.000011154469,"about_ca_system_score_gemma":0.000029276176,"threshold_uncertainty_score":0.2791286},"labels":[],"label_agreement":null},{"id":"W1527729503","doi":"10.1109/vetec.1998.686192","title":"Explicit rate controller design for ABR services: an H/sub ∞/ optimization approach","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Burstiness; Bottleneck; Computer science; Queueing theory; Variable bitrate; Throughput; Controller (irrigation); Propagation delay; Node (physics); Queue; Computer network; Transmission (telecommunications); Real-time computing; Quality of service; Engineering; Telecommunications; Network packet; Embedded system","score_opus":0.03403866988735075,"score_gpt":0.212266187279368,"score_spread":0.17822751739201725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1527729503","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016859507,0.00013313591,0.99560827,0.00048992824,0.00014050525,0.000746335,9.724247e-7,0.00040875812,0.0023035037],"genre_scores_gemma":[0.41285098,0.000035240824,0.58245784,0.0025497503,0.00020832439,0.00035483635,0.000007969038,0.000017896744,0.001517157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987713,0.00012839583,0.00022577835,0.00043826242,0.00013452109,0.0003017098],"domain_scores_gemma":[0.99913603,0.00015304613,0.000080918835,0.00035845558,0.00014300294,0.00012852343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003835955,0.00015904741,0.00019262303,0.000059893202,0.00016820166,0.00025983158,0.00058816525,0.0000791595,0.000049277667],"category_scores_gemma":[0.000006806726,0.00013352642,0.000063925756,0.00022020134,0.000011682209,0.0007073012,0.00003185868,0.000056812318,0.000028800008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027011807,0.000121044395,0.0000030325625,0.000008245273,0.000022260203,6.1574207e-7,0.00027370354,0.8727868,0.00007586546,0.03389741,0.0012107461,0.091573246],"study_design_scores_gemma":[0.0016646136,0.00012056748,0.000004354792,0.000004494283,0.000012113378,0.000003083018,0.00003354492,0.996963,0.00007286675,0.00027234998,0.00066645956,0.00018254775],"about_ca_topic_score_codex":0.0000028978886,"about_ca_topic_score_gemma":0.000001480025,"teacher_disagreement_score":0.4131504,"about_ca_system_score_codex":0.000016509734,"about_ca_system_score_gemma":0.000012091494,"threshold_uncertainty_score":0.544505},"labels":[],"label_agreement":null},{"id":"W1527917834","doi":"10.1007/978-3-540-30566-8_92","title":"Communication Using a Reconfigurable and Reliable Transport Layer Protocol","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Transport layer; Computer network; Transmission Control Protocol; OSI model; Distributed computing; Application layer; User Datagram Protocol; Internet protocol suite; Network packet; Layer (electronics); Software; Interconnection; The Internet; Operating system","score_opus":0.022060710398959734,"score_gpt":0.2555663383320637,"score_spread":0.23350562793310398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1527917834","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005239519,0.00017648698,0.9833462,0.0006631769,0.00029149753,0.010664282,0.0000015703304,0.00016244645,0.0046419273],"genre_scores_gemma":[0.28005257,0.00005895925,0.7132201,0.0021621534,0.00038305763,0.003275767,0.00000589194,0.00007161067,0.00076983584],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99738455,0.00002866607,0.0004935174,0.0010721831,0.0005294423,0.00049167237],"domain_scores_gemma":[0.9979441,0.00016025123,0.00026713902,0.0012667772,0.00020674962,0.00015497326],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079885754,0.00040116603,0.00043793145,0.00035740517,0.00035788104,0.0003463491,0.0018580949,0.00028894926,0.00003532475],"category_scores_gemma":[0.0000146748325,0.00037700182,0.00007607728,0.000382336,0.0004928863,0.0006727256,0.00023388723,0.0007057788,0.000011967258],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017758251,0.000038894406,0.00006592117,0.00007045143,0.000013411764,0.00004233181,0.00043995638,0.16028513,0.00008944957,0.07440224,0.000011984561,0.76452243],"study_design_scores_gemma":[0.0009597947,0.00014004803,0.000059421644,0.0011003481,0.000013708885,0.00010586434,1.3447728e-7,0.82546496,0.00034741813,0.16558611,0.0055339457,0.0006882212],"about_ca_topic_score_codex":0.00007865184,"about_ca_topic_score_gemma":0.0000783549,"teacher_disagreement_score":0.76383424,"about_ca_system_score_codex":0.0002527349,"about_ca_system_score_gemma":0.0008244144,"threshold_uncertainty_score":0.9998682},"labels":[],"label_agreement":null},{"id":"W1528384142","doi":"10.1109/pacrim.2005.1517234","title":"Performance comparison of ECN-blue in both single bottleneck and multi-bottleneck networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Bottleneck; Computer science; Queue; Network packet; Computer network; Queueing theory; Active queue management; Drop (telecommunication); Real-time computing; Network congestion; Telecommunications; Embedded system","score_opus":0.01966806228528698,"score_gpt":0.24515821833648746,"score_spread":0.22549015605120049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528384142","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5296136,0.0012985392,0.4665367,0.00055595225,0.00018523789,0.00016661207,4.0981283e-7,0.000116856834,0.0015260736],"genre_scores_gemma":[0.959659,0.00009837366,0.039546065,0.00023866261,0.00009088875,0.0000086789505,8.9220964e-7,0.000007831383,0.00034960633],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987497,0.00004921661,0.0003981127,0.00032498737,0.00016104619,0.00031695075],"domain_scores_gemma":[0.99933165,0.00010748159,0.000110133544,0.0003208078,0.00003722111,0.000092685324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022963666,0.00015297795,0.00029191963,0.00008613023,0.00005827444,0.00005335813,0.00039627225,0.00008842107,0.000018263096],"category_scores_gemma":[0.00000942555,0.00013814226,0.000036874644,0.00027270897,0.00006552937,0.0003781453,0.00011830916,0.00016188424,0.000011381083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001318838,0.00022488563,0.041077264,0.000007935391,0.0000072917132,9.1267617e-7,0.00031049552,0.14325267,0.000069335176,0.0014841374,0.0003663674,0.8131855],"study_design_scores_gemma":[0.0009665478,0.00011454308,0.025114702,0.00003879856,0.0000040237414,0.000003836838,0.00003117667,0.9718165,0.00026645814,0.000004719546,0.0014777272,0.0001609936],"about_ca_topic_score_codex":0.000017157248,"about_ca_topic_score_gemma":0.0002488502,"teacher_disagreement_score":0.8285638,"about_ca_system_score_codex":0.00003240619,"about_ca_system_score_gemma":0.00002589245,"threshold_uncertainty_score":0.5633278},"labels":[],"label_agreement":null},{"id":"W1529277239","doi":"10.1109/glocom.2004.1378201","title":"Self-tuning PI TCP flow controller for AQM routers with interval gain and phase margin assignment","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Active queue management; Control theory (sociology); Phase margin; PID controller; Robustness (evolution); Network congestion; Queue; Computer science; Controller (irrigation); Transmission Control Protocol; Real-time computing; Computer network; Engineering; Amplifier; Control engineering; Bandwidth (computing); Network packet; Control (management); Operational amplifier","score_opus":0.009918497370447272,"score_gpt":0.23225005216910288,"score_spread":0.2223315547986556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529277239","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017991881,0.00014269512,0.98872685,0.007419234,0.000116792944,0.0005059631,0.0000022456122,0.0002643074,0.0010227016],"genre_scores_gemma":[0.7576774,0.000009600238,0.2382654,0.0023969335,0.00017398145,0.00010265638,0.0000017288673,0.000010396372,0.0013619236],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998866,0.000051471015,0.00018961864,0.00038310373,0.00018022355,0.00032956756],"domain_scores_gemma":[0.9993323,0.00018044144,0.00006816395,0.00020631628,0.000056109708,0.00015667637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032592818,0.00017493908,0.0002275573,0.00005617558,0.000121088306,0.00020766022,0.00028585442,0.00004406176,0.000025712045],"category_scores_gemma":[0.0000073154524,0.00012933981,0.00005605231,0.00008782155,0.000029051476,0.0003524983,0.00006264389,0.00008701366,0.000010464371],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019450391,0.00015972838,0.000038073096,0.000008808693,0.000106175525,0.000006214864,0.0003769679,0.0038290077,0.000066361616,0.013554745,0.0063943677,0.975265],"study_design_scores_gemma":[0.008226821,0.00041854026,0.000011698166,0.000021779519,0.000023504475,0.000013916061,0.000048102193,0.9438108,0.00006775355,0.00005582961,0.04711489,0.00018634817],"about_ca_topic_score_codex":0.0000015578727,"about_ca_topic_score_gemma":0.000015276808,"teacher_disagreement_score":0.9750787,"about_ca_system_score_codex":0.00005224022,"about_ca_system_score_gemma":0.000042316966,"threshold_uncertainty_score":0.52743244},"labels":[],"label_agreement":null},{"id":"W1529401495","doi":"10.1109/milcom.1999.822735","title":"Connection level priority/pre-emption service for ATM-based networks","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kingston Health Sciences Centre; Communications Research Centre Canada","funders":"Ministère de la Défense Nationale","keywords":"Computer network; Computer science; Service (business); Connection (principal bundle); Asynchronous Transfer Mode; Protocol (science); Distributed computing; Engineering","score_opus":0.027013190139672495,"score_gpt":0.24822928982125833,"score_spread":0.22121609968158584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529401495","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003264944,0.00007295952,0.99180233,0.0017297046,0.0009881071,0.00043257084,0.0000011817493,0.00036714325,0.0013410592],"genre_scores_gemma":[0.9443648,0.000004457133,0.05111809,0.003414301,0.00017313311,0.00009383934,0.000007300955,0.000010080318,0.0008140185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891365,0.00008410145,0.00020362288,0.00036068723,0.00014373806,0.00029419357],"domain_scores_gemma":[0.9990449,0.00024190963,0.00007564072,0.00034605231,0.00019743011,0.00009409791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040764094,0.00013723852,0.0001389191,0.000045007917,0.00019347704,0.00013066918,0.00028121253,0.00010749983,0.00003796923],"category_scores_gemma":[0.000035597008,0.00012961545,0.00007528683,0.0003479644,0.0000121129,0.0002763646,0.00001732158,0.00009682212,0.000026302763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055894605,0.00012437704,0.00057050353,0.000021976097,0.000030878222,0.0000014240759,0.000072568415,0.17777275,0.000089439636,0.5134668,0.004904596,0.30288878],"study_design_scores_gemma":[0.0012036251,0.000081083555,0.0009409003,0.000010372908,0.000011171778,0.000004342162,0.0000084005715,0.97561526,0.00014173129,0.0011232465,0.020680947,0.00017889093],"about_ca_topic_score_codex":0.00002085867,"about_ca_topic_score_gemma":0.00015770168,"teacher_disagreement_score":0.9410998,"about_ca_system_score_codex":0.000043765544,"about_ca_system_score_gemma":0.0000861021,"threshold_uncertainty_score":0.52855647},"labels":[],"label_agreement":null},{"id":"W1529846964","doi":"10.1023/a:1016541127634","title":"Stability and Fairness of a Rate Allocation Scheme","year":2002,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Computer science; Max-min fairness; Robustness (evolution); Resource allocation; Scheme (mathematics); Mathematical optimization; Distributed computing; Computer network","score_opus":0.03644284711681931,"score_gpt":0.22775897739515932,"score_spread":0.19131613027834002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529846964","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30936047,0.009617669,0.66957283,0.0034672418,0.00034544696,0.00088093086,0.0000030672898,0.00043863605,0.006313681],"genre_scores_gemma":[0.9969436,0.00017503178,0.002656064,0.00003769077,0.000018364708,0.000049725593,0.0000021011479,0.000004135188,0.000113273636],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989478,0.00033414972,0.00032228424,0.00017315519,0.00011559543,0.00010700538],"domain_scores_gemma":[0.9983661,0.00020971938,0.00018665171,0.0010139402,0.00017712876,0.00004644823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007031881,0.00007625187,0.00015803153,0.000043225697,0.00008344908,0.000066408415,0.0005943492,0.000046694888,0.000015289092],"category_scores_gemma":[0.000038990187,0.00007337255,0.00002263947,0.00024304136,0.000056578574,0.00028032088,0.0001071944,0.00008131911,0.000020238887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013424872,0.0003317609,0.005484649,0.00017410301,0.00007535232,6.0331934e-7,0.0037911693,0.00046033185,0.0055742194,0.48571056,0.00095396617,0.49742985],"study_design_scores_gemma":[0.00039023653,0.000043202457,0.0026196516,0.00003572687,0.000004616504,0.0000068731406,0.00013067744,0.99196285,0.0002618471,0.00015418397,0.004271585,0.00011853568],"about_ca_topic_score_codex":0.000046150377,"about_ca_topic_score_gemma":0.000008896573,"teacher_disagreement_score":0.9915025,"about_ca_system_score_codex":0.000022742297,"about_ca_system_score_gemma":0.000013732457,"threshold_uncertainty_score":0.29920456},"labels":[],"label_agreement":null},{"id":"W1532358800","doi":"","title":"Active congestion control using available bandwidth-based congestion detection","year":2005,"lang":"en","type":"article","venue":"International Conference on Information and Automation","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Network congestion; Computer network; Computer science; Router; Network traffic control; Flow control (data); Network packet; Bandwidth (computing); Bandwidth management; Packet loss; Explicit Congestion Notification; Real-time computing; Slow-start","score_opus":0.019221530783443394,"score_gpt":0.24667860594037958,"score_spread":0.2274570751569362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1532358800","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026547125,0.000016837772,0.95190495,0.0072412207,0.0008537083,0.00044342052,0.000023533592,0.00050235435,0.012466865],"genre_scores_gemma":[0.9936884,0.000024689862,0.0038405522,0.002078625,0.00014663867,0.000055046727,0.000058868052,0.0000059889344,0.000101214035],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985271,0.0000907179,0.0004718586,0.00024299101,0.00046897822,0.00019836804],"domain_scores_gemma":[0.9986051,0.00010210485,0.00038466242,0.00019653389,0.0005845513,0.00012706465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003266723,0.00019986804,0.00016088427,0.00036394043,0.00023130998,0.00056384085,0.0002776222,0.00013499914,0.00023263699],"category_scores_gemma":[0.00013372314,0.00020026657,0.00005126776,0.00018652495,0.000052854004,0.003946657,0.000028111574,0.00018590917,0.0003516515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012053374,0.000045624507,0.00005253946,0.000008589959,0.00003052157,5.543115e-7,0.00018570955,0.027260646,0.00093442015,0.070917055,0.0003731474,0.90007067],"study_design_scores_gemma":[0.0018758866,0.000097963435,0.0019763836,0.00006374143,0.000013263555,0.000014690416,0.00003974867,0.9848268,0.0011935015,0.00035880238,0.009324685,0.00021450783],"about_ca_topic_score_codex":0.00002106841,"about_ca_topic_score_gemma":0.000012067129,"teacher_disagreement_score":0.9671413,"about_ca_system_score_codex":0.00021969219,"about_ca_system_score_gemma":0.00018016306,"threshold_uncertainty_score":0.8166634},"labels":[],"label_agreement":null},{"id":"W1532938809","doi":"10.20381/ruor-16147","title":"Quality of service management for multicast applications using MPEG-4/DMIF.","year":2000,"lang":"en","type":"dissertation","venue":"Library and Archives Canada (Government of Canada)","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Multicast; Computer science; Service quality; Quality of service; Computer network; Service (business); Business; Marketing","score_opus":0.007348102395824109,"score_gpt":0.19381758131185045,"score_spread":0.18646947891602633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1532938809","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061225813,0.001819613,0.20464623,0.007121744,0.0015092304,0.005249688,0.0016958666,0.0001232973,0.7166085],"genre_scores_gemma":[0.9445857,0.00030630152,0.03986415,0.0014530172,0.000124191,0.00018585454,0.00014923827,0.000039089242,0.013292482],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792635,0.00004645612,0.0004549579,0.0003383207,0.0010096865,0.00022425284],"domain_scores_gemma":[0.9989248,0.00024357042,0.00034144247,0.00034577594,0.0000025998568,0.00014183906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000016897695,0.0001987437,0.00032853105,0.00003026749,0.0001483211,0.00002577279,0.00053126283,0.000042085525,0.000010553286],"category_scores_gemma":[7.167703e-7,0.00021111325,0.00004774007,0.00013108358,0.000020786674,0.00020658303,0.000060148745,0.00009139874,2.0132087e-9],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064237823,0.00007166319,0.00019812514,0.0015623177,0.00024399112,0.0000067234078,0.00014446999,0.0015028579,0.0014893641,0.4071709,0.00023403174,0.58673316],"study_design_scores_gemma":[0.004801926,0.00021528674,0.04844191,0.0015457092,0.00048401894,0.000008899299,0.009271722,0.6842629,0.023669016,0.012360578,0.2122594,0.0026786877],"about_ca_topic_score_codex":0.0010973145,"about_ca_topic_score_gemma":0.025886172,"teacher_disagreement_score":0.88335985,"about_ca_system_score_codex":0.0000072844623,"about_ca_system_score_gemma":0.0010658782,"threshold_uncertainty_score":0.9918889},"labels":[],"label_agreement":null},{"id":"W1536706045","doi":"10.1023/a:1019174606123","title":"Design and evaluation of multicast GFR for supporting TCP/IP over hybrid wired/wireless ATM","year":2000,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Computer science; Computer network; Multicast; Unicast; Xcast; Source-specific multicast; Pragmatic General Multicast; Frame (networking); Distributed computing; IP multicast","score_opus":0.023078047763722957,"score_gpt":0.27270110147815857,"score_spread":0.2496230537144356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1536706045","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3345928,0.00041200637,0.66362596,0.00016402366,0.0002327307,0.0007510419,0.00000238682,0.00010146184,0.00011759642],"genre_scores_gemma":[0.99076355,0.00010381482,0.008290319,0.00018366655,0.00029700095,0.00017285881,0.00001184531,0.000026709646,0.00015023608],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975186,0.00029347168,0.0005647034,0.00058130943,0.00049844926,0.00054349104],"domain_scores_gemma":[0.99824834,0.000603728,0.0002621425,0.000468202,0.0002628088,0.00015475678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018697191,0.00024912457,0.00038866748,0.00005894161,0.00020369948,0.00012626703,0.00046203547,0.0001230117,0.00008961929],"category_scores_gemma":[0.000024101482,0.0002446858,0.000101112804,0.00024444878,0.00010327745,0.00034890408,0.00006429778,0.00014803419,0.0000047659787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006870189,0.00005180752,0.00012350378,0.000011785289,0.000035929534,0.0000031598065,0.00014096688,0.18691258,0.000046381392,0.0016256524,0.00081460224,0.8101649],"study_design_scores_gemma":[0.0021184469,0.00010775552,0.00070018123,0.00008293823,0.00008083556,0.000016066262,0.000013280085,0.9955688,0.00017258627,0.0004621986,0.00041188597,0.0002650209],"about_ca_topic_score_codex":0.000012181239,"about_ca_topic_score_gemma":0.000008533852,"teacher_disagreement_score":0.8098999,"about_ca_system_score_codex":0.000047984064,"about_ca_system_score_gemma":0.00011149901,"threshold_uncertainty_score":0.99779975},"labels":[],"label_agreement":null},{"id":"W1537270548","doi":"10.1007/11422778_38","title":"Improving Network Convergence Time and Network Stability of an OSPF-Routed IP Network","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Solana Networks (Canada); Nortel (Canada)","funders":"","keywords":"Computer network; Computer science; Open Shortest Path First; Routing protocol; Network packet; Network congestion; Hazy Sighted Link State Routing Protocol; Packet loss; Convergence (economics); Node (physics); Distributed computing; Link-state routing protocol; Engineering","score_opus":0.008755596036375773,"score_gpt":0.2065472179826279,"score_spread":0.19779162194625213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537270548","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013318988,0.002436264,0.9918488,0.00033633152,0.0023516428,0.00071888574,0.0000068545555,0.00029468987,0.00067459705],"genre_scores_gemma":[0.41296223,0.00016625378,0.5779136,0.0021224692,0.006436934,0.000022296073,0.000018933508,0.00008489331,0.00027240108],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940108,0.00017989376,0.001102517,0.0022332682,0.0010187848,0.001454709],"domain_scores_gemma":[0.99540347,0.0010006527,0.00077400194,0.0019687298,0.00041630666,0.0004368635],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002711257,0.0008044815,0.0011498634,0.0001948961,0.00047721245,0.0004293686,0.0031748987,0.0005365696,0.00008517597],"category_scores_gemma":[0.00006976168,0.0007781964,0.00017314099,0.0010382746,0.0012142395,0.0009595644,0.0014809128,0.0010597665,0.000022130454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022256347,0.000020377563,0.00017624635,0.000019398574,0.000017675025,0.000018094508,0.00011473852,0.3860388,0.000016789563,0.00793202,0.00005347437,0.60557014],"study_design_scores_gemma":[0.0004086437,0.0003000651,0.0003630814,0.00033271153,0.000028544675,0.000041975763,1.1510525e-7,0.97185975,0.000043661697,0.024763508,0.0010747421,0.0007831829],"about_ca_topic_score_codex":0.000041144413,"about_ca_topic_score_gemma":0.00024197895,"teacher_disagreement_score":0.60478693,"about_ca_system_score_codex":0.0001934762,"about_ca_system_score_gemma":0.00070128654,"threshold_uncertainty_score":0.9994669},"labels":[],"label_agreement":null},{"id":"W1537313756","doi":"10.1109/glocom.2002.1189109","title":"Extensions to OSPF for tunnel multicasting","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Multicast; Open Shortest Path First; Computer network; Computer science; Protocol Independent Multicast; Overhead (engineering); Routing (electronic design automation); Distance Vector Multicast Routing Protocol; Source-specific multicast; Xcast; Routing protocol; Protocol (science); Distributed computing; Link-state routing protocol; Medicine","score_opus":0.022102464361245213,"score_gpt":0.25419996482345003,"score_spread":0.23209750046220481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537313756","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023342415,0.000024289708,0.9889902,0.0021158045,0.0003572068,0.00023189862,3.7094418e-7,0.00018605766,0.00575996],"genre_scores_gemma":[0.6818117,4.7171721e-7,0.31428462,0.0018459973,0.0000391044,0.000037811973,1.4689157e-7,0.0000037276159,0.0019764125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993289,0.000020419531,0.00011345159,0.0002324494,0.000078010344,0.00022674189],"domain_scores_gemma":[0.99926907,0.0002468814,0.000015715306,0.00024298373,0.00009551963,0.00012983567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018335333,0.000067390145,0.000081027305,0.000031429794,0.00012342942,0.00006139819,0.00021743521,0.000022909058,0.000024031557],"category_scores_gemma":[0.00022960064,0.000056912406,0.000041743246,0.00016219947,0.0000070011083,0.00009167902,0.00003169898,0.000035273206,0.00009988501],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024513145,0.000028596343,0.0000339889,0.0000014728352,0.0000055345936,0.000002170855,0.00009469492,0.0023052455,0.00038788826,0.6783181,0.0071313316,0.31168854],"study_design_scores_gemma":[0.00073807343,0.000097858254,0.00030068404,0.000013969997,0.0000068995328,0.000014881869,0.00005638316,0.90356153,0.0003998975,0.0029973364,0.09157652,0.00023595209],"about_ca_topic_score_codex":0.0000017400745,"about_ca_topic_score_gemma":0.0000070414835,"teacher_disagreement_score":0.9012563,"about_ca_system_score_codex":0.000008599161,"about_ca_system_score_gemma":0.00003040233,"threshold_uncertainty_score":0.23208205},"labels":[],"label_agreement":null},{"id":"W1538979191","doi":"10.1007/3-540-44456-4_19","title":"Performance Analysis of Secure Web Server Based on SSL","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Transport Layer Security; The Internet; Web server; Secure communication; Session (web analytics); Software deployment; Client; Database transaction; Computer network; Fat client; Operating system; Server; World Wide Web; Database; Encryption","score_opus":0.008198137368940863,"score_gpt":0.20662415664984862,"score_spread":0.19842601928090775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1538979191","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024055226,0.00015118995,0.9882929,0.0005561612,0.0007275048,0.00026851767,0.000011207551,0.00014421072,0.007442816],"genre_scores_gemma":[0.9682088,0.00004673663,0.02928469,0.0019890708,0.0001975563,0.0000070818796,0.000009319222,0.000020048117,0.00023671657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99632156,0.000044914555,0.0005655885,0.001319285,0.0012087874,0.00053989457],"domain_scores_gemma":[0.9971853,0.00045926878,0.00031316897,0.0016666878,0.00022058084,0.00015498976],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066203554,0.00049415854,0.00078728155,0.0017277614,0.00016117709,0.00018963014,0.0028967794,0.00030722175,0.00016455725],"category_scores_gemma":[0.000017373632,0.00043635242,0.00031921608,0.0021492587,0.0004281892,0.00031892923,0.0002584626,0.00065775675,0.00003803667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000117212185,0.000022245013,0.00014110352,0.000010835054,0.000041137697,0.000012622656,0.00006024198,0.5565211,0.0000034422594,0.003313216,0.000010330854,0.43985197],"study_design_scores_gemma":[0.00031460339,0.00022013363,0.00057418476,0.0002445428,0.0000959544,0.0000034948455,2.4386708e-8,0.99508756,0.000059743288,0.0017771877,0.0011818554,0.00044074084],"about_ca_topic_score_codex":0.000006741598,"about_ca_topic_score_gemma":0.00006662144,"teacher_disagreement_score":0.96580327,"about_ca_system_score_codex":0.00014588678,"about_ca_system_score_gemma":0.00062468,"threshold_uncertainty_score":0.99980885},"labels":[],"label_agreement":null},{"id":"W1539847566","doi":"10.1007/978-0-387-35353-1_22","title":"A neural network approach to effective bandwidth characterization in ATM networks","year":2000,"lang":"en","type":"book-chapter","venue":"IFIP advances in information and communication technology","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Bandwidth (computing); Asynchronous Transfer Mode; Artificial neural network; Quality of service; Metric (unit); Performance metric; Computer network; Algorithm; Real-time computing; Engineering; Artificial intelligence","score_opus":0.0035856722451069354,"score_gpt":0.20113870071380915,"score_spread":0.1975530284687022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1539847566","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033051235,0.012751041,0.7057983,0.0023788784,0.00041306415,0.0028474194,0.000012959703,0.0007708557,0.27469692],"genre_scores_gemma":[0.8702813,0.083198346,0.031043164,0.0058976472,0.00023612803,0.0026515208,0.0013207765,0.00008360313,0.005287521],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841064,0.00007756646,0.0007387651,0.00030660178,0.00015682347,0.00030962285],"domain_scores_gemma":[0.99843085,0.00012896967,0.00037289914,0.0009149673,0.00009123681,0.00006105915],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033716366,0.00029726585,0.0004210736,0.0007229226,0.00013409508,0.00012225671,0.0010707979,0.0004955205,0.000010102111],"category_scores_gemma":[0.000020440253,0.00031753565,0.00004054565,0.00055643136,0.00013044017,0.0016368303,0.0003304852,0.0007804801,0.000029134791],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002144349,0.000009778274,0.00006409985,0.000008066608,0.000003943262,3.35582e-7,0.00014080032,0.027203185,9.834701e-8,0.36186916,0.00001992076,0.6106592],"study_design_scores_gemma":[0.0009120074,0.000110010864,0.00068019313,0.0003001869,0.000007756975,0.000024962119,0.000030064279,0.5271144,8.9805934e-7,0.045184284,0.4251322,0.00050304213],"about_ca_topic_score_codex":0.0000029849664,"about_ca_topic_score_gemma":0.000040631032,"teacher_disagreement_score":0.8699508,"about_ca_system_score_codex":0.00011025491,"about_ca_system_score_gemma":0.00003355276,"threshold_uncertainty_score":0.9999277},"labels":[],"label_agreement":null},{"id":"W1540395161","doi":"10.1109/icc.2001.936634","title":"Tail probabilities for the multiplexing of fractional α-stable broadband traffic","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Statistical time division multiplexing; Computer network; Computer science; Queueing theory; Multiplexing; Broadband networks; Broadband; Internet traffic; Traffic generation model; Internet traffic engineering; Traffic shaping; Multiplexer; Network packet; Network traffic control; The Internet; Telecommunications","score_opus":0.028513889124005792,"score_gpt":0.2199975480130455,"score_spread":0.1914836588890397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1540395161","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054260767,0.0007983819,0.98662704,0.0037589364,0.0003306784,0.00041055834,0.0000036016365,0.00013760487,0.0025071376],"genre_scores_gemma":[0.98139256,0.000018631961,0.013211431,0.00021073454,0.00010953373,0.00008207525,5.688955e-7,0.0000040841765,0.0049704053],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993049,0.00002176245,0.00017505052,0.0001715025,0.00015411244,0.0001726873],"domain_scores_gemma":[0.9987509,0.00082092884,0.00005865353,0.00023728675,0.00010261385,0.000029565497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019360114,0.00007411988,0.000100818506,0.000024438246,0.00016219252,0.00006106024,0.0003490995,0.000030736912,0.00017034363],"category_scores_gemma":[0.000044595225,0.00004824574,0.00006895478,0.00012222565,0.00005996343,0.00023285119,0.000027186563,0.000059291662,0.000010842701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001548042,0.00011948446,0.00013532762,0.000019835867,0.00004722137,3.1392082e-7,0.0006391161,0.1519381,0.000038632963,0.15637395,0.014886449,0.6757861],"study_design_scores_gemma":[0.00043081952,0.000041914718,0.00008232329,0.0000058098844,0.0000052247606,0.0000030271092,0.00010253957,0.97125053,0.000058863265,0.00057675305,0.02737544,0.000066777255],"about_ca_topic_score_codex":0.0000055983223,"about_ca_topic_score_gemma":0.00001801915,"teacher_disagreement_score":0.97596645,"about_ca_system_score_codex":0.000012577093,"about_ca_system_score_gemma":0.000020815238,"threshold_uncertainty_score":0.19674042},"labels":[],"label_agreement":null},{"id":"W1541632711","doi":"10.1109/ccece.2015.7129189","title":"Internet traffic control with the H<inf>2</inf>/H<inf>∞</inf> controller","year":2015,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Controller (irrigation); Computer science; Algorithm; Biology","score_opus":0.018944588933030297,"score_gpt":0.21616498902313355,"score_spread":0.19722040009010325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1541632711","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084869824,0.00693279,0.8084983,0.032249723,0.0053661354,0.00609757,0.000120372715,0.0043402202,0.051525064],"genre_scores_gemma":[0.9513832,0.00013416402,0.004256996,0.009290294,0.0019054048,0.00069143996,0.00005489214,0.00020963716,0.032074008],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.98766613,0.0012309816,0.00222757,0.0028091704,0.0029737712,0.0030923565],"domain_scores_gemma":[0.98991776,0.0020019158,0.0011571909,0.0034617877,0.0016519311,0.001809416],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0034696755,0.0020499679,0.002464549,0.00058216794,0.0007907873,0.002081765,0.0056284247,0.00083232095,0.0008667612],"category_scores_gemma":[0.00041048342,0.0014030422,0.0009400722,0.0018063985,0.0010363339,0.001858824,0.00078314904,0.001506562,0.0032686333],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032292777,0.0014080562,0.0006193201,0.000079073325,0.0024358714,0.00030852426,0.004965575,0.049619835,0.0014699043,0.18756375,0.5238775,0.22442335],"study_design_scores_gemma":[0.019346619,0.0013899716,0.00065038353,0.00017150561,0.00042745937,0.00030957337,0.00017888118,0.37526053,0.00005471782,0.0006865046,0.5994534,0.002070455],"about_ca_topic_score_codex":0.000078379555,"about_ca_topic_score_gemma":0.0023907044,"teacher_disagreement_score":0.8665133,"about_ca_system_score_codex":0.00048181988,"about_ca_system_score_gemma":0.0011833289,"threshold_uncertainty_score":0.9997516},"labels":[],"label_agreement":null},{"id":"W1541797253","doi":"10.1109/iccs.2002.1182527","title":"Development in QoS control for video communication","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Quality of service; Computer science; Scalability; Key (lock); Mobile QoS; Quality assurance; Strengths and weaknesses; Quality (philosophy); Control (management); Service (business); Multimedia; Computer network; Service provider; Artificial intelligence; Computer security; Database","score_opus":0.014341417003802126,"score_gpt":0.2295570267627581,"score_spread":0.21521560975895598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1541797253","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021071439,0.00016211638,0.99062717,0.00093271176,0.00012602734,0.00032457648,1.378461e-7,0.000082175575,0.0056379614],"genre_scores_gemma":[0.81958354,0.0000031406491,0.17864402,0.00124104,0.00000974189,0.00015821069,6.3473175e-7,0.0000027163483,0.00035698767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999378,0.00006107123,0.00018138648,0.00014667066,0.00007511078,0.0001577509],"domain_scores_gemma":[0.99939483,0.00019468034,0.00003603368,0.00028730452,0.000050068877,0.000037079513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045287528,0.00006150755,0.00009065041,0.00004053969,0.00006937909,0.000047296297,0.00034109876,0.000024508596,0.000015450452],"category_scores_gemma":[0.000041309657,0.00005552902,0.000021669428,0.00011995701,0.000009968254,0.00013916074,0.0000166729,0.000046645346,0.000025598381],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056675535,0.00004129975,0.00031728324,0.0000019613392,0.0000069004714,4.5876618e-7,0.00015523883,0.000478274,0.000025491127,0.79674184,0.0013643629,0.20086119],"study_design_scores_gemma":[0.004326153,0.00003381443,0.001143078,0.0000218688,0.0000038051471,0.0000049056507,0.00004836761,0.30450037,0.00053196866,0.004729665,0.6843911,0.00026494687],"about_ca_topic_score_codex":0.0000024539768,"about_ca_topic_score_gemma":0.00008104712,"teacher_disagreement_score":0.8174764,"about_ca_system_score_codex":0.000032584398,"about_ca_system_score_gemma":0.00009099105,"threshold_uncertainty_score":0.22644077},"labels":[],"label_agreement":null},{"id":"W1541967644","doi":"10.1023/a:1019150312811","title":"Overflow and losses in a network queue with a self-similar input","year":2000,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada; University of Ottawa","funders":"","keywords":"Computer science; Mathematics","score_opus":0.004166838745077293,"score_gpt":0.18051843837150056,"score_spread":0.17635159962642327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1541967644","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.842855,0.012361192,0.12097732,0.0019889686,0.0011561507,0.0015639282,0.0000028428353,0.0017104984,0.017384104],"genre_scores_gemma":[0.99588823,0.000106062405,0.0027203928,0.00027923493,0.0003196842,0.0000559909,6.500665e-7,0.000014084581,0.0006156938],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854124,0.00016575215,0.0002664748,0.00041749817,0.00021653116,0.0003925197],"domain_scores_gemma":[0.99928194,0.00013625828,0.00006751058,0.00037486016,0.000034954854,0.00010446974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000382833,0.00018018355,0.00028094448,0.000059764814,0.00010883659,0.0002926009,0.00031735116,0.00008132027,0.000009867603],"category_scores_gemma":[0.000005179775,0.00014923207,0.000024283914,0.000450682,0.00003065953,0.00034694214,0.000034486864,0.00016150805,0.000026628446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017504166,0.00024004575,0.06782828,0.0002814564,0.0002187828,0.0008250832,0.0043741353,0.4111469,0.00001543165,0.12821947,0.006695953,0.3799794],"study_design_scores_gemma":[0.0012012938,0.00016892907,0.0032179602,0.0005811277,0.000012644061,0.00018941429,0.000039522798,0.96025735,0.0000022796519,0.00021185631,0.033743236,0.00037436257],"about_ca_topic_score_codex":0.00024643046,"about_ca_topic_score_gemma":0.00017664119,"teacher_disagreement_score":0.5491105,"about_ca_system_score_codex":0.00004349054,"about_ca_system_score_gemma":0.00008607049,"threshold_uncertainty_score":0.6085508},"labels":[],"label_agreement":null},{"id":"W1547335581","doi":"10.1109/mmcs.1998.693655","title":"Performance evaluation of MPEG2 video using guaranteed service over IP-ATM networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Jitter; Computer network; ATM adaptation layer; Computer science; Asynchronous Transfer Mode; Network packet; Packet switching; Optical IP Switching; Real-time computing; Internet Protocol; The Internet; Telecommunications; Operating system","score_opus":0.04300035841053988,"score_gpt":0.2507582403909169,"score_spread":0.20775788198037698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1547335581","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6346733,0.0005917117,0.3575857,0.0003514911,0.0005148378,0.00027989235,3.7838728e-7,0.00014641923,0.0058562728],"genre_scores_gemma":[0.9950057,0.000028457247,0.0037060766,0.0009517743,0.0001398192,0.000009166125,6.663828e-7,0.0000071397253,0.00015119252],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985397,0.00010880576,0.00029182405,0.000272835,0.0005390996,0.00024772043],"domain_scores_gemma":[0.9989909,0.00007253714,0.00013198673,0.00043649328,0.00031433796,0.000053759653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006686822,0.00012743851,0.00016619822,0.000060466802,0.00009923926,0.000054757267,0.00045327118,0.00007148862,0.00043966903],"category_scores_gemma":[0.000012945609,0.000113965805,0.000051872754,0.000582178,0.000021828293,0.00047403312,0.00007665376,0.00009907796,0.0000383834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007394323,0.000048436417,0.0013403308,0.0000075634402,0.000023918952,6.3562976e-7,0.00020617884,0.4755743,0.000105704734,0.0021100657,0.00065618916,0.5199193],"study_design_scores_gemma":[0.0008235789,0.000031688112,0.0034493676,0.00003824855,0.00003530086,0.000007713258,0.000008969892,0.9950552,0.00004642104,0.000037285445,0.00033125098,0.00013495878],"about_ca_topic_score_codex":0.000030880903,"about_ca_topic_score_gemma":0.000021098047,"teacher_disagreement_score":0.51978433,"about_ca_system_score_codex":0.00004405763,"about_ca_system_score_gemma":0.000032925473,"threshold_uncertainty_score":0.48140678},"labels":[],"label_agreement":null},{"id":"W1547955112","doi":"10.12681/eadd/19074","title":"Μοντέλα ασυνήθους δικτυακής κυκλοφορίας σε TCP/IP δικτυακά υπολογιστικά περιβάλλοντα","year":2008,"lang":"en","type":"dissertation","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Hacker; Computer science; Intrusion detection system; Formalism (music); Computer security; Ip address; Software; Communications protocol; Instant messaging; Computer network; Operating system","score_opus":0.008054110643210854,"score_gpt":0.21922253744261613,"score_spread":0.21116842679940528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1547955112","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042853,0.0100174965,0.21496192,0.004825592,0.024352085,0.0031930888,0.000047446505,0.006488559,0.6932608],"genre_scores_gemma":[0.66070664,0.0019901905,0.01390458,0.0032330477,0.002762058,0.00044039416,0.00085478043,0.00023762847,0.3158707],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99448186,0.00019381868,0.0010865106,0.001774772,0.0012704539,0.0011925558],"domain_scores_gemma":[0.99619114,0.000302424,0.0005743167,0.0018979282,0.0005316919,0.00050251716],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00033805327,0.0010481672,0.0010603638,0.0004784345,0.00059152103,0.0005106346,0.0030474197,0.00080155925,0.00079211756],"category_scores_gemma":[0.00007257763,0.0009729981,0.000598992,0.0009744216,0.000098061624,0.00075689604,0.00018348487,0.0011056546,0.0020743527],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013865929,0.000390031,0.00017195904,0.00013675363,0.00039928037,0.00042132096,0.0018219156,0.00056788884,0.00019274412,0.20433924,0.17883901,0.6125812],"study_design_scores_gemma":[0.007408189,0.0010842285,0.01062891,0.00093772664,0.0005478945,0.0008719045,0.001112372,0.20091753,0.0023970783,0.014377629,0.7506757,0.009040854],"about_ca_topic_score_codex":0.0001713665,"about_ca_topic_score_gemma":0.000835314,"teacher_disagreement_score":0.61785364,"about_ca_system_score_codex":0.00017407633,"about_ca_system_score_gemma":0.0008987343,"threshold_uncertainty_score":0.99927205},"labels":[],"label_agreement":null},{"id":"W1548652524","doi":"10.1109/eurcon.2001.938166","title":"Analysis of end-to-end delay based on enhanced-EFCI congestion control algorithm for ABR service","year":2002,"lang":"en","type":"article","venue":"EUROCON'2001. International Conference on Trends in Communications. Technical Program, Proceedings (Cat. No.01EX439)","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Network congestion; Computer science; Computer network; Flow control (data); Service (business); End-to-end principle; Algorithm; Asynchronous Transfer Mode; Quality of service; Real-time computing","score_opus":0.06242097611086476,"score_gpt":0.33410690172535384,"score_spread":0.27168592561448907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1548652524","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070192306,0.000073475276,0.85070723,0.059908774,0.00093770516,0.0046079257,0.00041178346,0.0022411903,0.07409269],"genre_scores_gemma":[0.7715351,0.00012309218,0.22325374,0.0022715349,0.0001042202,0.0021514841,0.00019057454,0.00004081743,0.0003294541],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952685,0.00016585075,0.0014197176,0.0012720629,0.0010776798,0.00079613714],"domain_scores_gemma":[0.9935143,0.0011194231,0.0008022132,0.0016122644,0.002592614,0.00035921036],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012783109,0.0006009236,0.0008905111,0.0019213576,0.00030422496,0.00043290496,0.0053911447,0.0003445814,0.00061356596],"category_scores_gemma":[0.0005759306,0.00062147155,0.00038754687,0.0034745268,0.00029765183,0.0004921549,0.00043939604,0.0006888923,0.00011388444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017754488,0.0021494206,0.000248962,0.000018046107,0.0002959584,0.000002345968,0.00014122378,0.002387767,0.0013697636,0.03487567,0.0011231363,0.9572102],"study_design_scores_gemma":[0.0021991315,0.0012418057,0.0014945341,0.00020533704,0.00021087551,0.000005007689,0.000025464713,0.98658,0.00013716372,0.0004637691,0.006864199,0.00057266874],"about_ca_topic_score_codex":0.000052627798,"about_ca_topic_score_gemma":0.00026761144,"teacher_disagreement_score":0.98419225,"about_ca_system_score_codex":0.00038380688,"about_ca_system_score_gemma":0.00010643386,"threshold_uncertainty_score":0.99999017},"labels":[],"label_agreement":null},{"id":"W1548718579","doi":"10.1109/mascot.2004.1348290","title":"Simulation evaluation of hybrid srpt scheduling policies","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Sarepta Therapeutics; Western Canada Research Grid","keywords":"Computer science; Scheduling (production processes); Parameterized complexity; Processor sharing; Distributed computing; Computer network; Queueing theory; Algorithm; Mathematical optimization; Mathematics","score_opus":0.03489781125112198,"score_gpt":0.2982966620312789,"score_spread":0.26339885078015696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1548718579","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2601331,0.000066178996,0.73767996,0.0005915487,0.0001075457,0.00009277652,1.594877e-7,0.00007730291,0.0012514195],"genre_scores_gemma":[0.9837915,0.0000012884915,0.015964601,0.00015267465,0.00005739096,0.0000050722238,8.9357934e-7,0.0000023367495,0.000024251045],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992252,0.00003729034,0.00015352671,0.0001279926,0.00035554988,0.000100463134],"domain_scores_gemma":[0.9993667,0.000073397,0.00006164789,0.00019602124,0.00027289172,0.000029344847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044614534,0.000053085456,0.00007235255,0.000055524484,0.000043752665,0.000032483138,0.0001863315,0.000014051246,0.000018885614],"category_scores_gemma":[0.00007517632,0.00004775146,0.00003202308,0.00016428331,0.00001630488,0.00025287905,0.000028966066,0.00003385693,0.000020333544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010159833,0.000013336343,0.000027446627,9.1002977e-7,0.0000040510163,1.4377831e-7,0.00005920729,0.80363834,0.000070323906,0.08224813,0.0000034501682,0.113933615],"study_design_scores_gemma":[0.000563861,0.000021934073,0.00034138773,0.000009859859,0.00000988135,0.0000011150814,0.000010345671,0.98805475,0.0013549823,0.009524794,0.000052903015,0.000054174598],"about_ca_topic_score_codex":0.000024648221,"about_ca_topic_score_gemma":0.0000056379104,"teacher_disagreement_score":0.7236584,"about_ca_system_score_codex":0.000036721773,"about_ca_system_score_gemma":0.00011312016,"threshold_uncertainty_score":0.1947248},"labels":[],"label_agreement":null},{"id":"W1548931130","doi":"10.1109/pimrc.2004.1368363","title":"Dynamic congestion control for satellite networks employing TCP performance enhancement proxies","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Vedecká Grantová Agentúra MŠVVaŠ SR a SAV","keywords":"TCP Friendly Rate Control; TCP acceleration; TCP tuning; Computer network; Computer science; TCP global synchronization; CUBIC TCP; Zeta-TCP; H-TCP; Transmission Control Protocol; Network congestion; TCP Westwood plus; Real-time computing; Distributed computing","score_opus":0.007660401201670762,"score_gpt":0.22344390071093567,"score_spread":0.2157834995092649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1548931130","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018070739,0.0011277836,0.9749253,0.0032867123,0.00048341881,0.000831716,6.9838205e-7,0.00039902757,0.000874633],"genre_scores_gemma":[0.9539245,0.0003373733,0.041388217,0.0013657616,0.00020459303,0.00032173767,0.0000059119643,0.000013620735,0.0024383054],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984404,0.00004406669,0.00036600564,0.00044320556,0.0002069299,0.0004994276],"domain_scores_gemma":[0.9990497,0.00018827911,0.00012352034,0.0003720472,0.00015933777,0.000107114756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004260222,0.00020926668,0.00023148367,0.00006531549,0.00023837676,0.000181292,0.00047398196,0.00008538532,0.0000288838],"category_scores_gemma":[0.000014133102,0.00018351298,0.00008762145,0.00016655105,0.000046667396,0.0006122207,0.000047010468,0.00012662419,0.000060542276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004464386,0.000044132423,0.00036689974,0.000010588495,0.00002970537,4.2707856e-7,0.00006788031,0.038261104,0.00008331953,0.01499107,0.0002874746,0.94581276],"study_design_scores_gemma":[0.0013448687,0.00017668778,0.0015659436,0.000033099644,0.00001695622,0.000005285686,0.0000063497164,0.9737665,0.0001300084,0.00008286209,0.022630334,0.00024107957],"about_ca_topic_score_codex":0.0000013725529,"about_ca_topic_score_gemma":0.000020152867,"teacher_disagreement_score":0.94557166,"about_ca_system_score_codex":0.00008607919,"about_ca_system_score_gemma":0.000049969465,"threshold_uncertainty_score":0.7483442},"labels":[],"label_agreement":null},{"id":"W1549894404","doi":"10.1007/11600930_101","title":"Heuristic Approaches to Service Level Agreements in Packet Networks","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Heuristics; Quality of service; Admission control; Scalability; Reservation; The Internet; Computer network; Heuristic; Call Admission Control; Distributed computing; Network packet; Resource allocation; Computational complexity theory; Wireless network; Artificial intelligence; Wireless; Algorithm","score_opus":0.07028767277108075,"score_gpt":0.23424971898856364,"score_spread":0.1639620462174829,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549894404","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000983302,0.00045583418,0.9909828,0.004266626,0.0014800926,0.00068792555,0.000005235622,0.00014977384,0.0018734363],"genre_scores_gemma":[0.70845425,0.00004180037,0.27648523,0.012503048,0.0016622538,0.00005722199,0.000012451078,0.00006185336,0.0007218922],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99532616,0.00006398149,0.00070173776,0.0019026384,0.0009708144,0.0010346643],"domain_scores_gemma":[0.9974198,0.00043728354,0.00023130562,0.0014264794,0.00015763959,0.00032750441],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009880118,0.0006602224,0.00066339615,0.0008253052,0.00018072841,0.00052601757,0.004015828,0.00037237696,0.000026187641],"category_scores_gemma":[0.00004421718,0.00063895795,0.000102773316,0.0013309857,0.00020512803,0.00046241278,0.0013595701,0.0010038258,0.00012780326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063680936,0.000025248773,0.0000437991,0.000009790328,0.000005975121,0.000038051807,0.00030016128,0.40124264,7.777398e-7,0.009165916,0.000041349573,0.5891199],"study_design_scores_gemma":[0.00044211655,0.00009469248,0.00046787105,0.0003833821,0.000007259016,0.000028140994,2.2117428e-7,0.9804715,0.0000068018735,0.015164253,0.0022174008,0.00071637897],"about_ca_topic_score_codex":0.00003541832,"about_ca_topic_score_gemma":0.0014645624,"teacher_disagreement_score":0.7144975,"about_ca_system_score_codex":0.00039000352,"about_ca_system_score_gemma":0.00041551565,"threshold_uncertainty_score":0.9996062},"labels":[],"label_agreement":null},{"id":"W1551811873","doi":"10.1007/978-0-387-35620-4_19","title":"A Distributed Policy Approach in Support of Multimedia Session Establishment","year":2003,"lang":"en","type":"book-chapter","venue":"IFIP advances in information and communication technology","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Session (web analytics); Computer science; Reservation; Resource (disambiguation); Set (abstract data type); Host (biology); Quality of service; Function (biology); Multimedia; Resource allocation; Network packet; Computer security; Computer network; World Wide Web","score_opus":0.006449401840363725,"score_gpt":0.23847732273881614,"score_spread":0.23202792089845242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1551811873","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011176313,0.015613605,0.5611784,0.009902346,0.00028672622,0.0017780402,0.00008561625,0.00052874646,0.41051477],"genre_scores_gemma":[0.5822497,0.17586593,0.22587395,0.0045244885,0.000058203335,0.0011009906,0.0023472412,0.00007192378,0.00790757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99859834,0.000041168598,0.0008208832,0.0001787064,0.00017963782,0.00018124902],"domain_scores_gemma":[0.99826974,0.00009082093,0.00059129304,0.0008745431,0.00013561694,0.00003799443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003267126,0.0001942679,0.00034885653,0.0011242749,0.000051615018,0.00003766207,0.00089830963,0.00039066107,0.000009380433],"category_scores_gemma":[0.00006569323,0.0001971966,0.000032567877,0.00042761205,0.00022293213,0.0012620521,0.00030330656,0.00048948324,0.000007188757],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057907964,0.000020718044,0.000062449624,0.000025603424,0.0000030317342,2.5876878e-7,0.00016434243,0.0002932204,2.8991406e-7,0.5356114,0.00012897512,0.46368393],"study_design_scores_gemma":[0.0015578187,0.000088932684,0.00006880111,0.00019714521,0.0000063565403,0.000023999235,0.00020588835,0.034027733,0.000024994482,0.09453325,0.868902,0.00036302573],"about_ca_topic_score_codex":0.0000073405895,"about_ca_topic_score_gemma":0.000021072306,"teacher_disagreement_score":0.8687731,"about_ca_system_score_codex":0.00012076151,"about_ca_system_score_gemma":0.0001209665,"threshold_uncertainty_score":0.8041444},"labels":[],"label_agreement":null},{"id":"W1552056093","doi":"10.1007/978-3-540-30536-1_34","title":"A User Level, Reliable, and Reconfigurable Transport Layer Protocol","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Transport layer; Computer network; TCP Friendly Rate Control; Transmission Control Protocol; Distributed computing; Network packet; Layer (electronics)","score_opus":0.021297036056935805,"score_gpt":0.24183109956596427,"score_spread":0.22053406350902846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1552056093","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001949749,0.00009902344,0.9753855,0.001214927,0.00071591855,0.013555568,0.0000046879854,0.00023772402,0.00876718],"genre_scores_gemma":[0.28454423,0.00008500159,0.6788888,0.009513838,0.001853463,0.014259889,0.000012308605,0.00020304628,0.0106394505],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99611735,0.000018561559,0.00059939234,0.0017224681,0.00079463853,0.0007476004],"domain_scores_gemma":[0.99794537,0.00016613536,0.0002531729,0.0011352734,0.00023928305,0.00026073967],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076315086,0.00059569185,0.00060214894,0.00046789192,0.00028494498,0.00042272385,0.0020712595,0.00040429467,0.00008646426],"category_scores_gemma":[0.000018135232,0.0005287857,0.000114224116,0.00047896663,0.0005469543,0.0007164753,0.00018135011,0.00089097663,0.000044836215],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024023313,0.00003784905,0.000108712484,0.00007859314,0.000017432176,0.00016078667,0.00027636407,0.038948044,0.00003546521,0.089790635,0.00008034818,0.87044173],"study_design_scores_gemma":[0.0048517007,0.001018457,0.0010234837,0.0030722455,0.000049449216,0.000480273,3.0994298e-7,0.43228385,0.0015874604,0.433089,0.1190228,0.0035210068],"about_ca_topic_score_codex":0.00004568919,"about_ca_topic_score_gemma":0.00011929164,"teacher_disagreement_score":0.8669207,"about_ca_system_score_codex":0.00021295802,"about_ca_system_score_gemma":0.0010741488,"threshold_uncertainty_score":0.99971634},"labels":[],"label_agreement":null},{"id":"W1552237926","doi":"10.1109/isspit.2004.1433738","title":"An adaptive algorithm for internet multimedia delivery in a differentiated services environment","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Quality of service; The Internet; Class (philosophy); Differentiated services; Mobile QoS; Quality (philosophy); Multimedia; Service (business); Computer network; Distributed computing; Service delivery framework; Artificial intelligence; World Wide Web","score_opus":0.008106479634664742,"score_gpt":0.20414311208524794,"score_spread":0.1960366324505832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1552237926","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031677283,0.00011569779,0.9673974,0.00022912677,0.000096649994,0.00027350528,0.0000037285579,0.000120350334,0.00008626374],"genre_scores_gemma":[0.78707886,0.000013713309,0.21203874,0.00040329492,0.000089922556,0.00006781076,0.000009775372,0.0000054725533,0.000292426],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908614,0.0000425909,0.0001812867,0.00033807848,0.00012020328,0.00023172233],"domain_scores_gemma":[0.999564,0.000069277776,0.00004373148,0.00021142236,0.000020228563,0.00009136973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009860342,0.00012228356,0.00012968491,0.00006339923,0.000025173573,0.0000634275,0.00047964967,0.000053009495,0.000072012364],"category_scores_gemma":[6.11762e-7,0.00010607031,0.00003997252,0.00006328291,0.000016569613,0.0003983266,0.00006817111,0.000067417015,0.000064165695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014831543,0.00015721454,0.000096883756,0.0000010336051,0.000013359386,0.0000018259747,0.00039119823,0.0015411468,0.000037888552,0.0012077515,0.0000723854,0.9964645],"study_design_scores_gemma":[0.0010762409,0.00015996785,0.001642595,0.000009956347,0.0000049114974,0.0000011404608,0.000049856506,0.99515414,0.0001797023,0.00007284458,0.0015129859,0.0001356493],"about_ca_topic_score_codex":0.00006122209,"about_ca_topic_score_gemma":0.00026803667,"teacher_disagreement_score":0.99632883,"about_ca_system_score_codex":0.000046963825,"about_ca_system_score_gemma":0.000012443755,"threshold_uncertainty_score":0.43254218},"labels":[],"label_agreement":null},{"id":"W1559896152","doi":"10.1109/mascot.2004.1348194","title":"A hysteresis model for Web/TCP transfer latency","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; TCP global synchronization; Latency (audio); TCP Friendly Rate Control; TCP tuning; H-TCP; CUBIC TCP; Zeta-TCP; Computer network; Network packet; Transmission Control Protocol; Telecommunications","score_opus":0.019084047576947545,"score_gpt":0.220602509563046,"score_spread":0.20151846198609846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1559896152","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007491368,0.000059641516,0.98473763,0.004407837,0.00013597347,0.00023112139,0.0000024834085,0.00029058044,0.0026433782],"genre_scores_gemma":[0.94843113,0.0000064286764,0.047989216,0.0011814274,0.0000488223,0.00006274487,7.557701e-7,0.000006593082,0.0022728967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924237,0.000008584675,0.00014844244,0.00025581886,0.00011325769,0.00023152035],"domain_scores_gemma":[0.99956435,0.00003482697,0.000010119211,0.00025551234,0.00005546559,0.00007971975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009339001,0.00009656969,0.00011367487,0.00003745026,0.0000763056,0.000067965324,0.0004036395,0.000047675643,0.000013663382],"category_scores_gemma":[0.000003791214,0.00007917172,0.0000940764,0.000112206755,0.00001389458,0.00023226462,0.000018650344,0.00004487237,0.000044091983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014140205,0.000062611725,0.000007762268,0.000007948261,0.000017693841,0.0000022671288,0.00030374472,0.06268584,0.0003175049,0.7739187,0.0010260901,0.16163568],"study_design_scores_gemma":[0.001317568,0.000044944067,0.000021442367,0.000008283951,0.0000069980506,0.0000026250925,0.0000042791617,0.9827722,0.00011264604,0.01460117,0.0009838439,0.0001240556],"about_ca_topic_score_codex":0.0000042148745,"about_ca_topic_score_gemma":0.00003924698,"teacher_disagreement_score":0.9409397,"about_ca_system_score_codex":0.000018254605,"about_ca_system_score_gemma":0.00011055204,"threshold_uncertainty_score":0.3228529},"labels":[],"label_agreement":null},{"id":"W1560610948","doi":"10.1109/glocom.2002.1188456","title":"RSVP-based QoS control by policy","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Quality of service; The Internet; Computer network; Differentiated services; Integrated services; Session (web analytics); Task (project management); Network packet; Service provider; Resource allocation; Service (business); World Wide Web; Business","score_opus":0.003231202741907958,"score_gpt":0.19970830959988836,"score_spread":0.1964771068579804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1560610948","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00070495054,0.00011118066,0.9588638,0.03207411,0.00023155214,0.00014510492,0.0000024130825,0.00044559085,0.0074212756],"genre_scores_gemma":[0.97741866,0.0000027163944,0.006541789,0.014767884,0.00026922746,0.000023701037,0.000001522937,0.0000063148464,0.0009681838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990547,0.000031796284,0.00015187224,0.00026600264,0.00019405416,0.00030157814],"domain_scores_gemma":[0.9993249,0.00007115959,0.00003990751,0.00036772026,0.000051725587,0.00014457868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000116404204,0.00011738233,0.00012979642,0.00006418309,0.000088049805,0.00011169146,0.000552328,0.000051920495,0.000040794876],"category_scores_gemma":[0.000021389875,0.00009891503,0.00006620454,0.0002950639,0.00003496082,0.00017629008,0.000023898434,0.00008499903,0.00026544067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014163637,0.00013257918,0.00008807621,0.0000025457211,0.000021631276,0.00001172913,0.000038507285,0.016990632,0.0004283577,0.7190989,0.023301484,0.23987138],"study_design_scores_gemma":[0.020147903,0.0004998362,0.00056762254,0.000037341983,0.000025742198,0.00002465973,0.0000158263,0.7270016,0.0029409183,0.014442467,0.23327644,0.0010196487],"about_ca_topic_score_codex":0.00009703751,"about_ca_topic_score_gemma":0.000013163768,"teacher_disagreement_score":0.9767137,"about_ca_system_score_codex":0.000056869707,"about_ca_system_score_gemma":0.00027146455,"threshold_uncertainty_score":0.40336376},"labels":[],"label_agreement":null},{"id":"W1560891889","doi":"10.1007/3-540-45391-1_5","title":"Mobile Network Domain Agency for Managing Network Resources","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Reservation; Computer network; Quality of service; Domain (mathematical analysis); Resource (disambiguation); Inter-domain; The Internet; Agency (philosophy); Distributed computing; World Wide Web","score_opus":0.00876589319801255,"score_gpt":0.2184261824410833,"score_spread":0.20966028924307076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1560891889","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004036268,0.0045586806,0.9790397,0.00054541056,0.002993237,0.001180292,0.0000044456838,0.00038720568,0.01125062],"genre_scores_gemma":[0.059948076,0.0005156203,0.92143023,0.0054907813,0.009690826,0.0002528279,0.000016215974,0.00012730621,0.002528111],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99482036,0.000070560294,0.0007495623,0.0020130263,0.0008416364,0.0015048785],"domain_scores_gemma":[0.99679226,0.00082463434,0.00036021625,0.0015932772,0.00016233498,0.00026727066],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015113582,0.0007233206,0.0007747244,0.00036323405,0.0007577889,0.00076984096,0.00409253,0.00040342566,0.000058937378],"category_scores_gemma":[0.000015128263,0.00069195573,0.0002974574,0.0008441029,0.00054298464,0.00043924735,0.00075445254,0.0007858689,0.00005392445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013568642,0.00000824514,0.000009282406,0.000011563257,0.000012665312,0.000029860563,0.00028956254,0.3976695,4.7062161e-7,0.035457976,0.00038356948,0.5661137],"study_design_scores_gemma":[0.00030821614,0.00021390927,0.000014424426,0.00032438285,0.000012035336,0.000026369617,8.602601e-8,0.46187684,0.0000016576998,0.46231353,0.074341014,0.0005675412],"about_ca_topic_score_codex":0.000006943776,"about_ca_topic_score_gemma":0.000053594205,"teacher_disagreement_score":0.5655462,"about_ca_system_score_codex":0.00019112448,"about_ca_system_score_gemma":0.00032772848,"threshold_uncertainty_score":0.99955314},"labels":[],"label_agreement":null},{"id":"W1561119721","doi":"10.1109/glocom.1994.513591","title":"A dynamic priority queueing approach to traffic regulation and scheduling in B-ISDN","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Queueing theory; Computer network; Network packet; Priority ceiling protocol; Scheduling (production processes); Priority inheritance; Integrated Services Digital Network; Multiplexing; Priority queue; Deadline-monotonic scheduling; Statistical time division multiplexing; Real-time computing; Packet switching; Fair queuing; Dynamic priority scheduling; Queue; Round-robin scheduling; Mathematical optimization; Rate-monotonic scheduling; Quality of service; Telecommunications; Mathematics","score_opus":0.01253717379610884,"score_gpt":0.21264455987550615,"score_spread":0.20010738607939732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1561119721","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35880768,0.00020290598,0.636754,0.0010391669,0.000064711756,0.00018153651,7.1586804e-8,0.00015784324,0.0027920832],"genre_scores_gemma":[0.88743514,0.00000997636,0.11194299,0.00020433839,0.000019464343,0.000013334784,3.219168e-7,0.000004017726,0.0003704119],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991154,0.00004588844,0.00016760174,0.00033991766,0.00012890968,0.00020227565],"domain_scores_gemma":[0.99961525,0.00004463512,0.00002688715,0.00020593267,0.000022523625,0.000084770196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023002875,0.00009125365,0.00011773373,0.00011215167,0.00006442988,0.00011552132,0.00020220637,0.0000499978,0.000007756334],"category_scores_gemma":[0.000016266094,0.00008759235,0.000019634865,0.0004012493,0.000014050959,0.00028502985,0.000057174573,0.00010258812,0.000018192955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002746779,0.00005851073,0.00019718839,0.000006374252,0.0000031827424,0.0000016452387,0.00083924766,0.13210209,0.000046311536,0.02816907,0.000031439085,0.8385422],"study_design_scores_gemma":[0.00032030756,0.000018347951,0.0046034474,0.000014074436,0.000001575574,0.000007604245,0.00003090122,0.99457747,0.0000020542138,0.00015316682,0.00015905124,0.00011198053],"about_ca_topic_score_codex":0.000007685201,"about_ca_topic_score_gemma":0.00004699591,"teacher_disagreement_score":0.8624754,"about_ca_system_score_codex":0.00003713316,"about_ca_system_score_gemma":0.0000100978805,"threshold_uncertainty_score":0.35719123},"labels":[],"label_agreement":null},{"id":"W1564387379","doi":"","title":"A Markovian jump congestion control strategy for mobile ad-hoc networks with differentiated services traffic","year":2010,"lang":"en","type":"article","venue":"Chinese Control Conference","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Computer network; Network congestion; Markov process; Wireless ad hoc network; Mobile ad hoc network; Throughput; Controller (irrigation); Vehicular ad hoc network; Network packet; Packet loss; Distributed computing; Wireless; Mathematics","score_opus":0.005594481226531264,"score_gpt":0.21954024232224262,"score_spread":0.21394576109571134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1564387379","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38369417,0.0014142533,0.609809,0.0007642212,0.001064983,0.002231101,0.00005647657,0.00076809025,0.00019773544],"genre_scores_gemma":[0.9958199,0.00009363027,0.0011949043,0.00073450676,0.00043174508,0.0013290371,0.000070298054,0.000057215668,0.00026872865],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99654657,0.00020109203,0.0006648884,0.0011586893,0.00044277534,0.0009859807],"domain_scores_gemma":[0.9963105,0.00076243875,0.00043616825,0.0011010416,0.000907989,0.00048191435],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005106989,0.00074435957,0.0009233542,0.00017763447,0.00042822695,0.00085808214,0.0016525115,0.00037698698,0.00011913765],"category_scores_gemma":[0.000045766603,0.0005509758,0.00023674543,0.000498586,0.00021515689,0.0007869519,0.00006899677,0.000772219,0.00002762704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020729916,0.0004739842,0.0026745535,0.00012258384,0.00048256482,0.00005438593,0.00040341172,0.1022575,0.0017567836,0.010591401,0.0001848851,0.87892497],"study_design_scores_gemma":[0.011881267,0.00087729516,0.0112233935,0.00007555111,0.0001351399,0.000049313898,0.000034384437,0.972565,0.000005127098,0.00041340754,0.0020283398,0.0007118099],"about_ca_topic_score_codex":0.000007940358,"about_ca_topic_score_gemma":0.0012501237,"teacher_disagreement_score":0.87821317,"about_ca_system_score_codex":0.000031861884,"about_ca_system_score_gemma":0.0003035773,"threshold_uncertainty_score":0.99969417},"labels":[],"label_agreement":null},{"id":"W1568044446","doi":"10.1007/978-0-387-35620-4_11","title":"Policy-Based Management with Active Networks","year":2003,"lang":"en","type":"book-chapter","venue":"IFIP advances in information and communication technology","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Active networking; Computer network; Computer science; Workload; Quality of service; Provisioning; Outsourcing; Distributed computing; Operating system; Business","score_opus":0.003490299921969137,"score_gpt":0.21048071665255988,"score_spread":0.20699041673059074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1568044446","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000002903062,0.005065456,0.5885896,0.0045104716,0.0000685169,0.00048014047,0.0000027275648,0.00032304198,0.40095717],"genre_scores_gemma":[0.34495208,0.29197076,0.29446554,0.025727335,0.000116601776,0.0021136007,0.00046375554,0.0001436047,0.04004672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990139,0.000027373457,0.00040916167,0.00019350126,0.00015839128,0.00019764963],"domain_scores_gemma":[0.99830794,0.00007089751,0.0004135857,0.0010461976,0.00012139144,0.00003998623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014084383,0.0002295962,0.0002435296,0.0008432682,0.0001370328,0.00007760421,0.00091913826,0.00029864238,0.000008662089],"category_scores_gemma":[0.000008254392,0.00021764297,0.000027050955,0.00031344546,0.00024324904,0.0010371278,0.00019309363,0.00050052523,0.000016735832],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000091696975,0.000004146176,0.000003126095,0.000008267007,0.000007561451,5.674811e-7,0.000019104164,0.0023390995,4.015948e-9,0.51158184,0.00003147884,0.48599562],"study_design_scores_gemma":[0.0011220108,0.00009539638,0.000014930624,0.0003124055,0.000012900129,0.000017954886,0.00008550152,0.04597927,0.0000037731036,0.1323586,0.81962454,0.0003727112],"about_ca_topic_score_codex":0.0000014401965,"about_ca_topic_score_gemma":0.00002912673,"teacher_disagreement_score":0.8195931,"about_ca_system_score_codex":0.000102132326,"about_ca_system_score_gemma":0.00006163284,"threshold_uncertainty_score":0.8875222},"labels":[],"label_agreement":null},{"id":"W1572240008","doi":"10.1109/icppw.2004.35","title":"Constrained cost minimization for multipoint communication groups","year":2004,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Parallel Processing","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Minification; Span (engineering); Routing (electronic design automation); Distributed computing; Range (aeronautics); Path (computing); Quality of service; Mathematical optimization; Core (optical fiber); Computer network; Mathematics; Telecommunications; Engineering","score_opus":0.03771328992926238,"score_gpt":0.2766058736599391,"score_spread":0.23889258373067673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1572240008","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022669334,0.000091709175,0.919745,0.0386262,0.00043674698,0.0012664964,0.000009993729,0.0002101977,0.016944265],"genre_scores_gemma":[0.9464017,0.000022579903,0.052692756,0.0005116895,0.00005550987,0.00015062226,0.0000052637893,0.000008640421,0.0001512357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988486,0.0000062788513,0.00034142332,0.00027798858,0.00035761655,0.0001680588],"domain_scores_gemma":[0.9982855,0.000056100173,0.00043725307,0.0001414058,0.0010342008,0.000045540677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026331784,0.00014176432,0.00014861544,0.000077107565,0.00021379483,0.0002931978,0.00161796,0.00006252699,0.000007174282],"category_scores_gemma":[0.0001629111,0.00011208687,0.00008166401,0.00016946973,0.00012317902,0.0005961273,0.00014951422,0.00013826003,0.0000032934581],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008626055,0.00010545914,0.000110712,0.000030238849,0.000023607006,8.814315e-8,0.0005534829,0.0054819128,0.00189562,0.9220199,0.00018804558,0.069504656],"study_design_scores_gemma":[0.002763325,0.00009867981,0.0003767417,0.00063299545,0.000018102715,0.000014061605,0.0003531119,0.87822986,0.0035660542,0.11294571,0.0007449607,0.00025639927],"about_ca_topic_score_codex":0.0000047358008,"about_ca_topic_score_gemma":0.000004265957,"teacher_disagreement_score":0.92373234,"about_ca_system_score_codex":0.00008744013,"about_ca_system_score_gemma":0.00016926203,"threshold_uncertainty_score":0.45707697},"labels":[],"label_agreement":null},{"id":"W1574226723","doi":"10.1109/glocom.2003.1258791","title":"Priority queuing of long-range dependent traffic","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Queue; Queueing theory; Computer science; Priority queue; Queue management system; Range (aeronautics); Computer network; Real-time computing; Engineering","score_opus":0.00925108868110951,"score_gpt":0.2203643565325959,"score_spread":0.21111326785148637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574226723","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2634277,0.00024609553,0.7329577,0.000880343,0.0002649675,0.00011762781,3.4301263e-7,0.000210015,0.001895164],"genre_scores_gemma":[0.99039245,0.000014453022,0.009102911,0.00017156685,0.00005922681,0.0000052236837,2.9935913e-7,0.0000038464364,0.00025002],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912804,0.000025862262,0.00019516337,0.00022585472,0.00023273606,0.00019235347],"domain_scores_gemma":[0.9994475,0.00004052572,0.0000580857,0.00031598643,0.00006283846,0.00007506486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019591044,0.00008859502,0.00013814039,0.000045801575,0.000047540227,0.000040783852,0.00047218174,0.000045921206,0.000024420158],"category_scores_gemma":[0.0000102517515,0.0000770322,0.000062912244,0.00018883773,0.000027668364,0.00021355496,0.0000624341,0.00008816423,0.00004136893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009072679,0.00016064172,0.00091524806,0.000013653151,0.000023450251,0.00003969469,0.00044923305,0.045090336,0.000061028037,0.124813266,0.0000752729,0.8283491],"study_design_scores_gemma":[0.021185065,0.0015501429,0.09067643,0.00047974996,0.0001578785,0.00046440098,0.00037801184,0.85640293,0.009054163,0.01333111,0.0033617993,0.002958311],"about_ca_topic_score_codex":0.00002873667,"about_ca_topic_score_gemma":0.0001730623,"teacher_disagreement_score":0.8253908,"about_ca_system_score_codex":0.000033960652,"about_ca_system_score_gemma":0.000093234856,"threshold_uncertainty_score":0.3141282},"labels":[],"label_agreement":null},{"id":"W1575361522","doi":"10.1007/978-3-540-24840-8_62","title":"Genetic Algorithm Based OSPF Network Routing Using LEDA","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Open Shortest Path First; Quality of service; Genetic algorithm; Context (archaeology); Routing protocol; Routing (electronic design automation); Shortest path problem; Distributed computing; Computer network; Routing algorithm; Algorithm; Link-state routing protocol; Theoretical computer science; Machine learning","score_opus":0.013615546472580403,"score_gpt":0.2233515970803785,"score_spread":0.2097360506077981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1575361522","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000445196,0.00086348987,0.99396384,0.0004125612,0.0032740596,0.00045458064,0.0000025261606,0.0003189556,0.000665458],"genre_scores_gemma":[0.13054825,0.000013288502,0.86498994,0.002331605,0.0019916685,0.00000706744,0.000002399727,0.00004931771,0.00006643986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99503094,0.000061421946,0.0007113758,0.0018798525,0.001115533,0.0012008698],"domain_scores_gemma":[0.99714327,0.00046349625,0.0004028307,0.0014433522,0.0002712035,0.0002758454],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008905166,0.0007101251,0.0006717292,0.00044732654,0.000535758,0.0007698683,0.0032352332,0.00041584187,0.00003897592],"category_scores_gemma":[0.00003668846,0.00069891283,0.00021783853,0.00090444984,0.0005441307,0.0004007697,0.00081419264,0.0009967415,0.000038656417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013425863,0.000010418211,0.000015009746,0.000005590281,0.000005814721,0.00008257398,0.00004159938,0.5044113,0.000003040689,0.005363306,0.0000041597996,0.4900559],"study_design_scores_gemma":[0.00047652563,0.000116088326,0.000050284474,0.00058283826,0.000017402996,0.00006704972,3.9274397e-8,0.9412382,0.000032182434,0.056259457,0.0004362964,0.00072363165],"about_ca_topic_score_codex":0.000044153523,"about_ca_topic_score_gemma":0.00003187612,"teacher_disagreement_score":0.48933226,"about_ca_system_score_codex":0.0005899611,"about_ca_system_score_gemma":0.0017823623,"threshold_uncertainty_score":0.99954623},"labels":[],"label_agreement":null},{"id":"W1577615149","doi":"10.1109/icc.2015.7249296","title":"An SU traffic controller for the TCP/AQM Networks","year":2015,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Robustness (evolution); Computer science","score_opus":0.02591107484856318,"score_gpt":0.25342943992766803,"score_spread":0.22751836507910486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1577615149","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00074781524,0.0009167352,0.9905222,0.00491754,0.0009166818,0.00049927854,6.800226e-7,0.00037292042,0.0011061701],"genre_scores_gemma":[0.98963165,0.000010890278,0.0051129404,0.0028090393,0.00068597274,0.0001275295,0.0000018009762,0.0000103382545,0.0016098494],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988746,0.00007825461,0.00019399544,0.0003082451,0.0001926431,0.00035226918],"domain_scores_gemma":[0.99862593,0.00045465902,0.000055130186,0.00050032965,0.00015189892,0.00021202234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007244772,0.00013639929,0.00016918499,0.000025604833,0.00017453787,0.00033746503,0.0010157936,0.00007090103,0.000018454608],"category_scores_gemma":[0.000028548542,0.000081717415,0.00011833092,0.0001815485,0.000046777197,0.00030139182,0.000040051953,0.00010879784,0.000031962205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003879821,0.000037558137,0.000017222806,4.953917e-7,0.000029895837,9.559643e-7,0.00010812105,0.2626487,9.75788e-7,0.08410977,0.035842452,0.617165],"study_design_scores_gemma":[0.0016502257,0.00016371165,0.00006194279,0.0000021776393,0.000016979619,0.000005089743,0.00006040356,0.93975383,9.878356e-7,0.00035815765,0.05780204,0.00012444929],"about_ca_topic_score_codex":0.000008296822,"about_ca_topic_score_gemma":0.000050287996,"teacher_disagreement_score":0.98888385,"about_ca_system_score_codex":0.00001930048,"about_ca_system_score_gemma":0.00006988542,"threshold_uncertainty_score":0.33323395},"labels":[],"label_agreement":null},{"id":"W1577624117","doi":"10.1109/ictel.2003.1191570","title":"Virtual socket architecture for Internet access using Mobitex","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer network; Computer science; Internet layer; The Internet; Wireless network; Wi-Fi array; Wireless WAN; Internet Protocol; Municipal wireless network; Protocol stack; Wireless distribution system; Wireless Transport Layer Security; Wireless; Internet access; Telecommunications; Wireless sensor network; Operating system","score_opus":0.028944769783413298,"score_gpt":0.27815701075964205,"score_spread":0.24921224097622877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1577624117","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011053645,0.000052111165,0.98504657,0.00038588262,0.00048487596,0.00020929809,9.834067e-7,0.00015639188,0.0026102741],"genre_scores_gemma":[0.9505569,0.0000012202967,0.045695357,0.0013620509,0.00009725524,0.000022462042,0.0000010022505,0.000008127078,0.0022556416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999168,0.000048266917,0.00014097802,0.00028465237,0.00011137153,0.0002467361],"domain_scores_gemma":[0.9994676,0.00012904794,0.00004348607,0.00023015216,0.000053200518,0.00007652607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001583219,0.00011173352,0.00011917306,0.000053589953,0.0000674097,0.00024157102,0.0006318877,0.00005179347,0.0000626134],"category_scores_gemma":[0.00002964517,0.00009203487,0.00007170407,0.0001583049,0.000023439561,0.0002467367,0.00007918536,0.00008678864,0.000011121774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012019144,0.000038022565,0.000118378004,0.000004180838,0.00002739313,0.0000027367503,0.00021240466,0.011541488,0.00010966179,0.56903404,0.0064348383,0.41246486],"study_design_scores_gemma":[0.0008362824,0.000106297295,0.000038592527,0.000013607102,0.000010170919,0.00002959414,0.000020498059,0.9270876,0.00103781,0.0074690063,0.063099705,0.0002508242],"about_ca_topic_score_codex":0.000006263145,"about_ca_topic_score_gemma":0.00001537287,"teacher_disagreement_score":0.93950325,"about_ca_system_score_codex":0.000018472192,"about_ca_system_score_gemma":0.000062169616,"threshold_uncertainty_score":0.3753073},"labels":[],"label_agreement":null},{"id":"W1579179571","doi":"10.1109/pimrc.2005.1651737","title":"On Designing a Burst-Sensitive RED Queue at GPRS Links in a Heterogeneous Mobile Environment","year":2006,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"General Packet Radio Service; Active queue management; Computer science; Computer network; Queueing theory; Queue; Context (archaeology); GPRS core network; Queue management system; Priority queue; Real-time computing; Wireless; Network packet; Telecommunications; Network congestion","score_opus":0.005868842225005952,"score_gpt":0.18723625126237786,"score_spread":0.18136740903737192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1579179571","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19509068,0.00016146262,0.79913133,0.00070321915,0.00014104454,0.00049248716,0.0000016360776,0.00021567388,0.0040624905],"genre_scores_gemma":[0.9893605,0.000011046932,0.0080895405,0.00074582954,0.00006202101,0.000084748244,0.0000031234722,0.0000094748375,0.0016336843],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986175,0.00015779397,0.00022258425,0.00044617255,0.00020586113,0.00035009824],"domain_scores_gemma":[0.9992721,0.00026663477,0.000056393634,0.00032623895,0.0000130830795,0.00006555101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002550249,0.00015448395,0.00016365197,0.00007722526,0.00008840719,0.000049410264,0.00023180524,0.00013964872,0.000047998336],"category_scores_gemma":[0.000006368992,0.00014190328,0.0000608913,0.00012998059,0.000025304838,0.000077006654,0.00010707678,0.00021199496,0.00018343267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011075562,0.00042384607,0.00037615348,0.0000039515367,0.000026533087,0.000559893,0.00045787165,0.809758,0.0020109615,0.023618916,0.002279133,0.16037399],"study_design_scores_gemma":[0.0016537261,0.00043125154,0.0007905012,0.00003904328,0.0000073968267,0.00005252508,0.000031594896,0.98499537,0.005427537,0.001703692,0.0044536744,0.00041371974],"about_ca_topic_score_codex":0.000048414848,"about_ca_topic_score_gemma":0.00011812814,"teacher_disagreement_score":0.79426986,"about_ca_system_score_codex":0.00021772737,"about_ca_system_score_gemma":0.00002159598,"threshold_uncertainty_score":0.5786648},"labels":[],"label_agreement":null},{"id":"W1581750636","doi":"10.1007/11422778_18","title":"Queue Analysis for Wireless Packet Data Traffic","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Queue; Network packet; Wireless; Telecommunications","score_opus":0.027092587922567874,"score_gpt":0.25898707987688974,"score_spread":0.23189449195432185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581750636","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013169028,0.00072639674,0.99450105,0.0019131405,0.0012681715,0.0005813424,0.000059056034,0.00027754833,0.00054159726],"genre_scores_gemma":[0.65433097,0.000095759184,0.33989742,0.0024624255,0.0021900148,0.00003737227,0.00012051736,0.000057656558,0.00080787425],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99468,0.00005448819,0.00066868996,0.0025877736,0.0011661222,0.00084291364],"domain_scores_gemma":[0.99445164,0.000874732,0.0003593279,0.0036662926,0.0004012009,0.00024677505],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0019494629,0.000611428,0.000891019,0.0010938387,0.00031087545,0.000749828,0.008270193,0.00037945237,0.000030159377],"category_scores_gemma":[0.00006867949,0.00056578504,0.00028322465,0.0013726727,0.00049733085,0.00082097074,0.0014051235,0.00063004956,0.000031668194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050580184,0.000021353922,0.000010149104,0.000008330107,0.00008855446,0.000010436821,0.000086212836,0.2638254,0.0000016067665,0.01126705,0.000095970914,0.7245799],"study_design_scores_gemma":[0.00044097088,0.00007358343,0.00003454688,0.00008478477,0.00018666316,0.000015208378,8.886075e-8,0.98307437,0.000013276177,0.0069642495,0.008466444,0.00064580183],"about_ca_topic_score_codex":0.000007980785,"about_ca_topic_score_gemma":0.00069855485,"teacher_disagreement_score":0.72393405,"about_ca_system_score_codex":0.00023232131,"about_ca_system_score_gemma":0.0008406485,"threshold_uncertainty_score":0.9996794},"labels":[],"label_agreement":null},{"id":"W1583828021","doi":"10.1007/3-540-45415-2_12","title":"A Methodology and Implementation for Analytic Modeling in Electronic Commerce Applications","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); Western University","funders":"","keywords":"Computer science; Queueing theory; Range (aeronautics); Industrial engineering; Data science","score_opus":0.05011165933830061,"score_gpt":0.32376789374088366,"score_spread":0.273656234402583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1583828021","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010649943,0.0008419959,0.9963668,0.0013223802,0.00016318286,0.00092606747,0.0000023696957,0.00006432025,0.00020637059],"genre_scores_gemma":[0.49578953,0.00032335837,0.50110406,0.0020442482,0.00035247806,0.00025536367,0.000015189526,0.000029918543,0.000085835534],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976286,0.00005451517,0.0004420102,0.0010271204,0.0002523392,0.0005953914],"domain_scores_gemma":[0.998281,0.0008104805,0.00015628422,0.0005372513,0.0001313485,0.000083662046],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012980202,0.00027965667,0.0004055235,0.0006137653,0.00016553086,0.00017779092,0.0010673987,0.00017170468,0.000005482241],"category_scores_gemma":[0.00002229809,0.0002839848,0.00006518351,0.00048204252,0.00016286799,0.00025724946,0.00026883997,0.0004336965,0.0000024497176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043861273,0.000007193368,0.000025870952,0.000009899825,0.000006148782,0.000001866453,0.00014379271,0.095040925,0.000007843923,0.11619192,0.0000025585512,0.7885576],"study_design_scores_gemma":[0.000373717,0.000079947225,0.000011502901,0.00003378423,0.000009790029,0.000022397091,4.968537e-7,0.7853033,0.0000059490712,0.21278447,0.0011552055,0.00021946774],"about_ca_topic_score_codex":0.000039559356,"about_ca_topic_score_gemma":0.0009082617,"teacher_disagreement_score":0.7883381,"about_ca_system_score_codex":0.00024420887,"about_ca_system_score_gemma":0.00038994823,"threshold_uncertainty_score":0.99996126},"labels":[],"label_agreement":null},{"id":"W1584331198","doi":"10.1109/ictel.2003.1191512","title":"Layered multicast with TCP-friendly congestion control using active networks","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Multicast; Computer network; Computer science; Network congestion; Protocol Independent Multicast; Source-specific multicast; Xcast; Reliable multicast; Distributed computing; Pragmatic General Multicast; TCP Friendly Rate Control; Distance Vector Multicast Routing Protocol","score_opus":0.009372437009437072,"score_gpt":0.21373309691175124,"score_spread":0.20436065990231417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1584331198","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019997317,0.00008853373,0.9752114,0.00026676725,0.00033835435,0.00034770637,0.0000011907895,0.00028465848,0.0034640646],"genre_scores_gemma":[0.9729397,0.000004519796,0.026203007,0.0005298094,0.00008714824,0.000024107687,6.7549917e-7,0.000014459933,0.00019651736],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842614,0.0001926474,0.000223571,0.00046014632,0.00024483702,0.0004526412],"domain_scores_gemma":[0.99887687,0.00022358932,0.00011871171,0.00041874303,0.0001799888,0.0001821195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000231384,0.00021890277,0.00025536193,0.00006127127,0.00020317642,0.00015064089,0.00032141493,0.000100169476,0.00006000008],"category_scores_gemma":[0.0000400692,0.00017134761,0.000055672306,0.00036031828,0.000079253674,0.00048755977,0.000025423296,0.00020257193,0.000023870782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019256484,0.00017276409,0.0019563977,0.000004100046,0.00015153896,0.000067791,0.00015261152,0.4848373,0.00016004492,0.2655616,0.0003081994,0.24643506],"study_design_scores_gemma":[0.0026565967,0.00016858298,0.00092116086,0.000020535603,0.000029671453,0.000077609664,0.00005742765,0.9941175,0.000112327005,0.00010403233,0.0014568629,0.0002777052],"about_ca_topic_score_codex":0.000021215374,"about_ca_topic_score_gemma":0.000044510052,"teacher_disagreement_score":0.95294243,"about_ca_system_score_codex":0.000058444995,"about_ca_system_score_gemma":0.0001033783,"threshold_uncertainty_score":0.6987353},"labels":[],"label_agreement":null},{"id":"W1585963846","doi":"10.1109/ccece.2001.933768","title":"Non-Gaussian characteristic and FARIMA(p,d,q) traffic models","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Gaussian; Range (aeronautics); Computer science; Gaussian network model; Traffic generation model; Probability density function; Traffic model; Function (biology); Algorithm; Real-time computing; Mathematics; Engineering; Statistics; Physics; Computer network","score_opus":0.015633980911517194,"score_gpt":0.18971245802794404,"score_spread":0.17407847711642685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1585963846","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049796104,0.0003987962,0.9164903,0.0046803965,0.00036509344,0.0002082864,0.0000011507329,0.0004877676,0.027572108],"genre_scores_gemma":[0.99202764,0.000074164,0.003949101,0.00094339164,0.000081551654,0.000013191827,6.2208363e-7,0.000006672076,0.0029036917],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910927,0.00001895238,0.00015946687,0.00032822453,0.00013292872,0.00025116312],"domain_scores_gemma":[0.9994555,0.000040519193,0.00003754126,0.00030573792,0.00002531087,0.00013538408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008206873,0.00012676547,0.00014653499,0.00005263788,0.00010980315,0.00017823327,0.00033640643,0.000051392133,0.000110613924],"category_scores_gemma":[0.0000032482146,0.00010743176,0.000034360393,0.00014917247,0.000037234833,0.00044500185,0.00006508496,0.0001025361,0.00013983616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019903628,0.000048593716,0.000017755408,0.0000045693428,0.000010744165,0.000016570584,0.0003657248,0.0014391843,0.000020008023,0.05813083,0.0020380942,0.9379059],"study_design_scores_gemma":[0.00032452113,0.000042053864,0.0004906146,0.0000069960697,0.000005106414,0.000026555635,0.0000072669195,0.9964318,0.0000032674022,0.00044484154,0.0020691245,0.00014780156],"about_ca_topic_score_codex":0.0000026992657,"about_ca_topic_score_gemma":0.0000034013465,"teacher_disagreement_score":0.9949927,"about_ca_system_score_codex":0.000009794949,"about_ca_system_score_gemma":0.000008940988,"threshold_uncertainty_score":0.43809402},"labels":[],"label_agreement":null},{"id":"W1587465133","doi":"","title":"Tradeoffs of Implementing TCP Fairness Schemes.","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Bandwidth (computing); Computer network; Distributed computing; Bandwidth allocation; Set (abstract data type)","score_opus":0.009817894415819916,"score_gpt":0.21961696200557962,"score_spread":0.2097990675897597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1587465133","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010662785,0.00013064194,0.9394592,0.00036619924,0.00015234874,0.000079524674,2.630196e-7,0.00011823329,0.0490308],"genre_scores_gemma":[0.9756236,0.0000038689063,0.023101354,0.00017839769,0.000020610503,0.0000058039423,2.8717835e-7,0.0000032878538,0.0010627797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991997,0.00004003448,0.00020140727,0.0001797069,0.00015012783,0.00022902714],"domain_scores_gemma":[0.999529,0.00005290099,0.00006197109,0.0002566789,0.000048917693,0.000050520175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029108566,0.000071178634,0.00011204606,0.00003658666,0.000053240172,0.000034289693,0.0003186866,0.000025450458,0.00017429066],"category_scores_gemma":[0.000017418188,0.000061919774,0.000050980907,0.00023095668,0.000018740473,0.00016661324,0.00003851134,0.000051031955,0.000017515242],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.583242e-7,0.0000199281,0.0005478692,0.0000032406847,0.000009255975,0.0000011585847,0.00004949521,0.000025310386,0.00018958944,0.7977785,0.0009062977,0.20046881],"study_design_scores_gemma":[0.0034593833,0.00016475137,0.0015915856,0.000043921762,0.000030691208,0.00004371373,0.00036071026,0.28543258,0.036837615,0.012514957,0.658722,0.0007981229],"about_ca_topic_score_codex":0.0000036358492,"about_ca_topic_score_gemma":0.0000042438724,"teacher_disagreement_score":0.9649608,"about_ca_system_score_codex":0.000006631176,"about_ca_system_score_gemma":0.00004959255,"threshold_uncertainty_score":0.25250152},"labels":[],"label_agreement":null},{"id":"W1588666206","doi":"10.1007/11600930_22","title":"A Delay Pricing Scheme for Real-Time Delivery in Deadline-Based Networks","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Scheme (mathematics); Real-time computing; Control (management); Computer network; Mathematical optimization; Distributed computing; Operations research; Artificial intelligence","score_opus":0.01042588080052049,"score_gpt":0.22309381725762623,"score_spread":0.21266793645710574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588666206","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029899032,0.00061259174,0.99559313,0.00088477693,0.0008788099,0.00087563595,0.0000033946208,0.00026540132,0.0005872765],"genre_scores_gemma":[0.19246228,0.00008452377,0.8019339,0.0033941013,0.0016323313,0.00007396868,0.000016177582,0.00006946301,0.00033327483],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957367,0.000049314207,0.00077361695,0.0017125777,0.00068511337,0.0010426553],"domain_scores_gemma":[0.99666643,0.0013717706,0.00034415285,0.0011254995,0.00028154533,0.00021060662],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012737277,0.0006293547,0.0007253879,0.0008489251,0.00022891769,0.0004079934,0.0027455466,0.0004896756,0.000016938962],"category_scores_gemma":[0.00006225249,0.00061396026,0.00021152501,0.0007689198,0.00032012025,0.00047400966,0.00047033047,0.0008120672,0.000024643721],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018594801,0.00002156153,0.000026100442,0.000010824549,0.000005798173,0.000035971025,0.000053152096,0.49161223,0.00002369753,0.0036783875,0.000033141056,0.50448054],"study_design_scores_gemma":[0.0009117002,0.00015602929,0.000040344697,0.000481967,0.000009586994,0.00002057511,4.4974847e-8,0.99160683,0.000038336435,0.004695007,0.0013801634,0.0006594399],"about_ca_topic_score_codex":0.00002340546,"about_ca_topic_score_gemma":0.00022433352,"teacher_disagreement_score":0.50382113,"about_ca_system_score_codex":0.00046599619,"about_ca_system_score_gemma":0.00089939573,"threshold_uncertainty_score":0.99963117},"labels":[],"label_agreement":null},{"id":"W1588675223","doi":"10.1109/hicss.1998.649244","title":"Traffic characterization for QoS provisioning in high-speed networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Autocorrelation; Queueing theory; Queue; Computer science; Quality of service; Provisioning; Traffic generation model; Bandwidth (computing); Gaussian; Representation (politics); Traffic model; Range (aeronautics); Distributed computing; Computer network; Mathematics; Statistics; Engineering","score_opus":0.012385595511506562,"score_gpt":0.1994349457983873,"score_spread":0.18704935028688074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588675223","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059368007,0.000058978505,0.9369981,0.0019238179,0.0006437169,0.00045223368,5.855021e-7,0.00026560045,0.00028894513],"genre_scores_gemma":[0.9916681,0.000021423808,0.0058658426,0.000577028,0.00030634945,0.000046591216,0.00001023011,0.000008758933,0.0014956505],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990412,0.000035007357,0.00023373186,0.00030259896,0.000109455235,0.00027798928],"domain_scores_gemma":[0.9995171,0.000103196966,0.00006306118,0.0002159458,0.00004235874,0.000058326816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016905382,0.000107332846,0.00014215733,0.00008156427,0.00008225132,0.00013679257,0.0003246384,0.00006974522,0.00006033848],"category_scores_gemma":[0.000015597027,0.000096633514,0.000040892453,0.00033105238,0.000011915693,0.00038122846,0.000032277097,0.000086340864,0.000030002206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070474052,0.00006114544,0.00009623921,0.000003145667,0.0000043705895,0.0000024992905,0.00012457707,0.060858108,0.00012187472,0.022518622,0.00089461403,0.91530776],"study_design_scores_gemma":[0.0008151169,0.000051029943,0.0014316629,0.000015527623,0.0000022791728,0.0000020209775,0.0000038820313,0.9945138,0.0000105944355,0.000027017888,0.0029997176,0.00012734694],"about_ca_topic_score_codex":0.0000017819397,"about_ca_topic_score_gemma":0.000008649433,"teacher_disagreement_score":0.9336557,"about_ca_system_score_codex":0.000023927283,"about_ca_system_score_gemma":0.000008764673,"threshold_uncertainty_score":0.39406005},"labels":[],"label_agreement":null},{"id":"W1597310552","doi":"10.1109/icccn.2002.1043118","title":"QoS negotiations and real-time renegotiations for multimedia communications","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Resource Reservation Protocol; Computer network; Quality of service; The Internet; Reservation; Bandwidth (computing); Network packet; Voice over IP; Protocol (science); Bidding; Multimedia; Flexibility (engineering); IP Multimedia Subsystem; Internet Protocol; World Wide Web","score_opus":0.015814603437934057,"score_gpt":0.2473711741420007,"score_spread":0.23155657070406663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1597310552","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043760063,0.00016711617,0.9729285,0.0054518064,0.00019637162,0.00043756925,0.0000068118457,0.00031322392,0.020060994],"genre_scores_gemma":[0.35718718,0.00021273624,0.6376578,0.000486622,0.00006804251,0.00022826927,0.00002025849,0.000010777591,0.004128258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992439,0.00008394073,0.00019075251,0.0002192395,0.00008186987,0.00018027265],"domain_scores_gemma":[0.99820876,0.00072841987,0.000059516937,0.0007700099,0.00012970685,0.000103577266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021293099,0.00009055684,0.00010909768,0.000058544985,0.00035362333,0.00010654317,0.00044193363,0.000048150614,0.000037868558],"category_scores_gemma":[0.00014008323,0.0000870903,0.000042878655,0.00021509998,0.0000582251,0.00026615104,0.00006415687,0.000052257572,0.000053096606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013741202,0.00007465726,0.00024709452,0.0000024437652,0.000024833878,1.6704814e-7,0.00033596143,0.00011110401,0.00042777447,0.9190269,0.010185771,0.06956188],"study_design_scores_gemma":[0.0009872216,0.00005057429,0.0012599342,0.0000073415117,0.000027422413,0.000007929585,0.000051373045,0.92445743,0.00011373131,0.006528769,0.066277646,0.00023063949],"about_ca_topic_score_codex":0.000014606195,"about_ca_topic_score_gemma":0.000050377548,"teacher_disagreement_score":0.9243463,"about_ca_system_score_codex":0.00001605205,"about_ca_system_score_gemma":0.00008078203,"threshold_uncertainty_score":0.35514396},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.024087018421932994,"score_gpt":0.21644807100765798,"score_spread":0.19236105258572497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1598519330","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38144517,0.00011580864,0.6176028,0.00026422596,0.000104778934,0.000059365902,5.864571e-7,0.00019386751,0.00021336325],"genre_scores_gemma":[0.96561396,0.000022128987,0.03403489,0.00018892609,0.000099437624,0.0000045214615,9.252526e-7,0.0000062186223,0.000028978564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914217,0.000017939192,0.00014633693,0.00030198894,0.00018730806,0.00020427635],"domain_scores_gemma":[0.9996391,0.000015430433,0.00002616269,0.00016265798,0.00005463205,0.00010200796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012480383,0.00010471741,0.00010645345,0.00004459242,0.00014718337,0.0001333646,0.00018057968,0.0000562168,0.0000023743678],"category_scores_gemma":[0.0000016872225,0.00009697135,0.000032489013,0.00014007698,0.000022760145,0.00066492206,0.00005334005,0.00009567691,0.0000028532138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003600277,0.000016875954,0.0000060912353,0.0000020038597,0.0000064114406,0.0000022516313,0.00010867427,0.8141987,0.00003839397,0.07655602,0.000004675029,0.10905636],"study_design_scores_gemma":[0.0005856443,0.000022825536,0.000008600418,0.000020603722,0.000007891895,0.000036759055,0.000020495661,0.9938098,0.000009964856,0.005366536,0.000007181048,0.00010365267],"about_ca_topic_score_codex":0.000016932818,"about_ca_topic_score_gemma":0.000008659206,"teacher_disagreement_score":0.5841688,"about_ca_system_score_codex":0.000043932785,"about_ca_system_score_gemma":0.000097502605,"threshold_uncertainty_score":0.3954377},"labels":[],"label_agreement":null},{"id":"W1598886122","doi":"10.1007/978-3-540-40012-7_15","title":"Performance Evaluation of the Preemptive Bandwidth Allocation Protocol","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Bandwidth (computing); Quality of service; Distributed computing; Bandwidth allocation; Dynamic bandwidth allocation; Protocol (science)","score_opus":0.020606869172635763,"score_gpt":0.25865110612478387,"score_spread":0.2380442369521481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1598886122","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001890388,0.000049030918,0.97326595,0.0005258281,0.0008968189,0.020914592,9.726697e-7,0.000046201447,0.0041115903],"genre_scores_gemma":[0.9291982,0.000008015548,0.060190517,0.0013090485,0.00037931002,0.008435078,0.000001601139,0.000033550914,0.0004446963],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99658513,0.00012801863,0.0004574164,0.0008171493,0.0016851902,0.0003270913],"domain_scores_gemma":[0.99728,0.0001815068,0.00045835262,0.0012020859,0.00081581046,0.000062235194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021743837,0.00030833768,0.00029145216,0.00023221299,0.00020488299,0.0001310397,0.002228385,0.00019097605,0.000021729491],"category_scores_gemma":[0.00009120086,0.00022103325,0.00009916476,0.0005457142,0.0004730784,0.00042336318,0.00036033534,0.00044229985,0.000009308286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000530429,0.00001856844,0.00009101617,0.000018240498,0.0000068638897,4.2090346e-7,0.00017525912,0.14698103,0.000020915306,0.007743981,0.000021055663,0.84491736],"study_design_scores_gemma":[0.000539815,0.00011609251,0.0006646143,0.0003504226,0.000017145927,0.000008833258,5.1102344e-8,0.98366725,0.0009368492,0.012383506,0.001054746,0.0002606764],"about_ca_topic_score_codex":0.0000031707389,"about_ca_topic_score_gemma":0.000018847035,"teacher_disagreement_score":0.92900914,"about_ca_system_score_codex":0.00027596697,"about_ca_system_score_gemma":0.0010458201,"threshold_uncertainty_score":0.90134746},"labels":[],"label_agreement":null},{"id":"W1599569409","doi":"10.1109/glocom.2000.891936","title":"On the overlay network design problem for the S-PVC connections in ATM networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Overlay; Tabu search; Computer science; Overlay network; Network planning and design; Private Network-to-Network Interface; Computer network; Reliability (semiconductor); Routing (electronic design automation); Distributed computing; Mathematical optimization; Routing protocol; Algorithm; Link-state routing protocol; Mathematics; The Internet","score_opus":0.03202811432818006,"score_gpt":0.21172178158282895,"score_spread":0.1796936672546489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599569409","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000033744684,0.0005865494,0.9672271,0.02656536,0.00055594015,0.0010615824,2.962755e-7,0.00016080533,0.0038086008],"genre_scores_gemma":[0.97421783,0.00011514506,0.013274987,0.0073686643,0.00056078186,0.00071458163,4.085354e-7,0.000014126809,0.003733458],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873316,0.00017876935,0.00021802103,0.0002945059,0.00014670998,0.0004288098],"domain_scores_gemma":[0.99446267,0.0048700348,0.00006472687,0.00051166775,0.00004321158,0.000047685666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008115682,0.00014306438,0.00012682404,0.000022957642,0.00048659727,0.00019554548,0.00076841324,0.00006635372,0.00015194142],"category_scores_gemma":[0.000045071487,0.00007413845,0.00008641322,0.0005236898,0.00004862279,0.00011984598,0.00005576032,0.00022653233,0.000049176313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005897824,0.000020398535,0.000010942723,3.0639487e-7,0.000011007382,5.489599e-7,0.000042040367,0.46769482,1.3123275e-7,0.3624377,0.10880821,0.060968004],"study_design_scores_gemma":[0.00037647365,0.00010458231,0.00008847575,0.000015404024,0.000007520238,0.0000038175626,0.000013650398,0.96350855,9.764497e-7,0.00900723,0.026764568,0.00010872664],"about_ca_topic_score_codex":0.000010555515,"about_ca_topic_score_gemma":0.000088382694,"teacher_disagreement_score":0.9741841,"about_ca_system_score_codex":0.000030102508,"about_ca_system_score_gemma":0.000016172751,"threshold_uncertainty_score":0.3742562},"labels":[],"label_agreement":null},{"id":"W1601761571","doi":"10.1109/glocom.2002.1188436","title":"QoS support in the UMTS/GPRS backbone network using DiffServ","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer network; Quality of service; Computer science; UMTS frequency bands; Router; Mobile QoS; Differentiated services; General Packet Radio Service; Distributed computing; Service (business); Service provider; Telecommunications","score_opus":0.019371911342073722,"score_gpt":0.23473291154581322,"score_spread":0.2153610002037395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601761571","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05785688,0.00015732601,0.9258159,0.007494839,0.00090170075,0.0002902003,2.9465073e-7,0.00018200338,0.007300849],"genre_scores_gemma":[0.97697324,0.000012449551,0.017684665,0.0045839367,0.00048179677,0.00001121804,0.0000010862373,0.0000061933056,0.00024541278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880016,0.00007262526,0.00022727702,0.0002687444,0.00024585484,0.00038536426],"domain_scores_gemma":[0.99932426,0.00008466471,0.000048894817,0.0004543174,0.000028596878,0.000059256763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046684407,0.00012142798,0.00013541571,0.000036801037,0.0001284331,0.00013863746,0.00080176204,0.000052362342,0.000050692863],"category_scores_gemma":[0.0000072005805,0.00008184546,0.000058838723,0.000551615,0.000034529145,0.00025460092,0.0000922951,0.0001637779,0.00008282971],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012786238,0.0001823631,0.0019845006,0.0000049470377,0.000019879602,0.00014289816,0.0009646938,0.30895284,0.000037434038,0.53236717,0.006701921,0.14862856],"study_design_scores_gemma":[0.0045222943,0.00028946163,0.018019607,0.00009938723,0.00002682803,0.00028866268,0.0003347805,0.9002847,0.000048700294,0.0317337,0.043414563,0.0009373051],"about_ca_topic_score_codex":0.000068527464,"about_ca_topic_score_gemma":0.00018071414,"teacher_disagreement_score":0.9191164,"about_ca_system_score_codex":0.00004097516,"about_ca_system_score_gemma":0.00010305323,"threshold_uncertainty_score":0.3337561},"labels":[],"label_agreement":null},{"id":"W1603075230","doi":"10.1002/0471219282.eot202","title":"Transmission Control Protocol","year":2003,"lang":"en","type":"other","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Transmission Control Protocol; Computer network; Computer science; Transport layer; TCP tuning; Zeta-TCP; TCP acceleration; Telnet; TCP Friendly Rate Control; TCP global synchronization; Compound TCP; File transfer; Internet protocol suite; Port Control Protocol; The Internet; User Datagram Protocol; File Transfer Protocol; Operating system; Transfer (computing); Network packet; Chemistry; Layer (electronics)","score_opus":0.006119289698464884,"score_gpt":0.22942571359496022,"score_spread":0.22330642389649533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1603075230","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.2416998e-10,0.00003914641,0.4932249,0.00024991695,0.000107301275,0.025993401,5.6729004e-7,0.00050130195,0.47988346],"genre_scores_gemma":[0.000009228587,0.0000038363537,0.017878093,0.0011475338,0.00017263198,0.057587422,7.4447354e-7,0.00012308682,0.9230774],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988534,0.000090060894,0.00017158336,0.00040859138,0.00022648553,0.0002499029],"domain_scores_gemma":[0.9992324,0.00002643854,0.000099620636,0.0004942429,0.000020683761,0.00012659754],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00010841214,0.0002320659,0.00026046607,0.000102823375,0.000033749744,0.00007909204,0.0006156184,0.00023659276,0.005181249],"category_scores_gemma":[0.0000027874976,0.00017380051,0.00009741892,0.00013984264,0.000021457068,0.00004969129,0.000014022857,0.00015473826,0.0005368005],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025372003,0.000022087257,8.900058e-7,0.000012269554,0.000015339203,0.0000053623885,0.0000025048073,0.0000054329403,0.0000011529744,0.025617156,0.6343284,0.33998686],"study_design_scores_gemma":[0.0014839388,0.000039279465,6.2222597e-7,0.000061945095,0.0000068422596,0.0000052128516,3.3095048e-7,0.01587355,0.000003753368,0.00017963056,0.9821206,0.00022432108],"about_ca_topic_score_codex":0.000007695119,"about_ca_topic_score_gemma":0.0000047633685,"teacher_disagreement_score":0.4753468,"about_ca_system_score_codex":0.000011983395,"about_ca_system_score_gemma":0.00009918977,"threshold_uncertainty_score":0.99572814},"labels":[],"label_agreement":null},{"id":"W1605501885","doi":"10.1007/978-0-387-35620-4_17","title":"Performance of a Multi-Tiered Policy-Based Management System","year":2003,"lang":"en","type":"book-chapter","venue":"IFIP advances in information and communication technology","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Lightweight Directory Access Protocol; Computer network; Scalability; Directory service; Network management; Quality of service; Distributed computing; Directory; Operating system","score_opus":0.006650728243226817,"score_gpt":0.22225220903459827,"score_spread":0.21560148079137145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1605501885","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015683538,0.024498543,0.4485059,0.0028466452,0.0003370277,0.0015800502,0.000017436707,0.0009148305,0.5211427],"genre_scores_gemma":[0.7450448,0.06686148,0.17649454,0.0012465066,0.000018365414,0.0005067974,0.00009666755,0.000035960526,0.009694833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987747,0.000029478673,0.0007044087,0.00016045163,0.00016931043,0.00016163128],"domain_scores_gemma":[0.99803853,0.000047364247,0.0006269691,0.0011034508,0.00015239014,0.00003127077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024111655,0.00019969216,0.00030509586,0.0010793301,0.00009735498,0.0000327609,0.0010313782,0.00028031474,0.0000037029345],"category_scores_gemma":[0.000011524991,0.00020860539,0.000039192506,0.00028164292,0.0002082272,0.00077029224,0.0002157555,0.00030130614,0.000018961886],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057180723,0.0000063584716,0.00001967537,0.00011882879,0.000006451249,2.0994682e-7,0.000030934716,0.000664379,1.01305496e-7,0.5441991,0.000012272941,0.45493594],"study_design_scores_gemma":[0.0019228632,0.00012349953,0.000031034917,0.00119851,0.000017941748,0.000020192783,0.00019529593,0.3677363,0.0000382567,0.0077903257,0.62049925,0.0004265233],"about_ca_topic_score_codex":0.0000018888917,"about_ca_topic_score_gemma":0.000007239412,"teacher_disagreement_score":0.744888,"about_ca_system_score_codex":0.000121524405,"about_ca_system_score_gemma":0.00006486815,"threshold_uncertainty_score":0.8506681},"labels":[],"label_agreement":null},{"id":"W1606159294","doi":"10.1023/a:1011319226517","title":"On the Design of Link-State Routing Protocol for Connection-Oriented Networks","year":2001,"lang":"en","type":"article","venue":"Journal of Network and Systems Management","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Computer network; Link-state routing protocol; Zone Routing Protocol; Static routing; Routing protocol; Distributed computing; Dynamic Source Routing; Enhanced Interior Gateway Routing Protocol; Policy-based routing; Wireless Routing Protocol; Multipath routing; Routing (electronic design automation)","score_opus":0.029510284028443686,"score_gpt":0.25715357872969247,"score_spread":0.22764329470124878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606159294","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018665096,0.00010311997,0.97321814,0.00070772925,0.00077507924,0.02461805,1.5034156e-7,0.000019819845,0.00037126636],"genre_scores_gemma":[0.9684566,0.00012248203,0.0066489903,0.0005850787,0.0020635594,0.020898769,3.8008423e-7,0.000024093757,0.0012000015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836856,0.00026001205,0.0006775531,0.00015878891,0.00027187204,0.00026318396],"domain_scores_gemma":[0.9979973,0.0006988072,0.00078149897,0.00022253489,0.0002310518,0.00006882058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023973458,0.00013428846,0.00027827846,0.00006492241,0.00020725679,0.00013171649,0.00035104042,0.00003810747,0.0000021459607],"category_scores_gemma":[0.000023973193,0.000082691426,0.000091976915,0.00029284545,0.000025045501,0.00011904232,0.000056611607,0.00014188621,6.3504064e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023470409,0.00003349671,0.00010132098,0.000030800522,0.00014520674,0.000016314321,0.000059714195,0.8100699,5.229649e-7,0.11535116,0.010319203,0.06363762],"study_design_scores_gemma":[0.0013901398,0.00052942254,0.00013096159,0.00047606995,0.00002572466,0.00003987718,0.00006612113,0.9668305,4.783502e-7,0.0013726703,0.029047728,0.000090293026],"about_ca_topic_score_codex":0.0000016238658,"about_ca_topic_score_gemma":6.374247e-7,"teacher_disagreement_score":0.96827,"about_ca_system_score_codex":0.000028025548,"about_ca_system_score_gemma":0.000018542172,"threshold_uncertainty_score":0.33720583},"labels":[],"label_agreement":null},{"id":"W1606362855","doi":"10.1023/a:1011280023547","title":"Capacity and flow assignment of data networks by generalized Benders decomposition","year":2001,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Mathematics; Decomposition; Mathematical optimization; Flow network; Network topology; Benders' decomposition; Multi-commodity flow problem; Decomposition method (queueing theory); Flow (mathematics); Integer (computer science); Regular polygon; Measure (data warehouse); Function (biology); Integer programming; Quality of service; Computer science; Discrete mathematics; Computer network","score_opus":0.01915627088536034,"score_gpt":0.2574983124426431,"score_spread":0.23834204155728275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606362855","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054888357,0.00078020606,0.9921173,0.0011541026,0.00026533278,0.00006509959,0.000008370043,0.000012660053,0.00010808031],"genre_scores_gemma":[0.73690605,0.0007357566,0.26203668,0.00019833914,0.00009852202,4.872562e-7,0.000016029557,0.0000028061954,0.000005305678],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990258,0.0000974412,0.00036690012,0.00014304904,0.00024826048,0.00011851002],"domain_scores_gemma":[0.9991141,0.000031626463,0.0003885447,0.00021037838,0.00016202548,0.00009334158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003446168,0.00008428564,0.00017555556,0.000024156432,0.000054621494,0.000072278766,0.00040613452,0.00005663853,0.000009892291],"category_scores_gemma":[0.000014073855,0.000075112126,0.000033453038,0.00021279191,0.000029398134,0.00080599496,0.00007621456,0.00007161966,2.0406729e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041610172,0.000050349376,0.0006815026,0.0000015525118,0.000035790858,0.000003681235,0.0000117173895,0.9040798,0.000016235083,0.0008412576,0.0038456495,0.09039086],"study_design_scores_gemma":[0.00090774347,0.0000999723,0.0002971963,0.000022651311,0.000031550586,0.00010375415,0.0000053481517,0.99790645,0.000005161632,0.00014476197,0.00040766684,0.00006777129],"about_ca_topic_score_codex":0.0000065373165,"about_ca_topic_score_gemma":0.0000037200507,"teacher_disagreement_score":0.73141724,"about_ca_system_score_codex":0.00006921168,"about_ca_system_score_gemma":0.000039609535,"threshold_uncertainty_score":0.30629835},"labels":[],"label_agreement":null},{"id":"W1606800778","doi":"10.48550/arxiv.1101.1237","title":"Statistical Analysis of Link Scheduling on Long Paths","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Burstiness; Network calculus; Computer science; Scheduling (production processes); Network packet; Upper and lower bounds; Key (lock); Mathematical optimization; Computer network; Distributed computing; Quality of service; Mathematics","score_opus":0.06254985274719062,"score_gpt":0.19135901262599683,"score_spread":0.1288091598788062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606800778","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.124846086,0.000043507367,0.8723248,0.000035196677,0.0003219712,0.00011924965,0.000020000101,0.0001256256,0.0021635485],"genre_scores_gemma":[0.99509645,0.00007593678,0.004278178,0.00007302245,0.00006406429,6.2211996e-7,0.000021836551,0.000009282446,0.00038058983],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983001,0.00016096428,0.0002539741,0.00089787104,0.000114581206,0.00027255187],"domain_scores_gemma":[0.9980048,0.00027977023,0.00028742204,0.0010834802,0.00017916184,0.00016538535],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025487674,0.00024157212,0.00052020117,0.00049837143,0.00007372154,0.000048197522,0.0012830332,0.00024330497,0.00008704857],"category_scores_gemma":[0.00003776943,0.00026731082,0.0003091894,0.0009753447,0.00010299854,0.00011061274,0.0006491107,0.0005084712,0.00004974818],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030394403,0.00006714831,0.003480569,0.000016092119,0.0006756941,0.00016287457,0.000068612266,0.5102809,0.0000011517932,0.47002608,0.000015143739,0.015175338],"study_design_scores_gemma":[0.0002637728,0.00007722432,0.0097955195,0.000056123667,0.0008674049,4.3184897e-7,0.000009905084,0.9795318,0.000010212484,0.009084623,0.000033303713,0.00026965217],"about_ca_topic_score_codex":0.00006295383,"about_ca_topic_score_gemma":0.00003848919,"teacher_disagreement_score":0.8702504,"about_ca_system_score_codex":0.00007015847,"about_ca_system_score_gemma":0.0001536021,"threshold_uncertainty_score":0.9999779},"labels":[],"label_agreement":null},{"id":"W1607231617","doi":"10.1109/milcom.2003.1290111","title":"Congestion control in TCP/IP networks: a combined ECN and BECN approach","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Explicit Congestion Notification; Internet Control Message Protocol; Computer network; Network congestion; Computer science; Active queue management; The Internet; Slow-start; Operating system; Network packet","score_opus":0.005018809083511183,"score_gpt":0.18176358417658833,"score_spread":0.17674477509307715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1607231617","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015925061,0.00047185444,0.9767023,0.003285058,0.00021716573,0.00042190903,4.8388716e-7,0.0002728588,0.002703309],"genre_scores_gemma":[0.98909533,0.000042136606,0.008803443,0.0017231627,0.00008736972,0.00006120864,0.0000029084833,0.000008394897,0.0001760647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867356,0.0000855576,0.00027223452,0.00044003106,0.00017027263,0.0003583738],"domain_scores_gemma":[0.9993119,0.00012215854,0.00006385729,0.00031078243,0.000052717467,0.00013856383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036742273,0.000175334,0.00025909444,0.00009578251,0.000084107385,0.00015729379,0.00035074787,0.000110884976,0.0000065887407],"category_scores_gemma":[0.000019523806,0.00015317451,0.00004055092,0.0003489882,0.00007056289,0.00034827727,0.00006654461,0.00020114005,0.000012925573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008263329,0.00025783014,0.0026033923,0.000008893834,0.00003281596,0.000028057884,0.0002352152,0.19988194,0.000016681246,0.59559053,0.0004387105,0.2008233],"study_design_scores_gemma":[0.0063561657,0.00014758392,0.009852225,0.000024014094,0.0000099039735,0.000026565489,0.000027798995,0.979199,0.0000030970014,0.0037962957,0.0003251867,0.00023217098],"about_ca_topic_score_codex":0.00006903784,"about_ca_topic_score_gemma":0.000081436694,"teacher_disagreement_score":0.9731702,"about_ca_system_score_codex":0.00004993096,"about_ca_system_score_gemma":0.00006415095,"threshold_uncertainty_score":0.62462753},"labels":[],"label_agreement":null},{"id":"W1613204985","doi":"10.1109/ccece.2001.933766","title":"Providing packet loss guarantees in differentiated services architectures","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Computer network; Quality of service; Differentiated service; Packet loss; Service (business); Jitter; Differentiated services; Reservation; Service provider; Network packet; Service design; Telecommunications; Business","score_opus":0.00890001768351186,"score_gpt":0.1917263322770453,"score_spread":0.18282631459353343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1613204985","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9110361,0.00057545607,0.081150144,0.0025728834,0.00023587963,0.00021459427,7.820374e-7,0.00048481367,0.0037293842],"genre_scores_gemma":[0.9975767,0.000018809762,0.0011750241,0.00056695443,0.000052742453,0.000015004576,7.553587e-7,0.0000053434655,0.0005886381],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902755,0.00006276311,0.00017781947,0.00029115743,0.0001619047,0.0002788011],"domain_scores_gemma":[0.9995423,0.0000750529,0.000040435163,0.0002682041,0.000022012722,0.000052024552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008006578,0.00012427419,0.00014023959,0.00010218098,0.000059313676,0.00014362413,0.00057191006,0.000043590182,0.0001360782],"category_scores_gemma":[0.0000044287663,0.00009531189,0.00004050832,0.00029433126,0.000021330789,0.00013422333,0.000087549466,0.000119032135,0.00007129672],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016494427,0.0002485483,0.021095512,0.000053453277,0.000038296344,0.000091673806,0.0034870275,0.0025368426,0.00024586075,0.034541268,0.0006869437,0.9369581],"study_design_scores_gemma":[0.0006756666,0.00003816583,0.009706867,0.00005014245,0.0000032400021,0.00001418808,0.00003738975,0.9867819,0.00021902344,0.0016642257,0.0006142961,0.00019490664],"about_ca_topic_score_codex":0.00003197049,"about_ca_topic_score_gemma":0.00027625813,"teacher_disagreement_score":0.98424506,"about_ca_system_score_codex":0.000011510024,"about_ca_system_score_gemma":0.000005516359,"threshold_uncertainty_score":0.3886706},"labels":[],"label_agreement":null},{"id":"W1621011156","doi":"10.1109/.2006.1629400","title":"BGP with an Adaptive Minimal Route Advertisement Interval","year":2006,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Border Gateway Protocol; Computer science; Convergence (economics); Computer network; Interval (graph theory); Default-free zone; Internetworking; The Internet; Routing protocol; Distributed computing; Routing (electronic design automation); Mathematics; Routing table; Operating system","score_opus":0.008140088050957964,"score_gpt":0.19899894015405617,"score_spread":0.19085885210309822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1621011156","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04049565,0.00004672154,0.9405247,0.0008084065,0.00012462637,0.00012714582,9.0086314e-7,0.0002754044,0.01759644],"genre_scores_gemma":[0.9449855,6.973946e-7,0.051864535,0.0004624303,0.00013838094,0.000018712306,0.0000022574463,0.0000053833724,0.0025220988],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990852,0.000039719303,0.00014378164,0.00030584043,0.0001992169,0.0002262338],"domain_scores_gemma":[0.9995185,0.000023527038,0.000040925202,0.00028019943,0.00005988264,0.00007694571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008705232,0.00011470994,0.000109378496,0.00003288418,0.00006301957,0.00009427492,0.00040429935,0.00002681648,0.00004853921],"category_scores_gemma":[8.6327367e-7,0.000083552906,0.000032376985,0.00012829361,0.00003089172,0.00042131505,0.000062463136,0.000064670174,0.00004805814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001762,0.00023921068,0.0013787159,0.0000018960451,0.00003733318,0.000060949922,0.00014543268,0.003236915,0.00004956431,0.39305392,0.0048250062,0.59679484],"study_design_scores_gemma":[0.0013382591,0.0016901597,0.011047501,0.000021815596,0.000015427826,0.000025512834,0.00007274653,0.9762133,0.00023611488,0.0009288341,0.008077343,0.0003330234],"about_ca_topic_score_codex":0.000119127624,"about_ca_topic_score_gemma":0.00043564243,"teacher_disagreement_score":0.9729763,"about_ca_system_score_codex":0.00003035539,"about_ca_system_score_gemma":0.00004764741,"threshold_uncertainty_score":0.34071887},"labels":[],"label_agreement":null},{"id":"W16216184","doi":"10.21437/interspeech.2010-656","title":"Quality-based playout buffering with FEC for conversational voIP","year":2010,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Voice over IP; Packet loss; Arithmetic underflow; Network packet; Computer network; Quality (philosophy); Quality of service; FIFO (computing and electronics); Quality of experience; Interactivity; Buffer overflow; Real-time computing; Multimedia; The Internet; Operating system","score_opus":0.013880071569968438,"score_gpt":0.2488805355440756,"score_spread":0.23500046397410718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W16216184","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029968409,0.0000033544497,0.9644225,0.003037686,0.00033773217,0.0001853408,0.0000023091552,0.00021012952,0.001832495],"genre_scores_gemma":[0.8929763,8.14976e-8,0.105051726,0.0012772036,0.00012362866,0.00004567601,0.0000046377777,0.0000047652447,0.00051602535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993008,0.00001691072,0.00012071418,0.00022611712,0.00016752616,0.00016796056],"domain_scores_gemma":[0.9991918,0.00033537322,0.000046321897,0.00024491074,0.00010664661,0.000074954194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002592787,0.00008354148,0.000095253374,0.00003119726,0.00009870388,0.00009585144,0.0003031859,0.000041569027,0.00005657464],"category_scores_gemma":[0.000020338339,0.000064196676,0.000039071776,0.000080407706,0.000035803212,0.0001581882,0.000018067229,0.00009651786,0.000022591094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060935286,0.000042944,0.0024147166,0.0000104886185,0.000021207712,0.0000015739155,0.00008048294,0.0022987514,0.00067845976,0.9125351,0.001143785,0.0807116],"study_design_scores_gemma":[0.0023298664,0.00011350243,0.0038194875,0.0000065232553,0.0000060847,0.0000043602126,0.000015372278,0.9701212,0.0008085829,0.00084411213,0.021690026,0.00024089005],"about_ca_topic_score_codex":0.000013740645,"about_ca_topic_score_gemma":0.00014348442,"teacher_disagreement_score":0.96782243,"about_ca_system_score_codex":0.000009524672,"about_ca_system_score_gemma":0.00013445219,"threshold_uncertainty_score":0.26178646},"labels":[],"label_agreement":null},{"id":"W1622806400","doi":"10.1109/ccece.2002.1012985","title":"Investigation of data transmission logs using the BestFit package","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Network packet; Transmission (telecommunications); Real-time computing; Reading (process); Multimedia; Computer network; Telecommunications","score_opus":0.08064359215032656,"score_gpt":0.27166778049999013,"score_spread":0.19102418834966356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1622806400","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012771606,0.0002051241,0.98438716,0.0011509884,0.0000738738,0.00009282725,7.721105e-7,0.00004423004,0.0012734059],"genre_scores_gemma":[0.9107433,0.000012613813,0.08868903,0.0003689853,0.000020284902,0.0000010678658,0.000002281478,0.0000030223196,0.00015942853],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927056,0.00011926879,0.00015284847,0.00019584187,0.00015434904,0.00010710865],"domain_scores_gemma":[0.9990801,0.00009810858,0.00005486867,0.00068149,0.000039108105,0.00004632297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042921407,0.00006056182,0.00007418766,0.00002123464,0.00008378768,0.000040369163,0.00075011875,0.000030450532,0.000029958699],"category_scores_gemma":[0.00001189376,0.000037585844,0.000019263276,0.00023713459,0.000051482202,0.00041656915,0.000052649488,0.00006351954,0.000004977436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039101637,0.000020882024,0.0008438124,0.000010916572,0.00002085982,0.0000026284345,0.0005425126,0.0010924482,0.0075597647,0.34767374,0.0021980824,0.64003044],"study_design_scores_gemma":[0.000338556,0.000030466315,0.00024495175,0.000026103236,0.000017444132,0.000013325076,0.000047774392,0.97762734,0.0050451336,0.0054833293,0.011010398,0.00011517129],"about_ca_topic_score_codex":0.000012284357,"about_ca_topic_score_gemma":0.0000032625346,"teacher_disagreement_score":0.9765349,"about_ca_system_score_codex":0.0000056923304,"about_ca_system_score_gemma":0.00008306759,"threshold_uncertainty_score":0.15327062},"labels":[],"label_agreement":null},{"id":"W1625256916","doi":"10.48550/arxiv.1001.1009","title":"Multi-path Probabilistic Available Bandwidth Estimation through Bayesian Active Learning","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"PlanetLab; Computer science; Probabilistic logic; Bandwidth (computing); Path (computing); Network packet; Computer network; Bandwidth allocation; Exploit; Artificial intelligence; The Internet","score_opus":0.04503659225057441,"score_gpt":0.18988418286651312,"score_spread":0.14484759061593871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1625256916","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021844273,0.00004736822,0.97299176,0.00013529592,0.0011073268,0.00054731045,0.000006416551,0.00059791794,0.002722309],"genre_scores_gemma":[0.9613998,0.00006018541,0.032282628,0.000059135516,0.000110897076,0.000004660581,0.000029621213,0.000024969373,0.0060280995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99755937,0.00023919265,0.00024165024,0.0013619208,0.0001364424,0.00046140194],"domain_scores_gemma":[0.99798495,0.00021610764,0.0003792818,0.0010189054,0.00022606201,0.00017467419],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028088162,0.000403214,0.00040808748,0.00013069989,0.0003329568,0.00022910815,0.0014075099,0.00047218197,0.00013649669],"category_scores_gemma":[0.000116446114,0.0004550708,0.0001942214,0.00045340476,0.00014216517,0.0007010278,0.0008721191,0.0016275225,0.0003854498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003485386,0.0001484708,0.00042876916,0.0000616393,0.00008285055,0.00011885002,0.0006247154,0.93269897,0.000026402948,0.051885847,0.00035297865,0.013535686],"study_design_scores_gemma":[0.00075616466,0.00005615025,0.00015691068,0.00010146998,0.00008005304,0.00000536355,0.000036706366,0.98538065,0.000026927417,0.011625374,0.0012990023,0.00047524954],"about_ca_topic_score_codex":0.00011135827,"about_ca_topic_score_gemma":0.000095400435,"teacher_disagreement_score":0.9407092,"about_ca_system_score_codex":0.00019973343,"about_ca_system_score_gemma":0.00038938771,"threshold_uncertainty_score":0.99979013},"labels":[],"label_agreement":null},{"id":"W1627300657","doi":"10.1109/ccece.1995.526589","title":"Simplification of analysis in discrete time leaky-bucket rate-based control schemes","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Leaky bucket; Token bucket; Computer science; Network packet; Markov process; Markov chain; Process (computing); Packet switching; Asynchronous Transfer Mode; Real-time computing; Computer network; Mathematics","score_opus":0.0092395126254186,"score_gpt":0.21016720110165282,"score_spread":0.2009276884762342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1627300657","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01578096,0.00012084649,0.97792333,0.0031049352,0.00003087556,0.00016490264,0.0000033156148,0.00011486294,0.0027559574],"genre_scores_gemma":[0.99645406,0.000004634082,0.0020706507,0.00044557074,0.000018311854,0.000017920851,0.0000047454955,0.0000038944677,0.0009801952],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889964,0.00012964156,0.00032326125,0.00028947237,0.00016661435,0.00019137125],"domain_scores_gemma":[0.9990546,0.00023405456,0.00011726409,0.00045403253,0.0000805431,0.000059490143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032008023,0.00010707135,0.00027565696,0.0002452388,0.00003265334,0.000048559203,0.00041709482,0.000050970535,0.00055065134],"category_scores_gemma":[0.000033051176,0.00009161082,0.00012145316,0.001209886,0.00003988556,0.00019376111,0.00001453102,0.000069935144,0.000113547736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010711986,0.0006048407,0.027984718,0.000024857798,0.0007426923,0.000015962129,0.00026311303,0.22128299,0.0046311324,0.16125597,0.004415827,0.5786708],"study_design_scores_gemma":[0.0009399144,0.000031830332,0.0057858233,0.0000036109052,0.000053775788,1.6387912e-7,0.0000033532313,0.9918753,0.00037658183,0.00010858385,0.00071331795,0.00010776824],"about_ca_topic_score_codex":0.000017311157,"about_ca_topic_score_gemma":0.000023662744,"teacher_disagreement_score":0.98067313,"about_ca_system_score_codex":0.000019025667,"about_ca_system_score_gemma":0.000021504413,"threshold_uncertainty_score":0.60292464},"labels":[],"label_agreement":null},{"id":"W1637324151","doi":"10.1109/ccece.2001.933756","title":"JQOS: a QoS-based Internet videoconferencing system using the Java media framework (JMF)","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Quality of service; Mobile QoS; Computer network; Multicast; The Internet; Scalability; Java; Distributed computing; Videoconferencing; Session (web analytics); Service (business); Multimedia; Service provider; Operating system; World Wide Web","score_opus":0.04027467780766853,"score_gpt":0.22486532411191876,"score_spread":0.18459064630425023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1637324151","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004938691,0.00039688018,0.98653036,0.001946205,0.0013868613,0.00021325485,8.086254e-7,0.00053070084,0.0040562507],"genre_scores_gemma":[0.9693006,0.0000034613595,0.02832513,0.001602722,0.00048484252,0.000021831744,5.1353976e-7,0.000011490337,0.00024939727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838656,0.00017091901,0.0003217057,0.00039327843,0.00035075133,0.00037679676],"domain_scores_gemma":[0.9982185,0.00073571515,0.00011700357,0.0007058625,0.000099381774,0.0001235597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036225142,0.00019484555,0.00021741267,0.0000724544,0.0001624545,0.00037776213,0.0011217645,0.00011345034,0.00027290214],"category_scores_gemma":[0.000074696225,0.00012809792,0.00010089417,0.00038418308,0.000058481142,0.00021751216,0.00012668285,0.0002918672,0.00020917767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011094954,0.000074626354,0.0005221877,0.000036555008,0.00007384044,0.0000623798,0.0026023607,0.010300081,0.000049901864,0.67249733,0.010647789,0.30312183],"study_design_scores_gemma":[0.00026287715,0.000023293309,0.000038390506,0.00018079884,0.000016035789,0.000020943535,0.00018510224,0.99590963,0.00008230895,0.00021033996,0.002894665,0.00017560498],"about_ca_topic_score_codex":0.00006357857,"about_ca_topic_score_gemma":0.000033007254,"teacher_disagreement_score":0.98560953,"about_ca_system_score_codex":0.000085544656,"about_ca_system_score_gemma":0.00005270738,"threshold_uncertainty_score":0.5223682},"labels":[],"label_agreement":null},{"id":"W1641150516","doi":"10.1109/icccn.2015.7288483","title":"Using Ethernet Commodity Switches to Build a Switch Fabric in Routers","year":2015,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; École de Technologie Supérieure","funders":"","keywords":"Computer network; Computer science; Ethernet; Network packet; Packet loss; Network congestion; Latency (audio); Telecommunications","score_opus":0.08375487178570007,"score_gpt":0.2973292566619735,"score_spread":0.21357438487627345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1641150516","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21445616,0.00005378913,0.77969897,0.0025670577,0.0002908003,0.00015069287,4.1568086e-7,0.00012141448,0.0026607271],"genre_scores_gemma":[0.961054,8.013825e-7,0.03647396,0.0020121485,0.00008191956,0.000005810449,3.559598e-7,0.0000064478986,0.00036454038],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988873,0.00006882079,0.0002009743,0.00030914287,0.00023552247,0.00029822745],"domain_scores_gemma":[0.9992201,0.000065224034,0.000038485992,0.0003823394,0.00006440575,0.00022949972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049890723,0.00012340253,0.00017836665,0.00010278802,0.000027647604,0.00012533406,0.0006340847,0.00005587673,0.000010302469],"category_scores_gemma":[0.00003025881,0.00010922575,0.00003385839,0.0005251716,0.000014660091,0.00026473185,0.00018605104,0.00012729396,0.00017442048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009250341,0.00032716128,0.033871412,0.0000096514395,0.000046460147,0.000076190474,0.006184576,0.22160217,0.00048034388,0.13188809,0.02617909,0.57924235],"study_design_scores_gemma":[0.00076031534,0.00006408195,0.0010378241,0.000023295688,0.000003587743,0.000013243647,0.000121404555,0.98979425,0.00006838592,0.0025801724,0.005286832,0.00024661285],"about_ca_topic_score_codex":0.0005402315,"about_ca_topic_score_gemma":0.00048919284,"teacher_disagreement_score":0.76819205,"about_ca_system_score_codex":0.00010653633,"about_ca_system_score_gemma":0.00012319737,"threshold_uncertainty_score":0.4454097},"labels":[],"label_agreement":null},{"id":"W1641542487","doi":"10.1109/icc.1999.765489","title":"Minimum cost traffic shaping: a user's perspective on connection admission control","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Quality of service; Computer science; Computer network; Context (archaeology); Traffic classification; Traffic policing; Admission control; Traffic shaping; Resource (disambiguation); Perspective (graphical); Network traffic control; Control (management); Scheme (mathematics); Distributed computing; Mathematics; Artificial intelligence","score_opus":0.02007552502490806,"score_gpt":0.256193568080073,"score_spread":0.23611804305516493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1641542487","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017342102,0.0003896431,0.91676295,0.007891101,0.0015165604,0.0010545842,0.0000021710741,0.0010095914,0.054031298],"genre_scores_gemma":[0.99389887,0.000013892231,0.0012274098,0.0026137694,0.00011699955,0.000059698377,7.795141e-7,0.000012917794,0.0020556902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982855,0.00021791105,0.00023165245,0.0005880306,0.00029873478,0.00037822552],"domain_scores_gemma":[0.998744,0.00031388446,0.00008935009,0.000411677,0.00019611442,0.00024493938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032811041,0.00021735636,0.00023012322,0.00012218847,0.00022980779,0.00016722849,0.0003621252,0.000108033964,0.0002269312],"category_scores_gemma":[0.00018479997,0.00018341857,0.000117705946,0.00034900484,0.000037774265,0.00028382512,0.000016895665,0.00020721887,0.00022916986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008823539,0.00022744051,0.00003935605,0.0000023629768,0.000047276084,0.000018410616,0.00032165681,0.009283572,0.00013323546,0.8966763,0.0066703777,0.08649174],"study_design_scores_gemma":[0.007121723,0.00092494104,0.0003299958,0.00006347996,0.00003745365,0.00007468183,0.00091685954,0.8800777,0.00047274533,0.0018941612,0.10738766,0.0006985518],"about_ca_topic_score_codex":0.0000068694076,"about_ca_topic_score_gemma":0.00001586107,"teacher_disagreement_score":0.9765567,"about_ca_system_score_codex":0.00017150238,"about_ca_system_score_gemma":0.00015375414,"threshold_uncertainty_score":0.74795926},"labels":[],"label_agreement":null},{"id":"W164411491","doi":"10.1007/978-1-4757-3789-9_18","title":"Dynamic Inter-SLA Resources Sharing in Differentiated Services Networks Based on Effective Bandwidth Allocation","year":2003,"lang":"en","type":"book-chapter","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer network; Computer science; Quality of service; Dynamic bandwidth allocation; Differentiated services; Scalability; Spare part; Multiprotocol Label Switching; Bandwidth (computing); Bandwidth allocation; Resource Reservation Protocol; Distributed computing; Bandwidth management; The Internet; Internet Protocol; Engineering","score_opus":0.0045196108895408085,"score_gpt":0.19473566627246436,"score_spread":0.19021605538292355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W164411491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00079478143,0.00051938096,0.80273074,0.00062660535,0.0009668162,0.0011756236,0.0000031272589,0.00054206344,0.19264087],"genre_scores_gemma":[0.92789406,0.00005410971,0.0006729328,0.002212137,0.00008629739,0.00008715891,0.00007037315,0.00006265248,0.068860315],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776655,0.000094287,0.00044897717,0.0009985758,0.00031708291,0.00037454136],"domain_scores_gemma":[0.9984873,0.0002886179,0.00024843912,0.0007752417,0.000092041904,0.00010833843],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031161704,0.0005078373,0.00049172714,0.0003740114,0.00009655338,0.00027794627,0.0010017473,0.00040736725,0.00012619357],"category_scores_gemma":[0.000005226162,0.00045467046,0.00015335125,0.00014025209,0.000039212096,0.00016823578,0.00015113175,0.0006389064,0.00005106871],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024109962,0.00021528319,0.00055057555,0.00017502952,0.00025788657,0.000083315164,0.00041551708,0.18325,0.0000063700263,0.10524796,0.0005737279,0.70898324],"study_design_scores_gemma":[0.00086200895,0.00014875602,0.00065697386,0.00087814254,0.000028552487,0.0000020157102,0.000003683398,0.99146533,0.0000017026471,0.0018427972,0.0036544248,0.00045562672],"about_ca_topic_score_codex":0.000019627762,"about_ca_topic_score_gemma":0.00054894056,"teacher_disagreement_score":0.9270992,"about_ca_system_score_codex":0.00018905463,"about_ca_system_score_gemma":0.00002392627,"threshold_uncertainty_score":0.9997905},"labels":[],"label_agreement":null},{"id":"W1646490563","doi":"10.1109/icc.1994.368758","title":"Congestion control strategies for mixed X.25/frame relay networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Network congestion; Computer science; Computer network; Network traffic control; Frame (networking); Frame Relay; Throughput; Key (lock); Relay; Service (business); Network packet; Wireless; Telecommunications; Computer security","score_opus":0.014271481846795673,"score_gpt":0.21181064047989168,"score_spread":0.197539158633096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1646490563","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007444417,0.0007365957,0.98620385,0.004331935,0.0010801079,0.00050320383,0.0000021076023,0.0006197641,0.0057779974],"genre_scores_gemma":[0.9830549,0.00004507735,0.012175715,0.0016044445,0.00037087355,0.00016057453,0.000003033983,0.000013474745,0.0025719353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854755,0.00008483737,0.00030169534,0.00043035304,0.00018307503,0.00045250528],"domain_scores_gemma":[0.9986781,0.0004956609,0.000104330196,0.00044037905,0.0001425501,0.00013902088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028974187,0.00019783444,0.000246865,0.000058642094,0.00018872801,0.0003857377,0.0005609694,0.00015594941,0.00011849782],"category_scores_gemma":[0.000035482088,0.0001721592,0.00012373508,0.0002157084,0.000058074005,0.0006108492,0.000034592482,0.00017046295,0.00009077879],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015737496,0.0000574138,0.000053593834,0.0000042970446,0.000041352512,0.0000041835883,0.00006684285,0.079846956,0.000017493041,0.60428435,0.034136884,0.28147092],"study_design_scores_gemma":[0.0017046422,0.00016218139,0.0002500388,0.000011396977,0.000019875863,0.00001039779,0.00003673072,0.97314197,0.0000035774567,0.0024397278,0.02199236,0.00022707574],"about_ca_topic_score_codex":0.0000058887767,"about_ca_topic_score_gemma":0.000023248282,"teacher_disagreement_score":0.9823104,"about_ca_system_score_codex":0.000027197684,"about_ca_system_score_gemma":0.000026195017,"threshold_uncertainty_score":0.70204484},"labels":[],"label_agreement":null},{"id":"W1657259300","doi":"","title":"A graph theoretical approach to traffic engineering and network control problem","year":2009,"lang":"en","type":"article","venue":"International Teletraffic Congress","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Network traffic control; Robustness (evolution); Traffic engineering; Computer science; Traffic generation model; Mathematical optimization; Graph theory; Criticality; Multiprotocol Label Switching; Betweenness centrality; Network traffic simulation; Network planning and design; Internet traffic engineering; Network topology; Distributed computing; Topology (electrical circuits); Computer network; Mathematics; Quality of service","score_opus":0.004265228968429004,"score_gpt":0.20268597144197456,"score_spread":0.19842074247354555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1657259300","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060777526,0.0004007781,0.9180506,0.0113405,0.0017282356,0.00078119553,0.000007508572,0.0008938462,0.0060197953],"genre_scores_gemma":[0.9738501,0.000017633367,0.023746857,0.0016743325,0.00051102345,0.000057196103,0.0000044413937,0.000012884857,0.00012557027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980974,0.000053576656,0.00034785777,0.0005890692,0.00044026415,0.0004718016],"domain_scores_gemma":[0.9989785,0.00022243927,0.00007109045,0.00029642784,0.00015791907,0.0002736501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039375675,0.00025609884,0.0002839705,0.00017860996,0.00010554235,0.00034580234,0.00096624007,0.00010065131,0.000018535597],"category_scores_gemma":[0.000054671433,0.00023919417,0.00009482399,0.0003914254,0.000077234035,0.00024490702,0.00007417753,0.0002562349,0.000019867228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002960448,0.00008563336,0.000020994865,0.0000028348888,0.00005037077,0.000016064163,0.0000920124,0.22025014,0.000018875455,0.4890369,0.0019014606,0.28849512],"study_design_scores_gemma":[0.0011900761,0.00014642585,0.0008517072,0.00005116496,0.000014048662,0.000121990604,0.000008159945,0.9861286,0.0000050609774,0.0016442733,0.009501909,0.0003365785],"about_ca_topic_score_codex":6.302095e-7,"about_ca_topic_score_gemma":7.9111965e-7,"teacher_disagreement_score":0.9130725,"about_ca_system_score_codex":0.000038446382,"about_ca_system_score_gemma":0.00003637985,"threshold_uncertainty_score":0.9754055},"labels":[],"label_agreement":null},{"id":"W1660138328","doi":"10.1007/978-0-387-35674-7_6","title":"Tariff-Based Pricing and Admission Control for DiffServ Networks","year":2003,"lang":"en","type":"book-chapter","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Tariff; Admission control; Pricing strategies; Quality of service; Architecture; Control (management); Computer science; Computer network; Differentiated services; Business; Operations research; Marketing; Engineering; Artificial intelligence","score_opus":0.010287221366510457,"score_gpt":0.20107094976496906,"score_spread":0.1907837283984586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1660138328","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000017475784,0.0015821699,0.9456241,0.0019836158,0.0005699177,0.00080164,0.000003901487,0.00023480417,0.049198106],"genre_scores_gemma":[0.101620995,0.00032381943,0.058996174,0.029060112,0.0013485091,0.00023523933,0.00005457698,0.00018154448,0.808179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983687,0.000027479038,0.00036448165,0.00066636153,0.00021594588,0.0003570256],"domain_scores_gemma":[0.99844795,0.00047036872,0.0002140318,0.00049189443,0.00012576085,0.00024998232],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027530093,0.0003874246,0.0004772121,0.00009744196,0.0002051305,0.00017233776,0.0004059265,0.00040781527,0.000077862736],"category_scores_gemma":[0.00002038479,0.00032387837,0.00017071779,0.000033922093,0.00004594677,0.000114003895,0.00004770252,0.00029875326,0.000007196773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004614754,0.000016173326,0.000012145544,0.000026920654,0.000059125337,0.00000814161,0.000007746413,0.004917976,0.0000022213615,0.64536387,0.01299619,0.33654335],"study_design_scores_gemma":[0.001693465,0.00013106986,0.000008136024,0.00011479453,0.000055976976,0.0000053139693,5.225141e-7,0.74772894,0.0000016358692,0.0051146196,0.2447899,0.00035564075],"about_ca_topic_score_codex":0.000002067022,"about_ca_topic_score_gemma":0.00000755084,"teacher_disagreement_score":0.8866279,"about_ca_system_score_codex":0.000040074927,"about_ca_system_score_gemma":0.0000944632,"threshold_uncertainty_score":0.9999213},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.034986474116985876,"score_gpt":0.2517601557899028,"score_spread":0.2167736816729169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1663605321","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68647885,0.00043128015,0.2631066,0.0013456299,0.0009529243,0.00044215797,0.000014207093,0.0010380432,0.04619029],"genre_scores_gemma":[0.99424493,0.00011689058,0.004916929,0.00022037554,0.00017639177,0.0000025468278,0.0000030140607,0.0000049671744,0.00031396828],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894065,0.000045324214,0.00018853339,0.00033056672,0.0002160514,0.00027887174],"domain_scores_gemma":[0.9983905,0.0001018372,0.00007345112,0.0013002828,0.000050564384,0.000083365034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024185376,0.00011894041,0.00017076409,0.000028922434,0.0000823375,0.000046978967,0.0014521386,0.000050008643,0.000154713],"category_scores_gemma":[0.0000058542873,0.00008976453,0.000053922988,0.00031682744,0.00002329762,0.00040675915,0.00024397012,0.00013101578,0.00008579565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000137877505,0.00027390456,0.018955043,0.000008288372,0.00008469654,0.000004498271,0.00008249208,0.018681405,0.0000033346025,0.015689816,0.08328432,0.86291844],"study_design_scores_gemma":[0.00028616822,0.00019829014,0.016248384,0.000013901558,0.000006033357,0.0000042114943,5.3707663e-7,0.9817504,0.0000047552085,0.000032663036,0.0013460799,0.00010855657],"about_ca_topic_score_codex":0.000008948124,"about_ca_topic_score_gemma":0.000005187378,"teacher_disagreement_score":0.963069,"about_ca_system_score_codex":0.000021959315,"about_ca_system_score_gemma":0.00003163629,"threshold_uncertainty_score":0.3660491},"labels":[],"label_agreement":null},{"id":"W1664656711","doi":"10.1109/nca.2001.962553","title":"Limited scope probing: a distributed approach for QoS-based routing","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Unicast; Computer science; Computer network; Open Shortest Path First; Distributed computing; Static routing; Link-state routing protocol; Policy-based routing; Dynamic Source Routing; Equal-cost multi-path routing; Geographic routing; Routing protocol; Routing table; Routing Information Protocol; Routing (electronic design automation); Scope (computer science); Multicast","score_opus":0.0313930151556827,"score_gpt":0.21897968066640863,"score_spread":0.18758666551072595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1664656711","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041733638,0.00011878439,0.99239683,0.0016396901,0.00015820577,0.00054828345,0.000004147339,0.00060997135,0.0041067596],"genre_scores_gemma":[0.8604065,0.0000014496018,0.13799891,0.0006113149,0.00014332142,0.0001500366,0.000022495979,0.000009351572,0.0006565828],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881196,0.000040545285,0.00021834903,0.00040076167,0.0001572254,0.00037118592],"domain_scores_gemma":[0.99918675,0.00015535156,0.00007367258,0.000372587,0.00010672629,0.00010489054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021776881,0.00014102102,0.00016090323,0.00004919096,0.00018161217,0.00020045384,0.0005370803,0.00006342732,0.000029800907],"category_scores_gemma":[0.000052141633,0.0001195536,0.000091050075,0.00042270386,0.000024993691,0.00018695246,0.00004978117,0.00009037306,0.000023355722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004383878,0.0007681018,0.00021605685,0.000059686558,0.00007713824,0.000009767809,0.00028601312,0.064237654,0.00033516344,0.189604,0.06022081,0.68414176],"study_design_scores_gemma":[0.0010495142,0.000071858994,0.00002015675,0.000012069452,0.000008107965,0.0000032806984,0.000009134336,0.99344885,0.0001949442,0.000040124858,0.004972311,0.00016961504],"about_ca_topic_score_codex":0.0000022810161,"about_ca_topic_score_gemma":9.761276e-7,"teacher_disagreement_score":0.92921126,"about_ca_system_score_codex":0.000030435891,"about_ca_system_score_gemma":0.000029007731,"threshold_uncertainty_score":0.48752546},"labels":[],"label_agreement":null},{"id":"W1672634173","doi":"10.1109/ccece.2003.1226066","title":"Multicast flow control in priority-based IP networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Multicast; Computer network; Computer science; Xcast; Source-specific multicast; Pragmatic General Multicast; Protocol Independent Multicast; IP multicast; Distance Vector Multicast Routing Protocol; Distributed computing; Network congestion; Inter-domain; Quality of service; Reliable multicast; Router; Multicast address; Network packet","score_opus":0.005787595297846706,"score_gpt":0.20642778897679986,"score_spread":0.20064019367895317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1672634173","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020633552,0.00011677463,0.991356,0.004643787,0.00038128064,0.00026170883,5.460868e-7,0.00028783033,0.00088870147],"genre_scores_gemma":[0.9494946,0.0000033221122,0.04639481,0.00387011,0.00013019174,0.000030374384,0.0000011191898,0.0000069255098,0.000068544185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875295,0.00006516234,0.00024748486,0.00035192346,0.0001859948,0.00039648404],"domain_scores_gemma":[0.99923116,0.00014997362,0.000041365784,0.00039953346,0.000048621096,0.0001293407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029135076,0.00014576533,0.00019763414,0.0000792811,0.000065909146,0.000112489804,0.0005158068,0.00008938476,0.000024820587],"category_scores_gemma":[0.000020957008,0.00012904346,0.000068684,0.00036364543,0.000038076654,0.00020718333,0.000035737583,0.0002114864,0.00007439971],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017413708,0.0000988647,0.0007114471,0.0000016626317,0.0000061033325,0.00003919597,0.00003495695,0.7446581,0.0000067961014,0.035067257,0.00008856651,0.21926965],"study_design_scores_gemma":[0.0046100165,0.00005229984,0.0026061884,0.000019884346,0.000003857432,0.0000035464238,0.0000036509582,0.9911186,0.000009639841,0.0004931089,0.0009156686,0.00016354429],"about_ca_topic_score_codex":0.000035550474,"about_ca_topic_score_gemma":0.00017924875,"teacher_disagreement_score":0.94743127,"about_ca_system_score_codex":0.000065635824,"about_ca_system_score_gemma":0.0001146675,"threshold_uncertainty_score":0.52622396},"labels":[],"label_agreement":null},{"id":"W1680106434","doi":"10.1109/icc.1999.765397","title":"Improving resource utilization for the rate-controlled traffic flows in high speed networks","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Resource (disambiguation); Traffic shaping; Resource allocation; Context (archaeology); Traffic generation model; Lossless compression; Computer network; Network traffic control; Resource management (computing); Distributed computing; Data compression; Artificial intelligence","score_opus":0.016220068135261768,"score_gpt":0.22110767756040756,"score_spread":0.20488760942514578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1680106434","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012955235,0.0007123784,0.98237556,0.0012398541,0.00056857086,0.0012155183,3.111701e-7,0.00019672126,0.00073586503],"genre_scores_gemma":[0.993444,0.000017852051,0.004018491,0.00096026,0.00015854403,0.00011514623,0.0000025040267,0.000013255834,0.0012699133],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844706,0.00025254706,0.00037375148,0.00038209982,0.00013920404,0.0004053422],"domain_scores_gemma":[0.9981066,0.0012240455,0.00010875357,0.00043048197,0.00006618525,0.0000639576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014270962,0.0001687463,0.00026947822,0.0000718889,0.00020622603,0.00021652535,0.00052795006,0.00009350152,0.00002847869],"category_scores_gemma":[0.00019916991,0.00011183161,0.000109522836,0.0004727935,0.000023251774,0.00019847149,0.000031023057,0.00014921496,0.000006799632],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010003486,0.000033138436,0.000019886475,0.0000021850396,0.000015802376,0.00000155691,0.00006992105,0.6274745,0.000017123648,0.06890051,0.00074713473,0.30261824],"study_design_scores_gemma":[0.0057274546,0.000049034606,0.00012754345,0.000007944853,0.000016153575,0.0000023580876,0.000053247022,0.98798054,0.000015626618,0.00016703614,0.0057085305,0.00014454617],"about_ca_topic_score_codex":0.00001238043,"about_ca_topic_score_gemma":0.00015419649,"teacher_disagreement_score":0.9804888,"about_ca_system_score_codex":0.00003590638,"about_ca_system_score_gemma":0.00006459699,"threshold_uncertainty_score":0.45603606},"labels":[],"label_agreement":null},{"id":"W1690033329","doi":"10.1109/ccece.2001.933771","title":"A computer aided tool for the performance evaluation of Diffserv networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Computer network; Network simulation; The Internet; Distributed computing; Operating system","score_opus":0.030949661702321107,"score_gpt":0.23492291066268564,"score_spread":0.20397324896036453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1690033329","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02883986,0.00037510713,0.9681841,0.0012777718,0.00045533662,0.0004774763,2.5134122e-7,0.00006489118,0.00032521563],"genre_scores_gemma":[0.9901506,0.000043314627,0.008562468,0.00058244943,0.00024191388,0.00009685367,6.366195e-7,0.0000036072338,0.0003182059],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915254,0.000053871023,0.00019010973,0.0001649811,0.0002828376,0.00015565622],"domain_scores_gemma":[0.99902886,0.00031938645,0.000072921786,0.00035222745,0.00020506367,0.000021534395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007043126,0.00007495116,0.000096060445,0.000020406538,0.00011683131,0.000050064406,0.00045061906,0.00003458209,0.000080448175],"category_scores_gemma":[0.000010956544,0.000047073372,0.00006203836,0.00015873014,0.000025588877,0.0001906117,0.000051014107,0.00005414938,0.000010735598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028005143,0.00001943049,0.00014170475,0.0000018382307,0.000013290361,3.2164255e-8,0.000053880358,0.18644617,0.0000018055886,0.0075275023,0.0040337453,0.8017578],"study_design_scores_gemma":[0.0007261218,0.00006939201,0.003564147,0.0000088169245,0.000022802431,0.0000017293322,0.0000023865482,0.9940248,0.00001340297,0.00006712305,0.001431718,0.00006754141],"about_ca_topic_score_codex":0.0000012882433,"about_ca_topic_score_gemma":0.0000022022782,"teacher_disagreement_score":0.9613107,"about_ca_system_score_codex":0.000013988807,"about_ca_system_score_gemma":0.000011905921,"threshold_uncertainty_score":0.19195963},"labels":[],"label_agreement":null},{"id":"W170046012","doi":"10.1007/978-3-540-72990-7_72","title":"Self-tuning Optimal PI Rate Controller for End-to-End Congestion With LQR Approach","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Active queue management; Control theory (sociology); Network congestion; Router; Controller (irrigation); Transient (computer programming); Computer science; Queue; PID controller; Engineering; Computer network; Control engineering; Control (management); Network packet","score_opus":0.017690397062093754,"score_gpt":0.2337911100705686,"score_spread":0.21610071300847486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W170046012","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005834673,0.00028746444,0.9927512,0.0008598833,0.0011053092,0.0017442015,0.0000079497095,0.00042914524,0.0027565432],"genre_scores_gemma":[0.18847658,0.0000125525,0.8073033,0.0026621046,0.0009129204,0.00009681235,0.000011228567,0.000058654252,0.00046584324],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950196,0.00006641909,0.0006415171,0.002129799,0.0009957084,0.0011469371],"domain_scores_gemma":[0.9962705,0.0013012203,0.00037882256,0.0010144907,0.0006300969,0.00040488713],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023367181,0.000774976,0.00085987366,0.00089226913,0.00046487976,0.00079263194,0.0025994282,0.00041451826,0.000009993575],"category_scores_gemma":[0.0000759836,0.00065047457,0.00017244506,0.0007458924,0.00046850747,0.0005770253,0.00049281534,0.00084977644,0.000022005008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103637336,0.000040392373,0.000008407771,0.000031104035,0.000043950167,0.000032188767,0.0003939089,0.29329276,0.000018907003,0.04249731,0.000029064153,0.66350836],"study_design_scores_gemma":[0.0016482746,0.0006151552,0.00003463332,0.00022245984,0.000040896113,0.00009203891,4.8912466e-7,0.9856839,0.00006948455,0.0035069168,0.0072272383,0.0008585059],"about_ca_topic_score_codex":0.000007966951,"about_ca_topic_score_gemma":0.000032515607,"teacher_disagreement_score":0.69239116,"about_ca_system_score_codex":0.00032030503,"about_ca_system_score_gemma":0.0006874597,"threshold_uncertainty_score":0.9995946},"labels":[],"label_agreement":null},{"id":"W1706987169","doi":"10.1109/icccn.1999.805576","title":"Data flow control in ATM networks: an evaluation of ER and BCA","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Computer network; Asynchronous Transfer Mode; Bandwidth (computing); Flow control (data); Data loss; Real-time computing","score_opus":0.045544796196629204,"score_gpt":0.2823108591710959,"score_spread":0.23676606297446667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1706987169","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014908231,0.000812295,0.9815723,0.00028043924,0.00019504562,0.00027042037,0.0000026008279,0.000040225485,0.0019184498],"genre_scores_gemma":[0.9898258,0.000020117137,0.009771051,0.00029135024,0.00003483061,0.000010399041,0.0000060820694,0.0000031455356,0.000037232614],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987819,0.00032223333,0.00019537217,0.00030654127,0.0002456313,0.0001482808],"domain_scores_gemma":[0.99902874,0.00010864947,0.000049255752,0.00065308745,0.000102803206,0.00005743289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019107353,0.00007359896,0.00013197609,0.00003909435,0.000027358828,0.00004658242,0.00040196595,0.00004350798,0.000049100625],"category_scores_gemma":[0.00006331795,0.0000634505,0.000010366277,0.00018422988,0.000025609306,0.00053382287,0.00004634486,0.0000617489,0.0000027001367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010392475,0.000087933106,0.0023133615,0.0000018887258,0.0000146027705,0.000001355038,0.000067628614,0.107329264,0.000012294559,0.039191566,0.0008413422,0.85012835],"study_design_scores_gemma":[0.0016027698,0.000043821627,0.0021273708,0.0000068972026,0.00001540378,0.000003077244,0.0000132722125,0.9943899,0.0000025536738,0.0008437552,0.0008775243,0.00007363845],"about_ca_topic_score_codex":0.000011306335,"about_ca_topic_score_gemma":0.0002314118,"teacher_disagreement_score":0.97491753,"about_ca_system_score_codex":0.000011535705,"about_ca_system_score_gemma":0.000081578335,"threshold_uncertainty_score":0.2587436},"labels":[],"label_agreement":null},{"id":"W1711080606","doi":"10.1109/mascot.1999.805039","title":"TCP performance and buffer provisioning for Internet in wireless networks","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer network; Computer science; Transmission Control Protocol; Radio Link Protocol; TCP Friendly Rate Control; TCP global synchronization; TCP acceleration; Network packet; Wireless; Telecommunications","score_opus":0.007495607143111365,"score_gpt":0.20019941378687675,"score_spread":0.19270380664376538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1711080606","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12970978,0.00011702682,0.867414,0.00017580719,0.00019592232,0.00020020723,5.3699033e-8,0.000061816674,0.002125395],"genre_scores_gemma":[0.99020153,0.00002600821,0.007913626,0.0003665576,0.00002973878,0.00004529774,3.880523e-7,0.0000046351615,0.0014122026],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993161,0.000028790428,0.0001421065,0.00023641525,0.000062460465,0.00021410456],"domain_scores_gemma":[0.9996601,0.0001063875,0.00002843067,0.00012969584,0.000025749743,0.00004966321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026994903,0.00008258459,0.0001066202,0.000039660317,0.000041694726,0.000091114656,0.00018170684,0.00004337966,0.000008985925],"category_scores_gemma":[0.000011250626,0.00006824549,0.000017893848,0.00012461639,0.000018320818,0.0002304179,0.000038534636,0.0000829121,0.000002931596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011149887,0.000020634621,0.0081975395,0.000007950403,0.0000045035363,0.0000013998504,0.00010949649,0.002281793,0.000004522376,0.30507803,0.0010699776,0.683213],"study_design_scores_gemma":[0.0005802052,0.00006329354,0.0016657755,0.000026837779,0.0000013075893,0.000006130423,0.000009024713,0.99321485,0.000040075065,0.00016102125,0.004131653,0.00009982662],"about_ca_topic_score_codex":0.0000039576466,"about_ca_topic_score_gemma":0.000017299639,"teacher_disagreement_score":0.99093306,"about_ca_system_score_codex":0.000011924009,"about_ca_system_score_gemma":0.000018822047,"threshold_uncertainty_score":0.27829704},"labels":[],"label_agreement":null},{"id":"W1729532033","doi":"","title":"On Fair Bandwidth Allocation in Connection-less Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Computer network; Bandwidth (computing); Quality of service; The Internet; Bandwidth allocation; Distributed computing; Dynamic bandwidth allocation; Set (abstract data type); Hierarchy; World Wide Web; Law","score_opus":0.008573137978399094,"score_gpt":0.21484272021118797,"score_spread":0.20626958223278888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1729532033","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012259714,0.00005872992,0.9698777,0.0046771513,0.00036943817,0.00013378545,5.4360434e-8,0.00023395852,0.012389465],"genre_scores_gemma":[0.99480367,0.000014331748,0.0010650327,0.003419296,0.00009906731,0.000009519925,0.0000015607247,0.000002504169,0.00058501726],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992296,0.000046853267,0.00015448795,0.0002561445,0.00012203127,0.00019087922],"domain_scores_gemma":[0.99951804,0.00011268231,0.000033883003,0.00025006107,0.00003116117,0.000054157656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017912105,0.000089015186,0.0000995437,0.00007420021,0.000054885833,0.000079964506,0.00028218544,0.00005769329,0.000020388725],"category_scores_gemma":[0.000012727121,0.000078646444,0.000028717126,0.00033485558,0.00000902897,0.00020447873,0.00001302041,0.00011824814,0.00003609319],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000845014,0.000047730937,0.00011726845,2.6213286e-7,0.0000017338729,0.0000029222767,0.000024602392,0.08949753,0.000003267173,0.4013616,0.0022621823,0.50667244],"study_design_scores_gemma":[0.00052360166,0.00012370883,0.007987896,0.000013930102,0.0000011814283,0.0000030178442,0.000010690535,0.9847404,0.000015394857,0.00598442,0.00048082662,0.00011497922],"about_ca_topic_score_codex":0.000009089463,"about_ca_topic_score_gemma":0.00007140186,"teacher_disagreement_score":0.98254395,"about_ca_system_score_codex":0.000033646338,"about_ca_system_score_gemma":0.000019914409,"threshold_uncertainty_score":0.3207109},"labels":[],"label_agreement":null},{"id":"W1743366186","doi":"10.1109/ccece.2000.849547","title":"Internet flow blocking probability calculation","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada); Carleton University","funders":"","keywords":"Blocking (statistics); Queueing theory; The Internet; Offered load; Computer science; Flow (mathematics); Duration (music); Heavy-tailed distribution; Traffic flow (computer networking); Internet traffic; Pareto principle; Computer network; Probability distribution; Mathematics; Mathematical optimization; Statistics; Throughput; Mechanics; Telecommunications; Physics","score_opus":0.030660010478694634,"score_gpt":0.20632857806889696,"score_spread":0.17566856759020233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1743366186","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008180087,0.00006301466,0.9781007,0.001625216,0.00023187307,0.00010526631,9.6668714e-8,0.00032082034,0.01137292],"genre_scores_gemma":[0.96533114,0.0000015964098,0.031118028,0.00034538392,0.000070639195,0.00000882624,3.6876696e-7,0.0000022807028,0.0031217544],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993596,0.000035391502,0.00012557219,0.0002190967,0.00012284203,0.00013746925],"domain_scores_gemma":[0.9995879,0.000040286293,0.000025547895,0.00025523838,0.00004201632,0.000049013102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012135114,0.000063442014,0.000067000925,0.000022858945,0.000036625817,0.000085243606,0.00026890304,0.000031426476,0.0002618087],"category_scores_gemma":[0.000015878497,0.000053271848,0.000036174253,0.00013945886,0.000014779476,0.00020505907,0.000056512534,0.00006046675,0.00019417537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.3737e-7,0.000031142514,0.0007018046,0.0000016604649,0.0000049758914,0.0000018540032,0.00016367294,0.0026299634,0.0000055431296,0.046544336,0.0047464087,0.9451679],"study_design_scores_gemma":[0.00014506302,0.00001620535,0.0006062763,0.000004138372,0.0000016623842,0.0000045214356,8.193125e-7,0.9930956,0.000023938806,0.0009570953,0.005074938,0.00006978031],"about_ca_topic_score_codex":0.000006653898,"about_ca_topic_score_gemma":0.000012695996,"teacher_disagreement_score":0.9904656,"about_ca_system_score_codex":0.000021859543,"about_ca_system_score_gemma":0.000004849014,"threshold_uncertainty_score":0.28666216},"labels":[],"label_agreement":null},{"id":"W1747265470","doi":"10.1109/ccece.1996.548274","title":"The addition of connection priority/pre-emption service to ATM","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada; Royal Military College of Canada","funders":"","keywords":"Asynchronous Transfer Mode; Computer science; Asynchronous communication; Computer network; Service (business); Protocol (science); Connection (principal bundle); Distributed computing; Engineering","score_opus":0.012190451769276602,"score_gpt":0.21285657084762655,"score_spread":0.20066611907834994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1747265470","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036065422,0.00012396037,0.9347758,0.01809159,0.0008152369,0.0003617528,0.0000018444823,0.0002901585,0.009474191],"genre_scores_gemma":[0.9954189,0.000030231022,0.00223246,0.0008658588,0.00011919067,0.000024713107,0.0000010975538,0.0000029738421,0.0013045475],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993225,0.00005194404,0.00015892909,0.00016421132,0.00017099321,0.00013147674],"domain_scores_gemma":[0.99929476,0.00014685818,0.00005718431,0.00029439974,0.00015416015,0.00005264069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017632895,0.00006263984,0.00006895191,0.00002852117,0.00015197656,0.00006699304,0.00030477752,0.00003475153,0.00012221502],"category_scores_gemma":[0.000022164475,0.000045462664,0.00003097525,0.00036090068,0.000011266869,0.0002162918,0.00004632152,0.000055301647,0.00019570815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010274178,0.00003483147,0.000032932603,0.0000036415963,0.000009967808,3.9190633e-7,0.0002785389,0.0012622087,0.00025658353,0.119440675,0.012811843,0.86585814],"study_design_scores_gemma":[0.00039302983,0.00014052504,0.003370318,0.000018106542,0.000007461154,0.00000772811,0.000059101647,0.9273649,0.00038832013,0.0010203345,0.06710182,0.0001283592],"about_ca_topic_score_codex":0.000027981867,"about_ca_topic_score_gemma":0.00015506917,"teacher_disagreement_score":0.9593535,"about_ca_system_score_codex":0.000020275495,"about_ca_system_score_gemma":0.0000084775165,"threshold_uncertainty_score":0.25154975},"labels":[],"label_agreement":null},{"id":"W1756855288","doi":"10.3233/scc-2001-235","title":"Broadband satellite access for interactive multimedia services","year":2001,"lang":"en","type":"article","venue":"Space Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Broadband; Computer science; Broadband networks; Telecommunications; Satellite; Computer network; Terminal (telecommunication); Interactive television; Access control; Asynchronous Transfer Mode; Multimedia; Webcast; Engineering","score_opus":0.031532878534893345,"score_gpt":0.32236567578608055,"score_spread":0.2908327972511872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1756855288","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035109343,0.0043270392,0.9218541,0.049963403,0.00048315382,0.0008630364,0.000011522315,0.0005193412,0.018467473],"genre_scores_gemma":[0.91683805,0.0019815254,0.07885608,0.0008241334,0.000083264174,0.00023344558,0.000030352596,0.000011137094,0.0011419955],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992493,0.00008233865,0.00015913953,0.00021415926,0.00009212672,0.00020292765],"domain_scores_gemma":[0.9972759,0.00066393806,0.000108046195,0.0016744719,0.00019266875,0.000084992025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015262554,0.00010756214,0.00012347213,0.00006985571,0.0002968934,0.0002968164,0.0030337865,0.00004583573,0.000011148914],"category_scores_gemma":[0.000024988129,0.0001046772,0.000064070526,0.00031979202,0.00006477508,0.0007906009,0.00056902895,0.00013887415,0.00004394637],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027500479,0.00020079484,0.0021914316,0.000010616028,0.000058414887,0.0000010786797,0.0019065525,0.00028052626,0.00007624918,0.049271733,0.001352579,0.9446225],"study_design_scores_gemma":[0.000664715,0.000027911321,0.0024859533,0.000039830968,0.000014790553,0.000006354704,0.00013878301,0.6424866,0.000038893046,0.0014840257,0.35245046,0.00016171351],"about_ca_topic_score_codex":0.00005332795,"about_ca_topic_score_gemma":0.00063191453,"teacher_disagreement_score":0.9444608,"about_ca_system_score_codex":0.000028287277,"about_ca_system_score_gemma":0.00004167512,"threshold_uncertainty_score":0.5637581},"labels":[],"label_agreement":null},{"id":"W1757801143","doi":"10.1023/a:1011134903609","title":"Simulation and Analysis of Packet Loss in User Datagram Protocol Transfers","year":2001,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Packet loss; Computer network; Datagram; Network packet; User Datagram Protocol; Quality of service; Internet Protocol; Packet analyzer; End-to-end delay; Internet protocol suite; The Internet; Real-time computing; World Wide Web","score_opus":0.022065840465387572,"score_gpt":0.29235055437351903,"score_spread":0.27028471390813147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1757801143","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5432721,0.00001810993,0.45505244,0.00033330955,0.000025345946,0.0012746607,4.3972017e-7,0.0000064638466,0.000017138305],"genre_scores_gemma":[0.9980748,0.0000071307218,0.0017755518,0.00006720227,0.000048442453,0.000020128666,3.4759745e-7,0.000002973979,0.0000034185603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989242,0.00018270809,0.000457694,0.000086673186,0.00021455348,0.00013417106],"domain_scores_gemma":[0.9990293,0.0005249963,0.00013292735,0.00016580413,0.00010500688,0.000041970892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013087314,0.000074866824,0.00024066746,0.00022486354,0.000057895835,0.000036337613,0.0003920225,0.00002949311,0.0000060727693],"category_scores_gemma":[0.00003137351,0.000049454855,0.00007028223,0.00086248334,0.00004160309,0.00035419213,0.00004064052,0.0001589888,2.9988138e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054752865,0.000039193026,0.039063435,0.000005721027,0.00011091083,0.000011143275,0.0012142161,0.7758409,0.000058271387,0.00039474788,0.00000639807,0.18320033],"study_design_scores_gemma":[0.00066880113,0.000085878004,0.035750296,0.00004040291,0.00009380163,0.000022146234,0.00008298134,0.96291107,0.000012887436,0.00009766479,0.00018040469,0.00005368409],"about_ca_topic_score_codex":0.000015394988,"about_ca_topic_score_gemma":0.000021580983,"teacher_disagreement_score":0.4548027,"about_ca_system_score_codex":0.000014985846,"about_ca_system_score_gemma":0.000028972949,"threshold_uncertainty_score":0.20167105},"labels":[],"label_agreement":null},{"id":"W1762271469","doi":"10.1109/iscas.2001.921078","title":"Packet loss in video transfers over IP networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Packet loss; Computer network; Computer science; Transmission delay; User Datagram Protocol; Transmission Control Protocol; Datagram; Internet Protocol; Packet analyzer; Radio Link Protocol; Internet protocol suite; End-to-end delay; Network packet; TCP Vegas; TCP global synchronization; Real-time computing; The Internet; Wireless; Telecommunications","score_opus":0.010380825388198296,"score_gpt":0.19767323360086214,"score_spread":0.18729240821266385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1762271469","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02036,0.00041587726,0.958946,0.004001382,0.0004573534,0.00016124175,4.5871252e-7,0.00027708735,0.015380611],"genre_scores_gemma":[0.9952419,0.00010989136,0.00095262047,0.0020493967,0.00011603616,0.000014278468,4.3887974e-7,0.0000062815834,0.0015091961],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989465,0.000055766435,0.00019469099,0.0003022437,0.00016092662,0.00033990378],"domain_scores_gemma":[0.9994493,0.00009956158,0.000018143151,0.0003196562,0.000016136475,0.000097195094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015530664,0.00011906825,0.00014177963,0.000060625687,0.00004309542,0.000082819715,0.00046051145,0.000075844706,0.00055011397],"category_scores_gemma":[0.000004929521,0.00010467242,0.00006120011,0.00039953692,0.00003267869,0.0003062201,0.00003025418,0.00016275565,0.00011151347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065480626,0.000074229254,0.0028938386,0.0000020038863,0.000011274151,0.000059229016,0.00021916647,0.015126987,0.0000025708764,0.06933509,0.017718077,0.894551],"study_design_scores_gemma":[0.0007649002,0.00004254594,0.0041067167,0.000010775879,0.0000024612107,0.000007166507,0.0000050152325,0.9874843,0.000004463863,0.00037613433,0.0070370985,0.00015844003],"about_ca_topic_score_codex":0.000016263572,"about_ca_topic_score_gemma":0.0001016244,"teacher_disagreement_score":0.9748819,"about_ca_system_score_codex":0.000023127186,"about_ca_system_score_gemma":0.0000073153665,"threshold_uncertainty_score":0.6023362},"labels":[],"label_agreement":null},{"id":"W1769053037","doi":"10.1109/hotos.1999.798379","title":"Transparent communication management in wireless networks","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Thailand Toray Science Foundation","keywords":"Computer science; Computer network; Quality of service; Wireless; Proxy (statistics); Network packet; Distributed computing; Wireless network; Telecommunications","score_opus":0.015522705687745362,"score_gpt":0.2293297613187403,"score_spread":0.21380705563099495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1769053037","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018426531,0.00027434868,0.9465347,0.000625518,0.00011241745,0.00014582604,3.2756112e-8,0.000100834135,0.050363656],"genre_scores_gemma":[0.98702604,0.00026498578,0.011742361,0.0004057758,0.000005934812,0.000037973907,8.989999e-7,0.0000030138735,0.0005130444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931026,0.00010935044,0.00015390266,0.0001644771,0.0000946556,0.00016733828],"domain_scores_gemma":[0.9994578,0.000039841987,0.00002310761,0.00042885132,0.0000118604885,0.00003858364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024585528,0.00006738767,0.00007946027,0.00004208545,0.000045618934,0.000049390423,0.000447809,0.000028281864,0.000025847763],"category_scores_gemma":[8.864643e-7,0.00006269992,0.000023700972,0.00025764114,0.000013837691,0.00012815907,0.000026726671,0.000082406405,0.000016211978],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001214084,0.000034482768,0.00028072158,0.0000010911974,0.0000052814303,0.0000029619175,0.000037354646,0.01278429,3.5378454e-7,0.66179174,0.00026242464,0.3247981],"study_design_scores_gemma":[0.00070311426,0.000012458662,0.002429436,0.000018381192,0.0000037943298,0.000002514975,0.000037318492,0.98663497,0.00001138875,0.0022891948,0.0077236826,0.00013372427],"about_ca_topic_score_codex":0.0000056361982,"about_ca_topic_score_gemma":0.00006658053,"teacher_disagreement_score":0.98518336,"about_ca_system_score_codex":0.000023072584,"about_ca_system_score_gemma":0.0000064894252,"threshold_uncertainty_score":0.25568283},"labels":[],"label_agreement":null},{"id":"W1771986173","doi":"10.1109/glocom.2000.891683","title":"TCP performance and its improvement over wireless links","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"TCP global synchronization; TCP acceleration; Computer network; Zeta-TCP; Computer science; TCP Friendly Rate Control; CUBIC TCP; TCP Westwood plus; TCP Westwood; TCP tuning; TCP Vegas; H-TCP; Transmission Control Protocol; Network packet","score_opus":0.01064334923741802,"score_gpt":0.19118467473981382,"score_spread":0.1805413255023958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1771986173","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8967643,0.00064140017,0.08122312,0.00296501,0.00046858864,0.00022195859,4.6498275e-7,0.00032735185,0.01738782],"genre_scores_gemma":[0.99011356,0.00021522676,0.00050217746,0.0015097877,0.000079757636,0.000011835366,1.319569e-7,0.0000034017612,0.007564133],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993429,0.000009146198,0.000111992595,0.00021864397,0.00013472499,0.00018254461],"domain_scores_gemma":[0.99965835,0.000024378001,0.000028317307,0.00017983053,0.000031135325,0.00007801631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000073120435,0.00008263331,0.0000804358,0.000025611798,0.00008051198,0.00007809793,0.00023374252,0.00005699749,0.000184533],"category_scores_gemma":[0.0000017647035,0.00006730618,0.00001838455,0.00009922389,0.000012164964,0.00028100004,0.00008760997,0.00012068912,0.00010767496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011472927,0.000022024746,0.00023087123,0.0000057907464,0.0000061937153,0.0000018084401,0.00007807369,0.000041545285,0.00013973723,0.021804668,0.0029426385,0.9747255],"study_design_scores_gemma":[0.00038915267,0.00008339355,0.0010672988,0.0000069947673,0.0000022180159,0.000003839529,0.0000026532407,0.98959565,0.00027435503,0.000026186744,0.008442581,0.000105683044],"about_ca_topic_score_codex":0.0000015761212,"about_ca_topic_score_gemma":0.000001956259,"teacher_disagreement_score":0.9895541,"about_ca_system_score_codex":0.000009528779,"about_ca_system_score_gemma":0.00000581845,"threshold_uncertainty_score":0.27446663},"labels":[],"label_agreement":null},{"id":"W1775851353","doi":"10.1109/hpsr.2000.856663","title":"A flexible multipoint-to-point traffic control algorithm for ABR services in ATM networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer network; Asynchronous Transfer Mode; Bandwidth (computing); Bandwidth allocation; Scheme (mathematics); Flexibility (engineering); Distributed computing; Integrated Services Digital Network; Traffic shaping; Network traffic control","score_opus":0.009663662200737852,"score_gpt":0.21436220147711885,"score_spread":0.204698539276381,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1775851353","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011117129,0.0005727496,0.9916404,0.0036254472,0.00054914894,0.0012157738,0.0000042683173,0.0005501866,0.00073034334],"genre_scores_gemma":[0.8763929,0.000033036362,0.11458956,0.0060778293,0.00039534754,0.0005102414,0.0000030919382,0.000024834593,0.0019731491],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790525,0.00007296486,0.00045029476,0.00064745126,0.00021715835,0.0007068572],"domain_scores_gemma":[0.9987107,0.00034150167,0.0000837908,0.00050848746,0.000101267105,0.0002542437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041004512,0.00026277115,0.00037414013,0.00015907997,0.00012532955,0.0002248622,0.0008839437,0.00012741791,0.000102622966],"category_scores_gemma":[0.000010388169,0.0002356287,0.00014174389,0.0005746722,0.000023999473,0.00040619896,0.00007790907,0.00017383922,0.00015800667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000141752525,0.0001161437,0.000028687196,0.000006239356,0.000019019495,0.000007945039,0.0002604422,0.16314694,0.000003926189,0.0021954824,0.0020682912,0.8321327],"study_design_scores_gemma":[0.0034060618,0.00018024971,0.00017082729,0.000037536563,0.000009325178,0.000009352336,0.000040105704,0.98539096,0.000010630611,0.00009842852,0.0103522455,0.00029426516],"about_ca_topic_score_codex":0.00002547526,"about_ca_topic_score_gemma":0.00020928493,"teacher_disagreement_score":0.8770508,"about_ca_system_score_codex":0.000054116426,"about_ca_system_score_gemma":0.000016375876,"threshold_uncertainty_score":0.9608659},"labels":[],"label_agreement":null},{"id":"W1780816784","doi":"10.1109/ccece.1995.526426","title":"Traffic modeling in a multi-media environment","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Poisson distribution; Markovian arrival process; Computer science; Poisson process; Markov process; Exponential distribution; Pareto distribution; Stochastic process; Traffic generation model; Pareto principle; Compound Poisson process; State (computer science); Data modeling; Stochastic modelling; Process (computing); Generalized Pareto distribution; Markov chain; Real-time computing; Mathematical optimization; Algorithm; Statistics; Mathematics; Machine learning; Extreme value theory","score_opus":0.05044210401813427,"score_gpt":0.20441407762860844,"score_spread":0.15397197361047416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1780816784","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03464312,0.00042497696,0.9627786,0.00083285023,0.00010728826,0.00009167873,1.5662539e-7,0.00014905105,0.0009722477],"genre_scores_gemma":[0.96761143,0.00008125253,0.031498753,0.00029330017,0.000029258814,0.00001583061,2.548729e-7,0.0000038867834,0.00046601926],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992239,0.000027484077,0.00016010305,0.0002472664,0.00013144537,0.00020981266],"domain_scores_gemma":[0.9996348,0.00004308525,0.000015755493,0.0002338945,0.000005152842,0.000067287656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010268004,0.00008116769,0.00009201101,0.00005671565,0.000029164248,0.0000378704,0.00031519926,0.00003725029,0.00017003139],"category_scores_gemma":[0.0000059003214,0.00007277952,0.000032388172,0.00010890287,0.00001145182,0.00015536949,0.000045434488,0.00009193383,0.0003850055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.176984e-7,0.00008720317,0.000023017434,5.4677554e-7,0.0000018845234,0.0000097328475,0.00043792764,0.4690279,0.0000050760136,0.0024700034,0.0001280936,0.52780795],"study_design_scores_gemma":[0.00055446266,0.000009794429,0.000045959776,0.0000041521216,9.747733e-7,0.0000025761808,0.000018480476,0.998713,0.000001486096,0.00004186028,0.00051339593,0.000093852635],"about_ca_topic_score_codex":0.0000030423328,"about_ca_topic_score_gemma":0.000017565955,"teacher_disagreement_score":0.9329683,"about_ca_system_score_codex":0.000025985873,"about_ca_system_score_gemma":0.000004506468,"threshold_uncertainty_score":0.4948595},"labels":[],"label_agreement":null},{"id":"W1786376018","doi":"10.1109/pacrim.1997.620403","title":"Preemptive reservation arbitrated access for transporting variable bit rate isochronous traffic over dual bus metropolitan area networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer network; Reservation; Computer science; Channel access method; Distributed-queue dual-bus; Access control; Statistical time division multiplexing; Queue; Access network; Metropolitan area network; Multiplexing; Asynchronous Transfer Mode; Telecommunications; Local area network; Wireless","score_opus":0.03675049417315353,"score_gpt":0.2548985119099103,"score_spread":0.2181480177367568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1786376018","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049772386,0.00037491383,0.94255596,0.00093929254,0.00050812255,0.00080586824,0.000009122413,0.0006200933,0.0044142674],"genre_scores_gemma":[0.9852352,0.000043865854,0.011000609,0.001093444,0.00036440993,0.00017121568,0.000029973,0.000028750903,0.0020325358],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975434,0.00012350042,0.00060664234,0.0007082832,0.000265392,0.0007527817],"domain_scores_gemma":[0.99834496,0.00045811155,0.0002611363,0.000486402,0.00026484006,0.00018454439],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006410556,0.0003014969,0.00036543663,0.00013622022,0.00034727162,0.00046667553,0.00079651974,0.00018394187,0.000361215],"category_scores_gemma":[0.000060372342,0.0002760269,0.00013946024,0.0010772939,0.000058375143,0.0014032817,0.00005584062,0.00025611525,0.0000112559055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018047617,0.00046395813,0.0007204243,0.000047519916,0.00031234097,0.000032199736,0.000567113,0.7147302,0.00017752494,0.15995218,0.023622246,0.0991938],"study_design_scores_gemma":[0.0014860422,0.00019799102,0.0009014421,0.000035134955,0.000045007662,0.000005157506,0.000045120443,0.99473965,0.000055229983,0.00064095174,0.0014958068,0.00035244573],"about_ca_topic_score_codex":0.000084792984,"about_ca_topic_score_gemma":0.00016759548,"teacher_disagreement_score":0.93546283,"about_ca_system_score_codex":0.00017899935,"about_ca_system_score_gemma":0.00006944778,"threshold_uncertainty_score":0.9999692},"labels":[],"label_agreement":null},{"id":"W1788576967","doi":"10.1109/iscc.1999.780802","title":"A traffic envelope and transmission schedule computation scheme for VoD systems","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Statistical time division multiplexing; Multiplexing; Bandwidth (computing); Computer network; Scheme (mathematics); Multicast; Schedule; Real-time computing; Heuristic; Bandwidth allocation; Computation; Distributed computing; Algorithm; Telecommunications","score_opus":0.014010524411345968,"score_gpt":0.23029996766940228,"score_spread":0.21628944325805632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1788576967","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012490139,0.0008887426,0.98392206,0.00057276513,0.00024417316,0.0004079999,4.2340884e-7,0.00021025413,0.0012634645],"genre_scores_gemma":[0.84111106,0.000015271624,0.1581439,0.000122008314,0.00003038917,0.000045793688,0.0000017462665,0.000006371973,0.0005234318],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913293,0.000059621045,0.00018678904,0.00029685503,0.00012550225,0.00019832824],"domain_scores_gemma":[0.9995275,0.0001221375,0.00004270822,0.0001200058,0.00007808437,0.00010957009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000299257,0.000109840956,0.00014148511,0.000050342947,0.0001373864,0.00015997892,0.000139236,0.000060714003,0.0000046668288],"category_scores_gemma":[0.000013766627,0.000092718496,0.000036776968,0.00015694603,0.000020060714,0.00022207882,0.00000894015,0.00005520458,0.000008922949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010943976,0.000053357413,0.000025313302,0.000040700008,0.000019575738,0.0000015246881,0.0001808916,0.013040597,0.00019898357,0.30892542,0.0012215453,0.67628115],"study_design_scores_gemma":[0.0010232565,0.00007693473,0.000042366526,0.000022045786,0.000005678249,0.000018373068,0.00003692388,0.9714602,0.00007752004,0.00026945118,0.026828114,0.00013908984],"about_ca_topic_score_codex":9.393024e-7,"about_ca_topic_score_gemma":0.0000010532011,"teacher_disagreement_score":0.9584196,"about_ca_system_score_codex":0.000013309177,"about_ca_system_score_gemma":0.000064981105,"threshold_uncertainty_score":0.37809506},"labels":[],"label_agreement":null},{"id":"W1797213545","doi":"","title":"Adaptive AQM controllers for IP routers with a heuristic monitor on TCP flows: Research Articles","year":2006,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Active queue management; Computer science; Queue; Control theory (sociology); Phase margin; Robustness (evolution); Network packet; PID controller; Network congestion; Heuristic; Random early detection; Transmission Control Protocol; Controller (irrigation); Adaptive control; Real-time computing; Computer network; Bandwidth (computing); Control engineering; Control (management); Amplifier","score_opus":0.04531718324307592,"score_gpt":0.3152158434198172,"score_spread":0.26989866017674125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1797213545","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038919274,0.0018437549,0.9460779,0.010035695,0.0011665106,0.0005880899,0.000011140133,0.000055296703,0.0013023803],"genre_scores_gemma":[0.99235624,0.000052290532,0.006618576,0.00009787932,0.0005169574,0.000073210394,0.0000030664232,0.000011227399,0.000270566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99762565,0.00047958625,0.0005461437,0.00015280691,0.0009987629,0.00019706762],"domain_scores_gemma":[0.9949029,0.0015557026,0.0005125984,0.0004463337,0.0025030093,0.00007945066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015897079,0.00011544928,0.00023172735,0.00033262558,0.00016594774,0.00041309954,0.0018298557,0.00004951312,0.0000018150187],"category_scores_gemma":[0.000098053046,0.00008942536,0.00009961636,0.00020677893,0.00008081747,0.00040540568,0.00007090365,0.00027751797,0.000014325911],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025630437,0.000547059,0.00055789703,0.0000069089365,0.00067143945,0.00005081908,0.00083048677,0.36905235,0.00026645054,0.50720024,0.0143623315,0.103890955],"study_design_scores_gemma":[0.0052840784,0.00090547797,0.0010318791,0.0006037323,0.000025029176,0.00012559062,0.0007498675,0.9625668,0.00010900146,0.004070785,0.024315761,0.0002120172],"about_ca_topic_score_codex":0.00006787777,"about_ca_topic_score_gemma":0.000024936986,"teacher_disagreement_score":0.953437,"about_ca_system_score_codex":0.00020265812,"about_ca_system_score_gemma":0.00014001346,"threshold_uncertainty_score":0.39835283},"labels":[],"label_agreement":null},{"id":"W1800215082","doi":"","title":"Stability condition for SIP retransmission mechanism: Analysis and performance evaluation","year":2010,"lang":"en","type":"article","venue":"International Symposium on Performance Evaluation of Computer and Telecommunication Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Retransmission; Computer science; Session Initiation Protocol; Computer network; Server; Crash; Queueing theory; Queue; Real-time computing; Distributed computing; Operating system; Network packet","score_opus":0.02582327517951636,"score_gpt":0.29064855747952784,"score_spread":0.26482528230001146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1800215082","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71559834,0.000080888865,0.28132248,0.00066772057,0.0008469993,0.0009286967,0.00001076557,0.000053621396,0.00049048814],"genre_scores_gemma":[0.99290586,0.0002344462,0.006105462,0.00006607532,0.00015692298,0.000355373,0.00015132621,0.000009186559,0.000015331736],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972556,0.0003483772,0.0006634708,0.0004490564,0.0011200247,0.00016345845],"domain_scores_gemma":[0.9964319,0.0003295455,0.0004569753,0.0006898204,0.0020046663,0.00008711239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00525043,0.00019165293,0.00028980098,0.00028720044,0.00027137456,0.00019507245,0.0006086261,0.0001304142,0.000033340046],"category_scores_gemma":[0.00003731,0.00018090603,0.00008412826,0.00035510433,0.0000744237,0.00077211164,0.00009415867,0.0002072753,0.0000032128662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013839702,0.00018574762,0.006545103,0.00006111275,0.00034886366,3.9747604e-8,0.0006677894,0.03301198,0.002752439,0.034086358,0.00004682019,0.9221554],"study_design_scores_gemma":[0.0014023338,0.0002707788,0.043467756,0.000053886513,0.0002072772,0.0000067836386,0.000014244708,0.95147294,0.002073217,0.00020766507,0.00064898864,0.00017413961],"about_ca_topic_score_codex":0.000013393444,"about_ca_topic_score_gemma":0.000013684948,"teacher_disagreement_score":0.9219812,"about_ca_system_score_codex":0.00009026321,"about_ca_system_score_gemma":0.000110534726,"threshold_uncertainty_score":0.7377134},"labels":[],"label_agreement":null},{"id":"W1802225118","doi":"10.1007/3-540-47728-4_24","title":"Investigations into the Per-Hop Behaviors of Diffserv Networks","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Hop (telecommunications); Computer network","score_opus":0.012275372759223342,"score_gpt":0.2267518450688806,"score_spread":0.21447647230965727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1802225118","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047286344,0.0009636007,0.992384,0.0028144591,0.0016439909,0.00039637307,0.0000012568125,0.00012818167,0.0011952517],"genre_scores_gemma":[0.8880058,0.00022208366,0.107209936,0.0029523883,0.0009740604,0.000036761485,0.0000077152745,0.000043551838,0.00054773997],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99694496,0.000063173466,0.0006137595,0.0010136246,0.0008429627,0.0005215081],"domain_scores_gemma":[0.996946,0.00066264014,0.0003764194,0.0015366254,0.00030161618,0.00017673412],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007531961,0.0004372534,0.00046286985,0.00039628943,0.00041053703,0.00030618787,0.003909474,0.00030574255,0.000029593553],"category_scores_gemma":[0.000048969545,0.00032541377,0.00017697965,0.0008341686,0.0014415653,0.00036352006,0.00087556755,0.0009177558,0.000017023145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023243513,0.000020346915,0.00015187795,0.000006212792,0.000009309354,0.000014284323,0.00080739276,0.20331636,0.000016558139,0.05330632,0.000047227477,0.74230176],"study_design_scores_gemma":[0.00021734186,0.00010998916,0.0002088785,0.00022630699,0.000023003582,0.00003545717,4.7671617e-7,0.92430896,0.000037910944,0.07073675,0.003664238,0.00043071035],"about_ca_topic_score_codex":0.00006093416,"about_ca_topic_score_gemma":0.00026527297,"teacher_disagreement_score":0.8875329,"about_ca_system_score_codex":0.00013334256,"about_ca_system_score_gemma":0.00045856458,"threshold_uncertainty_score":0.9999198},"labels":[],"label_agreement":null},{"id":"W1808893488","doi":"10.1109/cmpcmm.1993.659072","title":"Burst-level Bandwidth Management For Local ATM Networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Bandwidth (computing); Computer science; Computer network; Bandwidth management; Bandwidth allocation; Asynchronous Transfer Mode","score_opus":0.014922260426542414,"score_gpt":0.22521006733305537,"score_spread":0.21028780690651297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1808893488","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000045088218,0.0002165293,0.9834361,0.004326559,0.0003855593,0.00031829448,8.8045266e-7,0.00027262775,0.010998381],"genre_scores_gemma":[0.8091277,0.00003354801,0.1727276,0.0032886912,0.00048999384,0.00009782355,0.0000033867586,0.000009144958,0.014222108],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989722,0.000017428605,0.00018028049,0.00032829485,0.00014865259,0.0003531599],"domain_scores_gemma":[0.9993834,0.00008027319,0.00003547392,0.00035344568,0.00004209304,0.00010533447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020185577,0.00012458311,0.00012356986,0.000036649053,0.000113865644,0.00010271746,0.0005565198,0.00005229097,0.000050662144],"category_scores_gemma":[0.0000019136303,0.00010585313,0.00008100545,0.00015225806,0.000028112305,0.0002101734,0.00010190998,0.00006531905,0.00008084758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070806564,0.00002446871,0.000010395261,0.0000020230354,0.000018961118,0.00000172399,0.000009618181,0.06390936,1.06301954e-7,0.22987548,0.021437176,0.6847036],"study_design_scores_gemma":[0.0007080415,0.00003765754,0.00020695629,0.0000063827374,0.000009390032,0.000003174334,0.000008619395,0.82202655,0.000004472502,0.00057880924,0.17628212,0.00012779472],"about_ca_topic_score_codex":0.0000023701261,"about_ca_topic_score_gemma":0.000025736594,"teacher_disagreement_score":0.81070846,"about_ca_system_score_codex":0.00003740284,"about_ca_system_score_gemma":0.000012599657,"threshold_uncertainty_score":0.4316565},"labels":[],"label_agreement":null},{"id":"W1812846507","doi":"","title":"Congestion in large balanced multirate links","year":2011,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Network congestion; Distributed computing","score_opus":0.01412548109896936,"score_gpt":0.21858768551228816,"score_spread":0.2044622044133188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1812846507","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03731594,0.0013408326,0.9201049,0.008355788,0.000805426,0.0006871057,0.000025758996,0.0006626757,0.030701574],"genre_scores_gemma":[0.94335335,0.0004832568,0.05172636,0.00029473024,0.000038944,0.00014959725,0.0001361383,0.000032530235,0.0037850684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9930132,0.0042721624,0.0006579404,0.0011167508,0.00037777878,0.0005621716],"domain_scores_gemma":[0.994561,0.00087367505,0.0005193752,0.002495891,0.0013416342,0.0002084202],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0053318497,0.00039540915,0.00048049813,0.00026071802,0.0002096314,0.0004362043,0.0024608795,0.0006629893,0.00007876462],"category_scores_gemma":[0.0006302676,0.00043258432,0.00018765668,0.00048204587,0.00011871995,0.0002790747,0.0017018422,0.0015258589,0.00011486732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022219294,0.00091576116,0.004510254,0.00010080264,0.000069624926,0.000030937692,0.009372641,0.0007618641,0.00030642576,0.5558164,0.0008094711,0.42728356],"study_design_scores_gemma":[0.0026783124,0.0000010719574,0.022546254,0.002666244,0.00003779273,0.000012874043,0.000051608007,0.9392136,0.0036337185,0.017514879,0.010503927,0.0011397494],"about_ca_topic_score_codex":0.00044772003,"about_ca_topic_score_gemma":0.002258077,"teacher_disagreement_score":0.9384517,"about_ca_system_score_codex":0.00012062791,"about_ca_system_score_gemma":0.0003389049,"threshold_uncertainty_score":0.9998126},"labels":[],"label_agreement":null},{"id":"W1824438180","doi":"10.1109/glocom.2001.965895","title":"Optimal buffer partitioning for multiclass Markovian traffic sources","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quality of service; Computer science; Markov process; Buffer overflow; Buffer (optical fiber); Packet loss; Markov chain; Computer network; Network packet; Distributed computing; Mathematics","score_opus":0.01863013838544217,"score_gpt":0.21191956710418372,"score_spread":0.19328942871874155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1824438180","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05718901,0.00022661574,0.9355321,0.0038426535,0.00030307824,0.00025009178,0.0000012820932,0.00047968334,0.0021755032],"genre_scores_gemma":[0.9199458,0.000008087108,0.074212775,0.0006426575,0.00018091658,0.00007649056,0.000001206176,0.000007993775,0.0049241115],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999041,0.0000310206,0.00017374224,0.00029805588,0.00013511415,0.0003210707],"domain_scores_gemma":[0.99937326,0.00018482265,0.000041140283,0.00023734068,0.000056520243,0.00010693872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013987532,0.00011380868,0.0001217286,0.000043010652,0.00019525508,0.00019701723,0.00036758327,0.000050175295,0.00014631693],"category_scores_gemma":[0.000020319612,0.00009988513,0.000088029024,0.00013140358,0.000033110176,0.00027342615,0.000036114667,0.00006736025,0.00009308155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000978631,0.000110237,0.000095467156,0.0000075502867,0.000030489597,0.000005140251,0.00054413977,0.06088503,0.000027423559,0.02369013,0.015701778,0.8988928],"study_design_scores_gemma":[0.0006485233,0.000067698296,0.00013070749,0.000006841653,0.000007032275,0.000006356252,0.00003258661,0.9639478,0.000048167858,0.00003948959,0.03491979,0.00014502152],"about_ca_topic_score_codex":0.0000013191263,"about_ca_topic_score_gemma":0.000009797364,"teacher_disagreement_score":0.90306276,"about_ca_system_score_codex":0.0000152494395,"about_ca_system_score_gemma":0.000008809636,"threshold_uncertainty_score":0.40731975},"labels":[],"label_agreement":null},{"id":"W1832078002","doi":"10.1109/icce.2002.1013934","title":"Evaluation of WAP network configuration supporting enhanced security","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Wireless Application Protocol; Computer network; Wireless Transport Layer Security; The Internet; Wireless network; Security association; Wireless; World Wide Web; Telecommunications; Network Access Control; Wi-Fi; Operating system; Cloud computing security; Cloud computing","score_opus":0.01897397990269469,"score_gpt":0.27450294952719756,"score_spread":0.2555289696245029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1832078002","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03476917,0.000121553036,0.8904222,0.00016414883,0.00039083685,0.00024347648,1.3996694e-7,0.00008917688,0.07379929],"genre_scores_gemma":[0.99559456,0.000003850171,0.0040708426,0.00012582453,0.00006241579,0.000019925537,0.0000015990641,0.0000028463564,0.000118161915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984629,0.0003237876,0.0002956894,0.00020476202,0.0005203711,0.00019245855],"domain_scores_gemma":[0.9989137,0.00008968209,0.00017208906,0.00025108588,0.00052864384,0.000044778048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029286921,0.000074649586,0.00011749007,0.000023425348,0.000066346685,0.000036805195,0.00017314637,0.000044406253,0.0002901471],"category_scores_gemma":[0.00017748999,0.00006873692,0.00004126394,0.00024282535,0.00001716806,0.00024206133,0.000013803275,0.000058727626,0.000021494663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024738213,0.000030940166,0.0000680468,0.0000031761138,0.0000194154,2.8732538e-7,0.00027980885,0.019595088,0.0006674764,0.5592703,0.0009251922,0.41913778],"study_design_scores_gemma":[0.0006918835,0.000048499984,0.00021737067,0.000012425224,0.000034385106,0.0000022230795,0.000045221845,0.9470587,0.013537981,0.037429422,0.0007956532,0.00012625591],"about_ca_topic_score_codex":0.00000355774,"about_ca_topic_score_gemma":0.000017228407,"teacher_disagreement_score":0.9608254,"about_ca_system_score_codex":0.000026196041,"about_ca_system_score_gemma":0.00019013442,"threshold_uncertainty_score":0.31769073},"labels":[],"label_agreement":null},{"id":"W1834079802","doi":"10.1109/ipccc.2002.995179","title":"Fast backward congestion notification mechanism for TCP congestion control","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer network; Computer science; TCP Friendly Rate Control; TCP global synchronization; TCP acceleration; TCP tuning; Network congestion; CUBIC TCP; TCP Westwood plus; Explicit Congestion Notification; Zeta-TCP; Transmission Control Protocol; Throughput; Node (physics); TCP delayed acknowledgment; Network packet; Wireless; Telecommunications; Engineering","score_opus":0.012716949272672218,"score_gpt":0.22001634212891127,"score_spread":0.20729939285623905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1834079802","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021688098,0.00006020194,0.9877714,0.004146665,0.0012582511,0.0009181647,0.0000068313516,0.00050309935,0.0031665557],"genre_scores_gemma":[0.9599186,0.000016356691,0.03611455,0.0013417789,0.00012962382,0.00030570943,0.000012742967,0.000016938078,0.002143669],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982271,0.00016944268,0.000376571,0.00057127344,0.0002642062,0.00039141005],"domain_scores_gemma":[0.99827987,0.0003548572,0.00016699644,0.00051201426,0.0005239158,0.00016237643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063258386,0.00022165698,0.00024824464,0.000100359764,0.00022650222,0.00021285532,0.0004078814,0.00015743278,0.00006450051],"category_scores_gemma":[0.00022638621,0.0002093259,0.000116580246,0.00023918087,0.000041588766,0.00047397806,0.000016403008,0.00012193476,0.00017578673],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019046389,0.00004756934,0.000046423273,0.000005873164,0.000022297265,8.6943686e-7,0.000032460277,0.0009317051,0.0008035552,0.86178863,0.0011687756,0.13513279],"study_design_scores_gemma":[0.007135349,0.00045790258,0.00090148416,0.00003939952,0.000100894234,0.00004928467,0.00010496273,0.90238893,0.0046159327,0.06086605,0.022478275,0.00086153165],"about_ca_topic_score_codex":0.000005711822,"about_ca_topic_score_gemma":0.00001705615,"teacher_disagreement_score":0.95774984,"about_ca_system_score_codex":0.00007322924,"about_ca_system_score_gemma":0.000121627905,"threshold_uncertainty_score":0.8536062},"labels":[],"label_agreement":null},{"id":"W1834096796","doi":"10.1109/ecumn.2000.880789","title":"A new network service environment using active network","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Hatch (Canada)","funders":"","keywords":"Computer science; Network management station; Computer network; Network service; Service (business); Network simulation; Network information system; Network architecture; Network traffic control; Core network; The Internet; Distributed computing; World Wide Web","score_opus":0.022574743138934338,"score_gpt":0.1963891881468582,"score_spread":0.17381444500792387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1834096796","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000944681,0.0006793932,0.9860103,0.0032749348,0.00054638996,0.00018298821,3.7525143e-7,0.000261363,0.008099585],"genre_scores_gemma":[0.3601515,0.00020323307,0.609478,0.014984297,0.005192546,0.0000243232,0.0000032868697,0.000042595897,0.0099202],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985556,0.00007027438,0.00019793061,0.00039994792,0.00024161676,0.00053461664],"domain_scores_gemma":[0.99909717,0.00009122185,0.00008106403,0.00048908807,0.00002159534,0.00021987014],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000115767376,0.0001762145,0.00017649468,0.000019300336,0.00020324993,0.00010272161,0.0005923183,0.00007298808,0.0012709012],"category_scores_gemma":[0.000002096646,0.00016341092,0.000063791456,0.00042853024,0.000012501521,0.00033149865,0.00020189176,0.00014662695,0.0010548851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005760271,0.00002250075,0.00007745423,0.0000012062869,0.0000356425,0.00000664589,0.00014591639,0.43701723,0.000011842921,0.020879041,0.045858964,0.4959378],"study_design_scores_gemma":[0.00036316636,0.000028255801,0.00014620072,0.000014941107,0.00001202973,0.000011150249,0.0000067180913,0.91279423,0.000005788579,0.0010076321,0.0854044,0.00020551245],"about_ca_topic_score_codex":0.000045034078,"about_ca_topic_score_gemma":0.000019774165,"teacher_disagreement_score":0.49573228,"about_ca_system_score_codex":0.00005954291,"about_ca_system_score_gemma":0.000027699234,"threshold_uncertainty_score":0.9997229},"labels":[],"label_agreement":null},{"id":"W1841052182","doi":"10.1109/ccece.2001.933705","title":"Delivering end-to-end quality of service through an Internet protocol based differentiated services domain","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Royal Military College of Canada","funders":"","keywords":"Quality of service; Computer science; Computer network; Router; Differentiated services; Scalability; The Internet; End-to-end principle; Internet Protocol; Mobile QoS; IPv6; Distributed computing; Service provider; Service (business); Operating system","score_opus":0.04148254231839127,"score_gpt":0.28662826415057147,"score_spread":0.2451457218321802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1841052182","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19858326,0.0000071617715,0.7843198,0.0013607155,0.00011009016,0.012169907,0.0000051096413,0.00042516398,0.0030187801],"genre_scores_gemma":[0.9594025,2.7306837e-7,0.03181185,0.0030974057,0.00004663103,0.0055137365,0.000004382469,0.000011090275,0.00011212074],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812543,0.00024989812,0.00047145327,0.00047874628,0.00036960194,0.00030486714],"domain_scores_gemma":[0.99873674,0.00009968915,0.00016638647,0.0006603057,0.00019011027,0.0001467876],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000279102,0.00020177447,0.00028042687,0.000060906626,0.000062124775,0.00012908496,0.0011166141,0.000071864255,0.0010519701],"category_scores_gemma":[0.0000039971087,0.00017121842,0.000065066306,0.0004709044,0.000021897327,0.00068497966,0.00019597281,0.00010846437,0.00008091162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006934761,0.0038533844,0.009901311,0.0016370352,0.00038915142,0.00004240245,0.022165952,0.0154114505,0.013666633,0.21939936,0.0010398681,0.7118],"study_design_scores_gemma":[0.0019115084,0.000223753,0.0058735786,0.00009078589,0.000007759579,0.0000018907831,0.000076403565,0.98564595,0.0023573544,0.00044585086,0.003034997,0.00033018523],"about_ca_topic_score_codex":0.0013938722,"about_ca_topic_score_gemma":0.0021253303,"teacher_disagreement_score":0.97023445,"about_ca_system_score_codex":0.000025906236,"about_ca_system_score_gemma":0.000018818186,"threshold_uncertainty_score":0.9998612},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012635722051332173,"score_gpt":0.19633604218965053,"score_spread":0.18370032013831836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1841750659","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.0135327e-7,0.00022816547,0.5291066,0.0029209333,0.0026223995,0.00025545867,0.0000011046471,0.00044331825,0.4644215],"genre_scores_gemma":[0.0018678103,0.000044126,0.011181802,0.002454846,0.012026951,0.00001532203,0.0000075528997,0.000039609087,0.972362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99824107,0.000016310974,0.0003271657,0.00078630185,0.00027135867,0.00035776832],"domain_scores_gemma":[0.9983955,0.000053449603,0.0001232123,0.0010379497,0.00015283408,0.00023707667],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00021091154,0.00033020822,0.0003465153,0.000100979865,0.000105607425,0.000108494496,0.00083431054,0.0002605675,0.0021054377],"category_scores_gemma":[0.000009303138,0.00030424344,0.0001426786,0.00007471418,0.000028207714,0.0001642349,0.0002511434,0.00029390864,0.004286122],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062607573,0.0000033848207,3.6449987e-7,0.0000015937105,0.000024524157,0.000004047496,0.000014960537,0.0028948346,2.495899e-7,0.5504941,0.2184916,0.22806412],"study_design_scores_gemma":[0.0001137685,0.000094672985,0.0000033080398,0.0000236659,0.000020634423,0.00000787496,2.6554525e-7,0.011176165,0.0000012609985,0.03319012,0.9550063,0.0003619628],"about_ca_topic_score_codex":0.0000034825741,"about_ca_topic_score_gemma":0.000013801764,"teacher_disagreement_score":0.7365147,"about_ca_system_score_codex":0.000051437768,"about_ca_system_score_gemma":0.00007665824,"threshold_uncertainty_score":0.999941},"labels":[],"label_agreement":null},{"id":"W1846037674","doi":"10.1109/icii.2001.983565","title":"DiffServ-enabled adaptive traffic engineering over MPLS","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Multiprotocol Label Switching; Differentiated services; Computer network; Quality of service; Traffic engineering; Internet traffic engineering; Network packet; The Internet; Path (computing); Distributed computing; Network traffic control","score_opus":0.011965803763645191,"score_gpt":0.17579470745307402,"score_spread":0.16382890368942882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1846037674","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03344189,0.00044744156,0.9541426,0.0011982694,0.00055110815,0.00017997561,5.78832e-7,0.0009898617,0.009048319],"genre_scores_gemma":[0.9879387,0.000017772114,0.0077473675,0.00047063408,0.00013776131,0.000017732114,2.751938e-7,0.0000083711,0.003661386],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999079,0.000020097827,0.0001519041,0.00028634208,0.00016759332,0.00029507585],"domain_scores_gemma":[0.9994132,0.00009487766,0.000029711666,0.00031674677,0.000034134813,0.000111355526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007866998,0.00013195637,0.00013487838,0.000056827586,0.00006502314,0.00010120713,0.00043235652,0.000051469095,0.00044906512],"category_scores_gemma":[0.0000099205,0.00011424007,0.000066867346,0.00027716788,0.00001113301,0.0003294787,0.00005982735,0.00011556125,0.0002748193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005578361,0.00012188968,0.000034700057,0.000005150525,0.000054205633,0.000038406368,0.00037609966,0.15811417,0.00009794696,0.29026464,0.01851388,0.53237337],"study_design_scores_gemma":[0.00042146957,0.000042291435,0.00031565074,0.000008306778,0.000004203731,0.0000072815824,0.0000055807686,0.99170494,0.000016374313,0.000064124724,0.0072511192,0.0001586741],"about_ca_topic_score_codex":0.0000025685852,"about_ca_topic_score_gemma":0.0000036026959,"teacher_disagreement_score":0.9544968,"about_ca_system_score_codex":0.00002539059,"about_ca_system_score_gemma":0.000007844934,"threshold_uncertainty_score":0.4916948},"labels":[],"label_agreement":null},{"id":"W1847742227","doi":"10.1109/iccnmc.2001.962624","title":"Fault recovery for a distributed QoS-based multicast routing algorithm","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Multicast; Protocol Independent Multicast; Computer science; Distance Vector Multicast Routing Protocol; Source-specific multicast; Xcast; Computer network; Distributed computing; Pragmatic General Multicast; Inter-domain; Node (physics); IP multicast; Engineering","score_opus":0.01933259859096771,"score_gpt":0.2263920931293108,"score_spread":0.2070594945383431,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1847742227","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019456165,0.000064275504,0.99514157,0.0026847627,0.0005125323,0.00027413477,0.000023811432,0.00041127947,0.00069307536],"genre_scores_gemma":[0.63197756,0.0000045372185,0.3643051,0.0015023458,0.00034958488,0.0000952877,0.000019679264,0.000012308502,0.001733597],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998895,0.00003318158,0.00021881866,0.0003465618,0.0001540656,0.00035240728],"domain_scores_gemma":[0.999015,0.00037305843,0.00006408437,0.000326278,0.000113701586,0.00010789085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001678538,0.00013129454,0.00015196085,0.000039154216,0.00015662657,0.0001652673,0.00040665432,0.000062654726,0.000079823796],"category_scores_gemma":[0.00007492764,0.00011583183,0.000112511465,0.00023445165,0.00002202178,0.00021198152,0.000042028045,0.00008210587,0.000082949715],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042429006,0.000066352804,0.000017198336,0.0000025155293,0.000012435269,0.0000044081858,0.00002099219,0.0025253098,0.000009694299,0.0040391902,0.008999671,0.984298],"study_design_scores_gemma":[0.0011329557,0.00008666935,0.00004124912,0.000011522695,0.000007553306,0.0000035605046,0.000008979275,0.98280567,0.000073401476,0.00010978289,0.015554936,0.00016372233],"about_ca_topic_score_codex":0.000007502838,"about_ca_topic_score_gemma":0.0000054130564,"teacher_disagreement_score":0.98413426,"about_ca_system_score_codex":0.000036224603,"about_ca_system_score_gemma":0.000021216594,"threshold_uncertainty_score":0.47234848},"labels":[],"label_agreement":null},{"id":"W1850618887","doi":"10.1002/oca.717","title":"Decentralized control strategies for dynamic routing","year":2002,"lang":"en","type":"article","venue":"Optimal Control Applications and Methods","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Robustness (evolution); Queue; Computation; Node (physics); Routing (electronic design automation); Distributed computing; Dynamic network analysis; Adaptive routing; Control (management); Static routing; Computer network; Control theory (sociology); Routing protocol; Engineering; Algorithm","score_opus":0.016377645477758815,"score_gpt":0.31767100650944363,"score_spread":0.3012933610316848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1850618887","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014460625,0.0027822799,0.99269027,0.0020208266,0.00008554517,0.0012887077,0.000016007405,0.00023636133,0.0007354053],"genre_scores_gemma":[0.5207593,0.00009801941,0.47732174,0.00047778676,0.000051157116,0.0011316969,0.0000019975487,0.000009922705,0.00014837668],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984781,0.00018393631,0.00033495587,0.0004827786,0.00010542356,0.00041481023],"domain_scores_gemma":[0.99824345,0.00090170215,0.0001416018,0.00040556918,0.00014596748,0.0001616986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007479272,0.00019830314,0.00033891076,0.00006190453,0.00036594813,0.000340879,0.00041565497,0.00009138239,0.000022776769],"category_scores_gemma":[0.000036861224,0.00018182343,0.00011790172,0.00020876159,0.00007376755,0.00032563604,0.00003057838,0.0001223941,0.000008808596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022746908,0.000038729428,0.000007954498,0.0000061503965,0.000045734505,3.422462e-7,0.000066041335,0.0023654976,0.0006497977,0.27778992,0.00008761041,0.71891946],"study_design_scores_gemma":[0.0031734954,0.00006903906,0.00008447354,0.0000053070435,0.000065222805,0.000010232839,0.000054682296,0.9452546,0.000009523163,0.0029906041,0.04808186,0.00020092276],"about_ca_topic_score_codex":0.0000034970062,"about_ca_topic_score_gemma":0.0000023553068,"teacher_disagreement_score":0.94288915,"about_ca_system_score_codex":0.000024330548,"about_ca_system_score_gemma":0.0000366701,"threshold_uncertainty_score":0.7414545},"labels":[],"label_agreement":null},{"id":"W1860007637","doi":"10.1007/978-3-319-15657-6_15","title":"Modeling Network Traffic","year":2015,"lang":"en","type":"book-chapter","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Burstiness; Traffic generation model; Autocorrelation; Computer science; Traffic congestion reconstruction with Kerner's three-phase theory; Traffic flow (computer networking); Computer network; Network packet; Real-time computing; Traffic congestion; Statistics; Mathematics; Engineering","score_opus":0.038804018192668016,"score_gpt":0.22599098214331995,"score_spread":0.18718696395065193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1860007637","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.2913255e-7,0.0022938726,0.4803754,0.00035796955,0.00075229094,0.00012075641,6.8224307e-7,0.00050628337,0.5155919],"genre_scores_gemma":[0.011383109,0.00014160434,0.015062294,0.0007553289,0.0019138955,0.000010544819,0.000010743261,0.000049898863,0.9706726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823815,0.000015958096,0.00034975802,0.0005807935,0.00043697015,0.00037838577],"domain_scores_gemma":[0.9986829,0.00004597662,0.00008487107,0.0007530462,0.00020068906,0.00023250922],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00033149475,0.0003454366,0.00039283023,0.00006789503,0.00009196495,0.0001522995,0.0010270202,0.0003240181,0.00022367339],"category_scores_gemma":[0.000004372118,0.00031228864,0.00016816113,0.000045902318,0.000027419108,0.0001699238,0.00019442357,0.00039469692,0.00085923536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016465873,0.0000018193953,1.3310997e-8,0.0000012643982,0.000017523536,0.000008934704,0.0000082975785,0.3429637,6.740522e-9,0.4207702,0.0279432,0.20828341],"study_design_scores_gemma":[0.00015704804,0.00002729761,1.1367165e-8,0.000040780276,0.000015937861,0.00001081174,6.0352727e-7,0.7136912,7.894249e-9,0.03158399,0.25419915,0.0002732022],"about_ca_topic_score_codex":0.000001574244,"about_ca_topic_score_gemma":0.000021532811,"teacher_disagreement_score":0.4653131,"about_ca_system_score_codex":0.00006043138,"about_ca_system_score_gemma":0.00023614719,"threshold_uncertainty_score":0.99993294},"labels":[],"label_agreement":null},{"id":"W1866989647","doi":"10.1109/pacrim.1999.799548","title":"Performance evaluation of a multicast packet switch employing dynamic random early detection","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Multicast; Computer science; Computer network; Unicast; Network packet; Robustness (evolution); Packet loss; Source-specific multicast; Xcast; Distributed computing","score_opus":0.01703771328294264,"score_gpt":0.2489519905180372,"score_spread":0.23191427723509456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1866989647","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5710792,0.000042644944,0.42707762,0.000029076667,0.00018134106,0.00018449708,1.0397683e-7,0.00006501592,0.0013405359],"genre_scores_gemma":[0.9959608,0.000009423857,0.0038379468,0.000028589124,0.000013541685,0.00003780024,3.243066e-7,0.0000052685855,0.00010634993],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877995,0.00018814874,0.00022589497,0.00021916015,0.00041518075,0.00017166535],"domain_scores_gemma":[0.99921566,0.0000941321,0.00008777577,0.00027667702,0.00027992204,0.0000458597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011821232,0.00009183652,0.00013005486,0.00007236114,0.000090560345,0.00004391636,0.0001800601,0.000044833247,0.000035668938],"category_scores_gemma":[0.00008444646,0.000079853824,0.00004900305,0.00028678545,0.000021034179,0.00034147972,0.000017596978,0.00007760212,0.00003134089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024412373,0.000033616125,0.0013207374,0.00000456662,0.000016411748,2.8913163e-7,0.00021986615,0.005424146,0.0014513194,0.0010605067,0.000005534446,0.9904386],"study_design_scores_gemma":[0.0024318723,0.00007516103,0.010231189,0.0000141709015,0.00002356416,0.0000064661785,0.000018842973,0.9852483,0.0016685696,0.00014401689,0.00004166424,0.00009616794],"about_ca_topic_score_codex":0.000009035954,"about_ca_topic_score_gemma":0.000032967357,"teacher_disagreement_score":0.99034244,"about_ca_system_score_codex":0.00004471131,"about_ca_system_score_gemma":0.00007765506,"threshold_uncertainty_score":0.32563445},"labels":[],"label_agreement":null},{"id":"W1869344070","doi":"10.1109/inw.2001.915297","title":"Intelligent network services through active flow manipulation","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Computer science; Node (physics); Computer network; Flow control (data); Key (lock); Forwarding plane; Distributed computing; Intelligent Network; The Internet; Engineering; Operating system","score_opus":0.02485502302018029,"score_gpt":0.22470217303535805,"score_spread":0.19984715001517778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1869344070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00090194854,0.00037348564,0.9644827,0.0016443396,0.0006302385,0.00013864654,2.6809428e-7,0.00034666757,0.031481706],"genre_scores_gemma":[0.9499351,0.00010089585,0.04534172,0.0021280083,0.00045590606,0.0000156316,0.0000024996411,0.000006742498,0.0020135392],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991124,0.00004125406,0.00015754307,0.00027159095,0.00017218187,0.00024497724],"domain_scores_gemma":[0.999473,0.000062093786,0.000053313594,0.000306277,0.000053001957,0.000052311378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006583833,0.00011002089,0.00010591402,0.00001712848,0.00012299321,0.00011496908,0.00041980448,0.000050685685,0.0004734581],"category_scores_gemma":[0.0000016826699,0.00009396713,0.000049645492,0.00026461732,0.000012694648,0.00057181856,0.00008248842,0.00008443087,0.00056136504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036055458,0.000031965315,0.00008611639,0.0000033255335,0.000020337513,0.000003905759,0.0006701336,0.0615717,0.0000015774904,0.10238112,0.0043549906,0.8308712],"study_design_scores_gemma":[0.00013116507,0.000028735385,0.00029394054,0.0000116917845,0.000004923117,0.0000045722727,0.00002797705,0.9671127,0.000033083696,0.0043523856,0.027880343,0.00011843326],"about_ca_topic_score_codex":0.000014800592,"about_ca_topic_score_gemma":0.000042013005,"teacher_disagreement_score":0.9490331,"about_ca_system_score_codex":0.000024354202,"about_ca_system_score_gemma":0.0000047437243,"threshold_uncertainty_score":0.72154},"labels":[],"label_agreement":null},{"id":"W187246879","doi":"","title":"Active Networks as a Flexible Approach to deploy QoS Policy Based Management","year":2001,"lang":"en","type":"preprint","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Interoperability; Computer science; Quality of service; Network management; Computer network; Active networking; Merge (version control); Common Management Information Protocol; Network packet; Negotiation; Network management application; Network management station; Network architecture; World Wide Web","score_opus":0.015181524983962903,"score_gpt":0.25641417309764697,"score_spread":0.24123264811368406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W187246879","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006475508,0.00008563772,0.7422291,0.003171552,0.0006188874,0.0012058272,0.0000014561019,0.0014685822,0.25115418],"genre_scores_gemma":[0.65087634,0.00020091838,0.29759035,0.02417742,0.0026094005,0.0020965876,0.000028319211,0.00013305106,0.022287626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966906,0.00014983182,0.0003961466,0.001424713,0.00054259255,0.00079612073],"domain_scores_gemma":[0.9974786,0.00008510148,0.0001586262,0.0017082819,0.00013070008,0.00043866085],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031456846,0.00051985716,0.00048109263,0.00047698125,0.00017817685,0.0005109255,0.0024537263,0.0003177912,0.00005048003],"category_scores_gemma":[0.000013708901,0.0004914066,0.00024738768,0.0010171698,0.000035182773,0.000145748,0.001972995,0.0006486486,0.00031273364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003317455,0.00014233576,0.0000062757963,0.00001925512,0.00009694444,0.000017953313,0.0000513579,0.44491333,1.4323527e-7,0.14944886,0.009192406,0.39607796],"study_design_scores_gemma":[0.0006899078,0.00006279226,0.00020914643,0.000102202655,0.00004194246,0.000009044636,0.00003453336,0.96431,0.000011009088,0.0027774042,0.031128252,0.00062379317],"about_ca_topic_score_codex":0.0002517096,"about_ca_topic_score_gemma":0.00001274519,"teacher_disagreement_score":0.6508116,"about_ca_system_score_codex":0.0002691176,"about_ca_system_score_gemma":0.00035849324,"threshold_uncertainty_score":0.9997538},"labels":[],"label_agreement":null},{"id":"W1873705278","doi":"10.1109/icc.1996.541375","title":"Migrating to ATM in the local area","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer network; Local area network; Computer science; Ethernet; Asynchronous Transfer Mode; Distributed-queue dual-bus; ATM adaptation layer; Throughput; Backbone network; LAN switching; Popularity; Operating system; Burst switching; Transmission delay; Network packet","score_opus":0.02151024459518656,"score_gpt":0.20305527360615305,"score_spread":0.1815450290109665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1873705278","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010208256,0.00007854473,0.9510272,0.015762614,0.00008417467,0.000093813724,6.094303e-8,0.000073486044,0.022671834],"genre_scores_gemma":[0.9895694,0.0000017378461,0.0045690555,0.00486925,0.000041513398,0.000014567001,5.778144e-8,0.000001333703,0.0009330611],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994769,0.000038243787,0.00008831827,0.00013500788,0.00011729193,0.00014424209],"domain_scores_gemma":[0.9996193,0.000106872016,0.000010139381,0.00021732347,0.000012577195,0.00003377895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001503601,0.000047907946,0.00004922074,0.000022615277,0.000043438547,0.00007591177,0.0004687761,0.000016113267,0.00006833199],"category_scores_gemma":[0.000010723224,0.00002928717,0.000019128647,0.00028723275,0.000009700963,0.000081557206,0.000035335495,0.000063826614,0.00020690817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.272826e-7,0.000021526363,0.00024418187,3.4254052e-7,0.0000011866634,0.000011135524,0.00087844447,0.0031623573,0.000004510489,0.056805443,0.019755002,0.91911536],"study_design_scores_gemma":[0.00011936201,0.000029394076,0.0005758855,0.0000049179544,5.8399644e-7,0.000007323735,0.0001430792,0.9838653,0.0000069604594,0.00017035921,0.015019476,0.000057327048],"about_ca_topic_score_codex":0.000018434022,"about_ca_topic_score_gemma":0.00020720014,"teacher_disagreement_score":0.980703,"about_ca_system_score_codex":0.000008565157,"about_ca_system_score_gemma":0.000004110895,"threshold_uncertainty_score":0.2659455},"labels":[],"label_agreement":null},{"id":"W1877376082","doi":"10.1109/icc.1999.765562","title":"Towards an efficient ATM best effort video delivery service","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer network; Network packet; Payload (computing); Real-time computing; Quality of service; Asynchronous Transfer Mode; Packet loss; Throughput; Frame (networking); Service (business); Telecommunications","score_opus":0.013242134106049906,"score_gpt":0.22582397795962741,"score_spread":0.2125818438535775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1877376082","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25923175,0.00023308871,0.6915129,0.0012733776,0.0008487013,0.00023522417,7.611547e-7,0.00049174146,0.04617245],"genre_scores_gemma":[0.97727793,0.000009357103,0.01839856,0.0033733156,0.000079351885,0.000018262033,0.0000015154774,0.000009073591,0.00083265506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986405,0.00006901541,0.00020399461,0.00043518597,0.00029835524,0.00035296736],"domain_scores_gemma":[0.99891365,0.000041922114,0.00004373118,0.0006076497,0.00017685728,0.00021619698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003181032,0.0001599663,0.00015249017,0.000050515744,0.00014669736,0.00016028325,0.0006525776,0.00006786704,0.0001341647],"category_scores_gemma":[0.00001057982,0.00013645386,0.0000578167,0.00043596674,0.000019955809,0.00026023938,0.00007691572,0.00010559254,0.0004899239],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012910594,0.00039615147,0.00042533068,0.000011212838,0.000033826436,0.000036196656,0.00040289463,0.046549503,0.000087743996,0.49971825,0.0015229936,0.45080298],"study_design_scores_gemma":[0.00076948607,0.00016400087,0.0007028124,0.000015268273,0.000016495791,0.0000422533,0.00007632991,0.9630008,0.00040296357,0.00048486772,0.03397299,0.0003517382],"about_ca_topic_score_codex":0.000084670595,"about_ca_topic_score_gemma":0.00010019216,"teacher_disagreement_score":0.9164513,"about_ca_system_score_codex":0.000035298788,"about_ca_system_score_gemma":0.00015043332,"threshold_uncertainty_score":0.6297144},"labels":[],"label_agreement":null},{"id":"W1882832143","doi":"10.1109/ipccc.2002.995146","title":"Providing packet-loss guarantees in DiffServ architectures","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Quality of service; Computer network; Computer science; Differentiated services; Network packet; Differentiated service; Packet loss; Service (business); Reservation; Service provider","score_opus":0.007732223889401527,"score_gpt":0.20948324091319703,"score_spread":0.2017510170237955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1882832143","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39950526,0.00040794598,0.5803475,0.0022858141,0.00037218787,0.00025639092,2.7586367e-7,0.00033930351,0.016485333],"genre_scores_gemma":[0.99110967,0.0000074850736,0.0075736903,0.0006196261,0.00003410107,0.000019873736,1.8888639e-7,0.0000046627624,0.00063071714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990595,0.000098301454,0.00016060976,0.00026945537,0.00014408657,0.00026806784],"domain_scores_gemma":[0.99951327,0.000114195944,0.000029286657,0.00027150367,0.000019649602,0.00005211711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000220737,0.00010417919,0.00011920773,0.000080679405,0.000058736026,0.000086576765,0.00037080032,0.000038159593,0.0000327297],"category_scores_gemma":[0.0000414053,0.000081298815,0.00004074307,0.00028139527,0.000024834782,0.00009817803,0.000037567992,0.000120568504,0.000031089574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000077679615,0.000078749414,0.009424128,0.000007953072,0.00000959952,0.000046952675,0.0006568454,0.002612312,0.000117895965,0.6740495,0.00045985729,0.31252843],"study_design_scores_gemma":[0.0063193073,0.00037731064,0.039347824,0.00022043946,0.000017412745,0.0002882933,0.0004121176,0.7588739,0.006265955,0.13505773,0.050926697,0.0018930366],"about_ca_topic_score_codex":0.000011161806,"about_ca_topic_score_gemma":0.00009408558,"teacher_disagreement_score":0.7562616,"about_ca_system_score_codex":0.000015936048,"about_ca_system_score_gemma":0.00004376384,"threshold_uncertainty_score":0.33152696},"labels":[],"label_agreement":null},{"id":"W1883247542","doi":"10.1109/pacrim.1993.407300","title":"A congestion control mechanism for interconnected high-speed networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mechanism (biology); Network congestion; Computer science; Computer network; Distributed computing","score_opus":0.012755822496993917,"score_gpt":0.1967801370747003,"score_spread":0.18402431457770638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1883247542","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018159548,0.00011803114,0.9883383,0.0062105395,0.0011693011,0.00061670586,0.000002861642,0.00075380615,0.00097450765],"genre_scores_gemma":[0.9831421,0.00002165781,0.0111233685,0.0034670488,0.0003269165,0.00009590956,0.000004030521,0.00001467241,0.0018042962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986083,0.00007827326,0.00029531462,0.00044371423,0.00015734753,0.00041703117],"domain_scores_gemma":[0.9987023,0.00041143782,0.00009886689,0.00041054186,0.00023390542,0.00014295956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020940123,0.00019373638,0.00025994683,0.00007697747,0.00014665596,0.0001847844,0.0005676858,0.00013217346,0.00020115482],"category_scores_gemma":[0.00007359988,0.0001712604,0.00011125661,0.00022964577,0.000028302185,0.00033304517,0.000045276618,0.00013286223,0.00009062477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020946081,0.000051544306,0.000008051121,0.0000023912191,0.00004348669,0.000003858864,0.000040594015,0.003821559,0.0001315134,0.8283599,0.0060327104,0.16148345],"study_design_scores_gemma":[0.0028949596,0.00020690875,0.00006273924,0.000013091406,0.000023331637,0.000012291914,0.000007606574,0.9891473,0.000056695793,0.006136585,0.0012133836,0.0002251272],"about_ca_topic_score_codex":0.000011513359,"about_ca_topic_score_gemma":0.000020809963,"teacher_disagreement_score":0.9853257,"about_ca_system_score_codex":0.000035080124,"about_ca_system_score_gemma":0.000009458069,"threshold_uncertainty_score":0.69837964},"labels":[],"label_agreement":null},{"id":"W1889120796","doi":"10.4018/978-1-4666-1888-6.ch001","title":"A Comparative Study of SIP Overload Control Algorithms","year":2012,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Information overload; Computer science; Control (management); Distributed computing; Engineering; Computer network; Artificial intelligence; World Wide Web","score_opus":0.02431392394271093,"score_gpt":0.25796277178521637,"score_spread":0.23364884784250545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1889120796","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036508142,0.0017896192,0.047258303,0.000046522247,0.0011109466,0.0014752316,0.00009004715,0.00027410698,0.9475902],"genre_scores_gemma":[0.982853,0.0000024205099,0.0006207125,0.00023736533,0.0003980666,0.0000424162,0.000001067428,0.000017854944,0.015827125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99754673,0.00008359077,0.0006230958,0.00061815564,0.00068414165,0.00044429715],"domain_scores_gemma":[0.99790406,0.00013696327,0.0005284686,0.000914222,0.00027461792,0.00024165756],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020911505,0.0005215316,0.001076398,0.00007184741,0.000099128396,0.000087423046,0.0010962064,0.00027783873,0.000026722355],"category_scores_gemma":[0.0000047525405,0.00048415235,0.00024227469,0.000036501355,0.00011139123,0.00011857457,0.00021743614,0.00034550863,0.00016597644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005217298,0.00012974326,0.000025815058,0.0000075958437,0.00041417708,0.0000323759,0.00051014184,0.000078530655,0.0000022527995,0.89986587,0.0010147458,0.09786657],"study_design_scores_gemma":[0.055786904,0.013926008,0.0024926625,0.0016777953,0.0042247754,0.00049230707,0.0010448338,0.1306073,0.00006374728,0.5775004,0.20177954,0.010403724],"about_ca_topic_score_codex":0.00005083056,"about_ca_topic_score_gemma":0.000081963735,"teacher_disagreement_score":0.9824879,"about_ca_system_score_codex":0.00012569592,"about_ca_system_score_gemma":0.00019317541,"threshold_uncertainty_score":0.999761},"labels":[],"label_agreement":null},{"id":"W1896159493","doi":"10.1109/inm.1999.770684","title":"MIBlets: a practical approach to virtual network management","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Network management station; Testbed; Computer network; Scope (computer science); Network management; Virtual network; Quality of service; Network architecture; Distributed computing; Node (physics); Resource management (computing); Engineering","score_opus":0.0157313236176702,"score_gpt":0.23858214613738235,"score_spread":0.22285082251971214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1896159493","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000847671,0.000026363743,0.7289297,0.0014214377,0.00029751688,0.00020975385,5.8515454e-8,0.00018683178,0.2688436],"genre_scores_gemma":[0.31040603,0.000008058227,0.6718679,0.006187597,0.00014447462,0.00008973071,5.4256515e-7,0.000008166344,0.01128746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986607,0.00010914989,0.00016747833,0.00041275064,0.00025654465,0.00039340687],"domain_scores_gemma":[0.9992057,0.00008278448,0.000027064438,0.00045459153,0.00003324992,0.00019657324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042665476,0.00012054778,0.00012245835,0.000045027147,0.00010371789,0.00015914666,0.0003718867,0.00004093414,0.000044229597],"category_scores_gemma":[0.000020355526,0.000102754835,0.00004520232,0.00053014513,0.000014807503,0.00019898372,0.00011163345,0.00010180386,0.00039827274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042729653,0.00007883278,0.00001184703,0.0000013212318,0.000020501078,0.000009839326,0.00003429033,0.0081484495,4.20643e-7,0.83503,0.06506192,0.09159831],"study_design_scores_gemma":[0.0007457008,0.0001526177,0.0001280815,0.000010979282,0.0000187515,0.0000626033,0.00011988422,0.24094719,0.000007798308,0.00429529,0.75314236,0.00036877557],"about_ca_topic_score_codex":0.0000013559935,"about_ca_topic_score_gemma":0.0000015021445,"teacher_disagreement_score":0.8307347,"about_ca_system_score_codex":0.000023219398,"about_ca_system_score_gemma":0.000034121265,"threshold_uncertainty_score":0.51191235},"labels":[],"label_agreement":null},{"id":"W189724838","doi":"","title":"Hardware Architectures for Communication Protocols with Reference to MPLS","year":2006,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Multiprotocol Label Switching; Computer science; Computer network; Quality of service; Connection-oriented Ethernet; Service provider; The Internet; Software; Protocol (science); Label Distribution Protocol; Label switching; Service (business); Embedded system; Local area network; Operating system","score_opus":0.02081040260980278,"score_gpt":0.27012670655592347,"score_spread":0.2493163039461207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W189724838","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017509753,0.000015692513,0.97234213,0.0035617303,0.000007661976,0.0080209505,0.0000022965366,0.00025331162,0.014045259],"genre_scores_gemma":[0.7711069,1.6282665e-7,0.21178441,0.000796273,0.000032188935,0.014372424,0.000004340543,0.0000059018384,0.0018974055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99934083,0.000032891054,0.00012121946,0.00021264584,0.0001228042,0.00016962996],"domain_scores_gemma":[0.9991417,0.000106539745,0.000040121027,0.0005521076,0.000110526315,0.000049036382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000116364325,0.00008508815,0.00009385407,0.00003766148,0.00011830508,0.00012428696,0.00066331617,0.000025745598,0.000009154874],"category_scores_gemma":[0.00000774791,0.00006001453,0.000020097707,0.0001491273,0.000018405817,0.000047864272,0.0000615446,0.000058015652,0.000017471431],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077421355,0.00006144566,0.00034132015,0.000011640434,0.000008312645,7.539209e-7,0.00006689173,0.014300237,0.00008759084,0.5975975,0.0090334155,0.37841347],"study_design_scores_gemma":[0.0029317138,0.0012191941,0.011634542,0.00023399453,0.000013654123,0.000023008715,0.000027341028,0.14213847,0.002219025,0.030115418,0.8086437,0.00079995557],"about_ca_topic_score_codex":0.000038436894,"about_ca_topic_score_gemma":0.00032209672,"teacher_disagreement_score":0.79961026,"about_ca_system_score_codex":0.000012650698,"about_ca_system_score_gemma":0.00004270814,"threshold_uncertainty_score":0.24473216},"labels":[],"label_agreement":null},{"id":"W1902232758","doi":"10.1109/pacrim.2001.953706","title":"ISDN3: the next generation networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Integrated Services Digital Network; Computer science; The Internet; Convergence (economics); Next-generation network; Telecommunications; Active networking; Computer network; World Wide Web","score_opus":0.0606252533932691,"score_gpt":0.20966790234939567,"score_spread":0.14904264895612657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1902232758","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00073257356,0.0008776081,0.9733421,0.009563038,0.00057797995,0.0000844173,3.6026425e-8,0.00018412528,0.014638128],"genre_scores_gemma":[0.9871051,0.00009204258,0.0025984528,0.0043758177,0.00066461763,0.00001398629,4.100955e-7,0.0000030108652,0.005146594],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994286,0.000046905483,0.000099080775,0.00015883494,0.00011125678,0.00015533753],"domain_scores_gemma":[0.99951154,0.000057710644,0.000025076839,0.00034024188,0.000026440199,0.000038970044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011765377,0.00006273494,0.00005039391,0.000012679455,0.00016931919,0.00024523132,0.0004396994,0.00003136325,0.0002892429],"category_scores_gemma":[0.0000051722495,0.000038040773,0.000034276232,0.00017612468,0.000019510835,0.0002625235,0.00004616088,0.0000813119,0.00023864607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.1507154e-7,0.0000098053315,0.000016210002,1.0132712e-7,0.0000044004178,0.0000012217457,0.000056355897,0.012472914,0.000015644042,0.12466585,0.082675084,0.7800822],"study_design_scores_gemma":[0.00009580055,0.000012983032,0.000044239805,7.986083e-7,0.0000020417258,0.0000056373683,0.0000038750495,0.96155936,0.0000066869698,0.0000993494,0.03811373,0.00005551741],"about_ca_topic_score_codex":0.0000032849816,"about_ca_topic_score_gemma":0.000012616339,"teacher_disagreement_score":0.9863725,"about_ca_system_score_codex":0.000007593896,"about_ca_system_score_gemma":0.00000355704,"threshold_uncertainty_score":0.31670067},"labels":[],"label_agreement":null},{"id":"W1902711703","doi":"10.1109/ccece.1996.548315","title":"Blocking analysis and optimized design of a class of circuit-switched multicast networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Multicast; Computer science; Blocking (statistics); Xcast; Computer network; Emulation; Source-specific multicast; Pragmatic General Multicast; Protocol Independent Multicast; Circuit switching; Distributed computing","score_opus":0.026506521203094335,"score_gpt":0.21422918842640043,"score_spread":0.1877226672233061,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1902711703","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036264537,0.00037673392,0.9950925,0.00013362669,0.000043450364,0.00013214751,3.0746597e-7,0.000059891965,0.00053487153],"genre_scores_gemma":[0.93032986,0.000065430824,0.06936692,0.000072318064,0.00001917308,0.0000062948116,2.6282575e-7,0.0000039492934,0.00013581265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893785,0.00010487496,0.0003378183,0.00026017163,0.00016975278,0.00018954779],"domain_scores_gemma":[0.9989056,0.0004109018,0.0001591647,0.00034857343,0.000097947035,0.00007779918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030550614,0.00010852336,0.00037882914,0.00015723631,0.000038972357,0.000034346027,0.00031735722,0.00006527669,0.000079128506],"category_scores_gemma":[0.000026431064,0.000093304974,0.00010400285,0.0008885217,0.00006432881,0.00010983408,0.00006768579,0.000076369666,0.0000013350108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001708549,0.00010251943,0.0011691863,0.0000062242843,0.0005208824,0.000004804424,0.00035173426,0.662612,0.00026627048,0.009061672,0.000087136206,0.32580048],"study_design_scores_gemma":[0.0008381572,0.0000442546,0.00051097776,0.000009221912,0.00017383428,0.0000025761922,0.000016481657,0.9981526,0.000086581575,0.00005874749,0.000010631396,0.00009594479],"about_ca_topic_score_codex":0.000013898352,"about_ca_topic_score_gemma":0.0000040031186,"teacher_disagreement_score":0.9267034,"about_ca_system_score_codex":0.000007197587,"about_ca_system_score_gemma":0.000008339457,"threshold_uncertainty_score":0.38048664},"labels":[],"label_agreement":null},{"id":"W1903098566","doi":"10.1109/ccece.2003.1225992","title":"Understanding Internet pricing: an objective-oriented classification","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; The Internet; World Wide Web","score_opus":0.08392374931872149,"score_gpt":0.2614868955136117,"score_spread":0.17756314619489022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1903098566","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009603199,0.000011440963,0.97562087,0.0012035912,0.0003137698,0.00011143976,1.23707e-7,0.00042043923,0.012715152],"genre_scores_gemma":[0.986319,0.0000024045983,0.0128441565,0.00035352376,0.00006250952,0.0000082022025,0.000002150522,0.0000049628584,0.00040307685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991972,0.000034496872,0.00013691753,0.0003016241,0.00015523867,0.00017451143],"domain_scores_gemma":[0.9995025,0.0000296982,0.000050591978,0.0002806742,0.000048572554,0.000087981745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014741832,0.000085877306,0.000078684294,0.0000715367,0.00007848267,0.000114151415,0.0003221543,0.000041397267,0.000015052633],"category_scores_gemma":[0.00001105338,0.00007569951,0.000028080958,0.00029568875,0.00002790172,0.00053119415,0.000041229134,0.000087471584,0.00004599636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000493553,0.00004689636,0.00020931708,8.317968e-7,0.0000073493857,0.0000023015614,0.00053251896,0.00088966015,0.00014061428,0.9805346,0.00011462824,0.01751635],"study_design_scores_gemma":[0.0015607948,0.00029625313,0.004176307,0.000030213498,0.000009551329,0.000022087477,0.0008671087,0.95503396,0.000652029,0.035666168,0.0013648069,0.00032071027],"about_ca_topic_score_codex":0.0000225878,"about_ca_topic_score_gemma":0.00004887603,"teacher_disagreement_score":0.9767158,"about_ca_system_score_codex":0.0002368099,"about_ca_system_score_gemma":0.00006514603,"threshold_uncertainty_score":0.30869362},"labels":[],"label_agreement":null},{"id":"W1903226867","doi":"10.1109/ccece.2004.1347721","title":"Multicast routing with delay and delay variation constraints using genetic algorithm","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Multicast; Computer science; Routing (electronic design automation); End-to-end delay; Computer network; Distance Vector Multicast Routing Protocol; Algorithm; Quality of service; Genetic algorithm; Elmore delay; Distributed computing; Xcast; Propagation delay; Delay calculation","score_opus":0.010279003914097433,"score_gpt":0.21578758170934187,"score_spread":0.20550857779524442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1903226867","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056070317,0.00004850173,0.9430869,0.00020231977,0.00008689596,0.00013045054,5.8929606e-7,0.00012039593,0.0002535851],"genre_scores_gemma":[0.5504309,0.0000020950515,0.449372,0.00014223419,0.0000364873,0.0000021061094,2.4350803e-7,0.0000036369634,0.000010322375],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915266,0.000028837581,0.00015610925,0.00028995183,0.0001501932,0.00022224167],"domain_scores_gemma":[0.999554,0.00005059245,0.0000589308,0.0001652511,0.000075524775,0.00009573235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012434284,0.000111597146,0.0001055094,0.0000400128,0.00014528356,0.00015032878,0.00014428505,0.000044074743,0.000009745811],"category_scores_gemma":[0.0000076189967,0.0000901791,0.000016055821,0.0001596763,0.000075145304,0.00022342286,0.000047211244,0.000077813034,0.000007404761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035894168,0.00003195829,0.0003207397,0.000002036577,0.000029813611,0.00006575863,0.00046496568,0.052500147,0.0000945623,0.025172886,0.000001696157,0.92131186],"study_design_scores_gemma":[0.0010788311,0.000056081906,0.0027594846,0.00002294193,0.000015920035,0.00039970205,0.000028343951,0.9951377,0.000027799178,0.00031435693,0.00001473815,0.00014411726],"about_ca_topic_score_codex":0.00007942453,"about_ca_topic_score_gemma":0.000014220855,"teacher_disagreement_score":0.94263756,"about_ca_system_score_codex":0.000036132344,"about_ca_system_score_gemma":0.000099264966,"threshold_uncertainty_score":0.36773968},"labels":[],"label_agreement":null},{"id":"W1908029608","doi":"10.1109/icupc.1998.733667","title":"Scheduling and quality of service in the General Packet Radio Service","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Motorola (Canada)","funders":"","keywords":"Computer science; Fair-share scheduling; Computer network; Round-robin scheduling; Scheduling (production processes); Dynamic priority scheduling; Quality of service; Fixed-priority pre-emptive scheduling; Rate-monotonic scheduling; Earliest deadline first scheduling; General Packet Radio Service; Deadline-monotonic scheduling; Real-time computing; Distributed computing; Wireless; Mathematical optimization; Telecommunications; Mathematics","score_opus":0.04978303771537497,"score_gpt":0.26486665029823,"score_spread":0.21508361258285502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1908029608","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89862597,0.0006696659,0.06960324,0.02716318,0.00010335211,0.00015282018,8.4374966e-7,0.00006800878,0.003612935],"genre_scores_gemma":[0.9816158,0.000022576718,0.01010504,0.008089619,0.00005778327,0.000005779442,4.24819e-7,0.0000022519466,0.0001007618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991549,0.00015960142,0.00020501004,0.00017640145,0.00016191648,0.00014216057],"domain_scores_gemma":[0.9993686,0.00017226262,0.000053435288,0.0003089311,0.000063149906,0.000033611253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053212396,0.00007181687,0.0001234024,0.000027000777,0.000042529224,0.00005331679,0.00046862214,0.000034579705,0.000029490597],"category_scores_gemma":[0.000010285383,0.000049219983,0.000018693554,0.00044348714,0.00001361809,0.00017351279,0.00006236725,0.000090860376,0.000012849128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018177387,0.000224356,0.009646244,0.00010040635,0.000034888322,0.000008037285,0.009151006,0.008812705,0.000587698,0.6484957,0.00089855515,0.32202223],"study_design_scores_gemma":[0.0005504951,0.000014588929,0.012725928,0.000010108644,0.000002755556,0.000006320241,0.00014127982,0.9854356,0.000028171447,0.00048476542,0.00050885987,0.00009113337],"about_ca_topic_score_codex":0.000271422,"about_ca_topic_score_gemma":0.0007981238,"teacher_disagreement_score":0.9766229,"about_ca_system_score_codex":0.0000055372047,"about_ca_system_score_gemma":0.00000959863,"threshold_uncertainty_score":0.20071326},"labels":[],"label_agreement":null},{"id":"W1911924512","doi":"10.1109/icatm.1999.786846","title":"Proactive management of MPEG traffic in ATM networks using time sequenced RLS filters","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Variable bitrate; Cyclostationary process; Multiplexing; Statistical time division multiplexing; Algorithm; Real-time computing; Recursive least squares filter; Adaptive filter; Computer network; Bit rate; Telecommunications","score_opus":0.013091782926904884,"score_gpt":0.22192728238052054,"score_spread":0.20883549945361565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1911924512","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11854403,0.00013894857,0.8691552,0.00013397282,0.00022543875,0.00053270545,4.1081904e-7,0.00012752092,0.011141759],"genre_scores_gemma":[0.95708907,0.000014525549,0.042080067,0.00011280843,0.000013588008,0.000016751634,5.612788e-7,0.0000065693134,0.0006660549],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884707,0.00011418479,0.0002636236,0.00032451784,0.0001506252,0.0003000046],"domain_scores_gemma":[0.9994481,0.00006886719,0.00008308415,0.00030142046,0.000038096692,0.000060440045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029430573,0.00013208813,0.00019171828,0.00007750325,0.000040718973,0.000039223218,0.00034982056,0.00005378163,0.00005923938],"category_scores_gemma":[0.000004673078,0.00012103119,0.00005607562,0.00053755933,0.000040711657,0.00023781433,0.000045797413,0.00009916757,0.0000140934635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014073854,0.00009400835,0.00006210838,0.000009563103,0.00006836793,0.000037689417,0.00016917528,0.73924637,0.00007823476,0.052473515,0.0001356351,0.20761128],"study_design_scores_gemma":[0.0005070284,0.00003834768,0.00022280263,0.00005733339,0.000011908545,0.0000073705305,0.000050169838,0.9985548,0.00010773558,0.0001624432,0.00012994255,0.00015010986],"about_ca_topic_score_codex":0.0000057757957,"about_ca_topic_score_gemma":0.0000044626163,"teacher_disagreement_score":0.838545,"about_ca_system_score_codex":0.000067831425,"about_ca_system_score_gemma":0.000044166325,"threshold_uncertainty_score":0.49355087},"labels":[],"label_agreement":null},{"id":"W1913260600","doi":"10.1109/ccece.2003.1226374","title":"Implementing a high performance scheduling discipline WF2Q+ in FPGA","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Theratechnologies (Canada)","funders":"","keywords":"Weighted fair queueing; Generalized processor sharing; Computer science; Weighted round robin; Queueing theory; Fair queuing; Scheduling (production processes); Processor sharing; Network packet; Round-robin scheduling; Distributed computing; Computer network; Dynamic priority scheduling; Mathematical optimization; Quality of service","score_opus":0.009371858419243793,"score_gpt":0.2326240732346361,"score_spread":0.2232522148153923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1913260600","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51652527,0.000039896742,0.4800096,0.0020204852,0.0001269192,0.00007633411,1.4745495e-7,0.00012985285,0.0010714793],"genre_scores_gemma":[0.9439581,0.000012439151,0.055445746,0.0003001226,0.000097193464,0.000016117514,0.0000011572693,0.0000046793243,0.00016446492],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989151,0.0000139265885,0.00023238956,0.00026084413,0.00015387135,0.00042391024],"domain_scores_gemma":[0.99959093,0.000028554186,0.00004547276,0.00025139056,0.000028575987,0.000055088065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035183952,0.000097077835,0.00011345198,0.00007555594,0.0001315377,0.000093142924,0.00042685826,0.000028310385,0.00002739861],"category_scores_gemma":[0.0000075520393,0.0000837251,0.000025906851,0.0003676205,0.000015162173,0.00042780244,0.00022507073,0.00012303225,0.000056011144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005892647,0.00006555986,0.0035280334,0.000008336806,0.00000787113,0.000012071435,0.00033772117,0.12065966,0.00013055505,0.20400032,0.000014170976,0.6712298],"study_design_scores_gemma":[0.0026480134,0.000091251335,0.017567165,0.000084313986,0.0000042934944,0.000012883996,0.000093099225,0.97317773,0.0011210579,0.00404154,0.00082418014,0.00033445194],"about_ca_topic_score_codex":0.00004552893,"about_ca_topic_score_gemma":0.00017203826,"teacher_disagreement_score":0.8525181,"about_ca_system_score_codex":0.000046021378,"about_ca_system_score_gemma":0.00006369926,"threshold_uncertainty_score":0.34142104},"labels":[],"label_agreement":null},{"id":"W1923115033","doi":"10.1109/ccece.2003.1226067","title":"Computation of the residual packet loss probability in a binary multicast tree","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; École de Technologie Supérieure; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multicast; Computer science; Packet loss; Computer network; Router; Automatic repeat request; Network packet; Quality of service; Hybrid automatic repeat request","score_opus":0.015017405904260355,"score_gpt":0.23217965475204688,"score_spread":0.21716224884778654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1923115033","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8202077,0.00002740066,0.17255948,0.0059622284,0.00013159323,0.00029026024,6.858039e-7,0.000064446125,0.00075621606],"genre_scores_gemma":[0.98990256,9.568729e-7,0.009892199,0.00014080362,0.000018996687,0.00000885024,3.4002468e-7,0.0000021145436,0.000033159853],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992181,0.000086050466,0.00020559119,0.00019201305,0.0001686351,0.00012963067],"domain_scores_gemma":[0.99952716,0.00007025739,0.00005425852,0.00026716545,0.00005424324,0.000026897102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002398482,0.0000658779,0.0000989507,0.000030824798,0.000036127745,0.000020127705,0.0003558347,0.000034017754,0.000002496844],"category_scores_gemma":[0.00003110415,0.00004346086,0.000036884663,0.00034459238,0.000083510204,0.00013218253,0.00009830905,0.00008340314,0.0000064065816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006690417,0.00084974035,0.016466785,0.00003678427,0.000018616056,0.000019085597,0.0021608782,0.2978407,0.00038641627,0.2793849,0.0002919515,0.40247723],"study_design_scores_gemma":[0.0036643741,0.00020958044,0.34354025,0.00010971228,0.00000769851,0.000016472872,0.000075572716,0.5965628,0.0008175473,0.05470454,0.00006131956,0.00023010092],"about_ca_topic_score_codex":0.00004755552,"about_ca_topic_score_gemma":0.0003550431,"teacher_disagreement_score":0.40224713,"about_ca_system_score_codex":0.000037985603,"about_ca_system_score_gemma":0.00010008075,"threshold_uncertainty_score":0.17722824},"labels":[],"label_agreement":null},{"id":"W1924271624","doi":"10.1109/hpsr.2002.1024247","title":"Scheduling latency-critical traffic: a measurement study of DRR+ and DRR++","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Jitter; Latency (audio); Computer science; Scheduling (production processes); Computer network; Queueing theory; Network packet; Real-time computing; Distributed computing; Telecommunications; Engineering","score_opus":0.028249811911173022,"score_gpt":0.2465387834364419,"score_spread":0.21828897152526888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1924271624","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62618506,0.0006841931,0.36812648,0.00071079086,0.0003213046,0.00035902188,1.761831e-7,0.00017690667,0.0034360385],"genre_scores_gemma":[0.9874547,0.000007176423,0.012345289,0.000102445396,0.000019976724,0.000013765951,3.8870496e-8,0.000004609353,0.00005198225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986799,0.0001265647,0.0002572493,0.00030928612,0.00041241958,0.00021460962],"domain_scores_gemma":[0.9992997,0.00010495188,0.000033468692,0.0002740222,0.00018259328,0.00010528337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006620592,0.00011034285,0.00018226568,0.000051920524,0.00008565143,0.000063574655,0.0002254575,0.000037287988,0.000023071787],"category_scores_gemma":[0.00012936999,0.00009184243,0.000027534625,0.00019747442,0.000040157975,0.00014837841,0.000040755724,0.00009677966,0.00000707932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021219916,0.0017526959,0.001970323,0.000028751061,0.000110538334,0.00002920721,0.0025610887,0.0048773442,0.00029545,0.5725901,0.00020215588,0.4155611],"study_design_scores_gemma":[0.008757826,0.0029376412,0.006685009,0.00014649329,0.00016966587,0.000079008096,0.0040988894,0.9689693,0.00073936034,0.004598455,0.001687474,0.0011308986],"about_ca_topic_score_codex":0.0000055503738,"about_ca_topic_score_gemma":0.000034059416,"teacher_disagreement_score":0.96409196,"about_ca_system_score_codex":0.000014275109,"about_ca_system_score_gemma":0.00006587498,"threshold_uncertainty_score":0.37452254},"labels":[],"label_agreement":null},{"id":"W1937465037","doi":"10.1109/mascot.2000.876447","title":"A performance comparison of monofractal and multifractal traffic streams","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multifractal system; STREAMS; Computer science; Traffic generation model; Simulation; Fractal; Real-time computing; Computer network; Mathematics","score_opus":0.01782424935918061,"score_gpt":0.2257541324114749,"score_spread":0.2079298830522943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1937465037","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9859932,0.00032032578,0.010524697,0.0003374971,0.000094263276,0.000083610445,4.7302967e-7,0.00011435563,0.002531556],"genre_scores_gemma":[0.99557364,0.000054149776,0.0039831037,0.000046178302,0.000030539588,0.0000047532435,4.1071962e-7,0.0000035972773,0.00030361125],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927557,0.000019234756,0.00020352511,0.00019770887,0.00014448928,0.0001594648],"domain_scores_gemma":[0.99954104,0.00008050252,0.00007218827,0.00019812456,0.000034493773,0.00007364505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006264569,0.00009416739,0.00016746981,0.000043436874,0.00005841682,0.00003791348,0.00024030157,0.000041655716,0.00006491592],"category_scores_gemma":[0.000006197778,0.0000798745,0.000031197786,0.0001316728,0.000048606635,0.00030953277,0.000049813563,0.00008878733,0.00002932395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003834387,0.00010303766,0.002413188,0.0000048704264,0.000007909755,8.985571e-7,0.00045693622,0.0014669636,0.000038471542,0.0006196905,0.0004340646,0.99445015],"study_design_scores_gemma":[0.00044866125,0.00013173014,0.00028950846,0.000008780216,0.0000044359535,0.000007682309,0.00004549114,0.998186,0.0001537855,0.0000034728012,0.00062570715,0.000094732364],"about_ca_topic_score_codex":0.000003989166,"about_ca_topic_score_gemma":0.0000060452417,"teacher_disagreement_score":0.99671906,"about_ca_system_score_codex":0.0000063372586,"about_ca_system_score_gemma":0.0000063771076,"threshold_uncertainty_score":0.32571876},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"medium"},{"model":"gpt","categories":[],"domain":null,"study_design":"design_other","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"low"}],"label_agreement":"split"},{"id":"W1938727226","doi":"10.1109/iscas.2004.1329680","title":"An overview and comparison of analytical TCP models","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; TCP tuning; Zeta-TCP; Transmission Control Protocol; The Internet","score_opus":0.06556121326869668,"score_gpt":0.3241936331531461,"score_spread":0.2586324198844494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1938727226","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03006348,0.0009888409,0.9652776,0.00088445557,0.00004061172,0.000051148134,2.746913e-7,0.00007519345,0.0026183769],"genre_scores_gemma":[0.9823125,0.000040557035,0.017321395,0.0002573757,0.00001678839,0.0000013870381,3.1759728e-7,0.0000018654158,0.00004783955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994389,0.000019772027,0.00015101017,0.00016463849,0.00012305225,0.0001026458],"domain_scores_gemma":[0.9995878,0.000025591482,0.000029711115,0.0002318083,0.000037235637,0.000087881715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000919829,0.00005672565,0.0001483084,0.000027127337,0.000026837408,0.00003656986,0.00023277012,0.000028710549,0.000010395602],"category_scores_gemma":[0.0000022473744,0.00004612967,0.0000235831,0.00012220455,0.00003408166,0.0002756638,0.00003830088,0.000046101868,0.0000044985964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019728875,0.0000629637,0.00018028503,0.0000031554698,0.0000051774955,7.268433e-7,0.000107366424,0.028826708,0.0000070491756,0.84717995,0.00007759279,0.12354707],"study_design_scores_gemma":[0.0003333306,0.00008888619,0.00048245903,0.000009297566,0.0000054732063,0.0000024440621,0.000015949276,0.98047656,0.00003722424,0.01829799,0.00019090508,0.00005947979],"about_ca_topic_score_codex":0.000017956127,"about_ca_topic_score_gemma":0.00001619652,"teacher_disagreement_score":0.952249,"about_ca_system_score_codex":0.00000661762,"about_ca_system_score_gemma":0.000030439845,"threshold_uncertainty_score":0.18811134},"labels":[],"label_agreement":null},{"id":"W1941844001","doi":"10.1109/mascot.1998.693684","title":"Statistical multiplexing of self-similar video streams: simulation study and performance results","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Statistical time division multiplexing; Computer science; Multiplexing; Computer network; Quality of service; Dimensioning; Bandwidth (computing); Real-time computing; Video quality; Telecommunications; Engineering","score_opus":0.020365925282587048,"score_gpt":0.23785464061194944,"score_spread":0.2174887153293624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1941844001","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52525765,0.00006427278,0.4721737,0.00020255124,0.00009316058,0.00032387744,0.0000052814958,0.0002238334,0.0016556729],"genre_scores_gemma":[0.97755075,0.000016330416,0.022232298,0.000050645343,0.000031388226,0.0000051076977,9.5041287e-7,0.0000036320475,0.00010890557],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903876,0.00006259789,0.00027993438,0.00026611355,0.0002059147,0.00014667246],"domain_scores_gemma":[0.9991042,0.00043907372,0.0000702715,0.0002502273,0.00007281375,0.00006343999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022901958,0.00009126451,0.00013407152,0.000045610945,0.00007929967,0.000046006102,0.00017248503,0.00002875561,0.000020286712],"category_scores_gemma":[0.000053471565,0.000077686076,0.000013341842,0.0001442096,0.00002434426,0.00027123562,0.00006387476,0.000067312205,0.000010151073],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040731928,0.00041164533,0.011809488,0.000012467752,0.000032260225,0.000006536533,0.0019680078,0.05405363,0.0000049528285,0.0030920997,0.00029856726,0.9282696],"study_design_scores_gemma":[0.0012630484,0.0003472382,0.018199418,0.00000799886,0.000008185208,0.0000012455333,0.00006110307,0.97975373,0.000008981981,0.000026715892,0.00023627284,0.0000860617],"about_ca_topic_score_codex":0.0000076026763,"about_ca_topic_score_gemma":0.000008754937,"teacher_disagreement_score":0.92818356,"about_ca_system_score_codex":0.000010902942,"about_ca_system_score_gemma":0.000008019177,"threshold_uncertainty_score":0.31679463},"labels":[],"label_agreement":null},{"id":"W1942042198","doi":"10.1109/icccn.1999.805553","title":"Scalability and QoS guarantee in IP networks","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Scalability; Computer network; Quality of service; Scheduling (production processes); Distributed computing; Queueing theory; Throughput; Key (lock); Traffic classification; Edge device; Scheme (mathematics); Enhanced Data Rates for GSM Evolution; Multiprotocol Label Switching; Computer security; Wireless","score_opus":0.00462859456719296,"score_gpt":0.1878931673440173,"score_spread":0.1832645727768243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1942042198","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084130794,0.0005928516,0.9045633,0.00084483804,0.00037464322,0.00015859143,8.229934e-8,0.000121102195,0.009213817],"genre_scores_gemma":[0.9941686,0.000032683947,0.004900774,0.0005439526,0.000034913133,0.000009769672,1.04236e-7,0.00000237484,0.00030683167],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992148,0.00009524711,0.00014364529,0.00026398458,0.00007877545,0.00020354119],"domain_scores_gemma":[0.9995493,0.00011208853,0.000018431343,0.00025625373,0.000019022165,0.000044877714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038532502,0.00007626318,0.000107623586,0.000030034473,0.00003927071,0.000063355714,0.00017969115,0.000047564736,0.000028374898],"category_scores_gemma":[0.000028218932,0.000064380576,0.000019932275,0.0002307781,0.00003594164,0.00016369212,0.0000345062,0.000101878635,0.000010282106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046592604,0.000049125476,0.014845742,0.0000020891018,0.0000040987848,0.000007922712,0.000067618705,0.0042238077,0.000002746583,0.47070026,0.0008017521,0.50929016],"study_design_scores_gemma":[0.0006851768,0.000032193915,0.019555436,0.000008257942,0.0000018412358,0.000013538342,0.000014459462,0.9695766,0.000012160551,0.0049961554,0.0049567604,0.00014744875],"about_ca_topic_score_codex":0.000009555978,"about_ca_topic_score_gemma":0.00006446274,"teacher_disagreement_score":0.9653528,"about_ca_system_score_codex":0.000012032311,"about_ca_system_score_gemma":0.00001980347,"threshold_uncertainty_score":0.26253638},"labels":[],"label_agreement":null},{"id":"W1947367101","doi":"10.1109/icc.2002.997248","title":"A destination-driven shortest path tree algorithm","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Shortest path problem; Yen's algorithm; K shortest path routing; Constrained Shortest Path First; Shortest Path Faster Algorithm; Multicast; Tree (set theory); Shortest-path tree; Node (physics); Algorithm; Path (computing); Dijkstra's algorithm; Mathematical optimization; Theoretical computer science; Distributed computing; Mathematics; Minimum spanning tree; Computer network; Graph; Combinatorics; Engineering","score_opus":0.00873844565430657,"score_gpt":0.20676544830653956,"score_spread":0.198027002652233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1947367101","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046151344,0.000064745545,0.95648026,0.00047993075,0.00025000796,0.000099111385,4.101925e-7,0.00028955843,0.041874446],"genre_scores_gemma":[0.71021765,0.000006745726,0.28708896,0.0005065466,0.000053451666,0.000021670643,0.0000010836154,0.0000052005075,0.0020986786],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991441,0.000058562175,0.00014099138,0.00026245447,0.0001809913,0.00021294283],"domain_scores_gemma":[0.99938,0.000104594474,0.000033943863,0.00029754944,0.00008407902,0.000099858575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015200225,0.000098335055,0.000096332624,0.0000433707,0.000092656315,0.00010331181,0.00034497277,0.000037555503,0.00007948647],"category_scores_gemma":[0.000036770733,0.00008490397,0.000043280575,0.0002777642,0.000020979705,0.0002345629,0.000028043023,0.0000731611,0.0001407654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.3225542e-7,0.00003403854,0.0003425811,2.9700476e-7,0.0000053789176,0.000010996221,0.00003742965,0.00028846948,0.0000089058585,0.24167502,0.0016970717,0.7558996],"study_design_scores_gemma":[0.00040029327,0.000057302594,0.0011580545,0.0000059685067,0.0000052841774,0.000035916655,0.000015744063,0.97599083,0.000052648615,0.0026179366,0.019486856,0.00017317008],"about_ca_topic_score_codex":0.0000040493105,"about_ca_topic_score_gemma":0.000013130239,"teacher_disagreement_score":0.97570235,"about_ca_system_score_codex":0.000019694291,"about_ca_system_score_gemma":0.00007611109,"threshold_uncertainty_score":0.34622836},"labels":[],"label_agreement":null},{"id":"W194751070","doi":"10.1023/a:1021106425627","title":"Guest Editorial: Internet Traffic Engineering and Management","year":2002,"lang":"en","type":"article","venue":"Journal of Network and Systems Management","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Cisco Systems (Canada)","funders":"","keywords":"Computer science","score_opus":0.009438338585398897,"score_gpt":0.18305466228640743,"score_spread":0.17361632370100855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W194751070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029311728,0.06274317,0.52826697,0.0030961665,0.36422983,0.0019052097,0.0000011871153,0.0004320594,0.010013683],"genre_scores_gemma":[0.9536239,0.0049877674,0.0030808863,0.00010806436,0.036310237,0.000016410087,2.5750157e-7,0.000015553234,0.001856914],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99866027,0.000057054156,0.0004745313,0.00019807737,0.0003508088,0.00025925678],"domain_scores_gemma":[0.9993329,0.00005447407,0.00023301587,0.00018311472,0.00005372058,0.00014274933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006736536,0.00015484849,0.0002732066,0.00012601806,0.000059565886,0.00032330048,0.00033596612,0.000047020567,0.0000023822759],"category_scores_gemma":[0.0000026167365,0.00012998973,0.000053500196,0.00017900574,0.000015715907,0.00024187852,0.00015152118,0.00014303632,0.0000059011463],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016613038,0.000064587024,0.0000913178,0.00026699348,0.0004913512,0.00033858442,0.0002777978,0.12725551,6.493297e-7,0.043124605,0.6480655,0.18000649],"study_design_scores_gemma":[0.0006723883,0.000105749255,0.00018120374,0.00028797452,0.000051329356,0.00009709595,0.00004143689,0.45392478,5.988032e-8,0.000018806904,0.54449546,0.00012371955],"about_ca_topic_score_codex":8.7101563e-7,"about_ca_topic_score_gemma":5.2183606e-7,"teacher_disagreement_score":0.9243122,"about_ca_system_score_codex":0.000030029933,"about_ca_system_score_gemma":0.0000017701515,"threshold_uncertainty_score":0.53008276},"labels":[],"label_agreement":null},{"id":"W1948139703","doi":"10.1109/icc.1999.767954","title":"Improving end-to-end performance of TCP using link-layer retransmissions over mobile internetworks","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer network; Computer science; TCP acceleration; Datagram; Zeta-TCP; TCP global synchronization; TCP tuning; Link layer; TCP Westwood plus; TCP Westwood; TCP Friendly Rate Control; Data link layer; CUBIC TCP; Transmission Control Protocol; Network packet; Wireless; Physical layer; Operating system","score_opus":0.014183923161038324,"score_gpt":0.24001297428167434,"score_spread":0.225829051120636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1948139703","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24478102,0.00019052984,0.7508775,0.00007961316,0.00048079205,0.00020045144,6.187698e-7,0.000106196254,0.0032833137],"genre_scores_gemma":[0.9562256,0.000015656466,0.042098477,0.00037000587,0.00010321276,0.000014273188,4.5114763e-7,0.000011975308,0.0011603842],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985881,0.00006741678,0.00035023058,0.0003730913,0.00025994447,0.00036123375],"domain_scores_gemma":[0.9990475,0.00010202466,0.000097428485,0.0004725637,0.0000977712,0.000182716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035349283,0.00016377906,0.0002131381,0.00009842274,0.0001080872,0.00007117981,0.00050218636,0.00009911385,0.00046060886],"category_scores_gemma":[0.00001844897,0.00013900602,0.000089812354,0.00044731275,0.00003634178,0.00033383098,0.00009092189,0.00021839091,0.000019936851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017710567,0.000055099918,0.0015234714,0.00001948994,0.000027197168,0.000004482325,0.00033460942,0.0463023,0.0038911384,0.011082707,0.0004094731,0.93633235],"study_design_scores_gemma":[0.00034782256,0.00013836847,0.0002267718,0.00006961792,0.000011798598,0.000011394577,0.000019066485,0.9871678,0.0029375658,0.000033965633,0.008839833,0.00019601952],"about_ca_topic_score_codex":0.00003409465,"about_ca_topic_score_gemma":0.000009047152,"teacher_disagreement_score":0.94086546,"about_ca_system_score_codex":0.000036249294,"about_ca_system_score_gemma":0.00011415087,"threshold_uncertainty_score":0.56685007},"labels":[],"label_agreement":null},{"id":"W1950718403","doi":"10.1109/glocom.2001.966201","title":"Improving the performance of RED deployment on a class based queue with shared buffers","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Random early detection; Computer science; Queue; Network packet; Software deployment; Drop (telecommunication); Computer network; Queueing theory; Packet loss; Network congestion; Algorithm; Mathematical optimization; Active queue management; Distributed computing; Mathematics; Telecommunications","score_opus":0.011742047411526796,"score_gpt":0.18036133862240827,"score_spread":0.16861929121088148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1950718403","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46143487,0.00014859324,0.5071117,0.01753664,0.00034414505,0.00091542606,0.0000020648965,0.00058837706,0.011918156],"genre_scores_gemma":[0.9948877,0.0000041216695,0.0031172219,0.0013011089,0.000026949898,0.000031808784,3.05773e-7,0.000005892404,0.0006249073],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991673,0.000040395687,0.00014031371,0.00021652349,0.00025141932,0.00018402567],"domain_scores_gemma":[0.9992696,0.00010569297,0.000077731005,0.00044558922,0.00005490774,0.00004647658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014062542,0.000099910394,0.00010292593,0.00003433467,0.00009112583,0.000052427313,0.00048319405,0.000025715784,0.00007359302],"category_scores_gemma":[0.000006631113,0.000055457895,0.000033814333,0.00020434932,0.00003648146,0.00013367976,0.000032185366,0.00009548856,0.000017483357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016243035,0.0002547823,0.0019885167,0.000033772336,0.000057063906,0.000010371433,0.00034662127,0.052876003,0.0009143576,0.015598364,0.007689271,0.92006844],"study_design_scores_gemma":[0.0006483898,0.0004038525,0.0008055518,0.000029695466,0.000005774712,0.0000020175298,0.000010128349,0.9961471,0.001067059,0.0000021061564,0.0007919241,0.0000864022],"about_ca_topic_score_codex":0.000014891892,"about_ca_topic_score_gemma":0.000016852411,"teacher_disagreement_score":0.9432711,"about_ca_system_score_codex":0.00002509169,"about_ca_system_score_gemma":0.000028691344,"threshold_uncertainty_score":0.22615072},"labels":[],"label_agreement":null},{"id":"W1951461206","doi":"10.1109/vtc.2002.1002784","title":"Ad hoc MPLS for virtual-connection-oriented mobile ad hoc networks","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Multiprotocol Label Switching; Computer network; Computer science; Wireless ad hoc network; Mobile ad hoc network; Vehicular ad hoc network; Adaptive quality of service multi-hop routing; Ad hoc wireless distribution service; Optimized Link State Routing Protocol; Quality of service; Distributed computing; Wireless; Telecommunications; Routing protocol; Routing (electronic design automation); Network packet","score_opus":0.007807303008125269,"score_gpt":0.22251825607451892,"score_spread":0.21471095306639365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1951461206","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041655554,0.005034175,0.9845148,0.00036720664,0.0024246685,0.00069747673,0.000002374335,0.0005382343,0.0022555438],"genre_scores_gemma":[0.94399226,0.00096427323,0.03619021,0.002544236,0.00032301166,0.00087847124,0.000014344184,0.0000392254,0.015053949],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982586,0.00009631964,0.00032756556,0.0005874588,0.00020599143,0.0005240515],"domain_scores_gemma":[0.99856883,0.0003822767,0.00009953595,0.00058015727,0.00017736257,0.00019182445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038089493,0.00022452936,0.00024811263,0.000077520934,0.0002857273,0.00014956611,0.00042750867,0.00013333249,0.0001638062],"category_scores_gemma":[0.000058108802,0.00020224927,0.000160406,0.00048799306,0.00004385977,0.00035592186,0.000052542473,0.00015748906,0.00008427383],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003429607,0.00009592277,0.000027701988,0.0000028470797,0.0000421748,0.0000031814136,0.0001120499,0.015624031,0.000017960205,0.15997654,0.016805647,0.80725765],"study_design_scores_gemma":[0.0013167437,0.0005049883,0.000037917547,0.000011919078,0.00001479071,0.00001454587,0.00009765772,0.3868696,0.000071838345,0.0006405472,0.61013144,0.00028800147],"about_ca_topic_score_codex":7.8776947e-7,"about_ca_topic_score_gemma":0.000031004864,"teacher_disagreement_score":0.94832456,"about_ca_system_score_codex":0.00004785837,"about_ca_system_score_gemma":0.00007746564,"threshold_uncertainty_score":0.8247486},"labels":[],"label_agreement":null},{"id":"W195209997","doi":"","title":"A unified formulation of the multicast lifetime optimization problem in WANETs","year":2008,"lang":"en","type":"article","venue":"International Conference on Wireless Networks","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Ottawa","funders":"","keywords":"Multicast; Computer science; Computer network; Mathematical optimization; Distributed computing; Mathematics","score_opus":0.02288963263314437,"score_gpt":0.23918088290128578,"score_spread":0.21629125026814142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W195209997","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033693228,0.000022880575,0.95614356,0.0027517087,0.0006790424,0.00038833305,0.0000027376814,0.00007734546,0.0062411563],"genre_scores_gemma":[0.99525577,0.00007531919,0.00403174,0.00025459036,0.00009094184,0.00003083427,0.000010271099,0.000007638182,0.00024291039],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866986,0.00009571343,0.00037777712,0.00027702935,0.00038844004,0.0001911962],"domain_scores_gemma":[0.9990939,0.00011280132,0.00021786023,0.00029624338,0.00024033671,0.000038864546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016099935,0.00013678789,0.0001599579,0.00010131679,0.00008460612,0.000048144084,0.000875272,0.0000979301,0.00004098103],"category_scores_gemma":[0.000020034426,0.00010836097,0.00006177997,0.0003235141,0.00006491776,0.00026613558,0.00011306716,0.00022429109,0.000004940668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039318304,0.00008207027,0.0017808451,0.0000017802107,0.000013279269,0.000004768449,0.00017311666,0.80577767,0.000025525464,0.16197369,0.00010904516,0.03001887],"study_design_scores_gemma":[0.0006597975,0.000037202448,0.0037679696,0.00010920785,0.0000023400328,0.000010309631,0.0000072015855,0.99480325,0.000042061274,0.00038549528,0.00006351513,0.00011163073],"about_ca_topic_score_codex":0.000026057065,"about_ca_topic_score_gemma":0.000031069732,"teacher_disagreement_score":0.9615625,"about_ca_system_score_codex":0.000058229878,"about_ca_system_score_gemma":0.00009302441,"threshold_uncertainty_score":0.4418832},"labels":[],"label_agreement":null},{"id":"W1952109601","doi":"10.3233/scc-2001-241","title":"Achieving QoS for TCP traffic in satellite networks with differentiated services","year":2001,"lang":"en","type":"article","venue":"Space Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lockheed Martin (Canada)","funders":"","keywords":"Computer network; Quality of service; Computer science; Provisioning; The Internet; Broadband; Communications satellite; Satellite; Telecommunications; Engineering","score_opus":0.01449896086266523,"score_gpt":0.2415270920927062,"score_spread":0.22702813123004098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1952109601","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13911216,0.006654627,0.82910544,0.02105567,0.00023554517,0.0010549638,0.0000030520262,0.000607021,0.0021714985],"genre_scores_gemma":[0.97635746,0.0020000285,0.020815013,0.00027565353,0.000052866093,0.00018334916,0.00003079302,0.000014730265,0.00027009568],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897116,0.00013472956,0.00021750561,0.00026399814,0.00009220599,0.0003203935],"domain_scores_gemma":[0.9977601,0.00032983976,0.00010880162,0.0016234462,0.00009569645,0.00008210196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020827712,0.00015051157,0.00018278699,0.00010280207,0.00027929601,0.00017080005,0.0018042417,0.00006850561,0.0000048733004],"category_scores_gemma":[0.0000067128863,0.00013400677,0.00005146079,0.0006703134,0.00006259825,0.0002860532,0.00021816668,0.00022657702,0.000009253307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089859466,0.00046262282,0.021831404,0.000027888562,0.00008861252,0.0000041258313,0.0018411226,0.12796399,0.000048685455,0.08025143,0.00026195028,0.7671283],"study_design_scores_gemma":[0.00088687916,0.000054695993,0.013943828,0.00010837368,0.000017515114,0.0000089123,0.00013500596,0.9521249,0.0000012928853,0.00008351033,0.03242633,0.00020876247],"about_ca_topic_score_codex":0.000024141564,"about_ca_topic_score_gemma":0.0034736106,"teacher_disagreement_score":0.8372453,"about_ca_system_score_codex":0.00003334852,"about_ca_system_score_gemma":0.00003774091,"threshold_uncertainty_score":0.5464637},"labels":[],"label_agreement":null},{"id":"W1952585797","doi":"10.1109/ccece.2004.1349732","title":"Extending the concept of effective bandwidths to DiffServ networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Quality of service; Computer network; Statistical time division multiplexing; Queueing theory; Bandwidth allocation; Weighted fair queueing; Bandwidth (computing); Scheduling (production processes); Differentiated services; Distributed computing; Multiplexing; Dynamic bandwidth allocation; FIFO (computing and electronics); Telecommunications; Mathematical optimization","score_opus":0.00417997362238506,"score_gpt":0.21297292354402428,"score_spread":0.20879294992163921,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1952585797","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008511584,0.00032000776,0.9858722,0.0028366973,0.00042181148,0.00033974583,2.6437218e-7,0.000105632236,0.0015920321],"genre_scores_gemma":[0.9947124,0.000006328894,0.0035509646,0.0013657734,0.00013380079,0.00003720015,2.6125812e-7,0.000004205977,0.00018906723],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923676,0.000055976885,0.0001466473,0.00020851493,0.00014879092,0.00020330917],"domain_scores_gemma":[0.9992311,0.00025730583,0.00004648145,0.00033961833,0.000050786748,0.00007470381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002016338,0.000091780355,0.00013076722,0.000027943004,0.00010497586,0.0000500916,0.00058369635,0.000034738692,0.000017012131],"category_scores_gemma":[0.000020904157,0.000056462217,0.00006193519,0.00033621446,0.00004440837,0.000117669995,0.00012123102,0.00009559058,0.000019213205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006503919,0.000020302978,0.00006887276,6.7572427e-7,0.0000143398,0.0000021995872,0.0003207881,0.15832512,0.000025487934,0.34121636,0.0004613772,0.49953797],"study_design_scores_gemma":[0.004904354,0.0010957739,0.03957484,0.00022596765,0.00005539891,0.000046593952,0.00026189786,0.91869473,0.004308563,0.015988473,0.013964377,0.00087902957],"about_ca_topic_score_codex":0.000023634102,"about_ca_topic_score_gemma":0.000015050688,"teacher_disagreement_score":0.9862008,"about_ca_system_score_codex":0.00002594575,"about_ca_system_score_gemma":0.000019963847,"threshold_uncertainty_score":0.23024623},"labels":[],"label_agreement":null},{"id":"W1953018643","doi":"10.1109/pimrc.2001.965433","title":"Connection admission control for PCS-to-Internet protocol internetworking","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Internetworking; Computer network; Computer science; The Internet; Admission control; Scalability; Network packet; Wireless network; Internet layer; Quality of service; Wireless; Distributed computing; Internet Protocol; Telecommunications; World Wide Web","score_opus":0.026092182584590815,"score_gpt":0.2607212399852605,"score_spread":0.23462905740066967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1953018643","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009483074,0.000010554263,0.95732933,0.002765351,0.00053545,0.03365448,6.009737e-7,0.0004658232,0.005143562],"genre_scores_gemma":[0.90705633,4.595378e-7,0.011338976,0.0030403575,0.00049874326,0.06858602,7.184411e-7,0.000015003307,0.009463401],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986692,0.000059418024,0.0002941389,0.0004494248,0.00017160861,0.00035621345],"domain_scores_gemma":[0.9990769,0.00019341602,0.000087550405,0.00031387748,0.000114881266,0.00021334697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026305753,0.00016559,0.00018930163,0.000085871,0.0000895331,0.00020941056,0.0005543126,0.00007331954,0.0003683278],"category_scores_gemma":[0.00005451475,0.00013760738,0.000103518934,0.0002008002,0.000012520468,0.00024014316,0.00007066795,0.00009834302,0.00020849187],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099742596,0.0000863134,0.00014148811,0.000011767356,0.00002807283,0.0000032667813,0.00016180659,0.001430601,0.00007507592,0.05119295,0.093168736,0.8536002],"study_design_scores_gemma":[0.0017392327,0.00029600784,0.000025971616,0.000040182058,0.0000046402315,0.000008135639,0.0000048199804,0.74871016,0.00014155907,0.00030622378,0.24857315,0.0001499414],"about_ca_topic_score_codex":0.0000066077037,"about_ca_topic_score_gemma":0.000013456273,"teacher_disagreement_score":0.9459904,"about_ca_system_score_codex":0.000046114088,"about_ca_system_score_gemma":0.000013297739,"threshold_uncertainty_score":0.56114656},"labels":[],"label_agreement":null},{"id":"W1954537956","doi":"10.1109/icc.2001.937265","title":"An adaptive buffer management mechanism for improving TCP behavior under heavy load","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Random early detection; Computer science; Computer network; TCP global synchronization; TCP Friendly Rate Control; TCP acceleration; TCP tuning; Network packet; Zeta-TCP; Buffer (optical fiber); Queue; Distributed computing; Network congestion; Active queue management; Telecommunications","score_opus":0.02449046582751651,"score_gpt":0.23295400024870253,"score_spread":0.208463534421186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1954537956","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017376103,0.000054778604,0.9923663,0.00090929493,0.00041011523,0.00062037294,0.0000014676251,0.00035678913,0.003543252],"genre_scores_gemma":[0.89927495,0.000005983869,0.09200865,0.0017659103,0.00009904823,0.00027666317,7.7189355e-7,0.000011583688,0.0065564346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987611,0.000029423569,0.00017355522,0.00045328506,0.00024645947,0.00033615952],"domain_scores_gemma":[0.9992057,0.00003681155,0.000048126596,0.00045764432,0.0001241098,0.0001276101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014969028,0.00014953205,0.0001276449,0.000048542708,0.00015729874,0.00015793124,0.00053681526,0.000056674588,0.00012986055],"category_scores_gemma":[0.0000019388738,0.00013254593,0.00007213448,0.00012040776,0.000016650698,0.00038043404,0.00008091423,0.00006967022,0.00008143832],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007076951,0.00010432217,0.000001592587,0.0000027492858,0.000011890601,0.000008093318,0.00005008616,0.00012964339,0.000075478,0.57673985,0.0006916422,0.42217755],"study_design_scores_gemma":[0.0009313951,0.00038774518,0.00009677334,0.0000054916054,0.000042048934,0.000008657069,0.000114050716,0.9914996,0.00023676726,0.005820567,0.0005988302,0.00025808928],"about_ca_topic_score_codex":0.00001757931,"about_ca_topic_score_gemma":0.000026534706,"teacher_disagreement_score":0.99136996,"about_ca_system_score_codex":0.00007233307,"about_ca_system_score_gemma":0.000014203267,"threshold_uncertainty_score":0.54050666},"labels":[],"label_agreement":null},{"id":"W1955130297","doi":"10.1109/pacrim.1999.799549","title":"Quality of service support over switched Ethernet","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer network; Switched communication network; Computer science; Quality of service; Ethernet; Local area network; Network topology; Network packet; STREAMS; Connection-oriented Ethernet; Videoconferencing; Carrier Ethernet; Telecommunications","score_opus":0.027332927398334005,"score_gpt":0.27721079273573884,"score_spread":0.24987786533740483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1955130297","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09029012,0.000056286062,0.8037711,0.0019259944,0.00033157686,0.00014073834,0.0000011671252,0.00020893302,0.10327412],"genre_scores_gemma":[0.9872665,0.0000020668415,0.0076071597,0.0030713002,0.000017606557,0.0000040749874,5.762734e-7,0.0000034697612,0.0020272855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991137,0.00010780093,0.00023296896,0.0001915917,0.00020108507,0.00015285498],"domain_scores_gemma":[0.99924946,0.00011292013,0.00007990536,0.00039666856,0.00009866588,0.00006237822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005363994,0.00007519818,0.00014578013,0.000020745323,0.000021632417,0.00002222096,0.00034715058,0.00004645302,0.00057887053],"category_scores_gemma":[0.000023778633,0.000062788604,0.000045954435,0.00024563575,0.000012549092,0.0001366753,0.000034213113,0.000060007627,0.000087779066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007371437,0.000075555996,0.0031651938,0.000011679162,0.000022872757,0.0000016370788,0.0003037293,0.00020329269,0.00070093403,0.943892,0.0030683647,0.048547387],"study_design_scores_gemma":[0.014291146,0.0006934752,0.16480376,0.00006396693,0.00006636992,0.00006271173,0.00062711263,0.37135577,0.018121522,0.08769743,0.33930197,0.0029147703],"about_ca_topic_score_codex":0.00007259102,"about_ca_topic_score_gemma":0.00010601435,"teacher_disagreement_score":0.89697635,"about_ca_system_score_codex":0.000008330193,"about_ca_system_score_gemma":0.00008423606,"threshold_uncertainty_score":0.6338227},"labels":[],"label_agreement":null},{"id":"W1955239608","doi":"10.1109/icct.2000.889241","title":"A proportional differentiation service model for the future Internet differentiated services","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Differentiated services; Computer science; Differentiated service; The Internet; Service (business); Network packet; Computer network; Service model; Service delivery framework; Service design; World Wide Web; Business","score_opus":0.016318317181130693,"score_gpt":0.20357702035829317,"score_spread":0.18725870317716248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1955239608","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012329369,0.0002862959,0.9720572,0.014015888,0.00046413267,0.00039623067,0.0000039191514,0.0002602678,0.00018666375],"genre_scores_gemma":[0.9891503,0.000028273254,0.0039126338,0.002598,0.00029037605,0.00014826613,0.000017212467,0.000008093623,0.003846855],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906653,0.000023507075,0.0002009157,0.00028069015,0.00022000656,0.00020835715],"domain_scores_gemma":[0.9992927,0.00007079269,0.0000938152,0.00030993804,0.00017869474,0.00005409286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007826005,0.00013607307,0.00010681266,0.000032177104,0.00015126386,0.00021095393,0.0007297034,0.000061731065,0.00016132316],"category_scores_gemma":[0.0000016405531,0.000081461185,0.000073829215,0.00017970143,0.000010560077,0.0002936154,0.00009160988,0.00008893228,0.000043711556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005136536,0.00041456593,0.00062137365,0.000103666425,0.00025751579,0.0000011745362,0.002969457,0.018656654,0.00013557664,0.41347316,0.020288521,0.543027],"study_design_scores_gemma":[0.0004906036,0.000018057157,0.0012390414,0.000008393366,0.000021723801,0.000002648101,0.00002780804,0.9948756,0.000015054599,0.0013639523,0.0018232152,0.00011386934],"about_ca_topic_score_codex":0.000007705669,"about_ca_topic_score_gemma":0.00024884997,"teacher_disagreement_score":0.97682095,"about_ca_system_score_codex":0.000015426767,"about_ca_system_score_gemma":0.000010998406,"threshold_uncertainty_score":0.33218908},"labels":[],"label_agreement":null},{"id":"W1955612129","doi":"10.1109/mascot.1998.693680","title":"Approaches to link-state alternate path routing in connection-oriented networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Computer network; Link-state routing protocol; Distributed computing; Routing protocol; Static routing; Dynamic Source Routing; Routing (electronic design automation); Path vector protocol; Policy-based routing; Path (computing); Equal-cost multi-path routing","score_opus":0.046176818115434067,"score_gpt":0.20445595856301782,"score_spread":0.15827914044758376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1955612129","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017810162,0.00010033178,0.9711001,0.0034703498,0.00062045135,0.00023344376,3.3428023e-7,0.0003161171,0.0063487315],"genre_scores_gemma":[0.9902067,0.000021403937,0.0065221507,0.001102188,0.00020034649,0.000036059075,9.4201613e-7,0.000008964369,0.0019012026],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986148,0.00007701858,0.00028946873,0.00044058688,0.0001643037,0.00041382722],"domain_scores_gemma":[0.99932855,0.00010878426,0.00005835057,0.00032747845,0.000032003667,0.00014483448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002980084,0.00014549648,0.00016536792,0.00009751291,0.000090813344,0.00013377027,0.00041377955,0.00005002798,0.000042370288],"category_scores_gemma":[0.000024941799,0.00013180739,0.000046443118,0.0006210377,0.000014325838,0.00023999038,0.00012243823,0.0001916841,0.00011058176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066144285,0.000050751205,0.0024050768,0.0000012707224,0.000011973273,0.000022876815,0.0006519404,0.21221557,0.0000028278341,0.08831505,0.0007214067,0.6955946],"study_design_scores_gemma":[0.00045852808,0.00004699532,0.0006272392,0.000019454215,0.0000017166185,0.000008387208,0.000025726067,0.9967428,0.000010062209,0.00024516668,0.001641341,0.00017258762],"about_ca_topic_score_codex":0.000049895298,"about_ca_topic_score_gemma":0.00009342479,"teacher_disagreement_score":0.97239655,"about_ca_system_score_codex":0.00004049021,"about_ca_system_score_gemma":0.000007588759,"threshold_uncertainty_score":0.53749496},"labels":[],"label_agreement":null},{"id":"W1958385788","doi":"10.1109/ccece.2000.849549","title":"A sender-initiated resource reservation mechanism over Diffserv networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Integrated services; Computer network; Quality of service; Scalability; Computer science; Reservation; Differentiated services; The Internet; Distributed computing; Resource (disambiguation); Resource Reservation Protocol; Internet Protocol","score_opus":0.03784917968994668,"score_gpt":0.21828193999437956,"score_spread":0.1804327603044329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1958385788","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043592188,0.00015642865,0.97120106,0.0043259943,0.00028360094,0.00017153044,4.545176e-7,0.0007387743,0.018762926],"genre_scores_gemma":[0.9855154,0.000035974535,0.0036817496,0.0044522854,0.00023710197,0.000021625074,0.0000043366517,0.000012157104,0.0060393717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986179,0.00012152675,0.00023993876,0.00038168012,0.00029261262,0.00034634292],"domain_scores_gemma":[0.999062,0.00014406767,0.00007704794,0.00053478143,0.000060582865,0.00012153058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002266382,0.00014870988,0.0001419196,0.00006959597,0.00017473489,0.0001766194,0.00056011707,0.000114523355,0.00045167803],"category_scores_gemma":[0.000020466165,0.0001327355,0.000065967506,0.00049328746,0.00001843451,0.00040793946,0.00013600259,0.00018450494,0.00012177804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011316688,0.00011732561,0.00025474463,0.0000038267594,0.00003875,0.0000364084,0.00023829153,0.006888017,0.000038987248,0.686168,0.08287635,0.22332796],"study_design_scores_gemma":[0.0005601537,0.000045769277,0.00070253224,0.000011278248,0.00000553143,0.000008783269,0.000011845864,0.9810076,0.000017058175,0.0028278446,0.014628813,0.00017280153],"about_ca_topic_score_codex":0.00001293626,"about_ca_topic_score_gemma":0.000017927498,"teacher_disagreement_score":0.9811562,"about_ca_system_score_codex":0.000028590668,"about_ca_system_score_gemma":0.000007206022,"threshold_uncertainty_score":0.5412796},"labels":[],"label_agreement":null},{"id":"W1960133880","doi":"10.1109/pacrim.1999.799550","title":"A queue growth rate based flow control algorithm","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Queue; Computer science; Network congestion; Active queue management; Flow control (data); Bandwidth (computing); Queueing theory; Real-time computing; Algorithm; Computer network; Network packet","score_opus":0.005085161120795241,"score_gpt":0.18480643820430567,"score_spread":0.17972127708351043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1960133880","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005158523,0.00009409678,0.9831768,0.002365095,0.00046677026,0.00017584137,0.0000016970837,0.00036945936,0.013298629],"genre_scores_gemma":[0.79365635,0.0000035978676,0.19816338,0.006597461,0.00009034138,0.0000469826,0.0000011442539,0.0000098009,0.0014309678],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871904,0.00023857136,0.00019417507,0.00034773158,0.00017120922,0.00032928158],"domain_scores_gemma":[0.99907213,0.00023139112,0.000047066373,0.0003663934,0.00013256482,0.00015042604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050660106,0.0001481105,0.00017485487,0.000058453825,0.00010561036,0.00014339523,0.0004134724,0.00005816654,0.00025022568],"category_scores_gemma":[0.000060220704,0.00012327444,0.0000836946,0.0002952473,0.000028332097,0.00022467057,0.0000144494625,0.00011050744,0.00022072216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075734333,0.00008532556,0.00009129313,0.000003070121,0.000030573803,0.000038718656,0.000025554755,0.003306979,0.000037979356,0.3303506,0.0070294607,0.6589929],"study_design_scores_gemma":[0.0018451195,0.00005116664,0.0001110262,0.0000035522874,0.0000073705596,0.0000070177434,0.0000028844406,0.98388517,0.00027196395,0.0019210802,0.011717618,0.00017600409],"about_ca_topic_score_codex":0.000009185546,"about_ca_topic_score_gemma":0.000007812192,"teacher_disagreement_score":0.98057824,"about_ca_system_score_codex":0.000021543843,"about_ca_system_score_gemma":0.00014964877,"threshold_uncertainty_score":0.5026986},"labels":[],"label_agreement":null},{"id":"W1962643662","doi":"10.1109/icc.2003.1203906","title":"Real-time transport for assured forwarding: an architecture for both unicast and multicast applications","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Unicast; Multicast; Computer network; Queueing theory; Distributed computing; Xcast; Service (business); IP multicast","score_opus":0.011292374298185371,"score_gpt":0.24984929130360728,"score_spread":0.23855691700542192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1962643662","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017582286,0.000024749972,0.99301845,0.0027353768,0.000036666526,0.0013254407,0.000024451285,0.00029687127,0.00077974703],"genre_scores_gemma":[0.57771516,0.00000851662,0.42085582,0.00020890887,0.00012794127,0.0005926797,0.000025326925,0.000014306224,0.000451321],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990039,0.000012420187,0.00019243035,0.00042574998,0.00009755408,0.00026795676],"domain_scores_gemma":[0.9991649,0.00014993206,0.00004875097,0.000387464,0.0000810572,0.0001679429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002031053,0.0001362476,0.00018453476,0.00004950274,0.00019748561,0.00006837398,0.0003666262,0.00007148704,0.0000034171678],"category_scores_gemma":[0.0000068064764,0.000117780044,0.000083962965,0.0001265969,0.00004643109,0.00017350628,0.00001754112,0.000056654906,0.0000029305302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077197605,0.00019501252,0.000045479148,0.0000322721,0.000062888364,0.0000013170392,0.000460358,0.011256581,0.002046865,0.4833377,0.00023274045,0.5022516],"study_design_scores_gemma":[0.009045779,0.0009522934,0.0011821853,0.000036626538,0.00015713858,0.000051781113,0.000084284155,0.8133869,0.00049777253,0.03838898,0.1353406,0.00087567215],"about_ca_topic_score_codex":0.000010836173,"about_ca_topic_score_gemma":0.00005091248,"teacher_disagreement_score":0.8021303,"about_ca_system_score_codex":0.000017112898,"about_ca_system_score_gemma":0.00006781948,"threshold_uncertainty_score":0.4802931},"labels":[],"label_agreement":null},{"id":"W1963626052","doi":"10.1109/icc.2013.6655645","title":"Cooperation of heterogeneous wireless networks in end-to-end congestion control for QoS provisioning","year":2013,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer network; Network congestion; Computer science; Network traffic control; Quality of service; End-to-end principle; Throughput; Explicit Congestion Notification; Provisioning; Wireless network; Queueing theory; Flow control (data); Transmission (telecommunications); Wireless; TCP Friendly Rate Control; Telecommunications","score_opus":0.007519020546926799,"score_gpt":0.2162015947216002,"score_spread":0.2086825741746734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963626052","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.080970414,0.00007937953,0.91560894,0.0012427632,0.0003931172,0.0014676754,0.0000016524167,0.000099015284,0.00013701292],"genre_scores_gemma":[0.99142677,0.0000062885056,0.006987164,0.0007881961,0.00014839382,0.00045631037,0.0000060213806,0.000010611917,0.00017026854],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986388,0.00008966531,0.00042382887,0.0003632231,0.0001653328,0.00031915327],"domain_scores_gemma":[0.99885505,0.0003414846,0.000108139415,0.00028573786,0.00029820122,0.00011139251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003366917,0.00014865857,0.0002679506,0.00011051978,0.00007626217,0.00013867355,0.00035985376,0.000095686846,0.000056890633],"category_scores_gemma":[0.00004317662,0.00013057601,0.000058146867,0.0002704529,0.000028767205,0.0003689443,0.000045595232,0.00009402699,0.000019277826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036628935,0.000057089346,0.00038576795,0.0000072272187,0.000015472287,0.0000014165691,0.000090332265,0.35265562,0.0009128323,0.025775854,0.00055355165,0.6195082],"study_design_scores_gemma":[0.0014069636,0.00023893452,0.0008273401,0.000036821675,0.00000634048,0.000004797871,0.0000097024285,0.9964902,0.00040193438,0.00012567594,0.0002980711,0.00015325434],"about_ca_topic_score_codex":0.00008582263,"about_ca_topic_score_gemma":0.00013947714,"teacher_disagreement_score":0.9104563,"about_ca_system_score_codex":0.000036429647,"about_ca_system_score_gemma":0.00006323473,"threshold_uncertainty_score":0.5324735},"labels":[],"label_agreement":null},{"id":"W1963795908","doi":"10.1016/j.peva.2007.12.006","title":"A stochastic model for the throughput of non-persistent TCP flows","year":2008,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Throughput; Idle; Network packet; File transfer; Download; Flow (mathematics); File size; Transfer (computing); Stochastic modelling; Computer network; Parallel computing; Mathematics; Operating system; Wireless; Statistics","score_opus":0.05952514272069574,"score_gpt":0.2785033849298072,"score_spread":0.21897824220911144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963795908","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1729083,0.00024336595,0.8253424,0.0004939967,0.0002701622,0.000599373,0.0000010489329,0.000027390017,0.00011394286],"genre_scores_gemma":[0.99116063,0.00004429558,0.008126126,0.0001275181,0.000101080535,0.00028582715,0.000002992878,0.0000050065414,0.00014654465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989785,0.000022903005,0.0002095434,0.00018272459,0.00044451072,0.00016180793],"domain_scores_gemma":[0.9990687,0.00012851354,0.00010669834,0.00033888654,0.00033055648,0.000026650941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007325954,0.00008632604,0.00011000184,0.000035775454,0.00026358903,0.000015410591,0.00037526884,0.000031496875,0.000007870879],"category_scores_gemma":[0.000037667556,0.000061338396,0.000092989496,0.00015940446,0.000039947543,0.00030483794,0.00003457887,0.000058989506,0.000012814271],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015413447,0.000017269833,0.000019043975,0.0000048087786,0.000014711019,2.3006626e-8,0.0009975174,0.7906907,0.000039146813,0.0002352219,0.00032861615,0.2076375],"study_design_scores_gemma":[0.00073263113,0.000101900674,0.0008102464,0.000015220846,0.000042702522,0.0000048529705,0.000016065096,0.9980282,0.000040184026,0.00009083572,0.000041970336,0.00007518964],"about_ca_topic_score_codex":0.0000018902277,"about_ca_topic_score_gemma":0.000003217732,"teacher_disagreement_score":0.8182523,"about_ca_system_score_codex":0.00004197988,"about_ca_system_score_gemma":0.00021163274,"threshold_uncertainty_score":0.2501307},"labels":[],"label_agreement":null},{"id":"W1963868451","doi":"10.1145/2591971.2592006","title":"On the relevance of adversarial queueing theory in practice","year":2014,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Queueing theory; Robustness (evolution); Adversarial system; Scheduling (production processes); Synchronization (alternating current); Queue; Layered queueing network; Network packet; Mathematical optimization; Computer network; Mathematics; Artificial intelligence","score_opus":0.006042458568664163,"score_gpt":0.2192155885716246,"score_spread":0.21317313000296043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963868451","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004240843,0.000035496985,0.89660823,0.007129769,0.00031051517,0.00009674372,5.9367206e-8,0.000050369596,0.09152795],"genre_scores_gemma":[0.9930467,0.0000067985925,0.003963566,0.0025810509,0.000058824244,0.0000052880773,4.151995e-8,0.0000021624453,0.0003355676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999175,0.0003245377,0.00012327834,0.00013581153,0.00013851882,0.00010285031],"domain_scores_gemma":[0.9951689,0.004399983,0.00006797286,0.000308319,0.000037915408,0.000016880927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012264488,0.000049141112,0.00007068847,0.00002372832,0.000032127733,0.000021340082,0.00039623812,0.000023501814,0.000016354874],"category_scores_gemma":[0.0009989884,0.000030501775,0.000022265362,0.00015150098,0.000027662125,0.00018624852,0.000042940726,0.00010914173,0.000029106617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027419284,0.000017147708,0.0000068987783,5.4630425e-7,0.0000031995382,6.2828724e-7,0.00011426522,0.0017230777,0.000013685688,0.8314453,0.00030256956,0.1663453],"study_design_scores_gemma":[0.0010489195,0.00019600516,0.0003124597,0.000059260827,0.0000090096655,0.0000042945444,0.00015335158,0.84433967,0.00029406018,0.12313423,0.030286776,0.00016195276],"about_ca_topic_score_codex":0.00001452148,"about_ca_topic_score_gemma":0.000013352424,"teacher_disagreement_score":0.98880583,"about_ca_system_score_codex":0.000009039454,"about_ca_system_score_gemma":0.000025237727,"threshold_uncertainty_score":0.12438262},"labels":[],"label_agreement":null},{"id":"W1963959738","doi":"10.1007/s10586-015-0446-8","title":"Congestion-aware TCP-friendly system for multimedia transmission based on UDP","year":2015,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Computer network; Transmission (telecommunications); Network congestion; Transmission Control Protocol; Multimedia; Telecommunications; Network packet","score_opus":0.019740784220199235,"score_gpt":0.24706646756602482,"score_spread":0.2273256833458256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963959738","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018912635,0.000088542976,0.99229896,0.0018975021,0.0017777368,0.0006026124,0.0000034633822,0.00068791513,0.0007519791],"genre_scores_gemma":[0.9148888,2.716475e-7,0.08373655,0.000719515,0.00047278972,0.000029754878,0.00001314037,0.000021384085,0.00011782393],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980888,0.00016370673,0.00037733794,0.00056359987,0.00037098545,0.00043558737],"domain_scores_gemma":[0.99804586,0.00072170293,0.0001508164,0.00046544726,0.00028607054,0.00033008374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073332415,0.00023914818,0.00028471428,0.00011407281,0.00024655208,0.00018195901,0.00065853505,0.000121926874,0.000002126119],"category_scores_gemma":[0.000061345156,0.00021400278,0.00012516056,0.00024141147,0.00003527624,0.00017073382,0.00007706554,0.00017729828,0.000049324924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010358351,0.00007266174,0.00009941304,0.000078612866,0.000015422307,0.000013674754,0.00057366485,0.24019583,0.000012556949,0.0023588315,0.006630516,0.74984527],"study_design_scores_gemma":[0.0031460782,0.00027371914,0.0000831644,0.000292874,0.000014927996,0.000011737745,0.00008846373,0.98829806,0.00006414333,0.000033018605,0.0074394606,0.00025436134],"about_ca_topic_score_codex":0.000004626288,"about_ca_topic_score_gemma":0.0000013015642,"teacher_disagreement_score":0.9129975,"about_ca_system_score_codex":0.0001280244,"about_ca_system_score_gemma":0.00018146016,"threshold_uncertainty_score":0.87267804},"labels":[],"label_agreement":null},{"id":"W1964070065","doi":"10.1109/sarnof.2010.5469800","title":"Cable modem buffer management in DOCSIS networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Rogers Communications (Canada)","funders":"","keywords":"Computer network; Computer science; Queue; Active queue management; Network congestion; Queue management system; Router; Network packet; Random early detection; Throughput; Upstream (networking); Real-time computing; Telecommunications; Wireless","score_opus":0.003894393306792694,"score_gpt":0.1962747894749537,"score_spread":0.192380396168161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964070065","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005613807,0.00005094297,0.92760426,0.0013573016,0.0007156688,0.0001534732,7.47239e-8,0.00019494875,0.06430955],"genre_scores_gemma":[0.96212417,0.000023984336,0.030992175,0.00094148493,0.00009695536,0.000036811765,4.897885e-7,0.000004804275,0.0057790973],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991424,0.00002036899,0.00014566847,0.0002771324,0.00012815993,0.00028624237],"domain_scores_gemma":[0.9994242,0.000039824743,0.000021880598,0.00042288555,0.000018283175,0.0000729266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021456958,0.0000921279,0.00010022499,0.00006068298,0.000047209203,0.00010456407,0.0005568049,0.0000586834,0.00015112873],"category_scores_gemma":[0.00000220069,0.00007921742,0.00003298931,0.00027948027,0.000016049398,0.0002176661,0.00013867265,0.00020092254,0.000076892866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003016598,0.000036176054,0.0004892851,0.0000014077472,0.000010054129,0.00001989748,0.000025286388,0.0561613,0.0000060358125,0.36557966,0.0053116665,0.5723562],"study_design_scores_gemma":[0.00035055896,0.000008256187,0.0016786098,0.000003226901,0.0000026978405,0.0000029227413,0.00000557109,0.98240435,0.0000053790186,0.0015770048,0.0138521725,0.00010922952],"about_ca_topic_score_codex":0.000044745437,"about_ca_topic_score_gemma":0.00025827927,"teacher_disagreement_score":0.95651037,"about_ca_system_score_codex":0.000011392669,"about_ca_system_score_gemma":0.000008977562,"threshold_uncertainty_score":0.32303926},"labels":[],"label_agreement":null},{"id":"W1964681042","doi":"10.1109/iscit.2007.4392097","title":"Integration of MIP-ROQS optimal path selection and MPLS","year":2007,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Multiprotocol Label Switching; Computer network; Computer science; Quality of service; Network packet; Routing (electronic design automation); Node (physics); Distributed computing; Engineering","score_opus":0.007862575054520714,"score_gpt":0.2250211474407179,"score_spread":0.2171585723861972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964681042","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13702811,0.00004646965,0.8605718,0.0001719973,0.00009000693,0.000054299042,1.0355898e-7,0.00006711125,0.0019701223],"genre_scores_gemma":[0.9369948,0.0000073758642,0.0625453,0.00009472873,0.00004566001,0.000001488329,4.4934296e-7,0.000001698352,0.00030850427],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995319,0.000014934037,0.00013023996,0.00012923857,0.00009209427,0.000101544574],"domain_scores_gemma":[0.9997139,0.0000565436,0.000041271825,0.00008000821,0.00006951308,0.00003874094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027549078,0.000049823342,0.00006620001,0.000046637015,0.00003549283,0.000028092152,0.000092462265,0.000033200482,0.000012243678],"category_scores_gemma":[0.000010202846,0.00004079215,0.000017226965,0.00016648181,0.000014466129,0.00018207997,0.00002027179,0.00004820768,0.0000038012836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010856121,0.00002060006,0.0003072238,0.0000018142426,0.000005274213,8.5462074e-7,0.00014887408,0.00022225073,0.004602666,0.1145712,0.00043545003,0.87967294],"study_design_scores_gemma":[0.00047999664,0.00022904885,0.012140772,0.00001534102,0.0000071667064,0.000024601519,0.00007334319,0.9744907,0.009746128,0.0006448592,0.002015978,0.00013205553],"about_ca_topic_score_codex":0.00001558217,"about_ca_topic_score_gemma":0.000029012052,"teacher_disagreement_score":0.97426844,"about_ca_system_score_codex":0.000009052763,"about_ca_system_score_gemma":0.000016072607,"threshold_uncertainty_score":0.16634557},"labels":[],"label_agreement":null},{"id":"W1964826331","doi":"10.1016/j.comcom.2008.08.026","title":"ODMCA: An adaptive data mining control algorithm in multicarrier networks","year":2008,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Data stream mining; Data stream; Controller (irrigation); PID controller; Stability (learning theory); Computation; Adaptability; Data transmission; Transmission (telecommunications); Real-time computing; Distributed computing; Data mining; Algorithm; Computer network; Telecommunications; Machine learning","score_opus":0.08629176346109502,"score_gpt":0.2839526139897091,"score_spread":0.1976608505286141,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964826331","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006642881,0.0011774717,0.995361,0.0015108656,0.0003300904,0.0003102091,0.000015396568,0.00029357112,0.00033714733],"genre_scores_gemma":[0.5540844,0.00013456581,0.44477957,0.00070667086,0.0001675585,0.00003758413,0.000056038443,0.000010738632,0.00002281184],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785364,0.000528503,0.0004389564,0.0005847021,0.0001985782,0.00039560825],"domain_scores_gemma":[0.9927479,0.00069415756,0.00012764514,0.0060883276,0.00015148162,0.0001905114],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00046428293,0.00020577572,0.00030070616,0.00013235671,0.0004704716,0.00011598386,0.007063556,0.00010262957,0.000005387078],"category_scores_gemma":[0.00001914628,0.00021640038,0.00005056961,0.0005401748,0.00023954907,0.0010454329,0.0018778647,0.00041599345,0.0000224878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008426634,0.00028032344,0.0008379335,7.2460995e-7,0.000045234785,0.000027302665,0.0008978273,0.018475205,0.0000013070468,0.008174557,0.0018936532,0.9693575],"study_design_scores_gemma":[0.0011326519,0.00008682801,0.003704211,0.000023754614,0.000010596592,0.000047417485,0.000030294848,0.98970747,2.9250444e-7,0.00008933013,0.004929415,0.00023771629],"about_ca_topic_score_codex":0.000044917713,"about_ca_topic_score_gemma":0.00013119745,"teacher_disagreement_score":0.9712323,"about_ca_system_score_codex":0.000046317073,"about_ca_system_score_gemma":0.00013694621,"threshold_uncertainty_score":0.9983087},"labels":[],"label_agreement":null},{"id":"W1965016145","doi":"10.1109/ciss.2009.5054813","title":"Can API-RCP achieve max-min fair bandwidth allocation in a multi-bottleneck network?","year":2009,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Bottleneck; Bandwidth (computing); Computer science; Bandwidth allocation; Computer network; Dynamic bandwidth allocation; Distributed computing; Embedded system","score_opus":0.01405775177497699,"score_gpt":0.231931375945225,"score_spread":0.21787362417024803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965016145","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0103575345,0.00035160675,0.9625019,0.021909773,0.00045103,0.000417032,0.0000010767067,0.00044683157,0.0035632255],"genre_scores_gemma":[0.95748657,0.000041537987,0.036856867,0.0033792907,0.00017209946,0.0000241213,0.000006745912,0.0000076231095,0.0020251363],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998397,0.00010241025,0.00031942822,0.00047044613,0.0002249974,0.0004857138],"domain_scores_gemma":[0.99917716,0.000074550095,0.00007685566,0.00047087693,0.000062171304,0.00013839158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003588028,0.00019244707,0.00021886501,0.00008845448,0.00009147763,0.00012960733,0.00065387617,0.00010128669,0.000030433108],"category_scores_gemma":[0.000016541137,0.00017476495,0.00006316624,0.0005512667,0.000023602866,0.00028500703,0.000060464856,0.00019307717,0.00008057554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025247668,0.00017746196,0.0013194572,0.000002738891,0.000011529576,0.000016980111,0.00032503347,0.033397492,0.00010586103,0.09721811,0.0062417546,0.8611583],"study_design_scores_gemma":[0.0015038277,0.00017461761,0.022656312,0.000036951344,0.000005488435,0.0000087124245,0.000022646798,0.9688794,0.000042932315,0.0031893826,0.0031417795,0.00033796616],"about_ca_topic_score_codex":0.0000643821,"about_ca_topic_score_gemma":0.0009734534,"teacher_disagreement_score":0.9471291,"about_ca_system_score_codex":0.00007043204,"about_ca_system_score_gemma":0.00009845862,"threshold_uncertainty_score":0.7126708},"labels":[],"label_agreement":null},{"id":"W1965437621","doi":"10.1109/iscas.2007.378749","title":"A New 10 Gbps Traffic Management algorithm for High-speed Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Algorithm; Network packet; Heuristic; Random early detection; Algorithm design; Speedup; Parallel computing; Computer network; Network congestion; Artificial intelligence","score_opus":0.00798279658687977,"score_gpt":0.22062301598440417,"score_spread":0.2126402193975244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965437621","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012697512,0.0001944402,0.9912863,0.0010168903,0.0009808232,0.0005127198,5.1957846e-7,0.0005501818,0.0053311917],"genre_scores_gemma":[0.14307982,0.000026596525,0.79868233,0.0014793215,0.0010666022,0.000022404334,0.000008306896,0.000020810965,0.05561382],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844843,0.000017149454,0.0002936701,0.00045046347,0.00022681981,0.00056345656],"domain_scores_gemma":[0.99905956,0.00016090834,0.000065901455,0.00042147987,0.00005915491,0.00023297871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004932282,0.00018003178,0.00018532199,0.000094690644,0.000125776,0.00015470179,0.0007072183,0.00008533887,0.00015459437],"category_scores_gemma":[0.0000028806455,0.00016081943,0.00010110674,0.00038133084,0.000016712222,0.0001928577,0.00009534423,0.00009013465,0.000090662914],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012657203,0.000028095286,7.494994e-7,0.000001921528,0.00003684203,0.000013525655,0.000019463285,0.008851398,7.000897e-7,0.08682521,0.042993013,0.8612164],"study_design_scores_gemma":[0.0015443473,0.00010931642,0.00014621428,0.000009207966,0.000020439846,0.0000056924323,0.00001635649,0.9322777,0.000012065843,0.0005175491,0.06511862,0.00022249906],"about_ca_topic_score_codex":0.0000074039062,"about_ca_topic_score_gemma":0.000024489296,"teacher_disagreement_score":0.9234263,"about_ca_system_score_codex":0.00003871384,"about_ca_system_score_gemma":0.000026780184,"threshold_uncertainty_score":0.6558026},"labels":[],"label_agreement":null},{"id":"W1965570703","doi":"10.1002/nem.424","title":"Service differentiation using a multi‐level RED mechanism","year":2002,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Computer science; Random early detection; Router; Network packet; Differentiated services; Queue; Scheme (mathematics); Computer network; Service (business); Active queue management; Simple (philosophy); Distributed computing; Network congestion","score_opus":0.057753821467320374,"score_gpt":0.25454334974677784,"score_spread":0.19678952827945745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965570703","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004750194,0.00020810234,0.9871983,0.003879199,0.0032171102,0.000107793654,8.6986705e-7,0.000038038215,0.00060041354],"genre_scores_gemma":[0.8868059,0.00018963167,0.11029326,0.0014612766,0.00086934085,0.000003382381,0.0000012193501,0.000009226781,0.00036678452],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984651,0.00007003566,0.00045767942,0.00017040587,0.0006358247,0.00020093432],"domain_scores_gemma":[0.9988347,0.00003982848,0.0004415671,0.00018215219,0.00042372232,0.000078028825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029349403,0.00012523383,0.00015081333,0.00016154489,0.00007250693,0.00019368547,0.0011466271,0.00003734837,0.000089641544],"category_scores_gemma":[0.0000068705995,0.00011617745,0.00010581286,0.00024494572,0.0000075594876,0.00043323697,0.00022214634,0.00013398624,0.000023682762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056273475,0.0003857535,0.00029265665,0.000015359643,0.0011377296,0.00041980518,0.00035033727,0.16243632,0.0001044933,0.14124708,0.009411508,0.6841427],"study_design_scores_gemma":[0.0013609738,0.000032524287,0.001588334,0.000119101365,0.00003936982,0.00008842081,0.000020978961,0.9876404,0.000008708701,0.00350305,0.0054669916,0.00013117187],"about_ca_topic_score_codex":0.000003187377,"about_ca_topic_score_gemma":0.000007962073,"teacher_disagreement_score":0.8820557,"about_ca_system_score_codex":0.0001128856,"about_ca_system_score_gemma":0.000010964004,"threshold_uncertainty_score":0.4737579},"labels":[],"label_agreement":null},{"id":"W1966156341","doi":"10.1109/icc.2014.6883782","title":"Convergence performance of the OFEX controller for high-speed networks","year":2014,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Queue; Bandwidth (computing); Network congestion; Controller (irrigation); Control theory (sociology); Convergence (economics); Queueing theory; Rate of convergence; Flow control (data); Real-time computing; Computer network; Network packet; Control (management)","score_opus":0.005683662236597923,"score_gpt":0.18298945363408928,"score_spread":0.17730579139749136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966156341","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04692719,0.000054169017,0.949157,0.001359041,0.0010178573,0.00033334416,5.530354e-7,0.000077762874,0.0010730535],"genre_scores_gemma":[0.99441934,0.000011508274,0.0024807018,0.001112222,0.00016415087,0.000020670414,3.712641e-7,0.000005110212,0.001785915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911934,0.000055180764,0.00023225794,0.00020927696,0.0001569839,0.00022698281],"domain_scores_gemma":[0.9990254,0.0002710346,0.00012117761,0.00040696698,0.00012877084,0.000046637724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037097922,0.00010050585,0.00018657246,0.000017560069,0.000117592324,0.000028981998,0.00084667926,0.000052219464,0.000023656063],"category_scores_gemma":[0.000031258798,0.00006192317,0.000085843305,0.00017616567,0.000065232154,0.00013623737,0.00008667631,0.00007386095,0.000009459209],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006533989,0.000036618516,0.0025098105,0.000012400862,0.000034788773,5.6678648e-8,0.000047390666,0.058375124,0.00019685173,0.6228469,0.006039133,0.30983555],"study_design_scores_gemma":[0.0010444045,0.0000970724,0.004924053,0.000011401855,0.00000832875,8.9648114e-7,0.0000021500862,0.98982733,0.00030408218,0.00041007687,0.003282442,0.000087786146],"about_ca_topic_score_codex":0.0000064830483,"about_ca_topic_score_gemma":0.00000477299,"teacher_disagreement_score":0.9474922,"about_ca_system_score_codex":0.000008038668,"about_ca_system_score_gemma":0.00002410756,"threshold_uncertainty_score":0.25251538},"labels":[],"label_agreement":null},{"id":"W1966294224","doi":"10.1109/mownet.2013.6613791","title":"Approach for enhancing data transfer security and performance over internet","year":2013,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; The Internet; Dilemma; Computer security; Internet security; Measure (data warehouse); Work (physics); Data security; Information security; Security service; World Wide Web; Data mining; Engineering; Encryption","score_opus":0.018310245277681447,"score_gpt":0.21722778610285623,"score_spread":0.1989175408251748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966294224","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.104113385,0.00008265171,0.89333236,0.00020461557,0.00008239506,0.00027749335,0.0000017041538,0.00008832549,0.0018170805],"genre_scores_gemma":[0.977038,0.000014957397,0.021780603,0.00045531482,0.00007254012,0.000049218434,0.000009215551,0.0000040869663,0.0005760448],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992714,0.000013946648,0.00012118745,0.00033680498,0.00008158761,0.00017509292],"domain_scores_gemma":[0.9994206,0.000055089295,0.000010801602,0.00041930238,0.000032106356,0.00006211131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018505941,0.000082095445,0.00009645942,0.00001997885,0.00004471201,0.00015405807,0.0006084338,0.000035029036,0.00004671639],"category_scores_gemma":[0.0000049544587,0.00006456906,0.00001565193,0.00005707173,0.00002192132,0.0008805704,0.00014519398,0.000064499676,0.000010699032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015088874,0.000074185686,0.001116214,0.0000756632,0.000038807186,2.873244e-7,0.0010362181,0.0000728768,0.000112625035,0.04666589,0.014336771,0.93645537],"study_design_scores_gemma":[0.00034514442,0.000043616477,0.0006214063,0.0000053373697,0.0000041740527,0.0000034901955,0.000017726705,0.99636257,0.00011490751,0.00015438111,0.0022292063,0.00009803095],"about_ca_topic_score_codex":0.000026283433,"about_ca_topic_score_gemma":0.000022350912,"teacher_disagreement_score":0.99628973,"about_ca_system_score_codex":0.00000519319,"about_ca_system_score_gemma":0.00001544738,"threshold_uncertainty_score":0.263305},"labels":[],"label_agreement":null},{"id":"W1966813352","doi":"10.1145/2096149.2096158","title":"Improving TCP performance in residential broadband networks","year":2012,"lang":"en","type":"article","venue":"ACM SIGCOMM Computer Communication Review","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Waterloo","funders":"","keywords":"Computer science; Computer network; Asymmetric digital subscriber line; Bottleneck; The Internet; Queueing theory; Broadband; Access network; Digital subscriber line; Telecommunications","score_opus":0.017892784532879288,"score_gpt":0.2508982643009009,"score_spread":0.2330054797680216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966813352","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027989983,0.29786196,0.6892613,0.0073273517,0.0007744014,0.00081872154,4.1995239e-7,0.00034686542,0.00080994476],"genre_scores_gemma":[0.85982573,0.07312941,0.061274752,0.0052402983,0.00030761317,0.00012044794,0.000016653248,0.00001916457,0.00006593664],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975323,0.0006936815,0.0006981299,0.00030472458,0.00025719736,0.0005139837],"domain_scores_gemma":[0.99565166,0.00050093717,0.00031415696,0.003265883,0.000109146975,0.00015823297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016525559,0.0002374857,0.00042438132,0.000101959056,0.00021982666,0.00015223034,0.0037992576,0.0000888672,0.00003120353],"category_scores_gemma":[0.000067625224,0.00022839743,0.00011326671,0.00066910434,0.00005435935,0.0012548676,0.0017300776,0.00049919146,0.00009677967],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030898357,0.000084446096,0.0037349064,0.00016699947,0.000012768242,8.717288e-7,0.000107202395,0.00079333415,0.0000011570597,0.005052928,0.005653016,0.9843893],"study_design_scores_gemma":[0.00086477306,0.000060930248,0.026186379,0.0027814566,0.000037635647,0.000053254134,0.0000035328096,0.8426611,0.0000060342086,0.00010614093,0.12667009,0.0005687005],"about_ca_topic_score_codex":0.000027866356,"about_ca_topic_score_gemma":0.00001592251,"teacher_disagreement_score":0.98382056,"about_ca_system_score_codex":0.000067925845,"about_ca_system_score_gemma":0.000047187874,"threshold_uncertainty_score":0.9313777},"labels":[],"label_agreement":null},{"id":"W1967666605","doi":"10.1145/2019583.2019589","title":"An adaptive and predictive approach for autonomic multirate multicast networks","year":2011,"lang":"en","type":"article","venue":"ACM Transactions on Autonomous and Adaptive Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; St. Francis Xavier University","funders":"","keywords":"Multicast; Computer science; Xcast; Computer network; Source-specific multicast; Pragmatic General Multicast; Protocol Independent Multicast; Distributed computing; Scalability; Multicast address; IP multicast","score_opus":0.0352520881583181,"score_gpt":0.22558506519002214,"score_spread":0.19033297703170404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967666605","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018689892,0.00041570532,0.99525774,0.00003719805,0.00041289048,0.001253344,0.00006815203,0.00026898886,0.00041697887],"genre_scores_gemma":[0.9220859,0.00004280806,0.07695276,0.00006933399,0.000101563855,0.0005286029,0.000005594048,0.000026464633,0.00018696082],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815893,0.00015799384,0.0003521351,0.0008145531,0.000110595545,0.00040578525],"domain_scores_gemma":[0.9986434,0.00021285683,0.00015117979,0.000584905,0.00012930155,0.00027836277],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031370734,0.00032166604,0.00038136152,0.00012645195,0.00045809176,0.0001597619,0.00045870437,0.00016515191,0.0000032952305],"category_scores_gemma":[0.000005510593,0.00029035207,0.00008507207,0.0001381709,0.00016503273,0.00056863326,0.000016996411,0.00024729277,0.0000029233358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076981256,0.0006637621,0.00004738326,0.000024584662,0.00041678856,0.000007627118,0.0038610008,0.32098812,0.000043504697,0.041653667,0.000026024365,0.63149774],"study_design_scores_gemma":[0.0012258515,0.001670898,0.0006880785,0.000030937597,0.00006377943,0.000029437533,0.0009923483,0.9946068,0.000023144326,0.00015817126,0.0001839347,0.00032661992],"about_ca_topic_score_codex":0.00011824021,"about_ca_topic_score_gemma":0.000014698835,"teacher_disagreement_score":0.9202169,"about_ca_system_score_codex":0.00006950319,"about_ca_system_score_gemma":0.00007050876,"threshold_uncertainty_score":0.9999549},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.009033757645429288,"score_gpt":0.19146117116477712,"score_spread":0.18242741351934783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W196807934","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022537935,0.00041896605,0.07035559,0.0034480141,0.0010434652,0.0002617755,0.0000089004925,0.00070821674,0.9237325],"genre_scores_gemma":[0.006748314,0.00039497254,0.0023645603,0.002533591,0.0013304858,0.000011364945,0.000027926553,0.000033966855,0.9865548],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986336,0.000012013714,0.0003000208,0.0005021115,0.00029691553,0.00025529208],"domain_scores_gemma":[0.99900776,0.00003291103,0.00013848582,0.00062498805,0.000074687785,0.000121138735],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00009441217,0.0002773018,0.00028671246,0.00011836641,0.000055006494,0.00020846771,0.0007686206,0.0002937032,0.0021696053],"category_scores_gemma":[0.0000017439799,0.00025844466,0.00013554822,0.000047311823,0.000038812144,0.0002503956,0.00016829986,0.00028226335,0.003201185],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027331275,0.0000059223044,0.0000050837148,0.0000019448044,0.000033254833,0.000024875639,0.000020202342,0.000010993512,0.00000926884,0.19135295,0.0043050605,0.8042277],"study_design_scores_gemma":[0.00026490574,0.000022142849,0.00017984344,0.00007808321,0.00001715973,0.000015411026,2.5065913e-7,0.014559082,0.0000016325316,0.00090873364,0.9835838,0.00036897694],"about_ca_topic_score_codex":3.8313098e-7,"about_ca_topic_score_gemma":0.0000065468985,"teacher_disagreement_score":0.97927874,"about_ca_system_score_codex":0.000038247552,"about_ca_system_score_gemma":0.00010537031,"threshold_uncertainty_score":0.99998677},"labels":[],"label_agreement":null},{"id":"W1968845049","doi":"10.1016/j.comcom.2004.12.010","title":"Analysis of virtual-time complexity in weighted fair queuing","year":2004,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Queueing theory; Real-time computing; Computer network","score_opus":0.03432446640692584,"score_gpt":0.2669674836539469,"score_spread":0.23264301724702108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968845049","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027066642,0.00024156932,0.96767306,0.0036358205,0.00009587925,0.00015717841,0.00000553499,0.00019010488,0.0009342361],"genre_scores_gemma":[0.84136474,0.000036747162,0.15825146,0.00025217308,0.000017688622,0.000015714608,0.000030312729,0.000005055435,0.000026089278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986649,0.00021520062,0.00046770295,0.0002720146,0.0001748598,0.00020532218],"domain_scores_gemma":[0.99696136,0.00027320796,0.00016425275,0.0023874543,0.0001403859,0.00007335182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003031884,0.00013040431,0.0003717563,0.0004968463,0.00014121013,0.000066543915,0.0027801748,0.00005666253,0.000014652465],"category_scores_gemma":[0.000009009337,0.00013741701,0.0001594026,0.0024363305,0.00018651207,0.00027015703,0.00083863846,0.00020101559,0.00003859129],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004338383,0.00042951605,0.0013916679,0.000002487811,0.00034181782,0.0000027160843,0.0013866922,0.05870087,0.00006282972,0.78977776,0.0001157494,0.14778358],"study_design_scores_gemma":[0.00053343293,0.000039980012,0.016276503,0.000031358435,0.00006450352,0.0000017049741,0.000010857139,0.97822124,0.000012109104,0.0039214552,0.00074242573,0.00014443375],"about_ca_topic_score_codex":0.000110984714,"about_ca_topic_score_gemma":0.00036521794,"teacher_disagreement_score":0.9195204,"about_ca_system_score_codex":0.00007708663,"about_ca_system_score_gemma":0.000091899885,"threshold_uncertainty_score":0.5603703},"labels":[],"label_agreement":null},{"id":"W1968941631","doi":"10.1109/lcomm.2012.111612.121860","title":"Multi-Ring ERP Network Design: A Traffic Engineering Approach","year":2012,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Network planning and design; Computer network; Ethernet flow control; Ethernet; Network switch; Bandwidth (computing); Distributed computing","score_opus":0.05004710720158148,"score_gpt":0.2454693222463814,"score_spread":0.19542221504479992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968941631","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033395505,0.0017836428,0.99035966,0.003027204,0.00055801804,0.0002732085,4.5457807e-7,0.0005414804,0.00011675597],"genre_scores_gemma":[0.5332185,0.00003657504,0.4655207,0.00090035476,0.00018595593,0.00010450908,0.000002442296,0.000012775836,0.000018169138],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985742,0.00022466223,0.00026478575,0.00021923883,0.00015712564,0.0005599706],"domain_scores_gemma":[0.9973267,0.00037299018,0.00008701042,0.0020192887,0.0000343133,0.00015974231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064735196,0.00018241645,0.00017580282,0.000087650355,0.00032548187,0.00013095111,0.0023318068,0.00006202502,0.0000020832335],"category_scores_gemma":[0.00002004766,0.00019275339,0.00008621968,0.0005030248,0.00006261908,0.0005491337,0.00023076894,0.00034537105,0.00006482302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021905682,0.0001430072,0.0000991927,0.0000057822813,0.000049431612,6.943685e-7,0.0008073053,0.94070745,0.0010312013,0.004058466,0.0038162246,0.049279045],"study_design_scores_gemma":[0.00030038375,0.0000063857506,0.00040375613,0.000020306485,0.0000150819615,0.000016418173,0.00001113349,0.99091405,0.000019721188,0.0000021743458,0.008064023,0.00022656073],"about_ca_topic_score_codex":0.0000029961284,"about_ca_topic_score_gemma":0.0000012576448,"teacher_disagreement_score":0.529879,"about_ca_system_score_codex":0.00006469056,"about_ca_system_score_gemma":0.000024075744,"threshold_uncertainty_score":0.7860255},"labels":[],"label_agreement":null},{"id":"W1969259629","doi":"10.2514/6.2002-1912","title":"An Independent Implementation of SCPS-TP with Simulation Extrapolation for Complex Networks","year":2002,"lang":"en","type":"article","venue":"20th AIAA International Communication Satellite Systems Conference and Exhibit","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Space Agency; Communications Research Centre Canada","funders":"Canadian Space Agency; Vedecká Grantová Agentúra MŠVVaŠ SR a SAV","keywords":"Extrapolation; Computer science; Parallel computing; Mathematics; Statistics","score_opus":0.04984345237660755,"score_gpt":0.3050907709423442,"score_spread":0.2552473185657367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969259629","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020904632,0.0009532861,0.9753481,0.00066322635,0.00017347536,0.0007578241,0.000021711796,0.0000986148,0.0010791126],"genre_scores_gemma":[0.993032,0.0005814666,0.0057381107,0.00009984643,0.00008186534,0.000106487125,0.00024800748,0.000011604355,0.0001006046],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837863,0.00017324382,0.00056455325,0.00033810665,0.00035195245,0.00019352783],"domain_scores_gemma":[0.99783796,0.00024110971,0.00046398345,0.00060556195,0.0007607005,0.00009069927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004854324,0.0001713769,0.0002250915,0.00015176828,0.00018626415,0.0003391813,0.0007111768,0.000085610445,0.000070245274],"category_scores_gemma":[0.000009314314,0.00016061943,0.000042077365,0.00017052465,0.00006932986,0.0010488922,0.00006843615,0.00011418883,0.000004115533],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008025575,0.0001292618,0.008534246,0.00003356527,0.0001239364,6.4336143e-7,0.0017651501,0.08983903,0.00055356964,0.17641512,0.00012601944,0.72239923],"study_design_scores_gemma":[0.0010054276,0.00017363895,0.007927879,0.00006804469,0.000017049893,0.0000073471897,0.00045616622,0.98394185,0.000037274967,0.00027708692,0.0059097526,0.0001784724],"about_ca_topic_score_codex":0.000112697366,"about_ca_topic_score_gemma":0.00012766814,"teacher_disagreement_score":0.9721274,"about_ca_system_score_codex":0.000044575376,"about_ca_system_score_gemma":0.000030147412,"threshold_uncertainty_score":0.65498704},"labels":[],"label_agreement":null},{"id":"W1969412326","doi":"10.1109/tpds.2015.2392760","title":"Achieving Optimal Traffic Engineering Using a Generalized Routing Framework","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science and Technology Entrepreneurship Development Board","keywords":"Multiprotocol Label Switching; Computer science; Open Shortest Path First; Traffic engineering; Constrained Shortest Path First; Mathematical optimization; Routing protocol; Computer network; Label switching; Path vector protocol; Equal-cost multi-path routing; Shortest path problem; Distributed computing; Routing (electronic design automation); Link-state routing protocol; Quality of service; Mathematics; Graph; K shortest path routing; Theoretical computer science","score_opus":0.029587908186772375,"score_gpt":0.24143042635176265,"score_spread":0.21184251816499028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969412326","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.105529815,0.0005227388,0.8919276,0.00014315819,0.0012105788,0.00022980371,0.00002507437,0.00039853642,0.000012673833],"genre_scores_gemma":[0.9773646,0.000016946726,0.022318339,0.00004155134,0.0001504606,0.000046662048,0.000004940563,0.000016772905,0.00003972696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837774,0.00011297962,0.0003825558,0.0004223981,0.00028981865,0.0004144801],"domain_scores_gemma":[0.9990009,0.00014757173,0.000100633966,0.00033204586,0.00009038083,0.00032844627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003347481,0.00025495622,0.0003331249,0.00010161421,0.00025376174,0.0003513822,0.0002935595,0.0001620584,0.000002215015],"category_scores_gemma":[0.000013776133,0.00024362154,0.00009736252,0.0003972179,0.00002769969,0.00031835597,0.0000043029113,0.00031431505,0.000010999706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029198722,0.00004756875,0.000009289805,0.000012353875,0.000051349216,0.000014713925,0.00024504526,0.99161243,0.00005750507,0.0022628282,0.000050932005,0.0056067645],"study_design_scores_gemma":[0.0008907117,0.00007051538,0.000012451403,0.00012148776,0.00003254602,0.00010213599,0.0001430398,0.9979801,0.0000064943038,0.000008556869,0.00035611386,0.0002758521],"about_ca_topic_score_codex":0.000035449357,"about_ca_topic_score_gemma":0.0000017855708,"teacher_disagreement_score":0.8718348,"about_ca_system_score_codex":0.00009668137,"about_ca_system_score_gemma":0.00008518316,"threshold_uncertainty_score":0.9934598},"labels":[],"label_agreement":null},{"id":"W1969460318","doi":"10.1109/sarnof.2008.4520089","title":"Multipath routing with adaptive playback scheduling for Voice over IP in Service Overlay Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Voice over IP; Computer science; Computer network; Quality of service; Scheduling (production processes); Multipath propagation; Jitter; Phone; Handover; Telecommunications; The Internet; Engineering","score_opus":0.02123630696514479,"score_gpt":0.22294912225573982,"score_spread":0.20171281529059504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969460318","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08069505,0.00011587675,0.91709065,0.00044308745,0.00017672921,0.00041504446,0.0000010234544,0.0002023825,0.00086016755],"genre_scores_gemma":[0.8976622,0.0000089295145,0.099935144,0.0018333041,0.0001989831,0.00005956588,0.0000021292853,0.000015698257,0.0002840428],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984559,0.00005189904,0.00026978162,0.00050816673,0.00021401813,0.00050027436],"domain_scores_gemma":[0.99887705,0.00043372193,0.00011266322,0.00032847954,0.00013861794,0.000109472894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026840845,0.00020714395,0.00024504872,0.00006147875,0.00019699581,0.00006769685,0.0004798248,0.0000980297,0.000008543092],"category_scores_gemma":[0.000019100018,0.00017056846,0.00005340281,0.00055512524,0.000027605378,0.00052540394,0.00009542096,0.0002266148,0.000015865398],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021883508,0.000099568744,0.006986893,0.000007703654,0.000045967576,0.000043578417,0.0011035798,0.9260954,0.0000119612505,0.024619212,0.00034416746,0.040423095],"study_design_scores_gemma":[0.002112816,0.00010955661,0.0072824485,0.00006348651,0.0000067693572,0.00002184844,0.000081993785,0.98961717,0.000011553717,0.00003884426,0.0003948149,0.00025872712],"about_ca_topic_score_codex":0.0001480012,"about_ca_topic_score_gemma":0.00071305956,"teacher_disagreement_score":0.8171555,"about_ca_system_score_codex":0.00005507026,"about_ca_system_score_gemma":0.00010052751,"threshold_uncertainty_score":0.695558},"labels":[],"label_agreement":null},{"id":"W1969614761","doi":"10.1002/nem.690","title":"Limitations of current Ethernet switch architectures for enhanced flow control and service differentiation","year":2008,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Computer science; Computer network; Carrier Ethernet; Ethernet flow control; Flow control (data); Ethernet; Ethernet over SDH; Network switch","score_opus":0.03786559219329814,"score_gpt":0.2565917696170034,"score_spread":0.2187261774237053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969614761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044953905,0.00080965296,0.94995636,0.0025534257,0.0013140904,0.00022889997,0.0000037953118,0.000015621252,0.00016425076],"genre_scores_gemma":[0.9781946,0.0005527602,0.020129029,0.0005190049,0.00053932576,0.000019202665,0.0000032172418,0.0000060650664,0.000036771668],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988313,0.000055938097,0.00043713662,0.00013926218,0.000398772,0.0001376239],"domain_scores_gemma":[0.9985011,0.00033450403,0.00044037923,0.00011322855,0.000554654,0.000056122764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024603787,0.00010404229,0.0001805209,0.00012478004,0.00006267706,0.000040660118,0.0005373987,0.000023951212,0.0000033862236],"category_scores_gemma":[0.000024510944,0.00009009308,0.000094788775,0.00012173141,0.000023475934,0.00009044084,0.00006873479,0.000097988355,0.0000011288723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018392292,0.00011195971,0.00028341546,0.00001766326,0.00045938208,0.0000072019557,0.0005035852,0.240182,0.000055325017,0.016644606,0.0015866602,0.7399643],"study_design_scores_gemma":[0.005395978,0.0002598332,0.024670085,0.00025685804,0.00012739567,0.000059029815,0.00003701303,0.93691695,0.000074917516,0.017686587,0.014290167,0.0002251666],"about_ca_topic_score_codex":0.0000010007044,"about_ca_topic_score_gemma":0.00001061052,"teacher_disagreement_score":0.9332407,"about_ca_system_score_codex":0.000028489681,"about_ca_system_score_gemma":0.000028651728,"threshold_uncertainty_score":0.36738893},"labels":[],"label_agreement":null},{"id":"W1969710891","doi":"10.1109/glocom.2006.426","title":"QRP02-3: SAM: A New Bandwidth Constraint Model for Diff-Serv-Aware MPLS Networks","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Bandwidth (computing); Computer science; Multiprotocol Label Switching; Constraint (computer-aided design); Computer network; Dynamic bandwidth allocation; Bandwidth management; Distributed computing; Quality of service; Engineering","score_opus":0.012389702287074153,"score_gpt":0.21609680070158935,"score_spread":0.2037070984145152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969710891","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016164788,0.00042583921,0.9922769,0.0026308757,0.0008191045,0.0004520429,0.000017905595,0.0004096664,0.001351196],"genre_scores_gemma":[0.9568459,0.000016053316,0.037156697,0.001690082,0.001175635,0.0000638622,0.000028028928,0.000020153395,0.003003604],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822754,0.00003705757,0.00037330552,0.0005370572,0.0002127766,0.00061227864],"domain_scores_gemma":[0.9988586,0.00015107477,0.00012508241,0.00055372197,0.0001000521,0.0002115193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019236747,0.00025827275,0.00031029494,0.000051599724,0.0001993408,0.00024838533,0.0007997742,0.00014235862,0.000033525444],"category_scores_gemma":[0.000010832822,0.00024390614,0.00019157279,0.00022337968,0.00005546646,0.00024661014,0.00012078788,0.00015852014,0.000029880051],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028632036,0.000076601864,0.00037785078,0.000008836091,0.00002975488,0.0000069582948,0.00007472259,0.32602122,0.000008842418,0.122198015,0.1359379,0.41523066],"study_design_scores_gemma":[0.0013505521,0.000049434144,0.00030079056,0.000023043463,0.000019157776,0.000013870351,0.0000062954664,0.97123826,0.0000051951474,0.012613568,0.014088627,0.00029119334],"about_ca_topic_score_codex":0.00011968606,"about_ca_topic_score_gemma":0.00028704476,"teacher_disagreement_score":0.9552294,"about_ca_system_score_codex":0.00006088653,"about_ca_system_score_gemma":0.00019755126,"threshold_uncertainty_score":0.9946203},"labels":[],"label_agreement":null},{"id":"W1969756831","doi":"10.1145/1164717.1164723","title":"Performance evaluation of a streaming based protocol for 3D virtual environment exploration on mobile devices","year":2006,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Rendering (computer graphics); Mobile device; Virtual reality; Visualization; Bandwidth (computing); Frame rate; Throughput; Mobile computing; Wireless; Protocol (science); Multimedia; Real-time computing; Computer network; Human–computer interaction; Artificial intelligence","score_opus":0.032275451057884055,"score_gpt":0.27629102502689773,"score_spread":0.2440155739690137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969756831","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02499673,0.0000019878707,0.9119588,0.0000843731,0.000036782985,0.061894014,0.0000010382015,0.000060044713,0.00096619735],"genre_scores_gemma":[0.7600594,9.6713244e-8,0.014987082,0.000043507967,0.00005120823,0.22478078,0.000004832414,0.0000034795619,0.00006957584],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902457,0.00005592033,0.00020806694,0.00020399768,0.00039682767,0.00011059726],"domain_scores_gemma":[0.9994942,0.00008689546,0.00011729911,0.00019983557,0.000083425075,0.00001832452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000503074,0.00008290232,0.00008119851,0.00004689809,0.000068842695,0.000029904304,0.00014942858,0.00002928757,0.000039521146],"category_scores_gemma":[0.000004786809,0.00006910835,0.000030349434,0.000069251604,0.000014002076,0.00033969388,0.000013239569,0.000025817048,0.000010557566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024390514,0.00010104945,0.000115293566,0.000006869471,0.0000020104867,2.7108538e-8,0.000018018072,0.41652775,0.000092826915,0.0017443793,0.00007883188,0.5812886],"study_design_scores_gemma":[0.0015263803,0.0006284601,0.00087719486,0.000026724612,0.000007716075,8.908003e-8,0.00001312673,0.9922242,0.002019618,0.000055248252,0.0025428094,0.000078411904],"about_ca_topic_score_codex":0.000003518128,"about_ca_topic_score_gemma":0.0000077366285,"teacher_disagreement_score":0.89697176,"about_ca_system_score_codex":0.000048121776,"about_ca_system_score_gemma":0.00006571183,"threshold_uncertainty_score":0.28181568},"labels":[],"label_agreement":null},{"id":"W1970049485","doi":"10.1109/ccece.2014.6901045","title":"Leaky bucket like packet controller for SAVI","year":2014,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Controller (irrigation); Bandwidth (computing); Computer network; Network packet; Node (physics); Enhanced Data Rates for GSM Evolution; Real-time computing; Artificial intelligence; Engineering","score_opus":0.008992803813443199,"score_gpt":0.2144498580675882,"score_spread":0.205457054254145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970049485","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00053363445,0.00006631886,0.9835033,0.004035287,0.0006173228,0.0002848369,0.0000012778092,0.00034422413,0.010613818],"genre_scores_gemma":[0.96503544,0.0000048134116,0.018809678,0.00637043,0.00038180468,0.000089061024,0.0000020749242,0.000009641836,0.009297077],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896747,0.000053242005,0.00018568535,0.00032789714,0.0001495921,0.00031614274],"domain_scores_gemma":[0.99897784,0.00039258722,0.00005372348,0.00035499258,0.00010422035,0.000116654046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039716164,0.00012645667,0.00020060674,0.000039756662,0.00011552814,0.00013661677,0.0005356861,0.00006386312,0.00004528416],"category_scores_gemma":[0.000047279584,0.00009987772,0.000105692845,0.000111809175,0.00002815234,0.00018326659,0.00005585373,0.00006916566,0.000174176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016600103,0.000021517177,0.00004408801,0.0000024138837,0.0000142399,3.1347454e-7,0.00002868118,0.000114092494,0.000031381336,0.38931632,0.0555132,0.5548971],"study_design_scores_gemma":[0.0018267314,0.00012664919,0.00015550722,0.000004645561,0.000007777411,0.000003115441,0.0000056392155,0.61701256,0.00003384126,0.007977933,0.3726892,0.00015638536],"about_ca_topic_score_codex":0.0000041346107,"about_ca_topic_score_gemma":0.000016403435,"teacher_disagreement_score":0.9646936,"about_ca_system_score_codex":0.000011755051,"about_ca_system_score_gemma":0.000028950206,"threshold_uncertainty_score":0.4072895},"labels":[],"label_agreement":null},{"id":"W1970813527","doi":"10.1109/iscc.2007.4381596","title":"α_ SNFAQM: an active queue management mechanism using neurofuzzy prediction","year":2007,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Active queue management; Bottleneck; Random early detection; Network congestion; Computer science; Queue; Network packet; Computer network; Queueing theory; Queue management system; Packet loss; Real-time computing","score_opus":0.023868083665412262,"score_gpt":0.26145194946158473,"score_spread":0.23758386579617247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970813527","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04668889,0.000012277301,0.9389759,0.00021042512,0.0009858953,0.00026398493,0.0000012607625,0.0005217633,0.012339605],"genre_scores_gemma":[0.9015494,0.000011412234,0.09571609,0.0009918122,0.0002642339,0.00000926144,0.0000045471497,0.000013387462,0.00143984],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854124,0.000064915075,0.0002323504,0.00047034386,0.00031424157,0.00037690828],"domain_scores_gemma":[0.99914217,0.000041373794,0.00007318687,0.0004989461,0.00007626609,0.00016803131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044145694,0.00015528647,0.000121205645,0.00013718082,0.00019397431,0.00012270217,0.0004721119,0.00006896919,0.000040994357],"category_scores_gemma":[0.000004343107,0.0001474523,0.000050654995,0.00035154112,0.000020705074,0.00067164475,0.0001290452,0.00013523053,0.000053560052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003160126,0.000105377316,0.000040728777,0.0000049952837,0.000039926108,0.00003077413,0.00022430634,0.0018247782,0.0011398735,0.4777622,0.0002623635,0.5185331],"study_design_scores_gemma":[0.0014292703,0.00025863398,0.0037050117,0.00003240029,0.00006674632,0.00008953049,0.00027640513,0.96006733,0.0022124618,0.017314108,0.013979409,0.0005687012],"about_ca_topic_score_codex":0.00002601318,"about_ca_topic_score_gemma":0.000079625206,"teacher_disagreement_score":0.95824254,"about_ca_system_score_codex":0.00007204679,"about_ca_system_score_gemma":0.00002428739,"threshold_uncertainty_score":0.601293},"labels":[],"label_agreement":null},{"id":"W1970925610","doi":"10.1109/iwqos.2013.6550275","title":"Multi-resource generalized processor sharing for packet processing","year":2013,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Weighted fair queueing; Computer science; Fair queuing; Generalized processor sharing; Network packet; Processor sharing; Benchmark (surveying); Shared resource; Queueing theory; Computer network; Layered queueing network; Resource (disambiguation); Schedule; Resource allocation; Distributed computing; Operating system; Quality of service","score_opus":0.025535419159572408,"score_gpt":0.2533246386286467,"score_spread":0.22778921946907427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970925610","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011165249,0.00021663847,0.9839551,0.0024556823,0.00008367838,0.00062376936,4.3171315e-7,0.0005143849,0.0009850679],"genre_scores_gemma":[0.66435593,0.0000022799672,0.324233,0.0018552331,0.00018044956,0.00055893994,0.0000029864148,0.000016051545,0.008795111],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886084,0.000014274262,0.00020708851,0.00042912658,0.00013735313,0.00035133073],"domain_scores_gemma":[0.999312,0.000047172896,0.000075671545,0.00028179717,0.0001694195,0.000113935785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016589423,0.00013586487,0.00015031674,0.000046307854,0.00018452523,0.00047336138,0.000725886,0.000053430645,0.000048140275],"category_scores_gemma":[0.000028893439,0.00010791545,0.000058508744,0.00018780274,0.000021020542,0.0005813329,0.00010881389,0.000066404165,0.0000702325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063470907,0.00006283367,0.00028007707,0.000041350457,0.000013979603,7.6835306e-7,0.00030532738,0.00067481084,0.0005321558,0.01057707,0.0073739495,0.9801313],"study_design_scores_gemma":[0.0010059893,0.000023910357,0.00023610891,0.00001891774,0.0000048497177,0.0000034435377,0.000025380179,0.9867708,0.00022940867,0.00080822577,0.0106967855,0.0001761797],"about_ca_topic_score_codex":0.000015015447,"about_ca_topic_score_gemma":0.000009210002,"teacher_disagreement_score":0.98609596,"about_ca_system_score_codex":0.000016076638,"about_ca_system_score_gemma":0.000045924025,"threshold_uncertainty_score":0.45646346},"labels":[],"label_agreement":null},{"id":"W1971287606","doi":"10.1109/iwqos.2010.5542751","title":"On the model transform in stochastic network calculus","year":2010,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Network calculus; Computer science; Stochastic calculus; Mathematical optimization; Stochastic modelling; Stochastic process; Algorithm; Mathematics; Quality of service; Computer network","score_opus":0.008210383779730008,"score_gpt":0.20594247361684098,"score_spread":0.19773208983711096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971287606","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008454484,0.00001135734,0.9683245,0.008966744,0.00035404053,0.00017877315,2.1172445e-7,0.000103896935,0.013606012],"genre_scores_gemma":[0.994706,8.9427306e-7,0.0021133895,0.0023029894,0.00009277089,0.000034681325,1.8186115e-7,0.000004203192,0.0007449162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992576,0.000019611169,0.00012413642,0.00018936112,0.00014768512,0.0002616044],"domain_scores_gemma":[0.9993274,0.00024210452,0.000016789667,0.00034021653,0.000018323568,0.00005513677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003011369,0.00008757857,0.00008356485,0.000023656117,0.00008517271,0.00006112117,0.0005639566,0.000049796196,0.00004574973],"category_scores_gemma":[0.000014363575,0.00005247332,0.000039469796,0.00021388853,0.00002992476,0.000094223506,0.000025882915,0.00031738868,0.000060676874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032784096,0.000011704612,0.0000011135693,1.3829816e-7,0.0000013868354,8.70746e-7,0.000053146876,0.34849787,0.000004970492,0.58353627,0.0011562227,0.06673304],"study_design_scores_gemma":[0.00020951778,0.000019451261,0.000032074244,0.000004400397,0.0000013056441,0.0000020322655,0.0000031294462,0.96073794,0.0000037486068,0.03871903,0.00019411334,0.000073242605],"about_ca_topic_score_codex":0.000008801621,"about_ca_topic_score_gemma":0.0004274537,"teacher_disagreement_score":0.9862515,"about_ca_system_score_codex":0.000008426885,"about_ca_system_score_gemma":0.00004995097,"threshold_uncertainty_score":0.21397997},"labels":[],"label_agreement":null},{"id":"W1971349922","doi":"10.1002/nem.387","title":"Enhancing TCP performance with a load‐adaptive RED mechanism","year":2001,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Computer science; Computer network; Network packet; TCP acceleration; TCP global synchronization; Mechanism (biology); TCP tuning; TCP Friendly Rate Control; Network congestion","score_opus":0.008093867343004654,"score_gpt":0.2079347773148914,"score_spread":0.19984090997188675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971349922","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009456124,0.00017051939,0.9757441,0.0026347977,0.0016708778,0.00012051882,1.6032865e-7,0.00004555398,0.010157334],"genre_scores_gemma":[0.9477093,0.0005146259,0.048786733,0.0008619261,0.000925916,0.000007733409,4.0455302e-7,0.000008937191,0.0011844202],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981603,0.000045571876,0.00040121583,0.00019074204,0.0009507488,0.0002514023],"domain_scores_gemma":[0.9987444,0.00005092169,0.00039625866,0.00018775635,0.00053143204,0.00008921311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005706662,0.0001385185,0.00016897768,0.0001204669,0.00007646898,0.00014865614,0.0011400983,0.00002780373,0.00004045525],"category_scores_gemma":[0.0000046304244,0.00011070357,0.00007777054,0.0002568235,0.000020094854,0.00053195667,0.00017016465,0.00017436038,0.000020875388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006960309,0.00014021838,0.00051539874,0.0000072205835,0.0010455755,0.0017296558,0.0002455865,0.1325971,0.00002047281,0.1788134,0.0056756306,0.6785137],"study_design_scores_gemma":[0.007591868,0.0019505107,0.0066742445,0.0016914674,0.00018223106,0.0025705197,0.00025918815,0.76986545,0.00018567599,0.02099065,0.18711886,0.0009193238],"about_ca_topic_score_codex":0.0000015655,"about_ca_topic_score_gemma":0.000010198944,"teacher_disagreement_score":0.93825316,"about_ca_system_score_codex":0.00018353002,"about_ca_system_score_gemma":0.00006463141,"threshold_uncertainty_score":0.45143607},"labels":[],"label_agreement":null},{"id":"W1971405291","doi":"10.1109/iccnc.2012.6167405","title":"Enhancing TCP performance in wireless mesh networks by cross layer design","year":2012,"lang":"en","type":"article","venue":"2012 International Conference on Computing, Networking and Communications (ICNC)","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Università di Pisa","keywords":"Computer network; Computer science; Wireless mesh network; Zeta-TCP; TCP acceleration; TCP Friendly Rate Control; TCP global synchronization; Compound TCP; TCP delayed acknowledgment; TCP tuning; TCP Westwood plus; H-TCP; Distributed computing; Network packet; Transmission Control Protocol; Wireless network; Wireless; Telecommunications","score_opus":0.05847697346596767,"score_gpt":0.30135201276640133,"score_spread":0.24287503930043366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971405291","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036505535,0.0019877239,0.94617647,0.0017017538,0.00194493,0.00033496087,0.0000025293357,0.00028265134,0.011063448],"genre_scores_gemma":[0.9897025,0.0019027104,0.0066805794,0.0006052096,0.00050139497,0.000050071845,0.000028425118,0.000021163632,0.00050793606],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99755555,0.00039898368,0.0005879827,0.00043544004,0.00035330292,0.00066871266],"domain_scores_gemma":[0.99761045,0.00062211714,0.00032336533,0.0010343316,0.00021654264,0.00019318519],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014149208,0.00030443244,0.00029480545,0.00016269104,0.00051503844,0.00048351265,0.0023430232,0.00015724037,0.00003413158],"category_scores_gemma":[0.000019495967,0.00031386185,0.00006277971,0.00037160103,0.00017159087,0.0007711646,0.00078093656,0.00069612457,0.0000382773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057462323,0.00040751704,0.029264817,0.000009813578,0.00009055214,0.0000017807698,0.0010406752,0.00875675,0.00010414405,0.39192167,0.0025828693,0.5657619],"study_design_scores_gemma":[0.0005488308,0.00005278775,0.00533273,0.0002526784,0.0000073027186,0.00001709828,0.00003657756,0.9840982,0.000040319785,0.00022463365,0.009036189,0.00035268237],"about_ca_topic_score_codex":0.000023859122,"about_ca_topic_score_gemma":0.00002580847,"teacher_disagreement_score":0.97534144,"about_ca_system_score_codex":0.00010602825,"about_ca_system_score_gemma":0.00007217927,"threshold_uncertainty_score":0.99993134},"labels":[],"label_agreement":null},{"id":"W1971906746","doi":"10.1504/ijipt.2006.010560","title":"Design of AQM controllers for IP routers based on H∞ optimal control","year":2006,"lang":"en","type":"article","venue":"International Journal of Internet Protocol Technology","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Active queue management; Computer science; Controller (irrigation); Transmission Control Protocol; Network congestion; Computer network; Protocol (science); Queue; Internet Protocol; Explicit Congestion Notification; Control theory (sociology); The Internet; Control (management); Network packet; TCP Friendly Rate Control","score_opus":0.009793328408563484,"score_gpt":0.2655829703811905,"score_spread":0.255789641972627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971906746","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029219527,0.000009591766,0.96943825,0.0053763334,0.000494976,0.02415896,0.000005629533,0.000075062446,0.00014899373],"genre_scores_gemma":[0.90542686,3.5882906e-7,0.0663829,0.00052700547,0.00022779868,0.027295118,9.0183903e-7,0.000014544592,0.00012454233],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980376,0.00008766019,0.00091867574,0.0002419202,0.00046937048,0.00024478094],"domain_scores_gemma":[0.9971426,0.00044514565,0.0010308273,0.00024156678,0.0010921872,0.000047666676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061044144,0.00019307536,0.00040877305,0.0007516326,0.000023162536,0.00007866126,0.0020243279,0.00016960937,0.000021790385],"category_scores_gemma":[0.0001510636,0.00016034883,0.00022507756,0.00017208901,0.00012932763,0.00021841447,0.000055846987,0.00025816157,0.0000049131145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008907831,0.001057864,0.00076971913,0.000025928566,0.0006282954,0.0002216759,0.000048412774,0.5481271,0.0027808703,0.20634182,0.0097912075,0.22129926],"study_design_scores_gemma":[0.015774824,0.0026360552,0.00005796143,0.00019795033,0.000019030242,0.00011782798,0.000009841502,0.9581649,0.0068296343,0.00558265,0.010433001,0.00017636876],"about_ca_topic_score_codex":0.000005089288,"about_ca_topic_score_gemma":0.0000014247556,"teacher_disagreement_score":0.9051346,"about_ca_system_score_codex":0.00012873103,"about_ca_system_score_gemma":0.00020385828,"threshold_uncertainty_score":0.6538836},"labels":[],"label_agreement":null},{"id":"W1972961462","doi":"10.1177/0037549712443920","title":"Modeling and design of a Session Initiation Protocol overload control algorithm","year":2012,"lang":"en","type":"article","venue":"SIMULATION","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Retransmission; Computer science; Session (web analytics); Server; Computer network; Session Initiation Protocol; Process (computing); Queueing theory; Distributed computing; Real-time computing; Operating system","score_opus":0.0304902204412235,"score_gpt":0.2909972104357901,"score_spread":0.26050698999456656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972961462","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015487423,0.000032117136,0.98888105,0.00003809116,0.00007283906,0.009323321,6.5023426e-7,0.000063427295,0.000039789007],"genre_scores_gemma":[0.9657048,6.6383785e-7,0.03182482,0.000058754915,0.00010283602,0.002297171,0.0000010282725,0.000004138431,0.000005797631],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992886,0.00011019757,0.00019123411,0.00011814596,0.00015834314,0.00013344432],"domain_scores_gemma":[0.99948937,0.00015197993,0.00008710334,0.00012258478,0.00009816391,0.0000508288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036356304,0.00007144972,0.00009840207,0.00005198374,0.000060797527,0.000028639806,0.0000735522,0.000052110045,0.0000044150884],"category_scores_gemma":[0.000029362936,0.000063956795,0.000018170664,0.00010845062,0.00000942807,0.0007328303,0.000019967609,0.000047997935,0.000003161996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017145006,0.000021903903,0.0001761348,0.0000049722885,0.0000034851707,8.5816914e-8,0.00014202308,0.6973211,0.00011557808,0.0011238576,0.0000023830214,0.3010713],"study_design_scores_gemma":[0.0011585486,0.000046031702,0.00035959462,0.000022140157,0.000006591548,8.4738394e-7,0.0000053786734,0.9976085,0.00005177987,0.0006198686,0.000051100014,0.00006961671],"about_ca_topic_score_codex":0.0000029017874,"about_ca_topic_score_gemma":1.2037725e-7,"teacher_disagreement_score":0.96415603,"about_ca_system_score_codex":0.000015591922,"about_ca_system_score_gemma":0.000024809495,"threshold_uncertainty_score":0.26080823},"labels":[],"label_agreement":null},{"id":"W1973307886","doi":"10.4218/etrij.14.0113.0036","title":"OFEX Controller to Improve Queueing and User Performance in Multi-bottleneck Networks","year":2014,"lang":"en","type":"article","venue":"ETRI Journal","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Queueing theory; Router; Bottleneck; Queuing delay; Network congestion; Flow control (data); Queue; Packet loss; Controller (irrigation); Network packet; Bandwidth (computing); Signal-flow graph; Control theory (sociology); Computer network; Real-time computing; Engineering; Control (management)","score_opus":0.008250498071563986,"score_gpt":0.21956921576937768,"score_spread":0.21131871769781368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973307886","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13231625,0.00044207615,0.86449087,0.0016198693,0.00076739845,0.0001338616,1.4082772e-7,0.000038379567,0.00019117827],"genre_scores_gemma":[0.9857204,0.00010020263,0.011782617,0.0015462954,0.00043990943,0.000007708055,8.392072e-8,0.000008669138,0.00039410318],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987821,0.00010375059,0.00030541795,0.00024462087,0.0001852912,0.00037879738],"domain_scores_gemma":[0.99925053,0.00016257765,0.00010489743,0.00017067704,0.000083511906,0.00022780524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095167616,0.00013371638,0.0002218961,0.00015665036,0.00015492953,0.000269571,0.00039649967,0.000072208386,0.000007849954],"category_scores_gemma":[0.00008162138,0.00011222379,0.000043864533,0.00028275576,0.000019999097,0.00040242067,0.00009642266,0.00043526632,0.000019051142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053358275,0.00004094243,0.01642693,0.000003944377,0.000017890508,0.000012063091,0.00036026977,0.045883596,0.00010793462,0.0020470195,0.00065267325,0.9343934],"study_design_scores_gemma":[0.0025457013,0.0001267786,0.03955631,0.00005518854,0.000003921852,0.00005070052,0.000009852746,0.9458291,0.000014790247,0.000025180354,0.011626696,0.00015576385],"about_ca_topic_score_codex":0.000004783007,"about_ca_topic_score_gemma":0.0000144848245,"teacher_disagreement_score":0.9342376,"about_ca_system_score_codex":0.000039316452,"about_ca_system_score_gemma":0.000035676236,"threshold_uncertainty_score":0.45763534},"labels":[],"label_agreement":null},{"id":"W1974416483","doi":"10.1145/1028788.1028836","title":"Measurement based characterization and provisioning of IP VPNs","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Provisioning; Computer science; Computer network; Simple Network Management Protocol; Private network; Scalability; Distributed computing; Network management","score_opus":0.012563060607429356,"score_gpt":0.1942130263008407,"score_spread":0.18164996569341135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974416483","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03177618,0.000028931427,0.9662438,0.0015154799,0.00006344822,0.00009137816,1.683297e-7,0.00006197086,0.00021866542],"genre_scores_gemma":[0.98903084,0.0000024074782,0.010644806,0.00026992234,0.000016328535,0.0000051756756,6.144971e-7,0.0000018386038,0.000028042658],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999504,0.0000138165215,0.00010489279,0.00012237682,0.00018138447,0.00007349358],"domain_scores_gemma":[0.9997101,0.000007398225,0.000042996002,0.00011931145,0.000086538996,0.000033687338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017782235,0.00004426571,0.000061689556,0.000030608342,0.000035791687,0.000032155243,0.00010359252,0.000016936052,0.0000043219375],"category_scores_gemma":[0.000011762583,0.000036514182,0.000013356975,0.000094856434,0.000011829559,0.00014050031,0.000020733485,0.000024036977,0.0000024465471],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006374969,0.000055332755,0.00036960855,0.000011886222,0.0000069285175,0.0000011876708,0.00011226592,0.001944405,0.016536674,0.08221314,0.000008651642,0.89873356],"study_design_scores_gemma":[0.0028919692,0.00028532703,0.048326083,0.0002167947,0.000014508738,0.000004718278,0.00001591867,0.9269461,0.01834507,0.0008709228,0.0018038878,0.00027868696],"about_ca_topic_score_codex":0.0000043062837,"about_ca_topic_score_gemma":0.0000035277449,"teacher_disagreement_score":0.9572547,"about_ca_system_score_codex":0.00001467585,"about_ca_system_score_gemma":0.00007051106,"threshold_uncertainty_score":0.14890051},"labels":[],"label_agreement":null},{"id":"W1974581592","doi":"10.1109/glocom.2006.251","title":"NGL02-3: Price-Sensitive Application Adaptation in Deadline-Based Networks","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; University of Manitoba","funders":"","keywords":"Computer science; Transfer (computing); Adaptation (eye); Scheme (mathematics); Real-time computing; Computer network; Traffic intensity; Control (management); Operating system","score_opus":0.005018598314116307,"score_gpt":0.19122718687787707,"score_spread":0.18620858856376077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974581592","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010078945,0.00013343866,0.98624897,0.0010079122,0.00017980464,0.0002558583,0.0000010063536,0.00019765951,0.0018964302],"genre_scores_gemma":[0.9852437,0.0000032160149,0.013827345,0.00055474683,0.00021573021,0.000050981365,0.000024833387,0.000006493171,0.00007297245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898934,0.00007181947,0.00023942727,0.00031793283,0.00013159068,0.00024989335],"domain_scores_gemma":[0.9993899,0.000113011,0.000100153055,0.00028245448,0.00007064323,0.0000438533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020693683,0.00011612324,0.000125968,0.00007505162,0.000062737745,0.000067045534,0.00025878235,0.00007646765,0.0000037957611],"category_scores_gemma":[0.0000075408875,0.00012084148,0.000042356223,0.00048237233,0.00001942723,0.00017257566,0.000028624185,0.00011549222,0.000047315723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015523572,0.00007520955,0.0012812956,0.0000021182177,0.0000029319651,0.0000073605943,0.000038715818,0.64796525,0.000020763502,0.041413642,0.0007706583,0.30840653],"study_design_scores_gemma":[0.0005878127,0.000020721418,0.014813174,0.000010615647,0.000003151202,0.0000021614485,0.000010054723,0.9806211,0.00003055677,0.0009643041,0.0028050607,0.00013131829],"about_ca_topic_score_codex":0.00024527992,"about_ca_topic_score_gemma":0.0008961533,"teacher_disagreement_score":0.9751647,"about_ca_system_score_codex":0.00007947703,"about_ca_system_score_gemma":0.00006332269,"threshold_uncertainty_score":0.49277726},"labels":[],"label_agreement":null},{"id":"W1974746532","doi":"10.1002/sat.758","title":"An IP‐based satellite communication system architecture for interactive multimedia services","year":2003,"lang":"en","type":"article","venue":"International Journal of Satellite Communications and Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Return channel; Computer network; Digital Video Broadcasting; Quality of service; Differentiated services; Scheduling (production processes); Architecture; Broadband; Queueing theory; Broadband networks; Broadband Integrated Services Digital Network; Multimedia; Channel (broadcasting); Telecommunications","score_opus":0.014787616769938356,"score_gpt":0.2795309249506249,"score_spread":0.2647433081806866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974746532","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036621622,0.10755463,0.88005054,0.0039374596,0.0020860431,0.0005378708,0.000013071034,0.00015266186,0.0020055461],"genre_scores_gemma":[0.8252912,0.013756544,0.16032535,0.0003635311,0.00019384972,0.000018578983,0.000029678169,0.000013082205,0.000008138004],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99830973,0.00043686447,0.0006079656,0.00018902528,0.0002717702,0.000184614],"domain_scores_gemma":[0.99638146,0.0010923928,0.0006821056,0.0008733438,0.0008410236,0.00012966248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009784324,0.00016487982,0.00023460363,0.00021591519,0.00025715987,0.00040131743,0.0023967482,0.00007820183,0.0000017650027],"category_scores_gemma":[0.000014025217,0.00015010238,0.00011871129,0.00017857987,0.000093004644,0.0006176595,0.0001278932,0.00031462594,0.0000016640354],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006767409,0.000100207195,0.00074876077,0.000015677233,0.000123876,0.0000030124309,0.0010143057,0.00042995354,0.000115075745,0.023617355,0.0000040940636,0.97376],"study_design_scores_gemma":[0.0017335289,0.00019565051,0.000715264,0.0009367018,0.00006148398,0.00018963867,0.0006984899,0.49318975,0.000121805344,0.002579616,0.4992878,0.0002902697],"about_ca_topic_score_codex":0.000007782474,"about_ca_topic_score_gemma":0.00004763219,"teacher_disagreement_score":0.97346973,"about_ca_system_score_codex":0.00008725487,"about_ca_system_score_gemma":0.000080005855,"threshold_uncertainty_score":0.61209977},"labels":[],"label_agreement":null},{"id":"W1975006608","doi":"10.1016/s1389-1286(99)00117-6","title":"A hop-by-hop flow controller for a virtual path","year":2000,"lang":"en","type":"article","venue":"Computer Networks","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Ottawa","funders":"","keywords":"Computer science; Hop (telecommunications); Computer network; Controller (irrigation); Flow control (data); Path (computing); Control theory (sociology); Real-time computing; Control (management)","score_opus":0.0055990812735166,"score_gpt":0.19458985343862506,"score_spread":0.18899077216510846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975006608","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008016718,0.0010865479,0.9939054,0.0011031113,0.0014740515,0.00061362,0.000008796762,0.0005390362,0.0004677353],"genre_scores_gemma":[0.8982965,0.00019866087,0.08210899,0.010468446,0.004488037,0.00033165203,0.000047182693,0.00006178723,0.0039987853],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977279,0.000118475575,0.0004186105,0.0007456756,0.00025133183,0.00073804427],"domain_scores_gemma":[0.9985492,0.00041626548,0.000094920964,0.0005817099,0.00010022447,0.0002576776],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032831635,0.00033527458,0.000446043,0.000051166186,0.00026673585,0.00037777607,0.0011207596,0.00019089133,0.00010593366],"category_scores_gemma":[0.0000051242614,0.00030864764,0.0002501784,0.00030524135,0.0000632954,0.00032199177,0.000115730305,0.00026364427,0.00011670812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005855238,0.000059077094,0.000008870959,0.0000017024886,0.000043830332,0.0000058510577,0.00006806759,0.13610175,0.0000013980118,0.003347863,0.17489499,0.68540806],"study_design_scores_gemma":[0.0024882932,0.00029081872,0.000035261026,0.000028811553,0.000015521671,0.000014044175,0.0000015181353,0.832835,9.731033e-7,0.0003558418,0.16361934,0.00031457326],"about_ca_topic_score_codex":0.0000026904356,"about_ca_topic_score_gemma":0.0000020712532,"teacher_disagreement_score":0.91179645,"about_ca_system_score_codex":0.000036867474,"about_ca_system_score_gemma":0.000043475648,"threshold_uncertainty_score":0.9999366},"labels":[],"label_agreement":null},{"id":"W1975035859","doi":"10.1109/glocom.2007.354","title":"Path Diversity in Packet Switched Networks: Performance Analysis and Rate Allocation","year":2007,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Path (computing); Computer science; Mathematical optimization; Erasure; Redundancy (engineering); Heuristic; Mathematics; Algorithm; Computer network","score_opus":0.010225471457830908,"score_gpt":0.20861041515861198,"score_spread":0.19838494370078108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975035859","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41422412,0.000046318484,0.58501786,0.00017135566,0.00004509183,0.000044839246,5.7038655e-8,0.000046969533,0.00040341038],"genre_scores_gemma":[0.99700826,0.00007180484,0.0023447722,0.00037976567,0.000031852145,0.0000016124656,0.0000018938301,0.0000015522896,0.00015845582],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927455,0.00003672962,0.0001439786,0.00023563791,0.00010282615,0.0002062563],"domain_scores_gemma":[0.9995522,0.00009425447,0.00004585804,0.00019539775,0.000042330143,0.00006996273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009036769,0.000076165714,0.00012342371,0.00013870175,0.00011657347,0.000048736558,0.00022407123,0.00004307993,0.000009402715],"category_scores_gemma":[0.000006524506,0.00006795462,0.000029893896,0.0009830542,0.000019954672,0.00029955548,0.00017297684,0.000079322475,0.0000050097383],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022931967,0.0000313384,0.42483407,0.000003192801,0.000060184942,0.00000801916,0.000330558,0.011795704,0.000009886346,0.0057085603,0.0000750762,0.5571205],"study_design_scores_gemma":[0.00019312762,0.000016295964,0.3991972,0.0000024175527,0.000016262904,4.554604e-7,0.000014864039,0.6004193,0.000009553035,0.00004245512,0.000028226616,0.0000598735],"about_ca_topic_score_codex":0.000051320632,"about_ca_topic_score_gemma":0.0005565406,"teacher_disagreement_score":0.5886236,"about_ca_system_score_codex":0.000023829132,"about_ca_system_score_gemma":0.000011270912,"threshold_uncertainty_score":0.2771109},"labels":[],"label_agreement":null},{"id":"W1976165504","doi":"10.5555/1251086.1251108","title":"Sparse approximations for high fidelity compression of network traffic data","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Data compression; Fidelity; Traffic generation model; Data mining; Compression (physics); Network traffic simulation; Real-time computing; Algorithm; Network traffic control; Computer network; Telecommunications","score_opus":0.04237660833800628,"score_gpt":0.27230748568248037,"score_spread":0.2299308773444741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976165504","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004273371,0.00019492378,0.9914096,0.0027708793,0.00025358726,0.0003398457,0.00002141152,0.0001882576,0.0005481307],"genre_scores_gemma":[0.7068331,0.000008883274,0.29220274,0.0002775595,0.00029053353,0.0000190328,0.00004274314,0.000003939651,0.00032143618],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989085,0.00004552552,0.00032617533,0.00034006516,0.00015896767,0.00022075017],"domain_scores_gemma":[0.99841976,0.00025554412,0.000115113406,0.0010437083,0.000098302895,0.00006757281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041356188,0.000095988195,0.00017715132,0.000027062082,0.000114735005,0.000045035536,0.0011967911,0.00004982905,0.000045281115],"category_scores_gemma":[0.000025607043,0.00008031397,0.000040111558,0.00019578847,0.0000333899,0.00045954715,0.00022880384,0.000063874846,0.000014309317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010573695,0.00008046855,0.000011360451,0.00000767759,0.000012571637,1.2283378e-7,0.000028227201,0.18635741,0.000010820664,0.12249593,0.051842187,0.63914263],"study_design_scores_gemma":[0.00052891567,0.000027654432,0.00021005976,0.000014971383,0.000009762981,0.0000012054774,0.0000045149163,0.96349853,0.00002623953,0.0010073914,0.03457818,0.00009259461],"about_ca_topic_score_codex":0.0000055331834,"about_ca_topic_score_gemma":0.00004548499,"teacher_disagreement_score":0.7771411,"about_ca_system_score_codex":0.000010399852,"about_ca_system_score_gemma":0.000053838306,"threshold_uncertainty_score":0.32751086},"labels":[],"label_agreement":null},{"id":"W1976181481","doi":"10.1016/s0140-3664(00)00185-7","title":"Design and analysis of per-flow queueing switches and VC-merge switches based on per-VC queueing architecture","year":2000,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Queueing theory; Merge (version control); Layered queueing network; Weighted fair queueing; Mean value analysis; Queueing system; Architecture; Computer network; Parallel computing","score_opus":0.018952602545834106,"score_gpt":0.2349403952438114,"score_spread":0.2159877926979773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976181481","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021536486,0.0014011925,0.97189164,0.0043001473,0.00004306298,0.00023111378,0.000004055094,0.00016453746,0.0004277795],"genre_scores_gemma":[0.69887584,0.00022257306,0.30024248,0.0005467607,0.0000280566,0.000025037152,0.000010900806,0.000010028175,0.000038312366],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840117,0.00034167757,0.00036978876,0.00043487537,0.00020329123,0.0002491872],"domain_scores_gemma":[0.9967218,0.0010504381,0.00012845134,0.0018731197,0.000093438626,0.00013275775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042297828,0.00022873242,0.0004019492,0.00034860274,0.00041635687,0.00018896829,0.0013262681,0.00008521802,0.000034889454],"category_scores_gemma":[0.000010810198,0.00021569555,0.00012198942,0.00071263866,0.00018026457,0.00018532127,0.00030589398,0.00029542163,0.0000066490843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001738765,0.00011714387,0.0011988039,0.000010738002,0.00022847847,9.773476e-7,0.0016222359,0.24533065,0.0000966352,0.0024350828,0.00009216736,0.7488497],"study_design_scores_gemma":[0.00035766079,0.00009256653,0.008206945,0.0000634221,0.00017415016,0.000004646241,0.000014326466,0.9889688,0.000023189112,0.00029827142,0.0015795479,0.00021651205],"about_ca_topic_score_codex":0.00004743571,"about_ca_topic_score_gemma":0.00005568461,"teacher_disagreement_score":0.7486332,"about_ca_system_score_codex":0.000023149072,"about_ca_system_score_gemma":0.00007051915,"threshold_uncertainty_score":0.8795809},"labels":[],"label_agreement":null},{"id":"W1976260570","doi":"10.1049/ip-com:20030180","title":"Rate controller for high-speed networks","year":2003,"lang":"en","type":"article","venue":"IEE Proceedings - Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Controller (irrigation); Leaky bucket; Computer science; Markov chain; Control theory (sociology); Process (computing); Markov process; Control (management); Mathematics; Statistics; Computer network; Artificial intelligence","score_opus":0.022349759013142075,"score_gpt":0.24970766648832196,"score_spread":0.2273579074751799,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976260570","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014540546,0.0015057924,0.9706562,0.010932291,0.00045189023,0.0010674023,0.0000039884644,0.0005915731,0.013336765],"genre_scores_gemma":[0.9492393,0.00020882326,0.047893118,0.0012420337,0.000096656855,0.0003336442,0.000005554467,0.000019215131,0.00096166076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873537,0.000057142533,0.0003536475,0.00033761634,0.00012432922,0.00039188823],"domain_scores_gemma":[0.99785405,0.0005131225,0.00019441627,0.000780203,0.0005271603,0.00013101444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008053958,0.00018403362,0.00025171784,0.00008278323,0.00061984005,0.00032619797,0.0020898047,0.00010405251,0.000009649148],"category_scores_gemma":[0.00021312918,0.00017973364,0.00010201214,0.0004694866,0.00010944191,0.00046927837,0.00017304675,0.00024784406,0.000032016862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011112292,0.00007709293,0.00009088293,0.000003856614,0.000042223248,9.9904845e-8,0.00013370252,0.0004426944,0.00023193682,0.96510917,0.00783607,0.026021168],"study_design_scores_gemma":[0.0022243233,0.00008764566,0.0003076575,0.000028172852,0.00004371351,0.000008628843,0.00006106163,0.8340489,0.00011339219,0.0238984,0.13883817,0.0003399024],"about_ca_topic_score_codex":0.0000051104566,"about_ca_topic_score_gemma":0.000005333302,"teacher_disagreement_score":0.94778526,"about_ca_system_score_codex":0.00004366181,"about_ca_system_score_gemma":0.000065412074,"threshold_uncertainty_score":0.73293257},"labels":[],"label_agreement":null},{"id":"W1978380500","doi":"10.1002/spe.575","title":"Understanding Web server configuration issues","year":2004,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Bottleneck; Web server; Computer science; Visualization; Application server; Operating system; Web API; Web application; Set (abstract data type); Database; World Wide Web; Distributed computing; Data mining; The Internet; Embedded system","score_opus":0.04786340885300471,"score_gpt":0.2900633936392327,"score_spread":0.242199984786228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978380500","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013657891,0.000891314,0.97370315,0.010009767,0.00033583087,0.00011498046,3.8186343e-7,0.00031871104,0.00096798496],"genre_scores_gemma":[0.9720062,0.00030933367,0.025699576,0.0017548664,0.00008018306,0.000021965692,9.095118e-7,0.0000050864037,0.00012187057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99908394,0.00004564806,0.00014016982,0.00030809382,0.00022231872,0.00019983028],"domain_scores_gemma":[0.99930745,0.00019715737,0.00008360844,0.00024432255,0.00007696671,0.00009049635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018079914,0.000106784064,0.00009609164,0.000035218123,0.0002650417,0.00032128947,0.00023883833,0.000051181218,0.000017524319],"category_scores_gemma":[0.00027077744,0.000100067846,0.000021428115,0.00020406336,0.00007173111,0.0024585137,0.00006418859,0.00011185419,0.00004338647],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051205145,0.00010274377,0.00040274236,0.0000148722675,0.000028969871,0.00009407412,0.023044774,0.00095430284,0.00036747908,0.89610404,0.0007313394,0.078103475],"study_design_scores_gemma":[0.013273654,0.0020015396,0.0021398994,0.0007764245,0.00020214198,0.0020452815,0.08182985,0.06756182,0.0070089772,0.20185655,0.6166016,0.004702249],"about_ca_topic_score_codex":0.000033794007,"about_ca_topic_score_gemma":0.000012150506,"teacher_disagreement_score":0.95834833,"about_ca_system_score_codex":0.000059351452,"about_ca_system_score_gemma":0.000090787005,"threshold_uncertainty_score":0.40806484},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01618493320392848,"score_gpt":0.24217198361177356,"score_spread":0.22598705040784509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979865356","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033115118,0.0006343148,0.9843164,0.0034179152,0.0034705808,0.00019861542,0.0000018653582,0.00005762383,0.004591173],"genre_scores_gemma":[0.8953578,0.00015996177,0.10108051,0.0012588609,0.0016250327,0.0000109958555,9.680065e-7,0.000008915334,0.0004969894],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985339,0.00004416129,0.000378596,0.00018619541,0.00062842545,0.00022871397],"domain_scores_gemma":[0.99879414,0.00007748695,0.00031911055,0.00018596953,0.00051908015,0.00010422988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005368168,0.00011627754,0.0001497827,0.000097836215,0.000068520654,0.00018392464,0.0013166328,0.000030848678,0.00005420403],"category_scores_gemma":[0.000009135045,0.00010815754,0.00013602445,0.00014315908,0.000016912425,0.00060036586,0.00009837125,0.00011317174,0.00001841175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014749778,0.00017778545,0.0003316449,0.000005806833,0.00069128285,0.00019800325,0.00014810111,0.12079131,0.000018364803,0.12418218,0.08132181,0.6719862],"study_design_scores_gemma":[0.001436087,0.00025313988,0.00041561053,0.00008486036,0.000023308672,0.000038647308,0.00003959245,0.9047091,0.0000024823676,0.0021272039,0.09074252,0.00012747268],"about_ca_topic_score_codex":9.375168e-7,"about_ca_topic_score_gemma":0.000004757865,"teacher_disagreement_score":0.8920463,"about_ca_system_score_codex":0.00017002822,"about_ca_system_score_gemma":0.000026334706,"threshold_uncertainty_score":0.44105363},"labels":[],"label_agreement":null},{"id":"W1979951532","doi":"10.1145/511334.511371","title":"Context-aware TCP/IP","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Computer network; TCP tuning; Internet protocol suite; Internet Protocol; Transmission Control Protocol; TCP acceleration; TCP global synchronization; The Internet; Network packet; Distributed computing; World Wide Web","score_opus":0.017469892655271036,"score_gpt":0.1845057292104258,"score_spread":0.16703583655515475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979951532","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00075073016,0.0003916708,0.930225,0.011097725,0.0004265047,0.00008623265,3.3379942e-7,0.00054252765,0.05647923],"genre_scores_gemma":[0.972422,0.000012426258,0.0016919787,0.0033167796,0.000090080044,0.000008548317,2.226168e-7,0.000003459707,0.022454487],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993466,0.000024680308,0.00010784823,0.0002058892,0.00012797925,0.00018698229],"domain_scores_gemma":[0.99948764,0.000059593272,0.000023315306,0.00030643327,0.000040415456,0.000082599836],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000060625876,0.0000759114,0.00008636343,0.000027267242,0.000082661536,0.00008548539,0.00044835047,0.000034911332,0.0011101295],"category_scores_gemma":[0.000006424436,0.00006271554,0.000043357184,0.00016809662,0.000020038942,0.00020585998,0.000053779364,0.000069384354,0.0015967744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.484503e-7,0.000018132687,0.00006189706,5.718964e-7,0.000004988164,0.0000074178147,0.00005158107,0.000032212334,0.0000022656484,0.17437656,0.06238207,0.7630618],"study_design_scores_gemma":[0.00040741224,0.000036685837,0.00022155768,0.0000040117525,0.0000024802976,0.000014073285,0.000017975623,0.7898972,0.000031894295,0.00056383846,0.20866473,0.00013813787],"about_ca_topic_score_codex":0.0000042839592,"about_ca_topic_score_gemma":0.00001078185,"teacher_disagreement_score":0.9716713,"about_ca_system_score_codex":0.000009672958,"about_ca_system_score_gemma":0.000006771401,"threshold_uncertainty_score":0.999803},"labels":[],"label_agreement":null},{"id":"W1979963948","doi":"10.1002/nem.525","title":"Frame‐level performance measurement in an ATM test‐bed environment: methodologies and experiences","year":2004,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Nortel (Canada)","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Frame (networking); Asynchronous Transfer Mode; Asynchronous communication; Test (biology); Throughput; Quality of service; Measure (data warehouse); Latency (audio); Computer network; Telecommunications; Database","score_opus":0.06311569915411114,"score_gpt":0.27578876294040444,"score_spread":0.2126730637862933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979963948","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24707375,0.001152935,0.7475479,0.0024438803,0.001222478,0.00016496675,4.1363666e-7,0.000029396919,0.00036425097],"genre_scores_gemma":[0.883525,0.0007660576,0.11499151,0.00041058724,0.0002645874,0.000017582657,3.2774824e-7,0.000004567369,0.000019752253],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99824315,0.00008373949,0.00044017765,0.00021770834,0.0008021016,0.00021310031],"domain_scores_gemma":[0.99929315,0.00008690903,0.00026041412,0.00016536197,0.00011739676,0.00007679572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001264343,0.0001301665,0.00017218056,0.000138367,0.00006377184,0.00016046166,0.000975395,0.000034387904,0.000012737791],"category_scores_gemma":[0.000028225071,0.000111310816,0.000045707813,0.00011718064,0.000055914723,0.0006568983,0.0002138162,0.00015260489,0.000004358297],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007373103,0.00017908982,0.0040370733,0.0000070288984,0.0001325615,0.000176434,0.0020408814,0.20403859,0.000023556882,0.012206652,0.00019110389,0.7768933],"study_design_scores_gemma":[0.023080079,0.0051558907,0.4700335,0.0028937152,0.00022507168,0.00090566714,0.010208055,0.35942316,0.0007877422,0.08953928,0.035119675,0.002628164],"about_ca_topic_score_codex":0.000002895678,"about_ca_topic_score_gemma":0.000006704477,"teacher_disagreement_score":0.7742651,"about_ca_system_score_codex":0.0001780842,"about_ca_system_score_gemma":0.00002940369,"threshold_uncertainty_score":0.45391235},"labels":[],"label_agreement":null},{"id":"W1981571357","doi":"10.1007/s00224-010-9249-8","title":"TCP is Competitive with Resource Augmentation","year":2010,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Vedecká Grantová Agentúra MŠVVaŠ SR a SAV","keywords":"Computer science; TCP tuning; TCP Friendly Rate Control; TCP Westwood plus; Computer network; TCP global synchronization; Competitive analysis; CUBIC TCP; Zeta-TCP; TCP acceleration; Network congestion; Distributed computing; H-TCP; HSTCP; Compound TCP; Algorithm; Upper and lower bounds; Mathematics","score_opus":0.006263938891815592,"score_gpt":0.20935521562677786,"score_spread":0.20309127673496227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981571357","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18849124,0.000099080484,0.7978086,0.0002936733,0.0006530835,0.0002410266,0.0000016114918,0.0002209527,0.012190765],"genre_scores_gemma":[0.99562466,5.593208e-7,0.0035526974,0.00018741781,0.00019147334,0.0000036663605,0.0000014816588,0.0000089067025,0.00042912186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988134,0.00021902322,0.0002641559,0.00025100596,0.0002670549,0.00018539779],"domain_scores_gemma":[0.9987069,0.00044576175,0.000252333,0.0003973182,0.00013456323,0.00006316391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091075274,0.0001203001,0.00021472354,0.00006660877,0.000118955664,0.00008258766,0.0005065354,0.000047592774,0.0000094387815],"category_scores_gemma":[0.000012363003,0.00009851885,0.000039164923,0.00019739998,0.00010984212,0.000106979016,0.00006348541,0.00017290546,0.000023188542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033811208,0.000029498278,0.00020755471,0.000023633947,0.000039479513,0.000003525364,0.0025127989,0.0023034161,0.00051004766,0.937445,0.00046926003,0.056421984],"study_design_scores_gemma":[0.0033239413,0.0005757025,0.0033278414,0.000687336,0.00005963089,0.00022286868,0.0025130974,0.95554394,0.0021685523,0.003929163,0.02688068,0.0007672578],"about_ca_topic_score_codex":0.000008297722,"about_ca_topic_score_gemma":0.000002170578,"teacher_disagreement_score":0.9532405,"about_ca_system_score_codex":0.000011292148,"about_ca_system_score_gemma":0.00004393372,"threshold_uncertainty_score":0.4017482},"labels":[],"label_agreement":null},{"id":"W1982100993","doi":"10.1117/12.704429","title":"Video to Go: the effects of mobility on streaming media in a CDMA2000 1xEV-DO network","year":2007,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Computer network; CDMA2000; Cellular network; Bandwidth (computing); Video streaming; Real-time computing; Code division multiple access","score_opus":0.0060954824432325255,"score_gpt":0.21501429896312144,"score_spread":0.20891881651988892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982100993","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9938218,0.0001710601,0.0014476656,0.0019372216,0.00050649035,0.0007887177,0.0000053555864,0.00007267109,0.0012490351],"genre_scores_gemma":[0.955662,0.00004062884,0.043318957,0.00027843018,0.00048533926,0.00012370411,9.842322e-7,0.000027372425,0.00006258438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99742424,5.7313354e-8,0.0007705832,0.00046094952,0.00080752926,0.0005366337],"domain_scores_gemma":[0.99719983,0.0013600206,0.00031708242,0.00012404971,0.0008488677,0.00015011671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018114453,0.0002899131,0.00042759473,0.00010842979,0.00007429728,0.00009790737,0.0017607956,0.00015711514,0.0000030584079],"category_scores_gemma":[0.0011380581,0.00021261595,0.00041833735,0.00078359473,0.0001634487,0.00035065197,0.0002513129,0.00038234264,0.0000019855934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001944962,0.00026211375,0.0010496202,0.00033020304,0.00022951451,4.6342956e-7,0.001114577,0.003021209,0.042116202,0.92489034,0.0027153457,0.024075922],"study_design_scores_gemma":[0.011760286,0.005153534,0.08095139,0.0078063263,0.00056697684,0.000058857924,0.0043540904,0.64383996,0.19741355,0.028053248,0.016925836,0.0031159455],"about_ca_topic_score_codex":0.00001026841,"about_ca_topic_score_gemma":0.0000019494976,"teacher_disagreement_score":0.8968371,"about_ca_system_score_codex":0.00015965868,"about_ca_system_score_gemma":0.000040343795,"threshold_uncertainty_score":0.8670227},"labels":[],"label_agreement":null},{"id":"W1982207285","doi":"10.1016/j.comnet.2009.10.008","title":"Bounds estimation and practical stability of AIMD/RED systems with time delays","year":2009,"lang":"en","type":"article","venue":"Computer Networks","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Waterloo","funders":"","keywords":"Computer science; Bottleneck; Queue; Active queue management; Network congestion; Correctness; Flow control (data); Control theory (sociology); Queueing theory; Stability (learning theory); Queue management system; Random early detection; Real-time computing; Algorithm; Computer network; Control (management)","score_opus":0.00916971372091485,"score_gpt":0.21660174497381735,"score_spread":0.2074320312529025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982207285","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010313817,0.00030927296,0.9873062,0.000992343,0.00025096402,0.0002601551,5.1824526e-7,0.00017423953,0.0003925039],"genre_scores_gemma":[0.93468636,0.000009399277,0.06483087,0.00022955009,0.00020863554,0.000006451496,0.000004367615,0.0000057316465,0.000018608896],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986878,0.00013954788,0.00030760394,0.0003794233,0.000223811,0.0002618237],"domain_scores_gemma":[0.9988678,0.000261524,0.00016321652,0.00044930697,0.00012913924,0.00012897768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003765114,0.00016323937,0.00028796558,0.000042702657,0.000094512616,0.00021195655,0.00022339111,0.00009547606,0.000004898775],"category_scores_gemma":[0.000007993553,0.0001349734,0.000034522225,0.00025502348,0.00007692785,0.0004192943,0.0000589765,0.00017772216,0.000004711997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076339944,0.00014150214,0.0004408301,0.000015469084,0.000043067936,0.000026453507,0.0001412229,0.30482507,0.0000075512685,0.020701706,0.003126149,0.6704546],"study_design_scores_gemma":[0.00050584215,0.00043578728,0.0022648084,0.000056458437,0.00001769314,0.00010170996,0.000001917573,0.9958226,0.0000032668645,0.0002758592,0.00036289275,0.00015118481],"about_ca_topic_score_codex":0.0000025686238,"about_ca_topic_score_gemma":9.216082e-7,"teacher_disagreement_score":0.92437255,"about_ca_system_score_codex":0.000025066756,"about_ca_system_score_gemma":0.000053653584,"threshold_uncertainty_score":0.5504055},"labels":[],"label_agreement":null},{"id":"W1982300404","doi":"10.1109/glocom.2005.1577801","title":"Adaptive multiloop PI rate-based controller design for a MIMO IP router based on phase margin","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Active queue management; Phase margin; MIMO; Router; Control theory (sociology); Computer science; Robustness (evolution); PID controller; Encoder; Engineering; Control engineering; Computer network; Network congestion; Amplifier; Bandwidth (computing); Operational amplifier; Control (management)","score_opus":0.04891216530299321,"score_gpt":0.29605095501706286,"score_spread":0.24713878971406966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982300404","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046092112,0.0003230925,0.9712908,0.0194322,0.0005031366,0.0024835593,0.00033831978,0.00064475485,0.0045232074],"genre_scores_gemma":[0.7583312,0.000045616154,0.2332057,0.006442063,0.00019354335,0.0011106369,0.00009167912,0.00003079564,0.00054878974],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99511534,0.001071317,0.001026983,0.001069587,0.00048159127,0.0012351886],"domain_scores_gemma":[0.9939827,0.0015949821,0.00050645473,0.002601208,0.00080284924,0.0005118231],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012318566,0.00073741993,0.0008121443,0.00026425556,0.0008033561,0.00057456415,0.0036236416,0.00033382868,0.00023202795],"category_scores_gemma":[0.00015228108,0.00072503166,0.0004253248,0.00076946494,0.0002605322,0.0006032546,0.00014771013,0.00050991867,0.0004181854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014006293,0.0027212042,0.000031150714,0.000012609678,0.00020088116,0.000008534142,0.00007421658,0.17541818,0.00007750568,0.045179117,0.08727622,0.6875997],"study_design_scores_gemma":[0.0132707525,0.0006883556,0.00014565993,0.00007889256,0.00008605631,0.0000071138447,0.000022810997,0.90035355,0.0001948659,0.00079948705,0.08364541,0.00070706854],"about_ca_topic_score_codex":0.00006994242,"about_ca_topic_score_gemma":0.0003618374,"teacher_disagreement_score":0.75787026,"about_ca_system_score_codex":0.00057609857,"about_ca_system_score_gemma":0.0012749553,"threshold_uncertainty_score":0.99952006},"labels":[],"label_agreement":null},{"id":"W1983133911","doi":"10.1109/iit.2007.4430446","title":"Bottleneck Analysis of Traffic Monitoring using Wireshark","year":2007,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Network packet; Bottleneck; Ethernet; Kernel (algebra); Real-time computing; Local area network; Computer network; Linux kernel; Operating system; Embedded system; Packet analyzer","score_opus":0.02293190650900958,"score_gpt":0.275303478909138,"score_spread":0.2523715724001284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983133911","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48646715,0.00011908171,0.5125155,0.000029448767,0.00017649343,0.000027578028,2.421469e-7,0.00007856081,0.0005859497],"genre_scores_gemma":[0.96821207,0.000005402641,0.03153391,0.000034144447,0.00008685077,6.503077e-7,3.7752278e-7,0.0000034440227,0.00012313608],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990636,0.000018932977,0.00025978143,0.00021258988,0.00022009075,0.00022497303],"domain_scores_gemma":[0.9993206,0.00012531679,0.00008245657,0.0003176722,0.00007556935,0.00007838169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004074902,0.00008218326,0.0001988996,0.00028378027,0.000054121036,0.00003582619,0.00038550855,0.00004155275,0.000025629488],"category_scores_gemma":[0.000009459544,0.00007474611,0.00013295363,0.0015355924,0.000021654736,0.0001707363,0.000047087437,0.000056736542,0.0000043269397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010457886,0.00006150614,0.009105075,0.0000038918533,0.00048466996,0.000012240173,0.00024657111,0.2983527,0.0011639962,0.00831198,0.000050238275,0.6821967],"study_design_scores_gemma":[0.00014913901,0.00001610414,0.012154344,0.000007766683,0.00014325399,0.0000014110653,0.00003508474,0.9864428,0.0007984692,0.000011577342,0.00014258023,0.000097442025],"about_ca_topic_score_codex":0.000013167975,"about_ca_topic_score_gemma":0.00001855895,"teacher_disagreement_score":0.68809015,"about_ca_system_score_codex":0.000024887706,"about_ca_system_score_gemma":0.000027529823,"threshold_uncertainty_score":0.3048058},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0158071323304731,"score_gpt":0.22415515431109687,"score_spread":0.20834802198062377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W198328412","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039857868,0.0005160355,0.91980827,0.0013294515,0.0009338006,0.0001120679,3.6502394e-7,0.0005757598,0.036866408],"genre_scores_gemma":[0.98574984,0.000010646574,0.010729586,0.00096680823,0.00045292778,0.000009934141,7.0096047e-7,0.000006150272,0.0020733825],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990259,0.00007183318,0.00016895325,0.0001877584,0.00013034465,0.0004152517],"domain_scores_gemma":[0.99923235,0.00023471656,0.000050002873,0.00028504577,0.00004448249,0.00015339133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046924947,0.000103959086,0.00011122648,0.000050256283,0.00012209294,0.0001179202,0.00036746782,0.000031745458,0.00006328423],"category_scores_gemma":[0.000052786938,0.00008583531,0.000050475915,0.0002731415,0.000013887757,0.00073905435,0.000101119214,0.00009664812,0.00023595798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002085628,0.00003361021,0.0028537847,0.0000019515555,0.000011448846,0.0000031669028,0.0002287214,0.00011158553,0.00008784684,0.112447344,0.0018948455,0.8823236],"study_design_scores_gemma":[0.0019296911,0.00011778774,0.019932365,0.00005099107,0.000042738007,0.00007713829,0.00041655908,0.89251536,0.001556468,0.0009054905,0.08149028,0.00096513034],"about_ca_topic_score_codex":0.0000072303446,"about_ca_topic_score_gemma":0.0000022993618,"teacher_disagreement_score":0.945892,"about_ca_system_score_codex":0.000019516132,"about_ca_system_score_gemma":0.00002633559,"threshold_uncertainty_score":0.35002622},"labels":[],"label_agreement":null},{"id":"W1983714788","doi":"10.1117/12.434328","title":"<title>UPM: unified policy-based network management</title>","year":2001,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Directory service; Lightweight Directory Access Protocol; Scalability; Network management; Computer network; XACML; Common Information Model (electricity); The Internet; Directory; Quality of service; Distributed computing; Operating system; Access control","score_opus":0.009000043639037256,"score_gpt":0.21519347008263484,"score_spread":0.2061934264435976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983714788","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4656295,0.0005838699,0.014325879,0.015786106,0.0017852202,0.0010713222,0.000022785316,0.0006858676,0.5001095],"genre_scores_gemma":[0.5975365,0.0005000737,0.38333297,0.0014798391,0.003404594,0.00021349062,0.000015368327,0.00011779247,0.013399365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986735,1.9728802e-8,0.00031130528,0.00026972342,0.00042428006,0.00032116566],"domain_scores_gemma":[0.9991679,0.00006199849,0.00015039211,0.00007292796,0.00045700563,0.0000897853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003031446,0.00018330336,0.00020145718,0.000078956655,0.00006442117,0.00010722775,0.0009807379,0.00010755386,0.00005361209],"category_scores_gemma":[0.00006466183,0.00015996354,0.0002925115,0.00044233454,0.000085332926,0.00021031788,0.0001258178,0.00015489849,0.000032793625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016454485,0.00003811265,0.000028702945,0.00006142398,0.0001414426,2.834706e-7,0.000016461088,0.00044749756,0.0024538503,0.94205433,0.044617686,0.010123766],"study_design_scores_gemma":[0.0013448593,0.00017855088,0.000399989,0.0002878531,0.00011808066,0.000017703416,0.000057443296,0.44351798,0.0012968269,0.009080866,0.54316616,0.000533701],"about_ca_topic_score_codex":0.0000011350496,"about_ca_topic_score_gemma":6.989805e-8,"teacher_disagreement_score":0.93297344,"about_ca_system_score_codex":0.000082757906,"about_ca_system_score_gemma":0.00003644031,"threshold_uncertainty_score":0.6523124},"labels":[],"label_agreement":null},{"id":"W198425373","doi":"","title":"Improving TCP Performance with Periodic Disconnections over Wireless Links","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"TCP Friendly Rate Control; TCP global synchronization; TCP Westwood plus; Computer network; TCP acceleration; Zeta-TCP; Computer science; TCP tuning; CUBIC TCP; Retransmission; TCP Westwood; Network congestion; Network packet","score_opus":0.005777999932988061,"score_gpt":0.18656878600877605,"score_spread":0.180790786075788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W198425373","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29730552,0.000051440507,0.6921174,0.0003705646,0.00026265133,0.00010573827,2.2549405e-7,0.0002482166,0.009538241],"genre_scores_gemma":[0.9900105,0.000010768769,0.006583545,0.0004798806,0.000057888985,0.000028934623,4.0807024e-7,0.0000078472995,0.0028202403],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990929,0.000034517703,0.00013142786,0.00030639107,0.00016611362,0.00026868592],"domain_scores_gemma":[0.9993992,0.000045458262,0.000049632934,0.00035911612,0.000052201813,0.00009439118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012517937,0.00012462477,0.00011361432,0.000048140002,0.00027786026,0.00018640659,0.00027854217,0.00006683917,0.00010450236],"category_scores_gemma":[0.0000069874627,0.00009036695,0.0000351419,0.00029107655,0.000047455487,0.00049377367,0.000032119126,0.00023015653,0.00004929471],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011571535,0.0000809843,0.008477899,0.000015331298,0.000030466059,0.000009701113,0.00032267076,0.0021396666,0.00018485253,0.2942999,0.0005249026,0.6939021],"study_design_scores_gemma":[0.0010266704,0.00022700746,0.003940976,0.00002766932,0.000014607691,0.00007545797,0.00008371855,0.981682,0.000462282,0.00007426936,0.011997205,0.00038812566],"about_ca_topic_score_codex":0.000015459816,"about_ca_topic_score_gemma":0.000047720965,"teacher_disagreement_score":0.9795423,"about_ca_system_score_codex":0.000026199034,"about_ca_system_score_gemma":0.00012827732,"threshold_uncertainty_score":0.36850575},"labels":[],"label_agreement":null},{"id":"W1986355146","doi":"10.1109/lanman.2010.5507168","title":"A Distributed Ethernet Traffic Shaping system","year":2010,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer network; ATA over Ethernet; Ethernet flow control; Carrier Ethernet; Ethernet; Ethernet over SDH; Synchronous Ethernet; Metro Ethernet; Local area network","score_opus":0.011609656017382551,"score_gpt":0.21239603656511605,"score_spread":0.20078638054773348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986355146","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07867028,0.000044132696,0.911553,0.0014159966,0.0010462588,0.00013969235,0.000002460617,0.0013745063,0.005753655],"genre_scores_gemma":[0.99286133,6.637007e-7,0.006406865,0.0002049304,0.00016643945,0.00001562424,0.0000027587635,0.000005453454,0.00033591906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991539,0.000031642292,0.00015723956,0.00026368987,0.00015727039,0.00023622808],"domain_scores_gemma":[0.9993208,0.00007780309,0.000043012362,0.00039276312,0.000054503485,0.00011111056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022856881,0.00010033006,0.00011749013,0.000032134354,0.00009240646,0.00015974358,0.00061377377,0.000072763796,0.00004642631],"category_scores_gemma":[0.00001286255,0.000081898084,0.000053166477,0.00021920007,0.000024662975,0.00016592031,0.000059610407,0.00020222993,0.00021550481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032840042,0.000026845415,0.000048448957,0.000008181682,0.000015529826,0.000015903172,0.00010257835,0.0017737082,0.0003465425,0.5544205,0.0030028233,0.44023564],"study_design_scores_gemma":[0.00029757895,0.00001696952,0.00023261362,0.000010423028,0.000003952223,0.000038662303,0.000031146395,0.9846315,0.00003963129,0.00005148619,0.014513583,0.00013245166],"about_ca_topic_score_codex":0.0000060098746,"about_ca_topic_score_gemma":0.000041991498,"teacher_disagreement_score":0.98285776,"about_ca_system_score_codex":0.000014634616,"about_ca_system_score_gemma":0.000043483797,"threshold_uncertainty_score":0.3339707},"labels":[],"label_agreement":null},{"id":"W1986383282","doi":"10.1016/j.aeue.2010.07.002","title":"Dynamic end-to-end QoS support for video over the Internet","year":2011,"lang":"en","type":"article","venue":"AEU - International Journal of Electronics and Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Quality of service; Computer science; Computer network; Mobile QoS; End-to-end delay; The Internet; Network packet; Scheduling (production processes); End-to-end principle; Packet loss; Real-time computing; Service provider; Service (business)","score_opus":0.01920538516192338,"score_gpt":0.27702373007264264,"score_spread":0.25781834491071925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986383282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021675976,0.0040813414,0.9440739,0.024802765,0.0012557113,0.00037912483,0.000017190005,0.00004181177,0.003672182],"genre_scores_gemma":[0.9814593,0.00076090195,0.015309923,0.0020303074,0.00007594321,0.000029363755,0.0000051938423,0.000008045726,0.00032099002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99902785,0.00006580369,0.0003714496,0.00012136301,0.00023313133,0.00018043011],"domain_scores_gemma":[0.99836147,0.00032364123,0.00027306098,0.000542786,0.00041778546,0.00008123297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005381283,0.00009736109,0.00012514426,0.00011297677,0.00012349247,0.00014280938,0.0030626855,0.000029613167,0.000053401072],"category_scores_gemma":[0.000051403324,0.00007343625,0.00010932106,0.00010312471,0.00007169704,0.00028548413,0.0003558894,0.00026440923,0.000006192704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059475344,0.0001395865,0.00018512995,0.0000011903404,0.0002894609,0.0000028635643,0.00097210443,0.000055776105,0.00008914403,0.75534946,0.0045151184,0.2383407],"study_design_scores_gemma":[0.0013777752,0.0008207931,0.0048461976,0.000051280676,0.00007193842,0.00040216994,0.00010859929,0.24030802,0.000100499245,0.033435162,0.71821284,0.00026471505],"about_ca_topic_score_codex":0.000016140357,"about_ca_topic_score_gemma":0.00018581451,"teacher_disagreement_score":0.9597834,"about_ca_system_score_codex":0.00007547282,"about_ca_system_score_gemma":0.00020117131,"threshold_uncertainty_score":0.5691283},"labels":[],"label_agreement":null},{"id":"W1986476690","doi":"10.1145/1185373.1185423","title":"Proactively controlling round-trip time variation and packet drops using SmoothTCP-q","year":2006,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer network; Computer science; TCP global synchronization; Internet Control Message Protocol; Router; Network packet; Quality of service; Network congestion; Real-time computing","score_opus":0.007385277056559669,"score_gpt":0.19238877309977512,"score_spread":0.18500349604321545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986476690","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062459737,0.00014841752,0.9326141,0.00055982417,0.0001287758,0.00022765435,9.101728e-7,0.0002312417,0.003629332],"genre_scores_gemma":[0.96846616,0.00000276222,0.029931355,0.00020501445,0.00022688699,0.00000806975,0.0000017463617,0.000007831663,0.0011501566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989586,0.00007697952,0.00021047684,0.00032910262,0.0001854116,0.00023941584],"domain_scores_gemma":[0.9994382,0.0001279387,0.000100293175,0.00018562823,0.00009141697,0.000056478828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028641956,0.00012990304,0.00017311124,0.0000672489,0.00017075503,0.00030633877,0.00018069634,0.000065007545,0.000020749781],"category_scores_gemma":[0.000013431896,0.00011483524,0.000037491795,0.0002117706,0.000028065251,0.0005409456,0.000046157536,0.00008404164,0.000026191852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012616876,0.00034912236,0.002596186,0.000019763098,0.00017658531,0.00003840282,0.0006641568,0.03176655,0.020195805,0.5652801,0.0013388997,0.3774483],"study_design_scores_gemma":[0.0008784516,0.00003216962,0.0040082373,0.000008013889,0.000018115288,0.000014600211,0.0000035940056,0.98917234,0.00010295478,0.005210543,0.00039146395,0.00015952872],"about_ca_topic_score_codex":0.00016498205,"about_ca_topic_score_gemma":0.000009067231,"teacher_disagreement_score":0.9574058,"about_ca_system_score_codex":0.000045858626,"about_ca_system_score_gemma":0.000060247345,"threshold_uncertainty_score":0.46828452},"labels":[],"label_agreement":null},{"id":"W1986895073","doi":"10.1109/tmc.2014.2307330","title":"Concurrent Multipath Transfer Using SCTP: Modelling and Congestion Window Management","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Multihoming; Stream Control Transmission Protocol; Transport layer; Computer network; Scalability; Throughput; Distributed computing; Markov process; Markov chain; Window (computing); Network congestion; Multipath propagation; Sliding window protocol; Session (web analytics); Channel (broadcasting); Layer (electronics); Wireless; Internet Protocol; The Internet; Telecommunications; Path (computing)","score_opus":0.018901233409715137,"score_gpt":0.23557447165189802,"score_spread":0.21667323824218288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986895073","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10999528,0.000107276814,0.8879709,0.000047530455,0.0010251058,0.00044572775,0.0000018814113,0.00030518358,0.00010107523],"genre_scores_gemma":[0.98026526,0.000049502894,0.01935611,0.00014808185,0.000096951335,0.000030750423,7.8415593e-7,0.00001947423,0.00003306023],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826556,0.00015042344,0.00034929544,0.0005928994,0.00026796607,0.0003738445],"domain_scores_gemma":[0.99917644,0.0002153068,0.000055097695,0.00032988057,0.00007442166,0.00014887034],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003935604,0.00024998773,0.00025130413,0.00016392673,0.00047687395,0.0001744892,0.00029142274,0.000082296894,0.000005640911],"category_scores_gemma":[9.2647826e-7,0.00025909432,0.00009779056,0.0002578122,0.00006447471,0.00024433137,0.0000055494033,0.00028852167,0.000011960682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037433583,0.000048917507,0.000004048723,0.000014291486,0.000019991896,0.000001935767,0.00015749734,0.5560975,0.000060374314,0.0012227852,0.0000013207145,0.44236758],"study_design_scores_gemma":[0.0011221444,0.00012380483,0.000022518832,0.00014489556,0.000047379675,0.000019712286,0.000041170715,0.9973465,0.00045005415,0.00006234892,0.00034653832,0.00027289125],"about_ca_topic_score_codex":0.000011773276,"about_ca_topic_score_gemma":0.00000519363,"teacher_disagreement_score":0.87027,"about_ca_system_score_codex":0.000059088063,"about_ca_system_score_gemma":0.000019206731,"threshold_uncertainty_score":0.9999861},"labels":[],"label_agreement":null},{"id":"W1986977526","doi":"10.1007/s11235-008-9067-3","title":"Using interval phase margin assignment to self-tune a PI AQM controller for TCP traffic","year":2007,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Active queue management; PID controller; Phase margin; Computer science; Control theory (sociology); Controller (irrigation); Router; Transmission Control Protocol; Queue; Network packet; Network congestion; Real-time computing; Computer network; Amplifier; Control engineering; Control (management); Bandwidth (computing); Engineering; Operational amplifier","score_opus":0.05239183572412472,"score_gpt":0.3348011836580148,"score_spread":0.2824093479338901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986977526","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023345208,0.0008462667,0.97125405,0.001151269,0.00064435106,0.0018017358,0.0000052137416,0.00046628338,0.00048563018],"genre_scores_gemma":[0.9517534,0.000013377533,0.046936456,0.00046965826,0.00022541889,0.00026355265,0.000007723877,0.00002275337,0.00030765796],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99779356,0.00026280712,0.00076562725,0.00039157542,0.00030512272,0.0004812943],"domain_scores_gemma":[0.9975397,0.00056301506,0.0002983453,0.0011148469,0.0002545389,0.00022953878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023389312,0.00021929907,0.00040285988,0.00019568448,0.00028256275,0.0002610153,0.0014314511,0.000104936415,0.0000067198885],"category_scores_gemma":[0.00004343201,0.00021272684,0.00013551417,0.00041860796,0.000023012595,0.00026043615,0.00016381807,0.0001621066,0.000054318865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036924332,0.0010725389,0.000039942963,0.00007144378,0.0002854902,0.000005176544,0.0029848854,0.039296202,0.003185506,0.033083957,0.0059649665,0.9136406],"study_design_scores_gemma":[0.0036647706,0.00025262154,0.000035716817,0.000081650905,0.000028131799,0.000024007506,0.00022343324,0.90283567,0.00008337482,0.000024348154,0.09248047,0.00026582478],"about_ca_topic_score_codex":0.000020974643,"about_ca_topic_score_gemma":0.000022090377,"teacher_disagreement_score":0.9284082,"about_ca_system_score_codex":0.00028240943,"about_ca_system_score_gemma":0.000086891174,"threshold_uncertainty_score":0.86747485},"labels":[],"label_agreement":null},{"id":"W1987938797","doi":"10.1109/icon.2006.302690","title":"Dynamic Resource Allocation for Packet Loss Differentiated Services in VPN Access Links","year":2006,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer network; Quality of service; Computer science; Multiprotocol Label Switching; Network packet; Packet loss; Bandwidth (computing); Access control; Bandwidth allocation; Core network; Access network; Differentiated services; Resource allocation","score_opus":0.007126357424113367,"score_gpt":0.23983900489511598,"score_spread":0.23271264747100262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987938797","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28409094,0.00009687483,0.710853,0.0032277384,0.00016195263,0.00033684372,0.0000022857962,0.00026096386,0.0009694418],"genre_scores_gemma":[0.9957604,0.000005023407,0.0022589704,0.0005830099,0.000060185866,0.00006530498,0.000050708906,0.000008059078,0.0012083282],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989954,0.00004386592,0.00024186251,0.00032981916,0.00013658371,0.0002524523],"domain_scores_gemma":[0.9994022,0.00012052591,0.00007611223,0.0002945691,0.000068027424,0.000038559538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015044925,0.00011870773,0.00013434984,0.000093322036,0.00006837799,0.0002615423,0.0007662126,0.00012102748,0.000012005034],"category_scores_gemma":[0.0000033932718,0.00010449993,0.000043166892,0.00031233183,0.000016194504,0.00037045384,0.00009624864,0.00011354853,0.000012486243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016363375,0.0007521516,0.030925456,0.0002028393,0.000064767955,0.000019323164,0.00049754296,0.04239793,0.00046119632,0.22030997,0.0073860544,0.6968191],"study_design_scores_gemma":[0.00082747714,0.00002290256,0.038133666,0.000025181951,0.0000051807556,0.0000014815025,0.00001087181,0.9546306,0.00006649853,0.0036881273,0.0024462945,0.00014170847],"about_ca_topic_score_codex":0.00013763215,"about_ca_topic_score_gemma":0.0022493459,"teacher_disagreement_score":0.9122327,"about_ca_system_score_codex":0.00003333219,"about_ca_system_score_gemma":0.00002399383,"threshold_uncertainty_score":0.42613834},"labels":[],"label_agreement":null},{"id":"W1988618606","doi":"10.1109/hoti.2013.18","title":"TCP Pacing in Data Center Networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Google","keywords":"Burstiness; Computer network; Computer science; TCP Friendly Rate Control; TCP global synchronization; TCP delayed acknowledgment; Network packet; Zeta-TCP; TCP acceleration; CUBIC TCP; Data center; Real-time computing; Network congestion","score_opus":0.019250982511799814,"score_gpt":0.22427499105363907,"score_spread":0.20502400854183925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988618606","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022472208,0.00011580269,0.9833946,0.0037181594,0.00036805202,0.00013966426,3.2962066e-7,0.00015519875,0.009860922],"genre_scores_gemma":[0.98973817,0.0000118883245,0.007573784,0.0016136535,0.00011305626,0.000011134843,0.0000051158418,0.0000035600478,0.0009296157],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918985,0.000036973554,0.00014543059,0.00029393175,0.00009216534,0.00024163973],"domain_scores_gemma":[0.999053,0.00006252224,0.00002393923,0.0007772349,0.000019287545,0.00006399521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015775215,0.00007054349,0.00008615445,0.000035283134,0.000029708624,0.0001624291,0.0010303489,0.000034710207,0.00015754634],"category_scores_gemma":[0.0000080187265,0.00005713535,0.000013696796,0.00018458244,0.000011887216,0.00074879965,0.00038433226,0.000104674335,0.00023633479],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010274986,0.00003828154,0.006469034,0.0000010935577,0.0000058054798,0.0000061278542,0.00004242981,0.0030450427,0.0000034540024,0.020503502,0.058949526,0.9109347],"study_design_scores_gemma":[0.00028334203,0.0000052078894,0.0022733053,0.0000085762995,5.685078e-7,0.0000035988714,0.000008717204,0.9889066,8.782184e-7,0.00024355558,0.008187228,0.00007840615],"about_ca_topic_score_codex":0.00005564522,"about_ca_topic_score_gemma":0.000099287034,"teacher_disagreement_score":0.98749095,"about_ca_system_score_codex":0.000009512772,"about_ca_system_score_gemma":0.000012001046,"threshold_uncertainty_score":0.30376843},"labels":[],"label_agreement":null},{"id":"W1989039837","doi":"10.1109/vetecf.2010.5594425","title":"Performance Tradeoff Study of Streaming Video among Vehicle","year":2010,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Wireless ad hoc network; Computer network; Video streaming; Vehicular ad hoc network; Wireless; Wireless network; Network congestion; Multimedia; Real-time computing; Telecommunications; Network packet","score_opus":0.006978703971765961,"score_gpt":0.2025224091391616,"score_spread":0.19554370516739566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989039837","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.984041,0.000004925881,0.011918314,0.0001041117,0.00030111987,0.0001517371,1.1313845e-7,0.00013064619,0.0033480313],"genre_scores_gemma":[0.997929,0.0000011910141,0.0016291831,0.00004228836,0.000060397142,0.0000113918195,1.2402046e-7,0.000004015092,0.0003224424],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922854,0.000022901077,0.00018634457,0.0002097466,0.000190042,0.00016245151],"domain_scores_gemma":[0.9993604,0.00006700222,0.00006132488,0.0004016188,0.000047849328,0.00006184666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018033685,0.00008030415,0.0001184364,0.0000446274,0.00007453285,0.00004009951,0.00051608164,0.00003522037,0.000036226367],"category_scores_gemma":[0.000008551805,0.000066605535,0.000027182481,0.00020439748,0.000033291428,0.00035211325,0.00006798218,0.00015990784,0.000013145092],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006152642,0.00037525865,0.19636996,0.0000048356355,0.000019972837,0.0000038046578,0.0010619655,0.00069171074,0.001673651,0.004306631,0.00016327348,0.7953228],"study_design_scores_gemma":[0.000642286,0.0002003877,0.36107057,0.0000048592465,0.0000059760323,0.0000018728806,0.0001612068,0.6372051,0.00045120937,0.000018864112,0.00013985981,0.000097776945],"about_ca_topic_score_codex":0.00003895637,"about_ca_topic_score_gemma":0.00016456319,"teacher_disagreement_score":0.795225,"about_ca_system_score_codex":0.0000036269682,"about_ca_system_score_gemma":0.00002235658,"threshold_uncertainty_score":0.2716095},"labels":[],"label_agreement":null},{"id":"W1989533630","doi":"10.1109/pccc.2012.6407651","title":"Structured Message Transport","year":2012,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Path (computing); Dependency (UML); Layer (electronics); Computer network; Blocking (statistics); Transport layer; Protocol (science); Message passing; Distributed computing; Artificial intelligence","score_opus":0.008399976726247578,"score_gpt":0.20781733845699726,"score_spread":0.1994173617307497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989533630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013647766,0.00023442815,0.9529456,0.00073462224,0.00061673933,0.00006451859,3.572851e-7,0.00032083018,0.031435143],"genre_scores_gemma":[0.98487526,0.000003191509,0.012524487,0.0006388167,0.0001556949,0.000004788813,7.1862644e-7,0.0000029187722,0.0017941194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99945056,0.000015603036,0.00008523469,0.00010614029,0.00011669718,0.00022574166],"domain_scores_gemma":[0.9996117,0.000019386247,0.000016720769,0.00022753194,0.000015412083,0.00010925793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011102106,0.000063050364,0.000069235626,0.000019778432,0.000042220545,0.000017324077,0.00029721946,0.0000307558,0.00019959902],"category_scores_gemma":[0.0000017260103,0.000048699705,0.000035752437,0.0001130029,0.000011392638,0.00035985824,0.00001533593,0.000053042695,0.00008108813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020660148,0.000022850883,0.004825559,0.000001429244,0.000011099966,0.0000021767635,0.0002456425,0.000054313634,0.00008397889,0.560987,0.0022295376,0.43153435],"study_design_scores_gemma":[0.0029867864,0.00011903475,0.3121816,0.000019008328,0.00005821419,0.0001223806,0.000112461945,0.1486561,0.0028718403,0.008115468,0.523329,0.0014281],"about_ca_topic_score_codex":0.0000025721106,"about_ca_topic_score_gemma":0.000004047018,"teacher_disagreement_score":0.9712275,"about_ca_system_score_codex":0.0000060299335,"about_ca_system_score_gemma":0.000013743684,"threshold_uncertainty_score":0.21854693},"labels":[],"label_agreement":null},{"id":"W1989713667","doi":"10.1049/ip-com:20045215","title":"Design of an adaptive PI rate controller for streaming media traffic based on gain and phase margins","year":2006,"lang":"en","type":"article","venue":"IEE Proceedings - Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Active queue management; Computer science; Router; Network congestion; Computer network; Network packet; Queue; Real-time computing; Buffer overflow; Explicit Congestion Notification; Robustness (evolution); Adaptive control; The Internet; Control theory (sociology); Control (management); TCP Friendly Rate Control","score_opus":0.03665021532567122,"score_gpt":0.2698119325956443,"score_spread":0.23316171726997306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989713667","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014425181,0.0002765936,0.9814908,0.0020726365,0.0000483574,0.0009416228,0.000023881366,0.00018284908,0.00053806376],"genre_scores_gemma":[0.89808726,0.000022497874,0.10134024,0.00016992807,0.00004940313,0.00027456848,0.00001351466,0.000014098315,0.000028467259],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888784,0.000096902775,0.0003308303,0.00029974402,0.00014918689,0.00023549372],"domain_scores_gemma":[0.99763244,0.0012494317,0.00023015548,0.00046179027,0.00033590445,0.000090261296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080919627,0.00016973623,0.00025367033,0.00015073988,0.00030669483,0.0001183738,0.0010169432,0.00006983533,0.0000019044409],"category_scores_gemma":[0.00008148928,0.00016454172,0.00005245573,0.0002843033,0.0001576699,0.00035064816,0.000066909284,0.0001465798,0.0000014622022],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066703296,0.002146775,0.000032217573,0.000032367916,0.00007488788,0.0000010548949,0.0017172298,0.0584456,0.0057830294,0.235339,0.0013997152,0.6943611],"study_design_scores_gemma":[0.0036518965,0.0005268719,0.00015161106,0.000049280392,0.000034573677,0.0000015093106,0.00013041595,0.9928648,0.00031423534,0.0017558087,0.00035461382,0.00016438591],"about_ca_topic_score_codex":0.000010990062,"about_ca_topic_score_gemma":0.000017747217,"teacher_disagreement_score":0.9344192,"about_ca_system_score_codex":0.000032745862,"about_ca_system_score_gemma":0.00008262391,"threshold_uncertainty_score":0.67098165},"labels":[],"label_agreement":null},{"id":"W1989781991","doi":"10.1109/lcomm.2002.804251","title":"On the deployment of RED on shared-memory buffers","year":2002,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Queueing theory; Random early detection; Software deployment; Queue; Computer network; Shared resource; Scheme (mathematics); Resource allocation; Distributed computing; Shared memory; Mathematical optimization; Parallel computing; Network congestion; Mathematics; Active queue management; Operating system","score_opus":0.04059595175612478,"score_gpt":0.23722005548067612,"score_spread":0.19662410372455136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989781991","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09705175,0.00060377916,0.06809145,0.8107913,0.00083659095,0.00089518714,0.000010670766,0.00048057924,0.021238698],"genre_scores_gemma":[0.9816946,0.000081189566,0.0015884088,0.016356329,0.000028271097,0.00007930059,0.0000015167768,0.000008233135,0.00016216976],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989997,0.0002313962,0.00021090049,0.00017580825,0.00022260901,0.00015959465],"domain_scores_gemma":[0.99601024,0.00084423827,0.00011002279,0.0029538013,0.00003888355,0.000042823576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020316188,0.00010619737,0.000109207234,0.00007094745,0.00023956373,0.00005212134,0.002689367,0.000028818939,0.000050392377],"category_scores_gemma":[0.000031643325,0.00008089176,0.0000774763,0.00025757265,0.00013432995,0.000092458526,0.0001229529,0.00023026961,0.00015386724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000174271,0.0005221526,0.00005729634,0.0000059888234,0.000111247,0.0000042911165,0.0014151066,0.01236237,0.0043392647,0.15513061,0.5736894,0.25234485],"study_design_scores_gemma":[0.0018010102,0.00038122374,0.0017578984,0.0002909177,0.00005057127,0.000011435226,0.00011247468,0.93131715,0.002405082,0.0012278147,0.05995023,0.00069420383],"about_ca_topic_score_codex":0.0000070318406,"about_ca_topic_score_gemma":0.0000055932837,"teacher_disagreement_score":0.9189548,"about_ca_system_score_codex":0.000043624474,"about_ca_system_score_gemma":0.000008292059,"threshold_uncertainty_score":0.49975577},"labels":[],"label_agreement":null},{"id":"W1989893345","doi":"10.1109/iscc.2012.6249307","title":"A prediction-based active queue management for TCP networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Active queue management; Computer network; Computer science; Network congestion; Bottleneck; Queue; TCP Friendly Rate Control; Packet loss; Queue management system; Queueing theory; TCP global synchronization; Queuing delay; Network packet; Distributed computing; Embedded system","score_opus":0.014131278178303258,"score_gpt":0.219294607351787,"score_spread":0.20516332917348373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989893345","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017031659,0.00009428162,0.987851,0.0009234009,0.000940322,0.0004387123,0.000002041933,0.0003286431,0.009251266],"genre_scores_gemma":[0.9607865,0.000005812566,0.035107736,0.001567833,0.0004238532,0.00029274638,0.0000055773003,0.000007010422,0.0018028971],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918,0.00002812901,0.00012834395,0.0001988674,0.00012220595,0.00034245814],"domain_scores_gemma":[0.9993811,0.00013860784,0.000041617048,0.00027400485,0.000043301403,0.00012135039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020146949,0.00009803215,0.00009070178,0.00004525299,0.000111248184,0.00005371677,0.00029606235,0.00004621411,0.000037639602],"category_scores_gemma":[0.0000043994805,0.00008438518,0.00006831069,0.0001632527,0.000015239462,0.00028875907,0.000041958578,0.000058522633,0.000024834202],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002869285,0.000100173624,0.00040330805,0.000006223203,0.000051691302,6.388028e-7,0.00005047789,0.021229364,0.0000010796527,0.27407026,0.018128367,0.6859297],"study_design_scores_gemma":[0.0006908218,0.00004287702,0.0017227583,0.000007854048,0.000016116446,9.1085e-7,0.000018342798,0.9534104,0.000023565832,0.0002076464,0.04375751,0.00010121989],"about_ca_topic_score_codex":0.0000023657083,"about_ca_topic_score_gemma":0.0000027961428,"teacher_disagreement_score":0.96061623,"about_ca_system_score_codex":0.00003502764,"about_ca_system_score_gemma":0.000014988732,"threshold_uncertainty_score":0.34411278},"labels":[],"label_agreement":null},{"id":"W1990749876","doi":"10.1145/1596519.1596521","title":"FISTE","year":2009,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Computer Simulation","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Quality of service; Network traffic simulation; Distributed computing; Computer network; Traffic engineering; Traffic generation model; Network traffic control; Queue; Sampling (signal processing); Traffic classification","score_opus":0.021844129165387045,"score_gpt":0.2501052288329259,"score_spread":0.22826109966753885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990749876","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008662073,0.000054362095,0.9889016,0.0016668483,0.0002329562,0.000089831236,4.85369e-7,0.00030479179,0.00008706405],"genre_scores_gemma":[0.9325631,0.000016539056,0.06619189,0.0010855723,0.0000905751,0.0000031518498,0.000001172234,0.0000039344013,0.000044011213],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992032,0.000034834524,0.00016896022,0.0003019773,0.00014145301,0.00014954069],"domain_scores_gemma":[0.99933773,0.00009672801,0.000027913093,0.0004082715,0.000058887425,0.00007045074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000093871284,0.00011566211,0.00010581022,0.00008971486,0.00022178105,0.0001367006,0.00026782256,0.000056479843,0.0000029174657],"category_scores_gemma":[0.0000024466403,0.00011314401,0.000050246465,0.0001491921,0.0000077373,0.00030282186,0.0000049097926,0.00012702732,0.0000114867335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004985536,0.000019379544,5.7593786e-7,5.4194584e-7,0.0000033206056,5.338161e-7,0.00006301022,0.52700883,0.0000012702751,0.0013607405,0.0000031257955,0.47153372],"study_design_scores_gemma":[0.0003792455,0.0001464116,0.000048698563,0.000016365693,0.000007644623,0.000004003324,0.0000021402786,0.98924303,0.000004326852,0.009894171,0.00012939757,0.00012458167],"about_ca_topic_score_codex":0.000002204621,"about_ca_topic_score_gemma":8.292796e-7,"teacher_disagreement_score":0.9239011,"about_ca_system_score_codex":0.000013852774,"about_ca_system_score_gemma":0.000013387776,"threshold_uncertainty_score":0.46138787},"labels":[],"label_agreement":null},{"id":"W1991046554","doi":"10.1145/1400713.1400749","title":"Suboptimal real time congestion control of TCP flows in computer networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Active queue management; Network congestion; Computer science; TCP tuning; TCP Friendly Rate Control; Computer network; H-TCP; Router; Explicit Congestion Notification; Queue; Throughput; Random early detection; Packet loss; CUBIC TCP; Network packet; TCP Westwood plus; Queueing theory; Real-time computing; Operating system","score_opus":0.007033559276517214,"score_gpt":0.18934816798406134,"score_spread":0.18231460870754412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991046554","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07813798,0.00008192319,0.918699,0.00046775083,0.0003024647,0.00022823377,9.479826e-7,0.00020516945,0.0018765306],"genre_scores_gemma":[0.97661537,0.000058660688,0.022457948,0.00030364218,0.00020922838,0.000014125462,0.0000033732404,0.000008177253,0.00032946025],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985434,0.00013333255,0.00041943128,0.00034532623,0.00022724873,0.00033130744],"domain_scores_gemma":[0.9990782,0.00024539346,0.00010923982,0.00036329823,0.000100901154,0.00010296625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003024526,0.00016118625,0.00034349196,0.00010830263,0.00006043508,0.00002577512,0.00047299138,0.00011721923,0.00007555513],"category_scores_gemma":[0.000007807863,0.00014696817,0.000084902975,0.0003335509,0.00007541651,0.00028011607,0.00006801673,0.00015929683,0.00006848572],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010933794,0.00019061986,0.0066313995,0.0000044451976,0.000039080063,0.0000985885,0.00017180934,0.74005646,0.000152251,0.020446235,0.0031085445,0.22899126],"study_design_scores_gemma":[0.0017470049,0.00013818183,0.015084862,0.000014906115,0.0000049716004,0.000037532154,0.0000010104784,0.98257554,0.000010018168,0.00004988958,0.00018100943,0.00015510293],"about_ca_topic_score_codex":0.00005428932,"about_ca_topic_score_gemma":0.000023986615,"teacher_disagreement_score":0.8984774,"about_ca_system_score_codex":0.000029497656,"about_ca_system_score_gemma":0.00006245664,"threshold_uncertainty_score":0.5993188},"labels":[],"label_agreement":null},{"id":"W1991826621","doi":"10.1142/s0218213007003199","title":"A FAST HYBRID ALGORITHM FOR MULTICAST ROUTING IN WIRELESS NETWORKS","year":2007,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Multicast; Protocol Independent Multicast; Distance Vector Multicast Routing Protocol; Distributed computing; Computer network; Xcast; Pragmatic General Multicast; Source-specific multicast; Algorithm","score_opus":0.03618702182338484,"score_gpt":0.3124522119035435,"score_spread":0.27626519008015865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991826621","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012908632,0.000051937874,0.9829578,0.0009063145,0.0028697972,0.00016872525,0.0000044283215,0.000026742244,0.000105654995],"genre_scores_gemma":[0.9377976,0.000024440416,0.060435355,0.0002978321,0.0014025716,0.000005262762,0.0000022721047,0.000009956246,0.000024682073],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977513,0.00004481563,0.0011148481,0.00022864496,0.00048982166,0.00037059226],"domain_scores_gemma":[0.99753594,0.00087031315,0.00046824207,0.00014296744,0.00085725205,0.00012528454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018042652,0.00014847667,0.00024310334,0.0002907051,0.00006236636,0.00035941246,0.0012875821,0.000062648156,0.00001566576],"category_scores_gemma":[0.0002144157,0.00014136574,0.00017753859,0.00023584723,0.000059354825,0.00073189003,0.00009177542,0.00031481325,0.000011306865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008643998,0.000115208866,0.00007403898,7.460415e-7,0.000039763807,0.00017234834,0.00018149894,0.01268639,0.00012834131,0.041668423,0.000037927854,0.9448089],"study_design_scores_gemma":[0.00017530746,0.00011754312,0.00017052577,0.00008937954,0.000006318529,0.00015692688,0.00020070914,0.991841,0.0031956641,0.0036054486,0.00029023137,0.0001509333],"about_ca_topic_score_codex":0.000012403809,"about_ca_topic_score_gemma":0.00004281387,"teacher_disagreement_score":0.97915465,"about_ca_system_score_codex":0.00014044046,"about_ca_system_score_gemma":0.000104165745,"threshold_uncertainty_score":0.57647276},"labels":[],"label_agreement":null},{"id":"W1992346858","doi":"10.1177/0037549706067079","title":"An Adaptive Load Balancer for Multiprocessor Routers","year":2006,"lang":"en","type":"article","venue":"SIMULATION","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Load balancing (electrical power); Cache; Scheduling (production processes); Network packet; Distributed computing; Multiprocessing; Workload; Computer network; The Internet; Hash table; Processor sharing; Granularity; Hash function; Parallel computing; Operating system; Queueing theory","score_opus":0.011791603107555752,"score_gpt":0.26044859490019523,"score_spread":0.24865699179263948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992346858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013865282,0.000056175435,0.98493034,0.00018901346,0.00021304072,0.00024103496,0.0000033820822,0.00017735177,0.00032440812],"genre_scores_gemma":[0.97909045,3.7396504e-7,0.020190172,0.00017290897,0.0003024261,0.0000343907,0.000011179736,0.000005750049,0.00019232888],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933785,0.000019715178,0.00012244348,0.00023167215,0.00014002557,0.00014830893],"domain_scores_gemma":[0.9994453,0.000113376955,0.000059629667,0.00017627895,0.00017310285,0.00003230197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011182946,0.00007565412,0.000075493524,0.000025683858,0.00008648568,0.00007308816,0.00018689247,0.000041762243,0.0000046810806],"category_scores_gemma":[0.000009885143,0.00007210383,0.000033856304,0.0001092453,0.000011386825,0.000493124,0.000009375025,0.000031928066,0.000012139843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003502422,0.000026562006,0.00022433752,0.0000017822819,0.000003067335,3.1748232e-7,0.000066727254,0.8048654,0.00006337515,0.013171424,0.00013498797,0.18140697],"study_design_scores_gemma":[0.0007139007,0.000080792124,0.001988675,0.0000048982606,0.0000043513164,2.0158588e-7,0.0000055975493,0.9915513,0.000050427483,0.0027949254,0.0027071766,0.00009778249],"about_ca_topic_score_codex":0.00002261417,"about_ca_topic_score_gemma":0.00003523726,"teacher_disagreement_score":0.96522516,"about_ca_system_score_codex":0.000047963855,"about_ca_system_score_gemma":0.000042858755,"threshold_uncertainty_score":0.2940309},"labels":[],"label_agreement":null},{"id":"W1992794662","doi":"10.1504/ijipt.2005.008043","title":"Self-tuning PI rate controller for best-effort traffic with interval phase margin assignment","year":2005,"lang":"en","type":"article","venue":"International Journal of Internet Protocol Technology","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Computer science; Margin (machine learning); Phase (matter); Phase margin; Interval (graph theory); Controller (irrigation); Control theory (sociology); PID controller; Pi; Real-time computing; Mathematics; Telecommunications; Artificial intelligence; Physics; Control (management); Engineering; Control engineering; Combinatorics; Operational amplifier; Bandwidth (computing)","score_opus":0.013111159035972014,"score_gpt":0.3022334836378982,"score_spread":0.2891223246019262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992794662","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006615016,0.000035863817,0.9516569,0.010703659,0.00044608922,0.030035725,0.000003754745,0.00022350607,0.00027952014],"genre_scores_gemma":[0.8571737,0.0000047710773,0.0864853,0.0006822788,0.0006290163,0.054385707,0.0000014952581,0.000028518658,0.0006092367],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783736,0.00006106411,0.0009272981,0.00035000863,0.0004621843,0.00036206798],"domain_scores_gemma":[0.9976308,0.00014203493,0.0008831929,0.00023329737,0.000995634,0.00011505169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007162829,0.00027197512,0.00043478757,0.00063133816,0.000047930735,0.00021589304,0.0022286063,0.00016692608,0.000056438006],"category_scores_gemma":[0.000067070796,0.00020733553,0.00019956923,0.00019947688,0.00009829797,0.0006147459,0.00017974709,0.0004533964,0.00002359428],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023770318,0.0013086417,0.00013274729,0.000020324544,0.0008988623,0.00015497977,0.00023388297,0.0037021204,0.0004289381,0.030620059,0.0029682303,0.95715415],"study_design_scores_gemma":[0.022545714,0.004675638,0.000008459271,0.0003674998,0.000043391727,0.0010410981,0.000069420814,0.60211706,0.0029802148,0.00085858465,0.3649824,0.00031050332],"about_ca_topic_score_codex":8.7237663e-7,"about_ca_topic_score_gemma":0.000009188868,"teacher_disagreement_score":0.9568437,"about_ca_system_score_codex":0.00030503265,"about_ca_system_score_gemma":0.00020109453,"threshold_uncertainty_score":0.84548974},"labels":[],"label_agreement":null},{"id":"W1993274576","doi":"10.1002/dac.496","title":"A simple, scalable and provably stable explicit rate computation scheme for flow control in communication networks","year":2001,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Computer science; Scalability; Computation; Controller (irrigation); Simple (philosophy); Flow control (data); Process (computing); Scheme (mathematics); Control (management); Algorithm; Control theory (sociology); Computer network; Mathematics","score_opus":0.016489986643166404,"score_gpt":0.2715358232506895,"score_spread":0.25504583660752306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993274576","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014816217,0.0053354697,0.9748632,0.0037243043,0.0003886387,0.0005395215,0.000004596529,0.00003999172,0.0002880988],"genre_scores_gemma":[0.98421705,0.0014472725,0.013639859,0.00036034596,0.00013497908,0.00008972876,0.000022685843,0.000012573752,0.00007547838],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780476,0.0005258927,0.0009577626,0.00016886745,0.00034334493,0.00019934186],"domain_scores_gemma":[0.9962093,0.00096793496,0.000866271,0.00046148317,0.0014069777,0.0000880389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002342059,0.00014453591,0.00032543534,0.000270585,0.00013946588,0.00047948377,0.001475248,0.000087964676,0.0000030338088],"category_scores_gemma":[0.00011448073,0.00014057194,0.000075450764,0.0002734854,0.00004449317,0.0011192847,0.0001351886,0.00026156602,0.0000025039108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046023983,0.00024998665,0.007813804,0.000009354582,0.000243951,0.000009313281,0.0005818522,0.837966,0.00018275355,0.053842004,0.0033471643,0.09529357],"study_design_scores_gemma":[0.0031967063,0.00007015424,0.0016898009,0.00020296773,0.000010586036,0.00007959398,0.00014722596,0.9783935,0.0000043792566,0.0015280516,0.014549668,0.00012739823],"about_ca_topic_score_codex":0.000063741354,"about_ca_topic_score_gemma":0.00004768657,"teacher_disagreement_score":0.9694009,"about_ca_system_score_codex":0.00014520559,"about_ca_system_score_gemma":0.00010414778,"threshold_uncertainty_score":0.57323575},"labels":[],"label_agreement":null},{"id":"W1993479688","doi":"10.4028/www.scientific.net/amr.108-111.811","title":"Assessment of An Advanced Traffic State Detector","year":2010,"lang":"en","type":"article","venue":"Advanced materials research","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ministry of Transportation of Ontario","funders":"Key Technologies Research and Development Program","keywords":"Detector; State (computer science); Microwave; Computer science; Engineering; Telecommunications; Algorithm","score_opus":0.021775375830218387,"score_gpt":0.3631677697864946,"score_spread":0.34139239395627624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993479688","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97946495,0.000033352637,0.018265314,0.00017327453,0.0010209426,0.000492736,0.000017071387,0.00018372701,0.00034862012],"genre_scores_gemma":[0.9308574,0.00004136232,0.06861198,0.000027137732,0.00009948116,0.00013516452,0.0000060785933,0.00001992696,0.00020144256],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9972911,0.0003635512,0.0004140143,0.0005511111,0.00073980825,0.0006404547],"domain_scores_gemma":[0.9978714,0.00030918425,0.00012275048,0.0010026721,0.00047506398,0.0002189284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017585754,0.0001652596,0.0003175165,0.00019468386,0.00017894877,0.00017849125,0.0012447897,0.000077832585,0.00015667167],"category_scores_gemma":[0.00011803409,0.00014894461,0.000040364146,0.00046346823,0.00016758432,0.00080059527,0.00022220689,0.00038172398,0.000031999167],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034697816,0.00006997871,0.000004083028,0.000014572665,0.0000059390186,0.000008661828,0.000045197838,0.0021892483,0.59781253,0.0055227345,0.000008291241,0.3942841],"study_design_scores_gemma":[0.0034827723,0.0015828337,0.0065310146,0.00007633619,0.0000068053278,0.000025326968,0.00008028315,0.074236795,0.90091527,0.0054211617,0.006999958,0.0006414189],"about_ca_topic_score_codex":0.000008798524,"about_ca_topic_score_gemma":0.00007047769,"teacher_disagreement_score":0.39364266,"about_ca_system_score_codex":0.000033709373,"about_ca_system_score_gemma":0.00024790826,"threshold_uncertainty_score":0.6073785},"labels":[],"label_agreement":null},{"id":"W1994909634","doi":"10.1109/broadnets.2006.4374368","title":"Self-Tuning Utility-Based Controller for End-to-End Congestion in the Internet","year":2006,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Active queue management; Explicit Congestion Notification; Computer network; Network congestion; Computer science; Random early detection; Packet loss; Transmission Control Protocol; Router; Network packet; The Internet; Controller (irrigation); Real-time computing; TCP Friendly Rate Control","score_opus":0.01302670876572888,"score_gpt":0.22865183051715718,"score_spread":0.2156251217514283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994909634","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054565575,0.00006612796,0.98046374,0.0077936226,0.00021787983,0.0007678781,0.0000021290741,0.00023112881,0.005000941],"genre_scores_gemma":[0.9723424,5.153016e-7,0.023269832,0.0035307235,0.00013530713,0.000212342,0.000005729255,0.0000062705335,0.0004968786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987138,0.00015047821,0.0002748783,0.00034135627,0.00021077371,0.00030870855],"domain_scores_gemma":[0.99874836,0.0007673111,0.000057738125,0.00029071103,0.000087615255,0.000048270147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009036456,0.00013791572,0.0001730988,0.000096329815,0.00007462231,0.00019336818,0.0006437904,0.00005961005,0.00003034419],"category_scores_gemma":[0.00003546144,0.00009700634,0.000078590645,0.00027536514,0.000024606808,0.00015104159,0.00003586439,0.000117525546,0.000024499584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015001647,0.00030313086,0.0024697348,0.000016807218,0.000025342886,0.000010564483,0.00046011584,0.006575928,0.000056352466,0.53609765,0.018265182,0.43556917],"study_design_scores_gemma":[0.0017601247,0.000099917466,0.0027387906,0.000011615863,0.000008812094,0.000002562382,0.000022891687,0.9390387,0.00003832238,0.0014220916,0.054730587,0.00012561084],"about_ca_topic_score_codex":0.00010017007,"about_ca_topic_score_gemma":0.0003689121,"teacher_disagreement_score":0.96688586,"about_ca_system_score_codex":0.00003350208,"about_ca_system_score_gemma":0.000061199375,"threshold_uncertainty_score":0.39558038},"labels":[],"label_agreement":null},{"id":"W1995891445","doi":"10.1016/s1389-1286(01)00176-1","title":"A load adaptive mechanism for buffer management","year":2001,"lang":"en","type":"article","venue":"Computer Networks","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Computer science; Buffer (optical fiber); Mechanism (biology); Distributed computing; Computer network; Telecommunications","score_opus":0.013174040701402493,"score_gpt":0.2110804358120621,"score_spread":0.1979063951106596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995891445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015692842,0.00026951914,0.993005,0.0009510177,0.0020315067,0.00060522585,5.91686e-7,0.00043923318,0.0025409851],"genre_scores_gemma":[0.7055297,0.0001274125,0.28607216,0.0047129607,0.0018457957,0.0002508655,0.0000037485822,0.000026638205,0.0014307041],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835455,0.000050411425,0.00024922716,0.0005734364,0.00024175014,0.0005306255],"domain_scores_gemma":[0.99891317,0.00013132949,0.00008265568,0.0005613359,0.00016701552,0.00014451478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024255601,0.00022638257,0.00022882763,0.00005822024,0.00018032163,0.00019084362,0.0009117617,0.000097666445,0.000010815722],"category_scores_gemma":[0.0000017014041,0.00021540315,0.00014428142,0.00029620464,0.000024855337,0.00022229817,0.00029476726,0.00014000661,0.000047344703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002156793,0.000031319123,0.0000062881754,0.0000022315019,0.0000488091,0.000029280363,0.000030643776,0.01971104,1.8406558e-7,0.4725497,0.010971897,0.49659702],"study_design_scores_gemma":[0.0010241842,0.00016369524,0.0000897248,0.00003566597,0.000019787087,0.000026630954,0.0000042060246,0.96044517,0.0000013456572,0.018206486,0.019729005,0.0002541039],"about_ca_topic_score_codex":0.0000023248788,"about_ca_topic_score_gemma":0.0000053092376,"teacher_disagreement_score":0.94073415,"about_ca_system_score_codex":0.000073466756,"about_ca_system_score_gemma":0.000023613877,"threshold_uncertainty_score":0.8783886},"labels":[],"label_agreement":null},{"id":"W1996482980","doi":"10.1145/974036.974037","title":"A performance comparison of dynamic Web technologies","year":2003,"lang":"en","type":"article","venue":"ACM SIGMETRICS Performance Evaluation Review","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Perl; Computer science; Dynamic web page; Workload; Java; Operating system; Web application; Application server; Web server; Implementation; Database; World Wide Web; Web service; The Internet; Software engineering","score_opus":0.0493705115308195,"score_gpt":0.3324819771618349,"score_spread":0.2831114656310154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996482980","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45292968,0.49993,0.033271477,0.0023356986,0.0013061659,0.0028322972,0.00000317915,0.00086912746,0.0065223738],"genre_scores_gemma":[0.88395476,0.10380442,0.011839306,0.00017377123,0.000007747766,0.00015125611,0.0000050913545,0.000008933386,0.000054724074],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972068,0.00021497806,0.0008070211,0.000411374,0.0010383242,0.00032147166],"domain_scores_gemma":[0.9969939,0.00030933775,0.00053087575,0.0014283028,0.00068774755,0.00004982959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003384149,0.00021925702,0.0005300736,0.0004190434,0.00015164299,0.00003911097,0.0014680933,0.00010286524,0.00007180129],"category_scores_gemma":[0.0025218849,0.00019071503,0.00010563079,0.003917956,0.000074592186,0.0005979761,0.00016352539,0.00025179822,0.00012113858],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018151732,0.000058658887,0.0055154515,0.00047675607,0.000015280626,1.3577159e-7,0.000025777783,0.0006142564,0.000029815244,0.0012449877,0.0007515343,0.99126554],"study_design_scores_gemma":[0.00055359,0.00020672419,0.0016073822,0.0009893352,0.00009019667,0.00000841642,0.000020131762,0.9822272,0.0002955521,0.00010624696,0.013643067,0.00025214587],"about_ca_topic_score_codex":3.02549e-7,"about_ca_topic_score_gemma":8.5378156e-7,"teacher_disagreement_score":0.9910134,"about_ca_system_score_codex":0.000114132185,"about_ca_system_score_gemma":0.00034079456,"threshold_uncertainty_score":0.7777133},"labels":[],"label_agreement":null},{"id":"W1996617692","doi":"10.1177/0037549702078003529","title":"Design and Modeling of an Interval-based ABR Flow Control Protocol","year":2002,"lang":"en","type":"article","venue":"SIMULATION","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Asynchronous Transfer Mode; Computer science; Flow control (data); Asynchronous communication; Computer network; Distributed computing; Signaling protocol; Queueing theory; Quality of service; Real-time computing","score_opus":0.042903887363198424,"score_gpt":0.2782080821058877,"score_spread":0.2353041947426893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996617692","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019093028,0.000009887848,0.988463,0.00011961944,0.000033335757,0.0093235355,3.4876788e-7,0.00008805283,0.000052927902],"genre_scores_gemma":[0.9535193,1.0857831e-7,0.04422834,0.0001189373,0.00003570013,0.0020808268,4.777295e-7,0.000004715198,0.000011589488],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928516,0.00011676981,0.00018755309,0.0001790464,0.00012891342,0.00010254546],"domain_scores_gemma":[0.9994643,0.00013436477,0.00006652281,0.00019401894,0.000093983865,0.000046858288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023144297,0.000073923555,0.00010753642,0.000049840542,0.000048749247,0.000046732723,0.0001383715,0.00004053421,0.000017660777],"category_scores_gemma":[0.000018041566,0.00006776829,0.000022392962,0.00009224459,0.000014157092,0.00031534396,0.000010381385,0.000046209272,0.000003954826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027213335,0.00002802908,0.000016223752,0.0000050730855,0.0000029575665,4.98989e-7,0.0000811405,0.7642857,0.000027809388,0.00020475473,0.0000033754868,0.23531725],"study_design_scores_gemma":[0.0017534308,0.00015231853,0.000021547032,0.000019114093,0.0000049238893,3.9625587e-7,0.0000015414415,0.9974719,0.000031355292,0.00042053405,0.00005050499,0.00007239412],"about_ca_topic_score_codex":0.0000016958245,"about_ca_topic_score_gemma":6.5587113e-7,"teacher_disagreement_score":0.95161,"about_ca_system_score_codex":0.000009980958,"about_ca_system_score_gemma":0.000012221897,"threshold_uncertainty_score":0.27635106},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03939153127542008,"score_gpt":0.2353731715165785,"score_spread":0.1959816402411584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998103163","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19918627,0.00026234507,0.7934836,0.00061881525,0.0023228899,0.00014135524,1.5053706e-7,0.00062741607,0.0033571485],"genre_scores_gemma":[0.99361795,0.000006719018,0.0038275302,0.0008535485,0.000576321,0.0000065047902,7.1839895e-7,0.00001705399,0.001093652],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978206,0.000118986085,0.00044482358,0.00056962937,0.00053448713,0.00051143154],"domain_scores_gemma":[0.9989459,0.000100145226,0.00015014794,0.00044788417,0.00019670224,0.00015922305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006930138,0.0002435228,0.00025342064,0.00011914372,0.000061386716,0.0003163357,0.0013193771,0.0000754633,0.000051241364],"category_scores_gemma":[0.000032052772,0.00023432817,0.00013679397,0.0003079516,0.000041758747,0.00023648547,0.0001778094,0.00027613176,0.00040947658],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016175705,0.00008995543,0.00039886273,0.000006190617,0.00006413296,0.00009669748,0.0008249962,0.0144644715,0.00008157479,0.0053322976,0.015894111,0.9627305],"study_design_scores_gemma":[0.00054718787,0.000100017176,0.00032863792,0.00012297291,0.000008725499,0.00013771042,0.000015946613,0.97042394,0.00022557518,0.00008714287,0.027726458,0.0002757059],"about_ca_topic_score_codex":0.00003142388,"about_ca_topic_score_gemma":0.000044471763,"teacher_disagreement_score":0.96245486,"about_ca_system_score_codex":0.0001394168,"about_ca_system_score_gemma":0.000055353266,"threshold_uncertainty_score":0.95556253},"labels":[],"label_agreement":null},{"id":"W1998932429","doi":"10.1002/ett.1279","title":"Novel DLC model for QoS enhancement of bursty VBR traffic in wireless ATM networks","year":2008,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"DOD Prostate Cancer Research Program","keywords":"Variable bitrate; Computer science; Quality of service; Computer network; Wireless; Asynchronous Transfer Mode; Data transmission; Transmission (telecommunications); Constant bitrate; Real-time computing; Telecommunications","score_opus":0.03266858112907921,"score_gpt":0.23853188765095434,"score_spread":0.20586330652187512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998932429","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009438112,0.00015753435,0.98730063,0.0010195108,0.00015921467,0.00050919567,0.0000152453395,0.0001586704,0.001241861],"genre_scores_gemma":[0.9275837,0.0006593871,0.070629925,0.00021398556,0.000032259624,0.00015162237,0.000014201401,0.000027058933,0.00068785535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845374,0.00018733615,0.00056042924,0.00034439197,0.00014339546,0.00031073],"domain_scores_gemma":[0.9979672,0.0003256117,0.0001616089,0.001318027,0.00013394511,0.00009362392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039626876,0.00019024695,0.00024506144,0.00018043992,0.00043566985,0.000028105034,0.0013704834,0.00005290144,0.000012266278],"category_scores_gemma":[0.000008678341,0.00020450189,0.00016350091,0.00055053044,0.000117597425,0.00021808334,0.000020337444,0.0003493128,0.000015970454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023361632,0.0009059983,0.000004045781,0.0000054849575,0.000031652693,7.8397187e-7,0.0007417078,0.8025695,0.00021110481,0.0039104978,0.00020124896,0.19139463],"study_design_scores_gemma":[0.0011261976,0.00010669768,0.00022993807,0.000043109805,0.000015678695,0.000008645588,0.000022939128,0.9972413,0.00015204787,0.0000195212,0.00083846954,0.00019542889],"about_ca_topic_score_codex":0.000007960662,"about_ca_topic_score_gemma":0.000109000095,"teacher_disagreement_score":0.9181456,"about_ca_system_score_codex":0.000066314984,"about_ca_system_score_gemma":0.00010542229,"threshold_uncertainty_score":0.8339345},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03497306590581862,"score_gpt":0.22636739065720735,"score_spread":0.19139432475138873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999288870","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016282146,0.0007701117,0.97864115,0.006540216,0.0015287551,0.00019497209,0.0000015849492,0.00042490216,0.010270091],"genre_scores_gemma":[0.97919446,0.000017010037,0.01740169,0.002254808,0.0004174881,0.000030847234,0.00000944216,0.000009539728,0.0006647007],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835646,0.00015420535,0.0003232658,0.00047276824,0.00030147072,0.00039184073],"domain_scores_gemma":[0.99874544,0.000117482996,0.00011377902,0.00076344033,0.0001268114,0.00013303498],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00029919753,0.00014882936,0.00016930012,0.000047314275,0.00016910033,0.00016167012,0.0008565234,0.00009690218,0.0006458325],"category_scores_gemma":[0.000021955011,0.00014050418,0.0000735866,0.0003390078,0.00004575911,0.00022482604,0.00007876544,0.00012409639,0.0009148681],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009904474,0.0001814431,0.0017793736,0.0000021202038,0.000054607324,0.000007785465,0.00006804516,0.0036531736,0.00023728986,0.013689162,0.04991778,0.9303993],"study_design_scores_gemma":[0.0013202962,0.000071982126,0.0031645233,0.000018280138,0.000029143466,0.0000028121433,0.0000090397,0.95491946,0.00021955399,0.016367732,0.023545904,0.00033126835],"about_ca_topic_score_codex":0.000035453286,"about_ca_topic_score_gemma":0.000079189704,"teacher_disagreement_score":0.97756624,"about_ca_system_score_codex":0.000041990686,"about_ca_system_score_gemma":0.000027527018,"threshold_uncertainty_score":0.999863},"labels":[],"label_agreement":null},{"id":"W1999423211","doi":"10.1109/iwcmc.2012.6314312","title":"On-demand scheduling for concurrent multipath transfer under delay-based disparity","year":2012,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"University of Toronto; Princeton University","keywords":"Computer science; Scheduling (production processes); Distributed computing; Multipath propagation; Network congestion; Computer network; Fair-share scheduling; Data transmission; Dynamic priority scheduling; Round-robin scheduling; Job shop scheduling; Real-time computing; Mathematical optimization","score_opus":0.02803234572313531,"score_gpt":0.267013599271884,"score_spread":0.2389812535487487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999423211","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027683316,0.00026097294,0.9692154,0.0010664738,0.000917415,0.00033342006,0.000003688135,0.00019081822,0.00032847718],"genre_scores_gemma":[0.9778502,0.0000028489928,0.019810025,0.0019786847,0.00017124889,0.000079185294,0.0000039134584,0.000008363089,0.00009553685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893135,0.000047243273,0.00017765975,0.00025756724,0.00017303987,0.00041312125],"domain_scores_gemma":[0.99904317,0.00042806714,0.000020451704,0.0002526155,0.000060565104,0.00019513501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003355481,0.00014528692,0.00015353438,0.00003840164,0.00013918793,0.00007135607,0.00029636198,0.00006501031,0.000037680955],"category_scores_gemma":[0.000017543989,0.000114935065,0.000109378096,0.00009809689,0.00002970356,0.00023216463,0.000017489472,0.000109399094,0.000040811803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027951894,0.0002792201,0.00049958186,0.000013115373,0.00002525065,4.9842913e-7,0.00009180647,0.030525772,0.000033324435,0.8546527,0.0006228012,0.113227956],"study_design_scores_gemma":[0.0017926601,0.00008590257,0.00051822735,0.00001837621,0.000015632024,0.0000011436399,0.000008003765,0.9942418,0.00026558913,0.00074965117,0.0021013315,0.00020172732],"about_ca_topic_score_codex":0.0000031204197,"about_ca_topic_score_gemma":0.000008858865,"teacher_disagreement_score":0.963716,"about_ca_system_score_codex":0.000026552696,"about_ca_system_score_gemma":0.000053332114,"threshold_uncertainty_score":0.4686916},"labels":[],"label_agreement":null},{"id":"W2000297053","doi":"10.1109/noms.2006.1687666","title":"A Bandwidth Bargain Model based on Adaptive Weighted Fair Queueing","year":2006,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Weighted fair queueing; Computer science; Computer network; Bandwidth (computing); Queueing theory; Quality of service; Bandwidth allocation; Dynamic bandwidth allocation; Network packet; Proportionally fair; Fair queuing; Distributed computing; Dynamic priority scheduling; Round-robin scheduling","score_opus":0.0070614706659466765,"score_gpt":0.19018784124497112,"score_spread":0.18312637057902445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000297053","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007358289,0.000031335723,0.9341562,0.0015690324,0.00009640093,0.0001396642,0.0000011426371,0.0004596101,0.06281079],"genre_scores_gemma":[0.9386635,7.5025923e-7,0.056840338,0.001972861,0.00009698666,0.000023042752,0.0000022467436,0.000008869966,0.002391433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881417,0.00006240137,0.00018208697,0.00038734937,0.000259936,0.0002940382],"domain_scores_gemma":[0.99929863,0.00013554754,0.000048030317,0.00037298547,0.0000665046,0.00007830887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016660699,0.00015727752,0.00014592941,0.0000920026,0.00011942114,0.00009318542,0.00041997794,0.00006189523,0.00003194818],"category_scores_gemma":[0.000004495011,0.00012911027,0.0000746169,0.0002708459,0.000023688772,0.00020694218,0.0000394344,0.00012262759,0.00008131094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023783065,0.0000762231,0.000030119909,9.688014e-7,0.000005124867,0.0000114288905,0.00001765184,0.399295,0.000030002459,0.510265,0.006746133,0.08349857],"study_design_scores_gemma":[0.00068106304,0.00007699388,0.00010919273,0.000014871564,0.0000038153917,9.122728e-7,0.000002969956,0.9877033,0.000097144744,0.010444036,0.00069069397,0.00017497063],"about_ca_topic_score_codex":0.000052540003,"about_ca_topic_score_gemma":0.00003614992,"teacher_disagreement_score":0.93792766,"about_ca_system_score_codex":0.00004351065,"about_ca_system_score_gemma":0.00013710016,"threshold_uncertainty_score":0.5264964},"labels":[],"label_agreement":null},{"id":"W2001202910","doi":"10.1109/icc.2013.6655110","title":"TCP-ETX: A cross layer path metric for TCP optimization in wireless networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"TCP global synchronization; Computer network; TCP acceleration; Computer science; Zeta-TCP; TCP Friendly Rate Control; TCP tuning; TCP Westwood plus; CUBIC TCP; Transmission Control Protocol; TCP delayed acknowledgment; Overhead (engineering); Network packet","score_opus":0.010946896529766109,"score_gpt":0.23663682759766116,"score_spread":0.22568993106789506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001202910","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00874117,0.00013973554,0.9880281,0.0007215607,0.0004314852,0.00060088106,5.479507e-7,0.00020188751,0.0011346262],"genre_scores_gemma":[0.9490858,0.000030103292,0.048289593,0.00072061474,0.00014850483,0.00027903783,0.000004885059,0.000011774711,0.0014297117],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871725,0.000052264928,0.00029680927,0.0003795359,0.00016144311,0.00039267712],"domain_scores_gemma":[0.9990819,0.00024383033,0.00008108958,0.00032437762,0.000166855,0.00010195276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028458252,0.00014306356,0.0001886228,0.00014423205,0.00009450413,0.00037354944,0.00052281126,0.00011094361,0.000107557295],"category_scores_gemma":[0.000027710188,0.00012218636,0.000068044734,0.00087514514,0.000023906387,0.0006147713,0.00008482157,0.00011037997,0.000039748025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068687777,0.000051118142,0.0018142966,0.0000039144447,0.000008426826,0.000001473903,0.00003857133,0.7135161,0.0000031795046,0.020826671,0.003257384,0.26047197],"study_design_scores_gemma":[0.0009182929,0.00004664014,0.0024843141,0.000010104804,0.0000030452852,0.000001969191,0.000008049365,0.9956247,0.000009844346,0.0002291345,0.00049668766,0.00016717133],"about_ca_topic_score_codex":0.00005876942,"about_ca_topic_score_gemma":0.000022422964,"teacher_disagreement_score":0.94034463,"about_ca_system_score_codex":0.0000383635,"about_ca_system_score_gemma":0.000037447164,"threshold_uncertainty_score":0.49826154},"labels":[],"label_agreement":null},{"id":"W2001440284","doi":"10.1109/drcn.2009.5340010","title":"Service overlay network design with reliability constraints","year":2009,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; McGill University","funders":"","keywords":"Computer science; Overlay; Operability; Overlay network; Mathematical optimization; Network planning and design; Lagrange multiplier; Reliability (semiconductor); Key (lock); Context (archaeology); Optimization problem; Distributed computing; Set (abstract data type); Service (business); Reliability engineering; Computer network; Engineering; Mathematics; The Internet","score_opus":0.011025150108369627,"score_gpt":0.2045802999461514,"score_spread":0.19355514983778177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001440284","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00090265385,0.000046308956,0.98009616,0.008320087,0.00013199406,0.00022932571,1.9633963e-7,0.0004530426,0.009820201],"genre_scores_gemma":[0.7799083,0.0000034328434,0.21150786,0.008238393,0.000112054746,0.0000063562507,4.7036698e-7,0.0000032798137,0.00021985607],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880797,0.00010210583,0.00016483261,0.00037164995,0.00021163106,0.00034183176],"domain_scores_gemma":[0.99897563,0.0001807493,0.000052218038,0.0005232588,0.00013858941,0.00012952057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041183992,0.0001375807,0.00015368253,0.000016639273,0.000110480076,0.0001114549,0.0005176113,0.000053507076,0.000084725434],"category_scores_gemma":[0.000010522712,0.00009988393,0.0000291562,0.00045484267,0.000044762426,0.00028186745,0.000028898954,0.000119331235,0.00008317917],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005157427,0.00007406585,0.0001774662,0.0000021962944,0.000014306227,0.000020722266,0.00008495693,0.15459366,0.00001127507,0.12939961,0.0149000855,0.70067006],"study_design_scores_gemma":[0.00121799,0.00049234804,0.0052955006,0.0000386706,0.000015262965,0.00005907094,0.000018257664,0.97334397,0.00004493996,0.012467462,0.0065840725,0.00042245927],"about_ca_topic_score_codex":0.0000061551737,"about_ca_topic_score_gemma":0.000012079382,"teacher_disagreement_score":0.8187503,"about_ca_system_score_codex":0.00002132406,"about_ca_system_score_gemma":0.00011925871,"threshold_uncertainty_score":0.40731484},"labels":[],"label_agreement":null},{"id":"W2002114711","doi":"10.1109/icc.2010.5502246","title":"Robust Explicit Congestion Controller Design for High Bandwidth-Delay Product Network: A H<sub>∞</sub> Approach","year":2010,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Robustness (evolution); Network congestion; Bandwidth (computing); Computer science; Control theory (sociology); Computer network; Control (management); Network packet; Artificial intelligence","score_opus":0.03199494585664116,"score_gpt":0.21568442000526306,"score_spread":0.1836894741486219,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002114711","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010117451,0.00057201186,0.97686815,0.0037557033,0.0027253712,0.0033585045,0.000009183318,0.0011114973,0.0014821276],"genre_scores_gemma":[0.7524653,0.000059350878,0.23954952,0.0010318554,0.0025576553,0.0014496775,0.000045507815,0.00007537606,0.002765736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948003,0.00035642536,0.0008508851,0.00177862,0.0007285097,0.001485226],"domain_scores_gemma":[0.99593806,0.0009672495,0.0004098423,0.0014828702,0.00072465435,0.00047733955],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025102894,0.00073668594,0.0009161414,0.00019970031,0.0006856343,0.000634546,0.0016237327,0.0004172182,0.00007077646],"category_scores_gemma":[0.00025130605,0.00063076284,0.0003125056,0.0007917574,0.00016203315,0.0008632588,0.00023878377,0.0006790498,0.00016452807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005575507,0.0004860127,0.000067673034,0.000040017447,0.00027897191,0.0000080277805,0.00019245445,0.19572245,0.014596417,0.3782634,0.11786978,0.29191723],"study_design_scores_gemma":[0.0059474506,0.00035147328,0.00036318164,0.000039483846,0.00015569385,0.000104457475,0.000008728553,0.92935514,0.0010164399,0.00419382,0.05723418,0.001229964],"about_ca_topic_score_codex":0.00001132005,"about_ca_topic_score_gemma":0.00010945078,"teacher_disagreement_score":0.7423479,"about_ca_system_score_codex":0.00007610564,"about_ca_system_score_gemma":0.0002868932,"threshold_uncertainty_score":0.99961436},"labels":[],"label_agreement":null},{"id":"W2002881589","doi":"10.1109/icc.2010.5502453","title":"An API-RCP Design Using Pole Placement Technique","year":2010,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Router; Bandwidth (computing); Settling time; Transient (computer programming); Protocol (science); Control theory (sociology); Real-time computing; Step response; Computer network; Control (management); Control engineering; Engineering; Operating system","score_opus":0.020603184267206552,"score_gpt":0.2612793932414404,"score_spread":0.24067620897423384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002881589","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003949493,0.000009122058,0.9931845,0.0003178588,0.0003231846,0.00026777954,1.9000245e-7,0.00039774223,0.0015501431],"genre_scores_gemma":[0.6014767,5.4484406e-7,0.3978959,0.00033650664,0.00008603125,0.000020389434,2.451976e-7,0.0000044175345,0.0001792415],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991976,0.000056738616,0.00012472789,0.00025746197,0.00014728602,0.00021619283],"domain_scores_gemma":[0.99927896,0.00004390664,0.000036506866,0.00047755492,0.000049195667,0.000113869915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003989274,0.00009540844,0.0000842331,0.0000519775,0.000115760464,0.0001408279,0.0005606289,0.00006555913,0.00011646328],"category_scores_gemma":[0.0000060565176,0.000081840306,0.000025816142,0.00014836769,0.00002599478,0.0003038668,0.00005465747,0.000151644,0.000033275508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019628387,0.0002140084,0.00016618389,0.0000035070414,0.000019137366,0.000018926856,0.00018738328,0.016023971,0.22153622,0.2700513,0.0023716888,0.48938805],"study_design_scores_gemma":[0.00020498526,0.00008683603,0.000033089043,0.0000039587444,0.0000035907776,0.000025860563,0.000009587612,0.9829308,0.012914375,0.0010690494,0.0025633874,0.00015448291],"about_ca_topic_score_codex":0.000017923081,"about_ca_topic_score_gemma":0.000012899751,"teacher_disagreement_score":0.96690685,"about_ca_system_score_codex":0.000014311039,"about_ca_system_score_gemma":0.00008903052,"threshold_uncertainty_score":0.33373508},"labels":[],"label_agreement":null},{"id":"W2003408990","doi":"10.1002/dac.573","title":"Using TCP rate control for queue input‐output rate matching","year":2002,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Computer science; TCP global synchronization; TCP Friendly Rate Control; Computer network; TCP Westwood plus; TCP acceleration; TCP tuning; CUBIC TCP; Network packet; Zeta-TCP; TCP delayed acknowledgment; Compound TCP; Network congestion; Window (computing); Real-time computing; Operating system","score_opus":0.053926145972896015,"score_gpt":0.2961115202070626,"score_spread":0.24218537423416658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003408990","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009369557,0.0029834625,0.97925663,0.005366768,0.0021825822,0.00024868318,0.0000069705497,0.000046042678,0.0005393033],"genre_scores_gemma":[0.98999614,0.000273825,0.008237157,0.00065287,0.0005003263,0.000017151062,0.0000020286382,0.000012922924,0.0003076064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99781305,0.0006000964,0.0008867777,0.0001393716,0.00039254723,0.00016814237],"domain_scores_gemma":[0.9959269,0.00089490437,0.0011215358,0.00047302258,0.0014884435,0.000095202675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019176726,0.00013673208,0.00029182291,0.00022482344,0.00015603895,0.0005233075,0.002262944,0.0000675751,0.000010230217],"category_scores_gemma":[0.00012630524,0.00012456739,0.00017029334,0.00013516092,0.000037729526,0.0008665192,0.00009840352,0.00022907749,0.000017617214],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021855223,0.00030657696,0.00041814745,0.000016544078,0.0010642994,0.000036595196,0.002478152,0.53476036,0.002087492,0.31285897,0.0071872724,0.13856706],"study_design_scores_gemma":[0.0021793076,0.000047122976,0.00011029511,0.00021952286,0.00002379032,0.00016060293,0.00010743814,0.9617778,0.000030267625,0.0015191465,0.03368332,0.00014136817],"about_ca_topic_score_codex":0.000025576725,"about_ca_topic_score_gemma":0.0000033901601,"teacher_disagreement_score":0.9806266,"about_ca_system_score_codex":0.00016067084,"about_ca_system_score_gemma":0.00006932566,"threshold_uncertainty_score":0.5079711},"labels":[],"label_agreement":null},{"id":"W2003817290","doi":"10.1109/icccn.2012.6289222","title":"Portable and Performant Userspace SCTP Stack","year":2012,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Stream Control Transmission Protocol; Computer science; Linux kernel; Protocol stack; Operating system; Embedded system; Kernel (algebra); Exploit; Throughput; Stack (abstract data type); Computer network; Wireless","score_opus":0.007112228368753177,"score_gpt":0.1948521979935099,"score_spread":0.18773996962475673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003817290","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19130473,0.003096487,0.7514761,0.0038008452,0.0008395968,0.00020203229,5.4010883e-7,0.00045696963,0.048822667],"genre_scores_gemma":[0.9844399,0.000044509543,0.009062776,0.0005480223,0.00010476156,0.000004202457,2.5650348e-7,0.0000029713779,0.0057925824],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994251,0.0000136003155,0.00006938539,0.00011918493,0.00011120472,0.00026150228],"domain_scores_gemma":[0.9995718,0.000027716955,0.000019199415,0.00022058593,0.000022650345,0.00013805965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020930295,0.000064458094,0.000075666416,0.000022160853,0.00007653417,0.00007306521,0.00015820058,0.000024529081,0.000071640134],"category_scores_gemma":[0.0000041801145,0.000050285693,0.000019471507,0.00008720999,0.000016760452,0.00069985783,0.00007545119,0.000054393564,0.00009853427],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005285465,0.000064471795,0.019375712,0.000007691171,0.000033047007,0.0000026449575,0.00068526884,0.00015520153,0.00003953973,0.47344282,0.027241407,0.4789469],"study_design_scores_gemma":[0.00083550724,0.00009721337,0.014731877,0.000012068829,0.000020301044,0.000045577253,0.00020665371,0.47394353,0.00024613467,0.00027488297,0.5091714,0.00041485738],"about_ca_topic_score_codex":0.000009642491,"about_ca_topic_score_gemma":0.0000036016115,"teacher_disagreement_score":0.79313517,"about_ca_system_score_codex":0.00000723324,"about_ca_system_score_gemma":0.000017475324,"threshold_uncertainty_score":0.2050591},"labels":[],"label_agreement":null},{"id":"W2004151710","doi":"10.1002/net.20090","title":"Distributed delay constrained multicast routing algorithm with efficient fault recovery","year":2005,"lang":"en","type":"article","venue":"Networks","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Multicast; Computer science; Xcast; Pragmatic General Multicast; Protocol Independent Multicast; Source-specific multicast; Distance Vector Multicast Routing Protocol; Computer network; Distributed computing; Inter-domain; IP multicast; Algorithm; Reliable multicast; Tree (set theory); Mathematics","score_opus":0.005435958961519562,"score_gpt":0.2012463873339291,"score_spread":0.19581042837240956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004151710","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043729064,0.0002429479,0.99259657,0.000977979,0.00038574505,0.0002517393,0.000009299242,0.00044099713,0.0007218041],"genre_scores_gemma":[0.9155668,0.000012311382,0.08301674,0.000585953,0.00063349603,0.000025663921,0.000024170598,0.000015300475,0.00011953375],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815434,0.0000850736,0.00032665057,0.00051282835,0.00029633116,0.00062477094],"domain_scores_gemma":[0.99880576,0.00026094267,0.00014032154,0.00045870658,0.00012761861,0.00020662438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031679406,0.00024284291,0.00025109894,0.00004600264,0.0002377231,0.00021959888,0.00051777327,0.00012958956,0.000025355768],"category_scores_gemma":[0.000020328487,0.00020037487,0.000082037164,0.00046402702,0.00009828324,0.0001922305,0.000104041705,0.00034086406,0.000045109995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011978596,0.000041913376,0.00003511202,5.6675117e-7,0.000022020005,0.000021617952,0.000040517483,0.47493923,0.0000010138358,0.001499857,0.0004255704,0.5229606],"study_design_scores_gemma":[0.0011549152,0.00009817115,0.0002515612,0.000047216363,0.00001911173,0.00008706629,0.000017439936,0.993639,0.000006453784,0.000011646307,0.0043936884,0.00027374484],"about_ca_topic_score_codex":0.000008864007,"about_ca_topic_score_gemma":0.000022587255,"teacher_disagreement_score":0.9111939,"about_ca_system_score_codex":0.00008439165,"about_ca_system_score_gemma":0.0000689291,"threshold_uncertainty_score":0.817105},"labels":[],"label_agreement":null},{"id":"W2004350736","doi":"10.1186/1687-1499-2012-18","title":"Resource reservation for mobile hotspots in vehicular environments with cellular/WLAN interworking","year":2012,"lang":"en","type":"article","venue":"EURASIP Journal on Wireless Communications and Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; New Brunswick Innovation Foundation","keywords":"Computer science; Computer network; Packet loss; Quality of service; Network packet; Cellular network; Wireless network; Real-time computing; Wireless; Telecommunications","score_opus":0.027991768439609054,"score_gpt":0.2509166583972847,"score_spread":0.22292488995767568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004350736","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48081136,0.011058603,0.50430864,0.0022364294,0.00036664872,0.0006244557,9.985023e-7,0.00006766462,0.0005252327],"genre_scores_gemma":[0.9916099,0.0014600162,0.0060423287,0.00035825794,0.00035696733,0.00008813516,0.000006431636,0.000019957126,0.000058030408],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985145,0.00031488144,0.00035845544,0.00019601826,0.0002114129,0.00040473088],"domain_scores_gemma":[0.99832773,0.00050078024,0.0002650894,0.0007307167,0.000029370229,0.00014633346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011481477,0.00016470443,0.00020246352,0.00014449183,0.00056508346,0.00020835188,0.00087186514,0.000069201575,0.0000014717385],"category_scores_gemma":[0.000005745307,0.00014102556,0.00005105961,0.00030858206,0.00006760227,0.00042905615,0.00020467109,0.00049608096,0.000002210106],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012374186,0.00025801256,0.02923295,0.000008135511,0.00005293947,0.00000701497,0.0016425445,0.003402411,0.00032139654,0.00905257,0.00013518699,0.9557631],"study_design_scores_gemma":[0.0018284017,0.0004696579,0.0076238452,0.00078969373,0.000030032636,0.000092929135,0.00028248125,0.72879124,0.00005247302,0.00028739384,0.25931534,0.000436502],"about_ca_topic_score_codex":0.000002058409,"about_ca_topic_score_gemma":0.000011323651,"teacher_disagreement_score":0.9553266,"about_ca_system_score_codex":0.000085094005,"about_ca_system_score_gemma":0.000019818586,"threshold_uncertainty_score":0.5750856},"labels":[],"label_agreement":null},{"id":"W2005595899","doi":"10.1109/ccece.2006.277658","title":"Service Overlay Network Resource Adaptations Based on an Economic Model","year":2006,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Quality of service; Overlay network; Admission control; The Internet; Profit (economics); Voice over IP; Overlay; Bandwidth (computing); Revenue; Distributed computing; World Wide Web","score_opus":0.010753997926114594,"score_gpt":0.20599534302639674,"score_spread":0.19524134510028215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005595899","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00378034,0.000021288195,0.9411413,0.0043740105,0.00013285632,0.000117890675,0.000002434323,0.00041874507,0.050011143],"genre_scores_gemma":[0.9439449,6.182724e-7,0.04617361,0.008071866,0.00036767384,0.00002183242,0.000013955605,0.0000110007195,0.0013945777],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990039,0.000059450074,0.00018427905,0.00035600623,0.00012672057,0.0002696724],"domain_scores_gemma":[0.9991488,0.000120790195,0.000055101784,0.0005510463,0.000034341465,0.00008990847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000176184,0.00012533947,0.000109893015,0.00004336104,0.00016947776,0.0001457201,0.00051041815,0.000053067444,0.000045451772],"category_scores_gemma":[0.000001416699,0.00012008763,0.000044492317,0.0001677057,0.000011697827,0.00027154625,0.00003246285,0.00008785284,0.00015185328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006992298,0.000027737646,0.000019236899,4.49831e-7,0.0000017866504,8.1679264e-7,0.00001073695,0.7667459,0.000001931005,0.19895513,0.015036729,0.019192515],"study_design_scores_gemma":[0.000378831,0.0000427447,0.00036068127,0.000005553218,0.0000042876877,8.167329e-7,0.0000052318615,0.98452926,0.0000031622699,0.0030891858,0.011428735,0.00015149289],"about_ca_topic_score_codex":0.00013125186,"about_ca_topic_score_gemma":0.0009940154,"teacher_disagreement_score":0.9401645,"about_ca_system_score_codex":0.000045936107,"about_ca_system_score_gemma":0.00011827118,"threshold_uncertainty_score":0.48970315},"labels":[],"label_agreement":null},{"id":"W2006890568","doi":"10.1002/nem.407","title":"Weighted proportional window control of TCP traffic","year":2001,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Bottleneck; Computer science; Window (computing); TCP global synchronization; TCP Friendly Rate Control; Computer network; TCP acceleration; H-TCP; TCP tuning; TCP Westwood plus; Connection (principal bundle); Service (business); Control (management); Network congestion; Operating system; Mathematics; Artificial intelligence; Embedded system","score_opus":0.006698769925220392,"score_gpt":0.22511368744269444,"score_spread":0.21841491751747405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006890568","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020727254,0.0007151797,0.9656246,0.0059226234,0.0030578044,0.00021699576,0.0000017282728,0.00004466765,0.0036891785],"genre_scores_gemma":[0.9858384,0.0003330587,0.0114144,0.00071852014,0.0011723927,0.0000066734965,0.000002201199,0.00000791746,0.0005064141],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977033,0.000081810984,0.00079870643,0.00017932634,0.0010058631,0.00023097577],"domain_scores_gemma":[0.99821717,0.000097930104,0.0007530212,0.00019562927,0.00063677016,0.00009950409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064013054,0.00013950653,0.00025683912,0.00021472316,0.000046341214,0.000085050626,0.0013437846,0.000041312807,0.00010993984],"category_scores_gemma":[0.0000100804355,0.00011927629,0.00020629348,0.00028892778,0.000048650512,0.00036301694,0.00010106805,0.00016027586,0.000015591257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029426577,0.0002694973,0.0015851724,0.0000056861945,0.0009462807,0.00059283985,0.000050028477,0.1968472,0.000010314007,0.10029208,0.009505975,0.68960065],"study_design_scores_gemma":[0.010287451,0.0006059285,0.022036206,0.00044802472,0.00020691357,0.0009847282,0.00006103817,0.6690345,0.000018578225,0.013183772,0.2826252,0.0005076716],"about_ca_topic_score_codex":7.8548896e-7,"about_ca_topic_score_gemma":0.0000018741069,"teacher_disagreement_score":0.9651112,"about_ca_system_score_codex":0.00007230308,"about_ca_system_score_gemma":0.00006040082,"threshold_uncertainty_score":0.48639458},"labels":[],"label_agreement":null},{"id":"W2007321238","doi":"10.1145/500141.500165","title":"Server-based smoothing of variable bit-rate streams","year":2001,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; STREAMS; Smoothing; Variable (mathematics); Bit rate; Variable bitrate; Real-time computing; Parallel computing; Operating system; Mathematics; Computer vision","score_opus":0.01023808738771065,"score_gpt":0.20663191651459326,"score_spread":0.1963938291268826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007321238","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050053097,0.00006272697,0.93309987,0.0009946333,0.00022382205,0.00007848667,4.935481e-7,0.00021973494,0.015267121],"genre_scores_gemma":[0.9678625,0.0000088119905,0.02916309,0.0009956193,0.00004924473,0.000005637604,0.0000011374455,0.00000490994,0.0019090326],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992017,0.000055179527,0.00018506843,0.00021107467,0.00014775693,0.00019919673],"domain_scores_gemma":[0.999265,0.00013090344,0.000067342255,0.000387135,0.00008284368,0.00006675766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031443549,0.00008726984,0.00013028213,0.000049769573,0.000054087224,0.000058445123,0.0004625544,0.000043194268,0.00016246713],"category_scores_gemma":[0.000015159615,0.000074157244,0.000043300297,0.00040911074,0.000019761535,0.00023819812,0.000045981236,0.000066997534,0.000032752254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019169109,0.00014048659,0.0030787233,0.000012158852,0.000027173512,0.00001891588,0.00005633879,0.04469115,0.0006926573,0.37610662,0.0013216318,0.573835],"study_design_scores_gemma":[0.0005799094,0.00006277505,0.0004184485,0.00002273055,0.0000060341326,0.0000028552502,0.000007900314,0.98902744,0.0006298789,0.0017347189,0.0073884283,0.00011890462],"about_ca_topic_score_codex":0.0001281092,"about_ca_topic_score_gemma":0.000023047087,"teacher_disagreement_score":0.94433624,"about_ca_system_score_codex":0.00001238664,"about_ca_system_score_gemma":0.00009335333,"threshold_uncertainty_score":0.30240446},"labels":[],"label_agreement":null},{"id":"W2008586848","doi":"10.1145/376656.376808","title":"Providing soft real-time QoS guarantees for Java threads","year":2001,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Java; Operating system; Thread (computing); Quality of service; Virtual machine; Scheduling (production processes); Java concurrency; Overhead (engineering); Distributed computing; Real time Java; Computer network","score_opus":0.013184821001935076,"score_gpt":0.23708853511995887,"score_spread":0.2239037141180238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008586848","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051529324,0.000089189125,0.9706498,0.0030887118,0.00038754274,0.00041116404,8.6130854e-7,0.0006951553,0.019524667],"genre_scores_gemma":[0.87415063,0.00010343791,0.078338124,0.0014350958,0.0010798485,0.0001897229,0.00000537754,0.000027252903,0.04467052],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989225,0.000024315947,0.00019460093,0.0003460673,0.00016279968,0.00034970086],"domain_scores_gemma":[0.99919826,0.00022436155,0.000053832366,0.0003520256,0.000093045994,0.00007846404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025999206,0.00012935587,0.00016221593,0.000052215502,0.00015432635,0.00015507484,0.00055242813,0.000055858753,0.00008020507],"category_scores_gemma":[0.000025927075,0.00010594764,0.00008624177,0.0002038319,0.000024350287,0.0003438913,0.00006261362,0.00005279019,0.00018029897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033423366,0.000058538055,0.00026586905,0.0000072231965,0.000026545975,0.000010753027,0.00016356661,0.00046828695,0.0010486384,0.14989477,0.028056026,0.8199664],"study_design_scores_gemma":[0.00089013326,0.00015513854,0.0001592307,0.00002162875,0.000012493545,0.000030815147,0.00001834172,0.9371451,0.00027062822,0.0034652054,0.05756277,0.0002684857],"about_ca_topic_score_codex":0.000019007493,"about_ca_topic_score_gemma":0.000014864378,"teacher_disagreement_score":0.93667686,"about_ca_system_score_codex":0.000020018615,"about_ca_system_score_gemma":0.000063184365,"threshold_uncertainty_score":0.43204194},"labels":[],"label_agreement":null},{"id":"W2008841761","doi":"10.1002/nem.479","title":"Active queue management with flow proportional buffering","year":2003,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Active queue management; Computer science; Queue; Computer network; Network packet; Network congestion; Multilevel queue; Queue management system; Real-time computing","score_opus":0.005079057059864763,"score_gpt":0.20866164521507025,"score_spread":0.2035825881552055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008841761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001348346,0.00015817951,0.9629309,0.0015765771,0.002053867,0.00022297028,6.6250476e-7,0.000044453664,0.03166401],"genre_scores_gemma":[0.8096173,0.00026397774,0.18727598,0.0008156841,0.0006314429,0.00002631521,0.0000022344302,0.000014740601,0.0013523371],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99801767,0.00007623919,0.00043618734,0.00023825243,0.00096235285,0.0002693162],"domain_scores_gemma":[0.99890625,0.000042316282,0.0003876451,0.00021015329,0.00035008526,0.00010352145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048640376,0.00016494482,0.00017504446,0.0001762445,0.00008165912,0.00018450979,0.0009789142,0.000027623664,0.000067775574],"category_scores_gemma":[0.0000050512594,0.0001322959,0.00010424244,0.00025071774,0.00003161005,0.00046667637,0.00013709358,0.0001747701,0.00001871615],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012763898,0.00011697894,0.00021874617,0.0000074127215,0.0010583487,0.0009377634,0.00005904135,0.17843473,8.42735e-7,0.38203225,0.003836064,0.4331702],"study_design_scores_gemma":[0.010049379,0.0008137306,0.017679183,0.001142301,0.00035656473,0.0017922526,0.00050265895,0.18194549,0.000093359646,0.04410638,0.74033946,0.0011792291],"about_ca_topic_score_codex":6.3909255e-7,"about_ca_topic_score_gemma":0.0000022507961,"teacher_disagreement_score":0.80826896,"about_ca_system_score_codex":0.00017935484,"about_ca_system_score_gemma":0.000042093747,"threshold_uncertainty_score":0.53948706},"labels":[],"label_agreement":null},{"id":"W2009906984","doi":"10.1049/ip-com:20040400","title":"AQM controller design for IP routers supporting TCP flows based on pole placement","year":2004,"lang":"en","type":"article","venue":"IEE Proceedings - Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Active queue management; Control theory (sociology); Controller (irrigation); Full state feedback; Transient (computer programming); Queue; Computer science; Control (management); Network congestion; Computer network","score_opus":0.03936738592359705,"score_gpt":0.28290466217227084,"score_spread":0.24353727624867377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009906984","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00089877413,0.00010758267,0.9692333,0.025803372,0.00016047696,0.0012537003,0.000005850393,0.00041247593,0.002124519],"genre_scores_gemma":[0.791365,0.000013973153,0.20533386,0.0022726995,0.000068336034,0.00078488636,0.000007155554,0.000018507106,0.00013558846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998397,0.00003432664,0.00045482232,0.0003909577,0.00027459138,0.000448285],"domain_scores_gemma":[0.99803996,0.0004492669,0.00027308098,0.0007596453,0.0003244883,0.0001535424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084684376,0.0002164079,0.00024481074,0.00014676836,0.0006789545,0.0003184617,0.0021141774,0.00008303583,0.0000061036785],"category_scores_gemma":[0.00015655508,0.00021230918,0.0001342369,0.00034680212,0.00007002469,0.0003719571,0.00017640316,0.00023262772,0.00004031102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031446692,0.0011031732,0.00016738744,0.000046521425,0.00016604684,0.0000015238367,0.0028006656,0.1734383,0.0018845453,0.66328025,0.009536112,0.14726098],"study_design_scores_gemma":[0.0033972305,0.00028834178,0.000056359713,0.00008686067,0.00003276221,0.0000031140817,0.00013348144,0.9796532,0.0003673063,0.004820872,0.010888951,0.00027152503],"about_ca_topic_score_codex":0.0000105224,"about_ca_topic_score_gemma":0.0000067095825,"teacher_disagreement_score":0.80621487,"about_ca_system_score_codex":0.00016728436,"about_ca_system_score_gemma":0.00020327976,"threshold_uncertainty_score":0.8657717},"labels":[],"label_agreement":null},{"id":"W2010067126","doi":"10.1109/infcom.2012.6195738","title":"Analysis of backward congestion notification with delay for enhanced ethernet networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"National Natural Science Foundation of China","keywords":"Computer network; Computer science; Queue; Active queue management; Network congestion; Network packet; Buffer overflow; Ethernet; Packet loss; Upper and lower bounds; Queueing theory; Burstiness; Real-time computing; Mathematics","score_opus":0.012670763885354592,"score_gpt":0.23612509045845592,"score_spread":0.22345432657310133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010067126","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029808395,0.00014694905,0.968666,0.00023937246,0.00015037316,0.00022702008,0.0000015475255,0.00009129974,0.0006690418],"genre_scores_gemma":[0.9745574,0.000010917647,0.02477418,0.00014698133,0.00008672687,0.00006098821,0.000019430025,0.000005602953,0.00033774783],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916494,0.000048273443,0.00020924646,0.00020500939,0.00014138814,0.00023112257],"domain_scores_gemma":[0.9990126,0.00023691602,0.00014980113,0.0003416793,0.00017779067,0.00008123958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003833438,0.00009735395,0.0002096726,0.00010638222,0.000045796318,0.000030399759,0.00025191958,0.00006632264,0.00002998273],"category_scores_gemma":[0.000012839726,0.00007415144,0.0000846684,0.0007286904,0.000031889304,0.0002861715,0.00001793175,0.00005046531,0.000005527884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010216437,0.00013396902,0.0059560467,0.0000071084555,0.0007948221,1.2537016e-7,0.00044841482,0.35686547,0.0003595054,0.112967804,0.00044646798,0.5219181],"study_design_scores_gemma":[0.0003616536,0.00007840582,0.009897014,0.0000058442765,0.0003241924,6.2681306e-7,0.00002019891,0.98793983,0.0005220947,0.000029707222,0.0006972555,0.00012314439],"about_ca_topic_score_codex":0.000009648853,"about_ca_topic_score_gemma":0.000048668673,"teacher_disagreement_score":0.94474906,"about_ca_system_score_codex":0.00002004721,"about_ca_system_score_gemma":0.000021371237,"threshold_uncertainty_score":0.30238077},"labels":[],"label_agreement":null},{"id":"W2010671462","doi":"10.5539/ass.v6n11p273","title":"Research on the Fair Assignment of Router’s Bandwidth","year":2010,"lang":"en","type":"article","venue":"Asian Social Science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Router; Throughput; Weighted fair queueing; Computer network; Packet loss; Stateless protocol; Bandwidth (computing); Active queue management; Network packet; TCP Vegas; Bandwidth allocation; Fair queuing; Network congestion; Zeta-TCP; Quality of service; Wireless; Telecommunications","score_opus":0.03371133878655626,"score_gpt":0.3227930517137886,"score_spread":0.28908171292723234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010671462","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056541607,0.000012744529,0.07651468,0.06403196,0.001988052,0.0005533294,0.0000026205696,0.00015095959,0.80020404],"genre_scores_gemma":[0.99860024,7.431351e-7,0.00055554643,0.00034588962,0.00022529399,0.000017849168,7.2090124e-8,0.0000025977524,0.00025174595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99790204,0.00012490102,0.00013377264,0.00031675852,0.0011196954,0.00040285639],"domain_scores_gemma":[0.99902874,0.00022032033,0.000059352533,0.0004123619,0.00018692964,0.00009230876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030025442,0.00006876476,0.00009102993,0.000084625586,0.00087396643,0.00020070812,0.002120545,0.000046463923,0.000039935978],"category_scores_gemma":[0.00008896643,0.00004507736,0.000043999247,0.0012803418,0.0010905166,0.00024475198,0.00022812205,0.0004059916,0.00005906022],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016199981,0.00002170906,0.000029360233,3.615069e-7,0.0000013003202,8.720472e-7,0.00052307785,9.974384e-7,0.0012262223,0.62375134,0.001211664,0.37323147],"study_design_scores_gemma":[0.0032158066,0.0021407644,0.4286712,0.00015932342,0.00003026035,0.000032230928,0.008424582,0.061726723,0.036894854,0.24421324,0.21242079,0.002070222],"about_ca_topic_score_codex":0.000014025419,"about_ca_topic_score_gemma":0.000015419666,"teacher_disagreement_score":0.9420587,"about_ca_system_score_codex":0.00003895815,"about_ca_system_score_gemma":0.0002925063,"threshold_uncertainty_score":0.67219317},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.033193816146021,"score_gpt":0.3043915626423954,"score_spread":0.2711977464963744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011112929","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013569376,0.079911254,0.7683777,0.13457894,0.00022485302,0.001396611,0.000013348484,0.0005060727,0.0014217941],"genre_scores_gemma":[0.9332591,0.013209106,0.038743824,0.014557037,0.0000535237,0.00006996926,0.00004146635,0.000009596067,0.000056343186],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972531,0.001234371,0.00067216693,0.0003204686,0.00033257256,0.00018731554],"domain_scores_gemma":[0.9918587,0.0010559127,0.00040636852,0.0063654105,0.0002235144,0.00009004342],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0014613541,0.0001852236,0.0005052069,0.00016444302,0.0001304629,0.00011541436,0.007224332,0.0000515562,0.00013620126],"category_scores_gemma":[0.00006791228,0.0001315683,0.00027420183,0.0011541967,0.00008212758,0.00031093613,0.0008516296,0.00030688898,0.00007735987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040099094,0.00027285647,0.00096973206,0.00002980795,0.00026194996,6.1475123e-7,0.0002867932,0.0022983686,0.0000019980082,0.096132934,0.023663096,0.87607783],"study_design_scores_gemma":[0.0002375042,0.00015408614,0.008516914,0.0009700491,0.00044638762,0.000004222372,0.0000076033207,0.90782666,0.00001868405,0.0002653204,0.08129077,0.00026182664],"about_ca_topic_score_codex":0.00003254076,"about_ca_topic_score_gemma":0.000077632176,"teacher_disagreement_score":0.9196898,"about_ca_system_score_codex":0.000038589696,"about_ca_system_score_gemma":0.000030842417,"threshold_uncertainty_score":0.9981471},"labels":[],"label_agreement":null},{"id":"W2011854146","doi":"10.1016/j.comcom.2006.03.003","title":"An efficient parallel optimization algorithm for the Token Bucket control mechanism","year":2006,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Token bucket; Security token; Leaky bucket; Quality of service; Throughput; Algorithm; Distributed computing; Computer network","score_opus":0.013492306842777448,"score_gpt":0.24038065960815022,"score_spread":0.22688835276537278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011854146","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016105267,0.0006011277,0.9911406,0.0064601693,0.00041348778,0.00083205954,0.000015360067,0.00036903535,0.00015203426],"genre_scores_gemma":[0.2725925,0.000036495894,0.72566545,0.0009741561,0.00028091195,0.000335837,0.000051403335,0.000012692749,0.000050531267],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868697,0.0002213589,0.0003256026,0.00030788148,0.00017861383,0.0002795454],"domain_scores_gemma":[0.9962176,0.000748793,0.00014098924,0.00255936,0.0002611026,0.000072173105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043759614,0.00016380247,0.00016844361,0.00006303002,0.00086656405,0.00035546834,0.0033458425,0.00006724749,0.0000052907258],"category_scores_gemma":[0.000005064645,0.0001313858,0.00010749872,0.00025577532,0.00009197514,0.00020849441,0.00027152372,0.00015090873,0.000013926706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016620243,0.00011323811,0.0000022983227,6.4869727e-7,0.00001546922,1.9206614e-7,0.00004998529,0.5618439,0.0000021188268,0.23317996,0.00089867105,0.2038919],"study_design_scores_gemma":[0.0010087781,0.00007027535,0.00011507592,0.0000066895595,0.00002893511,0.0000066730454,0.000008520269,0.98814774,0.0000026951284,0.003110569,0.007329859,0.00016419473],"about_ca_topic_score_codex":0.000029108078,"about_ca_topic_score_gemma":0.000015854746,"teacher_disagreement_score":0.42630386,"about_ca_system_score_codex":0.000037460144,"about_ca_system_score_gemma":0.0000631164,"threshold_uncertainty_score":0.66649973},"labels":[],"label_agreement":null},{"id":"W2012922054","doi":"10.1002/nem.696","title":"A network management tool for resource‐partition based layer 1 virtual private networks","year":2008,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Communications Research Centre Canada","funders":"Dalhousie University; Canarie","keywords":"Computer science; Private network; Partition (number theory); Computer network; Database transaction; Application layer; Network element; Distributed computing; Database; Operating system","score_opus":0.01589594882709504,"score_gpt":0.2341048385047788,"score_spread":0.21820888967768376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012922054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017219092,0.0003785536,0.988571,0.0027536107,0.003632309,0.0005754148,0.0000021238004,0.000105262625,0.0022598172],"genre_scores_gemma":[0.868223,0.0004279471,0.11744058,0.0068055866,0.0054287277,0.00012412472,0.00002076714,0.00003826118,0.0014909685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99687177,0.00014555661,0.00096144073,0.0004053794,0.0010126014,0.0006032237],"domain_scores_gemma":[0.99808025,0.00028168227,0.0007012106,0.00042105833,0.00036817262,0.00014763868],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011898223,0.00028553818,0.00034272857,0.00021615869,0.0002770982,0.00022516181,0.0018167032,0.00008448798,0.00004315928],"category_scores_gemma":[0.000015445208,0.00027095125,0.00033612002,0.00041627706,0.00006145948,0.0004546123,0.00034426033,0.0002518839,0.000018766246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003228292,0.000105360625,0.00034314292,0.000006554268,0.00047331862,0.00036935537,0.000019452544,0.6524343,4.316206e-7,0.11017088,0.1277683,0.10798611],"study_design_scores_gemma":[0.002881461,0.00031590014,0.0027849053,0.00031967586,0.00010369878,0.0001048309,0.0000122310075,0.60535085,0.0000021968485,0.0043863556,0.38339642,0.0003414849],"about_ca_topic_score_codex":5.0084833e-7,"about_ca_topic_score_gemma":0.0000014442211,"teacher_disagreement_score":0.8711304,"about_ca_system_score_codex":0.00018058206,"about_ca_system_score_gemma":0.000035571844,"threshold_uncertainty_score":0.99997425},"labels":[],"label_agreement":null},{"id":"W2012936414","doi":"10.5555/1251086.1251105","title":"Predicting short-transfer latency from TCP arcana: a trace-based validation","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Latency (audio); Server; Computer network; TCP hole punching; Web server; TCP global synchronization; Real-time computing; Distributed computing; The Internet; Transmission Control Protocol; Operating system; Telecommunications","score_opus":0.014001527888224693,"score_gpt":0.21650724322085826,"score_spread":0.20250571533263356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012936414","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18262576,0.00011986898,0.8093706,0.004039523,0.00020312046,0.00014061324,0.0000030382732,0.00046416366,0.003033312],"genre_scores_gemma":[0.98110443,0.000006174414,0.01740716,0.00075075106,0.00035481964,0.0000227461,0.000007984682,0.000008112421,0.0003378358],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880105,0.000060189304,0.0002571543,0.00036353723,0.00026681102,0.00025123602],"domain_scores_gemma":[0.9993338,0.00014007115,0.000018381284,0.00032982367,0.00006307424,0.000114871546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018176218,0.00013040325,0.00013103866,0.00005641736,0.000106187435,0.00013192755,0.0004152144,0.0000694978,0.0002442701],"category_scores_gemma":[0.00001042412,0.00011656326,0.00007257579,0.00020360928,0.00001872487,0.00043174712,0.000019339945,0.00013121616,0.0000870161],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012100066,0.00008444543,0.0061165174,0.0000022239094,0.000025790972,0.000005697426,0.0002547648,0.022296917,0.0004376185,0.011256538,0.00066834834,0.95883906],"study_design_scores_gemma":[0.0005208938,0.000036155023,0.0031178412,0.00001585091,0.000015963267,0.000001328627,0.000010660574,0.98856705,0.0020053922,0.00021214876,0.0053273933,0.00016934786],"about_ca_topic_score_codex":0.00008532181,"about_ca_topic_score_gemma":0.0002475931,"teacher_disagreement_score":0.9662701,"about_ca_system_score_codex":0.000039419618,"about_ca_system_score_gemma":0.0000840523,"threshold_uncertainty_score":0.47533116},"labels":[],"label_agreement":null},{"id":"W2012968266","doi":"10.1109/aina.2010.88","title":"Performance Analysis of VCP Controller on DCCP Traffic","year":2010,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Bottleneck; Explicit Congestion Notification; Network congestion; Packet loss; Network packet; Queue; Transmission Control Protocol; Bandwidth (computing); TCP Friendly Rate Control; Throughput; Internet protocol suite; Real-time computing; The Internet; Embedded system; Operating system; Wireless","score_opus":0.0061675706002178666,"score_gpt":0.20762871471420774,"score_spread":0.20146114411398988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012968266","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9397394,0.000014223513,0.045992527,0.0006717222,0.00036182298,0.000106547785,0.0000010969613,0.00015985497,0.012952786],"genre_scores_gemma":[0.99640405,0.0000065848967,0.0019607795,0.00043336014,0.000054952772,0.000009172488,0.0000010343388,0.0000033394563,0.0011267228],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990936,0.000025011106,0.00022067026,0.00024844255,0.00022886448,0.00018341905],"domain_scores_gemma":[0.99917495,0.00015829458,0.000079798534,0.0004234884,0.00008885592,0.00007459903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025148698,0.00010200424,0.00026680325,0.00022437745,0.00005745354,0.000037032354,0.0005308617,0.00005965475,0.00018306753],"category_scores_gemma":[0.000015377147,0.00007704873,0.00015412938,0.0008283422,0.000041590745,0.00013755674,0.000028927307,0.00016012976,0.00006169958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030779775,0.00011025599,0.0012946414,0.0000023202585,0.0003512262,0.0000012632141,0.00010196082,0.06151027,0.0004762256,0.062874235,0.00069541467,0.8725514],"study_design_scores_gemma":[0.00049709063,0.00008218533,0.012501473,0.0000022249787,0.00009332608,7.352451e-7,0.000003896938,0.9849267,0.00011717057,0.000012651576,0.001667646,0.000094889365],"about_ca_topic_score_codex":0.0000030722454,"about_ca_topic_score_gemma":0.00004097275,"teacher_disagreement_score":0.92341644,"about_ca_system_score_codex":0.000005094086,"about_ca_system_score_gemma":0.000029774843,"threshold_uncertainty_score":0.3141956},"labels":[],"label_agreement":null},{"id":"W2013072857","doi":"10.1016/j.peva.2004.07.017","title":"Network traffic behaviour in switched Ethernet systems","year":2004,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; University of Toronto","keywords":"Computer network; Computer science; Ethernet; Carrier Ethernet","score_opus":0.02417788076314523,"score_gpt":0.25855830999617607,"score_spread":0.23438042923303085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013072857","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95424944,0.00083370385,0.042323593,0.00057528255,0.0009693074,0.00054845324,2.5385347e-7,0.0001580068,0.00034194172],"genre_scores_gemma":[0.99837756,0.00003370594,0.0009136986,0.0001287497,0.00028906154,0.0001870914,0.000007489445,0.0000086869795,0.00005394483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984187,0.00008401875,0.00031700204,0.00030721835,0.0005424558,0.00033059248],"domain_scores_gemma":[0.99934137,0.00003501178,0.00011089205,0.000327739,0.00012932807,0.000055643995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001831118,0.00013203856,0.00015607692,0.00008344522,0.00009630813,0.00010761858,0.00037613724,0.00008450811,0.000012731184],"category_scores_gemma":[0.000017242397,0.00012674535,0.000030607884,0.00051653385,0.000017282622,0.0005361866,0.00003208044,0.0001707669,0.0001276297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074631807,0.00003165047,0.0022671204,0.000003911257,0.0000030362567,0.0000010772754,0.0003592632,0.82088447,0.000008559467,0.0014923938,0.000087306944,0.17485373],"study_design_scores_gemma":[0.0013822202,0.0000775497,0.038420178,0.00007557972,0.000011760312,0.000007862862,0.000023405408,0.959514,0.000013295272,0.00022192857,0.000099163444,0.00015304906],"about_ca_topic_score_codex":0.00002147887,"about_ca_topic_score_gemma":0.000056177934,"teacher_disagreement_score":0.17470068,"about_ca_system_score_codex":0.00021060862,"about_ca_system_score_gemma":0.00021972424,"threshold_uncertainty_score":0.5168525},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.018892686491035097,"score_gpt":0.22881789716586323,"score_spread":0.20992521067482814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013174072","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01043478,0.00043657256,0.98353326,0.0012918208,0.0024745583,0.00023062502,0.0000015223626,0.0003624087,0.0012344723],"genre_scores_gemma":[0.9857188,0.0001344662,0.012386208,0.0011472282,0.00022490743,0.000042190495,5.575026e-7,0.000018966166,0.00032671535],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830526,0.00017539882,0.00026501238,0.0005448545,0.0002602327,0.0004492336],"domain_scores_gemma":[0.998639,0.000295177,0.00007765984,0.0007277308,0.000083913925,0.00017654666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037512698,0.00023574149,0.00022912832,0.000099081895,0.000465466,0.00021340993,0.0005491894,0.00012776352,0.000026234808],"category_scores_gemma":[0.0000065470845,0.00024140564,0.00007518913,0.00071529794,0.00003991565,0.00032635074,0.000008124863,0.0003756019,0.00004186707],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001850973,0.00010173283,0.0001478298,0.000016704313,0.000049527756,0.000018063307,0.00037474956,0.02570246,0.000059181726,0.0070320466,0.00013880919,0.96634036],"study_design_scores_gemma":[0.004186928,0.00033521475,0.0013145424,0.00041226845,0.00017836713,0.0003584476,0.00022868958,0.7753425,0.0011947298,0.015764292,0.19877858,0.0019053938],"about_ca_topic_score_codex":0.000018045894,"about_ca_topic_score_gemma":0.00013391631,"teacher_disagreement_score":0.975284,"about_ca_system_score_codex":0.000046472833,"about_ca_system_score_gemma":0.00007337859,"threshold_uncertainty_score":0.9844236},"labels":[],"label_agreement":null},{"id":"W2014317164","doi":"10.1002/sat.694","title":"An architecture for Internet service via broadband satellite networks","year":2001,"lang":"en","type":"article","venue":"International Journal of Satellite Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lockheed Martin (Canada)","funders":"Cisco Systems","keywords":"Computer network; Broadband; Computer science; Communications satellite; The Internet; Software deployment; Architecture; Bandwidth (computing); Broadband networks; Transmission Control Protocol; Satellite; Telecommunications; Internet Protocol; Engineering; Operating system; Network packet","score_opus":0.02296790142183049,"score_gpt":0.29150750181047735,"score_spread":0.2685396003886469,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014317164","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016132061,0.009253944,0.96787214,0.0191717,0.0009462502,0.00018290493,0.0000046793975,0.000069019385,0.0008861639],"genre_scores_gemma":[0.8990052,0.012770649,0.08441377,0.0029277687,0.0006448476,0.000019527402,0.00004691202,0.00002003935,0.00015133366],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983204,0.00018545729,0.0006936845,0.00020477668,0.00036132394,0.00023434825],"domain_scores_gemma":[0.99628264,0.0005292469,0.0005149352,0.0009899385,0.0014983282,0.00018492842],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0005929672,0.00017531248,0.00022849717,0.00023565064,0.00011675858,0.0003522838,0.0055407397,0.00009437894,0.000018152663],"category_scores_gemma":[0.000036064102,0.00016036758,0.00017549156,0.00032029572,0.000076613156,0.0007398475,0.0002554147,0.0003898092,0.000010804662],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011960959,0.00024560804,0.0006360439,0.0000023619016,0.00017066396,0.000012098402,0.0006680067,0.004820162,0.00014550284,0.02697787,0.00013326602,0.9660688],"study_design_scores_gemma":[0.0011778324,0.00016871917,0.0013967803,0.000092595685,0.00003290307,0.0005720889,0.000044341698,0.42325476,0.000032658136,0.004279792,0.5687371,0.00021046824],"about_ca_topic_score_codex":0.000018787272,"about_ca_topic_score_gemma":0.00019386389,"teacher_disagreement_score":0.96585834,"about_ca_system_score_codex":0.00007750214,"about_ca_system_score_gemma":0.000084801635,"threshold_uncertainty_score":0.9998398},"labels":[],"label_agreement":null},{"id":"W2014983425","doi":"10.1109/netwks.2010.5624942","title":"Kalman filter based capacity adaptation for network profit maximization","year":2010,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Profit maximization; Computer science; Kalman filter; Exponential smoothing; Smoothing; Maximization; Profit (economics); Mathematical optimization; Artificial intelligence","score_opus":0.02252278913298943,"score_gpt":0.21571376359147923,"score_spread":0.1931909744584898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014983425","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004259359,0.0000057669617,0.990411,0.0022641837,0.00095067633,0.00042147152,0.0000014018,0.00028037478,0.001405762],"genre_scores_gemma":[0.6761011,3.3651648e-7,0.32183215,0.0010477308,0.00032403247,0.00010001218,0.0000101704045,0.0000061203004,0.0005783609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999195,0.000029503502,0.00015805147,0.0002594995,0.00013023417,0.00022773739],"domain_scores_gemma":[0.9992755,0.0001328907,0.0000672778,0.00030319963,0.0001514953,0.00006965109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027996348,0.000096290496,0.00009158218,0.00003197553,0.00014843527,0.00010958876,0.0003029743,0.00007505924,0.00007494508],"category_scores_gemma":[0.000032298987,0.00008472161,0.000054166307,0.00017674352,0.000021518901,0.00028206356,0.00002010659,0.00010507879,0.00002441094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000269196,0.000031631498,0.0007696267,0.00001034977,0.00001243221,6.156018e-7,0.00010171327,0.09531249,0.00029604533,0.50576013,0.013564053,0.38411403],"study_design_scores_gemma":[0.00049544417,0.000041499774,0.0007434225,0.000004016871,0.0000055463092,0.0000011103225,0.0000023962932,0.98438704,0.00019107151,0.0033851322,0.010625663,0.0001176273],"about_ca_topic_score_codex":0.0000071727054,"about_ca_topic_score_gemma":0.00014381831,"teacher_disagreement_score":0.88907456,"about_ca_system_score_codex":0.000008862545,"about_ca_system_score_gemma":0.00005547203,"threshold_uncertainty_score":0.34548467},"labels":[],"label_agreement":null},{"id":"W2015894516","doi":"10.1023/b:jons.0000034215.58853.91","title":"Virtual Traffic Path Optimization in Connection-Oriented Networks with Stochastic Traffic","year":2004,"lang":"en","type":"article","venue":"Journal of Network and Systems Management","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Network packet; Computer network; Traffic generation model; Distributed computing; Traffic flow (computer networking); Traffic engineering; Path (computing); Connection (principal bundle)","score_opus":0.005880640879010847,"score_gpt":0.18928928586465313,"score_spread":0.18340864498564227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015894516","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047003005,0.0015387529,0.94924664,0.00027479164,0.0014043709,0.00039387305,1.9445176e-7,0.000050937997,0.00008741296],"genre_scores_gemma":[0.9941007,0.0002318965,0.004950202,0.000096258846,0.00050754193,0.000018789056,0.0000014622626,0.000013451593,0.000079682184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981844,0.00013341014,0.00066790945,0.0002703962,0.00038830936,0.00035560894],"domain_scores_gemma":[0.9989772,0.00008462076,0.0004482381,0.00020140111,0.00014121218,0.00014736083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080375356,0.00020263353,0.00038277332,0.00020371472,0.00013742821,0.00019626292,0.00028407402,0.00007069493,0.0000017680569],"category_scores_gemma":[0.000005839904,0.00015889185,0.0000595955,0.0006884669,0.000036807287,0.00035597873,0.000045961537,0.00024046369,0.0000011391545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009819868,0.00008661055,0.000024611714,0.000013883586,0.00009532481,0.00014227712,0.00018200747,0.9490681,4.8854908e-8,0.015191971,0.0002722452,0.03482471],"study_design_scores_gemma":[0.0030881923,0.0006321073,0.00021868966,0.0005645101,0.000047557758,0.000218398,0.0003652826,0.9942796,1.3133455e-8,0.000020173453,0.00038605012,0.00017940227],"about_ca_topic_score_codex":0.0000027967403,"about_ca_topic_score_gemma":0.00001358482,"teacher_disagreement_score":0.9470977,"about_ca_system_score_codex":0.000115232804,"about_ca_system_score_gemma":0.000048448197,"threshold_uncertainty_score":0.6479422},"labels":[],"label_agreement":null},{"id":"W2016018393","doi":"10.1002/nem.523","title":"Weighted proportional loss rate differentiation of TCP traffic","year":2004,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Nortel (Canada)","funders":"","keywords":"Computer science; Differentiated services; Queue; Quality of service; Class (philosophy); Operator (biology); Service (business); Computer network; Artificial intelligence; Economics","score_opus":0.006673285738313726,"score_gpt":0.22330838239317455,"score_spread":0.21663509665486083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016018393","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10827496,0.00026522673,0.8826497,0.0047828434,0.0030863658,0.00016569847,0.0000014912682,0.000038421356,0.0007352895],"genre_scores_gemma":[0.9827428,0.0002249919,0.015818244,0.00030010619,0.00073280564,0.000005262537,0.00000540598,0.0000070319466,0.00016336536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810743,0.00006409677,0.0007123603,0.00016745148,0.0007673314,0.00018134058],"domain_scores_gemma":[0.9984336,0.000048256345,0.0007535363,0.00016183165,0.00052878703,0.000074010866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005083061,0.00012622558,0.0001973266,0.00019683666,0.00004573973,0.00008804401,0.0010090593,0.000037079953,0.000041971038],"category_scores_gemma":[0.000008213483,0.000108187596,0.00016563784,0.00024354966,0.000040727853,0.0003808958,0.00012457694,0.0001357035,0.000011875645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001317377,0.00029999015,0.00034097632,0.000010538394,0.0006463561,0.00022668974,0.000098216384,0.46059033,0.000018173463,0.2635967,0.0019160052,0.27212426],"study_design_scores_gemma":[0.026111761,0.0015019022,0.12184094,0.0020778573,0.00052787556,0.0008694312,0.00015353409,0.5537809,0.00054727914,0.22568354,0.065408446,0.0014965062],"about_ca_topic_score_codex":9.95402e-7,"about_ca_topic_score_gemma":0.0000027096432,"teacher_disagreement_score":0.87446785,"about_ca_system_score_codex":0.000116848816,"about_ca_system_score_gemma":0.00006834818,"threshold_uncertainty_score":0.4411762},"labels":[],"label_agreement":null},{"id":"W2016114679","doi":"10.1002/nem.402","title":"Improving network service quality with explicit TCP window control","year":2001,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Computer science; Computer network; TCP acceleration; TCP global synchronization; TCP delayed acknowledgment; TCP tuning; TCP Friendly Rate Control; Network packet; Queue; Window (computing); HSTCP; Compound TCP; Zeta-TCP; TCP Westwood plus; Quality of service; Limit (mathematics); Network congestion; Operating system","score_opus":0.011278779367032983,"score_gpt":0.2429212662415436,"score_spread":0.2316424868745106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016114679","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006707659,0.00046916748,0.977477,0.008789391,0.0023533145,0.00023798367,8.506987e-7,0.000081321115,0.0038833008],"genre_scores_gemma":[0.96158856,0.00018480384,0.026367703,0.007833794,0.003544583,0.000017467753,0.000002014886,0.000017513545,0.00044354875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972296,0.00016826391,0.0007710337,0.00030503818,0.0010686147,0.0004574929],"domain_scores_gemma":[0.9976277,0.00020544913,0.0008687045,0.00036584423,0.0007633787,0.00016893826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012424669,0.0002249482,0.000333007,0.00011803302,0.00012656843,0.00034555723,0.0019090599,0.000051284467,0.000049372884],"category_scores_gemma":[0.000011325926,0.00018346221,0.00014306151,0.00049022964,0.000022364986,0.00065623474,0.0002284886,0.00027757452,0.000027204158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005705003,0.00011143198,0.005706089,0.000008901594,0.0009084266,0.0006539225,0.0000721067,0.47969207,0.0000058309033,0.0737132,0.0060608736,0.43249667],"study_design_scores_gemma":[0.016785482,0.0007458849,0.060469273,0.00085621234,0.0003274682,0.0012454332,0.00021904228,0.6453923,0.000005342513,0.011266567,0.2614822,0.0012048096],"about_ca_topic_score_codex":0.000019115854,"about_ca_topic_score_gemma":0.000045610774,"teacher_disagreement_score":0.9548809,"about_ca_system_score_codex":0.00012773353,"about_ca_system_score_gemma":0.0000599188,"threshold_uncertainty_score":0.7481372},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04134902406865253,"score_gpt":0.2602165361400509,"score_spread":0.21886751207139837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016840637","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5413751,0.00039157755,0.45747325,0.000090067486,0.00008042746,0.00050669216,8.30424e-7,0.00006048912,0.000021551732],"genre_scores_gemma":[0.9931542,0.00016269504,0.0062653925,0.000053599528,0.00008265108,0.00021541181,0.000010953637,0.000008902746,0.000046183064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988252,0.000050406314,0.00033774407,0.00027338808,0.0002504675,0.00026278404],"domain_scores_gemma":[0.9991738,0.00014807582,0.00008370965,0.00022257652,0.0003339267,0.000037898713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000844694,0.00012015929,0.00017257882,0.00009246811,0.00009556391,0.00006958151,0.00023246736,0.00006344765,0.000023202934],"category_scores_gemma":[0.000053323412,0.00011757623,0.00003148567,0.0004760153,0.000013220881,0.0010558782,0.00001248885,0.000083668536,0.0000036040844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032540353,0.000037245678,0.00006184691,0.000021905056,0.0000049151863,3.380035e-8,0.00022808733,0.6418568,0.0000016999567,0.000033770117,0.000027917758,0.35769323],"study_design_scores_gemma":[0.00085232634,0.0000933629,0.00028936838,0.00008837206,0.000026380625,0.0000014296002,0.000005429943,0.99835765,0.000009496345,0.00007406808,0.00007329938,0.00012880247],"about_ca_topic_score_codex":0.0000037789232,"about_ca_topic_score_gemma":0.00002627502,"teacher_disagreement_score":0.4517791,"about_ca_system_score_codex":0.000055966986,"about_ca_system_score_gemma":0.00022657085,"threshold_uncertainty_score":0.47946194},"labels":[],"label_agreement":null},{"id":"W2018148490","doi":"10.1109/ccdc.2011.5968279","title":"A guaranteed cost congestion control strategy for a network of multi-agent systems subject to differentiated services traffic","year":2011,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Network congestion; Network traffic control; Differentiated services; MATLAB; Controller (irrigation); Linear matrix inequality; Traffic congestion; Computer network; Distributed computing; Mathematical optimization; Engineering; Quality of service; Mathematics","score_opus":0.042419706300248654,"score_gpt":0.2485003578479224,"score_spread":0.20608065154767374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018148490","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09993701,0.00044000646,0.8955537,0.000074910866,0.0009251727,0.002495415,0.000023377796,0.00036936722,0.00018105177],"genre_scores_gemma":[0.99502736,0.00000822403,0.0038546121,0.00028570576,0.0001215466,0.0004485241,0.000009152732,0.000018825644,0.00022606396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979431,0.000171756,0.0006050361,0.00050857925,0.00023283434,0.0005386792],"domain_scores_gemma":[0.99850214,0.00020707322,0.00024643386,0.0004696759,0.00037167445,0.00020301138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045198124,0.00027406868,0.00051025255,0.000084651554,0.00011938925,0.00012149228,0.00076873455,0.00012606654,0.000022437674],"category_scores_gemma":[0.000012699168,0.00022796683,0.00014854119,0.00038529342,0.000033681696,0.00018798362,0.000049264894,0.00009289191,0.000026531248],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014644127,0.0011162773,0.0021096107,0.0003818214,0.0007403099,0.0000236588,0.0024716961,0.6485684,0.0006611658,0.098040275,0.0013247445,0.24309766],"study_design_scores_gemma":[0.0037085633,0.0005116778,0.0046205907,0.00012215077,0.000070065136,0.000009784233,0.00012858953,0.9900845,0.000044709628,0.000040020597,0.0003804981,0.0002787938],"about_ca_topic_score_codex":0.00015296439,"about_ca_topic_score_gemma":0.00036672057,"teacher_disagreement_score":0.89509034,"about_ca_system_score_codex":0.000035488985,"about_ca_system_score_gemma":0.00007688774,"threshold_uncertainty_score":0.9296217},"labels":[],"label_agreement":null},{"id":"W2018213245","doi":"10.1287/opre.1060.0288","title":"An Economic Analysis of Interconnection Arrangements Between Internet Backbone Providers","year":2006,"lang":"en","type":"article","venue":"Operations Research","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Alberta; Carnegie Mellon University; Ford Motor Company","keywords":"Peering; Service provider; The Internet; Computer science; Incentive; Revenue; Computer network; Quality of service; Service (business); Network packet; Business; Industrial organization; Microeconomics; Economics; Marketing","score_opus":0.042654550153279285,"score_gpt":0.3527544471638261,"score_spread":0.3100998970105468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018213245","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5864496,0.000026390597,0.41129774,0.0006691689,0.00007309368,0.00020927099,0.000008066195,0.00004233197,0.0012243217],"genre_scores_gemma":[0.9963641,0.0000040589734,0.002370529,0.00001506874,0.0001211567,0.000051111147,0.00006376636,0.000004977834,0.001005225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986558,0.0002743676,0.00028809675,0.00032396684,0.0002424847,0.0002152641],"domain_scores_gemma":[0.9991532,0.00010065213,0.000024523875,0.00045090562,0.00020939525,0.000061347135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082541833,0.00007168976,0.00017032017,0.00066227675,0.00013447957,0.00030886038,0.0005621736,0.000044192693,0.00015438283],"category_scores_gemma":[0.000015053164,0.00006992806,0.0000664972,0.00087696145,0.00007139122,0.00066444423,0.000078012374,0.00013765536,0.00007394437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024956633,0.00027295228,0.030822996,0.000010371316,0.00087927596,0.0000033578976,0.0012454201,0.61843306,0.002491676,0.11875291,0.0040511773,0.22301182],"study_design_scores_gemma":[0.00022206658,0.0001201713,0.011328684,0.000005364301,0.000042028227,2.7677007e-7,0.00007989656,0.9866511,0.00062442076,0.00014016304,0.0007102582,0.00007552366],"about_ca_topic_score_codex":0.0027737275,"about_ca_topic_score_gemma":0.00553638,"teacher_disagreement_score":0.4099145,"about_ca_system_score_codex":0.00010398804,"about_ca_system_score_gemma":0.0000964786,"threshold_uncertainty_score":0.4193065},"labels":[],"label_agreement":null},{"id":"W2018396040","doi":"10.1016/j.cor.2004.05.010","title":"Point of presence design in Internet protocol networks with performance guarantees","year":2004,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Computer network; Tabu search; Node (physics); The Internet; Routing protocol; Distributed computing; Heuristic; Set (abstract data type); Network planning and design; Internet topology; Routing (electronic design automation); Network topology; Algorithm","score_opus":0.04454849626407173,"score_gpt":0.3199370992120859,"score_spread":0.27538860294801415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018396040","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012180416,0.000029844912,0.9698939,0.0007783608,0.00007579456,0.016828049,2.2097385e-7,0.00006257392,0.00015086708],"genre_scores_gemma":[0.879373,0.000008093884,0.106048696,0.000059864848,0.00005093789,0.014327177,0.0000011768768,0.000009193706,0.00012182606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979039,0.0003555524,0.00034795946,0.00042576357,0.00051446754,0.00045237222],"domain_scores_gemma":[0.9986381,0.00027083434,0.000031044205,0.0005524016,0.00041824623,0.0000893937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00123256,0.00013925214,0.00019642246,0.00030731215,0.00015373295,0.0002534859,0.0012390096,0.00005928548,0.0000096053545],"category_scores_gemma":[0.000037551996,0.0001114039,0.000028932684,0.0011845437,0.00021888004,0.00067457143,0.0002746539,0.0004310149,0.000016710932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079212485,0.00014304263,0.00022071782,0.000015193271,0.000010293303,0.000017356982,0.0006455065,0.92416406,0.00003252823,0.014650367,0.00033517572,0.059686534],"study_design_scores_gemma":[0.0014198814,0.00072582933,0.00087054004,0.00032941977,9.711732e-7,0.000020925223,0.000022580207,0.99562657,0.000582406,0.00009585957,0.00017850292,0.00012651352],"about_ca_topic_score_codex":0.00011669231,"about_ca_topic_score_gemma":0.00012524567,"teacher_disagreement_score":0.8671926,"about_ca_system_score_codex":0.000099673205,"about_ca_system_score_gemma":0.00041992843,"threshold_uncertainty_score":0.45429188},"labels":[],"label_agreement":null},{"id":"W2019137622","doi":"10.1109/ctrq.2008.13","title":"A Distributed Congestion Control Strategy for Differentiated-Services Network","year":2008,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Network congestion; Computer science; Robustness (evolution); Differentiated services; Computer network; Distributed computing; Flow control (data); Quality of service","score_opus":0.017225505591015152,"score_gpt":0.22165072743018113,"score_spread":0.20442522183916598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019137622","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018918466,0.00030569773,0.9779063,0.0008911423,0.000455572,0.0004970697,0.000025827185,0.00060552283,0.00039440492],"genre_scores_gemma":[0.995038,0.000032610846,0.003300524,0.0006870874,0.00033109577,0.00013228109,0.00007179921,0.000010185659,0.00039642345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859387,0.000067361776,0.00028878835,0.0003952169,0.00018677732,0.000468009],"domain_scores_gemma":[0.9989525,0.00024617833,0.00011244365,0.00035424382,0.0001862912,0.00014832323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014950946,0.00019344101,0.0002611839,0.000032506236,0.00033865296,0.00012149821,0.0005662505,0.000101403,0.000032282598],"category_scores_gemma":[0.000008298985,0.00016283024,0.00011341307,0.00023889831,0.000047048958,0.0003170801,0.00004247724,0.0000979119,0.000045674657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003069556,0.00033979124,0.006853276,0.000053774478,0.00033272087,0.00004403822,0.00015603527,0.13845086,0.00013535042,0.63116187,0.033526428,0.18863893],"study_design_scores_gemma":[0.0028984789,0.00020009492,0.012223277,0.000020002244,0.000026059239,0.000030813895,0.000010142132,0.9747923,0.000015438707,0.0024833342,0.007013853,0.00028620125],"about_ca_topic_score_codex":0.000016690727,"about_ca_topic_score_gemma":0.000034664296,"teacher_disagreement_score":0.9761195,"about_ca_system_score_codex":0.000022119882,"about_ca_system_score_gemma":0.00006210357,"threshold_uncertainty_score":0.6640025},"labels":[],"label_agreement":null},{"id":"W2020121488","doi":"10.1145/1577222.1577229","title":"Synthesis of network delays for voice packets in service overlay networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer network; Network delay; Computer science; Overlay network; End-to-end delay; Voice over IP; Quality of service; Network packet; Processing delay; Network service; Transmission delay; The Internet","score_opus":0.010000320096044932,"score_gpt":0.2297051189302705,"score_spread":0.21970479883422558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020121488","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075922753,0.000306595,0.9862802,0.0009669947,0.00045391783,0.0003122672,9.738138e-7,0.00011870114,0.0039681],"genre_scores_gemma":[0.96809447,0.00001990801,0.02978472,0.001617406,0.00030692885,0.00003568247,0.0000012267479,0.000011189684,0.00012848078],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984807,0.000049423823,0.00043029984,0.00032658596,0.0001717944,0.00054120173],"domain_scores_gemma":[0.99747837,0.0017436458,0.00013106088,0.00040889933,0.00013457616,0.000103435676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012595014,0.0001484347,0.00026938642,0.00007083132,0.00006114017,0.0000357747,0.0006390824,0.00012245348,0.000013638957],"category_scores_gemma":[0.000047980815,0.00013631575,0.00008310024,0.00078577833,0.00001983758,0.00021129179,0.00009036364,0.00011131495,0.000010591808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010784287,0.00008707197,0.00262381,0.00002211816,0.00003596818,0.0000082770175,0.00010216315,0.15840456,0.000015787695,0.10454327,0.0052194423,0.7288297],"study_design_scores_gemma":[0.00053499313,0.00004999893,0.0070656044,0.00006161183,0.0000129613,0.0000044448657,0.000020285202,0.9866295,0.00011955107,0.0010580131,0.0042437483,0.00019931972],"about_ca_topic_score_codex":0.000039264243,"about_ca_topic_score_gemma":0.0012100709,"teacher_disagreement_score":0.9605022,"about_ca_system_score_codex":0.000029752708,"about_ca_system_score_gemma":0.000040134444,"threshold_uncertainty_score":0.5558795},"labels":[],"label_agreement":null},{"id":"W2021482093","doi":"10.1002/dac.859","title":"A scalable multicast routing protocol for building shortest path trees","year":2006,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Multicast; Protocol Independent Multicast; Distance Vector Multicast Routing Protocol; Computer network; Distributed computing; Xcast; Pragmatic General Multicast; Source-specific multicast; IP multicast; Open Shortest Path First; Scalability; Routing protocol; Routing (electronic design automation); Link-state routing protocol; Database","score_opus":0.025600276469011033,"score_gpt":0.31685523675666966,"score_spread":0.2912549602876586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021482093","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001135028,0.0001466088,0.98507863,0.0017385675,0.0005255254,0.010292726,0.000003383418,0.000056233752,0.0010232748],"genre_scores_gemma":[0.9612879,0.000003721854,0.02929971,0.00005425043,0.0005267606,0.008667605,0.000002456699,0.000009328088,0.0001482778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982761,0.00015357893,0.00082223665,0.00012154976,0.00047980217,0.00014669313],"domain_scores_gemma":[0.9969303,0.00048657987,0.00084621744,0.00036362882,0.0013208488,0.00005240254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010472841,0.00010701609,0.00019615606,0.0001469096,0.00012519398,0.0004896317,0.0018858141,0.000048721144,0.0000031828322],"category_scores_gemma":[0.000090077825,0.000092437804,0.000122065365,0.00012420333,0.000031080548,0.00060801144,0.0001191064,0.00014563563,0.0000038722656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020081468,0.0005881865,0.006678057,0.000011213615,0.00024962486,0.000018398303,0.00036682712,0.16678725,0.0015733262,0.685596,0.0087453155,0.12918498],"study_design_scores_gemma":[0.0021926183,0.00007861638,0.0011843507,0.00045734967,0.000009360648,0.00013566243,0.000066767476,0.91057056,0.0001170774,0.0011113342,0.083938845,0.00013746969],"about_ca_topic_score_codex":0.000052818817,"about_ca_topic_score_gemma":0.000010939713,"teacher_disagreement_score":0.96015286,"about_ca_system_score_codex":0.00011063801,"about_ca_system_score_gemma":0.00010329274,"threshold_uncertainty_score":0.47215298},"labels":[],"label_agreement":null},{"id":"W2021661072","doi":"10.1155/2009/905890","title":"In-Network Adaptation of Video Streams Using Network Processors","year":2009,"lang":"en","type":"article","venue":"Advances in Multimedia","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"University of Manitoba","keywords":"Computer science; Transcoding; Multicast; Computer network; Video quality; Enhanced Data Rates for GSM Evolution; Adaptation (eye); Communication source; Bandwidth (computing); Wireless network; Real-time computing; Wireless; Telecommunications","score_opus":0.010832698827365166,"score_gpt":0.26675765167184595,"score_spread":0.2559249528444808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021661072","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08169609,0.015532986,0.8992601,0.00041883026,0.0014974192,0.0005492989,0.000001139827,0.00012515242,0.000918987],"genre_scores_gemma":[0.8436352,0.00037279743,0.1554801,0.0001770421,0.00030021116,0.000010693541,0.0000017188058,0.000005213434,0.00001701383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985708,0.00007890371,0.00041846352,0.00031908898,0.0002219452,0.00039080856],"domain_scores_gemma":[0.9991887,0.0002588029,0.00019615909,0.00023696243,0.00006416055,0.000055201235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003385067,0.00014209836,0.00025611417,0.000082513696,0.00003972397,0.000019831523,0.00041809425,0.000069893584,0.0000059729628],"category_scores_gemma":[0.000057728983,0.00014095743,0.0000358302,0.0009671031,0.000045972472,0.0010508227,0.000031588097,0.0001611424,0.0000042860565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014997816,0.000029880659,0.0022426539,0.0000036295169,0.0000013879865,0.0000065943946,0.00024376616,0.5523905,0.000005069523,0.0015704895,0.000021006761,0.44347],"study_design_scores_gemma":[0.0007119637,0.000066127526,0.0025118797,0.00015391609,0.0000034907148,0.0000022337674,0.000037107966,0.98854196,0.00001802125,0.0067004445,0.0011063891,0.00014643901],"about_ca_topic_score_codex":0.000018469605,"about_ca_topic_score_gemma":0.00024533906,"teacher_disagreement_score":0.7619391,"about_ca_system_score_codex":0.000044224416,"about_ca_system_score_gemma":0.00006898996,"threshold_uncertainty_score":0.57480776},"labels":[],"label_agreement":null},{"id":"W2021987987","doi":"10.1109/mcom.2004.1299361","title":"Performance of new link state advertisement mechanisms in routing protocols with traffic engineering extensions","year":2004,"lang":"en","type":"article","venue":"IEEE Communications Magazine","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Computer network; Open Shortest Path First; Link-state routing protocol; Routing protocol; Link state packet; Equal-cost multi-path routing; Routing (electronic design automation); Static routing; Key (lock); Distributed computing; Traffic engineering; Network packet; Computer security; Burst switching; Transmission delay","score_opus":0.021139913018073955,"score_gpt":0.2498137504300213,"score_spread":0.22867383741194736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021987987","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09545006,0.00013555582,0.8952933,0.0041506495,0.000096527205,0.004354093,0.0000019095692,0.0002749924,0.0002429223],"genre_scores_gemma":[0.8391565,0.00005920099,0.15968692,0.00006489681,0.000017336039,0.000909249,0.0000024039648,0.000011292479,0.000092217095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989307,0.000036654903,0.00039254158,0.00020656391,0.00019055785,0.00024300319],"domain_scores_gemma":[0.998132,0.000068823574,0.00013751899,0.0014641605,0.00010998569,0.00008754246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025016593,0.00014126812,0.00019922513,0.00013413643,0.00009317423,0.000036127298,0.0012588551,0.000034497687,0.0000026848952],"category_scores_gemma":[0.0000152273,0.00013034031,0.000034046163,0.0006246242,0.000036362693,0.00028876014,0.00016344331,0.00023229975,0.000020174455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018029583,0.0001489775,0.00007573374,0.00001748241,0.000015899175,0.000003066626,0.00059295807,0.7988567,0.0018410078,0.009531282,0.000032050848,0.18886685],"study_design_scores_gemma":[0.0018970843,0.00028308397,0.0033074492,0.0005961857,0.000008662378,0.000013978033,0.000009997552,0.9916677,0.00075956015,0.00020843926,0.0010358329,0.00021205242],"about_ca_topic_score_codex":0.000012640636,"about_ca_topic_score_gemma":0.000118344324,"teacher_disagreement_score":0.7437064,"about_ca_system_score_codex":0.00007549943,"about_ca_system_score_gemma":0.00022420478,"threshold_uncertainty_score":0.5315124},"labels":[],"label_agreement":null},{"id":"W2022345288","doi":"10.1109/glocom.2006.892","title":"WLC47-5: Modeling Wireless TCP Connection Arrival Process","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer network; Computer science; Wireless network; Wireless; Quality of service; Telecommunications","score_opus":0.00761181839861558,"score_gpt":0.2139359930435849,"score_spread":0.20632417464496933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022345288","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24747203,0.00012210982,0.7467668,0.00087034533,0.0005896083,0.000108121356,0.0000010804555,0.00041653868,0.003653367],"genre_scores_gemma":[0.99779975,0.0000046089303,0.0012187544,0.00025941312,0.00041301732,0.000022285,0.0000045011802,0.000008323471,0.00026934687],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988653,0.00003779384,0.0002244343,0.000352644,0.0002261596,0.00029366228],"domain_scores_gemma":[0.99942976,0.000042386964,0.00006319202,0.0002867194,0.00011123855,0.00006672809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014380687,0.00013452274,0.00014821472,0.000051048177,0.0001687004,0.00015710945,0.00046032155,0.00006775289,0.000019161376],"category_scores_gemma":[0.000008817979,0.00013156979,0.0000603268,0.00026776717,0.000019439563,0.00034659487,0.00004920669,0.00012097774,0.00008408561],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026107284,0.00015516377,0.0013399589,0.000021743841,0.000024888184,0.000026221938,0.0001653978,0.40338102,0.00016314347,0.2010991,0.0034335372,0.39016372],"study_design_scores_gemma":[0.00042283398,0.00002287615,0.00015435001,0.00001498651,0.000005833049,0.000017711667,0.000020967425,0.99027663,0.00009208721,0.0075824447,0.0012168888,0.00017239791],"about_ca_topic_score_codex":0.000099606965,"about_ca_topic_score_gemma":0.000071696624,"teacher_disagreement_score":0.7503277,"about_ca_system_score_codex":0.00003799061,"about_ca_system_score_gemma":0.000065573055,"threshold_uncertainty_score":0.536526},"labels":[],"label_agreement":null},{"id":"W2022524561","doi":"10.1109/iccs.2004.1359430","title":"Effective control for ABR multipoint-to-multipoint services","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Asynchronous Transfer Mode; Bandwidth allocation; Computer network; Flow control (data); Bandwidth (computing); Asynchronous communication; Distributed computing; Convergence (economics); Mathematical optimization; Mathematics","score_opus":0.00365204708810816,"score_gpt":0.21757012144632248,"score_spread":0.21391807435821433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022524561","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007659523,0.00007516029,0.9829285,0.0053647873,0.000519095,0.0022948112,0.0000058103974,0.0004970125,0.00065525883],"genre_scores_gemma":[0.92483616,0.0000016254829,0.06826859,0.0056213154,0.00022914245,0.0008034858,0.0000016760722,0.000013066891,0.00022491321],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985799,0.00004331791,0.00024045988,0.00052061916,0.0001919961,0.00042369444],"domain_scores_gemma":[0.99870676,0.0003711031,0.00006711461,0.00043419155,0.00019701559,0.00022381775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030155288,0.00020324712,0.00025916568,0.00008409257,0.00015824166,0.00016172773,0.0006950025,0.000072618495,0.00001028582],"category_scores_gemma":[0.000032539967,0.00016699139,0.00013710964,0.00021861815,0.000021576445,0.00031718044,0.00008067052,0.00009207802,0.00026483793],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019395199,0.00019990171,0.00017925525,0.000040601604,0.00011337575,0.000010203632,0.0009708383,0.060114324,0.0011412185,0.18927431,0.00043277952,0.74732924],"study_design_scores_gemma":[0.017453646,0.0009403974,0.004249572,0.00011347585,0.00004370564,0.000019618275,0.000093620685,0.9434712,0.0030116788,0.009504279,0.020353243,0.0007455917],"about_ca_topic_score_codex":0.00007529133,"about_ca_topic_score_gemma":0.00017790828,"teacher_disagreement_score":0.91717666,"about_ca_system_score_codex":0.000070808346,"about_ca_system_score_gemma":0.000050716684,"threshold_uncertainty_score":0.68097115},"labels":[],"label_agreement":null},{"id":"W2022909420","doi":"10.1145/1710115.1710122","title":"Automatically generating bursty benchmarks for multitier systems","year":2010,"lang":"en","type":"article","venue":"ACM SIGMETRICS Performance Evaluation Review","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Burstiness; Computer science; Session (web analytics); Testbed; Throughput; Computer network; Distributed computing; Service (business); Sizing; Real-time computing; Operating system; Wireless","score_opus":0.03661292939629171,"score_gpt":0.31334007049352786,"score_spread":0.2767271410972362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022909420","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047118593,0.06548374,0.8677501,0.0034418872,0.007073605,0.006570206,0.000008940999,0.00044541442,0.002107498],"genre_scores_gemma":[0.77838004,0.011509114,0.2044776,0.0023772737,0.0008427206,0.0020369403,0.00009277498,0.000027339045,0.0002562319],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974447,0.0001534888,0.0007133086,0.00044605293,0.00088704337,0.00035540445],"domain_scores_gemma":[0.9964166,0.0007968908,0.00034462765,0.0011582595,0.001148565,0.00013504828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005973289,0.00020747841,0.00037294446,0.00019163416,0.00029701024,0.00023516777,0.0011747561,0.00011275431,0.00014008989],"category_scores_gemma":[0.004486729,0.00017525395,0.00012193149,0.0012434389,0.00003092508,0.0006460688,0.00013397347,0.00027512328,0.000066980036],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011138881,0.00002727944,0.00026142722,0.0005280318,0.000016551037,2.1764752e-7,0.000021947399,0.0022741072,0.00005062942,0.0058057667,0.0058314735,0.98518145],"study_design_scores_gemma":[0.00048477956,0.000072227995,0.000525138,0.00045673334,0.00008114402,0.000009706823,0.0000022611118,0.9667393,0.000016936316,0.00007320073,0.031314176,0.00022438938],"about_ca_topic_score_codex":0.0000016280901,"about_ca_topic_score_gemma":0.0000014729726,"teacher_disagreement_score":0.98495704,"about_ca_system_score_codex":0.000060556005,"about_ca_system_score_gemma":0.00029277778,"threshold_uncertainty_score":0.7146649},"labels":[],"label_agreement":null},{"id":"W2022961962","doi":"10.1109/icc.2006.254859","title":"Slope Domain Modeling and Analysis of Data Communication Networks: A Network Calculus Complement","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Complement (music); Network calculus; Computer science; Frequency domain; Legendre transformation; Algorithm; Domain (mathematical analysis); Domain analysis; Network analysis; Dual (grammatical number); Calculus (dental); Theoretical computer science; Applied mathematics; Mathematics; Mathematical analysis; Telecommunications","score_opus":0.10652346147587384,"score_gpt":0.33962664186713787,"score_spread":0.23310318039126404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022961962","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001991965,0.0007627773,0.9763266,0.0067981626,0.00015110672,0.00022820031,0.0001243868,0.000098215954,0.013518624],"genre_scores_gemma":[0.9197085,0.000890035,0.07783989,0.00028130252,0.00007135144,0.000045767058,0.0010405064,0.000008540494,0.00011413119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980028,0.00030939077,0.00066746265,0.00041306223,0.00036960442,0.00023763656],"domain_scores_gemma":[0.9951446,0.00037601055,0.00032846452,0.0036384636,0.00044545677,0.00006697937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077551906,0.00018047552,0.0003181999,0.00023869159,0.00032354105,0.00021701613,0.005222762,0.00006985653,0.000057697194],"category_scores_gemma":[0.000014687149,0.0001862172,0.000081550235,0.0007106797,0.00017200901,0.00047994,0.0011804297,0.00025873087,0.000008892908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010840189,0.000129499,0.00051058695,0.0000011896179,0.00029374118,4.2819718e-7,0.00006525724,0.3007935,0.000010795531,0.6769958,0.0014155502,0.01977281],"study_design_scores_gemma":[0.0003475624,0.000021306954,0.00073532294,0.00004986146,0.00012376145,0.0000017855739,0.00005139435,0.9883736,7.515083e-7,0.0068596234,0.003266083,0.00016896713],"about_ca_topic_score_codex":0.000597304,"about_ca_topic_score_gemma":0.0028358647,"teacher_disagreement_score":0.9177165,"about_ca_system_score_codex":0.000057708763,"about_ca_system_score_gemma":0.00008077236,"threshold_uncertainty_score":0.97052777},"labels":[],"label_agreement":null},{"id":"W2024367487","doi":"10.1016/s0167-739x(03)00110-9","title":"Optimal Quality of Service routing and admission control using the Utility Model","year":2003,"lang":"en","type":"article","venue":"Future Generation Computer Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Sierra Wireless (Canada); University of Victoria; Eyeball (Canada)","funders":"","keywords":"Computer science; Knapsack problem; Computer network; Admission control; Quality of service; Session (web analytics); Reservation; Routing (electronic design automation); Resource allocation; Distributed computing; Algorithm","score_opus":0.0451775032579294,"score_gpt":0.26630880719343625,"score_spread":0.22113130393550684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024367487","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051197294,0.0009557481,0.93964744,0.0007754175,0.00698165,0.00032557824,0.0000038561207,0.00006726917,0.000045742687],"genre_scores_gemma":[0.946706,0.0000041129224,0.047223113,0.0006282779,0.005398122,0.000010640672,0.0000025459804,0.0000068839627,0.000020285755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979068,0.00071315066,0.0005142126,0.000370345,0.0002986069,0.00019690477],"domain_scores_gemma":[0.9987156,0.00010165925,0.0002881046,0.00048649425,0.0003161487,0.00009200336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012446393,0.00016479508,0.00027999334,0.00003344712,0.00029889244,0.00021812633,0.00032100754,0.00009943005,0.000002001596],"category_scores_gemma":[0.000013279491,0.00011747968,0.00005615559,0.00021681338,0.000021174754,0.00025608847,0.00006027002,0.0001279043,8.7494186e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011416346,0.000034517616,0.0002823052,0.00004276303,0.000041068673,8.3103566e-7,0.00089709746,0.89644957,0.0013439059,0.08679815,0.0027763334,0.011322039],"study_design_scores_gemma":[0.0005789953,0.000019159581,0.00013586269,0.000019147748,0.000011063195,0.000017812341,0.000054515855,0.9974513,0.000074743795,0.000008952158,0.0015017712,0.00012665636],"about_ca_topic_score_codex":0.00003258889,"about_ca_topic_score_gemma":0.0000131956685,"teacher_disagreement_score":0.8955087,"about_ca_system_score_codex":0.000022237402,"about_ca_system_score_gemma":0.00013274832,"threshold_uncertainty_score":0.47906822},"labels":[],"label_agreement":null},{"id":"W2024856623","doi":"10.1109/cjece.2004.1425801","title":"An efficient wireless resource management scheme to support handoff data recovery in packet-switched cellular multicast networks","year":2004,"lang":"en","type":"article","venue":"Canadian Journal of Electrical and Computer Engineering","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Multicast; Computer network; Computer science; Source-specific multicast; Pragmatic General Multicast; Xcast; Handover; IP multicast; Reliable multicast; Network packet; Protocol Independent Multicast; Distance Vector Multicast Routing Protocol; Distributed computing","score_opus":0.008339529996735812,"score_gpt":0.1909043093520036,"score_spread":0.18256477935526777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024856623","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13154842,0.00032436554,0.86735165,0.00035999116,0.0002613393,0.00011556363,0.000001097469,0.000022123862,0.000015418886],"genre_scores_gemma":[0.96487826,0.00001274489,0.034445964,0.0003545624,0.00028415147,0.0000024478866,0.0000036111485,0.000012264396,0.000005979775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985831,0.000029642451,0.00036786555,0.0003304401,0.00017222956,0.0005167171],"domain_scores_gemma":[0.9985712,0.000059433307,0.000062417865,0.00039397602,0.000049853006,0.0008630944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040180725,0.00016654264,0.00025799434,0.00039334325,0.00006459958,0.00022399581,0.0008950258,0.00006445084,0.0000020028158],"category_scores_gemma":[0.000010710182,0.00016225858,0.000039760424,0.0005938992,0.000013255199,0.00020775068,0.00009136541,0.00031802917,0.000002086031],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012750719,0.000032278716,0.0000924036,0.000006086263,0.000027064794,0.00066926255,0.00009201928,0.77243537,0.000031556076,0.0033919136,0.00015652763,0.2230528],"study_design_scores_gemma":[0.00088499533,0.0003115026,0.0011154985,0.00008677386,0.0000093176795,0.00011134372,0.0000046915598,0.9953546,0.000019827921,0.000022543443,0.0018816643,0.00019726914],"about_ca_topic_score_codex":0.00006987874,"about_ca_topic_score_gemma":0.00020159094,"teacher_disagreement_score":0.83332986,"about_ca_system_score_codex":0.0001452896,"about_ca_system_score_gemma":0.00018131202,"threshold_uncertainty_score":0.6616713},"labels":[],"label_agreement":null},{"id":"W2025450163","doi":"10.1002/sat.849","title":"Cross‐layer enhancement of TCP split‐connections over satellites links","year":2006,"lang":"en","type":"article","venue":"International Journal of Satellite Communications and Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; TCP Friendly Rate Control; TCP global synchronization; TCP tuning; Computer network; CUBIC TCP; TCP Westwood plus; TCP acceleration; Transmission Control Protocol; Network congestion; Zeta-TCP; Latency (audio); H-TCP; HSTCP; Network packet; Telecommunications","score_opus":0.022640200453010653,"score_gpt":0.2942663805402446,"score_spread":0.271626180087234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025450163","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17403997,0.33418563,0.45944306,0.010186839,0.005446588,0.0004224414,0.0000138737405,0.00012704266,0.016134566],"genre_scores_gemma":[0.9289406,0.046814077,0.023266086,0.0002029511,0.0005515279,0.000004327935,0.0000078865905,0.0000079584415,0.00020461695],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984442,0.00009990148,0.00080526376,0.00014719355,0.00034180345,0.00016162316],"domain_scores_gemma":[0.99762815,0.0004895025,0.0006543619,0.0005001281,0.0006667072,0.00006116396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055552955,0.00012497023,0.0002074504,0.00019415024,0.00015307048,0.00023221303,0.0014280578,0.00008997145,0.000024362642],"category_scores_gemma":[0.000009807108,0.00011537317,0.00012977816,0.0002298848,0.00014812955,0.0004239521,0.00030792743,0.0003399984,0.0000032168487],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028322667,0.00015575805,0.010575611,0.0000045836887,0.0001369751,0.0000052437495,0.00017810271,0.0001923269,0.0013784954,0.06616752,0.000046332934,0.9211307],"study_design_scores_gemma":[0.0015316431,0.00017840389,0.018601235,0.0005183971,0.000060628783,0.00017923568,0.000046618658,0.06835813,0.0012335097,0.013757395,0.89519364,0.0003411463],"about_ca_topic_score_codex":0.000029169256,"about_ca_topic_score_gemma":0.000023235418,"teacher_disagreement_score":0.9207896,"about_ca_system_score_codex":0.000049078135,"about_ca_system_score_gemma":0.00005909646,"threshold_uncertainty_score":0.47047812},"labels":[],"label_agreement":null},{"id":"W2025661434","doi":"10.1023/a:1019197816601","title":"Performance evaluation of path optimization schemes for inter‐switch handoff in wireless ATM networks","year":2000,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Handover; Computer science; Path (computing); Computer network; Base station; Protocol (science); Optimization problem; Wireless; Real-time computing; Algorithm; Telecommunications","score_opus":0.012990159347597226,"score_gpt":0.23569048852139526,"score_spread":0.22270032917379803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025661434","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22126384,0.00053649896,0.77634746,0.0001245339,0.00043387368,0.000738778,0.0000012890562,0.00010649019,0.0004472292],"genre_scores_gemma":[0.99418175,0.0006028268,0.004168045,0.00013736574,0.00035279713,0.00032629125,0.00003947393,0.000027532138,0.00016393258],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975909,0.00021062807,0.0006585291,0.0005562969,0.0004448748,0.00053876196],"domain_scores_gemma":[0.9985717,0.00020935715,0.00024527806,0.0005365298,0.00034024369,0.0000969108],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014097153,0.00027241983,0.00042939885,0.00010273463,0.00014201376,0.00010071086,0.0006460242,0.00023641817,0.0000809411],"category_scores_gemma":[0.000014390189,0.00026992703,0.000116918636,0.0007196789,0.00007204855,0.0005467415,0.00006649909,0.00026056377,0.0000038701623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007072843,0.000049279846,0.0009896981,0.00000771088,0.000013711222,4.7339176e-7,0.000058840607,0.51439977,0.0000014160175,0.0006808542,0.00019691595,0.4835306],"study_design_scores_gemma":[0.0027259234,0.000119021635,0.0009272315,0.00027053853,0.000036561494,0.00000366354,0.000012135835,0.99526155,0.000022870265,0.00003902199,0.0002985412,0.00028294887],"about_ca_topic_score_codex":0.00001159105,"about_ca_topic_score_gemma":0.000030901374,"teacher_disagreement_score":0.7729179,"about_ca_system_score_codex":0.00010237136,"about_ca_system_score_gemma":0.000113667105,"threshold_uncertainty_score":0.99997526},"labels":[],"label_agreement":null},{"id":"W2025919230","doi":"10.1049/el:20030312","title":"End-to-end PI congestion controller for best-effort traffic: single source case","year":2003,"lang":"en","type":"article","venue":"Electronics Letters","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Queue; PID controller; Control theory (sociology); Controller (irrigation); Pi; Network congestion; Computer science; Value (mathematics); Mathematics; Engineering; Control (management); Computer network; Control engineering","score_opus":0.012158739807198811,"score_gpt":0.22295858204565552,"score_spread":0.2107998422384567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025919230","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16367112,0.0006257401,0.8246774,0.009102089,0.00048663403,0.0009406752,0.000003720482,0.00028814186,0.00020445496],"genre_scores_gemma":[0.9817993,0.000011218074,0.008282787,0.008768244,0.0002246733,0.0002503038,0.000006123791,0.000038425245,0.0006189156],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99752563,0.00012032584,0.0003711447,0.0006792584,0.0002999619,0.0010037031],"domain_scores_gemma":[0.99869925,0.00035106728,0.00013093236,0.00045687208,0.00011440053,0.0002475028],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005879394,0.0003127133,0.00034275188,0.00014924261,0.0003277426,0.00023998538,0.0004605195,0.00011476417,0.00002372648],"category_scores_gemma":[0.000086387976,0.00031931564,0.00018594453,0.00037038777,0.00005486952,0.00026537347,0.000031402124,0.0002894427,0.00006358296],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013163679,0.0002972632,0.00003514112,0.000015152134,0.00018648295,0.00021393994,0.0004984571,0.11019813,0.008158461,0.07110281,0.013357747,0.7958048],"study_design_scores_gemma":[0.0057427357,0.0014513383,0.000013944141,0.000033914017,0.00015013687,0.0018477319,0.000060048096,0.3374386,0.0021455076,0.0004109483,0.6496011,0.0011039957],"about_ca_topic_score_codex":0.000006290745,"about_ca_topic_score_gemma":0.0000763917,"teacher_disagreement_score":0.81812817,"about_ca_system_score_codex":0.00024247609,"about_ca_system_score_gemma":0.00015118717,"threshold_uncertainty_score":0.9999259},"labels":[],"label_agreement":null},{"id":"W2026747976","doi":"10.1155/s1024123x04403081","title":"Optimum feedback strategy for access control mechanism modelled as stochastic differential equation in computer network","year":2004,"lang":"en","type":"article","venue":"Mathematical Problems in Engineering","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computation; Network congestion; Stochastic differential equation; Mathematical optimization; Simulated annealing; Differential (mechanical device); Control (management); Control theory (sociology); Algorithm; Computer network; Engineering; Network packet; Mathematics; Artificial intelligence","score_opus":0.023346169320879313,"score_gpt":0.23871638430317918,"score_spread":0.21537021498229986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026747976","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036011292,0.000040032734,0.9944498,0.00024951287,0.00028508744,0.0011538154,9.539191e-7,0.00018177234,0.000037875234],"genre_scores_gemma":[0.9489698,0.0000017539896,0.05040221,0.000064671396,0.00016793727,0.000358454,0.0000027898,0.000023492757,0.000008916371],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982932,0.00002616102,0.0005371425,0.00037777514,0.00022324444,0.00054246857],"domain_scores_gemma":[0.9992071,0.00033466585,0.000075009724,0.00025415988,0.000042933854,0.00008614076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038424015,0.00023756608,0.000396506,0.00013048771,0.000042693602,0.00022132864,0.00057863886,0.00012539413,0.000010827104],"category_scores_gemma":[0.00003855919,0.00022768893,0.00007589408,0.00029776877,0.000013962787,0.00036636787,0.00010457421,0.00023605488,0.000014910934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007710712,0.00007057242,6.844262e-7,0.000067656954,0.000010811401,0.00000239671,0.00008613717,0.69425195,0.000023780567,0.30225128,0.0000026727246,0.0032243521],"study_design_scores_gemma":[0.0023428749,0.00007630523,0.0000068354984,0.00025055103,0.000006961998,0.000004582008,0.0000011862786,0.7335185,0.000006750102,0.2636071,6.8405967e-7,0.00017768532],"about_ca_topic_score_codex":0.0000048535394,"about_ca_topic_score_gemma":0.0000050001786,"teacher_disagreement_score":0.94536865,"about_ca_system_score_codex":0.00010967666,"about_ca_system_score_gemma":0.000049848215,"threshold_uncertainty_score":0.9284885},"labels":[],"label_agreement":null},{"id":"W2027993342","doi":"10.1109/icdcsw.2013.69","title":"On Fairness-Efficiency Tradeoffs for Multi-resource Packet Processing","year":2013,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Weighted fair queueing; Computer science; Generalized processor sharing; Network packet; Queueing theory; Fairness measure; Fair queuing; Computer network; Distributed computing; Scheduling (production processes); Bandwidth (computing); Schedule; Round-robin scheduling; Mathematical optimization; Throughput; Dynamic priority scheduling; Quality of service; Telecommunications; Operating system","score_opus":0.02548469638332735,"score_gpt":0.2516465563336333,"score_spread":0.22616185995030597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027993342","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005353882,0.000085850836,0.98745215,0.0027065426,0.0001452235,0.0005894286,6.5934097e-7,0.0004256896,0.0032405797],"genre_scores_gemma":[0.9560112,9.1010986e-7,0.0383585,0.0017905614,0.00009450487,0.00020433024,0.000001525033,0.000011268243,0.003527214],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988095,0.00002916566,0.00019498318,0.0004049022,0.00019159462,0.00036981035],"domain_scores_gemma":[0.9992409,0.00018386291,0.000064074084,0.00030328977,0.000089732705,0.00011818923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015790749,0.00015016037,0.0001440452,0.00006047263,0.0002008132,0.0002909048,0.0006212447,0.00006184472,0.000052339532],"category_scores_gemma":[0.000042835516,0.000114522416,0.00007278229,0.00022316584,0.000037553455,0.00033810808,0.000040898904,0.00009257298,0.00016586609],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048421552,0.00013947983,0.000015768313,0.000010003817,0.000004391023,7.719401e-7,0.00026965814,0.00094647234,0.000042229003,0.0757312,0.008019274,0.9148159],"study_design_scores_gemma":[0.0008959955,0.00011637739,0.00023210558,0.000019386734,0.000003399215,0.0000030351018,0.000060837137,0.9908623,0.00010195564,0.0012251461,0.006295872,0.00018357107],"about_ca_topic_score_codex":0.0000057862794,"about_ca_topic_score_gemma":0.0000031127468,"teacher_disagreement_score":0.98991585,"about_ca_system_score_codex":0.00001900729,"about_ca_system_score_gemma":0.00004970071,"threshold_uncertainty_score":0.46700886},"labels":[],"label_agreement":null},{"id":"W2028848110","doi":"10.1002/dac.871","title":"An extended core‐based framework for delay‐constrained group communication","year":2007,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Distributed computing; Quality of service; Core (optical fiber); Modular design; Set (abstract data type); Span (engineering); Communication in small groups; Domain (mathematical analysis); Transmission (telecommunications); Software deployment; Routing (electronic design automation); Tree (set theory); Space (punctuation); Computer network; Telecommunications; Mathematics","score_opus":0.03197030761918498,"score_gpt":0.3356395474473564,"score_spread":0.30366923982817146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028848110","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055786194,0.00220336,0.9878069,0.0023609176,0.0012105893,0.00029542184,0.00000687684,0.00008332753,0.00045395063],"genre_scores_gemma":[0.7974875,0.00011341075,0.20164299,0.00042330046,0.0002588394,0.000020691457,0.00002672861,0.000011987873,0.000014543402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976082,0.00029603616,0.001078717,0.00016248935,0.000654247,0.00020032539],"domain_scores_gemma":[0.9935975,0.0018136965,0.0012836425,0.0011447055,0.0019997195,0.00016072625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003505746,0.00015081973,0.00026247054,0.00031317657,0.00018496858,0.00037772654,0.004257467,0.0001358214,0.000007718781],"category_scores_gemma":[0.0002098462,0.00014344907,0.00016608655,0.00021677864,0.00010007183,0.0008402422,0.000092597875,0.0003475511,0.0000056157687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018424823,0.00024606378,0.0002507147,0.0000028543643,0.000120878794,0.0000062200797,0.00033130546,0.0067367614,0.00021080328,0.86561406,0.00027591613,0.12602016],"study_design_scores_gemma":[0.0035053047,0.00048158472,0.0022773212,0.00063410716,0.000047353828,0.0002859023,0.0006801633,0.9121285,0.00013792937,0.036267027,0.043157812,0.00039700506],"about_ca_topic_score_codex":0.000016088876,"about_ca_topic_score_gemma":0.000018750561,"teacher_disagreement_score":0.90539175,"about_ca_system_score_codex":0.00015475429,"about_ca_system_score_gemma":0.00014977367,"threshold_uncertainty_score":0.79115045},"labels":[],"label_agreement":null},{"id":"W2030218354","doi":"10.1080/10241230215282","title":"Systems approach to modeling the Token Bucket algorithm incomputer networks","year":2002,"lang":"en","type":"article","venue":"Mathematical Problems in Engineering","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Dimensioning; Computer science; Token bucket; Quality of service; Security token; Multiplexer; Leaky bucket; Computer network; Construct (python library); Algorithm; Multiplexing; Node (physics); Traffic policing; Real-time computing; Distributed computing; Traffic shaping; Network traffic control; Engineering; Network packet","score_opus":0.017409177408571317,"score_gpt":0.1834947560871378,"score_spread":0.1660855786785665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030218354","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010680009,0.00051236205,0.99661756,0.00027467948,0.0002953886,0.0005319675,2.8407547e-7,0.00029513836,0.0013658107],"genre_scores_gemma":[0.875452,0.000009725363,0.123815246,0.00013114772,0.00023725227,0.00023940582,4.855829e-7,0.000022403912,0.00009235358],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984684,0.000042548385,0.00042661742,0.0003331501,0.00026583913,0.00046341852],"domain_scores_gemma":[0.9991441,0.00017827553,0.000032041073,0.00048721174,0.000033046075,0.00012532694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006027825,0.00019972351,0.0002662497,0.0000955883,0.00006405595,0.00025468788,0.0008571343,0.00008671135,0.000004085921],"category_scores_gemma":[0.000026039641,0.00014471459,0.0000546094,0.0004892165,0.000011398039,0.00018471037,0.0002237564,0.0003389217,0.000044530825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.6591801e-7,0.000047579917,0.000001095714,0.000046571764,0.000009902884,0.0000020648772,0.00046967613,0.92507803,8.531498e-7,0.042250253,0.00019450321,0.03189931],"study_design_scores_gemma":[0.00016652938,0.000014353669,7.8666545e-7,0.00014705208,0.0000037180862,0.000030151123,0.000012239596,0.99828506,2.425604e-7,0.0008749623,0.00027709213,0.00018780994],"about_ca_topic_score_codex":0.0000035621028,"about_ca_topic_score_gemma":1.7141683e-7,"teacher_disagreement_score":0.8753452,"about_ca_system_score_codex":0.000051778836,"about_ca_system_score_gemma":0.000004513766,"threshold_uncertainty_score":0.59012896},"labels":[],"label_agreement":null},{"id":"W2030287458","doi":"10.1002/dac.619","title":"Traffic locality characteristics in a parallel forwarding system","year":2003,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Locality; Locality of reference; Workload; Cache; Scheduling (production processes); Distributed computing; Network packet; Hash function; Computer network; Operating system; Computer security","score_opus":0.01592788469930162,"score_gpt":0.25577128645719216,"score_spread":0.23984340175789054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030287458","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065062635,0.0027129184,0.92488366,0.0012576521,0.0028937636,0.00021165154,0.000002322995,0.000067509885,0.002907912],"genre_scores_gemma":[0.9959022,0.00018590577,0.0036746853,0.00006405227,0.00010860436,0.000011922033,0.0000017851569,0.000006481529,0.000044394685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997586,0.00061138574,0.0010130623,0.00011574302,0.0005347452,0.00013906175],"domain_scores_gemma":[0.9976531,0.0002874538,0.00081620767,0.0004470357,0.0007188273,0.00007735942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019986448,0.00010648958,0.00029319947,0.00023618959,0.000053613534,0.00026467277,0.0017251999,0.000063546584,0.0000026432915],"category_scores_gemma":[0.00012540663,0.00009800489,0.00010327526,0.0002017726,0.000028753971,0.0004963532,0.00006532,0.0002547257,0.000014349555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006562321,0.0002124338,0.005032126,0.00001636909,0.00020769288,0.00008515243,0.001000222,0.107648,0.00002432804,0.80778325,0.00049115974,0.07743367],"study_design_scores_gemma":[0.0027534554,0.00007460691,0.0037085144,0.0010011422,0.00001934004,0.00099616,0.0011875,0.9365033,0.000011657989,0.00034399543,0.053101424,0.00029891552],"about_ca_topic_score_codex":0.000011089611,"about_ca_topic_score_gemma":0.000004750974,"teacher_disagreement_score":0.93083954,"about_ca_system_score_codex":0.0002636617,"about_ca_system_score_gemma":0.00015240106,"threshold_uncertainty_score":0.39965236},"labels":[],"label_agreement":null},{"id":"W2030770841","doi":"10.1109/aina.2014.55","title":"Efficient Hashing for Dynamic Per-Flow Network-Interface Selection","year":2014,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Network interface; Network packet; Wireless network; Distributed computing; Latency (audio); Hash function; Radio access network; Wireless; Operating system","score_opus":0.005702467395451329,"score_gpt":0.22440364514764494,"score_spread":0.2187011777521936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030770841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051932223,0.00007544127,0.99002224,0.0015864538,0.00091569696,0.00024682895,3.0323758e-7,0.0004578516,0.0015019526],"genre_scores_gemma":[0.86630726,0.0000012827753,0.13148177,0.00042589667,0.00023517112,0.000036308124,0.0000010191886,0.000009041556,0.0015022601],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888545,0.00005968558,0.00017731168,0.00036460074,0.0001412802,0.0003716921],"domain_scores_gemma":[0.999316,0.0002142671,0.00005844124,0.00023811075,0.000093040086,0.000080183156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004802972,0.0001251102,0.00013939591,0.00003644622,0.0002283894,0.0001848733,0.00039726478,0.000056167184,0.000023573251],"category_scores_gemma":[0.000025620871,0.00011017063,0.00007953063,0.00017407695,0.000016251914,0.00008538888,0.000061164406,0.00009728998,0.000067474895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073575434,0.000015950416,0.00001992809,0.0000028837692,0.0000075018042,6.264698e-8,0.00004156506,0.6325423,0.000053661868,0.024544455,0.0019664173,0.3407979],"study_design_scores_gemma":[0.0004162586,0.000109013796,0.000093842726,0.000012302611,0.000006891802,0.0000058868814,0.0000048385423,0.9846806,0.000026628648,0.0005562902,0.013944758,0.00014272102],"about_ca_topic_score_codex":0.0000037679379,"about_ca_topic_score_gemma":0.00004396943,"teacher_disagreement_score":0.861114,"about_ca_system_score_codex":0.000047981946,"about_ca_system_score_gemma":0.000028865903,"threshold_uncertainty_score":0.4492628},"labels":[],"label_agreement":null},{"id":"W2030959293","doi":"10.1016/s0305-0548(03)00201-6","title":"Integrating reliability and quality of service in networks with switched virtual circuits","year":2003,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Polytechnique Montréal","funders":"","keywords":"Dimensioning; Computer science; Quality of service; Multiprotocol Label Switching; Routing (electronic design automation); Network packet; Reliability (semiconductor); Computer network; Circuit switching; Traffic engineering; Packet switching; Minification; Service (business); Distributed computing; Engineering","score_opus":0.05618302684892752,"score_gpt":0.3333677354405418,"score_spread":0.2771847085916143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030959293","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31923223,0.000105303756,0.67901146,0.00092009275,0.0000728319,0.00029871118,5.686868e-7,0.00003349693,0.00032528155],"genre_scores_gemma":[0.9765135,0.000015011995,0.02315162,0.00019460334,0.00002807978,0.00004395289,0.0000024902731,0.0000066351517,0.00004409523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99719936,0.0011270045,0.000412457,0.00048198472,0.00042466095,0.00035453276],"domain_scores_gemma":[0.9976955,0.0008797933,0.000033907912,0.00056384294,0.00070774695,0.000119176824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032256548,0.00012321543,0.00024752482,0.000175055,0.00023650393,0.00021636687,0.0005173736,0.000074508316,0.0000059089166],"category_scores_gemma":[0.0002462686,0.0001038126,0.000022779543,0.0014964754,0.00014064052,0.00038383494,0.00015457658,0.00048850506,0.0000030210826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020332951,0.00017543201,0.005126304,0.000024315339,0.000017630688,0.0000048534794,0.0019124637,0.57201165,0.00028329223,0.2980765,0.000065386215,0.12228183],"study_design_scores_gemma":[0.00078827265,0.00016518502,0.006809783,0.000069400325,0.000001389346,0.0000052952014,0.0002776993,0.9914428,0.00006725466,0.00016080588,0.00008322175,0.00012890087],"about_ca_topic_score_codex":0.00037253764,"about_ca_topic_score_gemma":0.0020468128,"teacher_disagreement_score":0.6572813,"about_ca_system_score_codex":0.00006575895,"about_ca_system_score_gemma":0.00030337324,"threshold_uncertainty_score":0.4233355},"labels":[],"label_agreement":null},{"id":"W2032193947","doi":"10.1109/ccece.2006.277282","title":"Red Performance Evaluation using Stochastic Modelling and Fluid-Based Analysis","year":2006,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Random early detection; Queue; Computer science; Jitter; Queueing theory; Active queue management; Stochastic modelling; Drop (telecommunication); Stochastic differential equation; Simulation; Mathematical optimization; Algorithm; Applied mathematics; Network congestion; Computer network; Mathematics; Telecommunications; Statistics; Network packet","score_opus":0.026231866441637837,"score_gpt":0.23755372133353111,"score_spread":0.21132185489189328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032193947","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27370858,0.00009734718,0.7256763,0.00011113524,0.00003813354,0.000083363615,1.3997679e-7,0.00006627073,0.00021874606],"genre_scores_gemma":[0.9480059,0.0000010660164,0.051817026,0.000066531065,0.00004533478,0.000007300886,0.000003061009,0.0000028822728,0.000050864255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914455,0.00004412196,0.0001578301,0.00024536598,0.00026335893,0.00014479535],"domain_scores_gemma":[0.999534,0.00005161242,0.00004879313,0.00020845702,0.00012239105,0.00003472231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038963344,0.00008018056,0.00011381798,0.00014936009,0.00012782955,0.00009680281,0.0001292827,0.000030066873,0.000016344418],"category_scores_gemma":[0.0000036450929,0.000073227995,0.000040034065,0.00057437096,0.000017018667,0.00022236102,0.000018968727,0.00003902925,0.0000024269648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031931093,0.0000088568695,0.00023348884,0.0000011043264,0.000017156155,1.966323e-7,0.000008266043,0.9658166,0.00004219259,0.0011642709,0.000010655967,0.03269402],"study_design_scores_gemma":[0.0003326247,0.00001290811,0.0005612684,0.0000056628296,0.00015468475,7.873823e-7,0.000001828105,0.9986,0.00003515339,0.0001931798,0.0000071534773,0.00009476418],"about_ca_topic_score_codex":0.000046403547,"about_ca_topic_score_gemma":0.000014614655,"teacher_disagreement_score":0.67429733,"about_ca_system_score_codex":0.000031814034,"about_ca_system_score_gemma":0.000057753987,"threshold_uncertainty_score":0.2986151},"labels":[],"label_agreement":null},{"id":"W2032549130","doi":"10.1109/cdc.2011.6161435","title":"A distributed guaranteed cost congestion control strategy for mobile networks with differentiated services traffic","year":2011,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Network topology; Network congestion; Markov process; Computer network; Controller (irrigation); Distributed computing; Mobile telephony; Mobile radio","score_opus":0.016054723035518758,"score_gpt":0.21390064098354428,"score_spread":0.19784591794802553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032549130","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05737494,0.00019063172,0.93936783,0.00007279137,0.00024110558,0.0017245925,0.00003968562,0.00073855894,0.00024988665],"genre_scores_gemma":[0.99691087,0.000011479093,0.0016180171,0.00035001448,0.00008835878,0.00079489395,0.00009199382,0.000021194259,0.000113168666],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982141,0.000093035065,0.00036283303,0.00056245923,0.00019967036,0.0005678883],"domain_scores_gemma":[0.9987206,0.00017822157,0.0001842303,0.0004563496,0.0002759827,0.0001846582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019783377,0.00031231888,0.00037672292,0.0000661491,0.00020001257,0.00020896827,0.0007048632,0.00014785734,0.000070131595],"category_scores_gemma":[0.0000034807522,0.00023086839,0.00010228423,0.00035005884,0.00007390036,0.00036148593,0.000033091343,0.0001573613,0.000014061531],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017085947,0.00080183876,0.0013910845,0.00006410237,0.0005093084,0.000042165204,0.0004777525,0.57564026,0.000038397793,0.0402632,0.00073420146,0.3783291],"study_design_scores_gemma":[0.004906596,0.0007926701,0.0032328086,0.000042855238,0.000085564825,0.000023982291,0.0001035228,0.98981285,0.000019269068,0.00008583633,0.00055080774,0.0003432471],"about_ca_topic_score_codex":0.000030648785,"about_ca_topic_score_gemma":0.00023656126,"teacher_disagreement_score":0.9395359,"about_ca_system_score_codex":0.000029127485,"about_ca_system_score_gemma":0.00006169022,"threshold_uncertainty_score":0.941454},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0065303647479592695,"score_gpt":0.19690231788517518,"score_spread":0.19037195313721592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032667132","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00049175,0.00015265096,0.9765111,0.0010039133,0.0010393109,0.0006990068,6.1577526e-7,0.00047689362,0.019624764],"genre_scores_gemma":[0.9297339,0.00004109612,0.062720895,0.0059176553,0.0010188427,0.00015681486,0.0000038241888,0.00002025501,0.0003867516],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979204,0.00016275153,0.00028084777,0.0007276008,0.00027470003,0.0006337283],"domain_scores_gemma":[0.9986088,0.0001350401,0.00007839895,0.00081545237,0.00007549702,0.00028677552],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002906722,0.00027800427,0.00030631103,0.00012351056,0.00017175803,0.00027161895,0.0013631317,0.00009748639,0.000013084583],"category_scores_gemma":[0.0000023022646,0.00025250443,0.00012274834,0.0006612778,0.000049839728,0.00022080287,0.00034712788,0.00024397607,0.00011634039],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035172987,0.000081504135,0.00003917796,0.0000029987852,0.000062446416,0.00003414153,0.00009788043,0.23215608,1.3625898e-7,0.23233777,0.0056691975,0.5294835],"study_design_scores_gemma":[0.0010864541,0.00009466722,0.0010710094,0.000029566947,0.000022274677,0.000049076614,0.0000078625435,0.9738289,4.5578741e-7,0.0014609033,0.022047086,0.00030172695],"about_ca_topic_score_codex":0.0000028117945,"about_ca_topic_score_gemma":0.000001199013,"teacher_disagreement_score":0.92924213,"about_ca_system_score_codex":0.000059965314,"about_ca_system_score_gemma":0.000015670676,"threshold_uncertainty_score":0.9999927},"labels":[],"label_agreement":null},{"id":"W2033294469","doi":"10.6000/1927-5129.2013.09.02","title":"A Quantitative Analysis of Firewall Impact on Critical Data Communication","year":2013,"lang":"en","type":"article","venue":"Journal of Basic & Applied Sciences","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Firewall (physics); Computer science; Computer network; The Internet; Application firewall; Bandwidth (computing); Data transmission; Database; Stateful firewall; Operating system; Network packet","score_opus":0.05577091170414284,"score_gpt":0.34964596970681194,"score_spread":0.2938750580026691,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033294469","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63710856,0.000868575,0.35127348,0.0073075974,0.00021612526,0.00019791744,0.000010318452,0.000027355158,0.0029900544],"genre_scores_gemma":[0.96734947,0.0000312685,0.032357827,0.00022501564,0.000025140447,0.0000024199712,0.0000011895561,0.0000018203534,0.000005840085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984213,0.00013051994,0.00046419736,0.00020906226,0.00059614907,0.00017873594],"domain_scores_gemma":[0.9969933,0.0015668096,0.00042845137,0.00064625556,0.0002583555,0.000106847896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018291674,0.00009540524,0.00033782123,0.00035291805,0.00014751745,0.0001887695,0.0026757864,0.000035366862,0.000075365664],"category_scores_gemma":[0.00017557474,0.000061766186,0.00012013266,0.0014702759,0.00036912286,0.0008071297,0.00017949952,0.00018441657,0.000015878188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000120080185,0.0006610263,0.0018438975,0.000011345513,0.0010723263,0.000006052018,0.003459694,0.038114298,0.0023507038,0.6136143,0.009447851,0.3292984],"study_design_scores_gemma":[0.00022574865,0.00048279754,0.009599714,0.000030878386,0.00016580356,0.0000052293294,0.00035257818,0.98187184,0.00006375479,0.0070316857,0.00006924037,0.00010071849],"about_ca_topic_score_codex":0.000029681376,"about_ca_topic_score_gemma":0.000010524584,"teacher_disagreement_score":0.94375753,"about_ca_system_score_codex":0.000023928049,"about_ca_system_score_gemma":0.00018294458,"threshold_uncertainty_score":0.49723214},"labels":[],"label_agreement":null},{"id":"W2033884769","doi":"10.1504/ijcat.2003.000314","title":"A collaboration model for better reliability and performance for object-based distributed applications over the Internet","year":2003,"lang":"en","type":"article","venue":"International Journal of Computer Applications in Technology","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Networks of Centres of Excellence of Canada; Canadian Institutes of Health Research; Tyson","keywords":"Computer science; Reliability (semiconductor); The Internet; Distributed computing; Computer network; Transmission (telecommunications); Convergence (economics); Quality of service; Channel (broadcasting); Object (grammar); Buffer overflow; Telecommunications; Operating system","score_opus":0.006618616772229657,"score_gpt":0.2527842017338664,"score_spread":0.24616558496163674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033884769","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0221645,0.00009780591,0.9693724,0.0072198124,0.0001560711,0.00091011485,0.000023184759,0.000043558986,0.000012585027],"genre_scores_gemma":[0.81102216,0.000014617447,0.18744782,0.00038611618,0.000081716506,0.0010210292,0.0000109682205,0.0000059499926,0.000009617664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989663,0.00002915146,0.00047213412,0.00023370428,0.00015807591,0.00014068055],"domain_scores_gemma":[0.9981775,0.00036748656,0.0003103425,0.00029722558,0.0008168942,0.000030537198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043734926,0.00011052183,0.0001596856,0.00025989726,0.00008299322,0.00010863109,0.0009644582,0.000098403034,9.927163e-7],"category_scores_gemma":[0.000041035928,0.000088034656,0.00006192262,0.00039081104,0.0001081363,0.0002178119,0.000058952897,0.0001645578,5.7017974e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000686849,0.00027203702,0.0048359795,0.000018681705,0.000071760915,4.3859745e-7,0.00014209266,0.08546762,0.000044570494,0.5454595,0.0017940531,0.36182457],"study_design_scores_gemma":[0.0010100494,0.00008868082,0.00058649154,0.000013725101,0.000010974023,0.000014908771,0.000010499572,0.92979616,0.00020402,0.03513503,0.03304526,0.000084197534],"about_ca_topic_score_codex":4.760046e-7,"about_ca_topic_score_gemma":0.00000564266,"teacher_disagreement_score":0.8443285,"about_ca_system_score_codex":0.00010543756,"about_ca_system_score_gemma":0.00016195346,"threshold_uncertainty_score":0.3589949},"labels":[],"label_agreement":null},{"id":"W2033970758","doi":"10.1109/icc.2012.6364692","title":"Traffic provisioning in a Future Internet","year":2012,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Quality of service; Computer science; Computer network; Router; The Internet; Internet traffic; Mobile QoS; Service provider; Service (business)","score_opus":0.0073254096362144385,"score_gpt":0.21235360476555817,"score_spread":0.20502819512934373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033970758","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35697532,0.0014798351,0.6168812,0.004880899,0.0023107033,0.0003009083,1.5346174e-7,0.000617016,0.016553955],"genre_scores_gemma":[0.98589253,0.000004615775,0.012395089,0.0004986031,0.00034625139,0.000012187646,3.482604e-7,0.0000032792416,0.00084707513],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934286,0.000035463723,0.00011952018,0.00013978075,0.00010066432,0.00026170633],"domain_scores_gemma":[0.9996815,0.000034114117,0.000022051785,0.00016986446,0.000012823195,0.0000796791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021629971,0.00007018413,0.000079670775,0.000057760295,0.000018161476,0.000055090575,0.0003188311,0.000040141484,0.00005694],"category_scores_gemma":[0.0000055122914,0.000054774253,0.00002677914,0.00021242918,0.000008071552,0.00043299442,0.00006152905,0.00010785271,0.00012046591],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025692866,0.00004764544,0.0009398599,0.0000014288889,0.000002446706,0.0000023413688,0.0007818407,0.0002310443,0.0000048485226,0.14862485,0.0024729199,0.8468882],"study_design_scores_gemma":[0.0008650541,0.00006323759,0.009503032,0.000030717812,0.000002979639,0.00003077943,0.00019975414,0.89415073,0.00004269806,0.00015257965,0.094663024,0.00029543086],"about_ca_topic_score_codex":0.0000033303377,"about_ca_topic_score_gemma":0.000018847704,"teacher_disagreement_score":0.89391965,"about_ca_system_score_codex":0.000017936532,"about_ca_system_score_gemma":0.000018419558,"threshold_uncertainty_score":0.22336292},"labels":[],"label_agreement":null},{"id":"W2034295499","doi":"10.1109/tnsm.2011.110911.110116","title":"Traffic Trend Estimation for Profit Oriented Capacity Adaptation in Service Overlay Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Network and Service Management","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Computer science; Kalman filter; Exponential smoothing; Smoothing; Bandwidth (computing); Real-time computing; Quality of service; Computer network; Distributed computing","score_opus":0.02787122135903765,"score_gpt":0.21180318619139935,"score_spread":0.18393196483236168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034295499","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015726326,0.000053241278,0.98043144,0.00090527354,0.00083803583,0.0010831469,0.000004580173,0.0002474703,0.00071049813],"genre_scores_gemma":[0.9539746,0.0001299113,0.0431973,0.0019459303,0.000077841185,0.00052786164,0.000011719705,0.000021243455,0.00011360074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827236,0.000096590025,0.00039431365,0.00056474033,0.000208978,0.00046303845],"domain_scores_gemma":[0.99919087,0.00010516588,0.00011896443,0.00038279855,0.000084097825,0.000118110336],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036693588,0.00026647229,0.00024093948,0.00017002557,0.00028527883,0.00008334318,0.0003254966,0.00011526945,0.000015675847],"category_scores_gemma":[5.767672e-7,0.00027294393,0.00006685692,0.00114002,0.000018122371,0.00041352084,0.000006462198,0.00019696367,0.000009272691],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011011963,0.00006716308,0.0000065334584,0.00004841481,0.000045832046,0.0000026453506,0.0010074043,0.6405094,2.9722688e-7,0.004944721,0.00007624751,0.35318118],"study_design_scores_gemma":[0.0015507384,0.00013726854,0.0008422401,0.000099713434,0.00007536504,0.0000032799023,0.00018375392,0.9957112,0.0000051971656,0.00035035732,0.0007661578,0.0002747231],"about_ca_topic_score_codex":0.00007390314,"about_ca_topic_score_gemma":0.0033591257,"teacher_disagreement_score":0.9382483,"about_ca_system_score_codex":0.0000632831,"about_ca_system_score_gemma":0.000018635617,"threshold_uncertainty_score":0.9999723},"labels":[],"label_agreement":null},{"id":"W2034555301","doi":"10.1109/pesmg.2013.6673027","title":"Queuing-theoretic modeling of a PMU communication network","year":2013,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Phasor measurement unit; Polling; Reliability (semiconductor); Network packet; Queueing theory; Phasor; Polling system; Telecommunications network; Markov chain; Network delay; Communications system; Computer network; Distributed computing; Set (abstract data type); Electric power system; Power (physics)","score_opus":0.0086537405920182,"score_gpt":0.19939628544828417,"score_spread":0.19074254485626596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034555301","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00988377,0.00032238365,0.97487116,0.0016167128,0.00007453145,0.00014068557,6.1694955e-8,0.00014076817,0.012949899],"genre_scores_gemma":[0.9298094,0.00004265609,0.06954714,0.0003282799,0.000028500308,0.000023738894,8.1754905e-7,0.000003756382,0.00021571422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932384,0.000074745556,0.00020243027,0.00012878318,0.00011031305,0.00015986327],"domain_scores_gemma":[0.99910516,0.000104699,0.000058814396,0.00056062156,0.00012407363,0.00004665722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022719384,0.00006537941,0.0001071204,0.000023005832,0.000065577246,0.00005909458,0.00064160494,0.00003527522,0.00009880654],"category_scores_gemma":[0.000010888017,0.000055410175,0.00003883736,0.00018098105,0.000033630433,0.00025016133,0.00012116455,0.00007462087,0.00010251844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010749368,0.000013115308,0.00007241686,0.0000024351425,0.0000067241326,6.170451e-8,0.000094948184,0.17328866,0.000012945583,0.7314195,0.0012679009,0.09382019],"study_design_scores_gemma":[0.00012442621,0.00001531202,0.000028637522,0.000020501551,0.0000025540587,9.631526e-7,0.00001645792,0.96123344,0.000007209565,0.038383722,0.00010415427,0.00006260908],"about_ca_topic_score_codex":0.000069418544,"about_ca_topic_score_gemma":0.000009303314,"teacher_disagreement_score":0.91992563,"about_ca_system_score_codex":0.000008362301,"about_ca_system_score_gemma":0.000023352417,"threshold_uncertainty_score":0.22595614},"labels":[],"label_agreement":null},{"id":"W2034644962","doi":"10.1145/1899396.1899399","title":"Modeling and simulation of SIP tandem server with finite buffer","year":2011,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Computer Simulation","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Server; Retransmission; Computer network; Distributed computing; Queueing theory; Upstream (networking); Real-time computing","score_opus":0.03960654247552595,"score_gpt":0.2371031194816948,"score_spread":0.19749657700616885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034644962","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19061764,0.000058442485,0.8089131,0.00005685198,0.00008367329,0.00013750132,9.4904243e-7,0.00011300689,0.000018833616],"genre_scores_gemma":[0.9387805,0.00002264095,0.06101132,0.00011382374,0.00003954616,0.000007111443,0.000001917097,0.0000123590235,0.000010794602],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988899,0.0000577984,0.0002934324,0.00038795095,0.00020430142,0.00016656687],"domain_scores_gemma":[0.9990728,0.00020329464,0.00006354677,0.00039727258,0.00018370188,0.00007940808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016390877,0.00017651245,0.00019516972,0.00013950122,0.0001928784,0.00006501702,0.00019473238,0.00009195506,0.0000043953905],"category_scores_gemma":[0.0000045047004,0.00015717429,0.000043761964,0.0001858659,0.000026946776,0.00050976546,0.000015591993,0.00014805586,0.0000014571164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053098047,0.00004512345,0.000047055273,0.000008728266,0.000027234639,7.261043e-7,0.0007438153,0.83964616,0.0000013647361,0.00040499485,9.0433495e-8,0.1590216],"study_design_scores_gemma":[0.00080641196,0.00021967317,0.00007408521,0.00006986971,0.000037839425,0.0000025224815,0.000016228048,0.99566936,0.000007944001,0.002912719,0.0000027463147,0.00018062379],"about_ca_topic_score_codex":0.000031520653,"about_ca_topic_score_gemma":0.000012261397,"teacher_disagreement_score":0.74816287,"about_ca_system_score_codex":0.000012588203,"about_ca_system_score_gemma":0.000023264489,"threshold_uncertainty_score":0.64093816},"labels":[],"label_agreement":null},{"id":"W2034906907","doi":"10.1145/2070562.2070581","title":"End-to-end transmission control by modeling uncertainty about the network state","year":2011,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"Division of Computer and Network Systems; National Science Foundation","keywords":"Subnetwork; Computer science; Computer network; Network packet; End-to-end principle; The Internet; State (computer science); Transmission (telecommunications); Internet protocol suite; Control (management); Telecommunications; Algorithm","score_opus":0.017537789824116152,"score_gpt":0.21261888232492618,"score_spread":0.19508109250081002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034906907","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025121735,0.0007961761,0.989155,0.002689702,0.00034005032,0.00036973425,0.000002902975,0.00029711946,0.0038371412],"genre_scores_gemma":[0.9864865,0.000060359587,0.007509515,0.004806221,0.00013635769,0.000049092763,0.0000014058364,0.0000125695915,0.00093798],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982027,0.00015904564,0.00032879767,0.00043486455,0.00031078834,0.0005638425],"domain_scores_gemma":[0.99894637,0.0001248874,0.000058877114,0.00052333897,0.000096049764,0.00025048945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064808514,0.00020368863,0.00021225153,0.000022242886,0.00030885567,0.000131504,0.0010440863,0.00005820321,0.00019481154],"category_scores_gemma":[0.0000069861667,0.00012580756,0.000101456935,0.00029599355,0.000039806113,0.00022262085,0.000060999395,0.0002078247,0.000083339044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058279613,0.00002911027,0.000033108226,0.0000015983584,0.00003177429,0.0000036241267,0.0009404976,0.34548128,0.0000337574,0.015913013,0.0053660558,0.6321079],"study_design_scores_gemma":[0.00063293986,0.00007187269,0.00004226179,0.00002090645,0.000013467435,0.00000316615,0.000018569179,0.97323084,0.000015627127,0.002924848,0.022835238,0.00019025574],"about_ca_topic_score_codex":0.00020159342,"about_ca_topic_score_gemma":0.000046511217,"teacher_disagreement_score":0.98397434,"about_ca_system_score_codex":0.000023272389,"about_ca_system_score_gemma":0.00007334905,"threshold_uncertainty_score":0.5130283},"labels":[],"label_agreement":null},{"id":"W2035342470","doi":"10.1109/infcom.2010.5462235","title":"Buffer Management for Aggregated Streaming Data with Packet Dependencies","year":2010,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Goodput; Computer science; Network packet; Computer network; Buffer overflow; Real-time computing; Packet loss; Competitive analysis; Distributed computing; Algorithm; Throughput; Wireless; Upper and lower bounds","score_opus":0.016637745104637,"score_gpt":0.23824593365181185,"score_spread":0.22160818854717484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035342470","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01437897,0.000025040561,0.97815794,0.0012870005,0.00030431992,0.00034208348,0.000006553138,0.00028489437,0.0052131796],"genre_scores_gemma":[0.8246105,0.000006258623,0.1716901,0.0002697059,0.00007946041,0.00003687642,0.000019838395,0.0000070365186,0.0032802417],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991161,0.000010153355,0.00009152028,0.00038901943,0.00016724905,0.00022593807],"domain_scores_gemma":[0.9987311,0.00008529595,0.00004160056,0.0010160807,0.000059685128,0.00006628753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019080433,0.00010280296,0.000091466194,0.000037149264,0.000104559986,0.00017070079,0.00119514,0.000033313972,0.0000331245],"category_scores_gemma":[0.0000089063315,0.000071682385,0.000016436114,0.00013129551,0.000027970373,0.00040725555,0.00026488214,0.00008658396,0.000019290728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011966628,0.0000360578,0.00018593967,0.0000074741965,0.00004460223,0.000011074495,0.000026316644,0.000040178453,0.000037374113,0.1551201,0.0055929045,0.838886],"study_design_scores_gemma":[0.0016617686,0.000113185466,0.0017231634,0.000028593047,0.000047167294,0.000029390918,0.000110706256,0.9179443,0.00025676214,0.001154363,0.07656433,0.00036628367],"about_ca_topic_score_codex":0.000009364549,"about_ca_topic_score_gemma":0.00033252095,"teacher_disagreement_score":0.91790414,"about_ca_system_score_codex":0.000004690486,"about_ca_system_score_gemma":0.000027236312,"threshold_uncertainty_score":0.2923123},"labels":[],"label_agreement":null},{"id":"W2036786089","doi":"10.1109/jcn.2009.6391334","title":"End-to-end quality of service constrained routing and admission control for MPLS networks","year":2009,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Multiprotocol Label Switching; Computer science; Computer network; End-to-end principle; Quality of service; End-to-end delay; Packet loss; Admission control; Network packet","score_opus":0.029095801548599316,"score_gpt":0.3049047324052127,"score_spread":0.2758089308566134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036786089","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008023646,0.0053400653,0.96920955,0.01686154,0.000109634195,0.00025573268,0.000003223597,0.000019714513,0.0001768721],"genre_scores_gemma":[0.9675365,0.0009330919,0.029082997,0.002277247,0.00014665718,0.0000050209414,0.0000020595837,0.0000050235685,0.000011399886],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846375,0.0002590775,0.00077569636,0.0001389804,0.00014964578,0.00021286799],"domain_scores_gemma":[0.99662584,0.0014457683,0.00066293636,0.0005875417,0.0004522184,0.0002256877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017244522,0.00013022988,0.00041587642,0.00007824919,0.0002640321,0.00010178297,0.00079136237,0.000097563556,0.0000031458057],"category_scores_gemma":[0.000080985534,0.00011080381,0.000088958695,0.0002769787,0.000072645154,0.00024237367,0.000115742776,0.0002922544,1.0590688e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016719029,0.0001049976,0.0005179335,0.000008085102,0.00007060201,7.662386e-7,0.00030110977,0.019813314,0.00015785766,0.079793006,0.0003268316,0.8987383],"study_design_scores_gemma":[0.0018977103,0.0003755786,0.0069340873,0.00016525168,0.00004932102,0.00004060617,0.000076993034,0.98666704,0.000003475315,0.0014861972,0.002168831,0.00013491137],"about_ca_topic_score_codex":0.0000071996838,"about_ca_topic_score_gemma":0.000023130538,"teacher_disagreement_score":0.96685374,"about_ca_system_score_codex":0.000014590561,"about_ca_system_score_gemma":0.000072351366,"threshold_uncertainty_score":0.45184484},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.038407457998326094,"score_gpt":0.26585589609081406,"score_spread":0.22744843809248796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038044579","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037928502,0.0022103502,0.9850994,0.01046783,0.00044297066,0.00057042553,0.000004143438,0.00071438856,0.00011120464],"genre_scores_gemma":[0.46753904,0.00004259267,0.5299668,0.0011318424,0.0010809547,0.00016305565,0.000020542364,0.000015807489,0.000039404327],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983704,0.00010481259,0.00045203423,0.00044452614,0.00015266615,0.0004755332],"domain_scores_gemma":[0.996505,0.0007519203,0.00012604207,0.0020629026,0.00040589581,0.00014819173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003186817,0.000233342,0.0002756696,0.00008723125,0.0006927909,0.00032104194,0.0033951493,0.000085038766,0.0000030581318],"category_scores_gemma":[0.00001592614,0.00023884405,0.00012313601,0.000510122,0.000077280725,0.0005009182,0.00072142447,0.00022915319,0.000051067822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028009047,0.0000729826,0.0000016533231,0.0000073299498,0.000021246504,9.386529e-8,0.00018759859,0.59707016,2.2479561e-7,0.023391798,0.0032993597,0.37594473],"study_design_scores_gemma":[0.00056790636,0.00007066027,0.000010147568,0.000063918465,0.000020525087,0.00001326043,0.0000032293406,0.97974026,2.4396672e-7,0.0011345854,0.018105272,0.00026997316],"about_ca_topic_score_codex":0.0000012434863,"about_ca_topic_score_gemma":0.00004422118,"teacher_disagreement_score":0.46715975,"about_ca_system_score_codex":0.00005174336,"about_ca_system_score_gemma":0.0001864889,"threshold_uncertainty_score":0.9739778},"labels":[],"label_agreement":null},{"id":"W2040378575","doi":"10.1016/j.comnet.2012.04.010","title":"Data uploading time estimation for CUBIC TCP in long distance networks","year":2012,"lang":"en","type":"article","venue":"Computer Networks","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Vedecká Grantová Agentúra MŠVVaŠ SR a SAV","keywords":"Computer science; Upload; TCP Westwood plus; Computer network; TCP global synchronization; Network packet; Compound TCP; Real-time computing; Transmission Control Protocol; Operating system","score_opus":0.020510824928984206,"score_gpt":0.255447522641036,"score_spread":0.23493669771205178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040378575","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00060599594,0.0031272462,0.9925126,0.00032422005,0.002446663,0.00054364454,0.00000453964,0.00034369656,0.00009140499],"genre_scores_gemma":[0.8849911,0.00005108447,0.11111159,0.00067664095,0.0027475057,0.00006802862,0.00018425078,0.00003183875,0.00013797432],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975852,0.00012598236,0.0004905822,0.00066867645,0.00020190464,0.00092765316],"domain_scores_gemma":[0.99767315,0.00056909554,0.00018662194,0.00129302,0.000057601297,0.00022052544],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001011389,0.00028380472,0.00036209822,0.000099441124,0.00018348172,0.00029369618,0.0018699167,0.00016856974,0.000010984746],"category_scores_gemma":[0.000018405672,0.00028938893,0.00007740795,0.0005503967,0.000045858174,0.001598555,0.0006437373,0.00031306082,0.00004242987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001149645,0.000050823935,0.0012184697,0.0000065893355,0.000015585152,0.0000031875345,0.00004241163,0.48732084,2.0972466e-7,0.0062858155,0.012095455,0.49294913],"study_design_scores_gemma":[0.00067912095,0.000034351273,0.0041200626,0.00011523299,0.000015214968,0.000014193978,9.4299463e-7,0.98869085,5.0804636e-7,0.0001589509,0.0058404044,0.00033017877],"about_ca_topic_score_codex":0.0000028600043,"about_ca_topic_score_gemma":0.000013823536,"teacher_disagreement_score":0.8843851,"about_ca_system_score_codex":0.000078245364,"about_ca_system_score_gemma":0.00002895852,"threshold_uncertainty_score":0.99995583},"labels":[],"label_agreement":null},{"id":"W2040863069","doi":"10.1007/s11235-013-9710-5","title":"An optimal dynamic resources partitioning auction model for virtual private networks","year":2013,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Computer science; Private network; Integer programming; Computer network; Quality of service; Bandwidth (computing); The Internet; Revenue; Profit (economics); Common value auction; Distributed computing; Mathematical optimization; Algorithm; Microeconomics","score_opus":0.014093821176280113,"score_gpt":0.246152479983199,"score_spread":0.2320586588069189,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040863069","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04612992,0.00045869398,0.95125216,0.0005305063,0.00028406727,0.0007310115,0.0000016721174,0.00049951754,0.00011242956],"genre_scores_gemma":[0.9710921,0.000051166633,0.02733316,0.00012628727,0.00012285319,0.0008752604,0.000042190346,0.000018554438,0.00033844935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854815,0.00023867136,0.00043100156,0.00031667645,0.00016373924,0.000301749],"domain_scores_gemma":[0.9980129,0.00016178262,0.00024915815,0.0012419147,0.0002201901,0.000114079296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056411535,0.00014893625,0.00019204585,0.00007835271,0.00044383528,0.00056136434,0.0012216906,0.00010996551,0.0000066143916],"category_scores_gemma":[0.000015447216,0.0001489776,0.000060276936,0.00020482334,0.00004401092,0.0010765635,0.00009741007,0.00016413972,0.000039188406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000728513,0.000035942176,0.000022968437,0.000004039874,0.000014316804,4.7397435e-8,0.00038714803,0.9096984,0.00007550984,0.016537301,0.00037238438,0.07284463],"study_design_scores_gemma":[0.0003375103,0.000091359354,0.00026389165,0.000028594393,0.000007449373,0.000006342927,0.00011433291,0.99722856,0.0000040285813,0.00021800373,0.0015235277,0.00017637757],"about_ca_topic_score_codex":0.000029084644,"about_ca_topic_score_gemma":0.00001152548,"teacher_disagreement_score":0.92496216,"about_ca_system_score_codex":0.000073092284,"about_ca_system_score_gemma":0.000030398769,"threshold_uncertainty_score":0.60751307},"labels":[],"label_agreement":null},{"id":"W2041478969","doi":"10.1145/967900.967980","title":"RED with Dynamic Thresholds for improved fairness","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Random early detection; Computer science; Router; Bandwidth (computing); Queue; Computer network; Active queue management; Fair share; Link (geometry); Distributed computing; Network packet; Network congestion; Economics","score_opus":0.00523024955688179,"score_gpt":0.2091188075231834,"score_spread":0.20388855796630162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041478969","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036991849,0.000030995943,0.98669356,0.0072494764,0.00016337147,0.0003168355,8.2789603e-7,0.00031766563,0.0015280731],"genre_scores_gemma":[0.90378,0.0000025081233,0.09448791,0.00059379794,0.000034625664,0.00006926837,0.000001956512,0.000007064541,0.0010228665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932146,0.0000058622772,0.00010270531,0.00027065293,0.00007830951,0.00022099762],"domain_scores_gemma":[0.9994764,0.000031616968,0.000034171455,0.00031894638,0.00007542735,0.00006344984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008500587,0.00009624366,0.00010673249,0.000028617344,0.000083579136,0.00008662411,0.0003997231,0.000038550246,0.0000055736627],"category_scores_gemma":[0.000003996072,0.00006822086,0.000038522663,0.00015436862,0.000024564955,0.00021829062,0.000032964566,0.000048612488,0.000008322782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082728104,0.00008608639,0.000038454913,0.000008633264,0.000040592287,0.0000055981454,0.00011757592,0.0099817915,0.00050826033,0.5204988,0.00045383512,0.46817762],"study_design_scores_gemma":[0.004294965,0.0004494306,0.00033613032,0.000020141011,0.0000129732725,0.000027430278,0.000025383059,0.97041404,0.00024528845,0.020089518,0.0037754143,0.00030927846],"about_ca_topic_score_codex":0.0000073425667,"about_ca_topic_score_gemma":0.00013253852,"teacher_disagreement_score":0.96043223,"about_ca_system_score_codex":0.000031214975,"about_ca_system_score_gemma":0.00008950115,"threshold_uncertainty_score":0.2781966},"labels":[],"label_agreement":null},{"id":"W2041545288","doi":"10.1145/2460782.2460787","title":"Continuous one-way available bandwidth change detection in high definition video conferencing","year":2013,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; RTP Control Protocol; Jitter; Bandwidth (computing); Network packet; Computer network; Real-time computing; Videoconferencing; Path (computing); Packet loss; Telecommunications","score_opus":0.033669711296779446,"score_gpt":0.19619541811833963,"score_spread":0.16252570682156017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041545288","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30963066,0.00024879145,0.65889037,0.0022574335,0.00093901425,0.0009664567,0.0000010644965,0.00071373966,0.026352482],"genre_scores_gemma":[0.9930016,0.00004108891,0.0047199596,0.0009981409,0.00015175437,0.000271511,0.000002768964,0.000008326586,0.00080486387],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987533,0.00008643539,0.00026196093,0.0003666012,0.00018703249,0.00034465877],"domain_scores_gemma":[0.9992839,0.000118439064,0.00007950224,0.00029832232,0.00012911687,0.00009071149],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00023922337,0.00013875673,0.00020434172,0.00013826962,0.00009028489,0.00023522414,0.00028174114,0.00009586299,0.00071635545],"category_scores_gemma":[0.00002447017,0.00013121244,0.000037935115,0.00034955752,0.000021555876,0.000922649,0.00006617723,0.00015706867,0.0017005227],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008707448,0.000082553044,0.0016073282,0.000009234617,0.000012336164,0.0000054180273,0.00022264865,0.000022495795,0.0012292264,0.05974922,0.0008634821,0.9361873],"study_design_scores_gemma":[0.0065443083,0.00076769537,0.11546642,0.0002785834,0.00003650432,0.00004682629,0.00020840342,0.8288762,0.008730209,0.03132093,0.006231593,0.0014923349],"about_ca_topic_score_codex":0.0019099455,"about_ca_topic_score_gemma":0.0008934171,"teacher_disagreement_score":0.934695,"about_ca_system_score_codex":0.000060030125,"about_ca_system_score_gemma":0.000030590916,"threshold_uncertainty_score":0.9990768},"labels":[],"label_agreement":null},{"id":"W2041747596","doi":"10.1016/j.comcom.2004.08.001","title":"TCP Prairie: a sender-only TCP modification based on adaptive bandwidth estimation in wired-wireless networks","year":2004,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Vedecká Grantová Agentúra MŠVVaŠ SR a SAV","keywords":"TCP Westwood plus; Computer science; TCP global synchronization; Burstiness; TCP Friendly Rate Control; CUBIC TCP; TCP acceleration; Computer network; Zeta-TCP; Compound TCP; HSTCP; TCP Westwood; H-TCP; Real-time computing; Network congestion; Network packet","score_opus":0.03000912760053793,"score_gpt":0.2631458857583733,"score_spread":0.23313675815783536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041747596","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016250183,0.00018361896,0.9809101,0.015264878,0.00028477618,0.0006095608,0.0000035777966,0.00044842146,0.0006700476],"genre_scores_gemma":[0.83693963,0.00003004203,0.16154167,0.0011574364,0.00007124074,0.00015862234,0.00006210152,0.000018398729,0.000020835372],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977921,0.00039509597,0.0005400793,0.00055359694,0.00033591822,0.0003831937],"domain_scores_gemma":[0.9959654,0.0005985084,0.00024804115,0.002847673,0.00019066807,0.00014970297],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045690328,0.00027938987,0.00029363198,0.00028299764,0.0003910985,0.00023037661,0.00239549,0.00015357463,0.000003114707],"category_scores_gemma":[0.000019928937,0.0002974043,0.0001075075,0.0010150633,0.00015299108,0.0005096853,0.00036372634,0.00046108154,0.000051035364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001239436,0.00030294433,0.00013402083,0.0000026057155,0.000010948399,0.0000025954607,0.00029414517,0.60303843,0.00000193297,0.14138208,0.00033258492,0.2544853],"study_design_scores_gemma":[0.0015730807,0.00014013475,0.0046029743,0.00014801367,0.000010445186,0.000009533149,0.000014314665,0.98908514,0.000006167564,0.0031997594,0.00091477594,0.00029565603],"about_ca_topic_score_codex":0.00004405527,"about_ca_topic_score_gemma":0.00026157717,"teacher_disagreement_score":0.83531463,"about_ca_system_score_codex":0.00026033292,"about_ca_system_score_gemma":0.00035287117,"threshold_uncertainty_score":0.9999478},"labels":[],"label_agreement":null},{"id":"W2042367266","doi":"10.1145/345867.345905","title":"Delay jitter performance of video traffic in a cellular wireless ATM network","year":2000,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Jitter; Computer science; Time division multiple access; Computer network; Real-time computing; Frame (networking); Telecommunications","score_opus":0.005226622160742265,"score_gpt":0.17971541744059366,"score_spread":0.1744887952798514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042367266","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9682371,0.000263856,0.028048433,0.00048449254,0.00014846082,0.00014021403,2.496774e-7,0.00011549005,0.0025616838],"genre_scores_gemma":[0.9945086,0.000080677644,0.0030725903,0.0006044548,0.00013882632,0.000016784408,0.0000011038592,0.0000075614366,0.0015693887],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878275,0.00006338495,0.00032402595,0.0002987221,0.00016789566,0.00036323318],"domain_scores_gemma":[0.9993884,0.00007118868,0.000050218434,0.00038920582,0.00003197029,0.00006903625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026828714,0.00013467143,0.00021875401,0.000046037443,0.00004952994,0.000034741883,0.0005735556,0.000070689115,0.00037780273],"category_scores_gemma":[0.0000011588834,0.0001177723,0.00006306523,0.00047863618,0.000042032516,0.00026876005,0.000036517307,0.00013818468,0.00016306915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031508003,0.00005830239,0.0012819021,0.0000077751865,0.000009294696,0.0000107927035,0.00016988804,0.2120374,0.000045759214,0.002951544,0.0019424475,0.7814534],"study_design_scores_gemma":[0.0005802389,0.00008721076,0.0011520771,0.000043815933,0.0000035235366,0.000004750066,0.000003928369,0.9928849,0.00011549842,0.000036092813,0.0049281796,0.00015983109],"about_ca_topic_score_codex":0.000009172769,"about_ca_topic_score_gemma":0.000026813439,"teacher_disagreement_score":0.7812936,"about_ca_system_score_codex":0.00001808364,"about_ca_system_score_gemma":0.000045399083,"threshold_uncertainty_score":0.4802615},"labels":[],"label_agreement":null},{"id":"W2042973944","doi":"10.1109/4234.917106","title":"Credit-based processor sharing for decoupled delay and bandwidth allocation","year":2001,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Dynamic bandwidth allocation; Bandwidth (computing); Computer science; Processor sharing; Computer network; Bandwidth allocation; Channel allocation schemes; Telecommunications; Queueing theory; Wireless","score_opus":0.029587377245606967,"score_gpt":0.26967762565543313,"score_spread":0.24009024840982615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042973944","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04402839,0.00040186298,0.90799695,0.046700794,0.00015667385,0.00037959652,0.0000018449532,0.00020739897,0.0001264678],"genre_scores_gemma":[0.92853713,0.00009898912,0.06608678,0.004737183,0.00008072739,0.0003725241,0.00001735103,0.000011302156,0.000058026155],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913263,0.00004337024,0.0002204107,0.00028122787,0.00011220108,0.000210183],"domain_scores_gemma":[0.9980184,0.00036725926,0.00010064153,0.001314727,0.00012398763,0.000074983196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031048383,0.000115485156,0.000119947676,0.000092645074,0.0004146688,0.00018396275,0.0015064444,0.00004359687,0.0000025868064],"category_scores_gemma":[0.000038089678,0.0001194822,0.000043821663,0.00026724135,0.00008988791,0.00033040723,0.00010014992,0.00011344741,0.00000738954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001494516,0.00057731406,0.009842526,0.00011539827,0.00020857237,0.00000900524,0.0015315925,0.038826846,0.014228745,0.061866317,0.027531404,0.8451128],"study_design_scores_gemma":[0.00082068954,0.000027002088,0.00061594736,0.000031815744,0.000018641147,0.000008991357,0.000008137003,0.9777461,0.00010842213,0.0003071631,0.020142691,0.00016438594],"about_ca_topic_score_codex":0.000013757275,"about_ca_topic_score_gemma":0.00008318257,"teacher_disagreement_score":0.93891925,"about_ca_system_score_codex":0.000037097005,"about_ca_system_score_gemma":0.00004871023,"threshold_uncertainty_score":0.48723426},"labels":[],"label_agreement":null},{"id":"W2043792180","doi":"10.1145/500141.500232","title":"Preemptive bandwidth allocation protocol for multicast, multi-streams environments","year":2001,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Multicast; Computer network; Distributed computing; Bandwidth (computing); Quality of service; Bandwidth allocation; Dynamic bandwidth allocation","score_opus":0.03983194374233219,"score_gpt":0.3053963249487521,"score_spread":0.2655643812064199,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043792180","genre_codex":"methods","genre_gemma":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012223273,0.0000024336389,0.92958456,0.00053269975,0.000057435824,0.0687286,9.4121134e-7,0.00013425278,0.0008368324],"genre_scores_gemma":[0.18151161,0.000002473097,0.24013068,0.000668749,0.00019057913,0.5639964,0.0000053287445,0.000019358753,0.01347485],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989968,0.00003602221,0.00019012734,0.00036429142,0.00015516563,0.0002576065],"domain_scores_gemma":[0.99937737,0.0000895457,0.000068918955,0.0003328669,0.000033709835,0.000097598844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013698773,0.00013274404,0.00010898114,0.000033916418,0.00010490854,0.00007319231,0.00038023866,0.00005582627,0.00005449955],"category_scores_gemma":[0.000017485198,0.00010968324,0.000057038513,0.00009512809,0.000030327483,0.0003149252,0.000056901245,0.000054579217,0.00009442594],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082216015,0.00047626733,0.0010001346,0.000007510432,0.000030938332,0.000003638598,0.000173504,0.0015637472,0.00030193728,0.012744506,0.0013936188,0.98222196],"study_design_scores_gemma":[0.0034006005,0.00015653444,0.0014907996,0.000012481214,0.0000051940333,0.000004042869,0.000011510661,0.9073562,0.00042986393,0.00013865711,0.08682897,0.00016516923],"about_ca_topic_score_codex":0.0000058022715,"about_ca_topic_score_gemma":0.000011507123,"teacher_disagreement_score":0.9820568,"about_ca_system_score_codex":0.000036809928,"about_ca_system_score_gemma":0.000027341703,"threshold_uncertainty_score":0.44727528},"labels":[],"label_agreement":null},{"id":"W2044353310","doi":"10.1109/wcnc.2010.5506357","title":"Boundedness of Heterogeneous TCP Flows with Multiple Bottlenecks","year":2010,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Waterloo","funders":"","keywords":"Active queue management; Correctness; Computer science; Network congestion; Queueing theory; TCP Friendly Rate Control; TCP global synchronization; Transmission Control Protocol; Throughput; Queue; Flow (mathematics); Computer network; Flow control (data); Stability (learning theory); Distributed computing; Network packet; Mathematics; Algorithm; Telecommunications","score_opus":0.005146191950179503,"score_gpt":0.19208913998514276,"score_spread":0.18694294803496325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044353310","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43229452,0.000029525592,0.5640753,0.0003629785,0.00052805844,0.00012369103,9.935218e-7,0.00018322612,0.0024016974],"genre_scores_gemma":[0.96415114,0.0000018127411,0.03508782,0.00020921635,0.00006827418,0.000013098493,6.869712e-7,0.0000067333385,0.00046122997],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991846,0.000018927329,0.00015638005,0.00024751958,0.00019360273,0.00019895508],"domain_scores_gemma":[0.99914587,0.00008866698,0.000059248,0.0005107553,0.00010163359,0.00009383604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010449166,0.00010604102,0.00014622863,0.00003874689,0.00006160683,0.000060969647,0.00054345914,0.000055905657,0.00007471706],"category_scores_gemma":[0.000011989573,0.000076530625,0.000044758286,0.00015327534,0.00005564878,0.00015166149,0.00006584793,0.00012484049,0.000029045888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007943813,0.0002910067,0.0061702114,0.000018110204,0.00009050389,0.000049980536,0.0003870071,0.007283158,0.009637971,0.08692108,0.0009518505,0.8881197],"study_design_scores_gemma":[0.001429647,0.00021261485,0.0009691755,0.0000123335885,0.000011801412,0.000104563514,0.000013897169,0.9748247,0.0072716735,0.0005271195,0.014322084,0.00030033718],"about_ca_topic_score_codex":0.000030957195,"about_ca_topic_score_gemma":0.00071176334,"teacher_disagreement_score":0.9675416,"about_ca_system_score_codex":0.0000044977687,"about_ca_system_score_gemma":0.00006765252,"threshold_uncertainty_score":0.31208283},"labels":[],"label_agreement":null},{"id":"W2044884901","doi":"10.1016/j.comcom.2004.07.003","title":"Proportional loss rate differentiation in a FIFO queue","year":2004,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Computer science; FIFO (computing and electronics); Queue; Real-time computing; Computer network; Operating system","score_opus":0.018645383823527078,"score_gpt":0.2462081777786052,"score_spread":0.22756279395507814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044884901","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021702297,0.0002408818,0.962068,0.014909401,0.00024524122,0.00024510385,0.0000017095044,0.00022053877,0.00036678105],"genre_scores_gemma":[0.9185224,0.000078288605,0.080551036,0.00061240885,0.000074286894,0.00008207117,0.000029466366,0.0000064388955,0.00004359981],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890405,0.00016681511,0.00032589887,0.00025880724,0.00013851318,0.00020590742],"domain_scores_gemma":[0.99812627,0.00012899603,0.000106441454,0.001460408,0.00010877462,0.00006911002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002416349,0.00012017247,0.00013986907,0.00012905269,0.00019223006,0.00013836255,0.0017714523,0.000054349846,0.000007291552],"category_scores_gemma":[0.000011891009,0.00012107878,0.00005868792,0.00044631166,0.00008120309,0.0003812569,0.00052854785,0.00022926246,0.00008494262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008034507,0.0005561448,0.0025867254,0.00000729054,0.000027314865,0.000010187857,0.00072888157,0.02933658,0.000054874086,0.7948271,0.00038655676,0.17147031],"study_design_scores_gemma":[0.0015650849,0.000046534326,0.08366165,0.00008121456,0.0000070814517,0.00002398298,0.0000070414885,0.8768483,0.000032971206,0.03253331,0.004908413,0.00028445962],"about_ca_topic_score_codex":0.000023623965,"about_ca_topic_score_gemma":0.00018936516,"teacher_disagreement_score":0.8968201,"about_ca_system_score_codex":0.000099967576,"about_ca_system_score_gemma":0.00014854905,"threshold_uncertainty_score":0.49374494},"labels":[],"label_agreement":null},{"id":"W2045638017","doi":"10.1155/s1024123x04403019","title":"Access control for MPEG video applications using neural network and simulated annealing","year":2004,"lang":"en","type":"article","venue":"Mathematical Problems in Engineering","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Artificial neural network; Multiplexer; Simulated annealing; Security token; Real-time computing; Nonlinear system; Computer network; Artificial intelligence; Algorithm; Multiplexing; Telecommunications","score_opus":0.018985487631870194,"score_gpt":0.25417852202206676,"score_spread":0.23519303439019656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045638017","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008074497,0.00032001938,0.9901345,0.00027524043,0.0000730734,0.0008870493,0.0000010487746,0.00021420831,0.000020415204],"genre_scores_gemma":[0.94164675,0.0000034238296,0.057973698,0.00009176595,0.000112702604,0.00015123836,8.4719505e-7,0.000016873959,0.000002681397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989104,0.000011361007,0.00033812775,0.00027072424,0.00010348471,0.000365849],"domain_scores_gemma":[0.999249,0.00035747676,0.00005376698,0.0002102599,0.000039222232,0.000090314876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031825664,0.00014808081,0.00023904274,0.00006596409,0.00008168564,0.00017727578,0.00033661726,0.000068901696,0.0000012950866],"category_scores_gemma":[0.00004954719,0.00014306446,0.000041049952,0.0003125886,0.00001991216,0.00030606703,0.00007731788,0.000139636,0.0000013310287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017868476,0.000018269822,0.000039508188,0.00011318443,0.000010023032,0.000001113656,0.0000626123,0.92818576,0.00007285847,0.0671514,0.0000017757326,0.0043416834],"study_design_scores_gemma":[0.0009868612,0.000016656068,0.000023393146,0.0001495556,0.000010722515,0.00001076657,0.0000018775332,0.9561814,0.000008553715,0.042398516,0.000060815808,0.00015089689],"about_ca_topic_score_codex":0.0000035676994,"about_ca_topic_score_gemma":0.0000016089039,"teacher_disagreement_score":0.9335723,"about_ca_system_score_codex":0.00004474221,"about_ca_system_score_gemma":0.00001911027,"threshold_uncertainty_score":0.58339995},"labels":[],"label_agreement":null},{"id":"W2045700287","doi":"10.1016/s0140-3664(01)00433-9","title":"Weighted fair discard scheme for buffer management in the presence of network congestion","year":2002,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; University of Manitoba","funders":"","keywords":"Computer science; Scheme (mathematics); Buffer (optical fiber); Computer network; Network congestion; Congestion management; Telecommunications; Mathematics","score_opus":0.038657331286538844,"score_gpt":0.25708824016499876,"score_spread":0.21843090887845992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045700287","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00083921757,0.0015425872,0.9817152,0.012385144,0.00024868659,0.0008319377,0.0000025724148,0.00009776939,0.0023369032],"genre_scores_gemma":[0.72526187,0.00031920205,0.27345204,0.00046069463,0.00008919385,0.00028834178,0.000009501427,0.000005802092,0.00011335163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878,0.00026535807,0.00032527038,0.00022717613,0.00017125672,0.0002309515],"domain_scores_gemma":[0.99681914,0.0007806701,0.000117490716,0.0021478015,0.000100093464,0.00003479822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041300952,0.00011627978,0.00016037715,0.000064496795,0.00020828309,0.000088367684,0.003252474,0.000043941687,0.000005225818],"category_scores_gemma":[0.000007678891,0.00009285748,0.00008140635,0.00052182935,0.00011252404,0.00020757252,0.0005511843,0.00015475911,0.000012555812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038987046,0.00019518792,0.0002888571,0.000012529392,0.000040948944,9.569836e-7,0.00067738467,0.0029249093,0.0000016573248,0.56084603,0.017211163,0.4177965],"study_design_scores_gemma":[0.00048211246,0.000043704957,0.0030807662,0.000051988027,0.000012848856,0.0000033014726,0.000020669226,0.9545192,9.524557e-7,0.0044456115,0.03723425,0.000104568324],"about_ca_topic_score_codex":0.0000040511045,"about_ca_topic_score_gemma":0.000018656328,"teacher_disagreement_score":0.9515943,"about_ca_system_score_codex":0.000018986515,"about_ca_system_score_gemma":0.00000844762,"threshold_uncertainty_score":0.604396},"labels":[],"label_agreement":null},{"id":"W2046015044","doi":"10.1117/12.571650","title":"Parameter optimization in AQM controller design to support TCP traffic","year":2004,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Active queue management; Computer science; Network congestion; Controller (irrigation); TCP Friendly Rate Control; Control theory (sociology); PID controller; TCP tuning; Queue; Computer network; Control (management); Control engineering; Engineering; Network packet","score_opus":0.013258791053443495,"score_gpt":0.2215566420692004,"score_spread":0.2082978510157569,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046015044","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90504,0.000044120323,0.08704412,0.0060547986,0.00027469432,0.0009850954,0.000007113849,0.00014412007,0.00040591403],"genre_scores_gemma":[0.54776794,0.000027749795,0.45127723,0.0004057947,0.00017442918,0.00023517486,0.0000020062678,0.000030138975,0.00007952406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976486,3.196245e-8,0.00073822786,0.00049973035,0.0006424556,0.0004709512],"domain_scores_gemma":[0.9982774,0.00021097586,0.00026152926,0.0000728278,0.0010063277,0.00017092565],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00082817115,0.00030293426,0.0004390496,0.00017149436,0.00006496838,0.00019944215,0.0014128168,0.00017647399,0.000008217961],"category_scores_gemma":[0.00044456474,0.00026132065,0.0004107603,0.0006052529,0.00009706378,0.0007355604,0.00014506085,0.0002677468,0.0000043288546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016982024,0.00022625769,0.00004536945,0.00007509283,0.00021651492,3.9597867e-7,0.00047198118,0.4709833,0.023419134,0.49465203,0.0018012869,0.00793884],"study_design_scores_gemma":[0.0036233107,0.00075134187,0.00018812137,0.00022304615,0.00006375537,0.000018519693,0.0002508622,0.98243237,0.009646653,0.0015191612,0.000830599,0.00045223619],"about_ca_topic_score_codex":0.00000377941,"about_ca_topic_score_gemma":2.1234209e-7,"teacher_disagreement_score":0.5114491,"about_ca_system_score_codex":0.00020734915,"about_ca_system_score_gemma":0.00007547043,"threshold_uncertainty_score":0.9999839},"labels":[],"label_agreement":null},{"id":"W2046169472","doi":"10.1007/s11276-007-0028-7","title":"Quality of service in heterogeneous wired/wireless networks","year":2007,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Computer science; Computer network; Heterogeneous network; Wireless network; Wireless; Quality of service; Service quality; Telecommunications; Service (business)","score_opus":0.01649609967849788,"score_gpt":0.2563925517968861,"score_spread":0.2398964521183882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046169472","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29065025,0.0010053675,0.70593804,0.0003563889,0.000897756,0.00029206328,0.000001367466,0.00022277163,0.0006360122],"genre_scores_gemma":[0.9966248,0.000145879,0.0010995385,0.0014746065,0.0005123359,0.00002690858,0.000010629104,0.000035210014,0.00007005593],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960376,0.00030520736,0.0012624697,0.0007828963,0.00052654714,0.0010852782],"domain_scores_gemma":[0.99717414,0.00074569305,0.00047953363,0.0010866792,0.00023093462,0.0002830446],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00212621,0.00039569696,0.00075807166,0.0001765499,0.00012863382,0.0000939989,0.0015629504,0.0004124376,0.00001797098],"category_scores_gemma":[0.000014054348,0.00040605484,0.00018962228,0.0016437739,0.00010841765,0.00031123444,0.00033000752,0.00052401825,0.000010214316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014233292,0.00017688399,0.006540683,0.000025793046,0.000042974327,0.00006954798,0.00020238316,0.41165987,0.000052400344,0.02134579,0.00020172265,0.5595396],"study_design_scores_gemma":[0.0013058578,0.000058731777,0.011550986,0.00011181223,0.000008457377,0.000021595353,0.000034900735,0.98578495,0.00007217306,0.00024087407,0.00036204443,0.00044760405],"about_ca_topic_score_codex":0.00025497185,"about_ca_topic_score_gemma":0.0035581454,"teacher_disagreement_score":0.7059746,"about_ca_system_score_codex":0.00010035812,"about_ca_system_score_gemma":0.00007495368,"threshold_uncertainty_score":0.9998391},"labels":[],"label_agreement":null},{"id":"W2046472986","doi":"10.1002/dac.623","title":"On the effectiveness of alternative paths in QoS routing","year":2004,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Computer network; Equal-cost multi-path routing; Link-state routing protocol; Policy-based routing; Static routing; Multipath routing; Dynamic Source Routing; Routing (electronic design automation); Distributed computing; Bandwidth (computing); Routing protocol","score_opus":0.016316727683619588,"score_gpt":0.27163455531461234,"score_spread":0.25531782763099276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046472986","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42447126,0.0010559112,0.5647963,0.003809412,0.0023441184,0.0003335155,0.0000026346706,0.000019002882,0.003167815],"genre_scores_gemma":[0.9993447,0.00008815105,0.00037483402,0.00007811692,0.00009249795,0.00001097013,6.17051e-7,0.0000039277043,0.000006155574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796027,0.00084124785,0.000537684,0.00007680741,0.00050849037,0.00007550174],"domain_scores_gemma":[0.9962749,0.0020199006,0.0006656168,0.00035530564,0.0006588714,0.000025426736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00277982,0.00007303599,0.00017210445,0.00016107794,0.00003649768,0.00008657108,0.0020892923,0.000030222764,0.0000016127552],"category_scores_gemma":[0.00027200766,0.000050693598,0.00007625935,0.00016966059,0.0000417292,0.000277847,0.000108251676,0.00023186422,0.000005255805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007699595,0.00009181496,0.0004494861,0.0000018049462,0.000068427544,0.000007789136,0.00053803687,0.18855996,0.00013716343,0.8047783,0.0000156816,0.0052745547],"study_design_scores_gemma":[0.02285675,0.0014936514,0.06271468,0.019343952,0.000058849815,0.00079614314,0.0027503464,0.6293054,0.009509683,0.24611263,0.0040236576,0.0010342362],"about_ca_topic_score_codex":0.00007500614,"about_ca_topic_score_gemma":0.0000060550788,"teacher_disagreement_score":0.57487345,"about_ca_system_score_codex":0.00016613305,"about_ca_system_score_gemma":0.00010141746,"threshold_uncertainty_score":0.38824597},"labels":[],"label_agreement":null},{"id":"W2047587707","doi":"10.1109/mascots.2012.22","title":"MMPP Characterization of Web Application Traffic","year":2012,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Burstiness; Computer science; Provisioning; TRACE (psycholinguistics); Markovian arrival process; Context (archaeology); Markov process; Poisson distribution; Real-time computing; Queueing theory; Computer network; Mathematics; Statistics","score_opus":0.006765194173599514,"score_gpt":0.20230483879453767,"score_spread":0.19553964462093815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047587707","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20783098,0.000030055298,0.7893299,0.00042189323,0.00018005668,0.00010418939,5.475339e-7,0.00014538014,0.0019570189],"genre_scores_gemma":[0.9970557,0.0000073209926,0.0023558824,0.00016482695,0.00012259475,0.000018890538,0.000005420433,0.000002949675,0.0002663973],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952465,0.00002176078,0.00013278543,0.00009721463,0.00010247739,0.00012112543],"domain_scores_gemma":[0.99960756,0.000020397676,0.00006612753,0.0002123286,0.00004093382,0.000052622476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013924128,0.000050491908,0.00007127478,0.000035576795,0.000025546446,0.000014294369,0.0002115026,0.000030971893,0.000020598256],"category_scores_gemma":[0.000003018851,0.00004429925,0.000025126503,0.00019101385,0.000012124328,0.0003596466,0.000022551325,0.000029482613,0.00007619448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019710171,0.00006464161,0.00053562236,0.0000034030022,0.000004718056,3.5846888e-8,0.00008852804,0.000087669774,0.022306303,0.15879099,0.00009414721,0.81802195],"study_design_scores_gemma":[0.0003560999,0.000029361257,0.01640349,0.0000055774135,0.000007776668,0.0000042778825,0.000008843033,0.9613779,0.0024112142,0.00006148137,0.019187242,0.00014670272],"about_ca_topic_score_codex":4.9016484e-7,"about_ca_topic_score_gemma":6.438012e-7,"teacher_disagreement_score":0.96129024,"about_ca_system_score_codex":0.0000073328106,"about_ca_system_score_gemma":0.00001810742,"threshold_uncertainty_score":0.18064709},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.042888016401006916,"score_gpt":0.28834148263583076,"score_spread":0.24545346623482384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048384452","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043112357,0.16230221,0.815805,0.01824111,0.00040758983,0.00045601625,6.12412e-7,0.00040498853,0.0019513582],"genre_scores_gemma":[0.7354602,0.06585856,0.16941376,0.028691761,0.00032795142,0.00012808271,0.000020719943,0.00002339064,0.000075558026],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980264,0.0005785454,0.00048016393,0.00026054407,0.00028272747,0.00037162862],"domain_scores_gemma":[0.9949245,0.00050018897,0.00014314457,0.004117628,0.00012528423,0.00018925569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010877548,0.00021795942,0.0003608429,0.00006558255,0.0002576401,0.00010943823,0.0036959464,0.000059351332,0.00003527823],"category_scores_gemma":[0.0000735435,0.00019199689,0.00014273907,0.00036688926,0.000029819787,0.00061724643,0.0010998731,0.0003304648,0.00046369276],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002012732,0.00013382324,0.00008363144,0.00009405605,0.000024711779,4.2047103e-7,0.00013444989,0.0018703401,8.5847154e-7,0.087749936,0.0138743445,0.89603144],"study_design_scores_gemma":[0.0003854643,0.000056146484,0.00012085649,0.001862228,0.000030282672,0.00002298986,0.0000027975157,0.8095465,0.0000029118096,0.00091847486,0.1866944,0.00035700965],"about_ca_topic_score_codex":0.000006769035,"about_ca_topic_score_gemma":0.000001451763,"teacher_disagreement_score":0.8956744,"about_ca_system_score_codex":0.00004313238,"about_ca_system_score_gemma":0.000031590374,"threshold_uncertainty_score":0.78294057},"labels":[],"label_agreement":null},{"id":"W2048852017","doi":"10.1109/educon.2010.5492354","title":"Design of an introductory networking subject in advance of the European Higher Education Area: Challenges, experiences and open issues","year":2010,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Consortium canadien en neurodégénérescence associée au vieillissement; Cisco Systems","keywords":"Sketch; Subject (documents); Computer science; Field (mathematics); Quality (philosophy); Class (philosophy); Service (business); Multimedia; Engineering management; World Wide Web; Engineering; Artificial intelligence","score_opus":0.029881624910133294,"score_gpt":0.26664913372901017,"score_spread":0.23676750881887687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048852017","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8851257,0.021942811,0.038543947,0.008492673,0.007720147,0.0016716844,4.4835556e-7,0.00015231354,0.036350302],"genre_scores_gemma":[0.98942643,0.00017624795,0.009704163,0.00006320396,0.00022385408,0.000017436012,1.605919e-7,0.0000044458548,0.00038403753],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99905115,0.00031277153,0.00017995888,0.00024736254,0.0001026452,0.0001061055],"domain_scores_gemma":[0.9993055,0.00007387985,0.000109509616,0.00042589652,0.00005277835,0.0000324416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007232814,0.000075587275,0.00012764597,0.000031832667,0.000041584375,0.000046634363,0.0010011466,0.000023339797,0.000015913874],"category_scores_gemma":[0.000012213153,0.0000518313,0.000010984831,0.00015874604,0.00009167114,0.00043688252,0.00020443794,0.00009913193,4.373998e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000118910975,0.00010709984,0.0005973237,0.0000053082376,0.00000424363,4.8753714e-7,0.0047515444,0.00051964325,0.001170017,0.031469755,0.0002246547,0.961138],"study_design_scores_gemma":[0.005066815,0.0015761881,0.5181127,0.0009827068,0.000056253608,0.000074201904,0.01313258,0.29462007,0.0135008395,0.026349202,0.12412157,0.002406815],"about_ca_topic_score_codex":0.000043171134,"about_ca_topic_score_gemma":0.00012041848,"teacher_disagreement_score":0.95873123,"about_ca_system_score_codex":0.0000042158126,"about_ca_system_score_gemma":0.00006717743,"threshold_uncertainty_score":0.21136191},"labels":[],"label_agreement":null},{"id":"W2049024242","doi":"10.1016/j.automatica.2014.05.004","title":"Markovian jump guaranteed cost congestion control strategies for large scale mobile networks with differentiated services traffic","year":2014,"lang":"en","type":"article","venue":"Automatica","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Network congestion; Computer science; Markov process; Quality of service; Network traffic control; Jump; Mathematical optimization; Control (management); Computer network; Distributed computing; Control theory (sociology); Mathematics","score_opus":0.0035480493626202886,"score_gpt":0.20442591446152045,"score_spread":0.20087786509890015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049024242","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10499151,0.000121008816,0.8915514,0.0003321345,0.00031263803,0.0013802809,0.000014932807,0.00096969266,0.0003264418],"genre_scores_gemma":[0.9942995,0.000005741862,0.003908996,0.000766331,0.00016223323,0.0007012055,0.000037680693,0.000029155903,0.00008918251],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979628,0.00019193733,0.00040311803,0.000516435,0.00027888006,0.00064688444],"domain_scores_gemma":[0.9983785,0.00048710045,0.00021764556,0.0005727405,0.00017941407,0.00016457695],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045088996,0.00031536637,0.00046209132,0.0000858957,0.00031129763,0.0005283105,0.0007003959,0.00014813848,0.000032091444],"category_scores_gemma":[0.000008507159,0.0002486466,0.00010641642,0.00028988897,0.000065098604,0.00045149054,0.000043178254,0.00016244984,0.00003041743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005271158,0.00086868624,0.0011726387,0.00041344887,0.0004865264,0.000011482829,0.0020943813,0.42571208,0.00009550894,0.11410176,0.0019479723,0.4525684],"study_design_scores_gemma":[0.0041694306,0.00043707906,0.0029694596,0.00013121607,0.0000926657,0.00001182661,0.000212166,0.9889838,0.00000402531,0.00034074739,0.002319739,0.00032780945],"about_ca_topic_score_codex":0.000005042991,"about_ca_topic_score_gemma":0.00019011501,"teacher_disagreement_score":0.889308,"about_ca_system_score_codex":0.000027048121,"about_ca_system_score_gemma":0.000071568684,"threshold_uncertainty_score":0.9999966},"labels":[],"label_agreement":null},{"id":"W2050014989","doi":"10.1007/s11276-008-0123-4","title":"TCP CERL: congestion control enhancement over wireless networks","year":2008,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Vedecká Grantová Agentúra MŠVVaŠ SR a SAV","keywords":"TCP global synchronization; Zeta-TCP; TCP Friendly Rate Control; TCP Westwood; TCP Westwood plus; TCP Vegas; TCP acceleration; Compound TCP; Computer science; H-TCP; CUBIC TCP; Computer network; TCP tuning; Network congestion; Network packet","score_opus":0.00892784627774226,"score_gpt":0.20611534362937542,"score_spread":0.19718749735163316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050014989","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055202488,0.0018392131,0.93655986,0.0008628906,0.0029023506,0.0006834476,0.0000027663327,0.00074919657,0.0011977698],"genre_scores_gemma":[0.99231344,0.0012431236,0.0006918082,0.0025363893,0.0017619422,0.00023167624,0.000025744741,0.00005908564,0.0011368035],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956823,0.00034808897,0.0008255695,0.0011282959,0.0007204719,0.0012952688],"domain_scores_gemma":[0.99725455,0.00045036356,0.00041506797,0.0011753695,0.00024000842,0.00046466853],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005472804,0.0006128252,0.0007671103,0.00013298437,0.0006941564,0.00022881961,0.0013879623,0.00045179416,0.00014058716],"category_scores_gemma":[0.000013515113,0.0006006884,0.00027775648,0.00077769737,0.00027516903,0.00066393096,0.00022243624,0.00080563116,0.000101185105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001994969,0.00031153404,0.0039497274,0.000013691498,0.0002139785,0.00023200478,0.00021409236,0.37997916,0.000067534165,0.037096158,0.0228867,0.5548359],"study_design_scores_gemma":[0.0031148696,0.00016890404,0.004718736,0.00009520076,0.000042272048,0.000082297986,0.000008725766,0.98355174,0.00002418718,0.00008873884,0.0074073705,0.00069694314],"about_ca_topic_score_codex":0.000041261792,"about_ca_topic_score_gemma":0.00003977395,"teacher_disagreement_score":0.93711096,"about_ca_system_score_codex":0.00016426083,"about_ca_system_score_gemma":0.00013466859,"threshold_uncertainty_score":0.99964446},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.014585573995861138,"score_gpt":0.30244009458369514,"score_spread":0.287854520587834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050316560","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055112895,0.00003998541,0.9426492,0.0010254444,0.0005884026,0.00028490566,0.0000148414765,0.0001665847,0.00011776637],"genre_scores_gemma":[0.977628,0.00004894367,0.021699226,0.00032577524,0.00017442348,0.000010759232,0.0000021133833,0.000011164197,0.000099621335],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824864,0.00014637507,0.0004026542,0.0004572956,0.00037803728,0.00036700792],"domain_scores_gemma":[0.9981177,0.0008596672,0.00012174758,0.0005683433,0.00009220888,0.00024032514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031140688,0.0002396559,0.0003561812,0.00014019482,0.0001488333,0.00007819423,0.00034591215,0.00020558508,0.000027453478],"category_scores_gemma":[0.000028109029,0.00020141296,0.00021494589,0.000501155,0.00008465003,0.00022018314,0.0000023032635,0.00048802674,0.00002473722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018597717,0.00035786777,0.00019920367,0.000004355412,0.000068263216,0.000005619479,0.00016832411,0.12754035,0.000021981501,0.0053445194,0.0002549526,0.8658486],"study_design_scores_gemma":[0.0007753817,0.0010303336,0.01357587,0.00010087307,0.000035266752,0.000004900153,0.000008941825,0.9832265,0.000040555897,0.0009256005,0.00004759376,0.00022820759],"about_ca_topic_score_codex":0.000028027775,"about_ca_topic_score_gemma":0.000023030127,"teacher_disagreement_score":0.9225151,"about_ca_system_score_codex":0.00009933936,"about_ca_system_score_gemma":0.000086926986,"threshold_uncertainty_score":0.8213382},"labels":[],"label_agreement":null},{"id":"W2050346351","doi":"10.1002/dac.591","title":"Explicit TCP window adaptation in a shared memory architecture","year":2003,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Computer science; Computer network; Network packet; Queue; TCP global synchronization; Queueing theory; Priority queue; Window (computing); TCP acceleration; Network congestion; TCP Friendly Rate Control; Sliding window protocol; Real-time computing; Operating system","score_opus":0.01999292443033555,"score_gpt":0.25273370311992915,"score_spread":0.2327407786895936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050346351","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022941798,0.0050709713,0.95961976,0.004306028,0.0018535719,0.0002496798,0.000002536261,0.00004769255,0.0059079463],"genre_scores_gemma":[0.9914228,0.00017892492,0.007903017,0.00020492604,0.0001100586,0.000017466096,0.0000029271264,0.0000069504904,0.00015294552],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979271,0.00054527086,0.0007091693,0.000118853284,0.0005795194,0.00012006126],"domain_scores_gemma":[0.9978762,0.00031933712,0.00062450283,0.00043572416,0.0006760554,0.00006817529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010709763,0.000103478356,0.0001982661,0.00034720474,0.00004557913,0.00024002072,0.0017473568,0.000059031936,0.000014425644],"category_scores_gemma":[0.00015994342,0.000095009884,0.000086996966,0.00024239876,0.000020112788,0.00060583296,0.00006428548,0.0002933328,0.000014845553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010487491,0.00027220318,0.0013351733,0.000005667086,0.00021264052,0.000060901697,0.0069336444,0.45067665,0.00042765337,0.32473376,0.0013412741,0.21389554],"study_design_scores_gemma":[0.010749633,0.00031128115,0.008069294,0.001696011,0.00003804666,0.0020493304,0.0045226607,0.7520828,0.00040201322,0.013463206,0.20571546,0.00090024795],"about_ca_topic_score_codex":0.000027526083,"about_ca_topic_score_gemma":0.000026861255,"teacher_disagreement_score":0.968481,"about_ca_system_score_codex":0.00012515177,"about_ca_system_score_gemma":0.00016072612,"threshold_uncertainty_score":0.38743904},"labels":[],"label_agreement":null},{"id":"W2050681845","doi":"10.1117/12.417480","title":"<title>Performance of MPEG-2 video-on-demand over RSVP</title>","year":2001,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Smoothing; Computer network; Quality of service; Resource Reservation Protocol; Reservation; Queueing theory; Real-time computing; Transmission (telecommunications); Internet protocol suite; The Internet; Telecommunications; Operating system","score_opus":0.007988886316499954,"score_gpt":0.20882103196473104,"score_spread":0.20083214564823107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050681845","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9576397,0.00016034972,0.00043684884,0.0010223446,0.00038709358,0.00019039013,0.000006999263,0.00008026946,0.04007603],"genre_scores_gemma":[0.9661155,0.00032430876,0.030426215,0.0002131002,0.00057328696,0.000045334426,0.0000023348316,0.000033538065,0.002266402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987201,1.6231965e-8,0.00034338664,0.00023891474,0.00046782597,0.00022973648],"domain_scores_gemma":[0.99906945,0.000078034456,0.00018289649,0.00006620125,0.00053336757,0.00007002596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002905314,0.0001674191,0.00022591045,0.000065725646,0.00004218115,0.000054418797,0.0007938787,0.00010754684,0.00006951216],"category_scores_gemma":[0.00009862529,0.00013798547,0.00026440618,0.00024430445,0.000097446966,0.0002839495,0.00010110599,0.00016066697,0.000022905107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038548224,0.00007015931,0.00016422135,0.00011216933,0.00015014286,1.4578644e-7,0.000054984546,0.00020784143,0.03191842,0.93528855,0.023830095,0.008164734],"study_design_scores_gemma":[0.0019342044,0.0007084163,0.0019175436,0.00064714917,0.00013152703,0.00003609319,0.00006886208,0.7244728,0.024458624,0.0030059798,0.24189398,0.00072479603],"about_ca_topic_score_codex":5.371687e-7,"about_ca_topic_score_gemma":3.1848042e-8,"teacher_disagreement_score":0.93228257,"about_ca_system_score_codex":0.000053096577,"about_ca_system_score_gemma":0.000026874919,"threshold_uncertainty_score":0.56268835},"labels":[],"label_agreement":null},{"id":"W2050776169","doi":"10.1016/j.comnet.2006.08.017","title":"ARTP: A buffer-aware rate control protocol for media streaming","year":2006,"lang":"en","type":"article","venue":"Computer Networks","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Computer science; Real Time Streaming Protocol; Network congestion; Network packet; Arithmetic underflow; Buffer overflow; Computer network; Packet loss; Communication source; Protocol (science); RTP Control Protocol; Real-time computing; Operating system; The Internet","score_opus":0.010644320199232449,"score_gpt":0.23274571258119728,"score_spread":0.22210139238196483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050776169","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007157839,0.000040632418,0.9535198,0.00063620636,0.00096089684,0.044001713,0.0000043902805,0.00060369686,0.00016105393],"genre_scores_gemma":[0.6959699,0.0000016120613,0.053991117,0.0027296334,0.010397542,0.23647535,0.0000409584,0.000074228825,0.00031968078],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976778,0.00016330442,0.0005099481,0.00069701514,0.00021766312,0.00073426554],"domain_scores_gemma":[0.9979144,0.00088091864,0.00021493477,0.00063380983,0.0001920531,0.00016391849],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045059563,0.00034686193,0.0004114086,0.000085588596,0.00026192836,0.0004162193,0.00096613076,0.00017104516,0.00001308006],"category_scores_gemma":[0.000008643976,0.0003130453,0.00019970519,0.0003018018,0.000059562044,0.00033087557,0.0001475835,0.00024095237,0.00002210178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009549181,0.00014597639,0.0004303873,0.00002556152,0.000047464604,0.000030354015,0.000043137108,0.27480766,0.0000048918605,0.031869277,0.06133996,0.63115984],"study_design_scores_gemma":[0.004198699,0.00013847886,0.0015813616,0.00007862294,0.000014066141,0.000011133618,0.0000013974736,0.9576331,0.0000058707647,0.0019151691,0.034072094,0.00035000988],"about_ca_topic_score_codex":0.000009420579,"about_ca_topic_score_gemma":0.000025801799,"teacher_disagreement_score":0.89952874,"about_ca_system_score_codex":0.000053079137,"about_ca_system_score_gemma":0.00006836572,"threshold_uncertainty_score":0.99993217},"labels":[],"label_agreement":null},{"id":"W2052930370","doi":"10.1145/1730836.1730858","title":"Paceline","year":2010,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Failover; Computer network; Latency (audio); Quality of service; Bandwidth (computing); Distributed computing; Telecommunications","score_opus":0.002952115107212892,"score_gpt":0.19215451950953744,"score_spread":0.18920240440232455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052930370","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008294179,0.000011704001,0.94511485,0.0064709354,0.00076874334,0.000030917723,5.9135257e-8,0.0003109895,0.03899765],"genre_scores_gemma":[0.9506961,0.000001011787,0.044146877,0.00097428216,0.00013698069,0.000002789515,1.4034637e-7,0.0000013210196,0.0040404885],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997036,0.000004990153,0.000047772726,0.00009831928,0.00005982016,0.000085513675],"domain_scores_gemma":[0.9996746,0.000018167868,0.000009400524,0.00022695212,0.000024417397,0.000046440673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000773084,0.0000316491,0.000032489923,0.000013160435,0.000028969824,0.000044053435,0.0002698811,0.000020668505,0.00016918597],"category_scores_gemma":[0.000008262309,0.000024106666,0.000016491762,0.00007436252,0.000009779275,0.00009587583,0.0000335091,0.00008292621,0.00028398822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.4329808e-7,0.000006172706,0.00006482312,1.0948217e-7,9.32874e-7,0.0000012446625,0.000007692994,0.000007246114,0.00053440954,0.47101182,0.0051354584,0.52322984],"study_design_scores_gemma":[0.00030711442,0.00002005037,0.00076154375,8.2403346e-7,0.000001341086,0.000016533662,0.000002907867,0.61771417,0.00039715075,0.004507541,0.37615052,0.000120287354],"about_ca_topic_score_codex":0.0000019733136,"about_ca_topic_score_gemma":0.000022718343,"teacher_disagreement_score":0.94240195,"about_ca_system_score_codex":8.6612016e-7,"about_ca_system_score_gemma":0.000014724231,"threshold_uncertainty_score":0.3650189},"labels":[],"label_agreement":null},{"id":"W2052994467","doi":"10.1109/ccnc.2010.5421665","title":"Modeling and Evaluation of a Streaming Traffic Controller for Vehicular Ad-Hoc Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Active queue management; Computer science; Controller (irrigation); Wireless ad hoc network; Computer network; Queue; Vehicular ad hoc network; Queueing theory; Network congestion; Node (physics); Mobile ad hoc network; Real-time computing; Network packet; Engineering; Telecommunications; Wireless","score_opus":0.01738398253933069,"score_gpt":0.25374690780622616,"score_spread":0.23636292526689548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052994467","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38126808,0.0008356465,0.61708003,0.0001910181,0.00017277879,0.0003388591,3.5939888e-7,0.000053721145,0.000059510323],"genre_scores_gemma":[0.98479706,0.000027648863,0.014892928,0.000084837346,0.00008999283,0.000072588955,0.0000015249235,0.000006450704,0.000026996138],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990479,0.00004702698,0.00022524546,0.00025816576,0.00024142086,0.00018028237],"domain_scores_gemma":[0.9992217,0.00015379321,0.000059164915,0.00020057947,0.00030079365,0.000064000116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010866785,0.00009854983,0.000172985,0.000046592017,0.000082982326,0.000060715716,0.00019513055,0.00008369056,0.000007732987],"category_scores_gemma":[0.000046486726,0.00008355897,0.000060181963,0.00009486392,0.000023692988,0.00017805933,0.000029672927,0.00010802679,6.281438e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011028292,0.000011753275,0.0000040965383,0.0000018295277,0.000012409812,7.158101e-8,0.000043279637,0.46441427,0.00010767301,0.0046077915,0.000015512434,0.5307703],"study_design_scores_gemma":[0.0025362887,0.00005517165,0.00004090465,0.000009860434,0.000046881338,0.0000025270522,0.000023954739,0.99652565,0.000009181754,0.0005124237,0.00014185149,0.00009528475],"about_ca_topic_score_codex":0.0000014711308,"about_ca_topic_score_gemma":0.00005371919,"teacher_disagreement_score":0.603529,"about_ca_system_score_codex":0.000007582329,"about_ca_system_score_gemma":0.0000501881,"threshold_uncertainty_score":0.34074357},"labels":[],"label_agreement":null},{"id":"W2053147723","doi":"10.1002/nem.625","title":"A simple mechanism for stabilizing network queues in TCP/IP networks","year":2006,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Active queue management; Computer science; Queue; Padé approximant; Simple (philosophy); Nonlinear system; Stability (learning theory); Queueing theory; Controller (irrigation); Control theory (sociology); Network congestion; Computer network; Control (management); Applied mathematics; Mathematics","score_opus":0.008216961726850616,"score_gpt":0.23909124340027543,"score_spread":0.23087428167342483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053147723","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002535071,0.0008069682,0.98928016,0.001845937,0.0035359433,0.0003659612,0.000001148419,0.00005778299,0.0015710138],"genre_scores_gemma":[0.95025355,0.00025015164,0.043296464,0.0012880557,0.004595333,0.00004580178,0.000007643782,0.000020602589,0.00024239867],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99754184,0.000103860584,0.00092652324,0.00030010293,0.0005909552,0.000536738],"domain_scores_gemma":[0.99838287,0.00028645468,0.0005652035,0.00024162522,0.00044381924,0.000080027494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011879721,0.00020952195,0.0003165555,0.00019144606,0.00009635806,0.00028949638,0.0014452906,0.00007169642,0.000015506348],"category_scores_gemma":[0.000015804662,0.0002002347,0.00022056604,0.00037130772,0.000024360237,0.00043899796,0.00025078704,0.00022228448,0.0000036183103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006720576,0.000058841808,0.00057329715,0.0000037828872,0.000106811254,0.00009341332,0.000013386562,0.5466158,8.410333e-7,0.37057495,0.01643314,0.06545858],"study_design_scores_gemma":[0.0017862403,0.00011812018,0.00211826,0.00016737223,0.0000313643,0.000031725755,0.000025978852,0.7653565,0.0000026043685,0.20018484,0.02995423,0.00022277248],"about_ca_topic_score_codex":0.000018770972,"about_ca_topic_score_gemma":0.00014254381,"teacher_disagreement_score":0.9477185,"about_ca_system_score_codex":0.00019467814,"about_ca_system_score_gemma":0.000040187166,"threshold_uncertainty_score":0.8165334},"labels":[],"label_agreement":null},{"id":"W2053584450","doi":"10.1016/s0140-3664(00)00365-0","title":"An optimization-oriented view of random early detection","year":2001,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Computer science; Random early detection; Router; Computer network; Active queue management; Queue; Network packet; Network congestion; Transmission Control Protocol; Real-time computing","score_opus":0.015511271740755023,"score_gpt":0.24860345235079284,"score_spread":0.2330921806100378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053584450","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030615043,0.0005128197,0.9942921,0.0007746554,0.00025466716,0.00022191094,0.0000011092022,0.00027730342,0.0006039786],"genre_scores_gemma":[0.76310664,0.0002993124,0.2362884,0.00016668742,0.000060165945,0.000033278247,0.000010744071,0.0000069578423,0.000027799373],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885774,0.0002887952,0.0003370741,0.00021707764,0.00014653498,0.00015275365],"domain_scores_gemma":[0.99699086,0.00020235899,0.0001447816,0.0022847098,0.00028741348,0.000089875764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023262827,0.0001097083,0.00018036032,0.00010938387,0.00025292733,0.000085534644,0.0018719647,0.00005219693,0.000012443143],"category_scores_gemma":[0.000009279369,0.000111904716,0.000070400885,0.000652624,0.00008665201,0.00052222336,0.00026584175,0.00013389347,0.00001640784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001586623,0.00024785977,0.00041293338,0.0000033293886,0.00003200808,9.421864e-7,0.00046058942,0.091296904,0.000061405895,0.02855544,0.00007053095,0.8788422],"study_design_scores_gemma":[0.0008045044,0.00010108658,0.0011679722,0.000020181473,0.000011090129,0.000011903497,0.0000056378367,0.9886448,0.000023411725,0.0002150081,0.008881973,0.00011245186],"about_ca_topic_score_codex":0.00002396977,"about_ca_topic_score_gemma":0.00002588488,"teacher_disagreement_score":0.89734787,"about_ca_system_score_codex":0.000019706433,"about_ca_system_score_gemma":0.000037391477,"threshold_uncertainty_score":0.4563342},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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)","score_opus":0.03307635050854029,"score_gpt":0.2640754187643328,"score_spread":0.23099906825579253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054092574","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004196475,0.00013541982,0.9932819,0.0002571398,0.00035373544,0.0015674923,0.000112800124,0.000054003485,0.000041045016],"genre_scores_gemma":[0.99842757,0.000010785548,0.0008703311,0.00016489081,0.000033728767,0.0003725429,0.000011092683,0.000008760265,0.00010030346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984181,0.00023407211,0.0004844636,0.00034431883,0.00019704674,0.0003219827],"domain_scores_gemma":[0.99822325,0.0011852968,0.00014348242,0.0002638963,0.00009397366,0.00009010797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013148999,0.0002131839,0.00034869806,0.00014629013,0.00011160839,0.00007828846,0.00034573683,0.000107881366,0.0000029596583],"category_scores_gemma":[0.0000059663093,0.00015294507,0.000110330744,0.00031827463,0.00006369889,0.000109502806,8.592537e-7,0.00018359275,0.0000050831586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002003224,0.000664625,0.000002253641,0.000017622866,0.00004479887,0.000011440298,0.00018143152,0.96520835,0.000037554928,0.0017209977,0.00033558757,0.02977214],"study_design_scores_gemma":[0.007364235,0.0013713924,0.000026416412,0.00009185566,0.000036283294,0.000008260243,0.0002176634,0.9902614,0.000044862587,0.000032655775,0.0003842351,0.00016078212],"about_ca_topic_score_codex":0.000029840236,"about_ca_topic_score_gemma":0.000028003544,"teacher_disagreement_score":0.9942311,"about_ca_system_score_codex":0.000045248835,"about_ca_system_score_gemma":0.000056767123,"threshold_uncertainty_score":0.62369186},"labels":[],"label_agreement":null},{"id":"W2054790797","doi":"10.1109/pccc.2012.6407773","title":"Effect of MRAI timers and routing policies on BGP convergence times","year":2012,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Border Gateway Protocol; Default-free zone; Computer science; Computer network; Routing protocol; Convergence (economics); Router; Routing (electronic design automation); The Internet; Overhead (engineering); Distributed computing; Routing table; Static routing","score_opus":0.005484020503377942,"score_gpt":0.23472084948501018,"score_spread":0.22923682898163225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054790797","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81589216,0.0010559817,0.11438908,0.001022822,0.00097003614,0.00030781992,0.0000011082958,0.0004068957,0.06595408],"genre_scores_gemma":[0.99860305,0.000015576841,0.0006037998,0.00019849479,0.000056691264,0.0000034482962,1.7029572e-7,0.0000029546068,0.0005158002],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994578,0.000060997187,0.00009558459,0.00009607022,0.000100580975,0.00018898876],"domain_scores_gemma":[0.9994438,0.00029598534,0.000031222204,0.00014370088,0.000013142046,0.00007214338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030461777,0.00007877751,0.00011519062,0.0000314423,0.000040321196,0.00001905449,0.00015793553,0.000026423404,0.00003488907],"category_scores_gemma":[0.00001632926,0.0000577976,0.000025438905,0.00009782295,0.000042801938,0.00016977682,0.000045059325,0.000044410564,0.000045390338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016838214,0.00002703119,0.009549787,0.000021868353,0.00003608614,6.2256413e-7,0.0006343265,0.00031088793,0.0004816337,0.2519389,0.003405562,0.7335765],"study_design_scores_gemma":[0.0019249854,0.001703991,0.021130264,0.0001229612,0.00006217372,0.000029497975,0.000083510684,0.9244637,0.044391677,0.0003367378,0.005005594,0.00074494065],"about_ca_topic_score_codex":0.000010397773,"about_ca_topic_score_gemma":4.4098311e-7,"teacher_disagreement_score":0.9241528,"about_ca_system_score_codex":0.0000056067133,"about_ca_system_score_gemma":0.0000061325964,"threshold_uncertainty_score":0.23569177},"labels":[],"label_agreement":null},{"id":"W2054950229","doi":"10.1109/tnsm.2013.043013.120264","title":"Using Fuzzy Logic Control to Provide Intelligent Traffic Management Service for High-Speed Networks","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Network and Service Management","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Network traffic control; Traffic policing; Computer network; Active queue management; Quality of service; Traffic shaping; Traffic generation model; Router; Bottleneck; Network congestion; Queueing theory; Network packet; Fuzzy logic; Network delay; Packet loss; Queue; Distributed computing; Embedded system","score_opus":0.02080185166822854,"score_gpt":0.23266621178174982,"score_spread":0.21186436011352128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054950229","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037160832,0.0001367914,0.9787236,0.010236229,0.0015407143,0.004577192,0.0000052814635,0.0004225511,0.0006415971],"genre_scores_gemma":[0.9098553,0.00028469236,0.057753712,0.030017532,0.00033440292,0.0011192478,0.000006133738,0.00005372406,0.0005752402],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99692965,0.00012342444,0.0006044264,0.0010026834,0.00037443425,0.0009654049],"domain_scores_gemma":[0.99828947,0.00016562513,0.000144121,0.00079162366,0.00023857942,0.00037059412],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041472804,0.00050332013,0.00045880993,0.00023126963,0.0006278238,0.00048218147,0.0008909787,0.0001349671,0.00004812722],"category_scores_gemma":[5.1019754e-7,0.00048143129,0.00013467485,0.0012415268,0.000023097455,0.00036480225,0.000030370826,0.0002392776,0.00014253633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008428958,0.00011778481,7.5727405e-7,0.00009648318,0.00024054715,0.000006570216,0.00009056698,0.6277,0.0000031944705,0.006903308,0.0006873693,0.3640692],"study_design_scores_gemma":[0.0020003486,0.00023322218,0.00009162222,0.00015401602,0.0002815994,0.0000062353706,0.00018336557,0.98709506,0.000006354648,0.0009136221,0.008483319,0.0005512074],"about_ca_topic_score_codex":0.00008290376,"about_ca_topic_score_gemma":0.00018609427,"teacher_disagreement_score":0.92096984,"about_ca_system_score_codex":0.00012462224,"about_ca_system_score_gemma":0.000019898178,"threshold_uncertainty_score":0.9997637},"labels":[],"label_agreement":null},{"id":"W2055045269","doi":"10.1016/j.comcom.2007.12.022","title":"Routing and admission control with multiconstrained end-to-end quality of service in MPLS networks","year":2008,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Multiprotocol Label Switching; Computer science; Computer network; End-to-end principle; Quality of service; End-to-end delay; Packet loss; Admission control; Network packet","score_opus":0.040248525526872525,"score_gpt":0.2759314848276511,"score_spread":0.2356829593007786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055045269","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059731513,0.00032472753,0.93244654,0.006709909,0.00005600028,0.00036117394,0.0000034668947,0.00010808995,0.00025858526],"genre_scores_gemma":[0.86578655,0.000043695887,0.13270792,0.001379507,0.000031536216,0.000029309727,0.000005494721,0.0000071152817,0.000008859779],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984123,0.0003982329,0.0004818122,0.00029324714,0.00016959923,0.0002448212],"domain_scores_gemma":[0.9969127,0.0010325254,0.00018347456,0.0014987456,0.00020673114,0.00016577561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048609407,0.00015317526,0.00032599992,0.000107111235,0.00025082775,0.000045744153,0.0013497231,0.00006289212,0.0000041005133],"category_scores_gemma":[0.000027805134,0.00013938788,0.000036134174,0.00058508146,0.00015006804,0.00021408065,0.000525179,0.0002523323,0.000003031152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012654506,0.0006364021,0.047884844,0.000035096917,0.00012038093,0.000014406499,0.0065729017,0.09721052,0.000271753,0.10417073,0.00020670403,0.7427497],"study_design_scores_gemma":[0.0015699633,0.00006371664,0.08494519,0.00009459237,0.0000066167772,0.000026003334,0.000029124589,0.91275483,0.0000047436024,0.00006262033,0.0002834873,0.00015911307],"about_ca_topic_score_codex":0.00017036307,"about_ca_topic_score_gemma":0.0003994269,"teacher_disagreement_score":0.8155443,"about_ca_system_score_codex":0.000024948062,"about_ca_system_score_gemma":0.000114707436,"threshold_uncertainty_score":0.56840724},"labels":[],"label_agreement":null},{"id":"W2056418797","doi":"10.1109/icufn.2010.5547188","title":"Transport protocol for smart grid infrastructure","year":2010,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Cistel Technology (Canada); University of Ottawa; University of Waterloo","funders":"","keywords":"Computer science; Computer network; Retransmission; Transmission Control Protocol; Network packet; News aggregator; Throughput; Internet protocol suite; The Internet; Wireless; Operating system","score_opus":0.007729325407386518,"score_gpt":0.25209461057063154,"score_spread":0.24436528516324502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056418797","genre_codex":"methods","genre_gemma":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041666767,3.000981e-7,0.9186273,0.0014014887,0.00071103504,0.0704939,0.0000020889136,0.00033385106,0.008013361],"genre_scores_gemma":[0.16492578,1.0739593e-7,0.23306756,0.0022599425,0.0012587084,0.59450793,0.0000052074993,0.00001924373,0.003955535],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993056,0.000006762973,0.0001433523,0.00023409458,0.0001126036,0.00019755635],"domain_scores_gemma":[0.99944943,0.00004092048,0.000034872875,0.0003159281,0.00007267934,0.0000861843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012402753,0.000096276555,0.00009495884,0.000026806149,0.00008117192,0.000048263544,0.0004931678,0.00007291291,0.00018180745],"category_scores_gemma":[0.000007206786,0.00007238892,0.00006478691,0.000101557845,0.000024292134,0.00019408317,0.000017114717,0.00014930255,0.000017087203],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003430436,0.000041560364,0.0020866063,0.000017951557,0.000012324882,0.0000027931555,0.00007497063,0.00014307612,0.0004999135,0.24466534,0.036500253,0.7159209],"study_design_scores_gemma":[0.0015258411,0.000082804356,0.006907055,0.00000448754,0.0000033881313,0.000012235371,0.0000024441517,0.06896309,0.0003876744,0.00465871,0.91727144,0.00018081132],"about_ca_topic_score_codex":0.0000018746014,"about_ca_topic_score_gemma":0.000048253736,"teacher_disagreement_score":0.8807712,"about_ca_system_score_codex":0.000003701145,"about_ca_system_score_gemma":0.00007800587,"threshold_uncertainty_score":0.29519343},"labels":[],"label_agreement":null},{"id":"W2056442834","doi":"10.1109/comst.2004.5342233","title":"QoS control for video and audio communication in conventional and active networks: Approaches and comparison","year":2004,"lang":"en","type":"article","venue":"IEEE Communications Surveys & Tutorials","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Quality of service; Computer network; Multimedia; Control (management); Artificial intelligence","score_opus":0.06026935587234589,"score_gpt":0.2900514144733005,"score_spread":0.22978205860095463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056442834","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031844746,0.0088848565,0.951885,0.004985265,0.0006196489,0.0014483703,0.000036533835,0.00012493659,0.00017067765],"genre_scores_gemma":[0.9815347,0.0008276454,0.016855935,0.00014091909,0.00015196434,0.00042734508,0.00003332647,0.0000127837975,0.00001537174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971943,0.0015007807,0.00053986185,0.00037154552,0.00014064531,0.0002528724],"domain_scores_gemma":[0.9951504,0.0031031636,0.00028023665,0.0011859897,0.00017003616,0.00011020942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003307256,0.00019558064,0.00043831943,0.00011265888,0.0004650109,0.00023638099,0.0008652721,0.000121111974,0.0000010131213],"category_scores_gemma":[0.00019775023,0.000205928,0.000044582193,0.00024354897,0.00045162518,0.0005227708,0.00025749163,0.0002571316,0.0000013528412],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018080266,0.00071946194,0.012728961,0.00004835295,0.00027928295,9.989517e-7,0.0027951235,0.016451197,0.00017557948,0.60459524,0.000761161,0.36126384],"study_design_scores_gemma":[0.018787185,0.0003368299,0.13443711,0.00031969114,0.00015522959,0.000036524994,0.0005766885,0.79823196,0.00010732592,0.032423764,0.013516427,0.0010712753],"about_ca_topic_score_codex":0.00015781929,"about_ca_topic_score_gemma":0.00093567284,"teacher_disagreement_score":0.94969,"about_ca_system_score_codex":0.000073464114,"about_ca_system_score_gemma":0.000107904205,"threshold_uncertainty_score":0.83975},"labels":[],"label_agreement":null},{"id":"W2058452446","doi":"10.1109/glocom.2008.ecp.456","title":"On Robust Traffic Engineering in Transport Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer network; Robustness (evolution); Distributed computing; Traffic engineering; Traffic generation model; Probabilistic logic; Betweenness centrality; Multiprotocol Label Switching; Criticality; Network topology; Network traffic control; Topology (electrical circuits); Quality of service; Engineering; Mathematics","score_opus":0.010412824917576115,"score_gpt":0.17158258376394572,"score_spread":0.1611697588463696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058452446","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19447622,0.000068148845,0.80282515,0.0002797504,0.0002213323,0.000089445035,6.714741e-8,0.00032920687,0.0017106727],"genre_scores_gemma":[0.99578124,0.000027664199,0.0033437272,0.00035296468,0.00007273105,0.00001282951,8.042819e-7,0.0000067740625,0.00040128076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991841,0.000012657612,0.00016590694,0.00024531176,0.00013176622,0.00026029485],"domain_scores_gemma":[0.99959165,0.00008152808,0.000016353892,0.00022575143,0.000011472818,0.00007325713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001004043,0.0001094889,0.00012788863,0.00008308604,0.000041281273,0.000012310602,0.00032928324,0.000056551766,0.000026198517],"category_scores_gemma":[0.0000039886418,0.00010027682,0.00004759459,0.00033924394,0.000012364877,0.00013905503,0.000009903727,0.0001696804,0.000024741279],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044511708,0.00003285781,0.00021480132,7.632689e-7,0.0000028657926,0.00007443304,0.00006314242,0.94166726,5.0969385e-7,0.0197336,0.00044955235,0.03775574],"study_design_scores_gemma":[0.0005221524,0.000047930243,0.0059425062,0.000011808098,9.16172e-7,0.000019985657,0.0000013387831,0.99289674,0.0000021411217,0.000009164295,0.00042189693,0.00012340346],"about_ca_topic_score_codex":0.0000037089717,"about_ca_topic_score_gemma":0.000020705897,"teacher_disagreement_score":0.801305,"about_ca_system_score_codex":0.000021287133,"about_ca_system_score_gemma":0.000021694406,"threshold_uncertainty_score":0.40891698},"labels":[],"label_agreement":null},{"id":"W2058665619","doi":"10.1109/ciss.2008.4558690","title":"Can API-RCP be TCP friendly with RED?","year":2008,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Bottleneck; Router; Computer science; Network congestion; Computer network; Active queue management; TCP Friendly Rate Control; Queueing theory; Bandwidth (computing); Queue; The Internet; CUBIC TCP; Random early detection; Robustness (evolution); Distributed computing; Network packet; Operating system; Embedded system","score_opus":0.011582060056146067,"score_gpt":0.1900753242111892,"score_spread":0.17849326415504313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058665619","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030024687,0.00011242211,0.8655606,0.02873634,0.0003559852,0.00020554525,0.0000014905419,0.00085109915,0.074151814],"genre_scores_gemma":[0.9632585,0.00001436561,0.025495553,0.0022473943,0.000097890865,0.0000137476645,0.0000011263261,0.0000066926355,0.008864708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990586,0.000027082839,0.00011840159,0.00029671178,0.00024402924,0.00025515573],"domain_scores_gemma":[0.99930173,0.000044717744,0.000037015532,0.00041642532,0.00006960971,0.00013051082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000685422,0.000110444445,0.00011978152,0.000039096314,0.00016464054,0.000045499746,0.0004692381,0.000036651367,0.000103348655],"category_scores_gemma":[0.000005503958,0.00008022369,0.000032213862,0.00026489652,0.000061426945,0.00017445495,0.000053909116,0.00009755135,0.00004210131],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004403208,0.00015057412,0.0035127192,0.000005080989,0.000074827236,0.00044721656,0.0012305654,0.0016343903,0.00006461101,0.4400434,0.1996232,0.3531694],"study_design_scores_gemma":[0.0046553453,0.0013574454,0.011602763,0.000044781915,0.000032342858,0.0012306238,0.00017552907,0.35150278,0.00076617714,0.0016507785,0.6254903,0.0014911614],"about_ca_topic_score_codex":0.000048531045,"about_ca_topic_score_gemma":0.0001260798,"teacher_disagreement_score":0.93323386,"about_ca_system_score_codex":0.000017266191,"about_ca_system_score_gemma":0.00011834559,"threshold_uncertainty_score":0.32714272},"labels":[],"label_agreement":null},{"id":"W2058714038","doi":"10.1016/j.jpdc.2009.11.005","title":"Employing transport layer multi-railing in cluster networks","year":2009,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Ohio State University; Cisco Systems","keywords":"Computer science; Cluster (spacecraft); Layer (electronics); Computer network; Nanotechnology; Materials science","score_opus":0.017034058662209698,"score_gpt":0.25480977510717967,"score_spread":0.23777571644496998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058714038","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16339105,0.0009754736,0.8342703,0.0010319926,0.00020401497,0.00006378018,5.6278867e-7,0.000033974888,0.000028826744],"genre_scores_gemma":[0.97014517,0.000048577647,0.02906817,0.0005088703,0.00021439441,3.250479e-7,0.000002204886,0.0000042738584,0.000007999564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853456,0.00007759541,0.00065772695,0.00020016142,0.00018968452,0.00034029028],"domain_scores_gemma":[0.9991778,0.00013363095,0.00030264677,0.00012658737,0.000110809255,0.00014849365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066271046,0.00015467181,0.00033256385,0.00010471361,0.000114181385,0.000099262725,0.00036298696,0.00008341925,0.0000014645764],"category_scores_gemma":[0.000024503654,0.00013319665,0.000103352635,0.00030126428,0.000020153204,0.00031725207,0.00003601866,0.0003976003,7.6005153e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048817063,0.000097345954,0.014211243,0.000004213377,0.000019547051,0.00014685115,0.00028904088,0.80875486,0.000017356253,0.0012428403,0.0001166467,0.17505123],"study_design_scores_gemma":[0.0020487013,0.00009938618,0.0701139,0.00012021818,0.000011274319,0.00015145367,0.000042524585,0.9267864,0.0000014622792,0.0002568762,0.00021941726,0.00014834745],"about_ca_topic_score_codex":0.0000034403295,"about_ca_topic_score_gemma":0.000005775774,"teacher_disagreement_score":0.8067541,"about_ca_system_score_codex":0.00003155921,"about_ca_system_score_gemma":0.00004593747,"threshold_uncertainty_score":0.54316014},"labels":[],"label_agreement":null},{"id":"W2059070751","doi":"10.1109/med.2007.4433767","title":"A Sliding Mode-based congestion control for time delayed differentiated-services networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Network congestion; Computer science; Differentiated services; Robustness (evolution); Queueing theory; Control theory (sociology); Sliding mode control; Probabilistic logic; Scalability; Fluid queue; Flow control (data); Variable structure control; Discrete time and continuous time; Markov process; Distributed computing; Control (management); Computer network; Quality of service; Mathematics; Network packet","score_opus":0.005944832344765299,"score_gpt":0.22290988972937759,"score_spread":0.21696505738461228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059070751","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0110969795,0.00016074826,0.9856914,0.0007627527,0.00045752575,0.0006047632,0.000004664956,0.0007134823,0.00050763664],"genre_scores_gemma":[0.9854785,0.0000030149895,0.011908492,0.0018836701,0.0002609634,0.000062082756,0.000027584478,0.000018158376,0.00035748555],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982728,0.000059189293,0.00038538355,0.00046245885,0.0002271648,0.0005930508],"domain_scores_gemma":[0.9983573,0.0007280343,0.00015059163,0.00038290865,0.0001892535,0.00019189977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006261711,0.00023260583,0.00027984788,0.00011162247,0.00022730752,0.00022162941,0.0006131909,0.00015889537,0.000032886135],"category_scores_gemma":[0.000012724014,0.00020410163,0.00014477839,0.00024920798,0.000021440648,0.00029428533,0.000038410883,0.0001300561,0.00003727865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008971902,0.00026862245,0.0008799268,0.000035799727,0.00024356745,0.00001840843,0.0001071974,0.34543103,0.0014156577,0.15844516,0.001771255,0.49048617],"study_design_scores_gemma":[0.0029346156,0.00015294201,0.0006076428,0.0000267955,0.000043695494,0.0000030121246,0.0000055232163,0.99475604,0.00013882869,0.00047188823,0.0006026996,0.00025628626],"about_ca_topic_score_codex":0.000019211982,"about_ca_topic_score_gemma":0.00006472165,"teacher_disagreement_score":0.97438157,"about_ca_system_score_codex":0.00004538201,"about_ca_system_score_gemma":0.000036997397,"threshold_uncertainty_score":0.8323023},"labels":[],"label_agreement":null},{"id":"W2059092774","doi":"10.1109/infocom.2014.6848131","title":"Low complexity multi-resource fair queueing with bounded delay","year":2014,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Fair queuing; Weighted fair queueing; Computer science; Proportionally fair; Queueing theory; Network packet; Bounded function; Scheduling (production processes); Computer network; Layered queueing network; Generalized processor sharing; Distributed computing; Quality of service; Round-robin scheduling; Mathematical optimization; Dynamic priority scheduling; Mathematics","score_opus":0.0160865811016981,"score_gpt":0.21496825404791237,"score_spread":0.19888167294621426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059092774","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011345801,0.00001825723,0.9760887,0.001332757,0.00009549681,0.00012533022,2.5707186e-7,0.00055649335,0.010436916],"genre_scores_gemma":[0.88493,5.387533e-7,0.11151732,0.0017607756,0.0000876319,0.000010132352,0.0000013058658,0.0000084276,0.0016838685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988306,0.00010139341,0.00015789429,0.000370617,0.00022359728,0.0003159089],"domain_scores_gemma":[0.99911916,0.00012244581,0.00006172195,0.00048829557,0.00006707985,0.00014131983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025581606,0.0001479786,0.0001666555,0.00004054977,0.00020333394,0.00021389383,0.0006282355,0.000045737666,0.000043497006],"category_scores_gemma":[0.000013535631,0.000109787106,0.00004315792,0.00019870033,0.000099365425,0.00023748877,0.00010269958,0.00013295081,0.00010621912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024574128,0.00013201371,0.00075498666,0.0000106504585,0.000027624172,0.000012848832,0.00026263375,0.0047595943,0.00003759612,0.5395752,0.0022834342,0.4521188],"study_design_scores_gemma":[0.0010407447,0.0000954726,0.0011525628,0.000019518855,0.000005088396,0.000019417328,0.000017267665,0.9780002,0.000085776555,0.0005591961,0.018790368,0.0002143691],"about_ca_topic_score_codex":0.00005125022,"about_ca_topic_score_gemma":0.00037105,"teacher_disagreement_score":0.9732406,"about_ca_system_score_codex":0.000022271923,"about_ca_system_score_gemma":0.000040693947,"threshold_uncertainty_score":0.44769883},"labels":[],"label_agreement":null},{"id":"W2059951776","doi":"10.1117/12.570117","title":"Head-dropping mechanism in traffic control","year":2004,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Bottleneck; Random early detection; Active queue management; Computer science; Queue; Drop (telecommunication); Router; Network congestion; Computer network; Queueing theory; Head (geology); Network packet; Real-time computing; Control theory (sociology); Telecommunications; Control (management); Artificial intelligence; Embedded system","score_opus":0.009311293489731446,"score_gpt":0.21904854729746104,"score_spread":0.2097372538077296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059951776","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9847659,0.00012815627,0.0058861873,0.007501289,0.00036290704,0.0005792285,0.000008842461,0.00016675126,0.00060075015],"genre_scores_gemma":[0.9067544,0.000046426856,0.092402436,0.00029675793,0.00027476947,0.0001417726,0.0000013869376,0.00003085055,0.000051244395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99761033,1.825082e-8,0.0007262402,0.0004875199,0.0006673335,0.000508564],"domain_scores_gemma":[0.9984546,0.00014127407,0.00030686287,0.00007985835,0.00087899686,0.000138436],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007532334,0.00031039212,0.00045557442,0.00014397716,0.00011567425,0.00014330384,0.0016263615,0.00018769586,0.000003837545],"category_scores_gemma":[0.00023305045,0.00027165952,0.0005224804,0.0005042794,0.00012501905,0.0007724383,0.00018353779,0.00037418408,0.0000024124424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000477601,0.0001360601,0.000041606632,0.00010762267,0.00016849604,3.5854023e-7,0.0003331722,0.0066167596,0.07608938,0.913551,0.00018527516,0.002722518],"study_design_scores_gemma":[0.00938785,0.00077304157,0.00076220604,0.00094060734,0.000139954,0.00006310754,0.0008690052,0.9373474,0.024950586,0.021607604,0.0022104126,0.0009481946],"about_ca_topic_score_codex":0.00000877375,"about_ca_topic_score_gemma":7.500364e-7,"teacher_disagreement_score":0.9307307,"about_ca_system_score_codex":0.00022549785,"about_ca_system_score_gemma":0.00007464216,"threshold_uncertainty_score":0.99997354},"labels":[],"label_agreement":null},{"id":"W2059980651","doi":"10.1117/12.473407","title":"<title>Measurement study of RealMedia streaming traffic</title>","year":2002,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Network packet; Variable bitrate; Constant bitrate; Interleaving; Encoder; Real-time computing; Computer network; The Internet; Application layer; Bit rate","score_opus":0.016938400418248054,"score_gpt":0.21175812473550434,"score_spread":0.1948197243172563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059980651","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9762863,0.00025737373,0.00024197467,0.0007854913,0.00040806603,0.0003644457,0.0000065699883,0.0001039579,0.021545826],"genre_scores_gemma":[0.9809976,0.00007639126,0.017899515,0.00003594793,0.0003240667,0.000049203012,8.946269e-7,0.000023763927,0.00059261697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984083,2.657424e-8,0.0004028124,0.0002565424,0.0007117336,0.00022056035],"domain_scores_gemma":[0.998744,0.00005957771,0.00020584454,0.0000645997,0.00085137406,0.000074576885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003837591,0.00016856792,0.0002437346,0.00006745427,0.000042624408,0.00005630451,0.0007968844,0.000086607404,0.000053543114],"category_scores_gemma":[0.00015018307,0.00014276494,0.0002337118,0.0002406529,0.0000676605,0.00020709517,0.00009415455,0.00015410474,0.000012335338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028765968,0.00069986575,0.000085737316,0.00023215573,0.00061084173,4.3714317e-7,0.0008224709,0.0005864338,0.044685498,0.83879954,0.05549215,0.05795613],"study_design_scores_gemma":[0.0035554674,0.0012345635,0.0008621617,0.00054320187,0.0003009233,0.000022095403,0.0010648277,0.926884,0.0063865837,0.0008069967,0.05750331,0.0008358621],"about_ca_topic_score_codex":0.000001088,"about_ca_topic_score_gemma":1.8292039e-7,"teacher_disagreement_score":0.92629755,"about_ca_system_score_codex":0.0000798167,"about_ca_system_score_gemma":0.000018880906,"threshold_uncertainty_score":0.58217853},"labels":[],"label_agreement":null},{"id":"W2060511775","doi":"10.1016/s0140-3664(02)00028-2","title":"QUIPS-II: a simulation tool for the design and performance evaluation of Diffserv-based networks","year":2002,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Distributed computing; Computer architecture; Computer network","score_opus":0.10329345415626871,"score_gpt":0.2877812360696271,"score_spread":0.18448778191335835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060511775","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051495787,0.0020276024,0.98887384,0.002812579,0.00013822221,0.0008938882,8.33203e-7,0.00007503291,0.000028451666],"genre_scores_gemma":[0.86602974,0.00013795534,0.13324428,0.00029329042,0.000058520207,0.00021144532,0.000004500814,0.000005766902,0.000014479856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890417,0.00030906766,0.00026621323,0.00017454821,0.00020843197,0.0001375931],"domain_scores_gemma":[0.9959176,0.0020795541,0.00014856219,0.0014237921,0.0004008878,0.000029593164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010504423,0.00010075808,0.00011886237,0.000049405644,0.0006449558,0.000078954436,0.0011552998,0.000047411733,0.000005948229],"category_scores_gemma":[0.000032859207,0.000080584476,0.000051317184,0.00024957114,0.00010181216,0.00022530426,0.0002693928,0.00010272149,0.0000017732139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031906904,0.000037320933,0.00006646759,0.0000019207596,0.000010043763,6.5545227e-9,0.000121134304,0.54385036,9.123428e-7,0.0023060078,0.00021714275,0.45338547],"study_design_scores_gemma":[0.00071615167,0.00012065993,0.0027510088,0.000027285283,0.00004936725,8.1451657e-7,0.000002206245,0.99438375,0.0000032702014,0.00014829707,0.0017047818,0.00009239658],"about_ca_topic_score_codex":0.0000011946347,"about_ca_topic_score_gemma":0.0000018376084,"teacher_disagreement_score":0.8608802,"about_ca_system_score_codex":0.000025214791,"about_ca_system_score_gemma":0.00003389403,"threshold_uncertainty_score":0.49605435},"labels":[],"label_agreement":null},{"id":"W2061275048","doi":"10.1080/02564602.2003.11417089","title":"Advance Resource Reservation in High Speed Communication Networks: A Survey","year":2003,"lang":"en","type":"article","venue":"IETE Technical Review","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Reservation; Telecommunications; Quality of service; Telecommunications engineering; Service (business); Resource (disambiguation); Engineering; Engineering management; Computer science; Business; Computer network","score_opus":0.025629352490449633,"score_gpt":0.2801315707398115,"score_spread":0.25450221824936187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061275048","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010949485,0.31867662,0.66173977,0.010393702,0.00019862835,0.0018091692,0.0000024235997,0.0007374469,0.005347304],"genre_scores_gemma":[0.8573768,0.11009703,0.025963614,0.0060853683,0.000035425357,0.00012355897,0.000032624765,0.000021902097,0.00026367905],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99736786,0.0011601415,0.0005637389,0.00037064083,0.0002537249,0.00028387902],"domain_scores_gemma":[0.9975552,0.0007438172,0.00018555298,0.00132387,0.000109098015,0.00008247273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036127334,0.00014624457,0.00035934884,0.000044645618,0.00007062601,0.000048063306,0.00107179,0.00009525342,0.000017562566],"category_scores_gemma":[0.0012439489,0.00013453944,0.0000674989,0.0013337206,0.000050005863,0.00027759714,0.00012805857,0.00037595446,0.00003457535],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020192332,0.00016083894,0.0026839739,0.00018616582,0.000010536386,0.000009921128,0.000009760025,0.0039145984,0.000013773488,0.25827375,0.030154407,0.70456207],"study_design_scores_gemma":[0.0014303155,0.00016622688,0.057646636,0.00718433,0.000032224085,0.00003343658,0.0000022276129,0.08189667,0.000007858721,0.0080477055,0.8427208,0.0008315527],"about_ca_topic_score_codex":0.000029716362,"about_ca_topic_score_gemma":0.00018419432,"teacher_disagreement_score":0.8562819,"about_ca_system_score_codex":0.00007199481,"about_ca_system_score_gemma":0.000049551214,"threshold_uncertainty_score":0.5486359},"labels":[],"label_agreement":null},{"id":"W2061538980","doi":"10.1109/icns.2006.95","title":"Router Queue Size and Packet Drops in SmoothTCP-q","year":2006,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer network; Computer science; Internet Control Message Protocol; Link state packet; Router; Queue; Active queue management; Network packet; Random early detection; Bandwidth (computing); Processing delay; Real-time computing; Transmission delay; Network congestion","score_opus":0.0021179473325366985,"score_gpt":0.16827989527175707,"score_spread":0.16616194793922037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061538980","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4025551,0.0005558607,0.52144724,0.01123092,0.00047418347,0.00029834275,0.0000010813017,0.00048200367,0.06295526],"genre_scores_gemma":[0.9889259,0.000007457166,0.0064796456,0.000881703,0.00009003025,0.0000087152375,3.4664362e-7,0.0000035945518,0.0036026558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993138,0.000034434175,0.00013840433,0.0002316605,0.00009498414,0.00018673066],"domain_scores_gemma":[0.9996034,0.0001229889,0.000021731817,0.00019307756,0.00001838955,0.000040420295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012739302,0.000080957114,0.000100184574,0.000032677322,0.000030559044,0.000106256695,0.00019587332,0.000041261676,0.000037063153],"category_scores_gemma":[0.000008260134,0.00006750576,0.000019173616,0.00015799006,0.000024752086,0.00019754174,0.000060095274,0.00007020736,0.00003001195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009351212,0.000084056235,0.019348305,0.0000046227215,0.000005968053,0.000055168308,0.00012166716,0.0003426332,0.00011918485,0.6118264,0.0080790315,0.36000362],"study_design_scores_gemma":[0.0035384255,0.00013345559,0.3226185,0.000042870273,0.0000086403825,0.000054481305,0.000040792085,0.5781476,0.00021486387,0.048377797,0.04605688,0.0007657096],"about_ca_topic_score_codex":0.00018889255,"about_ca_topic_score_gemma":0.0005417881,"teacher_disagreement_score":0.58637077,"about_ca_system_score_codex":0.000012645367,"about_ca_system_score_gemma":0.000020279615,"threshold_uncertainty_score":0.2752805},"labels":[],"label_agreement":null},{"id":"W2062839275","doi":"10.1117/12.570252","title":"A framework for MPLS path setup in unidirectional multicast shared trees","year":2004,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Multicast; Computer science; Computer network; Distributed computing; Source-specific multicast; Inter-domain; Multiprotocol Label Switching; Protocol Independent Multicast; Xcast; Unicast; IP multicast; Pragmatic General Multicast; Multicast address; Scalability; Tree (set theory); Single point of failure; Quality of service","score_opus":0.012864665893850085,"score_gpt":0.2351239083534882,"score_spread":0.22225924245963813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062839275","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9710042,0.000118494354,0.02011449,0.0070041777,0.0004110711,0.0007642124,0.000049268354,0.00015220123,0.0003818827],"genre_scores_gemma":[0.48344782,0.000038809816,0.5155015,0.00017125187,0.00039942816,0.0003409116,0.000005667634,0.000032571465,0.000062012405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782634,1.8462345e-8,0.00064208155,0.00049617933,0.0005784021,0.0004569834],"domain_scores_gemma":[0.99800783,0.0003461662,0.00028866075,0.00007561642,0.0011519833,0.00012973539],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057660154,0.00029378262,0.00039197187,0.00012171987,0.00009782329,0.00019137988,0.0013337203,0.0002174433,0.000005179277],"category_scores_gemma":[0.00066777883,0.00025691095,0.0005427719,0.00048879546,0.00013816322,0.0007202304,0.00015920989,0.00033196536,0.0000015008734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008587714,0.00019113914,0.00016282234,0.00012866323,0.00018567019,1.5945204e-7,0.0003289636,0.0025823032,0.022178458,0.9708491,0.0007054769,0.002601378],"study_design_scores_gemma":[0.007177124,0.0010412412,0.003572769,0.00165757,0.00016658113,0.000047925954,0.0013009383,0.8663115,0.020469498,0.0902248,0.0068739173,0.0011561501],"about_ca_topic_score_codex":0.000010456667,"about_ca_topic_score_gemma":6.7430653e-7,"teacher_disagreement_score":0.8806243,"about_ca_system_score_codex":0.0002186217,"about_ca_system_score_gemma":0.000076304525,"threshold_uncertainty_score":0.9999883},"labels":[],"label_agreement":null},{"id":"W2063128435","doi":"10.1109/ccece.2006.277446","title":"Efficient Multiple-Link Adaptive Bandwidth Provisioning for End-to-End Quality of Service Guarantee","year":2006,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Provisioning; Computer network; Computer science; Quality of service; Bandwidth (computing); End-to-end principle; Dynamic bandwidth allocation; Bandwidth allocation; Distributed computing","score_opus":0.023231126117243567,"score_gpt":0.2613647698376197,"score_spread":0.23813364372037613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063128435","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076764114,0.00008082302,0.91793466,0.0028860422,0.00023985938,0.0007140995,0.000013058889,0.00016803211,0.0011993145],"genre_scores_gemma":[0.9118243,4.5650594e-7,0.08678879,0.0007684145,0.00014755165,0.000066387576,0.000004245226,0.0000087151675,0.00039118354],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982273,0.000089956746,0.0005035964,0.00047883275,0.00035443378,0.00034588817],"domain_scores_gemma":[0.9980699,0.0008382745,0.00016911213,0.00044458502,0.0004092777,0.00006887155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070168637,0.0001700525,0.00029450178,0.00008505729,0.000137681,0.000060238468,0.000584958,0.00006417519,0.000018506447],"category_scores_gemma":[0.00006278158,0.00014092283,0.00011673868,0.00043058585,0.00002820168,0.00008680579,0.00012858007,0.000084410225,0.000022348702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023366885,0.00021891404,0.00029265208,0.000036494504,0.000032456646,0.0000017192892,0.0004765636,0.25363615,0.0015118539,0.35116053,0.0006908491,0.39170817],"study_design_scores_gemma":[0.0014602947,0.00015156843,0.0029607925,0.000035829507,0.000008743253,0.0000013442622,0.000053289128,0.99198014,0.0009606387,0.0009553668,0.0012282645,0.00020372143],"about_ca_topic_score_codex":0.00050072046,"about_ca_topic_score_gemma":0.00057239557,"teacher_disagreement_score":0.8350601,"about_ca_system_score_codex":0.0000324404,"about_ca_system_score_gemma":0.00010224993,"threshold_uncertainty_score":0.5746666},"labels":[],"label_agreement":null},{"id":"W2063203387","doi":"10.1016/s0166-5316(01)00029-3","title":"WINTRAC: a TCP window adjustment scheme for bandwidth management","year":2001,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Computer science; Window (computing); HSTCP; Computer network; Bandwidth (computing); Scheme (mathematics); TCP global synchronization; Network congestion; Operating system; Mathematics; Network packet","score_opus":0.024510565279507998,"score_gpt":0.2702046739707384,"score_spread":0.24569410869123037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063203387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20525362,0.0006172857,0.78292316,0.0020479327,0.0011638021,0.0017872248,9.884127e-7,0.00023088812,0.0059750993],"genre_scores_gemma":[0.97097206,0.00029448135,0.026160091,0.0005103077,0.00037128766,0.0007594821,0.000016963528,0.000008808588,0.0009064953],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854755,0.000042304266,0.00023571364,0.00033733554,0.0005353731,0.00030171403],"domain_scores_gemma":[0.999218,0.000039860515,0.00009453258,0.00037330584,0.00020875092,0.00006557735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010173294,0.00013296798,0.00011849786,0.00008928229,0.00017945754,0.000078476085,0.00035889857,0.000042070766,0.00009549126],"category_scores_gemma":[0.000013425943,0.00012390935,0.000056604156,0.00026830978,0.000016725831,0.0005713836,0.00004964651,0.000063755586,0.000115971336],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037245292,0.00005148569,0.00054534327,0.000013453113,0.000027491615,5.6442053e-7,0.000097500044,0.006954601,0.000034614444,0.0047969725,0.0016926196,0.9857481],"study_design_scores_gemma":[0.0018187672,0.00012959201,0.02269019,0.000031631458,0.000037572307,0.0000063353873,0.000014295095,0.9566024,0.00009062417,0.0004392228,0.017983086,0.00015630826],"about_ca_topic_score_codex":7.5557705e-7,"about_ca_topic_score_gemma":0.0000023936361,"teacher_disagreement_score":0.9855918,"about_ca_system_score_codex":0.00011524325,"about_ca_system_score_gemma":0.00005804495,"threshold_uncertainty_score":0.5052877},"labels":[],"label_agreement":null},{"id":"W2064413237","doi":"10.1109/tla.2013.6533970","title":"A Token Based Method for Congestion and Packet Loss Control","year":2013,"lang":"en","type":"article","venue":"IEEE Latin America Transactions","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer network; Explicit Congestion Notification; Network congestion; Computer science; Packet loss; Network traffic control; Flow control (data); Token bucket; Network packet; TCP Friendly Rate Control; TCP tuning; Active queue management","score_opus":0.009469173611537072,"score_gpt":0.24015045220760492,"score_spread":0.23068127859606785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064413237","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008468091,0.00005217339,0.987882,0.009671639,0.0003347223,0.00073005876,0.000024728339,0.00026451744,0.00019335013],"genre_scores_gemma":[0.7638739,0.000010904052,0.23353001,0.0017288418,0.00006785144,0.0005533903,0.000002486786,0.000011585804,0.00022104425],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883914,0.00013504665,0.00023681713,0.00035956563,0.00013840127,0.0002910285],"domain_scores_gemma":[0.99842316,0.0008986856,0.000093270544,0.00027883396,0.00014687142,0.00015916445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015172074,0.00016385713,0.00024319853,0.00007768898,0.00022494722,0.0001481758,0.0002102704,0.00007137597,0.00011856473],"category_scores_gemma":[0.000015191392,0.00015407645,0.000102173784,0.00025091114,0.00008727445,0.00034974914,0.00000225995,0.00013967365,0.000035022626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002061465,0.000057819016,0.000047347792,0.0000097087,0.00004549099,0.0000010099011,0.0001229848,0.014147943,0.0006179569,0.00075269275,0.0009824435,0.983194],"study_design_scores_gemma":[0.0016557748,0.0001505304,0.0010161505,0.000011925601,0.000051373707,0.000007759996,0.000022252969,0.9874823,0.00013589114,0.00060546707,0.008660332,0.00020020925],"about_ca_topic_score_codex":0.00009753878,"about_ca_topic_score_gemma":0.000014562147,"teacher_disagreement_score":0.9829938,"about_ca_system_score_codex":0.00002207572,"about_ca_system_score_gemma":0.000061296516,"threshold_uncertainty_score":0.6283055},"labels":[],"label_agreement":null},{"id":"W2067209328","doi":"10.1109/icnp.2013.6733610","title":"Multi-Resource Round Robin: A low complexity packet scheduler with Dominant Resource Fairness","year":2013,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Fair queuing; Weighted fair queueing; Network packet; Computer network; Queueing theory; Schedule; Layered queueing network; Weighted round robin; Bandwidth (computing); Network scheduler; Resource (disambiguation); Generalized processor sharing; Distributed computing; Round-robin scheduling; Processing delay; Transmission delay; Quality of service; Operating system; Dynamic priority scheduling","score_opus":0.01922403941702558,"score_gpt":0.21800262460809033,"score_spread":0.19877858519106475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067209328","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062796324,0.000095302494,0.92762196,0.0045045987,0.00010800582,0.0006284561,0.0000015522758,0.00045569264,0.0037881033],"genre_scores_gemma":[0.9153394,0.0000017413741,0.07689153,0.0017866737,0.0001251869,0.00010993823,0.0000055337964,0.000022679218,0.0057172887],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977875,0.00016498532,0.00031487635,0.0006960427,0.00041088465,0.0006257154],"domain_scores_gemma":[0.99826705,0.00016221486,0.00013093332,0.0009644467,0.00017686219,0.0002984653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029547332,0.00031414573,0.00034073874,0.00008227241,0.00028368077,0.0005435966,0.0011207762,0.00010455553,0.00025158963],"category_scores_gemma":[0.000017445287,0.00021933006,0.00008677659,0.0004260948,0.00023645078,0.0006234077,0.00026570214,0.00027071443,0.00059419085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002514738,0.0016322618,0.0033087383,0.00011001496,0.00027088844,0.00015075623,0.0021838907,0.014111806,0.001111479,0.25865275,0.07209433,0.6461216],"study_design_scores_gemma":[0.0034117273,0.00020306408,0.007462444,0.000090877715,0.000019095809,0.00007755803,0.0003119237,0.9569779,0.00028766016,0.00046830624,0.029985579,0.0007038605],"about_ca_topic_score_codex":0.00018066927,"about_ca_topic_score_gemma":0.00014683849,"teacher_disagreement_score":0.9428661,"about_ca_system_score_codex":0.000054219334,"about_ca_system_score_gemma":0.0000809807,"threshold_uncertainty_score":0.894402},"labels":[],"label_agreement":null},{"id":"W2068164281","doi":"10.1142/s0219265908002369","title":"A NOVEL SPECTRUM OF EPOCH CONVERGENT CONGESTION CONTROL","year":2008,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Bottleneck; Computer science; Network congestion; Bandwidth (computing); Computer network; Software deployment; Epoch (astronomy); HSTCP; Distributed computing; TCP Friendly Rate Control","score_opus":0.012417037974140578,"score_gpt":0.20822146436458364,"score_spread":0.19580442639044307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068164281","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06871887,0.0006308199,0.92524636,0.0014496536,0.0035483819,0.00012225939,9.1501585e-7,0.00004394735,0.0002388017],"genre_scores_gemma":[0.9961039,0.00027066833,0.0023162744,0.00039831206,0.00078378484,0.0000038866538,4.906612e-7,0.00001072368,0.00011198181],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981625,0.00012224886,0.0009202733,0.00019642836,0.0003434203,0.00025514708],"domain_scores_gemma":[0.9978575,0.00030044976,0.00096067664,0.00025937817,0.00046404992,0.00015793314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006289328,0.00017273487,0.00045221543,0.00022307933,0.00010377215,0.000035186054,0.0005096372,0.00012861966,0.00006329098],"category_scores_gemma":[0.00009614954,0.0001496444,0.00028683292,0.00035799306,0.00009135705,0.0005091171,0.00004143019,0.00041481314,0.000006820278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014237883,0.001244236,0.007868849,0.00003620765,0.001180863,0.0002942395,0.0012634316,0.75235456,0.0054126424,0.081520714,0.020497696,0.12690276],"study_design_scores_gemma":[0.0049775047,0.0012662049,0.0063793627,0.00020548972,0.00007458379,0.004689927,0.00006731457,0.978074,0.0006883886,0.0007066052,0.002580931,0.00028967264],"about_ca_topic_score_codex":0.000012512366,"about_ca_topic_score_gemma":0.000012455245,"teacher_disagreement_score":0.92738503,"about_ca_system_score_codex":0.00008767441,"about_ca_system_score_gemma":0.00010963303,"threshold_uncertainty_score":0.6102321},"labels":[],"label_agreement":null},{"id":"W2068186343","doi":"10.1002/pamm.200700903","title":"Performance & packet traffic dynamics of Packet Switching Network model","year":2007,"lang":"en","type":"article","venue":"PAMM","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer network; Computer science; Hierarchical routing; Distributed computing; Network packet; Network congestion; Network traffic control; Routing protocol; Traffic generation model; Static routing","score_opus":0.013567162493483966,"score_gpt":0.22897157521709052,"score_spread":0.21540441272360655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068186343","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3574645,0.000118971395,0.6397748,0.00025869432,0.000295372,0.00009122189,0.0000012704222,0.00014307263,0.0018520737],"genre_scores_gemma":[0.9666493,0.00005021146,0.0324499,0.00023007503,0.00021558972,0.0000050353356,0.0000065274567,0.000013449902,0.0003798968],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984472,0.00003459236,0.00038071704,0.00031411482,0.00030062973,0.00052279007],"domain_scores_gemma":[0.99893075,0.0001571908,0.00016071825,0.00053150277,0.000089096466,0.00013076515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009386833,0.00017083282,0.00023636775,0.00006644249,0.00014064954,0.00004817704,0.0006572273,0.00009179699,0.00000867772],"category_scores_gemma":[0.000016889035,0.0001610689,0.00008761675,0.00040739862,0.000037663878,0.00026978948,0.00010096172,0.00021995007,0.000037709964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002022681,0.000032158176,0.00095489924,0.000012116043,0.000014481358,0.0000023182872,0.00026748131,0.38218924,0.000014987496,0.016456889,0.0007019457,0.5993332],"study_design_scores_gemma":[0.00031120505,0.000035955218,0.00089549954,0.00003771898,0.000009972603,0.000008871821,0.000012999031,0.99696606,0.000010241872,0.0007631603,0.00076458044,0.00018374166],"about_ca_topic_score_codex":0.0000027339988,"about_ca_topic_score_gemma":0.00015596641,"teacher_disagreement_score":0.6147768,"about_ca_system_score_codex":0.000051164556,"about_ca_system_score_gemma":0.00007027609,"threshold_uncertainty_score":0.65681994},"labels":[],"label_agreement":null},{"id":"W2068242377","doi":"10.5555/380921.380946","title":"Modeling and verifying a price model for congestion control in computer networks using promela/spin","year":2001,"lang":"en","type":"article","venue":"International workshop on Model Checking Software","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Promela; Computer science; Convergence (economics); Network congestion; Network packet; Enforcement; Model checking; Computer network; Theoretical computer science","score_opus":0.03884762681953042,"score_gpt":0.2883049922359541,"score_spread":0.24945736541642372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068242377","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042277016,0.00021508921,0.9552922,0.0009207744,0.00046627957,0.00054185296,0.0000056229683,0.00025379017,0.000027371592],"genre_scores_gemma":[0.8214853,0.00005354969,0.1769087,0.0010703595,0.0002585474,0.0001075687,0.000010914545,0.000030102152,0.000074946394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789447,0.00004642729,0.00048760365,0.0007266061,0.00037271934,0.00047220587],"domain_scores_gemma":[0.9988761,0.00029264245,0.00014751437,0.00029245144,0.00027355886,0.000117751006],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048862497,0.00029860562,0.0003169159,0.00025804157,0.00019342976,0.00032064822,0.0006012927,0.0002043816,0.000002234417],"category_scores_gemma":[0.00009870432,0.00031758216,0.000103038255,0.00024512137,0.000033935547,0.0006390161,0.00013593059,0.00038557875,0.0000013583883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013709132,0.00006057142,0.00037128007,0.000007750504,0.00003253754,0.000008352603,0.00022825216,0.87402654,0.00001017137,0.0044429237,0.000020511867,0.12065401],"study_design_scores_gemma":[0.0019801604,0.000027247714,0.00003808264,0.0003757209,0.0000141488,0.000021977772,0.0000079485835,0.9942212,7.226239e-7,0.0029602707,0.000024131521,0.00032835398],"about_ca_topic_score_codex":0.0000078135035,"about_ca_topic_score_gemma":0.000016686268,"teacher_disagreement_score":0.7792083,"about_ca_system_score_codex":0.00023891439,"about_ca_system_score_gemma":0.00009791081,"threshold_uncertainty_score":0.99992764},"labels":[],"label_agreement":null},{"id":"W2068893122","doi":"10.1145/512840.512843","title":"A case for context-aware TCP/IP","year":2002,"lang":"en","type":"article","venue":"ACM SIGMETRICS Performance Evaluation Review","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Computer network; Random early detection; Network congestion; Packet loss; Transmission Control Protocol; Context (archaeology); Operating system; Network packet; Active queue management; Biology","score_opus":0.1319695618140418,"score_gpt":0.32249364302040867,"score_spread":0.19052408120636688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068893122","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010143407,0.44317248,0.5237299,0.012666486,0.0018987077,0.006232882,0.000014278942,0.00051449385,0.0016273585],"genre_scores_gemma":[0.9321922,0.053449344,0.006763463,0.0059260796,0.00020028955,0.00094227213,0.000013810804,0.000017144004,0.00049539487],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977456,0.00017031802,0.00057436887,0.00047115056,0.0006883008,0.0003502755],"domain_scores_gemma":[0.9968381,0.0007049368,0.00029036007,0.0011251888,0.00091072347,0.00013067258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028422724,0.00021188633,0.0003685101,0.00023173098,0.00029640528,0.00011283647,0.00096044,0.000076095756,0.00041003275],"category_scores_gemma":[0.0019244174,0.00018809184,0.00015890425,0.0019909835,0.000028147602,0.00070031383,0.00012612561,0.0001535742,0.0003522326],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015013699,0.0000362915,0.00007822383,0.00030034172,0.000016464975,0.000009873768,0.00004195932,0.00016484177,3.2601562e-7,0.0010660194,0.026231742,0.9720524],"study_design_scores_gemma":[0.00089963374,0.00015030427,0.00006406257,0.00043972192,0.00011932222,0.00031848694,0.000005943087,0.8950956,0.0000074938403,0.00009770173,0.102553725,0.0002480293],"about_ca_topic_score_codex":0.0000015700778,"about_ca_topic_score_gemma":0.0000023263824,"teacher_disagreement_score":0.9718044,"about_ca_system_score_codex":0.000105734376,"about_ca_system_score_gemma":0.0000834459,"threshold_uncertainty_score":0.7670163},"labels":[],"label_agreement":null},{"id":"W2070156898","doi":"10.1109/mcom.2002.1047004","title":"Voice over MPLS compared to voice over other packet transport technologies","year":2002,"lang":"en","type":"article","venue":"IEEE Communications Magazine","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Multiprotocol Label Switching; Voice over IP; Computer network; Network packet; Header; Circuit switching; Telecommunications; Quality of service; The Internet","score_opus":0.03839464132258156,"score_gpt":0.2711654926759749,"score_spread":0.23277085135339334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070156898","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046632722,0.0073565915,0.7629093,0.09597645,0.0017765258,0.0022786923,0.00014409715,0.006893524,0.0760321],"genre_scores_gemma":[0.9703735,0.00031032556,0.023568872,0.0021338526,0.00007373821,0.00016574652,0.0000084818985,0.000026036607,0.0033394236],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99833244,0.000118681004,0.0004268377,0.00042530152,0.00029436543,0.00040237038],"domain_scores_gemma":[0.99516547,0.0003040913,0.00013138767,0.0041226065,0.00015878727,0.000117657866],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00023832121,0.00025078873,0.00030238973,0.00020268523,0.00030185486,0.000114053924,0.0039501954,0.000121991965,0.00014452678],"category_scores_gemma":[0.000039833445,0.00024623924,0.00010757525,0.0010704311,0.00019206786,0.00040259253,0.00029817902,0.00035762574,0.0020574906],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044020115,0.0015600008,0.0065443413,0.0000323426,0.00025164365,0.000021633488,0.002457306,0.0032537177,0.0034676143,0.061967425,0.46939465,0.45100528],"study_design_scores_gemma":[0.00082163844,0.000055692133,0.008113585,0.000053492553,0.000029592222,0.000011392294,0.000033259195,0.16461045,0.00008561741,0.0007085578,0.8250518,0.0004249158],"about_ca_topic_score_codex":0.000031445114,"about_ca_topic_score_gemma":0.00045102494,"teacher_disagreement_score":0.9237408,"about_ca_system_score_codex":0.00006304315,"about_ca_system_score_gemma":0.00002631113,"threshold_uncertainty_score":0.999999},"labels":[],"label_agreement":null},{"id":"W20702853","doi":"10.1095/biolreprod.110.085480","title":"Análisis y modelado de multicast inter-dominio para el soporte de servicios de video","year":2009,"lang":"en","type":"dissertation","venue":"Biology of Reproduction","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Institutes of Health Research","keywords":"Humanities; Multicast; Computer science; Art; Computer network","score_opus":0.015331834956158912,"score_gpt":0.28859052211431196,"score_spread":0.27325868715815305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W20702853","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4520327,0.0036144522,0.5388246,0.0023486356,0.0018811713,0.00044341246,0.000007522484,0.00031844387,0.0005290859],"genre_scores_gemma":[0.97271705,0.0005569728,0.024644822,0.0001693651,0.0008026662,0.00008472517,0.00014345316,0.000020553995,0.00086040725],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773896,0.0002501951,0.00050485285,0.00095600885,0.00011266509,0.0004373404],"domain_scores_gemma":[0.9981737,0.000066768574,0.0004865337,0.0009086412,0.00025965236,0.000104691266],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009230409,0.00027650502,0.00043905064,0.0002107081,0.00010335264,0.000032228352,0.00061900343,0.00052718073,0.000011512962],"category_scores_gemma":[0.00016063049,0.00028221594,0.00016976387,0.0002454619,0.000065609776,0.00016619769,0.000036855377,0.00037107358,0.000015301868],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021292399,0.000151892,0.0008675912,0.00006008416,0.00011215493,0.000008326647,0.0012655839,0.0018962226,0.0044181016,0.002829605,0.0011819127,0.9869956],"study_design_scores_gemma":[0.0034555,0.0016529254,0.07022507,0.00072879303,0.00056578644,0.0006962059,0.0012676445,0.813238,0.033799615,0.03784319,0.034294322,0.0022329006],"about_ca_topic_score_codex":0.00015501742,"about_ca_topic_score_gemma":0.00010049104,"teacher_disagreement_score":0.9847627,"about_ca_system_score_codex":0.00013196601,"about_ca_system_score_gemma":0.0003387722,"threshold_uncertainty_score":0.999963},"labels":[],"label_agreement":null},{"id":"W2072697263","doi":"10.1007/s11235-007-9038-0","title":"A model of user behavior in multi-service priced networks","year":2007,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Computer science; Quality of service; Context (archaeology); Service (business); Mobile QoS; User satisfaction; Class (philosophy); Stability (learning theory); Computer network; Distributed computing; Human–computer interaction; Service provider; Artificial intelligence; Machine learning","score_opus":0.05834147422572645,"score_gpt":0.2891169473300427,"score_spread":0.23077547310431623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072697263","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0754702,0.00070474,0.922377,0.00016521587,0.0001473015,0.0004824359,7.2946585e-7,0.00013033375,0.00052207464],"genre_scores_gemma":[0.97596735,0.000046658042,0.023528218,0.00017078574,0.000020415931,0.00009561479,0.0000046830733,0.000010043292,0.00015622537],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859875,0.0001454663,0.0006160501,0.00020503819,0.00018079212,0.00025390767],"domain_scores_gemma":[0.9979679,0.00021008318,0.00027554645,0.0012561328,0.00022246475,0.000067852256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012272876,0.00011519238,0.0002292619,0.00014421022,0.000058421425,0.00004642834,0.0014235966,0.000113126844,0.0000016161072],"category_scores_gemma":[0.000014362303,0.000116415635,0.000042198004,0.0006717878,0.000021078684,0.00025348592,0.00017905282,0.0002055677,0.000011761839],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043916247,0.0007000668,0.012921757,0.000044621498,0.000029954172,0.0000035991673,0.0016937887,0.8192031,0.001888979,0.056192454,0.00016427148,0.107113525],"study_design_scores_gemma":[0.0006108846,0.000014985925,0.011460464,0.00003668937,0.0000054924403,0.0000040429777,0.00006923144,0.9873399,0.00001859977,0.000008063292,0.00031483133,0.00011679314],"about_ca_topic_score_codex":0.00020093335,"about_ca_topic_score_gemma":0.00058941357,"teacher_disagreement_score":0.90049714,"about_ca_system_score_codex":0.000062270294,"about_ca_system_score_gemma":0.000054213033,"threshold_uncertainty_score":0.47472918},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.023827562259942574,"score_gpt":0.23874309551863138,"score_spread":0.2149155332586888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073410927","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88064307,0.00010969645,0.114845686,0.000083947874,0.00017503694,0.00012265927,4.8991424e-8,0.000102043094,0.0039178445],"genre_scores_gemma":[0.99644285,0.0000010506425,0.0026023898,0.00016747793,0.00004271994,0.00001051568,7.336567e-8,0.0000026989064,0.0007302366],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994136,0.000029608496,0.00013175742,0.0001613486,0.00015756636,0.00010612685],"domain_scores_gemma":[0.9996383,0.000030455816,0.000028435543,0.00023934213,0.000026665202,0.000036767407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000049807244,0.000060509934,0.000097746175,0.000027228622,0.000060716975,0.000013209561,0.0002905143,0.000015346064,0.00004641328],"category_scores_gemma":[0.0000018302742,0.0000487578,0.00002728344,0.00010026812,0.00001676753,0.00016348393,0.00008329346,0.00003635903,0.000023920104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017017775,0.02183326,0.085825644,0.0000138760015,0.00049371587,0.0005989693,0.09139021,0.0056271576,0.015478328,0.18680939,0.022261318,0.56949794],"study_design_scores_gemma":[0.01833164,0.008475334,0.078514695,0.00004339981,0.000042146276,0.00030991875,0.009052756,0.8263017,0.049360808,0.00027733258,0.00747396,0.0018163383],"about_ca_topic_score_codex":0.000022315087,"about_ca_topic_score_gemma":0.0000031303337,"teacher_disagreement_score":0.82067454,"about_ca_system_score_codex":0.000007913498,"about_ca_system_score_gemma":0.0000141349565,"threshold_uncertainty_score":0.19882855},"labels":[],"label_agreement":null},{"id":"W2073814030","doi":"10.1016/j.comnet.2007.01.021","title":"Achieving optimal revenues in dynamically priced network services with QoS guarantees","year":2007,"lang":"en","type":"article","venue":"Computer Networks","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Quality of service; Revenue; Computer network; Bandwidth (computing); Heuristic; Bandwidth allocation; Path (computing); Service (business); Mathematical optimization; Distributed computing; Business","score_opus":0.002567059222805904,"score_gpt":0.1890420383085572,"score_spread":0.1864749790857513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073814030","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08112609,0.001096119,0.9154224,0.000327955,0.0010836262,0.0003133478,3.4553528e-7,0.00035500858,0.00027514913],"genre_scores_gemma":[0.8467084,0.00004587093,0.14960217,0.001246129,0.0022957213,0.000015322217,0.000009430642,0.000026415828,0.000050532668],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997382,0.00012776723,0.00051445205,0.0006923524,0.00031833292,0.0009650838],"domain_scores_gemma":[0.9985268,0.00037277216,0.00020219787,0.00063686044,0.00008788008,0.00017350278],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009368875,0.00033175823,0.00040960824,0.000120632474,0.00017857192,0.00029109302,0.0013200082,0.00017068096,0.000003983033],"category_scores_gemma":[0.0000024249737,0.0002904091,0.000085519925,0.0009358933,0.00006537564,0.00046875767,0.00035481312,0.00051047676,0.000017916918],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087962275,0.000059517854,0.010130482,0.000015186319,0.00003727192,0.00017687182,0.00024911264,0.6740222,0.0000024955725,0.004450158,0.0004986987,0.31027007],"study_design_scores_gemma":[0.00082369195,0.00017658692,0.044866152,0.0003623921,0.000010927135,0.000052308493,0.000009409831,0.95095176,6.5116285e-7,0.00007453429,0.0023065635,0.00036503345],"about_ca_topic_score_codex":0.000011465483,"about_ca_topic_score_gemma":0.00023507001,"teacher_disagreement_score":0.7658202,"about_ca_system_score_codex":0.00006212264,"about_ca_system_score_gemma":0.000038994094,"threshold_uncertainty_score":0.9999548},"labels":[],"label_agreement":null},{"id":"W2074710476","doi":"10.1145/1185373.1185412","title":"Achieving optimal revenues in dynamically priced network services with QoS guarantees","year":2006,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Quality of service; Computer science; Revenue; Computer network; Bandwidth (computing); Heuristic; Bandwidth allocation; Path (computing); Service (business); Distributed computing; Mathematical optimization; Business; Mathematics","score_opus":0.0014888374803297346,"score_gpt":0.16366999747445435,"score_spread":0.1621811599941246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074710476","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3996219,0.000428501,0.5940085,0.001372795,0.00017738751,0.00021654194,4.98255e-7,0.00031168517,0.0038621717],"genre_scores_gemma":[0.9330496,0.0000078872035,0.06571324,0.00038634427,0.0002953607,0.000018177052,0.0000033835552,0.000007946725,0.0005180414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886924,0.000058748858,0.0002178271,0.00032016743,0.00018677619,0.00034721996],"domain_scores_gemma":[0.9994814,0.00008888451,0.00007254136,0.00027821865,0.00004147035,0.00003748629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002024726,0.00013601601,0.00017308713,0.000046457277,0.00007790947,0.00015091621,0.00055250456,0.000049400944,0.000007939467],"category_scores_gemma":[0.0000017275092,0.000104937724,0.000031415537,0.0004164951,0.000024681403,0.00033321438,0.000082734405,0.00012695404,0.00002343437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012844955,0.00021107538,0.05864388,0.000049034206,0.000041369054,0.0001495851,0.00032373352,0.652395,0.00021126673,0.15659215,0.0015329083,0.12972157],"study_design_scores_gemma":[0.0008016603,0.00010722823,0.069434255,0.00016130219,0.000007769803,0.000019814766,0.000022769063,0.9266161,0.000005894902,0.0004266286,0.0021145316,0.00028206894],"about_ca_topic_score_codex":0.00010065554,"about_ca_topic_score_gemma":0.0010904596,"teacher_disagreement_score":0.5334277,"about_ca_system_score_codex":0.000021788535,"about_ca_system_score_gemma":0.0000342236,"threshold_uncertainty_score":0.42792362},"labels":[],"label_agreement":null},{"id":"W2074717607","doi":"10.1002/nem.539","title":"DRED‐MP: Queue management with multiple levels of drop precedence","year":2004,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Active queue management; Computer science; Network packet; Queue; Computer network; Drop (telecommunication); Network congestion; Queue management system; Queueing theory; Priority queue; Distributed computing; Telecommunications","score_opus":0.009270980478158003,"score_gpt":0.22872944832325584,"score_spread":0.21945846784509784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074717607","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008143843,0.0002837656,0.98181784,0.0023187036,0.0015383088,0.00024952748,0.0000022338354,0.000039419792,0.005606369],"genre_scores_gemma":[0.91372764,0.00023153886,0.08480874,0.0003932863,0.00038039446,0.000009912049,8.9291296e-7,0.000010237835,0.0004373753],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99781966,0.00004966346,0.0006035052,0.0002421065,0.0010250201,0.00026002715],"domain_scores_gemma":[0.9985268,0.00006975868,0.0005964733,0.00029956584,0.00041039314,0.0000970014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049467164,0.00016912434,0.0002321533,0.00020162208,0.000055733715,0.00012107216,0.0017480131,0.000032442036,0.00002380287],"category_scores_gemma":[0.000006889569,0.00013907038,0.00012104723,0.00031310724,0.000055631983,0.0004477406,0.00030129496,0.00015583051,0.000012530625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018110526,0.0002062422,0.00067375775,0.000020594667,0.0010096582,0.0005774339,0.00015340283,0.5046968,0.000008748626,0.17194922,0.0013124313,0.31921062],"study_design_scores_gemma":[0.072275475,0.004812493,0.2193374,0.011632925,0.0012403474,0.0023844994,0.0014019106,0.35554728,0.0011002813,0.1479098,0.17879798,0.0035596155],"about_ca_topic_score_codex":0.0000058966043,"about_ca_topic_score_gemma":0.000018299226,"teacher_disagreement_score":0.9055838,"about_ca_system_score_codex":0.00014914034,"about_ca_system_score_gemma":0.00004519274,"threshold_uncertainty_score":0.56711257},"labels":[],"label_agreement":null},{"id":"W2076374456","doi":"10.1080/01621459.2000.10474289","title":"Internet Traffic Data","year":2000,"lang":"en","type":"article","venue":"Journal of the American Statistical Association","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Computer science; Internet traffic; The Internet; World Wide Web","score_opus":0.01525988860597554,"score_gpt":0.25276474259739656,"score_spread":0.23750485399142102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076374456","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16793019,0.000091843714,0.8124763,0.017532898,0.00083098,0.00009944759,0.000041568474,0.00004951392,0.0009472679],"genre_scores_gemma":[0.98286015,0.000032620464,0.014671299,0.0010858364,0.00023501935,5.258542e-7,0.0000018571225,0.000004174502,0.0011085062],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986981,0.00024931275,0.00032318747,0.000121570134,0.0004512133,0.00015660553],"domain_scores_gemma":[0.9983351,0.0005665905,0.0006022499,0.00032779993,0.000099244186,0.000069005924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064670655,0.00006599202,0.00019340075,0.000023536462,0.00004736784,0.000102721846,0.0013578258,0.00001762791,0.00009302057],"category_scores_gemma":[0.00033949455,0.000043235515,0.000051327293,0.00025848878,0.00004631225,0.00026074937,0.000082172526,0.00021729669,0.000048432285],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020297499,0.000042951942,0.00074715225,5.891181e-7,0.000049267073,0.0000053151293,0.000057713598,0.0007837647,0.0000032287649,0.0025854306,0.061728198,0.9339761],"study_design_scores_gemma":[0.00080583745,0.0003504759,0.0886904,0.000031894084,0.000108931075,0.00007666407,0.000029295701,0.8245991,0.00000585508,0.0021818166,0.08291865,0.00020108865],"about_ca_topic_score_codex":0.000009597771,"about_ca_topic_score_gemma":0.0000068328814,"teacher_disagreement_score":0.933775,"about_ca_system_score_codex":0.00012761382,"about_ca_system_score_gemma":0.00008175381,"threshold_uncertainty_score":0.25232008},"labels":[],"label_agreement":null},{"id":"W2077660038","doi":"10.1109/iccve.2013.6799895","title":"A data dissemination protocol using route sharing","year":2013,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Protocol (science); Computer science; Computer network; Routing protocol; Zone Routing Protocol; Transmission (telecommunications); Dissemination; Data transmission; Routing (electronic design automation); Enhanced Interior Gateway Routing Protocol; Distributed computing; State (computer science); Wireless Routing Protocol; Telecommunications","score_opus":0.054873997746881696,"score_gpt":0.33122415395431826,"score_spread":0.2763501562074366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077660038","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011241597,0.0000023491737,0.9765218,0.00061506056,0.00007456346,0.017688496,8.29181e-7,0.00021910403,0.0037536316],"genre_scores_gemma":[0.81239766,3.1730744e-7,0.14862944,0.00044609964,0.00025799824,0.034082904,0.000011825126,0.000012930635,0.0041608233],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992407,0.000014525716,0.00013488303,0.00032091484,0.00013428567,0.00015468936],"domain_scores_gemma":[0.9990163,0.00003387474,0.00004508804,0.00079325243,0.000056680226,0.000054796787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015259684,0.00006753965,0.000063530155,0.000030668118,0.00007570876,0.00034465682,0.0012016253,0.000025024243,0.00013205547],"category_scores_gemma":[0.0000130044755,0.000054849872,0.000013021852,0.00015553708,0.00000946528,0.0014447407,0.000514928,0.000052604384,0.00011209621],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011995206,0.000029872073,0.00069933094,0.000006404953,0.00000742001,0.0000016587749,0.000046788813,0.00021078704,0.00035823215,0.027203549,0.0050909948,0.96634376],"study_design_scores_gemma":[0.00013901196,0.000007676442,0.00057536084,0.00001696772,0.000001673722,0.0000043745663,0.0000058922087,0.99428916,0.000033698507,0.0006157579,0.004230457,0.000079996535],"about_ca_topic_score_codex":0.00004165823,"about_ca_topic_score_gemma":0.00000863826,"teacher_disagreement_score":0.99407834,"about_ca_system_score_codex":0.000017795252,"about_ca_system_score_gemma":0.000025211086,"threshold_uncertainty_score":0.33235335},"labels":[],"label_agreement":null},{"id":"W2077951103","doi":"10.1007/s10922-013-9276-2","title":"Distributed Schemes for Routing Table Management in Next Generation Routers","year":2013,"lang":"en","type":"article","venue":"Journal of Network and Systems Management","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; École de Technologie Supérieure","funders":"","keywords":"Computer science; Computer network; Routing table; Scalability; Router; Distributed computing; Routing domain; Policy-based routing; Routing protocol; Routing (electronic design automation); Forwarding plane; Static routing; Operating system; Network packet","score_opus":0.027476695194458067,"score_gpt":0.22673611242032948,"score_spread":0.19925941722587143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077951103","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014177752,0.0017536334,0.9806615,0.0008170155,0.001271569,0.000821691,5.25316e-7,0.000023458864,0.00047283596],"genre_scores_gemma":[0.9815008,0.00034469797,0.016707871,0.00018081877,0.0006427004,0.00009684553,0.000003389018,0.00000752406,0.0005153727],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985653,0.00007524947,0.00061171944,0.00019874153,0.00023030413,0.00031867696],"domain_scores_gemma":[0.99922246,0.000051255334,0.00035421338,0.00017889426,0.00010824722,0.00008492164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008684827,0.00013041418,0.00025864918,0.00010650343,0.000117826385,0.0005579488,0.0003180886,0.000037259586,0.0000022345166],"category_scores_gemma":[0.000004042364,0.000109311986,0.000057728404,0.00027562186,0.000010641374,0.0006058654,0.00010389347,0.00008381108,0.0000029362457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023298859,0.00007393547,0.00097232166,0.00014603467,0.00034818304,0.00005476899,0.000117373726,0.19696458,0.000016031685,0.18960008,0.05650654,0.55517685],"study_design_scores_gemma":[0.0011943431,0.000075399534,0.0009243159,0.0001916218,0.00003406792,0.000015201387,0.00024634378,0.95743394,6.977601e-7,0.00042817948,0.039324593,0.00013131202],"about_ca_topic_score_codex":0.000008722883,"about_ca_topic_score_gemma":0.000002682574,"teacher_disagreement_score":0.967323,"about_ca_system_score_codex":0.00007035986,"about_ca_system_score_gemma":0.000009113316,"threshold_uncertainty_score":0.5380313},"labels":[],"label_agreement":null},{"id":"W2078438985","doi":"10.5555/1400549.1400661","title":"Using simulation to evaluate traffic engineering management services in maritime networks","year":2008,"lang":"en","type":"article","venue":"Spring Simulation Multiconference","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Communications Research Centre Canada","funders":"","keywords":"Network traffic simulation; Computer science; Traffic generation model; Computer network; Quality of service; Traffic engineering; Multiprotocol Label Switching; Network traffic control; Traffic shaping; Internet traffic engineering; Queueing theory; Traffic optimization; Floating car data; Engineering; Transport engineering; Traffic congestion","score_opus":0.03528268473231966,"score_gpt":0.27883231474813436,"score_spread":0.2435496300158147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078438985","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41636246,0.000034501227,0.58289534,0.00003314291,0.00016850428,0.00029296923,2.2436876e-7,0.00017452028,0.000038339593],"genre_scores_gemma":[0.9496077,0.0000086319005,0.050122388,0.00012090369,0.00007720531,0.000019217423,0.0000017233721,0.000016175052,0.00002607662],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830234,0.00006825549,0.0004065759,0.00049084675,0.000327858,0.0004041075],"domain_scores_gemma":[0.99900985,0.00023511169,0.000087136345,0.0004155216,0.0001248483,0.00012751625],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000289915,0.0002166056,0.00021318685,0.00028368048,0.00014678795,0.00012319403,0.00046775973,0.00008155655,0.000011405881],"category_scores_gemma":[0.000021764366,0.00024798457,0.00004936196,0.0005645774,0.00001401387,0.0005083748,0.00015716009,0.0001613365,0.000033319397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012426581,0.00002853869,0.0019196402,0.000017446715,0.000010652439,0.000017943703,0.00032145737,0.93927044,0.00002992705,0.0013880883,1.9653311e-7,0.056983247],"study_design_scores_gemma":[0.0007211943,0.000015572356,0.04353399,0.00013518856,0.000008789754,0.000001951305,0.000010087956,0.95520633,0.000005659412,0.000015634612,0.00009204853,0.0002535419],"about_ca_topic_score_codex":0.000037610305,"about_ca_topic_score_gemma":0.00002746064,"teacher_disagreement_score":0.5332452,"about_ca_system_score_codex":0.00011526121,"about_ca_system_score_gemma":0.000028996015,"threshold_uncertainty_score":0.99999726},"labels":[],"label_agreement":null},{"id":"W2078459375","doi":"10.1109/policy.2007.1","title":"A Multi-level Policy Representation for Management Services in Maritime Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"Defence Research and Development Canada","keywords":"XML; Computer science; Representation (politics); Conflict resolution; Network management; World Wide Web; Computer network","score_opus":0.024781388996189074,"score_gpt":0.29463406569151435,"score_spread":0.26985267669532526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078459375","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00073857466,0.000061855935,0.9936249,0.0015768335,0.00016526459,0.0004354361,5.963521e-7,0.00013133674,0.0032651871],"genre_scores_gemma":[0.74964386,0.000021142054,0.24517468,0.0018255763,0.00018105935,0.00005921044,0.0000059607905,0.000006348613,0.003082165],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990316,0.000019430385,0.00022537287,0.00029306693,0.00011183289,0.00031870804],"domain_scores_gemma":[0.9994821,0.000109556604,0.000047145386,0.00026092894,0.00003810116,0.000062161664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041070845,0.00008847881,0.00009745783,0.0001638581,0.000054253374,0.000085913285,0.0003910639,0.000048057045,0.000006291465],"category_scores_gemma":[0.0000040306622,0.000085095424,0.000041610987,0.00046826887,0.0000100575635,0.00023913589,0.00010059112,0.000051837633,0.0000112871085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002243911,0.000060024417,0.0009795768,0.0000120014665,0.000013553152,0.0000111775225,0.00009684309,0.0076772356,0.0000044932353,0.14641555,0.00036094832,0.84434617],"study_design_scores_gemma":[0.0012343402,0.000017722787,0.05235423,0.000016376307,0.0000032269725,0.0000029151495,0.00006256074,0.94381046,0.000008412723,0.0009168212,0.0014696472,0.0001032926],"about_ca_topic_score_codex":0.00013922063,"about_ca_topic_score_gemma":0.0010179424,"teacher_disagreement_score":0.9361332,"about_ca_system_score_codex":0.00003972089,"about_ca_system_score_gemma":0.000010704119,"threshold_uncertainty_score":0.3470091},"labels":[],"label_agreement":null},{"id":"W2079003798","doi":"10.1145/777412.777440","title":"TCP is competitive against a limited adversary","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Bottleneck; Competitive analysis; Computer network; TCP Friendly Rate Control; Zeta-TCP; TCP tuning; Network congestion; TCP global synchronization; Latency (audio); Distributed computing; Online algorithm; H-TCP; HSTCP; Algorithm; Upper and lower bounds; Mathematics; Telecommunications","score_opus":0.00904564077052345,"score_gpt":0.20217623419984582,"score_spread":0.19313059342932237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079003798","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028426105,0.00019007779,0.5683657,0.002614366,0.00041507863,0.00013827797,0.0000011722163,0.00039040748,0.42504233],"genre_scores_gemma":[0.9683765,0.00003362257,0.014317023,0.012160302,0.00004028461,0.000009932726,0.000001201812,0.0000054917336,0.0050556012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991321,0.000071687165,0.00013220911,0.00027891377,0.00016019752,0.00022489324],"domain_scores_gemma":[0.99936163,0.00009944953,0.00003579032,0.00032167992,0.00007710032,0.00010435612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000117587035,0.000105681225,0.00011430029,0.00005001006,0.00008434039,0.00006730327,0.00033277608,0.00004349685,0.00020766458],"category_scores_gemma":[0.000019025234,0.00009299407,0.00006255243,0.0002970817,0.000030563828,0.000206586,0.00004176368,0.00009435538,0.00042035672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032423045,0.000052269195,0.00021033039,0.0000015640469,0.000025353716,0.000021016836,0.00024544555,0.00013100181,0.00003519922,0.8353466,0.016354233,0.14757378],"study_design_scores_gemma":[0.0018688185,0.000113446215,0.00076252245,0.000030028343,0.0000118281305,0.000023223549,0.00025201612,0.279904,0.0009051405,0.002084334,0.71352094,0.0005236582],"about_ca_topic_score_codex":0.0000019912525,"about_ca_topic_score_gemma":0.0000036974473,"teacher_disagreement_score":0.9655339,"about_ca_system_score_codex":0.000018519077,"about_ca_system_score_gemma":0.00006351938,"threshold_uncertainty_score":0.54029757},"labels":[],"label_agreement":null},{"id":"W2079632749","doi":"10.1016/s0167-8655(01)00032-0","title":"Improving image and video transmission quality over ATM with foveal prioritization and priority dithering","year":2001,"lang":"en","type":"article","venue":"Pattern Recognition Letters","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Asynchronous Transfer Mode; Dither; Computer network; Foveal; ATM adaptation layer; Network packet; Asynchronous communication; FIFO (computing and electronics); Transmission (telecommunications); Image quality; Multicast; Multimedia; Real-time computing; Image (mathematics); Artificial intelligence; Telecommunications; Computer hardware; Bandwidth (computing)","score_opus":0.011329962445429827,"score_gpt":0.22666704441653046,"score_spread":0.21533708197110063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079632749","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47165516,0.000040981133,0.52632886,0.0016691537,0.000049947204,0.00013459299,0.0000021892563,0.00009066729,0.000028427494],"genre_scores_gemma":[0.9875505,0.00008047744,0.0097963475,0.0023764279,0.00014065565,0.000022178368,0.000010179712,0.0000135213895,0.000009695239],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9988163,0.00011109128,0.00021368038,0.00042767494,0.00020146211,0.00022980357],"domain_scores_gemma":[0.99946636,0.000101153724,0.000113140035,0.00015397999,0.0000504868,0.00011490505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025734972,0.00015867194,0.00015287723,0.000054934804,0.00016296806,0.00024466537,0.0001044672,0.000049946313,0.000019420955],"category_scores_gemma":[0.000009965712,0.00014269758,0.000026566979,0.00012481198,0.000057438356,0.00076263625,0.000039334813,0.00014143472,0.0000049099026],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002946938,0.000017895918,0.013198271,0.00003643369,0.000010843365,0.000018231938,0.0002625086,0.0000063365624,0.007016177,0.000011386617,0.000024012774,0.97936845],"study_design_scores_gemma":[0.009160329,0.00039975354,0.6088964,0.0006268092,0.00012204844,0.00037235103,0.00013054976,0.37423185,0.001717375,0.0005996233,0.002007674,0.0017352799],"about_ca_topic_score_codex":0.000079082165,"about_ca_topic_score_gemma":0.00002634714,"teacher_disagreement_score":0.9776332,"about_ca_system_score_codex":0.000025924292,"about_ca_system_score_gemma":0.000013735881,"threshold_uncertainty_score":0.5819038},"labels":[],"label_agreement":null},{"id":"W2079943270","doi":"10.1007/s11276-006-7527-9","title":"End-to-end delay margin balancing approach for routing in multi-class networks","year":2006,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Static routing; Routing (electronic design automation); Heuristic; Equal-cost multi-path routing; Mathematical optimization; Elmore delay; Computer network; Routing protocol; Mathematics; Propagation delay","score_opus":0.011667508316347443,"score_gpt":0.22030231917419368,"score_spread":0.20863481085784624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079943270","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068320273,0.0005792014,0.9892201,0.00034120915,0.0008626899,0.00092338445,0.000002977815,0.00037435332,0.0008640825],"genre_scores_gemma":[0.94541085,0.000018164306,0.051801544,0.00071309187,0.0011909459,0.00035226071,0.000047197027,0.000050775394,0.0004151908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965039,0.0001749067,0.0007091753,0.0009948027,0.0003061007,0.0013111283],"domain_scores_gemma":[0.9983653,0.00046462906,0.00021091726,0.0006445798,0.00010136078,0.00021320178],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010466051,0.00041552336,0.0005475198,0.00017042582,0.00028784593,0.00032170487,0.0010843084,0.00031717823,0.000006632901],"category_scores_gemma":[0.000018174615,0.0004237817,0.00017540838,0.0009837224,0.000055220215,0.00031658247,0.00024888443,0.0005468257,0.000007021221],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030032164,0.00010092406,0.0025513452,0.000007500898,0.000015085751,0.000013292039,0.00006171249,0.7777728,0.000008335097,0.019815499,0.0014448868,0.19817859],"study_design_scores_gemma":[0.0017621812,0.000043907217,0.0026466385,0.000081502665,0.000013636269,0.000015332274,0.000027546312,0.9934523,0.0000050977865,0.00005773243,0.0013997362,0.0004943596],"about_ca_topic_score_codex":0.00015428697,"about_ca_topic_score_gemma":0.0004466234,"teacher_disagreement_score":0.9385788,"about_ca_system_score_codex":0.00016472818,"about_ca_system_score_gemma":0.000067072186,"threshold_uncertainty_score":0.9998214},"labels":[],"label_agreement":null},{"id":"W2080988740","doi":"10.1007/s11235-007-9030-8","title":"On the advantages of optimal end-to-end QoS budget partitioning","year":2007,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Dimensioning; Computer science; Quality of service; Robustness (evolution); Path (computing); End-to-end principle; Mathematical optimization; Distributed computing; Computer network","score_opus":0.016654074295836173,"score_gpt":0.26304994832943734,"score_spread":0.24639587403360116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080988740","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06679782,0.0007285663,0.9176032,0.0042333957,0.0005690693,0.0005611005,0.0000037541988,0.0002177981,0.009285294],"genre_scores_gemma":[0.9946476,0.000032459295,0.004561862,0.00037452037,0.00010361174,0.000060668754,0.0000045013685,0.000008093963,0.00020668432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986248,0.00024985033,0.00042496168,0.00018633026,0.0002876893,0.00022638279],"domain_scores_gemma":[0.9969468,0.0012877698,0.00022102294,0.0013236874,0.00014555002,0.00007515371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017444486,0.000107935346,0.00016724208,0.000095153664,0.00022173852,0.00009594393,0.0013535195,0.00004739747,0.000028226605],"category_scores_gemma":[0.0000844166,0.00008220274,0.000051947918,0.00038146065,0.000051341583,0.00015512001,0.0001481471,0.00016739397,0.000109142056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031621832,0.000110236135,0.00041027152,0.000013324688,0.000046730653,0.0000019777553,0.0017540826,0.027772136,0.0010092293,0.8442472,0.0043839575,0.1202192],"study_design_scores_gemma":[0.002595234,0.0012177591,0.024471873,0.0009888166,0.000070140544,0.0001533219,0.0035761327,0.64885014,0.007665998,0.0015737134,0.30729932,0.0015375633],"about_ca_topic_score_codex":0.00004786765,"about_ca_topic_score_gemma":0.000024426035,"teacher_disagreement_score":0.92784977,"about_ca_system_score_codex":0.00004044489,"about_ca_system_score_gemma":0.00003562504,"threshold_uncertainty_score":0.33521307},"labels":[],"label_agreement":null},{"id":"W2082364538","doi":"10.3138/infor.50.4.186","title":"SOLO: A Linear Ordering Approach to Path Analysis of Web Site Traffic","year":2012,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Web traffic; Web page; Orderliness; Web server; Traffic analysis; Web modeling; Web navigation; World Wide Web; Web mining; Data Web; Web site; Web analytics; Data mining; Distributed computing; Computer network; The Internet; Web intelligence","score_opus":0.045101661058908796,"score_gpt":0.31048325351810563,"score_spread":0.26538159245919685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082364538","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34270176,0.00038318272,0.6415246,0.00039080286,0.000300251,0.0010255036,0.00005596938,0.000097366625,0.013520564],"genre_scores_gemma":[0.99513316,0.000017599612,0.0042413706,0.00014258522,0.00010432395,0.0001207684,0.000056780864,0.0000027415804,0.00018064778],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809855,0.00009371746,0.00052573904,0.00011220058,0.00084673817,0.00032303735],"domain_scores_gemma":[0.99852437,0.0001801329,0.0000811584,0.00023912436,0.000767867,0.00020733054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023523194,0.000093871626,0.00021709777,0.0007906171,0.00023375632,0.0003608694,0.00027674902,0.00006924387,0.000007546239],"category_scores_gemma":[0.000117007425,0.000077521196,0.000053270403,0.0017033519,0.00003678316,0.0023539078,0.00012917562,0.00014486014,0.00007353922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033510452,0.00007109729,0.002459688,0.00009696441,0.00025142785,1.8278251e-7,0.009859852,0.6281838,0.000055260683,0.29552013,0.0019494194,0.061518695],"study_design_scores_gemma":[0.00023251926,0.000040271578,0.0023113166,0.00001369826,0.000011598704,0.0000041909298,0.00041993265,0.95590353,0.000004223534,9.3849616e-7,0.0409701,0.0000877028],"about_ca_topic_score_codex":0.000046708727,"about_ca_topic_score_gemma":0.0000050056287,"teacher_disagreement_score":0.6524314,"about_ca_system_score_codex":0.000040036608,"about_ca_system_score_gemma":0.00016829881,"threshold_uncertainty_score":0.34798717},"labels":[],"label_agreement":null},{"id":"W2082518332","doi":"10.1155/2007/54683","title":"Suboptimal RED Feedback Control for Buffered TCP Flow Dynamics in Computer Network","year":2007,"lang":"en","type":"article","venue":"Mathematical Problems in Engineering","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Active queue management; Random early detection; Network congestion; Computer science; Router; Queue; Network packet; Control theory (sociology); Process (computing); Synchronization (alternating current); Mathematical optimization; Computer network; Channel (broadcasting); Control (management); Mathematics","score_opus":0.007484638976436698,"score_gpt":0.1995714042946248,"score_spread":0.1920867653181881,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082518332","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012278534,0.000074848445,0.99660367,0.00043039376,0.00040544555,0.0007720568,0.0000015411969,0.00022436283,0.00025983897],"genre_scores_gemma":[0.70747614,0.0000016578132,0.29216552,0.00007132766,0.00017613168,0.00006377328,0.0000027813958,0.000020976251,0.000021685953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980018,0.000029565928,0.00065518444,0.00036307384,0.00019466216,0.00075570965],"domain_scores_gemma":[0.9986229,0.0008228825,0.00006501439,0.00032178554,0.000045467263,0.00012194763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016255153,0.00023166336,0.00042962952,0.00013908467,0.000031832697,0.00008696029,0.00048672233,0.00014730763,0.000009320747],"category_scores_gemma":[0.000068887835,0.00022764369,0.000089453686,0.0004233173,0.000021103497,0.00017466053,0.00007893126,0.0002900762,0.0000114074555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014397375,0.000068558824,0.00015754132,0.000119480355,0.000013304059,0.000011513175,0.000089174035,0.89038724,0.00000900364,0.06533135,0.00008750297,0.04371091],"study_design_scores_gemma":[0.001768133,0.00007610622,0.00030691913,0.000250554,0.0000051071174,0.000011188507,0.0000034392874,0.98749906,0.0000028716877,0.009757812,0.00007029959,0.00024851644],"about_ca_topic_score_codex":0.0000017685891,"about_ca_topic_score_gemma":0.000048111153,"teacher_disagreement_score":0.7062483,"about_ca_system_score_codex":0.00019687263,"about_ca_system_score_gemma":0.000019212255,"threshold_uncertainty_score":0.928304},"labels":[],"label_agreement":null},{"id":"W2082792674","doi":"10.1109/ictel.2013.6632149","title":"CAM: Courteous bandwidth constraints allocation model","year":2013,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"RDM; Computer science; Bandwidth (computing); Multiprotocol Label Switching; Network packet; Throughput; Computer network; Bandwidth allocation; Distributed computing; Quality of service; Telecommunications; Wireless","score_opus":0.008370413287677257,"score_gpt":0.19722513576475215,"score_spread":0.18885472247707488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082792674","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005762308,0.00003284133,0.96368307,0.0038439354,0.00015853038,0.0001836447,3.1399475e-7,0.0002863314,0.02604905],"genre_scores_gemma":[0.9642418,0.00000726845,0.030380579,0.001685924,0.000044614862,0.00003834839,0.0000012708582,0.000004023242,0.0035961822],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992615,0.000021016698,0.00013993315,0.00022166387,0.00015447097,0.00020142253],"domain_scores_gemma":[0.99940324,0.000044125394,0.0000355195,0.00028922828,0.0001235428,0.000104344974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009298352,0.000087553366,0.000088869034,0.000031222487,0.00006915717,0.0001453258,0.0003777359,0.000044326218,0.00025831864],"category_scores_gemma":[0.00000853813,0.000073345305,0.00003117796,0.000096548865,0.000051818064,0.00036171413,0.000042107913,0.00006744854,0.00068050454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.481816e-7,0.000026976533,0.000053579093,0.0000013316915,0.000009409873,0.0000010901225,0.00008961904,0.011187546,0.00013264785,0.24370949,0.01858813,0.72619945],"study_design_scores_gemma":[0.00024640033,0.000015638074,0.00015819583,0.000003222589,0.000002527211,0.000009749124,0.000011228496,0.99421513,0.00004294448,0.0048140646,0.00037894072,0.00010197151],"about_ca_topic_score_codex":0.000028024842,"about_ca_topic_score_gemma":0.000009163198,"teacher_disagreement_score":0.9830276,"about_ca_system_score_codex":0.000017166863,"about_ca_system_score_gemma":0.00008198289,"threshold_uncertainty_score":0.87467355},"labels":[],"label_agreement":null},{"id":"W2082922192","doi":"10.1109/icwmc.2007.70","title":"Predictive Resource Reservation Access for Multimedia Integration over GEO Satellite Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Reservation; Computer science; Quality of service; Computer network; Geosynchronous orbit; Videoconferencing; Communications satellite; Throughput; Bandwidth (computing); Resource allocation; Satellite; Bandwidth allocation; Access control; Resource (disambiguation); Multimedia; Telecommunications; Wireless; Engineering","score_opus":0.01966603493119095,"score_gpt":0.28214765085384086,"score_spread":0.2624816159226499,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082922192","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026991465,0.00016495641,0.9907091,0.00082167954,0.00045490253,0.00056109985,0.0000013728667,0.00032077607,0.0042669545],"genre_scores_gemma":[0.9599668,0.00003629799,0.03543347,0.0018540221,0.0008394861,0.0000754497,0.00005085223,0.000014874333,0.0017287697],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870455,0.000044771856,0.00030473067,0.00037358335,0.00023071816,0.00034163982],"domain_scores_gemma":[0.9985975,0.0006537879,0.0001176961,0.00033964947,0.00018319875,0.000108159424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009312891,0.00013435911,0.0001287,0.000095896736,0.0001395084,0.00023544327,0.0006201002,0.0001234994,0.000015658105],"category_scores_gemma":[0.0000898661,0.00011402265,0.000064877786,0.00040903775,0.000032606044,0.0009117867,0.00010149568,0.0001440619,0.0000063848715],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013805156,0.00003127933,0.0013977637,0.0000025438333,0.000016700602,0.000001486705,0.00020326629,0.0071656643,0.000028646506,0.026301488,0.0067283805,0.95798475],"study_design_scores_gemma":[0.0006147646,0.000080790014,0.032835647,0.00001748906,0.000007852952,0.0000010260375,0.000027153454,0.9391305,0.00015273233,0.0007648451,0.026236327,0.0001309054],"about_ca_topic_score_codex":0.000021329048,"about_ca_topic_score_gemma":0.00017036538,"teacher_disagreement_score":0.9578538,"about_ca_system_score_codex":0.000056723624,"about_ca_system_score_gemma":0.000025737356,"threshold_uncertainty_score":0.4649709},"labels":[],"label_agreement":null},{"id":"W2083395410","doi":"10.1016/j.comcom.2005.12.004","title":"Adaptive model predictive TCP delay-based congestion control","year":2006,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Vedecká Grantová Agentúra MŠVVaŠ SR a SAV","keywords":"Computer science; CUBIC TCP; TCP Vegas; TCP acceleration; TCP global synchronization; TCP Friendly Rate Control; TCP tuning; Zeta-TCP; TCP Westwood plus; Computer network; Compound TCP; Transmission Control Protocol; Network congestion; H-TCP; HSTCP; Model predictive control; Real-time computing; Algorithm; Network packet; Control (management); Artificial intelligence","score_opus":0.01935276739654083,"score_gpt":0.22704900986985574,"score_spread":0.20769624247331492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083395410","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002623376,0.00056864886,0.98861355,0.0059284056,0.00022092415,0.00045005346,0.00002364034,0.00071966933,0.00321276],"genre_scores_gemma":[0.75119805,0.000012048317,0.24727446,0.0010934909,0.00013867559,0.00014759808,0.000034708723,0.000012934682,0.000088036846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827075,0.0003067603,0.00040676337,0.0004200734,0.00026400783,0.00033164473],"domain_scores_gemma":[0.9964062,0.00055828865,0.00019196859,0.0023305973,0.00039920592,0.0001137177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026827585,0.00023107415,0.00025483817,0.00014156556,0.00046367897,0.00018449464,0.0025068782,0.000111702466,0.0000043742352],"category_scores_gemma":[0.000009283025,0.0002390771,0.00013350106,0.000380042,0.00021099132,0.00042347884,0.00035735345,0.00032449048,0.00007116031],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018593746,0.00021273972,0.0001325265,0.0000017862934,0.000031779124,0.000002417485,0.00005908034,0.6517886,0.000011541484,0.28609064,0.0048699724,0.056780342],"study_design_scores_gemma":[0.0013366711,0.000108358785,0.0010814067,0.000028742188,0.00003195464,0.0000073531196,0.0000037215339,0.987529,0.0000059398994,0.007181861,0.002443774,0.00024124226],"about_ca_topic_score_codex":0.00003294614,"about_ca_topic_score_gemma":0.000049555383,"teacher_disagreement_score":0.75093573,"about_ca_system_score_codex":0.000097036784,"about_ca_system_score_gemma":0.00022162416,"threshold_uncertainty_score":0.97492814},"labels":[],"label_agreement":null},{"id":"W2083418467","doi":"10.1109/tmm.2003.814725","title":"Optimal adaptive bandwidth monitoring for qos based retrieval","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Multimedia","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Dynamic bandwidth allocation; Bandwidth (computing); Quality of service; Bandwidth allocation; Probabilistic logic; Computer network; Bandwidth management; Real-time computing; Distributed computing; Artificial intelligence","score_opus":0.023650907582190937,"score_gpt":0.24850896772553746,"score_spread":0.22485806014334653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083418467","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027075196,0.000055106884,0.9924543,0.00021076595,0.0036368167,0.00047522428,0.000015410344,0.0002804119,0.00016442487],"genre_scores_gemma":[0.76980585,0.0000070787623,0.22944653,0.00009041637,0.00017223507,0.00010033193,6.943641e-7,0.000016766318,0.0003600753],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857885,0.00009144995,0.00023074965,0.0004408261,0.00027734667,0.00038080208],"domain_scores_gemma":[0.99859095,0.0006505187,0.00006235147,0.00037096866,0.00014013016,0.00018510048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026582577,0.00020508627,0.0001956419,0.00012946386,0.0002710721,0.00007742138,0.00033061253,0.00011694742,0.00004032502],"category_scores_gemma":[0.000020806245,0.00020336971,0.00017503361,0.00031931413,0.0000478681,0.00024957102,6.529434e-7,0.00024799723,0.000058375583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004370007,0.00042698762,0.000019319352,0.00001139244,0.000105108964,0.000013039715,0.000429089,0.5226261,0.0013086488,0.0007009157,0.00041803502,0.47350436],"study_design_scores_gemma":[0.0023841166,0.00031548587,0.00003423908,0.000029090696,0.000034093606,0.000003966227,0.000033681677,0.94760823,0.04735047,0.000027752385,0.0019145956,0.00026428662],"about_ca_topic_score_codex":0.0000029246896,"about_ca_topic_score_gemma":0.0000021392593,"teacher_disagreement_score":0.76709837,"about_ca_system_score_codex":0.0000747386,"about_ca_system_score_gemma":0.00015576338,"threshold_uncertainty_score":0.82931757},"labels":[],"label_agreement":null},{"id":"W2083443394","doi":"10.1109/glocom.2006.418","title":"QRP01-1: Optimal Routing of Dynamically Priced Network Services","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Bottleneck; Computer science; Heuristics; Quality of service; Computer network; Bandwidth (computing); Tabu search; Service (business); Mathematical optimization; Distributed computing; Algorithm; Mathematics","score_opus":0.002343904617799321,"score_gpt":0.17905921532048918,"score_spread":0.17671531070268987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083443394","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1723289,0.00041883223,0.81728053,0.0008181717,0.0005861686,0.00017718658,0.0000029886319,0.00035537384,0.0080318265],"genre_scores_gemma":[0.9553422,0.0000033906033,0.04387872,0.00023988778,0.00030938748,0.0000057250845,0.000007599582,0.0000067079636,0.00020639972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987753,0.00005172451,0.0003270971,0.00028154044,0.00021134784,0.00035298383],"domain_scores_gemma":[0.9992382,0.00009042512,0.00017148837,0.00035905326,0.000084298576,0.000056528588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022258423,0.00012929071,0.00020272718,0.000027672699,0.00009552186,0.00008604033,0.0007316386,0.00006634048,0.0000151923905],"category_scores_gemma":[0.0000036055421,0.0001225763,0.00007866586,0.00033838162,0.000027883509,0.00020049229,0.0001701432,0.00009789334,0.000044542114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003502788,0.00017304833,0.012477025,0.00004208213,0.000059771617,0.000025206926,0.00015278666,0.34937826,0.00023523331,0.4212691,0.003282003,0.21287046],"study_design_scores_gemma":[0.0004464218,0.000045400226,0.019083502,0.000040525752,0.000011407388,0.000007932148,0.000010296555,0.9755367,0.000015463085,0.0015608404,0.0030676203,0.0001739153],"about_ca_topic_score_codex":0.000120543875,"about_ca_topic_score_gemma":0.0001047686,"teacher_disagreement_score":0.7830133,"about_ca_system_score_codex":0.000023942817,"about_ca_system_score_gemma":0.000042809243,"threshold_uncertainty_score":0.49985164},"labels":[],"label_agreement":null},{"id":"W2083655613","doi":"10.1016/s0140-3664(03)00119-1","title":"Supporting Quality of Service in IP multicast networks","year":2003,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Multicast; Computer network; IP multicast; Xcast; Source-specific multicast; Quality of service; Service (business); Internet Group Management Protocol; Pragmatic General Multicast","score_opus":0.05548209764131507,"score_gpt":0.3347569254377961,"score_spread":0.27927482779648105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083655613","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064896075,0.0005100362,0.98822844,0.002579633,0.0001828558,0.00018529949,9.475784e-7,0.00010755172,0.0017156313],"genre_scores_gemma":[0.82862884,0.000030219406,0.17043665,0.00083295,0.000020562395,0.000021204067,0.000004719384,0.000005614312,0.000019244242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981702,0.0005818361,0.00062264677,0.00022944126,0.0001308252,0.00026503718],"domain_scores_gemma":[0.9965685,0.00073222665,0.00023500818,0.0022005157,0.00019020015,0.00007353794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094741443,0.00011312564,0.00023673633,0.000083194886,0.00011881292,0.0000548274,0.0020182487,0.00006183633,0.0000081100525],"category_scores_gemma":[0.000050086757,0.000120824654,0.00006258765,0.00072848465,0.00006372452,0.00021565131,0.00049630716,0.0002495927,0.000013277983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035677976,0.000358885,0.0075121527,0.000016993079,0.000025680112,0.0000015489242,0.0010485842,0.035581414,0.00002597139,0.6920634,0.0002940989,0.2630677],"study_design_scores_gemma":[0.00048667722,0.000014443609,0.013109791,0.000032387714,0.0000033849342,0.0000042006927,0.000029705807,0.98242575,0.00000771136,0.0010394716,0.0027138104,0.00013266607],"about_ca_topic_score_codex":0.000057200272,"about_ca_topic_score_gemma":0.00028570218,"teacher_disagreement_score":0.94684434,"about_ca_system_score_codex":0.00002623873,"about_ca_system_score_gemma":0.00007453959,"threshold_uncertainty_score":0.49270865},"labels":[],"label_agreement":null},{"id":"W2083873104","doi":"10.1109/atnac.2011.6096653","title":"Wireless hop-by-hop credit-based flow control extended to source for stable best effort traffic","year":2011,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer network; Computer science; Network congestion; Network packet; Flow control (data); Bottleneck; Wireless network; Packet loss; Buffer overflow; Wireless; Provisioning; Network traffic control; Real-time computing; Telecommunications","score_opus":0.014992442731566094,"score_gpt":0.21579718270535553,"score_spread":0.20080473997378945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083873104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019087544,0.000106950174,0.97577435,0.0012462302,0.00074299733,0.0010997219,0.000024839623,0.0006368377,0.0012805167],"genre_scores_gemma":[0.9479437,0.0000027940453,0.04381569,0.0032088035,0.00026284932,0.00043380415,0.0000107413925,0.000035882505,0.004285725],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997618,0.000057625108,0.00041504911,0.0007474808,0.0003670005,0.00079480343],"domain_scores_gemma":[0.99822575,0.00025391454,0.00010533351,0.00073918496,0.0002392076,0.00043660577],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046059393,0.00032749228,0.00042834802,0.0001176579,0.00024938295,0.0001801997,0.0011298644,0.000139302,0.00015714893],"category_scores_gemma":[0.000026888614,0.00029131563,0.0001888903,0.00034795704,0.00005711002,0.00031106407,0.000058895745,0.00014633716,0.00018043228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038594965,0.000616029,0.00006884726,0.000025005338,0.00009045072,0.000010009092,0.00041518104,0.024836734,0.0003959101,0.006757076,0.073939405,0.8924594],"study_design_scores_gemma":[0.0035446924,0.0006280436,0.00004882961,0.000025153226,0.000040433333,0.0000038663525,0.000054038293,0.95973307,0.0007914406,0.00006800571,0.03462538,0.00043706884],"about_ca_topic_score_codex":0.000037880935,"about_ca_topic_score_gemma":0.000070596,"teacher_disagreement_score":0.9348963,"about_ca_system_score_codex":0.000051986848,"about_ca_system_score_gemma":0.00018724584,"threshold_uncertainty_score":0.9999539},"labels":[],"label_agreement":null},{"id":"W2084093893","doi":"10.1002/dac.657","title":"A hop‐by‐hop delay‐constrained routing algorithm with explicit loop avoidance and backup routing information","year":2004,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Static routing; Dynamic Source Routing; Link-state routing protocol; Distributed computing; Equal-cost multi-path routing; Routing Information Protocol; Destination-Sequenced Distance Vector routing; Policy-based routing; Geographic routing; Path vector protocol; Routing table; Multipath routing; Backup; Routing protocol; Zone Routing Protocol; Routing (electronic design automation)","score_opus":0.008363068624608528,"score_gpt":0.22901055243114413,"score_spread":0.2206474838065356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084093893","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029472822,0.0012472426,0.96479225,0.003254532,0.00040389193,0.00015779058,0.000006428839,0.000052898577,0.0006121379],"genre_scores_gemma":[0.9710533,0.00022894853,0.028222222,0.00030609025,0.00012856629,0.000011521476,0.000009313732,0.000007081765,0.000032928645],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981317,0.00014672661,0.0008112291,0.00011728759,0.00063104305,0.00016202159],"domain_scores_gemma":[0.9970831,0.0002209785,0.0011514038,0.0003441385,0.0010967257,0.0001036348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009284555,0.00014563637,0.00022608512,0.00016973862,0.00015827379,0.00064885593,0.0013003717,0.000062703315,0.0000020414877],"category_scores_gemma":[0.00006595751,0.0001250572,0.0000543534,0.00019425048,0.000058118727,0.0022842025,0.00013984572,0.00030089138,0.000009775186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105343795,0.00014207262,0.0010779148,0.000009971162,0.00047759814,0.000029336512,0.005305814,0.05644685,0.00024683334,0.18001588,0.00045422933,0.7556882],"study_design_scores_gemma":[0.007753461,0.00032757813,0.0005571506,0.0017891836,0.00004632009,0.0029101244,0.003118795,0.9672084,0.00018014833,0.0009300204,0.01461527,0.00056354486],"about_ca_topic_score_codex":0.000075872624,"about_ca_topic_score_gemma":0.000007590803,"teacher_disagreement_score":0.94158053,"about_ca_system_score_codex":0.00015941216,"about_ca_system_score_gemma":0.0001595147,"threshold_uncertainty_score":0.62569326},"labels":[],"label_agreement":null},{"id":"W2084753319","doi":"10.1109/cjece.2013.6704695","title":"Enhanced TCP-friendly rate control for supporting video traffic over internet","year":2013,"lang":"en","type":"article","venue":"Canadian Journal of Electrical and Computer Engineering","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Unicast; Computer network; Computer science; TCP Friendly Rate Control; Network congestion; Transmission Control Protocol; Real-time computing; Network packet; The Internet; Packet loss; Communication source; Jitter; TCP tuning; Internet protocol suite; TCP Westwood plus; Throughput; Telecommunications; Wireless; Operating system","score_opus":0.003379562032676191,"score_gpt":0.17501716281039217,"score_spread":0.17163760077771598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084753319","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13160962,0.0004136735,0.86679435,0.0005100797,0.0004771933,0.00015383419,7.3869705e-7,0.000028212304,0.000012316857],"genre_scores_gemma":[0.9911865,0.000004855333,0.00782428,0.0004850486,0.00042924352,0.000012894262,4.4776178e-7,0.000011237086,0.000045480745],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988029,0.000026653996,0.00039994094,0.00018755667,0.000088780835,0.00049416546],"domain_scores_gemma":[0.9986718,0.0003191835,0.00013460666,0.00010283226,0.000169856,0.0006017207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024115296,0.00015457248,0.00027911796,0.00021258602,0.000059456233,0.00028846206,0.0003848371,0.00006181258,0.000016958125],"category_scores_gemma":[0.0000626322,0.0001374609,0.00010785095,0.00020644307,0.000015748135,0.00036103325,0.000012785293,0.00022624659,0.0000033954332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013333865,0.000015230678,0.00007951401,0.000018334607,0.00012357475,0.00005251094,0.00022478013,0.05672143,0.0004903908,0.01562137,0.006212921,0.9204266],"study_design_scores_gemma":[0.0009341998,0.00034831522,0.0011298305,0.00003396667,0.000013258402,0.00008203091,0.0000014349063,0.9933807,0.00009047683,0.00012382006,0.0036963515,0.00016561631],"about_ca_topic_score_codex":0.00006147759,"about_ca_topic_score_gemma":0.00005475662,"teacher_disagreement_score":0.9366593,"about_ca_system_score_codex":0.00006486039,"about_ca_system_score_gemma":0.00021489398,"threshold_uncertainty_score":0.56054926},"labels":[],"label_agreement":null},{"id":"W2085060664","doi":"10.1109/icc.2013.6655140","title":"An optimal and fully explicit rate controller for high-speed networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Queueing theory; Bandwidth (computing); Controller (irrigation); Network congestion; Control theory (sociology); Queuing delay; Queue; Ethernet; Active queue management; Scheme (mathematics); Network calculus; Convergence (economics); Computer network; Quality of service; Network packet; Control (management); Mathematics","score_opus":0.007109859491899557,"score_gpt":0.20796885191211814,"score_spread":0.2008589924202186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085060664","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03770599,0.00014838343,0.9580159,0.0025941362,0.00025294643,0.000649427,7.2495504e-7,0.00026057547,0.000371919],"genre_scores_gemma":[0.96954054,0.00001547303,0.026624426,0.0022092713,0.00030403957,0.00014120301,0.0000028163004,0.000010566118,0.0011516837],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988905,0.000059752216,0.0002058901,0.00039655287,0.00008762466,0.00035968143],"domain_scores_gemma":[0.9990925,0.00022428397,0.000058701426,0.0002971824,0.00013220111,0.00019508503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025319442,0.00015458331,0.00021867253,0.000037921025,0.00014162519,0.00041951291,0.00040716233,0.00007826984,0.00009574759],"category_scores_gemma":[0.000010032262,0.00012210719,0.000042450785,0.00010052615,0.000028453891,0.00066361856,0.000054276115,0.0000792461,0.000035312856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007727521,0.000058849768,0.000069565416,0.0000029207138,0.00004510288,0.0000018066261,0.0000794317,0.029735524,0.0005555652,0.25170696,0.011750406,0.7059166],"study_design_scores_gemma":[0.0019125046,0.00022789631,0.0013354645,0.0000034031082,0.0000081830785,0.0000032935545,0.000019605328,0.9940988,0.000034640918,0.0009398587,0.0012382291,0.00017814829],"about_ca_topic_score_codex":0.000026673462,"about_ca_topic_score_gemma":0.0000056110407,"teacher_disagreement_score":0.9643633,"about_ca_system_score_codex":0.000008733893,"about_ca_system_score_gemma":0.000017158474,"threshold_uncertainty_score":0.49793866},"labels":[],"label_agreement":null},{"id":"W2085106104","doi":"10.1109/saci.2012.6249999","title":"A Traffic Engineering algorithm for Differentiated multicast Services over MPLS networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Multicast; Computer network; Computer science; Multiprotocol Label Switching; Protocol Independent Multicast; Xcast; Source-specific multicast; Quality of service; Distributed computing; Distance Vector Multicast Routing Protocol; Traffic engineering; IP multicast; Pragmatic General Multicast","score_opus":0.006714726562698061,"score_gpt":0.20927888294113062,"score_spread":0.20256415637843256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085106104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015729358,0.0003495713,0.98200077,0.000092852184,0.00097588444,0.00027117605,0.0000020904383,0.0005184399,0.00005988522],"genre_scores_gemma":[0.9307364,0.000008084699,0.06814292,0.00028265736,0.00052668253,0.000071164875,0.000007918546,0.000015237822,0.0002088996],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988584,0.000018969113,0.00019463191,0.00023878292,0.00013177352,0.00055743044],"domain_scores_gemma":[0.9992775,0.00017043813,0.000046322184,0.0002683771,0.000044116056,0.00019330028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015026702,0.00017428442,0.00017739013,0.000053460182,0.00008285179,0.00013637276,0.0004093388,0.00008443556,0.00003682779],"category_scores_gemma":[0.000003468606,0.00014756167,0.00009428477,0.00018975025,0.000009246029,0.00044828947,0.00007422429,0.00009585672,0.000018663128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003961593,0.00010776131,0.00014399452,0.00001296231,0.000058743513,8.4956764e-7,0.00017453254,0.037737828,0.0000240186,0.006431118,0.00034698634,0.95495725],"study_design_scores_gemma":[0.0007026617,0.000025273532,0.0020924106,0.000015444863,0.000016796981,0.000004628611,0.000008695664,0.9937386,0.0000147252695,0.000005948063,0.0031775846,0.00019721779],"about_ca_topic_score_codex":0.0000030606668,"about_ca_topic_score_gemma":0.0000032546054,"teacher_disagreement_score":0.9560008,"about_ca_system_score_codex":0.00001834298,"about_ca_system_score_gemma":0.000007283788,"threshold_uncertainty_score":0.60173905},"labels":[],"label_agreement":null},{"id":"W2085654750","doi":"10.1239/jap/1183667405","title":"A Stochastic Ordering Property for Leaky Bucket Regulated Flows in Packet Networks","year":2007,"lang":"en","type":"article","venue":"Journal of Applied Probability","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Leaky bucket; Poisson distribution; Constant (computer programming); Network packet; Regular polygon; Poisson process; Superposition principle; Property (philosophy); Stationary process; Compound Poisson process; Stochastic process; Applied mathematics; Mathematical analysis; Statistics; Computer science; Geometry; Computer network","score_opus":0.015339943255662153,"score_gpt":0.2282470256589828,"score_spread":0.21290708240332065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085654750","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1328557,0.00008860255,0.8651955,0.00043976094,0.00034827378,0.0007554047,4.6241053e-7,0.000049137077,0.00026715334],"genre_scores_gemma":[0.9591422,0.0000029902021,0.04037999,0.00014407681,0.00027137386,0.000025729165,6.547127e-7,0.000011088429,0.000021911523],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802244,0.000044349126,0.00087308505,0.00031481337,0.0002841357,0.0004611859],"domain_scores_gemma":[0.9984786,0.0003526611,0.00037429365,0.0003583493,0.00027531732,0.00016077638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003638415,0.00017965247,0.00040079904,0.00011784695,0.00008497439,0.00007963363,0.0006084701,0.00013324285,0.000006283589],"category_scores_gemma":[0.000107404616,0.0001236519,0.00012178642,0.0004860523,0.000053156986,0.00022219577,0.00007841806,0.00040864656,0.0000016531619],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010781767,0.00024866205,0.0001716881,0.00003660585,0.000038865855,0.000011584556,0.00036868366,0.36794817,0.00019238364,0.011457435,0.00031826453,0.6181295],"study_design_scores_gemma":[0.0027802861,0.00030033712,0.001685837,0.000085362284,0.000022140399,0.000046301786,0.000038581067,0.96282613,0.000080343976,0.030523056,0.0013306822,0.000280934],"about_ca_topic_score_codex":0.0000032655403,"about_ca_topic_score_gemma":0.00010962855,"teacher_disagreement_score":0.8262865,"about_ca_system_score_codex":0.00015919545,"about_ca_system_score_gemma":0.00016922396,"threshold_uncertainty_score":0.50423783},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.2705238557929741,"score_gpt":0.37376200492544154,"score_spread":0.10323814913246743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086258679","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027576468,0.0054511777,0.96160805,0.026224228,0.00019556917,0.00038091204,0.00001965203,0.000050143808,0.0033126434],"genre_scores_gemma":[0.9064245,0.0015601977,0.088166125,0.0021620174,0.00008220719,0.00010443625,0.000017601673,0.00001700369,0.0014658967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982122,0.0002611025,0.00061102636,0.0003098196,0.0001147763,0.00049105025],"domain_scores_gemma":[0.9970121,0.0003479108,0.00019163424,0.001831548,0.00043865593,0.00017815533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000853952,0.0001732797,0.00031568832,0.00014283057,0.00014291468,0.000057254143,0.0019754365,0.0001925784,0.000065201006],"category_scores_gemma":[0.000061372164,0.00019604612,0.00017848854,0.00047745064,0.00024397546,0.0006441909,0.00017971385,0.00032648782,0.000013337937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038605343,0.001090799,0.00071253965,0.000013264332,0.000061653496,0.0000010008555,0.0019352211,0.13961953,0.0000016426566,0.47189963,0.008136263,0.37648988],"study_design_scores_gemma":[0.00032311864,0.0001619834,0.0035280306,0.000067848145,0.000029753106,0.0000027127737,0.000037397665,0.979862,0.000010328185,0.012004868,0.003779266,0.00019273453],"about_ca_topic_score_codex":0.00014640202,"about_ca_topic_score_gemma":0.0005575817,"teacher_disagreement_score":0.90366685,"about_ca_system_score_codex":0.000014058327,"about_ca_system_score_gemma":0.00017036153,"threshold_uncertainty_score":0.7994529},"labels":[],"label_agreement":null},{"id":"W2086361751","doi":"10.1155/mpe.2005.7","title":"Real‐time feedback control of computer networks based on predicted state estimation","year":2005,"lang":"en","type":"article","venue":"Mathematical Problems in Engineering","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Control (management); Feedback control; Computer science; State (computer science); Model predictive control; Telecommunications network; Networked control system; Control theory (sociology); Control engineering; Engineering; Artificial intelligence; Computer network; Algorithm","score_opus":0.004349945398587476,"score_gpt":0.1840630551090433,"score_spread":0.17971310971045584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086361751","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019047707,0.000015750646,0.9967205,0.00030498888,0.00007413907,0.0003827976,0.0000019094127,0.00030066588,0.0002944919],"genre_scores_gemma":[0.8722341,0.000002479396,0.1275624,0.000063792766,0.000054137898,0.00004159102,0.000002602133,0.000015627225,0.000023235718],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986247,0.000041168856,0.00051772466,0.00024667097,0.0002576059,0.0003121355],"domain_scores_gemma":[0.9989385,0.0004950869,0.00009527183,0.0003375494,0.00004618136,0.00008738523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045172335,0.00017823486,0.0003205032,0.00013327804,0.000022640479,0.000048301095,0.00034534803,0.00007714152,0.000020984024],"category_scores_gemma":[0.000040075043,0.0001630714,0.0000577985,0.0002951805,0.000022864706,0.00018051079,0.00003693063,0.00019539404,0.000027749407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000635929,0.00010479654,0.000012877159,0.000070301314,0.000010400746,0.0000017022677,0.00007251042,0.9481816,0.000058376714,0.0063707586,0.000055495388,0.04505478],"study_design_scores_gemma":[0.0010590825,0.00009107725,0.00013534664,0.00036100645,0.000005922264,0.000002130921,2.735484e-7,0.99747,0.000024409677,0.0006782545,0.00002478453,0.00014769069],"about_ca_topic_score_codex":0.0000011974041,"about_ca_topic_score_gemma":4.3288702e-7,"teacher_disagreement_score":0.8703294,"about_ca_system_score_codex":0.00005893442,"about_ca_system_score_gemma":0.000021063908,"threshold_uncertainty_score":0.66498584},"labels":[],"label_agreement":null},{"id":"W2086785629","doi":"10.1016/j.peva.2011.10.001","title":"Optimal anticipative congestion control of flows with time-varying input stream","year":2011,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; Polytechnique Montréal","funders":"European Social Fund; Ministerio de Ciencia e Innovación; Universidad Carlos III de Madrid; Eusko Jaurlaritza; European Commission; Comunidad de Madrid","keywords":"Computer science; Bottleneck; Network congestion; Flow control (data); Router; Probabilistic logic; Transmission (telecommunications); Computer network; Index (typography); Markov process; Markov chain; Markov decision process; Flow (mathematics); Mathematical optimization; Mathematics; Network packet; Telecommunications","score_opus":0.02923529351829863,"score_gpt":0.25030170107122196,"score_spread":0.22106640755292334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086785629","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6842934,0.000068875175,0.31301072,0.000059914575,0.00011532753,0.0004072459,0.0000015301388,0.000076055745,0.001966945],"genre_scores_gemma":[0.98665035,0.0000129461605,0.0130788665,0.000048016787,0.00005976583,0.00009037949,0.000008022569,0.000008046687,0.000043598673],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857265,0.00013787515,0.00028103817,0.00027148778,0.00051876943,0.00021819159],"domain_scores_gemma":[0.99878496,0.00007236785,0.0002369176,0.00030395473,0.00054489105,0.000056918467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090906204,0.0001431709,0.0002022081,0.000102910984,0.00010345023,0.000026624586,0.0002823354,0.00005546902,0.00016449006],"category_scores_gemma":[0.000035507703,0.00011827662,0.000033483782,0.00027860462,0.000056829722,0.0008201829,0.00002803492,0.000104142644,0.00006584225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000344731,0.00015755693,0.00827161,0.000018695806,0.00009210939,0.0000016426296,0.0027461036,0.19996525,0.000736459,0.00091791165,0.000044584835,0.78670335],"study_design_scores_gemma":[0.0017807146,0.00055330404,0.024864877,0.00006796502,0.00007230819,0.0000054347884,0.000014262297,0.9704735,0.0019835248,0.000025499556,0.000014594028,0.00014401728],"about_ca_topic_score_codex":0.000008796651,"about_ca_topic_score_gemma":0.0000030865824,"teacher_disagreement_score":0.78655934,"about_ca_system_score_codex":0.000045345278,"about_ca_system_score_gemma":0.00017166676,"threshold_uncertainty_score":0.48231807},"labels":[],"label_agreement":null},{"id":"W2087043915","doi":"10.1142/s0129054102001527","title":"THE EFFECT OF ASYMMETRY ON THE ON-LINE MULTICAST ROUTING PROBLEM","year":2002,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Multicast; Asymmetry; Join (topology); Computer science; Greedy algorithm; Line (geometry); Routing (electronic design automation); Combinatorics; Mathematics; Graph; Mathematical optimization; Algorithm; Distributed computing; Computer network","score_opus":0.01958417640857618,"score_gpt":0.2819924232331981,"score_spread":0.26240824682462194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087043915","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070419095,0.00004813392,0.9108269,0.015041088,0.0022929062,0.0001631679,0.0000014399005,0.000015236088,0.001192],"genre_scores_gemma":[0.9886464,0.000013889871,0.010827093,0.00021364479,0.00026196224,0.0000025292436,1.2095373e-7,0.0000029450343,0.000031427742],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978042,0.00013064832,0.00055171043,0.00015959286,0.0011941693,0.00015964963],"domain_scores_gemma":[0.9955929,0.0023771862,0.000672484,0.00033917505,0.00096215174,0.00005608852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001998012,0.00010073264,0.00014904437,0.0002235199,0.00028288612,0.0003042733,0.0031836454,0.000019184008,0.000010651438],"category_scores_gemma":[0.00036334063,0.00005335011,0.0001240861,0.00053297635,0.0004147234,0.00045495087,0.00018374855,0.00020958511,0.000015599398],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031209176,0.00010057207,0.00026064907,0.0000017458896,0.00006581624,0.0000044642366,0.00019367502,0.036758583,0.00014131988,0.2104559,0.00047728082,0.7515088],"study_design_scores_gemma":[0.00058011553,0.0009978925,0.00086865976,0.00014469476,0.000008007131,0.000056015204,0.000006207897,0.9934584,0.001953319,0.00082422036,0.0010362003,0.000066265806],"about_ca_topic_score_codex":0.0000024410244,"about_ca_topic_score_gemma":9.751769e-7,"teacher_disagreement_score":0.9566998,"about_ca_system_score_codex":0.00005853944,"about_ca_system_score_gemma":0.00008304029,"threshold_uncertainty_score":0.59160584},"labels":[],"label_agreement":null},{"id":"W2088424157","doi":"10.1109/padsw.2014.7097859","title":"Optimal bandwidth allocation with dynamic multi-path routing for non-critical traffic in AFDX networks","year":2014,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Dynamic bandwidth allocation; Bandwidth allocation; Computer network; Bandwidth (computing); Avionics; Network calculus; Distributed computing; Retransmission; Quality of service; Network packet; Engineering","score_opus":0.006824915074493558,"score_gpt":0.23584506007257028,"score_spread":0.2290201449980767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088424157","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022805486,0.00003278335,0.97505224,0.001164501,0.00021953002,0.00035983144,3.5915073e-7,0.00018588756,0.0001793742],"genre_scores_gemma":[0.81781954,0.0000026871012,0.18155813,0.00029554722,0.000087627355,0.00008087267,0.000004751391,0.000012352863,0.00013849339],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861336,0.000064548156,0.00026673294,0.00046492578,0.00012961101,0.00046082647],"domain_scores_gemma":[0.99901754,0.0004395636,0.00004994129,0.00029943747,0.00008494227,0.00010857478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053846976,0.00017136011,0.00021418091,0.000066391774,0.000117733915,0.00014697832,0.00040691247,0.00009189141,0.000004549409],"category_scores_gemma":[0.000055905573,0.00014055634,0.0000470656,0.00025402216,0.00005057108,0.00029282962,0.000042571217,0.00016284193,0.000007417228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039871462,0.00010883028,0.0002204665,0.000007555218,0.000008646837,0.000002617918,0.0001586042,0.652072,0.000009014509,0.03358929,0.00008221804,0.31370085],"study_design_scores_gemma":[0.0016553012,0.00021718028,0.0014834522,0.000050290608,0.000008814158,0.0000074763702,0.000031198884,0.99622375,0.0000037113382,0.000034215096,0.000074132804,0.00021047624],"about_ca_topic_score_codex":0.0000067641504,"about_ca_topic_score_gemma":0.00020036039,"teacher_disagreement_score":0.795014,"about_ca_system_score_codex":0.000044103803,"about_ca_system_score_gemma":0.000050440394,"threshold_uncertainty_score":0.5731721},"labels":[],"label_agreement":null},{"id":"W2088509102","doi":"10.1109/perser.2007.4283951","title":"Mobile agents based approach for P2MP VPLS","year":2007,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Multiprotocol Label Switching; Computer network; Computer science; Quality of service; Multicast; Label Distribution Protocol; Label switching; Private network; Service (business); Distributed computing","score_opus":0.019302961429539117,"score_gpt":0.2558148467730424,"score_spread":0.2365118853435033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088509102","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005367554,0.00005395336,0.9734642,0.00009155735,0.00021164176,0.00040463556,7.513775e-7,0.00020816876,0.02502833],"genre_scores_gemma":[0.7388985,8.5945595e-7,0.2558204,0.0014196122,0.000108056825,0.000083953026,0.0000038854423,0.000004687522,0.0036600481],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991594,0.000013566942,0.00014618257,0.0002614775,0.00014147742,0.00027790986],"domain_scores_gemma":[0.9994018,0.00011076152,0.000033855675,0.0002971307,0.000058531386,0.000097896125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045437674,0.00008385966,0.000093939394,0.000046452933,0.00007858771,0.000061024548,0.00043873457,0.00004597219,0.000037840444],"category_scores_gemma":[0.000008451119,0.00007064017,0.00006960006,0.00016674306,0.000015752412,0.00011430401,0.000031223637,0.000045374974,0.000031336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021105296,0.0001551008,0.0001493394,0.000009182377,0.000013741297,0.0000028205968,0.00007408928,0.008374718,0.00004754901,0.058654375,0.018950768,0.9135472],"study_design_scores_gemma":[0.00067575945,0.00009230182,0.00011212328,0.000001797762,0.0000035801477,0.0000013012069,0.0000142418285,0.9456419,0.00027496144,0.0001834413,0.05288992,0.00010867913],"about_ca_topic_score_codex":0.0000020577966,"about_ca_topic_score_gemma":0.0000016363974,"teacher_disagreement_score":0.9372672,"about_ca_system_score_codex":0.000016283786,"about_ca_system_score_gemma":0.000034161007,"threshold_uncertainty_score":0.28806224},"labels":[],"label_agreement":null},{"id":"W2090192756","doi":"10.1109/infcom.2013.6567050","title":"Capacity provisioning for schedulers with tiny buffers","year":2013,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Scheduling (production processes); Buffer overflow; Provisioning; Markov chain; Mathematical optimization; Scaling; Mathematics; Computer network","score_opus":0.010338919864645538,"score_gpt":0.18266091029326803,"score_spread":0.1723219904286225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090192756","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043828234,0.000013045439,0.94806385,0.0035614034,0.00011429937,0.00046282503,2.1023997e-7,0.00024891377,0.0037072126],"genre_scores_gemma":[0.7850547,4.823188e-7,0.21314651,0.0006209113,0.000046497178,0.0001254006,4.0746406e-7,0.000004628156,0.0010005024],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992957,0.0000150501155,0.00009604056,0.0002395728,0.00012285069,0.00023075152],"domain_scores_gemma":[0.9994181,0.000096280695,0.000036939855,0.00023478006,0.00012242825,0.000091502225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000106516185,0.00008756991,0.00009169556,0.000028540715,0.00011634659,0.00017054997,0.00031742398,0.000030975494,0.00004767364],"category_scores_gemma":[0.000015148141,0.000058827816,0.00003166032,0.00011763487,0.000032300955,0.00041295713,0.000030210622,0.00006180043,0.00008054539],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000102699505,0.000034903693,0.0006886391,0.00000929312,0.0000290623,7.304487e-7,0.00017688228,0.0013665322,0.00018038481,0.2415306,0.007423327,0.7485494],"study_design_scores_gemma":[0.0008185916,0.00019836088,0.0011252426,0.000018478228,0.0000055690884,0.0000059447534,0.000052729116,0.9915753,0.00028770103,0.0015345786,0.004180338,0.00019718817],"about_ca_topic_score_codex":0.000031660045,"about_ca_topic_score_gemma":0.00001022995,"teacher_disagreement_score":0.99020875,"about_ca_system_score_codex":0.000014267592,"about_ca_system_score_gemma":0.000044346056,"threshold_uncertainty_score":0.23989289},"labels":[],"label_agreement":null},{"id":"W2090418741","doi":"10.1587/transcom.e93.b.1268","title":"A Simple DOCSIS Simulator","year":2010,"lang":"en","type":"article","venue":"IEICE Transactions on Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Cable modem; Simple (philosophy); Network packet; Simulation; The Internet; Computer network; Operating system","score_opus":0.014975642298867232,"score_gpt":0.26703876073621596,"score_spread":0.25206311843734874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090418741","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029509093,0.000060545408,0.9806586,0.009784264,0.0004153996,0.00021818225,0.000012686268,0.0006101752,0.005289233],"genre_scores_gemma":[0.9701926,0.000061194965,0.028219776,0.0009107389,0.000040433093,0.00012427554,0.0000049122577,0.000012841442,0.00043320953],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989575,0.00009876368,0.00024584378,0.0002707436,0.00018925108,0.00023787245],"domain_scores_gemma":[0.99568135,0.0006406055,0.00006613465,0.0033250104,0.00013526526,0.00015164784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020046115,0.00014386229,0.00013500547,0.00013236725,0.0007400195,0.0001588631,0.002329575,0.00009532943,0.00018326347],"category_scores_gemma":[0.000018111725,0.00014631644,0.0001223599,0.0005568542,0.00012296707,0.00038448474,0.000027862725,0.00068671675,0.00036461986],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009238569,0.0005896132,0.000036627065,0.0000030762128,0.00006185162,0.000001414942,0.00039411755,0.009718136,0.0009666041,0.16292074,0.0007187498,0.82457983],"study_design_scores_gemma":[0.0006344074,0.00006654017,0.00041744846,0.000008797494,0.000034653654,0.000014579097,0.00004924044,0.7602171,0.00034323812,0.0030629456,0.23484153,0.00030955058],"about_ca_topic_score_codex":0.000039857663,"about_ca_topic_score_gemma":0.00060146407,"teacher_disagreement_score":0.9672417,"about_ca_system_score_codex":0.000022133545,"about_ca_system_score_gemma":0.00009282262,"threshold_uncertainty_score":0.5966611},"labels":[],"label_agreement":null},{"id":"W2091458970","doi":"10.1016/j.comcom.2006.04.018","title":"Management and admission control based on policies and measurements for the packet-switched domain of the UMTS core network","year":2006,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; UMTS frequency bands; Network packet; Domain (mathematical analysis); Computer network; Core (optical fiber); Control (management); Real-time computing; Telecommunications; Artificial intelligence","score_opus":0.036253919116719165,"score_gpt":0.25506885550245767,"score_spread":0.2188149363857385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091458970","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002176578,0.0014097625,0.97622454,0.018549316,0.00017702059,0.00092676113,0.00000478597,0.000054617216,0.0004766337],"genre_scores_gemma":[0.9495328,0.000043255972,0.04888748,0.0013063382,0.00008018704,0.00009753447,0.0000030073627,0.0000064751794,0.00004294194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990935,0.00015906699,0.00022314553,0.00017455121,0.00017873911,0.00017102314],"domain_scores_gemma":[0.99744725,0.00079476606,0.00013929236,0.001489423,0.00008865076,0.000040594525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004332636,0.00011766632,0.00013876754,0.000031549604,0.0006151631,0.0000910062,0.0012866034,0.000033562435,6.81168e-7],"category_scores_gemma":[0.00000716655,0.000072113355,0.00005872137,0.00019624559,0.00016236308,0.00005123852,0.00040045116,0.00009615786,5.009072e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066140405,0.00028730728,0.00960952,0.00003790329,0.00015348113,4.2410488e-7,0.0003392957,0.05280508,0.000046142883,0.4804431,0.015298677,0.44091293],"study_design_scores_gemma":[0.0013504439,0.00004613024,0.05305626,0.00008703858,0.00003892957,0.0000013767387,0.0000104186465,0.9272129,0.000004442129,0.006551301,0.011549584,0.00009116007],"about_ca_topic_score_codex":0.0000117379395,"about_ca_topic_score_gemma":0.00003361754,"teacher_disagreement_score":0.9473562,"about_ca_system_score_codex":0.000016593474,"about_ca_system_score_gemma":0.000025602096,"threshold_uncertainty_score":0.47313997},"labels":[],"label_agreement":null},{"id":"W2093385777","doi":"10.1109/icon.2012.6506565","title":"Performance analysis of an optimal internal congestion control in a cluster-based router","year":2012,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Router; Computer science; Scalability; InfiniBand; Throughput; Network congestion; Flow control (data); Computer network; Network packet; Operating system","score_opus":0.008380124896004428,"score_gpt":0.22983333452565452,"score_spread":0.2214532096296501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093385777","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50618154,0.00002377717,0.49305403,0.00016319705,0.00010595874,0.00007328464,0.0000010365403,0.000040244337,0.00035691846],"genre_scores_gemma":[0.9894885,0.0000015680505,0.00971644,0.0006458229,0.00005835041,0.00001961604,0.0000041521917,0.000004040338,0.00006154194],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887055,0.00012383578,0.00031366368,0.00020343263,0.00020105061,0.00028745152],"domain_scores_gemma":[0.9992616,0.00011568421,0.00010646485,0.0003273976,0.00007232675,0.000116507574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056647044,0.000113789705,0.00027019027,0.00034324126,0.000025224332,0.00004014638,0.00041024553,0.000058191323,0.00007317459],"category_scores_gemma":[0.000009771851,0.00009682961,0.00009338581,0.0006316104,0.00003428147,0.0007900328,0.00003340515,0.000101234225,0.000010247644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025095025,0.0003899819,0.2069003,0.000007753358,0.00022505016,0.0000023934024,0.0004187582,0.47301427,0.000093411305,0.0028470454,0.000043934495,0.31580615],"study_design_scores_gemma":[0.001184576,0.00010941384,0.13173723,0.000009435885,0.0000841377,0.0000016200681,0.000009794511,0.8666137,0.00007638563,0.0000013394304,0.00007296793,0.00009940166],"about_ca_topic_score_codex":0.000030556166,"about_ca_topic_score_gemma":0.000053949505,"teacher_disagreement_score":0.48333758,"about_ca_system_score_codex":0.000033524793,"about_ca_system_score_gemma":0.00003352114,"threshold_uncertainty_score":0.39485967},"labels":[],"label_agreement":null},{"id":"W2094782639","doi":"10.4304/jcm.6.3.215-224","title":"A Short-Time Burst degradation Classifier for Real-Time Traffic with Application in MPLS Ingress Nodes","year":2011,"lang":"en","type":"article","venue":"Journal of Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Computer network; Burstiness; Quality of service; Real-time computing; Scheduling (production processes); Classifier (UML); Queueing theory; Polling; Network packet; Artificial intelligence","score_opus":0.03889477770260401,"score_gpt":0.2671918485944175,"score_spread":0.2282970708918135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094782639","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10402612,0.0003886949,0.88809615,0.0037669118,0.00007246107,0.0006346506,0.000004790222,0.00009490579,0.002915321],"genre_scores_gemma":[0.8715922,0.00016311981,0.1279316,0.000050971048,0.00003932325,0.000073670824,0.0000075934563,0.000010624726,0.00013090126],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988783,0.00013912613,0.00050354196,0.00013244589,0.00018297677,0.00016358556],"domain_scores_gemma":[0.997908,0.00034791802,0.00036884658,0.00091872766,0.00037716655,0.00007933534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063680374,0.00010962023,0.00022300039,0.0001977004,0.0001496562,0.00006775896,0.0015428823,0.000063835665,0.000005134979],"category_scores_gemma":[0.000028254179,0.00009173493,0.00007303456,0.00038379323,0.00008547418,0.000561149,0.00007187063,0.0002022562,0.000011736041],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002204578,0.0008573659,0.001717832,0.000013146218,0.000118581585,0.0000036432523,0.002045068,0.0030562298,0.0014389225,0.042546004,0.0010361335,0.9469466],"study_design_scores_gemma":[0.00156996,0.00037203915,0.017029395,0.00018384222,0.00008643969,0.000090244124,0.00013770004,0.97348934,0.00010982399,0.0017596005,0.0048636748,0.00030791608],"about_ca_topic_score_codex":0.000008642517,"about_ca_topic_score_gemma":0.00006179249,"teacher_disagreement_score":0.9704331,"about_ca_system_score_codex":0.00006591461,"about_ca_system_score_gemma":0.00013448416,"threshold_uncertainty_score":0.3740842},"labels":[],"label_agreement":null},{"id":"W2095142844","doi":"10.1155/mpe.2005.477","title":"Suboptimal feedback control of TCP flows in computer network using random early discard (RED) mechanism","year":2005,"lang":"en","type":"article","venue":"Mathematical Problems in Engineering","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Random early detection; Active queue management; Queue; Router; Network congestion; Computer science; Transmission (telecommunications); Control theory (sociology); Process (computing); Dynamic programming; Mathematical optimization; Control (management); Mathematics; Computer network; Algorithm; Telecommunications","score_opus":0.008434004762839972,"score_gpt":0.19270160968304523,"score_spread":0.18426760492020525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095142844","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032547906,0.00016051943,0.9661872,0.00019465832,0.00022778363,0.00047557286,6.175648e-7,0.000119259916,0.00008647847],"genre_scores_gemma":[0.8029539,0.0000036297465,0.19674216,0.000032433134,0.0002077825,0.00003477032,3.386991e-7,0.000018342707,0.000006619578],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981015,0.000060420207,0.0007274067,0.00031508735,0.00026782943,0.000527811],"domain_scores_gemma":[0.999126,0.0003271321,0.00009301317,0.00032207326,0.000034912988,0.00009685021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000773033,0.00023023586,0.00057107257,0.00014102334,0.000025110034,0.000063149186,0.00046971976,0.00011370286,0.000014308526],"category_scores_gemma":[0.00002804515,0.00021459161,0.00010701018,0.00040736236,0.000020536749,0.00030018832,0.00011488593,0.00028947732,0.00001200697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001120875,0.000070020345,0.00008807907,0.00007820367,0.000018788432,0.0000065530903,0.0002642566,0.9604322,0.00022765019,0.029377641,0.000008352085,0.009417085],"study_design_scores_gemma":[0.0026867725,0.000039940198,0.00009497773,0.00041305143,0.00000952006,0.000012431978,0.0000016111485,0.9905868,0.000027425236,0.0058875526,0.00002460496,0.00021531055],"about_ca_topic_score_codex":0.0000043237424,"about_ca_topic_score_gemma":0.0000054534707,"teacher_disagreement_score":0.770406,"about_ca_system_score_codex":0.00006988618,"about_ca_system_score_gemma":0.00002234532,"threshold_uncertainty_score":0.87507915},"labels":[],"label_agreement":null},{"id":"W2095246136","doi":"10.1007/s11277-006-9049-2","title":"Congestion due to Rate Variations in cdma2000 Data Networks","year":2006,"lang":"en","type":"article","venue":"Wireless Personal Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Computer network; Router; Queue; Bandwidth (computing); Network packet; Queueing theory; CDMA2000; Network congestion; Packet loss; Bandwidth allocation; Distributed computing; Real-time computing","score_opus":0.03186145943287915,"score_gpt":0.2684822787533118,"score_spread":0.23662081932043266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095246136","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071559064,0.0007606277,0.95806986,0.0293539,0.0002496764,0.0004327752,0.00004290113,0.00029530888,0.0036390685],"genre_scores_gemma":[0.9822939,0.00008048829,0.015828906,0.0008103234,0.00014084084,0.00012123371,0.00028604752,0.000012989017,0.00042525973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830616,0.0003748204,0.00036646507,0.00044448423,0.0001834429,0.00032461967],"domain_scores_gemma":[0.99629396,0.0005648343,0.000099028926,0.0028083352,0.00013003057,0.00010381143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007117627,0.00015844895,0.00020409799,0.00015773538,0.00038048872,0.00021236415,0.0036625683,0.00009003142,0.00001854385],"category_scores_gemma":[0.000039185994,0.0001754145,0.000038418308,0.00096095505,0.00008244064,0.0005518933,0.0009670618,0.0003430133,0.00008880945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001767311,0.00040501414,0.0013219608,0.0000040449445,0.000026760377,0.000013253701,0.00054227153,0.026691481,0.000106665044,0.6589153,0.007952609,0.30400297],"study_design_scores_gemma":[0.0003573663,0.000016061378,0.019345768,0.000032952295,0.0000098683995,0.000011875917,0.000029085913,0.96698034,0.0000013855833,0.0008199174,0.012194728,0.00020064795],"about_ca_topic_score_codex":0.00073693687,"about_ca_topic_score_gemma":0.004747309,"teacher_disagreement_score":0.975138,"about_ca_system_score_codex":0.00008664191,"about_ca_system_score_gemma":0.0001498385,"threshold_uncertainty_score":0.71531963},"labels":[],"label_agreement":null},{"id":"W2096041271","doi":"10.1109/glocom.1993.318228","title":"Application of neural networks for routing in telecommunications networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; Manitoba Hydro","funders":"","keywords":"Routing (electronic design automation); Artificial neural network; Computer science; Computer network; Network routing; Perspective (graphical); Routing protocol; Sample (material); Static routing; Artificial intelligence; Telecommunications","score_opus":0.01628857723548987,"score_gpt":0.2325788727319005,"score_spread":0.21629029549641063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096041271","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005833762,0.00037560234,0.99598247,0.0013459255,0.00008650531,0.00033716744,2.4110977e-7,0.00009980527,0.0011888971],"genre_scores_gemma":[0.9785647,0.000040460185,0.020787144,0.000284728,0.00007382937,0.00013086961,0.0000031719046,0.000005584521,0.00010953075],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918044,0.000046405232,0.00030117115,0.00019062436,0.00006434226,0.00021701833],"domain_scores_gemma":[0.99895465,0.0003360381,0.000107728396,0.0005067401,0.000056817134,0.000038051046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023131023,0.00007824751,0.00013282144,0.00005042767,0.000076539385,0.000032901407,0.00064743095,0.00005992805,0.000008204973],"category_scores_gemma":[0.000016665947,0.00007632978,0.000052785363,0.00041384852,0.000024252076,0.0001640149,0.000075621974,0.00011624787,0.0000020133787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001564808,0.000037010755,0.0011052424,0.0000010064075,0.0000031748216,6.615124e-8,0.00003792695,0.3670727,0.0000022552513,0.077489145,0.00028997296,0.5539599],"study_design_scores_gemma":[0.00033761538,0.00002365961,0.0010083127,0.000004900118,0.000003002335,0.0000013481072,0.000008701949,0.99783117,0.0000020983155,0.00018151371,0.0005191981,0.00007846401],"about_ca_topic_score_codex":0.000018115355,"about_ca_topic_score_gemma":0.00007082885,"teacher_disagreement_score":0.9779813,"about_ca_system_score_codex":0.000016519185,"about_ca_system_score_gemma":0.0000039333463,"threshold_uncertainty_score":0.31126383},"labels":[],"label_agreement":null},{"id":"W2096173970","doi":"10.1109/glocom.1996.587599","title":"Dynamic rate-based control algorithm for ABR service in ATM networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Constant bitrate; Variable bitrate; Computer science; Asynchronous Transfer Mode; Bandwidth (computing); Computer network; Bandwidth allocation; Quality of service; Service (business); Algorithm; Real-time computing; Distributed computing","score_opus":0.008731220253704257,"score_gpt":0.2076705712280127,"score_spread":0.19893935097430843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096173970","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024539226,0.00037238916,0.99086237,0.0064493646,0.00043194726,0.0005369081,0.0000031503698,0.00027594835,0.0008225245],"genre_scores_gemma":[0.9346649,0.0000149342295,0.05237727,0.011649384,0.0001020832,0.00020155775,0.000005283993,0.00001558939,0.00096901995],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863076,0.00008784872,0.0002828274,0.00041397454,0.0001252586,0.00045930105],"domain_scores_gemma":[0.99886847,0.00045476467,0.000068271795,0.00039274414,0.00010643139,0.00010930104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034395463,0.00017678495,0.00023976622,0.00007597337,0.00008702548,0.00012335215,0.0006079684,0.000104681545,0.00012130626],"category_scores_gemma":[0.000010168056,0.00016078133,0.00008119497,0.0004901971,0.000018033898,0.00021817588,0.000021839198,0.00013909703,0.000069007125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000997507,0.000077583856,0.000043118398,0.0000038304697,0.000012171983,0.000008269509,0.000023707988,0.13296267,0.000004367379,0.003099394,0.0014113116,0.8623436],"study_design_scores_gemma":[0.0037652534,0.000068025605,0.0003821371,0.00001122283,0.000007781609,0.0000022391575,0.0000048544543,0.9920164,0.0000032236985,0.00018068316,0.0033550514,0.00020312998],"about_ca_topic_score_codex":0.000022178025,"about_ca_topic_score_gemma":0.00024354449,"teacher_disagreement_score":0.9384851,"about_ca_system_score_codex":0.000050290662,"about_ca_system_score_gemma":0.00002651653,"threshold_uncertainty_score":0.6556472},"labels":[],"label_agreement":null},{"id":"W2096216296","doi":"10.1109/icsnc.2007.36","title":"Experience Applying Policy-Based Techniques to Traffic Management in Low-Bandwidth Heterogeneous Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"Defence Research and Development Canada","keywords":"Testbed; Software deployment; Computer science; Bandwidth (computing); Network management; Computer network; Task (project management); Architecture; Distributed computing; Systems engineering; Software engineering; Engineering","score_opus":0.00879484504714441,"score_gpt":0.25727322984750567,"score_spread":0.24847838480036125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096216296","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025302444,0.0000611039,0.9694578,0.0006427478,0.00015671868,0.0007674159,1.4989064e-7,0.0006512604,0.0029603385],"genre_scores_gemma":[0.93689626,0.0000095684145,0.057423133,0.005059657,0.00013691076,0.00028161966,7.9257325e-7,0.000012391739,0.00017963709],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981179,0.000037165708,0.00036948916,0.0005317244,0.00027911103,0.00066458114],"domain_scores_gemma":[0.9990849,0.00008364707,0.000050756058,0.00053653604,0.000031471605,0.0002127195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004832783,0.00020391763,0.00018746807,0.00039329755,0.00009574042,0.00013514287,0.0008696127,0.000078775905,0.0000126697505],"category_scores_gemma":[0.000006635695,0.00019337822,0.00006546498,0.0011248719,0.000033168228,0.00014032474,0.00013671686,0.00012600292,0.000020908596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021586038,0.000059438742,0.00005811751,0.000004510469,0.0000049846385,0.00009168085,0.00014492504,0.1879938,0.000014785756,0.007862603,0.00008579582,0.80365777],"study_design_scores_gemma":[0.00058430113,0.00011581094,0.00032800672,0.00008737353,0.000003331916,0.000013402115,0.00005739145,0.9870568,0.0013517562,0.00008249276,0.009872623,0.00044673946],"about_ca_topic_score_codex":0.000024087969,"about_ca_topic_score_gemma":0.00012630876,"teacher_disagreement_score":0.9120347,"about_ca_system_score_codex":0.00012401986,"about_ca_system_score_gemma":0.00003183937,"threshold_uncertainty_score":0.7885735},"labels":[],"label_agreement":null},{"id":"W2096481382","doi":"10.1109/vetecs.2005.1543711","title":"Estimating Heavy-tails in Long-range Dependent Wireless Traffic","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Heavy-tailed distribution; Estimator; Range (aeronautics); Marginal distribution; Estimation theory; Computer science; Extreme value theory; Tail dependence; Wireless; Statistics; Algorithm; Probability distribution; Statistical physics; Mathematics; Random variable; Physics; Engineering; Multivariate statistics; Telecommunications","score_opus":0.009843543576819564,"score_gpt":0.23239436564732158,"score_spread":0.222550822070502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096481382","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30044594,0.000250877,0.6935518,0.0030373214,0.0003044796,0.00018781562,3.013359e-7,0.000364844,0.0018566301],"genre_scores_gemma":[0.9563668,0.000006154475,0.041913126,0.00073656917,0.00024383665,0.000029081135,7.682268e-7,0.0000084360745,0.0006952573],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998557,0.00006380161,0.0003128063,0.00039432998,0.0002700072,0.00040206165],"domain_scores_gemma":[0.99932235,0.00011032795,0.000057540397,0.0003570468,0.000037125053,0.00011557816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035800377,0.00015135857,0.00019005101,0.000098831784,0.00007724205,0.00015703523,0.0006237295,0.00006731054,0.000073781266],"category_scores_gemma":[0.00001156283,0.0001385171,0.000052937903,0.0003021163,0.000022749698,0.00048619523,0.000080609614,0.00017942592,0.00022206151],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056432436,0.00007615403,0.0007251226,0.000004321921,0.0000047008853,0.000024272475,0.00020484693,0.12075391,0.0000045910197,0.00539177,0.00029433725,0.8725103],"study_design_scores_gemma":[0.0007056657,0.000028119208,0.0014744101,0.000028285416,0.0000027087021,0.000022984292,0.000013277898,0.99717295,0.00003491603,0.00004949439,0.00028766657,0.00017954946],"about_ca_topic_score_codex":0.000016285132,"about_ca_topic_score_gemma":0.0008111967,"teacher_disagreement_score":0.876419,"about_ca_system_score_codex":0.000071299975,"about_ca_system_score_gemma":0.00006249234,"threshold_uncertainty_score":0.56485635},"labels":[],"label_agreement":null},{"id":"W2096948202","doi":"10.1109/inm.2005.1440801","title":"Zero-budget network dimensioning","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Dimensioning; Computer science; Revenue; Traffic engineering; Network traffic simulation; Network traffic control; Traffic generation model; Operations research; Distributed computing; Computer network; Engineering","score_opus":0.006266892890553851,"score_gpt":0.20459334896944778,"score_spread":0.19832645607889393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096948202","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017932195,0.00038067874,0.9575358,0.005048197,0.00040186252,0.000066581015,5.8072832e-8,0.0004932869,0.034280337],"genre_scores_gemma":[0.87298566,0.00001009153,0.116440974,0.0042625633,0.00048565134,0.0000065668664,4.8339047e-7,0.000004842491,0.0058031674],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915576,0.00003142765,0.00014219695,0.00023343683,0.00014469566,0.00029245683],"domain_scores_gemma":[0.9994358,0.000080543614,0.000032913867,0.00032320025,0.000034953417,0.00009261352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018629369,0.000087919005,0.000096930766,0.000021200774,0.00013277052,0.000095426665,0.00038892517,0.00003691866,0.00008995266],"category_scores_gemma":[0.0000066894745,0.00007325986,0.000042762164,0.00020392654,0.000015179122,0.0002855552,0.000108233944,0.00008749328,0.00069419784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017734907,0.0000117819,0.00015918753,3.1579415e-7,0.0000065015456,0.0000026963112,0.000030580835,0.03176701,0.000010460061,0.28376606,0.07504238,0.60920125],"study_design_scores_gemma":[0.00023982805,0.000020325824,0.00024979975,0.0000066694333,0.0000027104377,0.000009560855,0.0000013092156,0.78165036,0.000028567076,0.002020748,0.21564755,0.00012259209],"about_ca_topic_score_codex":0.0000018014316,"about_ca_topic_score_gemma":0.000007841381,"teacher_disagreement_score":0.87119246,"about_ca_system_score_codex":0.000015262951,"about_ca_system_score_gemma":0.000025363352,"threshold_uncertainty_score":0.892274},"labels":[],"label_agreement":null},{"id":"W2097186409","doi":"10.1109/glocom.1989.64262","title":"Combined adaptive routine/capacity assignment in nested movable boundary frame integrated services networks","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Frame (networking); Boundary (topology); Smoothing; Computer network; Channel (broadcasting); Routing (electronic design automation); Algorithm; Mathematical optimization; Mathematics; Computer vision","score_opus":0.0102698054711786,"score_gpt":0.19309907632077314,"score_spread":0.18282927084959455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097186409","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050533343,0.00018809715,0.93794346,0.0005264887,0.000634882,0.00040975492,0.0000011170188,0.0004080635,0.009354797],"genre_scores_gemma":[0.9805368,0.000013264862,0.01694317,0.0015821933,0.000036123387,0.000052325777,0.0000054678458,0.000012149511,0.00081847876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978877,0.00034563302,0.00040702592,0.00052877964,0.0002870387,0.0005438466],"domain_scores_gemma":[0.9989285,0.00017812778,0.00011932985,0.0004959319,0.00011770947,0.00016041839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005790381,0.00026762247,0.00032853274,0.00010308907,0.00014988036,0.00029464133,0.0006463116,0.00016819511,0.00012359531],"category_scores_gemma":[0.000016911943,0.00022854425,0.00006869821,0.0009348144,0.000061899584,0.0005201701,0.00008594788,0.00041785956,0.00004876717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001825048,0.00088841154,0.016710036,0.000019703033,0.00015304916,0.000084186846,0.0010229754,0.14927688,0.00008862391,0.7557049,0.002197509,0.073671244],"study_design_scores_gemma":[0.0014616996,0.00017161669,0.0029665052,0.000056008834,0.00000752725,0.0000065024183,0.00018794314,0.9884933,0.000063536725,0.0029990599,0.0032790734,0.00030721084],"about_ca_topic_score_codex":0.00024461813,"about_ca_topic_score_gemma":0.0003060563,"teacher_disagreement_score":0.93000346,"about_ca_system_score_codex":0.00012970227,"about_ca_system_score_gemma":0.0001171569,"threshold_uncertainty_score":0.9319764},"labels":[],"label_agreement":null},{"id":"W2097200153","doi":"10.1109/mascot.1999.805035","title":"Performance and robustness testing of explicit-rate ABR flow control schemes","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Robustness (evolution); Computer science; Scalability; Benchmark (surveying); Flow control (data); Distributed computing; Simulation; Computer network; Operating system","score_opus":0.014035707737367174,"score_gpt":0.1982377900612313,"score_spread":0.18420208232386412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097200153","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31136137,0.00015644192,0.6832956,0.00014269019,0.00011103742,0.00010431123,3.2029595e-7,0.00010084068,0.00472738],"genre_scores_gemma":[0.9362454,0.0000145262675,0.06320623,0.00016283907,0.000026400381,0.00001351438,1.2750874e-7,0.000004627301,0.00032637044],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918324,0.000058386035,0.00020208272,0.00023305025,0.00011279951,0.00021047221],"domain_scores_gemma":[0.99924916,0.0002366234,0.00007418723,0.00024366294,0.00012584635,0.00007050051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036480397,0.00010919026,0.00017563415,0.000040653456,0.00008898202,0.000051004732,0.00022344632,0.000037919992,0.000015610363],"category_scores_gemma":[0.00008286356,0.000090605135,0.000022650416,0.0002455381,0.000035626457,0.00030242032,0.000028319104,0.00007196849,0.0000047946205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014448406,0.000058194924,0.019292567,0.000039864106,0.000035585996,0.0000049655123,0.00009795629,0.065728955,0.0010175944,0.077000454,0.00032133365,0.83638805],"study_design_scores_gemma":[0.00078587607,0.0000558514,0.0019098236,0.000022992424,0.0000061696383,0.000012232364,0.000011901091,0.9955904,0.0007135602,0.000057334655,0.0007173913,0.00011648045],"about_ca_topic_score_codex":0.0000019913198,"about_ca_topic_score_gemma":0.0000012031877,"teacher_disagreement_score":0.9298614,"about_ca_system_score_codex":0.000005909447,"about_ca_system_score_gemma":0.0000496203,"threshold_uncertainty_score":0.369477},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.005572579569756598,"score_gpt":0.18991105246451112,"score_spread":0.18433847289475452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097247867","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10084665,0.00013851587,0.74571943,0.0014219951,0.0010516122,0.0001605411,3.8526395e-7,0.00086438743,0.14979649],"genre_scores_gemma":[0.9934398,0.0000050148965,0.0020717015,0.0015914202,0.000026510392,0.0000051755446,5.3567885e-7,0.000002948119,0.0028568753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994304,0.000043164884,0.000082464285,0.00018526803,0.00011379722,0.00014488383],"domain_scores_gemma":[0.9995878,0.000043599044,0.000021282296,0.00026192225,0.000027061335,0.000058374346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006273709,0.000071617804,0.00006817412,0.000028654107,0.000055668734,0.00008597618,0.00029319496,0.000029624696,0.00013802835],"category_scores_gemma":[0.0000031775453,0.000053847943,0.000029095532,0.0001376673,0.0000062997724,0.00009502003,0.000018365743,0.000055379278,0.00036757003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024867236,0.000059507045,0.0003232655,0.0000025277998,0.000011446084,0.000003960458,0.000055412038,0.0002152183,0.000035858015,0.87235117,0.0008105466,0.12612857],"study_design_scores_gemma":[0.0025915147,0.00035761288,0.008064108,0.000059185415,0.00001788486,0.00001826551,0.00006140163,0.83094245,0.0029148168,0.015523979,0.13869607,0.00075273507],"about_ca_topic_score_codex":0.0000026245316,"about_ca_topic_score_gemma":0.000008727709,"teacher_disagreement_score":0.89259315,"about_ca_system_score_codex":0.000006012986,"about_ca_system_score_gemma":0.000012909875,"threshold_uncertainty_score":0.47244915},"labels":[],"label_agreement":null},{"id":"W2097261252","doi":"10.1109/comst.2004.5342237","title":"Voice over the internet: A tutorial discussing problems and solutions associated with alternative transport","year":2004,"lang":"en","type":"article","venue":"IEEE Communications Surveys & Tutorials","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"WiLAN (Canada)","funders":"","keywords":"Voice over IP; Computer science; The Internet; Service provider; Telephony; Quality of service; Internet service provider; Service (business); Telecommunications; Network packet; Computer network; Voice communication; Telephone network; Circuit switching; Public switched telephone network; Mobile communications over IP; World Wide Web; Mobile telephony; Business","score_opus":0.04653974938580988,"score_gpt":0.26179801332340236,"score_spread":0.21525826393759248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097261252","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078906335,0.00090056733,0.9078796,0.006022539,0.0038785737,0.0010540943,0.00004731879,0.0004226404,0.00088836695],"genre_scores_gemma":[0.99734795,0.00011453826,0.001537965,0.0001087228,0.0004825133,0.00016100625,0.000024917537,0.000018353534,0.00020401545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9970214,0.0014689445,0.0004373959,0.0003613722,0.0003569134,0.00035402208],"domain_scores_gemma":[0.99661964,0.0011901716,0.00028698618,0.0015267277,0.00027584494,0.00010063698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00322432,0.00022271332,0.0002885441,0.000069971094,0.0007337801,0.0002967674,0.0019133555,0.00009417928,0.0000037997809],"category_scores_gemma":[0.00015883055,0.00014870743,0.00007415928,0.0005407331,0.0004936935,0.0006069964,0.00020241085,0.00035947564,0.000011232671],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012388268,0.0026278023,0.010463733,0.000032806893,0.0024095809,0.00002798143,0.055432227,0.05039734,0.0015326844,0.72959137,0.0020374295,0.14532316],"study_design_scores_gemma":[0.038605336,0.0021522206,0.4077797,0.0030639505,0.0014955915,0.00018644122,0.0009384404,0.2697368,0.00072472,0.091283344,0.17788057,0.006152917],"about_ca_topic_score_codex":0.0010624918,"about_ca_topic_score_gemma":0.005231994,"teacher_disagreement_score":0.91844165,"about_ca_system_score_codex":0.00016213996,"about_ca_system_score_gemma":0.00025542805,"threshold_uncertainty_score":0.6064113},"labels":[],"label_agreement":null},{"id":"W2097350115","doi":"10.1016/j.comnet.2011.02.011","title":"Large scale probabilistic available bandwidth estimation","year":2011,"lang":"en","type":"article","venue":"Computer Networks","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Probabilistic logic; Bandwidth (computing); Network packet; PlanetLab; Real-time computing; Computer network; Distributed computing; Scalability; Artificial intelligence","score_opus":0.015293814900849752,"score_gpt":0.19757449499237653,"score_spread":0.1822806800915268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097350115","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013182586,0.0003158827,0.9913402,0.00010588308,0.0015493421,0.0002878714,7.830825e-7,0.0006095928,0.004472186],"genre_scores_gemma":[0.82427514,0.00001547945,0.17365511,0.0007090868,0.00058814365,0.00004877473,0.000009569669,0.000019036343,0.00067965203],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998284,0.0001022951,0.00031223096,0.0005521633,0.00020585246,0.00054345344],"domain_scores_gemma":[0.9988007,0.00009569973,0.00011148253,0.00072632515,0.00008838293,0.00017740215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039719534,0.0002152715,0.0002404926,0.00006660179,0.00020406392,0.00017326769,0.000879739,0.00011774162,0.00019118533],"category_scores_gemma":[0.0000057145835,0.00020095693,0.00008992972,0.0003792999,0.00004789967,0.00045828687,0.00028466198,0.0002218737,0.00048270708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024132005,0.00037154127,0.0014825965,0.000021417545,0.00005328097,0.000040598105,0.0018730857,0.12061125,8.1091025e-7,0.083796255,0.0632835,0.72844154],"study_design_scores_gemma":[0.00051382155,0.00009753434,0.00083162024,0.000036818015,0.000012358164,0.000019545669,0.0000029102057,0.9906462,0.0000035286585,0.0024691843,0.005124949,0.00024152354],"about_ca_topic_score_codex":0.00000412447,"about_ca_topic_score_gemma":0.000011992349,"teacher_disagreement_score":0.87003493,"about_ca_system_score_codex":0.00003398632,"about_ca_system_score_gemma":0.00004291886,"threshold_uncertainty_score":0.8194786},"labels":[],"label_agreement":null},{"id":"W2097597868","doi":"10.1109/milcom.2007.4454839","title":"Fairness Guarantees and Achievable QoS in Differentiated Services","year":2007,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Quality of service; Computer science; Estimator; Enhanced Data Rates for GSM Evolution; Conditioners; Computer network; Packet loss; Network packet; Differentiated services; Conditioning; Telecommunications; Engineering; Statistics; Mathematics","score_opus":0.0027137092600869853,"score_gpt":0.19530333640316286,"score_spread":0.19258962714307587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097597868","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63018125,0.0002651277,0.36585554,0.00043149045,0.00022861318,0.00009506597,1.925461e-7,0.00016785438,0.0027748258],"genre_scores_gemma":[0.9974361,0.000017415097,0.0015048265,0.00035071498,0.00006341379,0.00000324368,8.2340705e-7,0.000003235591,0.0006202202],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925226,0.000022188875,0.0001544345,0.00022591017,0.00011042244,0.00023476045],"domain_scores_gemma":[0.99964285,0.000076218304,0.000027966638,0.00017380893,0.000025029902,0.00005413749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023843741,0.00008717195,0.000112325855,0.00008024609,0.000047886206,0.00009977942,0.00029776804,0.000044303033,0.000020697733],"category_scores_gemma":[0.0000019915321,0.00007002684,0.000015842754,0.00023986756,0.000017761446,0.0002617703,0.00008475768,0.0000733399,0.000016229737],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006397613,0.00020219611,0.06285503,0.000051236566,0.00003085757,0.000064111286,0.0011956089,0.00023965,0.00083236845,0.20005225,0.00038951368,0.7340232],"study_design_scores_gemma":[0.0026928876,0.00010399192,0.36882943,0.00009191098,0.000009907068,0.000026222811,0.00034762686,0.61940825,0.000806639,0.002555157,0.004639734,0.0004882678],"about_ca_topic_score_codex":0.00008167454,"about_ca_topic_score_gemma":0.00087411795,"teacher_disagreement_score":0.73353493,"about_ca_system_score_codex":0.000007838479,"about_ca_system_score_gemma":0.000008829863,"threshold_uncertainty_score":0.28556117},"labels":[],"label_agreement":null},{"id":"W2097666774","doi":"10.1109/broadnets.2006.4374380","title":"Optimal Bandwidth Allocation for Dynamically Priced Network Services","year":2006,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Heuristics; Computer science; Knapsack problem; Quality of service; Bandwidth (computing); Revenue; Bandwidth allocation; Heuristic; Mathematical optimization; Resource allocation; Service (business); Computer network; Algorithm; Mathematics","score_opus":0.003311846925155182,"score_gpt":0.19386058430841702,"score_spread":0.19054873738326183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097666774","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064781676,0.000106023326,0.9873062,0.0019878051,0.00029189105,0.00028991024,7.00328e-7,0.00035114694,0.0031881705],"genre_scores_gemma":[0.7643817,0.0000030297495,0.23242308,0.0007576538,0.000456672,0.00006591888,0.000023981002,0.000007086562,0.0018808608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999067,0.000022431896,0.00019877587,0.00028735952,0.00013557327,0.00028884626],"domain_scores_gemma":[0.9994034,0.00011598258,0.000066611814,0.0002528243,0.00011114467,0.00004999678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001868791,0.00010663275,0.0001142064,0.000024027306,0.00012639118,0.00015941617,0.00047318978,0.000056936824,0.000011243886],"category_scores_gemma":[0.0000022112752,0.000092292794,0.00005803747,0.0001976622,0.00001305131,0.00025773855,0.000049980936,0.000045540455,0.000033522105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025780017,0.00006113664,0.0002783834,0.000014810102,0.0000182414,0.0000011594506,0.000027156366,0.2993778,0.00008282121,0.58662033,0.0063806954,0.107111715],"study_design_scores_gemma":[0.00047247554,0.000051149593,0.001604878,0.000008005799,0.000007501092,0.0000022367817,0.0000032993396,0.98302287,0.000014051919,0.0029363653,0.011746825,0.0001303244],"about_ca_topic_score_codex":0.000022569919,"about_ca_topic_score_gemma":0.00010990613,"teacher_disagreement_score":0.7579035,"about_ca_system_score_codex":0.000019882622,"about_ca_system_score_gemma":0.000036248406,"threshold_uncertainty_score":0.37635908},"labels":[],"label_agreement":null},{"id":"W2098023843","doi":"10.1109/tie.2008.2010080","title":"A Robust Distributed Congestion-Control Strategy for Differentiated-Services Network","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Industrial Electronics","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Network congestion; Computer science; Controller (irrigation); Computer network; Network engineering; Hop (telecommunications); Distributed computing; Network packet","score_opus":0.044077022551695585,"score_gpt":0.22713222053436127,"score_spread":0.18305519798266567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098023843","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008803964,0.00030141478,0.98677623,0.0007675961,0.0016768773,0.00095728756,0.00011465244,0.00054785033,0.00005409524],"genre_scores_gemma":[0.9974914,0.00016740925,0.00062047655,0.00029822462,0.00069500407,0.0003608063,0.00003845271,0.000032453554,0.00029574722],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972947,0.00016995022,0.0005351389,0.0006533478,0.00036124955,0.0009855807],"domain_scores_gemma":[0.99831545,0.00048307338,0.00020615189,0.00054435583,0.00021401036,0.00023693545],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027153402,0.00038644177,0.00045635115,0.00011492927,0.00091505103,0.00017086529,0.0007839402,0.0004217355,0.000038568054],"category_scores_gemma":[0.0000069695066,0.00038086166,0.00027988487,0.00068853167,0.00008074847,0.0003869225,0.0000024844942,0.00081434107,0.000026880343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042296338,0.00025345548,0.000018998713,0.0000062530135,0.00023694817,0.000009626405,0.00003398788,0.88995606,0.000028134355,0.0055009434,0.0018813378,0.10165131],"study_design_scores_gemma":[0.009589927,0.0014463592,0.000077640696,0.00006067521,0.00020087228,0.00008200852,0.000014967249,0.9773908,0.00043858,0.00095604616,0.009054692,0.0006874262],"about_ca_topic_score_codex":0.000026294963,"about_ca_topic_score_gemma":0.00014875573,"teacher_disagreement_score":0.98868746,"about_ca_system_score_codex":0.00019404796,"about_ca_system_score_gemma":0.0005487245,"threshold_uncertainty_score":0.99986434},"labels":[],"label_agreement":null},{"id":"W2098225262","doi":"10.1109/infcom.1996.493049","title":"A measurement-based loss scheduling scheme","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Technical University of Nova Scotia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quality of service; Computer science; Packet loss; Computer network; Scheduling (production processes); Distributed computing; Data loss; Network packet; Real-time computing; Mathematical optimization; Mathematics","score_opus":0.03402421973102381,"score_gpt":0.21054935187412988,"score_spread":0.17652513214310606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098225262","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020918483,0.00055387104,0.98309267,0.0051254877,0.00021388993,0.00008133777,8.735493e-8,0.0004526093,0.008388213],"genre_scores_gemma":[0.92058873,0.0000039254464,0.077278145,0.0016546156,0.000082488295,0.000012224798,9.682233e-8,0.00000460658,0.0003751378],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989468,0.00003154466,0.00013871344,0.00025510063,0.00038622774,0.0002416021],"domain_scores_gemma":[0.99936306,0.000023219913,0.00003401338,0.00035577887,0.00012635317,0.00009756142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002506563,0.00009582853,0.00009311508,0.00004658981,0.00009364077,0.00011602538,0.0004649606,0.00003700608,0.00023873852],"category_scores_gemma":[0.00002919867,0.000084238614,0.000055948927,0.00024454246,0.000022007514,0.00019230241,0.000036221256,0.00008909066,0.0005236567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000547755,0.00020063954,0.0010278034,0.000011095747,0.00003758313,0.00003496,0.00006809097,0.0058301324,0.0005598925,0.17095494,0.0050382135,0.8162312],"study_design_scores_gemma":[0.0005534997,0.000022903905,0.00005644828,0.000016194088,0.0000024956066,0.000003017312,0.0000027186118,0.9921538,0.00022208208,0.000109387394,0.0067351963,0.00012226112],"about_ca_topic_score_codex":0.00000245144,"about_ca_topic_score_gemma":0.00000455161,"teacher_disagreement_score":0.98632365,"about_ca_system_score_codex":0.000030619794,"about_ca_system_score_gemma":0.000028118448,"threshold_uncertainty_score":0.6730722},"labels":[],"label_agreement":null},{"id":"W2098329915","doi":"10.1631/fitee.1400414","title":"End-to-end delay analysis for networked systems","year":2015,"lang":"en","type":"article","venue":"Frontiers of Information Technology & Electronic Engineering","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Science Foundation of Hubei Province; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Bottleneck; Computer science; Transfer function; Network delay; Signal-flow graph; End-to-end delay; Delay calculation; Elmore delay; Laplace transform; End-to-end principle; Time domain; Frequency domain; Algorithm; Distributed computing; Real-time computing; Propagation delay; Mathematics; Computer network; Engineering; Embedded system","score_opus":0.003812293015394152,"score_gpt":0.1816000672868783,"score_spread":0.17778777427148415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098329915","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027186018,0.0017140904,0.9933981,0.0005762841,0.00057130674,0.00036674633,0.0000036639356,0.00054589653,0.00010536679],"genre_scores_gemma":[0.9294998,0.00002096479,0.07016525,0.00005298547,0.000038379727,0.00016126058,0.000018439643,0.0000068821805,0.00003606178],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986712,0.000009898522,0.0004513661,0.00015627341,0.0002098621,0.00050141214],"domain_scores_gemma":[0.999026,0.000031031184,0.00017931942,0.00040219034,0.00026136808,0.00010007717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004905413,0.0001513049,0.00033735225,0.0011876357,0.000044648415,0.000054974953,0.00072176545,0.00018543634,7.032942e-7],"category_scores_gemma":[0.00007081409,0.00015796152,0.00009920712,0.0019843334,0.000021617427,0.0006541157,0.0000675661,0.00019386667,0.000006643423],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011740516,0.0000058379164,0.00019783832,0.00000834823,0.00035282108,2.105129e-7,0.000110002984,0.82515466,0.0000107629585,0.10946987,0.004179451,0.060498454],"study_design_scores_gemma":[0.00041008517,0.00015006826,0.000019986019,0.000007186052,0.00007171724,0.000005802285,0.00008874535,0.93921196,0.00015108549,0.00027162107,0.05946317,0.00014854727],"about_ca_topic_score_codex":0.0000062597583,"about_ca_topic_score_gemma":0.0000032188882,"teacher_disagreement_score":0.9267812,"about_ca_system_score_codex":0.0001981183,"about_ca_system_score_gemma":0.00016087182,"threshold_uncertainty_score":0.6441484},"labels":[],"label_agreement":null},{"id":"W2098342991","doi":"10.1109/ccece.2005.1557294","title":"Novel DLC model for VBR QoS enhancement in wireless atm networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science; Computer network; Quality of service; Variable bitrate; Asynchronous Transfer Mode; Wireless; Data transmission; Wireless network; Transmission (telecommunications); Telecommunications","score_opus":0.012406194876917397,"score_gpt":0.21832304199554456,"score_spread":0.20591684711862715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098342991","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036279985,0.000084538275,0.99229574,0.0009518184,0.00037105917,0.00036607723,9.354829e-7,0.00012534346,0.0021764787],"genre_scores_gemma":[0.93702245,0.000008684976,0.057146627,0.00075377605,0.00027993042,0.0001646685,0.0000047141143,0.000008164797,0.004611008],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988348,0.000011652895,0.0002716044,0.00035720217,0.0001462194,0.00037855108],"domain_scores_gemma":[0.99946815,0.00008335292,0.00005565047,0.00028980023,0.000051700845,0.000051373772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002036255,0.00013358054,0.00016377379,0.000044538738,0.000066278524,0.00008269995,0.00044361383,0.00006882818,0.000008835357],"category_scores_gemma":[0.00000234946,0.00012127109,0.00006129182,0.0001941998,0.000018208584,0.00019145287,0.00006842422,0.00008293759,0.000008774483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013024252,0.00014259486,0.00008069909,0.000003148106,0.000005210385,9.857752e-7,0.000025605486,0.54809314,0.00020864043,0.3007026,0.0047727074,0.14595167],"study_design_scores_gemma":[0.0010435723,0.00002839525,0.00012299397,0.000012317261,0.0000030872518,0.0000011594963,0.0000025524741,0.9966452,0.00008662592,0.0010369549,0.0008555628,0.00016156507],"about_ca_topic_score_codex":0.00004910103,"about_ca_topic_score_gemma":0.00033494327,"teacher_disagreement_score":0.93514913,"about_ca_system_score_codex":0.000045405195,"about_ca_system_score_gemma":0.000048266986,"threshold_uncertainty_score":0.49452916},"labels":[],"label_agreement":null},{"id":"W2098374802","doi":"10.1109/icdcs.2011.49","title":"One More Weight is Enough: Toward the Optimal Traffic Engineering with OSPF","year":2011,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Open Shortest Path First; Computer science; Traffic engineering; Maximization; Routing protocol; Mathematical optimization; Computer network; Routing (electronic design automation); Set (abstract data type); Distributed computing; Link-state routing protocol; Mathematics","score_opus":0.018446674537008666,"score_gpt":0.1805889414630052,"score_spread":0.16214226692599654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098374802","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035524797,0.0002574865,0.95167977,0.007660184,0.00024475757,0.00021341904,7.1048504e-7,0.00055226195,0.0038666108],"genre_scores_gemma":[0.93487424,0.000015138231,0.06351848,0.00086799904,0.00012236548,0.000025442814,3.7398522e-7,0.000010757854,0.0005651847],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990367,0.000015465308,0.00013632928,0.0002860199,0.00022664206,0.00029880516],"domain_scores_gemma":[0.9993322,0.000048024147,0.000033899796,0.00044124085,0.000052316802,0.00009231667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011640614,0.0001430781,0.0001338683,0.000034208966,0.00008130388,0.00007759495,0.00077212806,0.000044446984,0.00016305047],"category_scores_gemma":[0.000003056656,0.0000884416,0.000050974086,0.0002483149,0.00004508401,0.00023871975,0.00007366834,0.00015205098,0.000078385565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061793806,0.0002490734,0.00009726744,0.000017026045,0.00026175677,0.000053271116,0.023462933,0.041328408,0.000043755288,0.16523221,0.0040629273,0.76512957],"study_design_scores_gemma":[0.00052034965,0.00016616099,0.0010939264,0.000020423277,0.000024622264,0.000027953178,0.000118634896,0.99109083,0.0005038751,0.000024924999,0.0061359014,0.00027239684],"about_ca_topic_score_codex":0.000008917066,"about_ca_topic_score_gemma":0.0000028025306,"teacher_disagreement_score":0.9497624,"about_ca_system_score_codex":0.000012980416,"about_ca_system_score_gemma":0.000043247084,"threshold_uncertainty_score":0.36065438},"labels":[],"label_agreement":null},{"id":"W2098543742","doi":"10.1109/icbn.2005.1589602","title":"Modeling and stability analysis of fair rate calculation in resilient packet rings","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Network packet; Node (physics); Computer network; Convergence (economics); Ring network; Reuse; Bandwidth (computing); Rate of convergence; Real-time computing; Channel (broadcasting); Network topology","score_opus":0.014300317119713435,"score_gpt":0.23690524857825906,"score_spread":0.22260493145854562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098543742","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5163678,0.000034283992,0.48301739,0.00037055076,0.000007636314,0.00003749016,2.6652538e-7,0.000019589863,0.00014501894],"genre_scores_gemma":[0.9940203,0.0000066674306,0.0058584176,0.000077130804,0.000008783143,0.0000030696935,9.4587347e-7,0.0000012136773,0.00002351592],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993011,0.000060568935,0.00022408253,0.0002138074,0.000098353434,0.00010214154],"domain_scores_gemma":[0.9996176,0.000058174523,0.000032509743,0.00020343762,0.000052024494,0.000036277885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047824933,0.000053024756,0.00014397172,0.00012765396,0.000020966521,0.000023228164,0.00010709888,0.000025686679,0.000011981967],"category_scores_gemma":[0.000016108583,0.000046323683,0.000036825833,0.00054649095,0.000014962965,0.00020782268,0.000043454693,0.000042266824,0.0000010045717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008655364,0.000029116907,0.012165467,0.0000024176265,0.00003024846,3.0320638e-7,0.00036280492,0.87319505,0.00013368232,0.011079618,0.0000064678347,0.10298618],"study_design_scores_gemma":[0.00017980822,0.000008003593,0.019342141,0.0000029147345,0.00002203897,9.520898e-8,0.000018584138,0.980108,0.00010473587,0.00015199775,0.0000129866685,0.000048678656],"about_ca_topic_score_codex":0.000089001165,"about_ca_topic_score_gemma":0.0008471423,"teacher_disagreement_score":0.47765246,"about_ca_system_score_codex":0.000024268753,"about_ca_system_score_gemma":0.000015844555,"threshold_uncertainty_score":0.1889025},"labels":[],"label_agreement":null},{"id":"W2098734823","doi":"10.1109/icc.1994.368951","title":"End-to-end performance in ATM networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Government of Canada","keywords":"Computer science; Traverse; Node (physics); Markov chain; Smoothing; Markov process; Computation; Characterization (materials science); Computer network; Markov model; End-to-end principle; Algorithm; Mathematics; Machine learning; Engineering","score_opus":0.012104190271757338,"score_gpt":0.192711366062614,"score_spread":0.18060717579085667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098734823","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037144918,0.00041927063,0.89304787,0.0042694584,0.0006650791,0.00021639778,1.8950692e-7,0.0003342946,0.06390252],"genre_scores_gemma":[0.98837113,0.00006561976,0.0049404665,0.001922568,0.00013992019,0.000020313835,2.7489932e-7,0.0000047352855,0.004534973],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990432,0.000029495932,0.00016955184,0.0002753595,0.00015253309,0.00032984125],"domain_scores_gemma":[0.9994493,0.00006322024,0.000022931252,0.00033346767,0.000020869613,0.000110182984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016171334,0.000100383695,0.000115482115,0.000069099675,0.000057263238,0.00007842951,0.00052606745,0.000046276906,0.00048623767],"category_scores_gemma":[0.0000056366634,0.00008840151,0.000029483737,0.0004925772,0.000016024229,0.00027018125,0.00009289943,0.00013372359,0.0004901048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022256327,0.000029527748,0.0031063878,0.0000010361048,0.0000030090318,0.000008568745,0.00010901048,0.040973116,0.0000015270017,0.017047534,0.0042850506,0.934433],"study_design_scores_gemma":[0.00026487073,0.000047908252,0.008059836,0.000010103171,9.858263e-7,0.0000063197485,0.0000034077802,0.9660811,0.0000057660013,0.000025436375,0.025372095,0.00012218402],"about_ca_topic_score_codex":0.0000073236806,"about_ca_topic_score_gemma":0.000044532157,"teacher_disagreement_score":0.95122623,"about_ca_system_score_codex":0.000024810797,"about_ca_system_score_gemma":0.000007447304,"threshold_uncertainty_score":0.6299469},"labels":[],"label_agreement":null},{"id":"W2098897435","doi":"10.1109/glocom.2004.1378045","title":"Effective bandwidths under dynamic weighted round robin scheduling","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Scheduling (production processes); Bandwidth allocation; Quality of service; Bandwidth (computing); Dynamic bandwidth allocation; Markov process; Poisson process; Poisson distribution; Distributed computing; Sizing; Dynamic priority scheduling; Mathematical optimization; Real-time computing; Computer network; Mathematics","score_opus":0.004611646449268803,"score_gpt":0.22332235608567474,"score_spread":0.21871070963640593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098897435","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033333417,0.0003737004,0.9554419,0.0042103142,0.0003162175,0.00023443002,2.8904307e-7,0.00047084698,0.0056188786],"genre_scores_gemma":[0.94243515,0.000012002534,0.053800326,0.0013247927,0.00015320447,0.00002917645,0.0000014817997,0.000008925181,0.002234932],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887735,0.00007686226,0.00017478471,0.0003784244,0.00018245139,0.00031012672],"domain_scores_gemma":[0.9992337,0.00019931256,0.000047373225,0.00034744354,0.000066385306,0.00010576217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020758195,0.0001516927,0.00015623047,0.00007308804,0.00013930093,0.00017776657,0.00045631803,0.00007426548,0.00009256922],"category_scores_gemma":[0.0000075635016,0.00012750766,0.000071976916,0.00029196325,0.000030358678,0.00049442955,0.00008738762,0.0001621819,0.00041238696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008027103,0.00005572044,0.000035499223,0.0000020415546,0.000037338883,0.0000036600557,0.00007438124,0.02460271,0.00020885258,0.17040323,0.00027618455,0.8042924],"study_design_scores_gemma":[0.0007311835,0.000044228243,0.0006583653,0.000012681168,0.000008482404,0.000011816406,0.000012890347,0.9924353,0.00017686757,0.0022053355,0.0035129962,0.00018986483],"about_ca_topic_score_codex":0.000007347597,"about_ca_topic_score_gemma":0.00006267129,"teacher_disagreement_score":0.96783257,"about_ca_system_score_codex":0.00010678556,"about_ca_system_score_gemma":0.00004972093,"threshold_uncertainty_score":0.53005373},"labels":[],"label_agreement":null},{"id":"W2099116406","doi":"10.1109/icc.2006.254877","title":"Equal Opportunity Fairness in Resilient Packet Rings","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Stateful firewall; Computer science; Bandwidth (computing); Network packet; Reuse; Fairness measure; Bandwidth allocation; Degradation (telecommunications); Computer network; Throughput; Scheme (mathematics); Ring (chemistry); Distributed computing; Mathematics; Telecommunications; Wireless; Engineering","score_opus":0.09110053322300368,"score_gpt":0.32663139765940646,"score_spread":0.23553086443640278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099116406","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029186709,0.00014553305,0.41224203,0.05061741,0.001503713,0.0005472029,0.00007780866,0.0005017056,0.5051779],"genre_scores_gemma":[0.9938082,0.00008596228,0.0033705924,0.00061549176,0.00009449226,0.00009934464,0.0000631476,0.000008639072,0.0018541088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983745,0.00019341489,0.00044743076,0.0003321076,0.00039921285,0.00025333485],"domain_scores_gemma":[0.9977739,0.00025059326,0.00016863587,0.0013909001,0.00031990814,0.000096091186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038199325,0.00016765934,0.00016414214,0.00023930908,0.00016429425,0.00022480522,0.0031639205,0.00007921122,0.00012518057],"category_scores_gemma":[0.000051144296,0.00017552059,0.0000652604,0.00030422505,0.00013237877,0.00038543195,0.00028775522,0.00037232297,0.00016677262],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010969151,0.0003106653,0.0010091878,0.0000012685634,0.000009404291,0.0000060120688,0.000069474976,0.0009770874,0.00013827751,0.9621553,0.0038586117,0.03145374],"study_design_scores_gemma":[0.0014985014,0.00010079183,0.016244782,0.00016360127,0.00000905184,0.000018331548,0.0001473698,0.8554545,0.0002602595,0.08866924,0.03683226,0.0006013128],"about_ca_topic_score_codex":0.00044170028,"about_ca_topic_score_gemma":0.0012366894,"teacher_disagreement_score":0.9646215,"about_ca_system_score_codex":0.00013859608,"about_ca_system_score_gemma":0.0002218975,"threshold_uncertainty_score":0.7157522},"labels":[],"label_agreement":null},{"id":"W2099129480","doi":"10.1109/glocom.2001.966226","title":"An intelligent VOP discard algorithm (IVDA) for transmission of multi-layered MPEG-4 video over explicit rate networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Transmission (telecommunications); Computer network; Layer (electronics); ENCODE; Algorithm; Bandwidth (computing); Encoding (memory); Transmission rate; Network architecture; Distributed computing; Real-time computing; Artificial intelligence","score_opus":0.026371338967054153,"score_gpt":0.257445091278945,"score_spread":0.23107375231189084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099129480","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008489651,0.0006543786,0.9963884,0.0007968895,0.0003952309,0.000534603,0.0000043311265,0.00022155911,0.00015564945],"genre_scores_gemma":[0.8691552,0.00021117287,0.12856291,0.00046780866,0.00020685601,0.0000847935,0.000006313305,0.000021257476,0.0012836541],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982536,0.000114409784,0.00045434388,0.0005352844,0.0002254036,0.00041700242],"domain_scores_gemma":[0.9987465,0.00020108695,0.00012273018,0.00057747035,0.00011199331,0.00024020305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034951142,0.00023343603,0.00032525315,0.00007559233,0.00012404217,0.0001029048,0.00073814724,0.00012795572,0.0001390124],"category_scores_gemma":[0.000008005417,0.00018821072,0.00019848206,0.00025501396,0.00003532963,0.0004293754,0.00005001137,0.00013292956,0.000012768737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002059123,0.00022089318,0.000026122205,0.0000072203793,0.000032240725,0.0000025980373,0.0002885061,0.032753617,0.000281233,0.0068378462,0.0016084352,0.9579207],"study_design_scores_gemma":[0.0011661277,0.00024549317,0.00013523664,0.000030668278,0.00001727458,0.0000026021748,0.000035158115,0.9908542,0.000907654,0.00022772467,0.0061288113,0.00024906514],"about_ca_topic_score_codex":0.000013027745,"about_ca_topic_score_gemma":0.000007920915,"teacher_disagreement_score":0.95810056,"about_ca_system_score_codex":0.000024045708,"about_ca_system_score_gemma":0.000015039663,"threshold_uncertainty_score":0.76750106},"labels":[],"label_agreement":null},{"id":"W2099389817","doi":"","title":"BGP ROUTE FLAP DAMPING ALGORITHMS","year":2006,"lang":"en","type":"dissertation","venue":"Summit (Simon Fraser University)","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Simon Fraser University","keywords":"Computer science; Algorithm; Stability (learning theory); Routing (electronic design automation); Computer network; Machine learning","score_opus":0.008611446838414477,"score_gpt":0.20301044659962256,"score_spread":0.19439899976120809,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099389817","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07649877,0.0025300467,0.59296155,0.0012400601,0.014175364,0.0018908139,0.00011552782,0.005594843,0.304993],"genre_scores_gemma":[0.5537806,0.00039690497,0.011038145,0.00056409155,0.0015524821,0.000010135443,0.0017015552,0.0001961202,0.43075997],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99772424,0.000118267395,0.00027932797,0.00089130097,0.00045816303,0.0005287127],"domain_scores_gemma":[0.99845576,0.00010125913,0.00028588215,0.00073802605,0.00022833173,0.00019076517],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013489606,0.0004406998,0.0004369978,0.0005690681,0.00035151877,0.00022176113,0.0017662483,0.0004479884,0.000048132904],"category_scores_gemma":[0.000011087751,0.0005298586,0.00027509808,0.0010934697,0.000039920225,0.000676123,0.0001221301,0.00054878416,0.00024136358],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015004443,0.00025267858,0.014240981,0.00013305181,0.0003745795,0.0014963767,0.00010844245,0.0029878947,0.0000064948167,0.05427243,0.16276413,0.7632129],"study_design_scores_gemma":[0.0018392722,0.00010299117,0.0010714448,0.00026684866,0.00021920519,2.5694423e-8,0.0030251623,0.05494618,0.00024046809,0.00054047554,0.9363677,0.0013802347],"about_ca_topic_score_codex":0.00024559346,"about_ca_topic_score_gemma":0.035990413,"teacher_disagreement_score":0.77360356,"about_ca_system_score_codex":0.00021989143,"about_ca_system_score_gemma":0.00031401822,"threshold_uncertainty_score":0.99971527},"labels":[],"label_agreement":null},{"id":"W2099459351","doi":"10.1109/ccece.2003.1226076","title":"QoS constrained IP routing","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer network; Computer science; Reservation; Static routing; Routing protocol; Dynamic Source Routing; Routing (electronic design automation); Call blocking; Network packet; Quality of service; Distributed computing; Link-state routing protocol; Zone Routing Protocol; Blocking (statistics)","score_opus":0.008639837845944605,"score_gpt":0.2073866353511463,"score_spread":0.1987467975052017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099459351","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038379268,0.000027782942,0.9583081,0.004277087,0.000368984,0.00006782684,1.4028275e-7,0.0004173334,0.032694805],"genre_scores_gemma":[0.9661699,0.0000015243558,0.031758483,0.0013296185,0.00014764338,0.0000045945967,2.8360282e-7,0.0000025844838,0.0005853445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939805,0.000012666582,0.00011311712,0.00018009135,0.00010826983,0.00018781556],"domain_scores_gemma":[0.99963135,0.00003756783,0.000026307493,0.00020441384,0.000032180214,0.00006819167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000114233066,0.000066149005,0.00007320508,0.000022594659,0.000076199365,0.00008551662,0.0003208572,0.000028197304,0.00003971251],"category_scores_gemma":[0.000013325475,0.00005610993,0.000035617686,0.00014559657,0.000026905218,0.00016743815,0.000046428162,0.00006364498,0.00017270663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.081585e-7,0.000011680614,0.00003010367,4.2965019e-7,0.000004576205,0.000008732051,0.00006765606,0.0014215619,0.00004028879,0.741052,0.00021538734,0.2571469],"study_design_scores_gemma":[0.008973145,0.00034050416,0.0027291838,0.00010528548,0.000026327629,0.00027730849,0.0002873586,0.9052442,0.002356709,0.052694067,0.025660755,0.0013051796],"about_ca_topic_score_codex":0.000010545288,"about_ca_topic_score_gemma":0.000007819205,"teacher_disagreement_score":0.962332,"about_ca_system_score_codex":0.000017955928,"about_ca_system_score_gemma":0.000078695935,"threshold_uncertainty_score":0.22880965},"labels":[],"label_agreement":null},{"id":"W2099766752","doi":"10.1109/ccece.2005.1556918","title":"The adoption of dynamic weight mapping function in adaptive routing","year":2006,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Adaptive routing; Computer science; Dynamic Source Routing; Routing (electronic design automation); Routing protocol; Static routing; Link-state routing protocol; Stability (learning theory); Path vector protocol; Zone Routing Protocol; Enhanced Interior Gateway Routing Protocol; Function (biology); Wireless Routing Protocol; Distance-vector routing protocol; Distributed computing; Computer network; Machine learning","score_opus":0.0065013622939336935,"score_gpt":0.18385857668772612,"score_spread":0.17735721439379243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099766752","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0178998,0.00017854247,0.9757832,0.00050060794,0.00023731234,0.00008667276,9.897538e-8,0.00006479671,0.005248946],"genre_scores_gemma":[0.9951871,0.000008715929,0.0041542957,0.00003700732,0.000041680043,0.0000075266657,7.4603895e-7,0.0000021226065,0.0005607762],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938744,0.000046829144,0.00018901858,0.00013257547,0.000110636494,0.00013352245],"domain_scores_gemma":[0.9996149,0.00011302655,0.00007442767,0.0001446151,0.0000424856,0.000010550231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026910342,0.00005301264,0.000063925814,0.000042643285,0.00007986001,0.000032120115,0.00017734065,0.000027265954,0.0000025936763],"category_scores_gemma":[0.000004591515,0.00003720192,0.000028192511,0.0002708416,0.000019837376,0.00015756882,0.00003270129,0.00006734259,0.000009932124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009839618,0.000015946678,0.00059488456,9.251703e-7,0.0000040490004,7.0982327e-7,0.00003928073,0.004151556,0.000112242364,0.43069386,0.000104900464,0.5642718],"study_design_scores_gemma":[0.00022076204,0.000024617862,0.037507426,0.00001465317,0.0000016799556,0.000001085324,0.00006797392,0.9579168,0.0000100317975,0.0036568062,0.0005283306,0.000049834674],"about_ca_topic_score_codex":0.00005098572,"about_ca_topic_score_gemma":0.00022314154,"teacher_disagreement_score":0.97728735,"about_ca_system_score_codex":0.00003359249,"about_ca_system_score_gemma":0.000020860738,"threshold_uncertainty_score":0.15170503},"labels":[],"label_agreement":null},{"id":"W2099819123","doi":"10.1109/ccece.2002.1012950","title":"Profile-based mobile MPLS protocol","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer network; Computer science; Triangular routing; Network packet; Multiprotocol Label Switching; Mobile computing; Mobile station; Mobile identification number; Routing protocol; Mobile Web; Mobile technology; Wireless Routing Protocol; Base station; Quality of service","score_opus":0.009577706998498539,"score_gpt":0.24876792974999112,"score_spread":0.2391902227514926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099819123","genre_codex":"methods","genre_gemma":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011077147,0.0000053620183,0.8910249,0.00023990149,0.00012109018,0.0428019,2.5248232e-7,0.0004191911,0.06527663],"genre_scores_gemma":[0.43619874,1.3044222e-7,0.10865939,0.002034219,0.00007475947,0.44495484,7.3102507e-7,0.000012583394,0.00806461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991212,0.0000784828,0.00014543832,0.0002616094,0.00016674992,0.00022654748],"domain_scores_gemma":[0.9993574,0.000057971403,0.000038906375,0.00039615665,0.000062753184,0.00008679231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020226327,0.000096721065,0.0000930071,0.000035134537,0.00007451683,0.0000965751,0.00035450986,0.000039297407,0.0004980108],"category_scores_gemma":[0.000014359443,0.00007563968,0.000046755453,0.00023209435,0.000020505575,0.0001503694,0.000019001354,0.00007054223,0.00034940685],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010796108,0.00018452022,0.00030990044,0.000013959529,0.000008638264,0.000010542939,0.00003092393,0.0022573255,0.00012834687,0.5155961,0.013868267,0.4675807],"study_design_scores_gemma":[0.0020576154,0.00026134856,0.00007797174,0.000013367727,0.0000029263185,0.000007956239,0.000008521555,0.35891485,0.0054857163,0.0012510635,0.6316222,0.00029646105],"about_ca_topic_score_codex":0.0000014682947,"about_ca_topic_score_gemma":0.0000015623523,"teacher_disagreement_score":0.7823655,"about_ca_system_score_codex":0.000015191905,"about_ca_system_score_gemma":0.0001493938,"threshold_uncertainty_score":0.5452869},"labels":[],"label_agreement":null},{"id":"W2099890714","doi":"10.1109/tnet.2005.861253","title":"An estimator of regulator parameters in a stochastic setting","year":2005,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Institut National de la Recherche Scientifique; University of Toronto","funders":"","keywords":"Burstiness; Computer science; Estimator; Queue; Queueing theory; Provisioning; Mathematical optimization; Algorithm; Computer network; Statistics; Network packet; Mathematics","score_opus":0.014701930863112578,"score_gpt":0.2514101569266887,"score_spread":0.23670822606357614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099890714","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06746405,0.00011788029,0.9304783,0.0006826418,0.0007655247,0.00022835442,0.000001892616,0.00021483818,0.00004655263],"genre_scores_gemma":[0.9103473,0.0000069163643,0.08913479,0.00022144573,0.00020336275,0.00004340737,7.8835063e-7,0.000018738438,0.000023300196],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982233,0.0001281278,0.0004659189,0.00046291464,0.00028416322,0.00043554805],"domain_scores_gemma":[0.9984531,0.00039693445,0.00014833447,0.0008130768,0.000047631253,0.00014092927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000406136,0.00020661257,0.00027604634,0.00023507109,0.00016396286,0.00007990675,0.00077891577,0.00010525495,0.000009387421],"category_scores_gemma":[0.000009579059,0.00021965224,0.00010587413,0.0006320121,0.00005602999,0.0004403405,0.000005813687,0.0003213756,0.000012991833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017024071,0.000078988276,0.000022163022,0.0000024757474,0.00001148255,0.0000025160145,0.00017428459,0.5716693,0.000073309464,0.0002651749,0.000015854375,0.42766747],"study_design_scores_gemma":[0.00064803194,0.00011534335,0.00016310274,0.00017014603,0.000017792247,0.000014969198,0.00002995672,0.99763095,0.00035122645,0.0004233449,0.00021100974,0.00022410047],"about_ca_topic_score_codex":0.000014237336,"about_ca_topic_score_gemma":0.00009706567,"teacher_disagreement_score":0.8428832,"about_ca_system_score_codex":0.00008663977,"about_ca_system_score_gemma":0.000077241006,"threshold_uncertainty_score":0.89571583},"labels":[],"label_agreement":null},{"id":"W2100032228","doi":"10.1109/glocom.1997.638495","title":"Throughput and delay performance of transport user in congestion controlled hybrid ATM/TDMA networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Concordia University; Sonaca (Canada)","funders":"","keywords":"Computer network; Asynchronous Transfer Mode; Computer science; Throughput; Quality of service; Queueing theory; Packet loss; Network congestion; Network packet; Automatic repeat request; Goodput; Flow control (data); Real-time computing; Hybrid automatic repeat request; Wireless; Telecommunications","score_opus":0.008837167257077217,"score_gpt":0.18696241151928358,"score_spread":0.17812524426220636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100032228","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6670872,0.0012397706,0.3273748,0.0007522301,0.00024496327,0.00041212095,7.4150324e-7,0.00011750636,0.002770687],"genre_scores_gemma":[0.9961112,0.00067166844,0.0019983745,0.0003204144,0.00005583765,0.00003215412,0.0000013219515,0.000007384203,0.00080164406],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987322,0.000061353225,0.0004268982,0.00032347857,0.00017385616,0.00028221615],"domain_scores_gemma":[0.9993196,0.00015224285,0.00010651678,0.00027968647,0.000064300744,0.000077616845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031212647,0.00016144846,0.00039254094,0.000071759925,0.0000547906,0.000029121857,0.000284081,0.00006952396,0.000079150544],"category_scores_gemma":[0.000008237915,0.00013439148,0.000062166124,0.0002321612,0.00008192979,0.00044024904,0.000028378156,0.00015545185,0.000008577418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045770625,0.00035213455,0.08375132,0.000038227823,0.00011018207,0.000080207414,0.0005040178,0.14227249,0.000038852173,0.048423503,0.0014445046,0.72252685],"study_design_scores_gemma":[0.004665756,0.0001459252,0.0133383535,0.00003500389,0.000014300337,0.000028285274,0.0000056588174,0.9809978,0.00002235175,0.000038517534,0.0005516572,0.00015639806],"about_ca_topic_score_codex":0.00001808708,"about_ca_topic_score_gemma":0.000043505857,"teacher_disagreement_score":0.8387253,"about_ca_system_score_codex":0.00001658518,"about_ca_system_score_gemma":0.000013393983,"threshold_uncertainty_score":0.5480325},"labels":[],"label_agreement":null},{"id":"W2100137399","doi":"10.1109/icc.1991.162361","title":"PDF based congestion control in ATM networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Network congestion; Computer science; Computer network; Bandwidth (computing); Service (business); Probability density function; Network traffic control; Carry (investment); Mathematics; Statistics","score_opus":0.00860308999559746,"score_gpt":0.17886339492034295,"score_spread":0.17026030492474548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100137399","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008905483,0.00032094083,0.9785735,0.0052196025,0.00038779117,0.00020983882,2.3079906e-7,0.00025830654,0.014139252],"genre_scores_gemma":[0.99052906,0.000015942136,0.0028090246,0.0043922593,0.00011475099,0.00003795002,9.008848e-7,0.000005684344,0.0020944464],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988323,0.00011329749,0.00023508785,0.00031861695,0.00016886638,0.0003318727],"domain_scores_gemma":[0.999212,0.00024451228,0.000051933555,0.00034445844,0.00004402258,0.00010305363],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002497218,0.00013129688,0.0001732947,0.000080896236,0.00005724146,0.00010314815,0.00041192447,0.00009117616,0.00092512835],"category_scores_gemma":[0.000020954792,0.000119448465,0.000055542892,0.00037054427,0.000030766205,0.0002539823,0.000022956696,0.00016739778,0.000600126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016846961,0.00015431209,0.004724169,0.0000026198968,0.000012243237,0.000047291673,0.000033313354,0.26688352,0.000011779927,0.04845396,0.014527479,0.66513246],"study_design_scores_gemma":[0.001896852,0.00005039583,0.0026511676,0.000012508287,0.000003755809,0.000003844271,0.0000020747482,0.9883952,0.0000024390267,0.000121384706,0.0067134523,0.00014694106],"about_ca_topic_score_codex":0.000012022931,"about_ca_topic_score_gemma":0.000051679006,"teacher_disagreement_score":0.9896385,"about_ca_system_score_codex":0.000035943878,"about_ca_system_score_gemma":0.000013344747,"threshold_uncertainty_score":0.99998814},"labels":[],"label_agreement":null},{"id":"W2100841561","doi":"","title":"User-managed QoS: Model and validation","year":2008,"lang":"en","type":"article","venue":"International Symposium on Performance Evaluation of Computer and Telecommunication Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Computer science; Quality of service; Scalability; Architecture; Telephony; Computer network; Service (business); Quality (philosophy); Simple (philosophy); Distributed computing; Control (management); Database; Artificial intelligence","score_opus":0.03407377631545057,"score_gpt":0.2706748139392645,"score_spread":0.23660103762381396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100841561","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7700646,0.00026971943,0.22444132,0.0012494845,0.00071628345,0.00044436954,0.0000030707038,0.00009568016,0.0027154658],"genre_scores_gemma":[0.9939357,0.00095431285,0.004575649,0.00013931183,0.00014252699,0.000082092025,0.00002527661,0.000008177583,0.00013694966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980935,0.00024107588,0.00047692104,0.00029192204,0.00077525305,0.00012135943],"domain_scores_gemma":[0.9982772,0.0001522606,0.00029586293,0.00051740295,0.0006964308,0.000060870527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012238654,0.00014625564,0.00018904357,0.0001603799,0.00022588874,0.00011057593,0.00062570727,0.00006509268,0.0000040806663],"category_scores_gemma":[0.000014367941,0.00014142781,0.000034965276,0.00014646398,0.00007226046,0.00074577646,0.00016767977,0.00010928775,0.000007965491],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042118594,0.000138138,0.0041611055,0.000023850953,0.00009571246,3.5962654e-7,0.0010434804,0.7688563,0.00022742563,0.04440659,0.00080998545,0.18019496],"study_design_scores_gemma":[0.0009559778,0.00009739779,0.011646045,0.00006294074,0.000014709386,0.000036268448,0.000009587763,0.9855325,0.00017319105,0.00006394851,0.0012713544,0.00013605975],"about_ca_topic_score_codex":0.0000100408015,"about_ca_topic_score_gemma":0.000001530858,"teacher_disagreement_score":0.2238711,"about_ca_system_score_codex":0.00006599601,"about_ca_system_score_gemma":0.00006680366,"threshold_uncertainty_score":0.5767259},"labels":[],"label_agreement":null},{"id":"W2100876404","doi":"10.1109/glocom.2010.5684172","title":"A Model for Steady State Throughput of TCP CUBIC","year":2010,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Vedecká Grantová Agentúra MŠVVaŠ SR a SAV","keywords":"CUBIC TCP; Throughput; Computer science; TCP acceleration; TCP global synchronization; Transmission Control Protocol; TCP Friendly Rate Control; Packet loss; Algorithm; Computer network; Network packet; Wireless; Telecommunications","score_opus":0.021245051726144482,"score_gpt":0.25179125443712885,"score_spread":0.23054620271098436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100876404","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021313777,0.000017266522,0.9745178,0.0007851467,0.00030038576,0.00018744846,0.0000033239137,0.0001166699,0.0027581716],"genre_scores_gemma":[0.88113296,0.0000029700193,0.113998756,0.00032481377,0.000037708985,0.000024677074,6.015424e-7,0.0000046094488,0.0044729095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993405,0.000008824727,0.00016477052,0.0001946455,0.00011598545,0.00017531577],"domain_scores_gemma":[0.9993359,0.00009199127,0.00005802086,0.00034815512,0.00011100747,0.000054960536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017007114,0.00007334002,0.00012173376,0.000028071221,0.00004034722,0.000033359283,0.00044507475,0.00003476467,0.000015495538],"category_scores_gemma":[0.000012266223,0.000059202925,0.00005905359,0.000088849854,0.000030718125,0.00019387958,0.000054774908,0.00008110747,0.000012992212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013627056,0.000061180275,0.000037632944,0.00000866527,0.000017071887,5.0408613e-7,0.00046020132,0.01259502,0.0019618992,0.5704709,0.004405485,0.40996778],"study_design_scores_gemma":[0.00043166892,0.000036863323,0.000021104315,0.0000022845518,0.000003418263,0.0000012692924,0.0000048653123,0.983376,0.00035731416,0.013825102,0.0018648184,0.00007524123],"about_ca_topic_score_codex":0.000006248515,"about_ca_topic_score_gemma":0.0000834506,"teacher_disagreement_score":0.970781,"about_ca_system_score_codex":0.000003372755,"about_ca_system_score_gemma":0.00007823408,"threshold_uncertainty_score":0.24142252},"labels":[],"label_agreement":null},{"id":"W2101032756","doi":"10.1007/978-0-387-35579-5_2","title":"Buffer and Bandwidth Allocation for Diffserv Classes","year":2000,"lang":"en","type":"book-chapter","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Buffer (optical fiber); Computer network; Bandwidth (computing); Network packet; Bandwidth allocation; Dynamic bandwidth allocation; Differentiated services; Class (philosophy); The Internet; Telecommunications; Artificial intelligence; Operating system","score_opus":0.01269619539833571,"score_gpt":0.2067618535247189,"score_spread":0.19406565812638318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101032756","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010892562,0.0010857211,0.529365,0.002308553,0.00029871147,0.00045012642,0.0000052343667,0.00024313519,0.46623263],"genre_scores_gemma":[0.017876292,0.0010700689,0.009251178,0.0017703682,0.00047099413,0.00006067013,0.000028830536,0.000030726507,0.9694409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990806,0.00000706979,0.0001946804,0.00041827437,0.00014053225,0.00015885566],"domain_scores_gemma":[0.99929637,0.00015417785,0.00006870435,0.00032575522,0.00007370185,0.0000813015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007847062,0.00020747127,0.00021958273,0.000061642524,0.000097598,0.00013845798,0.00030026326,0.0001928809,0.00018480567],"category_scores_gemma":[0.0000033075878,0.00017654846,0.00007606833,0.000015642487,0.000038360067,0.00014924775,0.00004503252,0.0001060028,0.000049789458],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005540253,0.0000035568287,8.144564e-7,0.000005894567,0.000015832204,6.4340276e-7,0.000009135078,0.000010548615,7.0262104e-7,0.5431824,0.005528915,0.45123607],"study_design_scores_gemma":[0.0004986992,0.00009711764,0.000034222092,0.000053435568,0.00003601439,0.000008949899,0.0000011269184,0.058233164,0.0000036498056,0.09420622,0.8465042,0.00032318413],"about_ca_topic_score_codex":0.0000026316511,"about_ca_topic_score_gemma":0.00002653184,"teacher_disagreement_score":0.8409753,"about_ca_system_score_codex":0.000017041253,"about_ca_system_score_gemma":0.00005480472,"threshold_uncertainty_score":0.7199437},"labels":[],"label_agreement":null},{"id":"W2101113883","doi":"10.1109/jlt.2007.912057","title":"A Novel Congestion Detection Scheme in TCP Over OBS Networks","year":2009,"lang":"en","type":"article","venue":"Journal of Lightwave Technology","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; CUBIC TCP; Computer network; TCP Westwood plus; TCP Friendly Rate Control; Network congestion; Packet loss; TCP tuning; Throughput; H-TCP; Overhead (engineering); Network packet; Bandwidth (computing); TCP global synchronization; Real-time computing; Telecommunications","score_opus":0.0065691532666554775,"score_gpt":0.2219157603206292,"score_spread":0.21534660705397374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101113883","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11176881,0.00079956785,0.8784214,0.0077924463,0.00070437964,0.00010411624,1.4518191e-7,0.00014984881,0.00025927814],"genre_scores_gemma":[0.98339444,0.00008567904,0.015690124,0.00056328764,0.00021647355,0.0000026759608,1.3021746e-7,0.0000054006996,0.000041761465],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872196,0.00003551017,0.00054072886,0.00020322127,0.00020685222,0.00029174838],"domain_scores_gemma":[0.99898183,0.00006693621,0.00042121398,0.00027264538,0.00018869758,0.00006864979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041330582,0.00014145537,0.00029938712,0.00066901755,0.00005202124,0.000050175986,0.0005860873,0.00031295803,0.000007397031],"category_scores_gemma":[0.000090443864,0.00012476214,0.00008619364,0.0009802463,0.000048492337,0.00038585448,0.000047673035,0.00066293153,0.0000057573834],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006567641,0.00019916827,0.00088272087,0.00000179081,0.000027434508,0.00012428392,0.000040927443,0.0022980755,0.020111261,0.07003933,0.00030272052,0.9059066],"study_design_scores_gemma":[0.0077227503,0.0030956808,0.06559914,0.00033912668,0.000050472925,0.0027882787,0.000056484805,0.86202955,0.007436655,0.038162284,0.011933914,0.0007856725],"about_ca_topic_score_codex":0.0000016864113,"about_ca_topic_score_gemma":0.00002000049,"teacher_disagreement_score":0.90512097,"about_ca_system_score_codex":0.0001089906,"about_ca_system_score_gemma":0.00006241894,"threshold_uncertainty_score":0.5087653},"labels":[],"label_agreement":null},{"id":"W2101381179","doi":"10.1109/glocom.1997.644577","title":"A flexible virtual path topology design algorithm","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Network topology; Overlay; Overlay network; Distributed computing; Computer network; Bandwidth (computing); Path (computing); Routing (electronic design automation); Topology (electrical circuits); Logical topology; Algorithm design; Algorithm; Engineering; The Internet","score_opus":0.024871421654888325,"score_gpt":0.21599429598007533,"score_spread":0.19112287432518701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101381179","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000045178094,0.00021891376,0.9859452,0.002177742,0.00044321502,0.000096473355,2.9901852e-7,0.00047153689,0.010601437],"genre_scores_gemma":[0.43743926,0.00007523457,0.5114763,0.0043876837,0.0003486175,0.000044481727,6.004693e-7,0.000011361966,0.046216447],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991054,0.00008288813,0.00013384043,0.00027244308,0.00013303928,0.00027239462],"domain_scores_gemma":[0.9993976,0.00012892096,0.000028599834,0.00031366295,0.00003761104,0.00009359988],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00014830951,0.00009699851,0.00011619918,0.000045984132,0.00009080953,0.00007161061,0.00048425165,0.000057937064,0.000679522],"category_scores_gemma":[0.000009754139,0.000081831975,0.000041164487,0.00020611119,0.00003782326,0.00019475825,0.00007205548,0.00008749798,0.0008109891],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.1106705e-7,0.000032590437,0.0000032480245,1.988344e-7,0.0000064961005,0.00001334823,0.00007618365,0.00041174644,0.000010187708,0.1289289,0.0207202,0.849796],"study_design_scores_gemma":[0.00035452153,0.0001911155,0.000020088492,0.0000019920321,0.0000027286142,0.00003094237,0.000012399203,0.98120475,0.00009820574,0.001608536,0.016352657,0.00012206986],"about_ca_topic_score_codex":0.0000053607155,"about_ca_topic_score_gemma":6.510132e-7,"teacher_disagreement_score":0.980793,"about_ca_system_score_codex":0.000014349741,"about_ca_system_score_gemma":0.000017450771,"threshold_uncertainty_score":0.999967},"labels":[],"label_agreement":null},{"id":"W2101530891","doi":"10.1109/icdsn.2000.857595","title":"Dynamic-distributed differentiated service for multimedia applications","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer network; Computer science; Differentiated services; Quality of service; Integrated services; Network packet; Differentiated service; Service (business); Provisioning; Router; Subnet; The Internet; Service provider; Service design; World Wide Web","score_opus":0.013756409580175688,"score_gpt":0.22083248938861177,"score_spread":0.2070760798084361,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101530891","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040418512,0.000103282,0.9933405,0.0044487794,0.00012126993,0.0004965355,0.000022993841,0.0005174328,0.0005450275],"genre_scores_gemma":[0.9180406,0.000015704807,0.077819325,0.0012804208,0.00005768355,0.0006376997,0.000096230484,0.0000100570705,0.0020423292],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992456,0.000015261627,0.00015427456,0.00026900007,0.00009735483,0.00021851182],"domain_scores_gemma":[0.9992146,0.0001340166,0.00004504592,0.00036158843,0.0001503043,0.000094463976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000045222972,0.000099183,0.00010494004,0.00003295768,0.00012149186,0.000079500736,0.0005151701,0.000051398813,0.00012545868],"category_scores_gemma":[0.0000074578415,0.000088177185,0.00004713228,0.00034869846,0.000011673817,0.0001272624,0.000050101917,0.000053974607,0.00022551292],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004306574,0.00021693185,0.000041406012,0.000013814977,0.000043597902,7.035278e-7,0.00010617843,0.00066764967,0.00020701163,0.03615303,0.010010747,0.9525346],"study_design_scores_gemma":[0.0006298196,0.000014101021,0.00027181994,0.0000025692989,0.000008797676,0.0000017281191,0.000005677623,0.97256714,0.00001897309,0.0004892684,0.025877463,0.00011263175],"about_ca_topic_score_codex":0.0000033078534,"about_ca_topic_score_gemma":0.000035739045,"teacher_disagreement_score":0.9718995,"about_ca_system_score_codex":0.000019096173,"about_ca_system_score_gemma":0.000008193493,"threshold_uncertainty_score":0.35957614},"labels":[],"label_agreement":null},{"id":"W2101644183","doi":"10.1109/ccnc.2006.1593081","title":"End-to-end loss discrimination for improved throughput performance in heterogeneous networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Throughput; End-to-end principle; Computer science; Computer network; Telecommunications; Wireless","score_opus":0.008450721101687703,"score_gpt":0.21833812901113842,"score_spread":0.2098874079094507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101644183","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04051881,0.00010862086,0.95544297,0.0016550438,0.00043447033,0.000490579,0.0000016279877,0.000154094,0.0011937787],"genre_scores_gemma":[0.98350596,0.000014103169,0.014470252,0.0007066635,0.00028316973,0.0001381651,0.000011095988,0.0000103202,0.00086028635],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879664,0.000025957217,0.00027168146,0.00039154818,0.00011515032,0.0003990187],"domain_scores_gemma":[0.9994268,0.00009370617,0.00005637857,0.00030250353,0.00006160699,0.000059050948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021115094,0.00014707982,0.00015924702,0.00007502912,0.000098444914,0.00012169669,0.00043406957,0.00006808021,0.000013628386],"category_scores_gemma":[0.0000058708906,0.00013040513,0.00005946511,0.00027253435,0.00002399037,0.00033538538,0.0000771162,0.000081940896,0.000012438064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037080757,0.00008564686,0.0008355109,0.0000092510445,0.0000070646365,0.0000039628044,0.00008039074,0.18261841,0.00006302697,0.040871084,0.00073874876,0.7746498],"study_design_scores_gemma":[0.00065055746,0.00012788635,0.0037465063,0.000012227779,0.000004316717,0.000008793346,0.0000039832667,0.9898018,0.00021539585,0.00055376324,0.004690247,0.00018448407],"about_ca_topic_score_codex":0.00004883015,"about_ca_topic_score_gemma":0.0005037072,"teacher_disagreement_score":0.94298714,"about_ca_system_score_codex":0.000056873938,"about_ca_system_score_gemma":0.000027671467,"threshold_uncertainty_score":0.53177667},"labels":[],"label_agreement":null},{"id":"W2101798758","doi":"10.1109/glocom.1997.638494","title":"Pipelined frames for ATM real-time traffic management","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Asynchronous Transfer Mode; Queueing theory; Computer network; Frame (networking); Real-time computing; Distributed computing; Admission control; Network congestion; Quality of service","score_opus":0.012148347457862316,"score_gpt":0.21115772058463464,"score_spread":0.19900937312677233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101798758","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025170995,0.0001291382,0.9409502,0.005025029,0.00033607258,0.00052205485,0.0000012650711,0.0009057867,0.049613353],"genre_scores_gemma":[0.6660884,0.00021131955,0.2191198,0.0016219445,0.0003170255,0.00017375119,0.0000037519644,0.000019250525,0.11244473],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902284,0.000021787157,0.00018630522,0.00033045045,0.00015519753,0.00028339046],"domain_scores_gemma":[0.99932945,0.000110810244,0.00003987618,0.00038977628,0.000044889584,0.00008519171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013480087,0.00011953503,0.00013678904,0.000050531708,0.00009747203,0.00010942006,0.0005154117,0.000046151203,0.00036320506],"category_scores_gemma":[0.00000543625,0.000102186794,0.00008865299,0.00017785009,0.00001796798,0.00015481195,0.000054637378,0.000042493673,0.0006039985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004313618,0.000059451682,0.0000016909117,0.000005719565,0.00002354215,0.000004985423,0.00006288337,0.0019215619,0.000008250103,0.07499197,0.101650365,0.8212653],"study_design_scores_gemma":[0.0006791496,0.00006400945,0.000028590644,0.000006975248,0.000011718345,0.0000024157562,0.000009520245,0.9452952,0.000008905377,0.00044155872,0.053309653,0.00014230012],"about_ca_topic_score_codex":0.0000010803458,"about_ca_topic_score_gemma":0.0000017606196,"teacher_disagreement_score":0.9433736,"about_ca_system_score_codex":0.000016686068,"about_ca_system_score_gemma":0.0000049253317,"threshold_uncertainty_score":0.776338},"labels":[],"label_agreement":null},{"id":"W2101901850","doi":"10.1109/glocom.2007.462","title":"A Novel False Congestion Detection Scheme for TCP over OBS Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; CUBIC TCP; Network congestion; TCP Friendly Rate Control; Computer network; TCP tuning; TCP Westwood plus; Bandwidth (computing); H-TCP; TCP acceleration; Throughput; Scheme (mathematics); Multiplicative function; TCP global synchronization; HSTCP; Network packet; Mathematics; Telecommunications; Wireless","score_opus":0.01400460349551946,"score_gpt":0.24346821815642564,"score_spread":0.22946361466090617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101901850","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046682605,0.00012883774,0.9917955,0.00047502594,0.0010855283,0.00037037642,8.1402635e-7,0.00043504237,0.0010406412],"genre_scores_gemma":[0.93554705,0.000007465632,0.061845332,0.0009939338,0.0004808131,0.000037774033,0.0000030976307,0.000011242543,0.0010732685],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879724,0.000014105535,0.00025835136,0.00036423875,0.00017380196,0.00039226486],"domain_scores_gemma":[0.9990873,0.00026185482,0.00008926996,0.000302841,0.0001309499,0.00012781634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006304092,0.00014368279,0.00013905224,0.00007886361,0.0001671843,0.00011984993,0.00030564854,0.00013623635,0.000017234719],"category_scores_gemma":[0.000046330606,0.0001330219,0.00009186328,0.00030676243,0.000027918371,0.0003448869,0.000051866442,0.0001290617,0.000017115806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006544988,0.00005741622,0.00012480226,0.0000034777072,0.00002119326,0.0000013123715,0.000024477395,0.002539086,0.002369553,0.086666614,0.001073335,0.9070533],"study_design_scores_gemma":[0.0013322062,0.00010589525,0.004458605,0.000011229191,0.000007895817,0.000015565967,0.000008914285,0.97146493,0.00045064173,0.00034326024,0.0215897,0.00021117009],"about_ca_topic_score_codex":0.000015163369,"about_ca_topic_score_gemma":0.00018413103,"teacher_disagreement_score":0.96892583,"about_ca_system_score_codex":0.000049661125,"about_ca_system_score_gemma":0.000024268184,"threshold_uncertainty_score":0.5424475},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01109782146976253,"score_gpt":0.22499016505556452,"score_spread":0.21389234358580198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101917791","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000112337795,0.0005837368,0.99471265,0.0005743423,0.002243794,0.00094348786,0.000014632284,0.0004067726,0.00040827267],"genre_scores_gemma":[0.92340165,0.000059012604,0.07262296,0.0026958396,0.0008214741,0.000081047976,0.000098215336,0.00006341509,0.00015639472],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99588615,0.000054425193,0.0007073222,0.0016709819,0.0007631298,0.0009180011],"domain_scores_gemma":[0.9972155,0.0008552771,0.00035441437,0.001036841,0.00028037588,0.00025760356],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00067431235,0.000692415,0.00073859654,0.00069590786,0.00043310912,0.00080984866,0.0028058467,0.00046671706,0.000065066844],"category_scores_gemma":[0.000015372654,0.0006477825,0.00031667293,0.00056563265,0.00036305617,0.00043702914,0.0002448118,0.0006605627,0.000021666481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015697162,0.000019105068,0.000002982769,0.000021962498,0.00002032914,0.000009483555,0.00006640273,0.519168,0.000002747018,0.0032488892,0.000020128398,0.47740424],"study_design_scores_gemma":[0.00069731136,0.00017217839,0.00001729197,0.00045727956,0.000037640293,0.0000114342165,1.6300271e-7,0.98115504,0.000055593897,0.013239256,0.0034628748,0.00069394085],"about_ca_topic_score_codex":0.0000053614385,"about_ca_topic_score_gemma":0.00006569536,"teacher_disagreement_score":0.9232893,"about_ca_system_score_codex":0.00023195599,"about_ca_system_score_gemma":0.0003469805,"threshold_uncertainty_score":0.9995974},"labels":[],"label_agreement":null},{"id":"W2102094420","doi":"10.1109/ccece.2003.1226095","title":"A novel genetic algorithm searching approach for dynamic constrained multicast routing","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Multicast; Computer science; Routing (electronic design automation); Tree (set theory); Path (computing); Convergence (economics); Quality of service; Algorithm; Protocol Independent Multicast; Encoding (memory); Scheme (mathematics); Genetic algorithm; Distance Vector Multicast Routing Protocol; Variation (astronomy); Distributed computing; Computer network; Xcast; Mathematical optimization; Mathematics","score_opus":0.014843472298729432,"score_gpt":0.24677108252890542,"score_spread":0.231927610230176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102094420","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00086464355,0.000035065288,0.996778,0.00057796435,0.00012329716,0.00045849846,0.0000045537913,0.0002931132,0.0008648521],"genre_scores_gemma":[0.4606756,8.5436113e-7,0.5389706,0.00017244268,0.00004536537,0.00003432538,0.0000025999002,0.0000063573325,0.000091858026],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987575,0.000018340279,0.00021656274,0.00041568046,0.00017624843,0.0004156752],"domain_scores_gemma":[0.99935466,0.00012631192,0.000049792434,0.0002716201,0.00007617228,0.0001214257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024952646,0.00013889508,0.00015274055,0.000057786117,0.00019180293,0.00017278848,0.00047843473,0.00005118586,0.00000373515],"category_scores_gemma":[0.000028842338,0.00012449369,0.000083764884,0.00018143097,0.00005872495,0.00014762727,0.00008952133,0.00012216023,0.0000080923855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002700842,0.00008902098,0.0000047543767,0.0000059053946,0.000020250938,0.0000026979153,0.00019884693,0.040985614,0.000343072,0.039851405,0.0000037896034,0.91849196],"study_design_scores_gemma":[0.0019574207,0.000053422653,0.00017598628,0.000010676718,0.0000071718437,0.00006526286,0.00008363542,0.9968781,0.000025947742,0.00054409105,0.000033247496,0.00016502103],"about_ca_topic_score_codex":0.000031035448,"about_ca_topic_score_gemma":0.000005790997,"teacher_disagreement_score":0.9558925,"about_ca_system_score_codex":0.00005246833,"about_ca_system_score_gemma":0.00013254727,"threshold_uncertainty_score":0.5076705},"labels":[],"label_agreement":null},{"id":"W2102098905","doi":"10.1109/glocom.1999.830054","title":"Optimal cost traffic shaping with self-similar input sources","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Queue; Minification; Traffic generation model; Traffic shaping; Queueing theory; Variance (accounting); Computer network; Traffic equations; Mathematical optimization; Self-similarity; Real-time computing; Network traffic control; Mathematics; Layered queueing network","score_opus":0.01369572659959136,"score_gpt":0.20907649260780586,"score_spread":0.1953807660082145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102098905","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09176128,0.00035375202,0.88783145,0.0011633644,0.00020503762,0.0003039915,3.738452e-7,0.0010627189,0.017318046],"genre_scores_gemma":[0.8937497,0.000016356153,0.104310945,0.0010715623,0.00006121937,0.000026763028,5.4282395e-7,0.000010935997,0.0007519647],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998762,0.00007558252,0.00016457676,0.00038483742,0.00024603834,0.00036695867],"domain_scores_gemma":[0.9993049,0.00008849978,0.000053917556,0.00034020504,0.000068071895,0.00014438643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023894396,0.00016760406,0.00016376353,0.000060522376,0.00017551627,0.00021873113,0.0004632048,0.00005502234,0.00008263848],"category_scores_gemma":[0.000009642727,0.00012705666,0.000046661135,0.00033557115,0.00003745221,0.00031432448,0.000034085373,0.00013767574,0.00008272475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003099739,0.0002884204,0.0009708671,0.000016364025,0.00016418633,0.000101476064,0.0017615018,0.37749252,0.000021808033,0.22754939,0.005215671,0.38638678],"study_design_scores_gemma":[0.0012523052,0.00017969501,0.00013762874,0.000022408742,0.00001989781,0.00009798053,0.00011626578,0.88281083,0.00011960072,0.000035339574,0.11481569,0.00039238445],"about_ca_topic_score_codex":0.0000014082297,"about_ca_topic_score_gemma":0.0000107634205,"teacher_disagreement_score":0.8019884,"about_ca_system_score_codex":0.000024586097,"about_ca_system_score_gemma":0.00011506104,"threshold_uncertainty_score":0.518122},"labels":[],"label_agreement":null},{"id":"W2102195563","doi":"10.1109/lcomm.2006.1665134","title":"A long-range dependent model for internet traffic with power transformation","year":2006,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Moncton","funders":"","keywords":"Internet traffic; Range (aeronautics); Marginal distribution; Computer science; Gaussian; Noise (video); TRACE (psycholinguistics); Gaussian network model; Gaussian noise; Transformation (genetics); Statistical physics; Autocorrelation; The Internet; Mathematics; Statistics; Algorithm; Physics; Artificial intelligence; Random variable; Engineering","score_opus":0.017565668647540292,"score_gpt":0.2300306056734196,"score_spread":0.21246493702587932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102195563","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043955985,0.00015785742,0.9360575,0.01857702,0.00009172227,0.00048453122,0.0000072847915,0.00023749143,0.00043061955],"genre_scores_gemma":[0.96101534,0.000012033413,0.036607303,0.0018011342,0.000028619832,0.0003029385,0.000025818652,0.000013742926,0.00019306845],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903566,0.000063668725,0.0002684207,0.00021584489,0.00017844255,0.00023795557],"domain_scores_gemma":[0.99849904,0.0001297121,0.00009407225,0.001140993,0.00008886449,0.000047299585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019071561,0.00014490206,0.0001349336,0.00009989732,0.00017846252,0.0001528567,0.0015347139,0.00004629575,0.0000025143813],"category_scores_gemma":[0.0000022599868,0.00013169125,0.00007692898,0.0001824771,0.00008446169,0.00048611857,0.000038940765,0.00014857059,0.000017373603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008986689,0.0004238265,0.00019158865,0.000024018824,0.00009266577,0.0000035826424,0.0034023358,0.7927873,0.0005453136,0.100878015,0.016271183,0.08529029],"study_design_scores_gemma":[0.00090567133,0.00003962359,0.00017062464,0.000021768345,0.00002029156,0.000012425215,0.000012194866,0.99692047,0.000036887544,0.00010860767,0.001570494,0.00018092722],"about_ca_topic_score_codex":0.000016940796,"about_ca_topic_score_gemma":0.00045740497,"teacher_disagreement_score":0.91705936,"about_ca_system_score_codex":0.00006206458,"about_ca_system_score_gemma":0.000041702046,"threshold_uncertainty_score":0.53702134},"labels":[],"label_agreement":null},{"id":"W2102442016","doi":"10.1109/icc.1994.368824","title":"A state-space reduction method for computing the cell loss probability in ATM networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Technical University of Nova Scotia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computation; Reduction (mathematics); Markov process; Computer science; Markov chain; State space; Fraction (chemistry); Stochastic process; Theoretical computer science; Algorithm; Mathematical optimization; Mathematics; Machine learning; Statistics","score_opus":0.01890912962468607,"score_gpt":0.24284443633675598,"score_spread":0.2239353067120699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102442016","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058009964,0.0002272821,0.9862248,0.00560826,0.00038223463,0.0006657741,3.0276095e-7,0.00016355325,0.00092679675],"genre_scores_gemma":[0.8119168,0.000013735973,0.18656896,0.00025190602,0.0001464553,0.000042024752,4.5313016e-7,0.000006191843,0.0010534365],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865186,0.00022986619,0.0002522224,0.00039553072,0.00012589325,0.0003446367],"domain_scores_gemma":[0.9989068,0.00048154456,0.00008870716,0.00039939475,0.000070213355,0.00005334556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010624798,0.00012076514,0.00015001278,0.000028632925,0.00015931462,0.00012235036,0.00046470942,0.0000522928,0.000014218859],"category_scores_gemma":[0.000022531956,0.00008461724,0.00006695796,0.0004011233,0.00003877277,0.00017130424,0.00008446345,0.00018021655,0.00000829093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000937252,0.00007402578,0.00012725643,0.000006848593,0.0000050565895,0.0000010595977,0.0006072325,0.47883338,0.000008492707,0.01457004,0.0025922018,0.503165],"study_design_scores_gemma":[0.00047054238,0.000046368696,0.0001585069,0.0000073252318,0.0000035435187,0.0000075823095,0.000033241777,0.9940723,0.000049360748,0.0028072211,0.0022341488,0.00010984613],"about_ca_topic_score_codex":0.0000331586,"about_ca_topic_score_gemma":0.000036733072,"teacher_disagreement_score":0.80611587,"about_ca_system_score_codex":0.000050390816,"about_ca_system_score_gemma":0.000015683754,"threshold_uncertainty_score":0.34505907},"labels":[],"label_agreement":null},{"id":"W2102449606","doi":"10.1109/glocom.1994.513581","title":"An experimental study of video traffic on an Ethernet local area network","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Computer network; Carrier Ethernet; Ethernet over SDH; Uncompressed video; Synchronous Ethernet; Metro Ethernet; Local area network; ATA over Ethernet; Ethernet flow control; Integrated Services Digital Network; Bottleneck; Video quality; Ethernet; Ethernet over PDH; Real-time computing; Video processing; Embedded system; Video tracking; Computer hardware; Engineering","score_opus":0.024731644328201696,"score_gpt":0.25104138816417293,"score_spread":0.22630974383597124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102449606","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9187821,0.00015094511,0.07818701,0.00010625667,0.0002793771,0.0002990157,4.3877546e-7,0.00030890515,0.0018859183],"genre_scores_gemma":[0.99801654,0.0000021764658,0.0011170482,0.0004358697,0.00017546595,0.000024430838,0.0000011260857,0.000010808999,0.00021653753],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984935,0.00019964881,0.00025382233,0.00044620346,0.0003233876,0.00028346555],"domain_scores_gemma":[0.9989855,0.00006867115,0.00006664222,0.00067436905,0.000035624016,0.00016914385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020180318,0.00016509676,0.00020749513,0.000042998145,0.000093634015,0.00007428582,0.0007220611,0.00005847928,0.00034666722],"category_scores_gemma":[0.0000016949426,0.00013816566,0.00004331694,0.00024208258,0.00004698908,0.00030388148,0.00004068907,0.00011898718,0.00006209606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004831866,0.0058491426,0.00019032884,9.63629e-7,0.000029694247,0.000016721518,0.0037987635,0.5093511,0.00006363492,0.009078914,0.004096133,0.4674763],"study_design_scores_gemma":[0.0011104142,0.004940731,0.0002021216,0.0000069745583,0.0000052431765,0.0000035590997,0.0010803374,0.99196976,0.00009206988,0.00001923431,0.00039160997,0.00017791413],"about_ca_topic_score_codex":0.000017518316,"about_ca_topic_score_gemma":0.00007597967,"teacher_disagreement_score":0.48261872,"about_ca_system_score_codex":0.000023230605,"about_ca_system_score_gemma":0.000010104545,"threshold_uncertainty_score":0.5634232},"labels":[],"label_agreement":null},{"id":"W2102877660","doi":"10.1109/icdcs.2010.62","title":"Does Link Scheduling Matter on Long Paths?","year":2010,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Scheduling (production processes); Statistical time division multiplexing; Dynamic priority scheduling; Distributed computing; Quality of service; Multiplexing; Mathematical optimization; Computer network; Mathematics","score_opus":0.005430238586450473,"score_gpt":0.2103244793407348,"score_spread":0.20489424075428433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102877660","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10928271,0.0000133043095,0.8478792,0.018953593,0.0033238332,0.00012828186,3.4422646e-7,0.0004409431,0.019977828],"genre_scores_gemma":[0.9674625,0.000002103361,0.02285319,0.004289392,0.0005592432,0.0000090833555,4.1614737e-7,0.0000059525637,0.0048181578],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927276,0.000018188788,0.000117749354,0.0002687778,0.00011986395,0.00020267209],"domain_scores_gemma":[0.9993246,0.00008813932,0.00003078482,0.00043373092,0.000039262453,0.00008346516],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00014555418,0.000093183146,0.000082852304,0.000038439688,0.00008385541,0.00017503487,0.00046626216,0.0000638345,0.0004467194],"category_scores_gemma":[0.000010593232,0.00005150314,0.000044505545,0.000093717135,0.000021633723,0.00018696445,0.000067033354,0.0002589325,0.0015557922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042926013,0.000034297,0.004423191,0.0000030174049,0.000009704707,0.000012708019,0.000059071852,0.00037962137,0.00043948033,0.11260212,0.0011276861,0.8809048],"study_design_scores_gemma":[0.0012431501,0.00015932582,0.03281104,0.00005391876,0.000013010341,0.000025454669,0.000020785024,0.9029128,0.0020648448,0.0057780994,0.054116398,0.0008011661],"about_ca_topic_score_codex":0.0000040515074,"about_ca_topic_score_gemma":0.000021534503,"teacher_disagreement_score":0.9025332,"about_ca_system_score_codex":0.0000042444226,"about_ca_system_score_gemma":0.000020583646,"threshold_uncertainty_score":0.9992216},"labels":[],"label_agreement":null},{"id":"W2102937523","doi":"10.1145/2674005.2675010","title":"On the Fairness-Efficiency Tradeoff for Packet Processing with Multiple Resources","year":2014,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Fairness measure; Fair queuing; Network packet; Scheduling (production processes); Distributed computing; Maximum throughput scheduling; Quality of service; Computer network; Bandwidth (computing); Queueing theory; Round-robin scheduling; Dynamic priority scheduling; Throughput; Mathematical optimization; Wireless; Operating system","score_opus":0.010377940459054736,"score_gpt":0.19977764079425225,"score_spread":0.1893997003351975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102937523","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03436088,0.000030022797,0.9538809,0.006525571,0.00006968851,0.0003067315,4.634166e-7,0.00023062089,0.004595146],"genre_scores_gemma":[0.9917374,4.6470421e-7,0.0059444723,0.001475644,0.000104294086,0.000083046485,4.4145582e-7,0.000007984441,0.0006462197],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906033,0.000054058874,0.00011960165,0.00030216662,0.00021034785,0.0002535041],"domain_scores_gemma":[0.9987073,0.00078532536,0.00006258671,0.0003280619,0.000063254694,0.000053463635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038549578,0.000117290074,0.00010808822,0.000029952356,0.0003259331,0.00022083918,0.0006142856,0.00003198519,0.0000081323715],"category_scores_gemma":[0.00007474184,0.000058530342,0.00003844205,0.0002079781,0.000062998006,0.00013421378,0.000025870757,0.00008192501,0.000012777665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044444474,0.00007678121,0.00017624015,0.000009718879,0.0000070967767,5.3746317e-7,0.0006894198,0.0026805007,0.000016730486,0.3575579,0.0023386814,0.63640195],"study_design_scores_gemma":[0.00061168656,0.0002787121,0.00034000725,0.00002842084,0.0000048753086,0.0000031957172,0.000079537764,0.98134536,0.00010129823,0.0022221138,0.014852004,0.00013282057],"about_ca_topic_score_codex":0.000003221763,"about_ca_topic_score_gemma":0.000021226451,"teacher_disagreement_score":0.9786648,"about_ca_system_score_codex":0.000008071499,"about_ca_system_score_gemma":0.00003075126,"threshold_uncertainty_score":0.2506847},"labels":[],"label_agreement":null},{"id":"W2103065810","doi":"10.1109/ccece.1998.682563","title":"Monitoring the performance of a Web service","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Web service; Software; Service (business); Software engineering; World Wide Web; Web application; Web modeling; Database; Operating system","score_opus":0.01774792392889411,"score_gpt":0.1972039929670811,"score_spread":0.179456069038187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103065810","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95314157,0.0006364422,0.019049887,0.0071658744,0.0005560342,0.00010400218,1.3377023e-7,0.00018891616,0.019157112],"genre_scores_gemma":[0.99698406,0.00007221354,0.0015473546,0.000290344,0.0000844207,0.0000054473644,1.1145549e-8,0.0000016173658,0.0010145311],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996021,0.000014685096,0.00008556127,0.000084426756,0.00011438329,0.00009888651],"domain_scores_gemma":[0.9995903,0.000051086656,0.000027919712,0.00025945058,0.000050323753,0.000020953683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008289634,0.00004149801,0.000049055798,0.000012902317,0.00005790018,0.000024675659,0.0004905734,0.000014122569,0.00004597541],"category_scores_gemma":[0.0000021277767,0.000025397061,0.000017877643,0.00023609133,0.0000104357105,0.00014343503,0.000053724867,0.000050300285,0.00008716083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016626009,0.00002756058,0.0044033015,0.000008679815,0.000011523136,7.9493134e-7,0.0004700266,0.0021542236,0.00030886094,0.009973002,0.0010747184,0.98156565],"study_design_scores_gemma":[0.0001187855,0.000018987545,0.0013612933,0.000010792803,0.0000017620733,0.0000031290601,0.000013344991,0.9951183,0.00049241923,0.000009570606,0.0028143073,0.000037293827],"about_ca_topic_score_codex":0.0000034210714,"about_ca_topic_score_gemma":0.0000019918532,"teacher_disagreement_score":0.9929641,"about_ca_system_score_codex":0.0000038893545,"about_ca_system_score_gemma":0.0000067935234,"threshold_uncertainty_score":0.11203051},"labels":[],"label_agreement":null},{"id":"W2103316599","doi":"10.1109/ccece.2009.5090202","title":"Reducing TE-LSP setup time by minimizing blockage with the use of pre-reservations during the path computation process","year":2009,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computation; Path (computing); Reservation; Computer science; Process (computing); Network topology; Distributed computing; Task (project management); Resource (disambiguation); Computer network; Topology (electrical circuits); Real-time computing; Algorithm; Engineering","score_opus":0.011789147223144869,"score_gpt":0.2185355512476472,"score_spread":0.20674640402450234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103316599","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5791543,0.0000632692,0.40813422,0.011826309,0.000031656848,0.0003983615,0.0000028360223,0.00016872572,0.00022033544],"genre_scores_gemma":[0.9926591,0.0000020126772,0.0052244426,0.000609269,0.000040240822,0.000016820006,0.0000035601315,0.0000056348,0.0014389317],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899906,0.00008167958,0.0002085851,0.00023607003,0.00028353086,0.00019104585],"domain_scores_gemma":[0.99906194,0.00026089052,0.00015317163,0.00033660835,0.00014975655,0.000037643895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018998995,0.000114145965,0.00011604137,0.000030483014,0.0003368156,0.00020005752,0.0004933321,0.00002933839,0.000006789427],"category_scores_gemma":[0.000018189767,0.000060078008,0.000032064836,0.00044437425,0.00005055347,0.00050256285,0.00003933531,0.00012287617,0.000003383614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011236097,0.00027845716,0.0005090484,0.00003502749,0.00010688875,0.000007106788,0.010352814,0.72515273,0.0040218187,0.004890597,0.032547697,0.22198546],"study_design_scores_gemma":[0.00035462616,0.00008663699,0.0035925724,0.000051886844,0.00001606669,0.000009907778,0.0001261762,0.9943511,0.00066158856,0.0000792594,0.0005507592,0.000119450735],"about_ca_topic_score_codex":0.00002912412,"about_ca_topic_score_gemma":0.000010376629,"teacher_disagreement_score":0.4135048,"about_ca_system_score_codex":0.000014868343,"about_ca_system_score_gemma":0.00005589486,"threshold_uncertainty_score":0.25905472},"labels":[],"label_agreement":null},{"id":"W2103375672","doi":"10.1109/glocom.2006.320","title":"NXG01-3: Rate Allocation under Network End-to-End Quality-of-Service Requirements","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Quality of service; End-to-end principle; Computer network; Probabilistic logic; End-to-end delay; Bandwidth (computing); Bandwidth allocation; Queue; Network delay; Queuing delay; Mathematical optimization; Network packet; Distributed computing","score_opus":0.03039839090807506,"score_gpt":0.27930735120166794,"score_spread":0.24890896029359288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103375672","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05855669,0.00032576115,0.920802,0.0116914185,0.0012728528,0.0003588202,0.0000054154116,0.00028155802,0.006705497],"genre_scores_gemma":[0.98356867,0.000004838355,0.010352017,0.0049679433,0.0004033849,0.000024466433,0.000019501838,0.000010238321,0.00064892566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981482,0.00021702121,0.00050454715,0.0004030897,0.00033411433,0.00039303143],"domain_scores_gemma":[0.99872166,0.00016156575,0.0002060419,0.0006166661,0.00019327903,0.00010077881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080020254,0.00016596563,0.00023732452,0.00005468799,0.00013040757,0.000100608246,0.0007442621,0.000072616116,0.000075096534],"category_scores_gemma":[0.000014138154,0.00016804811,0.000067591805,0.0007343603,0.000024476127,0.00028768,0.00016684284,0.00009331279,0.00022698035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004843845,0.00016464069,0.0026643274,0.000026062127,0.00006239628,0.0000039659158,0.000121793644,0.13241576,0.00086863496,0.62815213,0.01681931,0.21865255],"study_design_scores_gemma":[0.005678602,0.00047031135,0.36186874,0.00030740877,0.00011222769,0.000013735997,0.00012700116,0.3679453,0.001004663,0.12158944,0.13875686,0.0021257051],"about_ca_topic_score_codex":0.0008823853,"about_ca_topic_score_gemma":0.0015155001,"teacher_disagreement_score":0.925012,"about_ca_system_score_codex":0.00006202226,"about_ca_system_score_gemma":0.00008981941,"threshold_uncertainty_score":0.68528026},"labels":[],"label_agreement":null},{"id":"W2103438486","doi":"10.1109/glocom.2004.1378208","title":"A fuzzy constraint-based routing algorithm for traffic engineering","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Dijkstra's algorithm; Computer science; Equal-cost multi-path routing; Suurballe's algorithm; Routing (electronic design automation); Network packet; Constraint (computer-aided design); Blocking (statistics); Path (computing); Load balancing (electrical power); Algorithm; Static routing; Traffic engineering; Link-state routing protocol; Shortest path problem; Fuzzy logic; Distributed computing; Computer network; Routing protocol; Mathematics; Theoretical computer science; Artificial intelligence","score_opus":0.008684264275075362,"score_gpt":0.2101746471924393,"score_spread":0.20149038291736393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103438486","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00094647333,0.00006659378,0.9949533,0.0020361417,0.00022548242,0.00021635822,0.000001954954,0.0006430779,0.0009106486],"genre_scores_gemma":[0.53887486,5.08102e-7,0.46009135,0.0005718531,0.00022944533,0.000034060547,0.0000013749915,0.0000063569278,0.00019020452],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990882,0.00001123038,0.00019148763,0.00026549338,0.000117867094,0.00032568307],"domain_scores_gemma":[0.9993841,0.00021887333,0.000037569367,0.0002049292,0.00005662686,0.00009790165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022683232,0.00012282183,0.00013042352,0.000057201203,0.00007846732,0.00011289567,0.00033604703,0.000049215505,0.00001326028],"category_scores_gemma":[0.000018950645,0.000116074,0.000090561814,0.00014877813,0.000016587934,0.00017497891,0.000020250003,0.0000791203,0.000026125364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.782087e-7,0.000017813518,9.967162e-7,0.0000017850092,0.000007377494,0.0000011510259,0.000025524454,0.10147945,0.000019133697,0.04657525,0.00032967885,0.851541],"study_design_scores_gemma":[0.0008199426,0.000036584064,0.0000072229536,0.000011267814,0.000005101294,0.0000067000933,0.000008821031,0.98783207,0.00011830418,0.000024028264,0.010975336,0.00015459761],"about_ca_topic_score_codex":7.8504155e-7,"about_ca_topic_score_gemma":0.0000034055734,"teacher_disagreement_score":0.88635266,"about_ca_system_score_codex":0.00003112977,"about_ca_system_score_gemma":0.000077477656,"threshold_uncertainty_score":0.47333604},"labels":[],"label_agreement":null},{"id":"W2103539825","doi":"10.1109/iscc.2000.860640","title":"An empirical study of today's Internet traffic for differentiated services IP QoS","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Computer science; Quality of service; Computer network; Differentiated services; Intranet; Traffic classification; The Internet; Architecture; Network packet; World Wide Web","score_opus":0.026146849102790765,"score_gpt":0.27140986977355386,"score_spread":0.24526302067076308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103539825","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86718714,0.000048155085,0.1313172,0.00031085993,0.0002920238,0.00042085128,0.0000011272543,0.0002449078,0.0001777098],"genre_scores_gemma":[0.997789,0.000001978554,0.0011444221,0.00028101332,0.00009477256,0.00004791038,0.0000024937667,0.000007704557,0.0006307067],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988621,0.000085614585,0.0002854995,0.00036091148,0.00019033752,0.00021556918],"domain_scores_gemma":[0.9992171,0.000096237476,0.00007852728,0.00041444314,0.00009293658,0.000100742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000107283486,0.00013416422,0.0002212254,0.00006764803,0.000045485696,0.000095737916,0.00081841386,0.000053232492,0.00015636942],"category_scores_gemma":[0.0000028976563,0.00010490239,0.000060627783,0.00020110133,0.00001595897,0.00024723273,0.00005792113,0.00006740486,0.000018529008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009825021,0.00808283,0.00883764,0.000057902704,0.00025350178,0.000010619498,0.015197119,0.005531983,0.00010474531,0.00311257,0.010071595,0.94864124],"study_design_scores_gemma":[0.0015263911,0.0011533083,0.0051894444,0.000008757324,0.000020805684,0.0000017499266,0.0003344126,0.99103403,0.000037476428,0.000028578954,0.00053195807,0.00013311309],"about_ca_topic_score_codex":0.00001449767,"about_ca_topic_score_gemma":0.00019264009,"teacher_disagreement_score":0.985502,"about_ca_system_score_codex":0.0000091180145,"about_ca_system_score_gemma":0.0000062887257,"threshold_uncertainty_score":0.42777953},"labels":[],"label_agreement":null},{"id":"W2103621877","doi":"10.1109/tpds.2010.95","title":"LBMP: A Logarithm-Barrier-Based Multipath Protocol for Internet Traffic Management","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Multipath propagation; Mathematical optimization; Logarithm; Multipath routing; Network packet; Convergence (economics); Routing protocol; Computer network; Distributed computing; Network congestion; Network topology; Link-state routing protocol; Mathematics","score_opus":0.01770175664185266,"score_gpt":0.2582322459100113,"score_spread":0.24053048926815865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103621877","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004929185,0.0000065563386,0.958431,0.0002577072,0.0008497618,0.039366964,0.00015120405,0.00035150247,0.00009236231],"genre_scores_gemma":[0.832335,7.129645e-7,0.004814803,0.00008569147,0.00006135064,0.16212313,0.000013988403,0.000013403924,0.0005518955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836767,0.00007178365,0.00039482542,0.00055334816,0.00023526052,0.00037709795],"domain_scores_gemma":[0.9989603,0.00014970012,0.00011601413,0.00043920518,0.000104096194,0.00023066458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026450315,0.00026982318,0.000277389,0.000118764314,0.00024559235,0.00028933954,0.0004331476,0.0001561371,0.000014691142],"category_scores_gemma":[0.0000031615596,0.00023322488,0.00014347125,0.00020517778,0.00007147907,0.00016827803,0.0000028698312,0.00027414042,0.00002057648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049749145,0.00077354134,0.000013579746,0.0002883098,0.00016014207,0.000028275941,0.000120349054,0.8265861,0.000096121476,0.012076597,0.0033499263,0.15600954],"study_design_scores_gemma":[0.004682784,0.00026313242,0.000026788453,0.000069509246,0.000027995533,0.000018536977,0.00003668896,0.96098167,0.000047099107,0.000036073303,0.033530883,0.00027883935],"about_ca_topic_score_codex":0.000016745653,"about_ca_topic_score_gemma":0.000049529,"teacher_disagreement_score":0.9536162,"about_ca_system_score_codex":0.000032557924,"about_ca_system_score_gemma":0.000055470275,"threshold_uncertainty_score":0.95106345},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Tellabs (Canada)","funders":"","keywords":"Network congestion; Computer science; Bandwidth (computing); Computer network; Network packet","score_opus":0.01133866544013113,"score_gpt":0.19744243213983328,"score_spread":0.18610376669970216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103701891","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00057804957,0.00083137123,0.9810339,0.01335105,0.0012297009,0.0007070647,0.0000021738767,0.0005300484,0.0017366089],"genre_scores_gemma":[0.9816102,0.00004515314,0.010256424,0.0018872931,0.0007449926,0.0001868302,0.0000037182087,0.000012357307,0.005253079],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985827,0.00006756445,0.00023914846,0.00050697796,0.00017915784,0.00042442884],"domain_scores_gemma":[0.99882984,0.00029550213,0.000089915404,0.00049876934,0.00015843315,0.00012753466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031858822,0.00018193363,0.0002334387,0.00005428596,0.00017954793,0.00016903438,0.00051681825,0.0000797043,0.00011187075],"category_scores_gemma":[0.00005017735,0.00015352137,0.00008702587,0.00022304968,0.00004108541,0.00035789964,0.000033422544,0.00012504583,0.00008641154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023036104,0.00007308313,0.00014166688,0.000004345243,0.00004345288,0.00000494949,0.00002880505,0.025131747,0.000015955056,0.25725245,0.07635752,0.64092296],"study_design_scores_gemma":[0.0019772963,0.00014025209,0.00031103444,0.000008429592,0.000021501794,0.000015491796,0.000001693148,0.9694327,0.000021804555,0.0009105283,0.026935786,0.00022347282],"about_ca_topic_score_codex":0.0000052316177,"about_ca_topic_score_gemma":0.000008651854,"teacher_disagreement_score":0.98103213,"about_ca_system_score_codex":0.000026283325,"about_ca_system_score_gemma":0.0000129809,"threshold_uncertainty_score":0.62604195},"labels":[],"label_agreement":null},{"id":"W2103795037","doi":"10.1109/lcn.2008.4664232","title":"Short-term QoS provisioning in MPLS ingress nodes","year":2008,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Burstiness; Multiprotocol Label Switching; Computer network; Computer science; Quality of service; Jitter; Provisioning; Network packet; Node (physics); Term (time); Scheme (mathematics); Telecommunications; Engineering","score_opus":0.02209333149622955,"score_gpt":0.23939591321161327,"score_spread":0.21730258171538372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103795037","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5139888,0.00018221806,0.47570685,0.0006909179,0.0004652565,0.00019943833,2.0059373e-7,0.00033881725,0.008427552],"genre_scores_gemma":[0.99080706,0.000019767836,0.008004552,0.00027393695,0.0001041651,0.000019426188,4.955843e-7,0.0000048084325,0.0007657785],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999072,0.00003646889,0.00018849727,0.0002800116,0.00017861386,0.00024439945],"domain_scores_gemma":[0.99951476,0.000079296966,0.000023635206,0.0002805695,0.000036124835,0.00006563217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013624573,0.000095747586,0.00012665683,0.00008159781,0.00010526769,0.00006322912,0.00047921884,0.00004275802,0.000020400259],"category_scores_gemma":[0.000013646491,0.00007993827,0.00003398269,0.0002478215,0.00003436412,0.00034129623,0.000112751564,0.00011505045,0.000046347526],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000077081095,0.00008287745,0.07657115,0.0000047093718,0.0000074731743,0.00019262594,0.00065656524,0.0016320052,0.00013921037,0.029560847,0.0013445843,0.88980025],"study_design_scores_gemma":[0.0011224584,0.00008740755,0.19935828,0.00010748761,0.000003828844,0.00015978151,0.000041279545,0.7948418,0.00051537325,0.000415302,0.0027968276,0.0005501586],"about_ca_topic_score_codex":0.000010430201,"about_ca_topic_score_gemma":0.000018815357,"teacher_disagreement_score":0.8892501,"about_ca_system_score_codex":0.000019957297,"about_ca_system_score_gemma":0.000047534897,"threshold_uncertainty_score":0.3259788},"labels":[],"label_agreement":null},{"id":"W2104158305","doi":"10.1145/1386109.1386113","title":"Low-latency adaptive streaming over tcp","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Multimedia Computing Communications and Applications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Toronto","funders":"Portland State University","keywords":"Computer science; TCP Friendly Rate Control; TCP global synchronization; TCP acceleration; Compound TCP; Latency (audio); Zeta-TCP; CUBIC TCP; Computer network; TCP tuning; H-TCP; HSTCP; Network congestion; Telecommunications; Network packet","score_opus":0.024346025660478502,"score_gpt":0.2576072967301877,"score_spread":0.23326127106970918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104158305","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005047016,0.00037426193,0.9908601,0.0018378092,0.00008395803,0.0005550944,0.000014995208,0.0004991631,0.0007276091],"genre_scores_gemma":[0.7826226,0.00084903755,0.21581638,0.00026808074,0.000059238082,0.00022103293,0.000012727784,0.000015978778,0.00013496718],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844587,0.00012392756,0.00040770008,0.0004962652,0.00021631886,0.00030993763],"domain_scores_gemma":[0.9954969,0.0011975414,0.00015230324,0.002795109,0.00016429361,0.00019384144],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0001707711,0.00023442328,0.00022606987,0.00018928265,0.0018805288,0.00008221495,0.0019700974,0.000103310485,0.000017205977],"category_scores_gemma":[0.000016850547,0.0002446291,0.000102879676,0.0006924175,0.0003217735,0.000280134,0.00013246952,0.0004735193,0.00007736812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004471729,0.00041883052,0.00010876647,0.0000041443586,0.000047172238,0.0000012188559,0.0007399049,0.0016662353,0.00012729623,0.009663026,0.00007025101,0.9871487],"study_design_scores_gemma":[0.000861594,0.00009107881,0.002880993,0.000054390188,0.000034493558,0.000049872775,0.00013066526,0.9868177,0.0001377921,0.0011696875,0.0073720883,0.0003996086],"about_ca_topic_score_codex":0.0000437691,"about_ca_topic_score_gemma":0.00002344357,"teacher_disagreement_score":0.98674905,"about_ca_system_score_codex":0.00004985414,"about_ca_system_score_gemma":0.00009826929,"threshold_uncertainty_score":0.9994189},"labels":[],"label_agreement":null},{"id":"W2104382415","doi":"10.1109/infcom.1994.337676","title":"A definition of congestion: applications to ATM bandwidth management","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Computer science; Network congestion; Queueing theory; Computer network; Quality of service; Queue; Integrated Services Digital Network; Asynchronous Transfer Mode; Active queue management; Bandwidth (computing); Network traffic control; Throttle; Service (business); Traffic congestion; Network packet; Engineering","score_opus":0.02656385718268141,"score_gpt":0.21948155858110538,"score_spread":0.19291770139842396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104382415","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002048544,0.00008408986,0.8402954,0.0027115867,0.000060862443,0.00027630854,7.8259353e-7,0.00013402765,0.15623212],"genre_scores_gemma":[0.8294016,0.000046000772,0.16801384,0.00070309784,0.000041982472,0.00021169643,0.0000012110837,0.000003244717,0.0015772983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99937195,0.00001731887,0.00015305447,0.00019635916,0.00014352895,0.00011782153],"domain_scores_gemma":[0.99946386,0.00003909355,0.000035448615,0.00032881007,0.000060158352,0.00007261169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000074078016,0.00006361917,0.00008134616,0.00006248648,0.00005272737,0.00003113978,0.00029974538,0.000021932923,0.00018366316],"category_scores_gemma":[0.000002309932,0.000059581467,0.000032017902,0.00035590125,0.00001508954,0.000096559124,0.000059152782,0.0000307343,0.00041706744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.394681e-7,0.000038293325,0.00001984132,0.000003688995,0.0000075042844,8.4289655e-7,0.00002586857,0.00012419753,0.0000054709767,0.66379875,0.0030815431,0.33289307],"study_design_scores_gemma":[0.004168125,0.0006853083,0.009343915,0.00015696634,0.00013098594,0.000061406456,0.00020834644,0.37225255,0.00031163773,0.11000232,0.50137305,0.0013054098],"about_ca_topic_score_codex":0.000001638197,"about_ca_topic_score_gemma":0.0000029284872,"teacher_disagreement_score":0.82919675,"about_ca_system_score_codex":0.000012680352,"about_ca_system_score_gemma":0.000003390429,"threshold_uncertainty_score":0.53606975},"labels":[],"label_agreement":null},{"id":"W2104443123","doi":"10.1109/tpds.2007.1052","title":"Bandwidth Management for Supporting Differentiated Service Aware Traffic Engineering","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":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Nortel (Canada)","funders":"","keywords":"Computer science; Preemption; Dynamic bandwidth allocation; Bandwidth (computing); Bandwidth management; Bandwidth allocation; Computer network; Distributed computing; Multiprotocol Label Switching; Quality of service; Operating system","score_opus":0.01171532534096999,"score_gpt":0.22612241421777904,"score_spread":0.21440708887680904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104443123","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014996528,0.00010651767,0.9825593,0.00023544198,0.000939594,0.0006381052,0.0000812706,0.00041458124,0.000028638235],"genre_scores_gemma":[0.9981784,0.000018030789,0.0012937662,0.00007225458,0.00005805444,0.00014968074,0.000038782797,0.000014391634,0.00017659993],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998483,0.000025536243,0.00042566145,0.0004013691,0.00019886285,0.00046554033],"domain_scores_gemma":[0.99918497,0.00016087129,0.000099162084,0.00027030773,0.00009552879,0.00018917194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032754184,0.0002229356,0.00025167613,0.00011806195,0.00025791943,0.00017251894,0.0002614545,0.00009956114,0.000003871001],"category_scores_gemma":[0.0000014664279,0.00020885655,0.00009137183,0.0003585967,0.000011286137,0.00016233878,0.000002688022,0.0001326314,0.000008535922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067976696,0.00011206577,0.0000068651857,0.00016569355,0.000133135,0.000016246002,0.00010176174,0.9408175,0.000037489575,0.0016192237,0.00021410307,0.056707952],"study_design_scores_gemma":[0.0015008253,0.00007433197,0.00020923787,0.00008267882,0.000052647334,0.000023502951,0.00015694828,0.9960122,0.000026070558,0.000010572571,0.0015961616,0.0002548015],"about_ca_topic_score_codex":0.000011019786,"about_ca_topic_score_gemma":0.000021822892,"teacher_disagreement_score":0.9831819,"about_ca_system_score_codex":0.000046799436,"about_ca_system_score_gemma":0.000015777821,"threshold_uncertainty_score":0.85169226},"labels":[],"label_agreement":null},{"id":"W2104662714","doi":"10.1109/icc.2003.1204239","title":"Congestion control for Web-based multimedia playback applications","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Government of Canada","keywords":"Network congestion; Computer science; Quality of service; Computer network; The Internet; TCP Friendly Rate Control; Multimedia; World Wide Web","score_opus":0.009054510172763106,"score_gpt":0.2286795057519802,"score_spread":0.2196249955792171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104662714","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037007834,0.000076360244,0.9904338,0.0063434714,0.00020448968,0.0010643429,0.000010465181,0.00052461075,0.0009723577],"genre_scores_gemma":[0.86918974,0.00000229856,0.12724036,0.0020970656,0.00017818593,0.0010232925,0.000011681923,0.000008650998,0.0002487403],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904364,0.000021329763,0.0002013652,0.00033348883,0.00014630202,0.0002538707],"domain_scores_gemma":[0.99897605,0.0003028067,0.00006820004,0.00036946745,0.00015707659,0.00012638036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017659941,0.00012558473,0.0001447124,0.000058144073,0.00013970716,0.000088160516,0.00043251886,0.000074953445,0.000019609162],"category_scores_gemma":[0.000024431813,0.00011327836,0.000085751526,0.00018354281,0.000044734817,0.00017176477,0.000014402224,0.00007100205,0.00016454294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041704065,0.0001872443,0.00010703426,0.0000090896965,0.00003762612,0.0000015859632,0.000029672867,0.06538415,0.00075088086,0.41684124,0.002610588,0.5139992],"study_design_scores_gemma":[0.008302368,0.00010424779,0.00043625996,0.000009581998,0.000025790103,0.0000028404525,0.000004338227,0.95795524,0.0002638258,0.0049377526,0.027746396,0.00021138061],"about_ca_topic_score_codex":0.0000040579644,"about_ca_topic_score_gemma":0.00001807751,"teacher_disagreement_score":0.8925711,"about_ca_system_score_codex":0.00004665051,"about_ca_system_score_gemma":0.00020815944,"threshold_uncertainty_score":0.46193573},"labels":[],"label_agreement":null},{"id":"W2104845391","doi":"10.1109/contel.2005.185910","title":"Optimal QoS-based classification for link models with predetermined service levels","year":2005,"lang":"en","type":"article","venue":"Proceedings of the 8th International Conference on Telecommunications, 2005. ConTEL 2005.","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Quality of service; Computer science; Quantization (signal processing); Computer network; Overhead (engineering); Multiprotocol Label Switching; Distributed computing; Algorithm","score_opus":0.0811741878039017,"score_gpt":0.29119743778361606,"score_spread":0.21002324997971436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104845391","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03898472,0.00036690375,0.52647173,0.39018026,0.0006858478,0.0034157974,0.00017197714,0.0006587134,0.03906407],"genre_scores_gemma":[0.8813904,0.000053904598,0.11459948,0.0018412956,0.00022651658,0.00045508094,0.000020711357,0.000025217747,0.0013873841],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783635,0.00003685542,0.00066355057,0.00049868703,0.0005627361,0.0004018383],"domain_scores_gemma":[0.9965261,0.0002630745,0.0007415558,0.0007656483,0.0015772856,0.00012630587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006053755,0.00030258755,0.0003007453,0.00019797907,0.0003153284,0.00030759716,0.0043266835,0.00013816367,0.000051280094],"category_scores_gemma":[0.00009966754,0.00023859172,0.00014027974,0.00026035507,0.00013478694,0.0010069779,0.00021737118,0.00035404964,0.000020079447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062903546,0.0005973006,0.00025380254,0.000045386514,0.00021839292,1.4199425e-7,0.0005059628,0.036651224,0.0044801,0.7982645,0.0048323427,0.15352178],"study_design_scores_gemma":[0.0015306618,0.00016253274,0.000532113,0.00020027769,0.000032354063,0.0000055217793,0.0000918439,0.9795808,0.002522526,0.0010564502,0.013997222,0.0002876977],"about_ca_topic_score_codex":0.000012261847,"about_ca_topic_score_gemma":0.000092473965,"teacher_disagreement_score":0.94292957,"about_ca_system_score_codex":0.00019131845,"about_ca_system_score_gemma":0.00040029,"threshold_uncertainty_score":0.9729488},"labels":[],"label_agreement":null},{"id":"W2105147661","doi":"10.1109/icpads.2007.4447751","title":"On the relative value of local scheduling versus routing in parallel server systems","year":2007,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Server; Scheduling (production processes); Routing (electronic design automation); Distributed computing; Computer network; Parallel computing; Mathematical optimization; Mathematics","score_opus":0.020242871977676574,"score_gpt":0.24416779821386883,"score_spread":0.22392492623619226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105147661","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09730786,0.00007245309,0.89410657,0.00046143093,0.00039078746,0.00012618223,7.0527705e-8,0.000045397974,0.0074892477],"genre_scores_gemma":[0.9960715,0.0000014612119,0.0036052607,0.00012788954,0.00003997409,0.0000037566833,1.3937753e-7,0.000003262639,0.00014670873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999074,0.000092172304,0.00024608924,0.00017454974,0.00020920589,0.00020398226],"domain_scores_gemma":[0.99832374,0.0012778975,0.000079714664,0.00023977147,0.000044482993,0.000034413322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011422561,0.00007726681,0.00011404838,0.000042326268,0.00005329829,0.000029273533,0.00034747485,0.000050721508,0.0000050562844],"category_scores_gemma":[0.000051016767,0.00005073111,0.00003946531,0.00028296307,0.000036073554,0.00013987407,0.000055610126,0.00017201372,0.000022568276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003799762,0.000013788444,0.00011654734,0.0000014884869,0.000010261743,0.0000041175463,0.00016374217,0.16277228,0.000001863427,0.82765126,0.000014722975,0.009211933],"study_design_scores_gemma":[0.0007466692,0.0000679672,0.000865893,0.000060825565,0.0000027656556,0.000001067995,0.00039548488,0.9966805,0.000025834288,0.0010550932,0.00002823844,0.00006969092],"about_ca_topic_score_codex":0.00008602151,"about_ca_topic_score_gemma":0.000050202532,"teacher_disagreement_score":0.89876366,"about_ca_system_score_codex":0.00004593946,"about_ca_system_score_gemma":0.00003448211,"threshold_uncertainty_score":0.20687546},"labels":[],"label_agreement":null},{"id":"W2105361689","doi":"10.1109/lcn.1993.591263","title":"Rotation counter protocol - A token-ring protocol for integrated services","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Token ring; Computer science; Computer network; Token bus network; Security token; Asynchronous communication; Network packet; Protocol (science); Internet Protocol Control Protocol; Token passing; Fiber Distributed Data Interface; Link Control Protocol; Local area network; User Datagram Protocol; Internet protocol suite; Operating system; The Internet","score_opus":0.025161781584267937,"score_gpt":0.28418586641373467,"score_spread":0.2590240848294667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105361689","genre_codex":"protocol","genre_gemma":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"protocol","genre_consensus":"protocol","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001662402,3.2324309e-7,0.43256697,0.0004575613,0.00003544014,0.5625371,5.9868626e-7,0.00029320933,0.0040921727],"genre_scores_gemma":[0.0045592827,2.8420315e-8,0.018607121,0.0008095297,0.00010267949,0.9737636,0.0000010749394,0.000009074962,0.002147597],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989603,0.00003680853,0.00025989296,0.0003147751,0.00017832163,0.0002499022],"domain_scores_gemma":[0.9993046,0.00005904064,0.00009788706,0.00027446728,0.00019674459,0.00006727401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001623118,0.00014308935,0.00012339932,0.000056093875,0.00012144684,0.00029764007,0.00047942466,0.00005614391,0.00028854108],"category_scores_gemma":[0.00000663351,0.000108321525,0.0000544654,0.00022211908,0.000013946638,0.00060241827,0.000046488076,0.00007833312,0.000106345586],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001272956,0.00026693902,0.00029704112,0.00026384805,0.00003289409,0.0000041014964,0.00069209974,0.00094984187,0.00014572658,0.036576685,0.013131764,0.9475118],"study_design_scores_gemma":[0.0020566978,0.00012712141,0.0000339449,0.000055039236,0.0000018226764,0.000003074011,0.000018858158,0.78398144,0.00017748777,0.00024664588,0.21317239,0.00012544615],"about_ca_topic_score_codex":0.000011568279,"about_ca_topic_score_gemma":0.000035306766,"teacher_disagreement_score":0.9473863,"about_ca_system_score_codex":0.00003161701,"about_ca_system_score_gemma":0.000022099042,"threshold_uncertainty_score":0.44172236},"labels":[],"label_agreement":null},{"id":"W2105628131","doi":"10.1109/tnet.2006.880168","title":"Collected experience from implementing RSVP","year":2006,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Quality of service; Unix; Variety (cybernetics); Software deployment; The Internet; Standardization; Protocol (science); Domain (mathematical analysis); Computer network; Resource Reservation Protocol; Software; Distributed computing; Software engineering; Internet Protocol; Operating system","score_opus":0.015199420446345044,"score_gpt":0.23421580667478734,"score_spread":0.2190163862284423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105628131","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032845408,0.00024201526,0.96138054,0.00046317387,0.002402911,0.000232391,0.00000681868,0.0006636798,0.0017630429],"genre_scores_gemma":[0.9817577,0.00003165501,0.016069317,0.00039809113,0.0009609931,0.00010745498,0.0000064122914,0.00002309356,0.000645282],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977397,0.000110592606,0.00045287333,0.00063925004,0.00037446962,0.0006831553],"domain_scores_gemma":[0.9984339,0.00041612374,0.0001428344,0.0008247239,0.00007690756,0.000105516716],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017740797,0.0002582116,0.0002426897,0.00013120774,0.0008107487,0.0003198413,0.0009807224,0.00010163797,0.00011680142],"category_scores_gemma":[0.0000040329514,0.0002731013,0.00014389517,0.00094465894,0.00004831049,0.00034226672,0.000015857659,0.00030649273,0.000053681124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030907922,0.00016847077,0.00047794406,0.0000029459436,0.00006498629,0.00003491565,0.000578653,0.07847906,0.0008437577,0.0014069048,0.0021778282,0.91573364],"study_design_scores_gemma":[0.0021421434,0.0001343256,0.0020385887,0.00016887338,0.00006618277,0.00001877004,0.00013732516,0.8904501,0.0031362488,0.0053256974,0.09538594,0.0009958114],"about_ca_topic_score_codex":0.00029033344,"about_ca_topic_score_gemma":0.00056516926,"teacher_disagreement_score":0.94891226,"about_ca_system_score_codex":0.00008745587,"about_ca_system_score_gemma":0.000064762564,"threshold_uncertainty_score":0.9999721},"labels":[],"label_agreement":null},{"id":"W2105636780","doi":"10.1109/iscc.2000.860623","title":"Design and performance of a scalable real time control protocol: simulations and evaluations","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"RTP Control Protocol; Computer science; Scalability; Computer network; Protocol (science); Multicast; Quality of service; Distributed computing; Real-time computing; Operating system; Network packet","score_opus":0.022657709457289992,"score_gpt":0.2568894869173275,"score_spread":0.2342317774600375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105636780","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025214339,0.00003381692,0.95028514,0.0007677266,0.000019844194,0.020554109,0.0000013430788,0.0001524525,0.0029712503],"genre_scores_gemma":[0.97014797,0.000007659772,0.025502723,0.00007085926,0.000015711597,0.0032480138,2.0305808e-7,0.0000033952608,0.0010034491],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993483,0.000074781405,0.00016295126,0.00016551354,0.00013059973,0.00011787448],"domain_scores_gemma":[0.999382,0.00024277165,0.000053168627,0.00016764597,0.000097480195,0.000056907298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022914886,0.00006921945,0.000111620815,0.000045230907,0.00011166732,0.000049582228,0.00011007351,0.00003047351,0.00013864692],"category_scores_gemma":[0.000014684673,0.000058036374,0.000011130243,0.00014636797,0.00005098079,0.00028700713,0.000026281472,0.000037643556,0.000017178818],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006840505,0.0001843536,0.003644381,0.00003441876,0.000050072467,8.872589e-7,0.00043981813,0.11988222,0.0014172541,0.01473192,0.002008933,0.8575373],"study_design_scores_gemma":[0.001169311,0.00023460994,0.0018867262,0.000010748915,0.000009238562,0.00000327556,9.551864e-7,0.9962379,0.000042963224,0.0001461581,0.00019161361,0.00006652968],"about_ca_topic_score_codex":0.0000030147298,"about_ca_topic_score_gemma":7.0663026e-7,"teacher_disagreement_score":0.94493365,"about_ca_system_score_codex":0.000006059667,"about_ca_system_score_gemma":0.000020863974,"threshold_uncertainty_score":0.23666546},"labels":[],"label_agreement":null},{"id":"W2105669650","doi":"10.1109/glocomw.2008.ecp.26","title":"EVCCM: An Efficient VOIP Congestion Control Mechanism","year":2008,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Voice over IP; Computer science; Computer network; Service provider; Network packet; Quality of service; Service (business); Computer security; The Internet; World Wide Web; Business","score_opus":0.013221054998451318,"score_gpt":0.20529298092760356,"score_spread":0.19207192592915223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105669650","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061729494,0.000074190946,0.9322567,0.0014309915,0.00064020616,0.0002511961,0.0000011797966,0.00071858865,0.0028974744],"genre_scores_gemma":[0.98840415,0.0000106421085,0.008886033,0.0015674647,0.00017069676,0.000032079963,0.0000019349238,0.00000920153,0.0009177831],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851495,0.00012348239,0.00023084538,0.0004455504,0.0003386653,0.00034650226],"domain_scores_gemma":[0.99892414,0.00010110979,0.00006849995,0.0005416715,0.0001435145,0.00022109026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029133013,0.0001650368,0.00019087059,0.00007732306,0.0002665063,0.000074665266,0.00059182063,0.00008355917,0.0000805731],"category_scores_gemma":[0.000021165328,0.00014197241,0.000068552916,0.00022040882,0.000054606513,0.00027170597,0.000047350284,0.00013035757,0.00028399072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024569987,0.00019447073,0.00011770159,0.0000019235329,0.000022750262,0.000070508526,0.0002766335,0.022217961,0.0003843772,0.8912598,0.0011559493,0.08427335],"study_design_scores_gemma":[0.0013971038,0.00018566869,0.0013057531,0.000005074644,0.000008746822,0.00011636245,0.000012659147,0.9939119,0.00018078221,0.001403944,0.0012483556,0.00022365531],"about_ca_topic_score_codex":0.000017927796,"about_ca_topic_score_gemma":0.000009408134,"teacher_disagreement_score":0.97169393,"about_ca_system_score_codex":0.000033236774,"about_ca_system_score_gemma":0.000089900306,"threshold_uncertainty_score":0.5789467},"labels":[],"label_agreement":null},{"id":"W2105676376","doi":"10.1109/lcn.1996.558147","title":"A performance study of multicast routing algorithms for ATM networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Multicast; Xcast; Protocol Independent Multicast; Computer network; Computer science; Source-specific multicast; Distance Vector Multicast Routing Protocol; Pragmatic General Multicast; Distributed computing; Multicast address; IP multicast; Inter-domain","score_opus":0.03428127765202347,"score_gpt":0.241950988188246,"score_spread":0.20766971053622255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105676376","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11124145,0.000057833873,0.88663614,0.00012609089,0.00025917345,0.00045265738,2.4246773e-7,0.0001299536,0.001096482],"genre_scores_gemma":[0.9803244,0.000008087696,0.018726839,0.00008781105,0.00012723223,0.00004968613,2.1992697e-7,0.000005724389,0.0006700266],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910367,0.000026353628,0.0002438967,0.0002443623,0.00013860104,0.00024313696],"domain_scores_gemma":[0.9993291,0.00015599081,0.00007731876,0.0003017187,0.000081973965,0.00005392427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020012828,0.00009640325,0.00015878891,0.000030163728,0.00011135426,0.000041205883,0.00040769178,0.000033217922,0.000021753824],"category_scores_gemma":[0.000012561558,0.00008042269,0.000044650373,0.00020648955,0.000016271099,0.00018342992,0.000072556184,0.00006784579,0.0000086225455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005524763,0.00031544975,0.0029486923,0.0000036351512,0.000024682844,0.0000012203459,0.0007176125,0.025387067,0.0000020200212,0.0016111237,0.0004467959,0.9685362],"study_design_scores_gemma":[0.0011954866,0.0004126262,0.0014752237,0.000008577606,0.000009190053,0.0000026737705,0.0001204414,0.996485,0.0000050479025,0.0000041292205,0.00018431789,0.000097300646],"about_ca_topic_score_codex":0.0000073550664,"about_ca_topic_score_gemma":0.00000814212,"teacher_disagreement_score":0.97109795,"about_ca_system_score_codex":0.00000976216,"about_ca_system_score_gemma":0.0000044858466,"threshold_uncertainty_score":0.3279542},"labels":[],"label_agreement":null},{"id":"W2105966535","doi":"10.1109/glocom.1997.644585","title":"Diagnosing a TCP/ATM performance problem: a case study","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; Canarie; Cisco Systems","keywords":"Computer science; Computer network; File Transfer Protocol; Asynchronous Transfer Mode; ATM adaptation layer; Network packet; Throughput; Workstation; Robustness (evolution); Zeta-TCP; Operating system; Transmission Control Protocol; The Internet","score_opus":0.02409251071203507,"score_gpt":0.21687273496337675,"score_spread":0.19278022425134167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105966535","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88026476,0.00022738529,0.106526695,0.0010406126,0.0002520445,0.0005504717,1.4024326e-7,0.0005471625,0.01059071],"genre_scores_gemma":[0.9910531,0.000016134942,0.0064800135,0.000377351,0.00008269182,0.00007932547,5.963336e-8,0.000005778501,0.0019055268],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900675,0.00005238171,0.00018688374,0.00031654513,0.00017694625,0.0002604858],"domain_scores_gemma":[0.99933535,0.00008934374,0.00004217503,0.000392717,0.000049041555,0.00009140237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001795527,0.0001155816,0.00012370052,0.000049916656,0.00021033887,0.00017096243,0.00034575508,0.000026150616,0.000118356795],"category_scores_gemma":[0.000006705463,0.00009451881,0.000032971984,0.0003152066,0.000017420973,0.00043424199,0.000097773074,0.000107245796,0.00021100607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012157889,0.00038965637,0.007842157,0.000004293252,0.000016551206,0.0015262436,0.0021929073,0.0006104243,0.0000012950279,0.001493327,0.0025088869,0.98341304],"study_design_scores_gemma":[0.0007963598,0.0003324379,0.00040828303,0.000012422259,0.000010341548,0.0015733076,0.00026048394,0.99369097,0.000006276775,0.000023213866,0.0026922883,0.00019361549],"about_ca_topic_score_codex":0.000046517747,"about_ca_topic_score_gemma":0.00007381328,"teacher_disagreement_score":0.99308056,"about_ca_system_score_codex":0.000018863873,"about_ca_system_score_gemma":0.0000114098975,"threshold_uncertainty_score":0.3854365},"labels":[],"label_agreement":null},{"id":"W2106154214","doi":"10.1109/icc.1992.268050","title":"Effectiveness of leaky bucket policing mechanism","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec en Outaouais","funders":"","keywords":"Multiplexer; Multiplexing; Leaky bucket; Statistical time division multiplexing; Computer science; Asynchronous Transfer Mode; Asynchronous communication; Bandwidth (computing); Scheme (mathematics); Computer network; Token bucket; Theoretical computer science; Telecommunications; Mathematics; Quality of service","score_opus":0.007502850413767246,"score_gpt":0.21684649729298697,"score_spread":0.20934364687921972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106154214","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03253086,0.000031964177,0.9531567,0.000057102283,0.00023832588,0.00009777889,1.4941735e-7,0.00010109134,0.013786032],"genre_scores_gemma":[0.9933714,0.0000035435182,0.006243476,0.0001001239,0.00001243604,0.000007001088,1.2244166e-7,0.0000034933412,0.00025837938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999293,0.0001679705,0.000108367385,0.00016494059,0.0001157527,0.0001499521],"domain_scores_gemma":[0.9994197,0.00020586983,0.00003505954,0.00024308985,0.00005075954,0.000045525914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046876728,0.00006867079,0.00012552257,0.000043342774,0.000038007907,0.000020509753,0.00024365349,0.00003292635,0.000022850076],"category_scores_gemma":[0.000026176662,0.000057985617,0.000042136897,0.00019996225,0.000014127737,0.00011464776,0.000028390245,0.000048153386,0.000022235276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023955024,0.0000168714,0.000085117994,0.000009799366,0.000008336277,0.0000011401032,0.000028598266,0.0001521681,0.0029928982,0.97691417,0.000025111616,0.01976337],"study_design_scores_gemma":[0.0041811084,0.0005839587,0.0058072913,0.0002491148,0.00003935826,0.00008225224,0.00007808235,0.16175734,0.48560998,0.3379804,0.002739478,0.00089167967],"about_ca_topic_score_codex":0.000024927818,"about_ca_topic_score_gemma":0.0000042368233,"teacher_disagreement_score":0.9608406,"about_ca_system_score_codex":0.000011682332,"about_ca_system_score_gemma":0.000040588435,"threshold_uncertainty_score":0.23645848},"labels":[],"label_agreement":null},{"id":"W2106536499","doi":"10.1109/icccn.2000.885500","title":"Deadline based network resource management","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Tuple; Network packet; Scheduling (production processes); Distributed computing; Computer network; Earliest deadline first scheduling; Key (lock); Fair-share scheduling; Rate-monotonic scheduling; Quality of service","score_opus":0.011413718907976812,"score_gpt":0.18017920319581263,"score_spread":0.1687654842878358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106536499","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000059242182,0.0002372611,0.8255775,0.0049847667,0.00014818058,0.000101401296,8.889869e-8,0.00039518147,0.16849637],"genre_scores_gemma":[0.7938704,0.000020006577,0.16144569,0.012329761,0.00040582925,0.000032639517,0.0000014685934,0.000010632739,0.031883568],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990989,0.000042535692,0.00013808261,0.0002589428,0.00018128572,0.0002802292],"domain_scores_gemma":[0.99935037,0.000063743726,0.000029896044,0.00045209384,0.000018768253,0.00008514368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001589371,0.00009213018,0.00008719815,0.0000337132,0.000099394514,0.000083455285,0.00052835833,0.000028860886,0.00045022377],"category_scores_gemma":[0.0000020490602,0.00007958554,0.00004698996,0.0003244374,0.000015131431,0.0000862943,0.00008041394,0.000065634944,0.00042966194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001897869,0.000031799038,0.00005452014,0.0000021301155,0.000010231488,0.000022803106,0.000008986519,0.025913399,2.2010208e-7,0.17214793,0.1708492,0.6309569],"study_design_scores_gemma":[0.00029820003,0.00001734704,0.00010055039,0.0000061847545,0.0000037192578,0.000001598952,0.000002030869,0.6735754,0.0000015514465,0.00026036665,0.32565457,0.00007849757],"about_ca_topic_score_codex":8.368788e-7,"about_ca_topic_score_gemma":0.0000024287576,"teacher_disagreement_score":0.79381114,"about_ca_system_score_codex":0.000012886843,"about_ca_system_score_gemma":0.000002940693,"threshold_uncertainty_score":0.55225784},"labels":[],"label_agreement":null},{"id":"W2106582082","doi":"10.1109/icccn.1995.540173","title":"Traffic smoothing and bandwidth allocation for VBR MPEG-2 video connections in ATM network","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Technical University of Nova Scotia","funders":"","keywords":"Dynamic bandwidth allocation; Variable bitrate; Computer science; Bandwidth allocation; Bandwidth (computing); Smoothing; Gaussian; Frame (networking); Macro; Computer network; Real-time computing; Algorithm; Bit rate","score_opus":0.016791035114896827,"score_gpt":0.21401020520512612,"score_spread":0.1972191700902293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106582082","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02385277,0.0010079152,0.96205646,0.010099682,0.0005263232,0.0004563324,7.2463e-7,0.0003071108,0.0016927046],"genre_scores_gemma":[0.9799494,0.000087476,0.017721858,0.0009339367,0.00021548137,0.00008918293,0.0000018055395,0.0000075152775,0.0009933121],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903405,0.000045403147,0.00021749735,0.0003262193,0.000095327894,0.0002815271],"domain_scores_gemma":[0.99926853,0.00035422176,0.000047649293,0.00020605886,0.000048237307,0.00007527731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002936228,0.00010974222,0.0001418689,0.00006094371,0.00019522509,0.00014114902,0.00020249962,0.00006550493,0.000038505248],"category_scores_gemma":[0.000032910237,0.000104440245,0.000039499526,0.0003227913,0.000027599814,0.00033271243,0.00003108838,0.00009445518,0.000017735172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007792697,0.000057784597,0.00028520043,0.000007332049,0.000014647768,0.0000014469755,0.00048009233,0.078398414,0.000013438301,0.16598885,0.013413049,0.74133193],"study_design_scores_gemma":[0.00079973857,0.000059386974,0.00043925166,0.000019766585,0.0000056931976,0.000006488512,0.000024151497,0.9739135,0.000004019632,0.0008366932,0.02375362,0.00013771563],"about_ca_topic_score_codex":0.000010332159,"about_ca_topic_score_gemma":0.00020704747,"teacher_disagreement_score":0.95609665,"about_ca_system_score_codex":0.000025963252,"about_ca_system_score_gemma":0.0000148549825,"threshold_uncertainty_score":0.42589495},"labels":[],"label_agreement":null},{"id":"W2106799982","doi":"10.1109/icccn.2001.956259","title":"Active error recovery for reliable multicast","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Multicast; Computer science; Retransmission; Reliable multicast; Computer network; Distributed computing; Pragmatic General Multicast; Protocol Independent Multicast; Scheme (mathematics); Source-specific multicast; Xcast","score_opus":0.028193288733657777,"score_gpt":0.2341238906971015,"score_spread":0.2059306019634437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106799982","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00067454216,0.00007456645,0.9705098,0.0036291427,0.00048515166,0.00024065371,0.0000018831086,0.00023738251,0.02414688],"genre_scores_gemma":[0.8535806,0.00001791806,0.10845476,0.0017751972,0.0001866319,0.00009909608,0.0000010613871,0.0000091660095,0.035875548],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932784,0.000011599533,0.00010895289,0.00024463213,0.00008843206,0.00021856996],"domain_scores_gemma":[0.9994085,0.00016055792,0.000032652435,0.00026452064,0.00006701876,0.000066792236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000073337906,0.00007697991,0.0000956612,0.000030816682,0.000090850146,0.00006681131,0.00030888006,0.000040512816,0.00020359344],"category_scores_gemma":[0.000029798428,0.00006570279,0.000062126914,0.00012086399,0.000014620791,0.0003219831,0.00003837689,0.000053457115,0.00025584322],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012074673,0.000053850654,0.0000064727474,0.000002252593,0.000014187249,0.0000017303622,0.00008318968,0.0006928555,0.000024500787,0.04332387,0.052865364,0.90291965],"study_design_scores_gemma":[0.0005550561,0.00009656673,0.00003795403,0.000005259214,0.0000045115958,0.0000037024465,0.000015375796,0.9325182,0.0001099489,0.0013872363,0.06515478,0.000111429734],"about_ca_topic_score_codex":0.0000038786548,"about_ca_topic_score_gemma":0.000005831683,"teacher_disagreement_score":0.93182534,"about_ca_system_score_codex":0.000019936972,"about_ca_system_score_gemma":0.000010236566,"threshold_uncertainty_score":0.32884324},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.007518463221891531,"score_gpt":0.19114798437929945,"score_spread":0.1836295211574079,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106860967","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017496593,0.00016988222,0.9773402,0.0010472488,0.00045285295,0.00020563036,3.4980116e-7,0.0008284805,0.002458722],"genre_scores_gemma":[0.89522326,0.00000634611,0.103278935,0.00082464906,0.00026281975,0.00003025355,0.0000031058673,0.000009074973,0.0003615482],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878234,0.000040316005,0.00020936294,0.0003563957,0.00022925172,0.00038231257],"domain_scores_gemma":[0.99911684,0.00020331753,0.00006864974,0.0003843249,0.00009554297,0.00013132878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002130087,0.00014646965,0.0001325277,0.000077979974,0.00022030553,0.00014167525,0.0005220768,0.00006763558,0.000015919617],"category_scores_gemma":[0.000053444943,0.00013282108,0.0000977466,0.00066324073,0.000038888542,0.00034896372,0.00009363393,0.00011621912,0.00012087291],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011844879,0.0001040995,0.01723792,0.0000033486658,0.000023590683,0.00000864124,0.00014986866,0.2495595,0.000053235915,0.08794156,0.0020281672,0.64287823],"study_design_scores_gemma":[0.0031833774,0.00013101519,0.020533592,0.00003714406,0.0000119181095,0.000025564763,0.000022592638,0.9372542,0.00023152512,0.00920767,0.028895583,0.0004658282],"about_ca_topic_score_codex":0.000047867565,"about_ca_topic_score_gemma":0.00016013309,"teacher_disagreement_score":0.8777267,"about_ca_system_score_codex":0.000029282219,"about_ca_system_score_gemma":0.000047921618,"threshold_uncertainty_score":0.54162866},"labels":[],"label_agreement":null},{"id":"W2106872331","doi":"10.1109/glocom.2001.966251","title":"On layered video fairness on IP networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Computer network; Fairness measure; Multicast; Video quality; Bandwidth (computing); Network congestion; Uncompressed video; Video tracking; Video processing; Telecommunications; Throughput","score_opus":0.014015533957997157,"score_gpt":0.1950068599068391,"score_spread":0.18099132594884196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106872331","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019573057,0.00011216576,0.91432303,0.0043350807,0.0008314091,0.00013828756,2.6680766e-7,0.00052873464,0.077773735],"genre_scores_gemma":[0.9862078,0.000018449742,0.00078779843,0.0052927234,0.00022818899,0.000018409708,4.8131756e-7,0.000007860867,0.00743828],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998891,0.000058741312,0.00015195926,0.00036690466,0.00022952071,0.00030187517],"domain_scores_gemma":[0.9990417,0.00024648255,0.000040756644,0.00052587554,0.000031106872,0.00011411009],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000117682066,0.00014113657,0.00013518194,0.000052220723,0.0001117159,0.00013350522,0.0005771745,0.00007291727,0.00045397793],"category_scores_gemma":[0.000015590878,0.00011276233,0.00006463617,0.00025781788,0.000019747984,0.00014388158,0.000050884333,0.00016905213,0.0010004966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007415199,0.00006757511,0.000014317716,5.7977337e-7,0.000008140308,0.000012531734,0.000028566657,0.053425126,8.651506e-7,0.36644667,0.04973328,0.53025496],"study_design_scores_gemma":[0.0004905072,0.0001616711,0.00022161625,0.000015765896,0.0000021690869,0.000003716944,0.0000030351466,0.9870437,0.000012167453,0.0011017399,0.010784704,0.00015922426],"about_ca_topic_score_codex":0.0000035418655,"about_ca_topic_score_gemma":0.0000065415798,"teacher_disagreement_score":0.9842505,"about_ca_system_score_codex":0.000022338783,"about_ca_system_score_gemma":0.0000053160247,"threshold_uncertainty_score":0.9997773},"labels":[],"label_agreement":null},{"id":"W2106951158","doi":"10.1109/icc.1995.525183","title":"Delay bounds of a dynamic priority queueing scheme: single node case","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Queueing theory; Computer network; Node (physics); Queue; Network packet; Scheme (mathematics); Priority queue; Layered queueing network; Upper and lower bounds; Queuing delay; Process (computing); Real-time computing; Distributed computing; Mathematics","score_opus":0.014452684821030553,"score_gpt":0.22159380420890099,"score_spread":0.20714111938787044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106951158","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25873354,0.0005608914,0.7312976,0.001586525,0.0002665441,0.00011246661,9.2437415e-7,0.00027612835,0.007165408],"genre_scores_gemma":[0.9482058,0.0000090544845,0.050232455,0.00023311871,0.000028972596,0.0000026565835,2.654491e-7,0.0000052985847,0.0012823446],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991096,0.000051763327,0.00019465918,0.00025519592,0.00016137189,0.00022737017],"domain_scores_gemma":[0.9992605,0.00009944479,0.00007277286,0.00040425843,0.00008095797,0.00008211022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017740039,0.000103070255,0.00014700738,0.000054039636,0.00011877299,0.00008015541,0.00032539348,0.000054963155,0.00008961089],"category_scores_gemma":[0.000025411913,0.00009484847,0.00006270013,0.00028319578,0.000047285183,0.00027758398,0.00009081144,0.00012699694,0.000042960426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004456101,0.0002554006,0.0002679027,0.000016954871,0.00003519018,0.00072633754,0.0005269975,0.0003392371,0.00094320875,0.041107077,0.0012795418,0.9544977],"study_design_scores_gemma":[0.00035923385,0.00005196628,0.000046049103,0.000012590629,0.000005858669,0.0005660006,0.000021227877,0.99672866,0.000081236474,0.00014783892,0.0018538244,0.0001255316],"about_ca_topic_score_codex":0.00003909673,"about_ca_topic_score_gemma":0.000104102844,"teacher_disagreement_score":0.9963894,"about_ca_system_score_codex":0.000039641753,"about_ca_system_score_gemma":0.000022124894,"threshold_uncertainty_score":0.3867808},"labels":[],"label_agreement":null},{"id":"W2107076031","doi":"10.1109/ccece.2007.198","title":"The Effects of Adaptive Error Correction on Satellite Optimized TCP","year":2007,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Proxy (statistics); Queue; Bandwidth (computing); Communications satellite; Channel (broadcasting); Throughput; Error detection and correction; Real-time computing; Satellite; Telecommunications; Algorithm; Wireless; Engineering","score_opus":0.007291589767456969,"score_gpt":0.22423742223060142,"score_spread":0.21694583246314444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107076031","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037807776,0.00030357065,0.97638196,0.0003731832,0.0026539313,0.00024830012,5.9299676e-8,0.0001436665,0.016114539],"genre_scores_gemma":[0.9903307,0.00006232843,0.005054911,0.00033352734,0.00007512944,0.000008569519,1.8107843e-7,0.000004061016,0.0041305944],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925035,0.000048205682,0.0001644173,0.00016779061,0.00018230735,0.00018694859],"domain_scores_gemma":[0.997868,0.0016608243,0.00007932068,0.0002661345,0.00007368674,0.00005205398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043766908,0.00008186017,0.000103872575,0.000037150847,0.00011232907,0.000032320135,0.00029808734,0.000038904804,0.000004065962],"category_scores_gemma":[0.00006131998,0.00005036747,0.000059407983,0.00020822969,0.000042015152,0.000079046724,0.000031704934,0.00009465195,0.000034002565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014102951,0.000031127216,0.000012505541,0.0000015640877,0.00001721693,0.0000037373754,0.000099707984,0.0008745418,0.00009359233,0.05764184,0.0012468279,0.9398363],"study_design_scores_gemma":[0.0027446912,0.0013902481,0.0052583287,0.00009661378,0.000024649069,0.000011797912,0.00014847859,0.95609623,0.01759515,0.0009537375,0.015363524,0.00031657954],"about_ca_topic_score_codex":0.000008267832,"about_ca_topic_score_gemma":0.000020065669,"teacher_disagreement_score":0.9865499,"about_ca_system_score_codex":0.000020225365,"about_ca_system_score_gemma":0.000021365115,"threshold_uncertainty_score":0.20539258},"labels":[],"label_agreement":null},{"id":"W2107194169","doi":"10.1109/glocom.2010.5683576","title":"An Analytic Model for the Stream Control Transmission Protocol","year":2010,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Stream Control Transmission Protocol; Multihoming; Computer science; Computer network; Throughput; Transport layer; Session (web analytics); Protocol (science); Transmission (telecommunications); Transmission Control Protocol; Distributed computing; Layer (electronics); Wireless; Telecommunications; Path (computing); Internet Protocol; The Internet","score_opus":0.012267202469072327,"score_gpt":0.2780729555116877,"score_spread":0.2658057530426154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107194169","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010124652,0.0000022228387,0.96610945,0.002982726,0.00007456275,0.030048816,0.0000013317477,0.00018973729,0.00048991945],"genre_scores_gemma":[0.91403234,2.461404e-7,0.031988535,0.00088871823,0.00013155685,0.05202582,5.298675e-7,0.000007184746,0.0009250844],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919957,0.00002267561,0.00015652801,0.00026013848,0.00014750058,0.00021357741],"domain_scores_gemma":[0.9990327,0.0001842405,0.00004104222,0.0005361219,0.00008940813,0.00011652285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032366315,0.00010420187,0.00010561593,0.00002443355,0.00019760542,0.00015575267,0.00080207805,0.000058140628,0.000041834985],"category_scores_gemma":[0.0000081199805,0.00005733219,0.0000805866,0.00009461227,0.00003179151,0.00026408202,0.000010402706,0.00013999213,0.000006988594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043503802,0.00007787235,0.000020358382,0.0000036413555,0.000013121818,3.5130145e-7,0.00007471689,0.04413376,0.00074892363,0.09043143,0.00097476714,0.8634775],"study_design_scores_gemma":[0.0014769663,0.000090957416,0.000048999522,0.000002151971,0.000012863413,0.000001836001,0.0000040445293,0.98700434,0.00007519463,0.0023308583,0.0088594,0.00009236983],"about_ca_topic_score_codex":0.0000050558947,"about_ca_topic_score_gemma":0.000044670483,"teacher_disagreement_score":0.9428706,"about_ca_system_score_codex":0.0000044793787,"about_ca_system_score_gemma":0.00009770189,"threshold_uncertainty_score":0.23379387},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011236341352287562,"score_gpt":0.21985808508701518,"score_spread":0.2086217437347276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107245740","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016698613,0.00020607773,0.9748773,0.0003721021,0.00072685484,0.000114184724,2.4242934e-7,0.00034328198,0.021690102],"genre_scores_gemma":[0.95469356,0.000008252977,0.04226358,0.0011997761,0.00021336546,0.000007831421,0.0000014295204,0.0000063445364,0.0016058628],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898714,0.00009552135,0.00017018673,0.00027376675,0.000175714,0.00029768064],"domain_scores_gemma":[0.99924004,0.00017432735,0.0000372251,0.0003847856,0.00006636867,0.000097279444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002820445,0.00010894202,0.00011264001,0.000024859435,0.00012771484,0.00011478714,0.00027882145,0.00003122534,0.0001820704],"category_scores_gemma":[0.000035163168,0.00009599351,0.000056214627,0.00019997457,0.000015688849,0.00026780216,0.000030288811,0.00007336528,0.00028123567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019898307,0.000012873631,0.00009084134,6.868494e-7,0.0000068790537,0.0000050121293,0.0000120614795,0.59267235,0.0000025920085,0.16771638,0.008499855,0.23097849],"study_design_scores_gemma":[0.00026214303,0.000024347717,0.00008601791,0.000003911133,0.0000033966187,0.0000065212666,0.0000013950554,0.9204407,0.00003544894,0.006608154,0.07240442,0.00012357932],"about_ca_topic_score_codex":0.000001067551,"about_ca_topic_score_gemma":0.0000021897827,"teacher_disagreement_score":0.9530237,"about_ca_system_score_codex":0.000017202172,"about_ca_system_score_gemma":0.000044313485,"threshold_uncertainty_score":0.39145017},"labels":[],"label_agreement":null},{"id":"W2107359877","doi":"10.1109/atm.1998.675186","title":"Effects of internetworking on ATM traffic descriptors","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Internetworking; Datagram; Computer network; Subnetwork; Computer science; ATM adaptation layer; Asynchronous Transfer Mode; Scheduling (production processes); Enhanced Data Rates for GSM Evolution; Network packet; Telecommunications; Engineering; The Internet; Operating system","score_opus":0.010746876631335616,"score_gpt":0.18214965979475867,"score_spread":0.17140278316342306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107359877","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2805084,0.0013075381,0.69150996,0.00088603474,0.0023679235,0.00037362464,1.4024964e-7,0.0007020839,0.022344323],"genre_scores_gemma":[0.9957981,0.000027374519,0.0020064956,0.0004597972,0.00010931977,0.000008852417,9.355078e-8,0.0000057222037,0.0015842391],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919647,0.000051577994,0.0001623087,0.00022313771,0.00016659443,0.00019993412],"domain_scores_gemma":[0.99939054,0.00023136257,0.000055000848,0.00023317587,0.000024701674,0.0000652406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008257623,0.00010418608,0.00014251124,0.000056514007,0.00003520452,0.000039607676,0.0004551806,0.000041870968,0.00005646406],"category_scores_gemma":[0.000013841195,0.000085611704,0.00007235876,0.00021849161,0.000025805979,0.0001092346,0.00004424844,0.000090248766,0.00010703069],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004008582,0.000094217365,0.000041130363,0.000009059045,0.000017920025,0.000010172448,0.00022174456,0.0035330746,0.000040314044,0.034097623,0.0064542526,0.95547646],"study_design_scores_gemma":[0.00055282563,0.00022094189,0.00020179628,0.00007523874,0.000007672725,0.0000038751145,0.0000048243637,0.9928039,0.00065628975,0.00008053344,0.0052575576,0.00013458327],"about_ca_topic_score_codex":0.0000016598325,"about_ca_topic_score_gemma":0.00000249114,"teacher_disagreement_score":0.9892708,"about_ca_system_score_codex":0.000016539278,"about_ca_system_score_gemma":0.0000046004675,"threshold_uncertainty_score":0.3491144},"labels":[],"label_agreement":null},{"id":"W2107423889","doi":"10.1109/ccece.1998.682729","title":"Flow control in high-speed ATM wide area networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Flow control (data); Computer network; Queueing theory; Asynchronous Transfer Mode; Bandwidth (computing); Real-time computing","score_opus":0.010146385196943147,"score_gpt":0.17792942059458827,"score_spread":0.16778303539764514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107423889","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029549422,0.00049780833,0.98211443,0.0062330123,0.0006040179,0.00022075693,6.234903e-7,0.00035090186,0.007023486],"genre_scores_gemma":[0.98788697,0.000046669655,0.004641842,0.0048267148,0.00013946496,0.000016360877,0.0000010999476,0.000008737281,0.0024321561],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985812,0.00008709443,0.00028573928,0.0003924708,0.00020254854,0.0004509561],"domain_scores_gemma":[0.99897933,0.00031855193,0.000054875705,0.00046860194,0.000044117358,0.00013454483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021340985,0.00016966753,0.00025274727,0.000074616066,0.00006871012,0.000132933,0.0006263339,0.00009723857,0.00044369066],"category_scores_gemma":[0.00002510565,0.00014654276,0.0000683107,0.00041440164,0.00003333172,0.00030593813,0.00005795503,0.0002038598,0.00022574616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016548169,0.0001268411,0.0045378706,0.0000016533842,0.00002793472,0.000087752305,0.000095193805,0.4346543,0.0000066533153,0.033924874,0.04010929,0.4864111],"study_design_scores_gemma":[0.0019099452,0.000043539327,0.0019614592,0.000011863599,0.0000047461785,0.0000063053185,0.0000035957446,0.9907652,0.0000017733545,0.00035883277,0.0047478937,0.00018483268],"about_ca_topic_score_codex":0.000028040064,"about_ca_topic_score_gemma":0.00009622225,"teacher_disagreement_score":0.984932,"about_ca_system_score_codex":0.000037862254,"about_ca_system_score_gemma":0.00001091843,"threshold_uncertainty_score":0.597584},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01373783591961571,"score_gpt":0.22643818604133129,"score_spread":0.21270035012171556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107631978","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007990462,0.000101454534,0.9902207,0.0012003949,0.0015935017,0.00046485802,0.0000012970785,0.0008731912,0.0047455393],"genre_scores_gemma":[0.92463,0.000010165436,0.07391005,0.0008000317,0.00037645153,0.000080079626,0.000001822219,0.000015871217,0.00017553882],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980305,0.00013430633,0.00035536048,0.00059360726,0.00039143043,0.0004948104],"domain_scores_gemma":[0.99851924,0.0001746984,0.00008795746,0.00092916295,0.000062965206,0.00022598801],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004033709,0.00025953978,0.00027359877,0.000214815,0.00042906607,0.00026716196,0.00091686886,0.00011437351,0.000005046729],"category_scores_gemma":[0.000005878441,0.00025314264,0.0001375101,0.0009270152,0.000026369427,0.00026901547,0.0000053044523,0.0002965773,0.000105337596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001691792,0.000079373385,0.0000013106958,0.000007220189,0.0000135888595,0.0000035407793,0.00023657382,0.43618682,0.000013656491,0.01693634,0.00017878486,0.54632586],"study_design_scores_gemma":[0.00046843293,0.00019153624,0.000041509516,0.0001621637,0.00003374559,0.000049268183,0.000032283144,0.9954495,0.0000811167,0.0018835631,0.0013008795,0.00030601278],"about_ca_topic_score_codex":0.000003687599,"about_ca_topic_score_gemma":0.000002529903,"teacher_disagreement_score":0.9238309,"about_ca_system_score_codex":0.00013717155,"about_ca_system_score_gemma":0.00005036959,"threshold_uncertainty_score":0.9999921},"labels":[],"label_agreement":null},{"id":"W2107697612","doi":"10.1109/icc.1991.162359","title":"Open loop schemes for network congestion control","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Network congestion; Computer science; Leaky bucket; Loop (graph theory); Open-loop controller; Class (philosophy); Scheme (mathematics); Control theory (sociology); Optimal control; Control (management); Mathematical optimization; Computer network; Closed loop; Mathematics; Control engineering; Engineering; Artificial intelligence","score_opus":0.031884242023607304,"score_gpt":0.24691702535430482,"score_spread":0.21503278333069753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107697612","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019904906,0.0005936228,0.97629786,0.0083173,0.00057958387,0.0008293799,0.0000016749951,0.0002914716,0.012890037],"genre_scores_gemma":[0.92624295,0.000031705407,0.05331593,0.0052276407,0.00052536983,0.00028811218,0.0000025003983,0.000012606999,0.014353216],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988352,0.00005342389,0.00022240276,0.0003808507,0.00013275219,0.00037534194],"domain_scores_gemma":[0.9989516,0.00030602884,0.00007990338,0.00041653277,0.00012861569,0.00011730917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035656407,0.00013550391,0.00021209488,0.000025953559,0.00020507009,0.00045431047,0.0011809387,0.00007021154,0.00025867557],"category_scores_gemma":[0.00004355172,0.00011747386,0.00007039371,0.00020393611,0.000030262212,0.0005748547,0.00015179132,0.00007817506,0.00017864951],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013305781,0.000035304092,0.00013151551,0.000002117319,0.000025872025,0.0000015183672,0.000013325925,0.0018048729,0.0000059321733,0.39013693,0.08743676,0.52039254],"study_design_scores_gemma":[0.0019772742,0.00009659652,0.000088048895,0.000010757257,0.000011513975,0.000004967073,0.0000027866442,0.7827058,0.000009153396,0.0026182511,0.21231538,0.00015951127],"about_ca_topic_score_codex":0.0000047940553,"about_ca_topic_score_gemma":0.000011086062,"teacher_disagreement_score":0.92604387,"about_ca_system_score_codex":0.00001833289,"about_ca_system_score_gemma":0.000021868947,"threshold_uncertainty_score":0.4790445},"labels":[],"label_agreement":null},{"id":"W2107727130","doi":"10.1109/icc.2011.5962532","title":"Controlling Retransmission Rate for Mitigating SIP Overload","year":2011,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Retransmission; Server; Computer science; Computer network; Reliability (semiconductor); Network packet","score_opus":0.02907513930880634,"score_gpt":0.22370744301147386,"score_spread":0.19463230370266751,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107727130","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004389343,0.00012837492,0.98408103,0.0005437669,0.00033887327,0.00026133895,7.1544144e-7,0.00029337732,0.009963151],"genre_scores_gemma":[0.8926946,0.000007134129,0.1052582,0.0008896096,0.000105920924,0.00003306898,7.6817645e-7,0.000006850564,0.0010038594],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991214,0.000043633,0.00020585688,0.0002746339,0.000094348405,0.00026011048],"domain_scores_gemma":[0.99930257,0.00021213343,0.00006307162,0.00023254861,0.00008704101,0.00010266547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040402316,0.00010388925,0.0001403283,0.00003117816,0.00014523805,0.00006407202,0.00036072003,0.000054919554,0.000057171477],"category_scores_gemma":[0.000038636696,0.00008430771,0.00008848091,0.00011080504,0.00002022401,0.00026475108,0.000023938932,0.00007255366,0.000021686574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006710923,0.000039971666,0.00015422865,0.000012583462,0.00002880428,0.0000055560845,0.00059885863,0.00018512266,0.0025383774,0.30937317,0.0012902828,0.68570596],"study_design_scores_gemma":[0.0015632415,0.00012237433,0.00025318938,0.000036272544,0.0000113370315,0.0000030209164,0.000028180497,0.98007196,0.0035390747,0.010188247,0.003988935,0.00019418652],"about_ca_topic_score_codex":0.000009289873,"about_ca_topic_score_gemma":0.0000033896993,"teacher_disagreement_score":0.97988683,"about_ca_system_score_codex":0.0000097603415,"about_ca_system_score_gemma":0.000036544494,"threshold_uncertainty_score":0.34379685},"labels":[],"label_agreement":null},{"id":"W2107774322","doi":"10.1109/ccece.2005.1556901","title":"Efficient congestion control for streaming MPEG-4 video over unreliable IP networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Computer network; Network congestion; Real-time computing; Bandwidth (computing); Scalability; TCP Friendly Rate Control; Throughput; Quality of service; The Internet; Network packet; Wireless; Telecommunications","score_opus":0.004836303477705721,"score_gpt":0.20285161711078256,"score_spread":0.19801531363307684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107774322","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007998977,0.00044413397,0.98564535,0.0010958163,0.0010652676,0.0006341129,0.0000042343413,0.00049280294,0.002619303],"genre_scores_gemma":[0.9883685,0.000004078865,0.007932086,0.00083095557,0.0005858873,0.00013495413,0.000009532721,0.000016625143,0.0021173789],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822783,0.00005806047,0.0003690018,0.0005225749,0.00025656098,0.0005659421],"domain_scores_gemma":[0.99854434,0.0006383386,0.00013118304,0.00043034842,0.0001468115,0.00010897089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043148626,0.00022263646,0.0002628583,0.00007793692,0.00024000694,0.00024223566,0.0004447263,0.00012779434,0.000040298146],"category_scores_gemma":[0.000031855816,0.00019727735,0.00013492574,0.00025118107,0.000043852764,0.00014998206,0.000050795214,0.00012820975,0.000026176967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028654838,0.000070142414,0.00030930378,0.0000038869625,0.000016353384,0.0000027921064,0.0000065769987,0.7329509,0.000035377616,0.19549316,0.010077412,0.061005387],"study_design_scores_gemma":[0.0024319538,0.00009095325,0.0024948367,0.000025478334,0.000027199521,0.00000490905,0.0000051731104,0.9847472,0.00002500772,0.0010236417,0.008873084,0.00025061006],"about_ca_topic_score_codex":0.000098642624,"about_ca_topic_score_gemma":0.000051354556,"teacher_disagreement_score":0.9803695,"about_ca_system_score_codex":0.00006714813,"about_ca_system_score_gemma":0.00005208281,"threshold_uncertainty_score":0.8044737},"labels":[],"label_agreement":null},{"id":"W2107855621","doi":"10.1109/dnsr.2004.1344748","title":"Provision of QoS in wireless networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer network; Computer science; Roaming; Quality of service; Wireless network; Wi-Fi array; Wireless WAN; Mobile QoS; Bluetooth; Wireless Application Protocol; Heterogeneous network; Wireless; Telecommunications; Service (business); Service provider","score_opus":0.004635778359549636,"score_gpt":0.19737764330288124,"score_spread":0.1927418649433316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107855621","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051090598,0.000059627553,0.9452558,0.0007018393,0.00030759105,0.000112034555,5.1846182e-8,0.00007205633,0.0024004108],"genre_scores_gemma":[0.9946805,0.000012504006,0.0049396846,0.00018124594,0.00007614115,0.00000630714,2.7230436e-7,0.0000024017552,0.00010094581],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942446,0.000017691653,0.00015992236,0.0001541515,0.00010514619,0.00013865612],"domain_scores_gemma":[0.9996679,0.000030710282,0.000037473525,0.00020470271,0.000024988562,0.00003424222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012727967,0.000055350916,0.00010018832,0.000044345623,0.000015676233,0.00001834143,0.0003147166,0.000039259274,0.0000065670274],"category_scores_gemma":[0.000003542631,0.00004564662,0.00002578879,0.00027435928,0.000017318069,0.000147038,0.000054030093,0.00007002886,0.000008060882],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063067696,0.000068738016,0.0006635942,0.0000027350118,0.000002598484,0.0000071874947,0.000077223965,0.078425564,0.000058261812,0.3713547,0.00015315581,0.54918],"study_design_scores_gemma":[0.0013725138,0.0000982121,0.0033946047,0.000056453475,0.000001647235,0.0000044637964,0.0000143786765,0.99242604,0.00039109445,0.0017204433,0.00038836646,0.00013175677],"about_ca_topic_score_codex":0.00003543074,"about_ca_topic_score_gemma":0.00005808955,"teacher_disagreement_score":0.9435899,"about_ca_system_score_codex":0.000017110237,"about_ca_system_score_gemma":0.00003904423,"threshold_uncertainty_score":0.1861415},"labels":[],"label_agreement":null},{"id":"W2108097340","doi":"10.1109/icc.2007.90","title":"Resource Optimization to Provision a Virtual Private Network Using the Hose Model","year":2007,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Provisioning; Computer science; Private network; Computer network; Scalability; Bandwidth (computing); Quality of service; Distributed computing; Database","score_opus":0.015052510914798286,"score_gpt":0.24314701343229794,"score_spread":0.22809450251749966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108097340","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071612233,0.000031208252,0.98920995,0.0015576624,0.00014789456,0.00033391037,1.4076997e-7,0.00022077597,0.0013372389],"genre_scores_gemma":[0.5940454,0.0000019664715,0.4016114,0.00330929,0.0002648209,0.0000056625718,7.4679326e-7,0.000009805725,0.00075090915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882954,0.000048627186,0.00021589258,0.00029195118,0.00026186422,0.00035214212],"domain_scores_gemma":[0.99920976,0.0001102311,0.000060536397,0.00044035076,0.00006290479,0.00011618716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082930404,0.00011185605,0.00009423457,0.000044978275,0.0002766953,0.00016175573,0.0005975728,0.000051221043,0.000005734542],"category_scores_gemma":[0.000022397766,0.00007557427,0.00003863437,0.0005442435,0.000020793152,0.00021466399,0.00022437566,0.000105520485,0.00001096622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017982187,0.000010240038,0.000010741926,3.403372e-7,0.0000033014664,0.0000014917495,0.00016129334,0.8181916,0.000023961615,0.05566775,0.0010364144,0.124874905],"study_design_scores_gemma":[0.00017575473,0.000049906925,0.000017399143,0.000013548153,0.000004496412,0.000004201917,0.00001934739,0.9965072,0.000025298103,0.00025254543,0.0028169358,0.00011334034],"about_ca_topic_score_codex":0.0000035519013,"about_ca_topic_score_gemma":0.00000588585,"teacher_disagreement_score":0.58759856,"about_ca_system_score_codex":0.000036660527,"about_ca_system_score_gemma":0.000044160126,"threshold_uncertainty_score":0.30818292},"labels":[],"label_agreement":null},{"id":"W2108112270","doi":"10.1109/wcnc.2005.1424775","title":"Latency analysis of WAP 2.0 for short-lived flows","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Latency (audio); Computer science; Network packet; File transfer; Wireless Application Protocol; Wireless; Markov chain; Computer network; Markov process; Channel (broadcasting); Transfer (computing); Real-time computing; Wireless network; Parallel computing; Mathematics; Telecommunications","score_opus":0.02105936145026543,"score_gpt":0.25882841814505486,"score_spread":0.23776905669478943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108112270","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040801957,0.000104045954,0.9545572,0.0012353429,0.000083307554,0.00012291895,0.0000014031135,0.00010324761,0.0029905937],"genre_scores_gemma":[0.9399535,0.000009745165,0.058556337,0.00027589264,0.00006705239,0.000017795319,0.0000029646783,0.0000025815186,0.0011141341],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992988,0.000015974252,0.00021164602,0.00020256326,0.00011634595,0.00015464124],"domain_scores_gemma":[0.9994083,0.000103807404,0.000034112916,0.00030097715,0.00010020461,0.000052572537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016176696,0.000069300855,0.00019598442,0.00012693857,0.000037318656,0.000024672481,0.0003789218,0.00003456834,0.000093437506],"category_scores_gemma":[0.0000093091485,0.000056427834,0.00017849727,0.0005244837,0.0000112613025,0.00013599638,0.00003393327,0.00002953779,0.00001144097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007824865,0.000058597947,0.0005707604,0.0000022165887,0.00037672766,4.211721e-7,0.00017193607,0.034975518,0.0001817583,0.042161915,0.0014629797,0.92002934],"study_design_scores_gemma":[0.00016970969,0.000030415791,0.0012936421,0.000001538315,0.00014956757,2.3317095e-7,0.0000074647105,0.9925006,0.00014710287,0.00013158952,0.005494201,0.00007393737],"about_ca_topic_score_codex":0.0000057706793,"about_ca_topic_score_gemma":0.000103607556,"teacher_disagreement_score":0.9575251,"about_ca_system_score_codex":0.000010189101,"about_ca_system_score_gemma":0.000023292834,"threshold_uncertainty_score":0.23010604},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Algorithm; Environmentally friendly; Computer network; Distributed computing","score_opus":0.013726833710300068,"score_gpt":0.2554394679309254,"score_spread":0.24171263422062536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108169811","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032598318,0.00006776533,0.9946141,0.0004938761,0.0003882642,0.00067766686,0.000097787946,0.00023186523,0.00016878854],"genre_scores_gemma":[0.7474286,0.00006654397,0.25106508,0.00012876085,0.00014149248,0.00068119756,0.000014028096,0.000014238454,0.00046008086],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983001,0.000038334234,0.00047430847,0.0005006354,0.0003296561,0.00035700345],"domain_scores_gemma":[0.9982151,0.00052919704,0.00015962105,0.0006782446,0.00023777739,0.00018008993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002364579,0.00021971314,0.00037514052,0.00051370286,0.00022610584,0.000037417733,0.00065565936,0.00012380687,0.00007499569],"category_scores_gemma":[0.000005710591,0.00021597835,0.00034443664,0.0013702902,0.000103238955,0.00036680646,0.0000026010707,0.00019501998,0.00008715916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022168428,0.00025554156,0.00002040372,0.000007359674,0.00030915192,2.0395001e-7,0.00028562543,0.16700992,0.00022760058,0.00006695605,0.00012268001,0.8316724],"study_design_scores_gemma":[0.0009987765,0.000120580495,0.00038366445,0.000008954966,0.00042240723,0.0000013135001,0.00001915513,0.9871463,0.00385486,0.0000054405864,0.006820732,0.00021777545],"about_ca_topic_score_codex":0.000011018563,"about_ca_topic_score_gemma":0.00006385606,"teacher_disagreement_score":0.83145463,"about_ca_system_score_codex":0.000061857405,"about_ca_system_score_gemma":0.000083979896,"threshold_uncertainty_score":0.88073415},"labels":[],"label_agreement":null},{"id":"W2108342182","doi":"10.1109/icc.1998.685179","title":"Connection admission control in a cellular wireless ATM access network","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Handover; Computer science; Computer network; Admission control; Call Admission Control; Wireless network; Quality of service; Base station; Homogeneous; Asynchronous Transfer Mode; Connection (principal bundle); Wireless; Cellular network; Tree (set theory); Telecommunications; Engineering","score_opus":0.017092601776459333,"score_gpt":0.22225693662718465,"score_spread":0.20516433485072533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108342182","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017612737,0.00055970735,0.96725523,0.004486304,0.00065262016,0.00033267506,3.9972994e-7,0.00038710775,0.008713238],"genre_scores_gemma":[0.9955968,0.000037773963,0.0007130911,0.0020866608,0.00029692618,0.000037656508,0.0000012890121,0.000008538816,0.0012212419],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856937,0.00014306372,0.00027744073,0.0003996367,0.00021117135,0.00039933668],"domain_scores_gemma":[0.99919283,0.00016922901,0.000078729216,0.00036465918,0.00004588065,0.0001486806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027999262,0.00015186997,0.00021516567,0.00007039626,0.000117641444,0.00021359393,0.0006871163,0.000098251076,0.0004028034],"category_scores_gemma":[0.000013273038,0.00013301625,0.000063045234,0.0005795521,0.000020845962,0.00057246047,0.00008878264,0.00017378735,0.00014955815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038472248,0.00020206493,0.0042404593,0.000009017062,0.000025749381,0.00006116532,0.00011786624,0.030513156,0.00031279543,0.09358379,0.05185505,0.8190404],"study_design_scores_gemma":[0.0014660407,0.00005107478,0.0003511986,0.000029439596,0.0000043259656,0.0000050358476,0.0000062534164,0.97895163,0.00007100292,0.00056340423,0.018317742,0.00018282532],"about_ca_topic_score_codex":0.000022267635,"about_ca_topic_score_gemma":0.000038448656,"teacher_disagreement_score":0.9779841,"about_ca_system_score_codex":0.000041731506,"about_ca_system_score_gemma":0.000020926926,"threshold_uncertainty_score":0.5424245},"labels":[],"label_agreement":null},{"id":"W2108345119","doi":"10.1142/s1793962311500048","title":"ANALYTICAL MODELS BASED DISCRETE-TIME QUEUEING FOR THE CONGESTED NETWORK","year":2011,"lang":"en","type":"article","venue":"Advances in Complex Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Laurentian University","funders":"","keywords":"Queueing theory; Computer science; Random early detection; Network packet; Queue; Network congestion; Layered queueing network; Active queue management; Quality of service; Throughput; Computer network; Real-time computing; Bulk queue; Drop (telecommunication); Telecommunications; Wireless","score_opus":0.05704477389667452,"score_gpt":0.27258108790058305,"score_spread":0.21553631400390855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108345119","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014254184,0.0070895148,0.98638785,0.00024663398,0.0008948011,0.0007684272,0.0000046265404,0.0001495258,0.0043160883],"genre_scores_gemma":[0.9895161,0.000032638367,0.0093520535,0.0002707402,0.00039581535,0.00026625558,0.000005003781,0.000015688918,0.00014572934],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817824,0.00019085556,0.00044891026,0.0003783276,0.00023462599,0.0005690091],"domain_scores_gemma":[0.9978502,0.0012017132,0.00015570759,0.0005962664,0.00009299831,0.00010314836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007550969,0.00019730121,0.00034552463,0.000050923685,0.00019855343,0.00009388165,0.000987715,0.0000625919,0.000018112163],"category_scores_gemma":[0.000025156003,0.00014046369,0.00009956625,0.00040718887,0.00012357545,0.00069307466,0.000082764804,0.00013469504,0.00001886298],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044118664,0.000032379485,0.00053452776,0.000021836295,0.00002436563,0.000003547631,0.00018403787,0.6408886,0.000001510027,0.33711717,0.00058762357,0.020560296],"study_design_scores_gemma":[0.0005538425,0.000054560518,0.00028797446,0.000062173116,0.000017185726,0.0000055162836,0.00004754903,0.97846764,0.0000010050527,0.0028932095,0.017416501,0.00019282482],"about_ca_topic_score_codex":0.000040533258,"about_ca_topic_score_gemma":0.000047593203,"teacher_disagreement_score":0.9893735,"about_ca_system_score_codex":0.000044886576,"about_ca_system_score_gemma":0.000045843357,"threshold_uncertainty_score":0.5727943},"labels":[],"label_agreement":null},{"id":"W2108473042","doi":"10.1109/cnsr.2009.19","title":"Workload Characterization of a Large Systems Conference Web Server","year":2009,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Workload; Computer science; Web server; World Wide Web; Web application; Server; Database; The Internet; Operating system","score_opus":0.010157170299424954,"score_gpt":0.21435336243149697,"score_spread":0.20419619213207202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108473042","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12670767,0.00007777353,0.8651513,0.0012616679,0.0003727361,0.00018430711,0.0000036721733,0.00023018735,0.0060107065],"genre_scores_gemma":[0.997496,0.000026446776,0.00040215146,0.00044460694,0.00005777871,0.0000048853444,0.0000036783758,0.0000019335746,0.0015625384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992601,0.00004443677,0.00019619615,0.0001743748,0.00016061003,0.0001642646],"domain_scores_gemma":[0.99943674,0.000017348002,0.00008962997,0.00027843963,0.00012586519,0.000052000792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015687919,0.00007735636,0.00013898851,0.000040964154,0.000034668934,0.00008286089,0.00034892446,0.000045801436,0.000059992348],"category_scores_gemma":[0.0000044459744,0.00006576787,0.00003215772,0.00023007853,0.000008493032,0.00029307252,0.000027292674,0.000050498842,0.000030454792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009682853,0.00011702967,0.0003611316,0.000009717552,0.000012765675,0.000004238294,0.00011429088,0.00010807321,0.009532546,0.7453908,0.00045296014,0.24388677],"study_design_scores_gemma":[0.0004982307,0.00009633612,0.009146809,0.00008691415,0.0000058674345,0.000005800074,0.00001344086,0.9846284,0.0004206722,0.00023507906,0.0047013364,0.00016112205],"about_ca_topic_score_codex":0.000002249391,"about_ca_topic_score_gemma":0.0000026411517,"teacher_disagreement_score":0.9845203,"about_ca_system_score_codex":0.000007988676,"about_ca_system_score_gemma":0.000053885535,"threshold_uncertainty_score":0.26819357},"labels":[],"label_agreement":null},{"id":"W2108588409","doi":"10.1109/iscc.2000.860660","title":"Performance evaluation of per-hop forwarding behavior in the Diffserv Internet","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer network; Computer science; The Internet; Packet forwarding; Network packet; Differentiated services; IP forwarding; Hop (telecommunications); Virtual routing and forwarding; Quality of service; Routing protocol; World Wide Web; Routing table","score_opus":0.0455618762771609,"score_gpt":0.25882758048565996,"score_spread":0.21326570420849905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108588409","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9676517,0.00013662469,0.022892086,0.0005627257,0.00014997684,0.00023731372,1.2714587e-7,0.000031117426,0.008338332],"genre_scores_gemma":[0.9988704,0.000015685404,0.00059034297,0.00013513376,0.00002927546,0.000066715234,3.8084096e-7,0.0000020520156,0.00029005457],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910295,0.00010191402,0.00016688315,0.00013555211,0.0003758668,0.00011682898],"domain_scores_gemma":[0.99954575,0.000060186343,0.000046608682,0.00025093515,0.000080908634,0.000015627404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000775871,0.0000589089,0.00007582339,0.000052971543,0.00002765423,0.000036562986,0.00049309933,0.000025380572,0.00018195414],"category_scores_gemma":[0.0000122061065,0.00003880808,0.0000367435,0.00018786163,0.000017050472,0.00024063345,0.00004106254,0.00007326405,0.000030608535],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017381335,0.00007796631,0.018936401,0.0000021456758,0.0000031819577,5.765124e-7,0.0011331846,0.0008554048,0.000025857917,0.003797392,0.00061962276,0.97454655],"study_design_scores_gemma":[0.00034790183,0.000047205813,0.031631406,0.000009153867,0.000012348244,0.000004573195,0.00007459489,0.96751547,0.00003820974,0.00002288934,0.00024671198,0.000049559472],"about_ca_topic_score_codex":0.000009433748,"about_ca_topic_score_gemma":0.000023068502,"teacher_disagreement_score":0.97449696,"about_ca_system_score_codex":0.000020814983,"about_ca_system_score_gemma":0.000007933212,"threshold_uncertainty_score":0.19922702},"labels":[],"label_agreement":null},{"id":"W2108772417","doi":"10.1109/ccece.1999.807197","title":"End-to-end TCP performance in Ethernet/ATM networks","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Computer network; Computer science; TCP Friendly Rate Control; TCP global synchronization; TCP acceleration; Flow control (data); TCP tuning; Network congestion; Network packet","score_opus":0.009113901932873494,"score_gpt":0.20651993206957914,"score_spread":0.19740603013670566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108772417","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04037793,0.0003063311,0.8828121,0.0011199813,0.0006798071,0.00022677761,1.6814268e-7,0.00023303227,0.074243896],"genre_scores_gemma":[0.9847647,0.000038215006,0.008954139,0.0020689056,0.00007980666,0.000027839737,4.1886165e-7,0.0000078462035,0.0040581445],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987349,0.00009267599,0.00021871191,0.00035217116,0.00018965265,0.0004118842],"domain_scores_gemma":[0.99928474,0.000103032406,0.000034759563,0.0004049714,0.000032913857,0.00013959507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004462556,0.00013746475,0.0001535053,0.0000787671,0.00006347758,0.00009124569,0.0005137009,0.00007101919,0.0002831916],"category_scores_gemma":[0.00001695389,0.00012024,0.000038743736,0.00056459726,0.00002219941,0.00023884208,0.000059022183,0.00019282998,0.00026434887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007429992,0.00004841378,0.0073715686,0.0000022352046,0.0000078389,0.0000117427535,0.00018144464,0.09728731,0.0000063031894,0.1666675,0.0020708414,0.7263374],"study_design_scores_gemma":[0.0005472846,0.0000832634,0.008677189,0.00001910618,0.0000023284103,0.000013811939,0.000015833637,0.90259016,0.000057092962,0.00022506028,0.08751712,0.00025174546],"about_ca_topic_score_codex":0.000013186078,"about_ca_topic_score_gemma":0.000088410416,"teacher_disagreement_score":0.9443868,"about_ca_system_score_codex":0.00003460349,"about_ca_system_score_gemma":0.0000519146,"threshold_uncertainty_score":0.4903245},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01242480548305661,"score_gpt":0.21532640322836252,"score_spread":0.20290159774530592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108863067","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87137336,0.000075453034,0.11887971,0.00040436548,0.0001279301,0.000049976494,3.3981415e-8,0.00006819506,0.009020964],"genre_scores_gemma":[0.99715835,0.000002987794,0.0020941403,0.0003364005,0.000054283606,0.0000011871131,6.922806e-8,0.000001760059,0.00035082726],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994813,0.00001568154,0.0001251859,0.00009502724,0.00013831953,0.00014444196],"domain_scores_gemma":[0.99953425,0.000111618494,0.000037179965,0.00025893457,0.000030146093,0.000027897362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039186384,0.00005029125,0.000070753675,0.000025995747,0.00006226437,0.000020949617,0.0005171673,0.000015181117,0.000013221141],"category_scores_gemma":[0.0000035813055,0.000029017723,0.000030039379,0.00015575845,0.00003671271,0.000046564463,0.00007615578,0.00007798185,0.00001311431],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033927365,0.000048273454,0.08290216,0.000016430751,0.000035068348,0.0000030941126,0.00058959995,0.032717586,0.00047175164,0.1797044,0.001033796,0.7024439],"study_design_scores_gemma":[0.00024196204,0.00003768357,0.07710365,0.000009836554,0.0000027178978,0.000008334359,0.000013358838,0.9187029,0.0013832545,0.000107239764,0.0023208756,0.00006818692],"about_ca_topic_score_codex":0.0000063387156,"about_ca_topic_score_gemma":0.00006616371,"teacher_disagreement_score":0.8859853,"about_ca_system_score_codex":0.000004426437,"about_ca_system_score_gemma":0.000018676199,"threshold_uncertainty_score":0.118330844},"labels":[],"label_agreement":null},{"id":"W2109443383","doi":"10.1109/glocom.1996.594444","title":"Performance evaluation of connection admission control techniques in ATM networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Asynchronous Transfer Mode; Quality of service; Computer network; Call Admission Control; Computer science; Admission control; Adaptation (eye); ATM adaptation layer; Asynchronous communication; Telecommunications; Wireless network; Wireless","score_opus":0.021042632776949895,"score_gpt":0.24217766604862687,"score_spread":0.22113503327167697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109443383","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1261138,0.00057269103,0.8570483,0.0008491274,0.0002995863,0.00061920076,1.9806588e-7,0.0002817103,0.014215429],"genre_scores_gemma":[0.9977847,0.00009280072,0.0016904557,0.00016831978,0.000062855695,0.000052845175,5.7260064e-7,0.0000037350228,0.00014372375],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891555,0.00014712129,0.0002620367,0.00020284882,0.0003142489,0.00015818536],"domain_scores_gemma":[0.9993717,0.00008016983,0.0000959859,0.00023943621,0.0001681794,0.000044522854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094753393,0.000085650994,0.00013929419,0.000092634415,0.00004228659,0.000021692475,0.00022418608,0.000075324475,0.00017813219],"category_scores_gemma":[0.000037012305,0.00007381766,0.000033478405,0.00032998994,0.000018438266,0.0003342725,0.000021850352,0.000096629796,0.000009359463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008402828,0.000048859085,0.0026135019,0.0000021063597,0.000004064706,3.3763857e-7,0.000038413884,0.028046282,0.00007275896,0.002054607,0.0004923443,0.9666183],"study_design_scores_gemma":[0.0008783834,0.00010384494,0.0042389277,0.000036536716,0.000008773157,0.0000032957541,0.0000052375017,0.9938289,0.0003752687,0.00007417826,0.00036208218,0.000084589956],"about_ca_topic_score_codex":0.000008124072,"about_ca_topic_score_gemma":0.0000116686415,"teacher_disagreement_score":0.9665337,"about_ca_system_score_codex":0.00004961166,"about_ca_system_score_gemma":0.000019596002,"threshold_uncertainty_score":0.30101967},"labels":[],"label_agreement":null},{"id":"W2109617164","doi":"10.1109/glocom.1995.500367","title":"A new congestion control scheme for hybrid ATM/TDMA networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer network; Computer science; Network congestion; Asynchronous Transfer Mode; Queueing theory; Flow control (data); Multiplexer; Node (physics); Buffer overflow; Leaky bucket; Time division multiple access; Queue; Multiplexing; Real-time computing; Quality of service; Telecommunications; Engineering; Network packet","score_opus":0.01305830220115602,"score_gpt":0.19994028961048418,"score_spread":0.18688198740932815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109617164","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022681334,0.00090762135,0.9872237,0.0069423914,0.0007776114,0.00053051993,0.0000017882203,0.00055910647,0.0028304872],"genre_scores_gemma":[0.9178367,0.000043374894,0.06821044,0.003047005,0.0008454862,0.00009114775,0.000003338141,0.00001615651,0.0099063385],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859184,0.000044535245,0.00027759603,0.00044937528,0.00017506685,0.00046156454],"domain_scores_gemma":[0.9987917,0.0003075922,0.00009234331,0.00045066836,0.00010944615,0.00024824688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020757751,0.00019338503,0.0002416065,0.000050692528,0.00015181999,0.00020862676,0.00057971757,0.00007870138,0.00028757352],"category_scores_gemma":[0.000042546784,0.0001746852,0.00013604987,0.00018991911,0.000025529804,0.00037414223,0.000043577165,0.00013288988,0.00015477368],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020033207,0.00003449606,0.000102161146,0.0000024813837,0.000038095954,0.000005758195,0.000018706765,0.006300661,0.000014719306,0.11018699,0.14245431,0.7408216],"study_design_scores_gemma":[0.002578783,0.00012812825,0.00009695458,0.000011139913,0.000015791713,0.000022106686,0.0000020972388,0.9462712,0.00001498512,0.00083483127,0.049806025,0.00021795431],"about_ca_topic_score_codex":0.000010162584,"about_ca_topic_score_gemma":0.000008981226,"teacher_disagreement_score":0.93997055,"about_ca_system_score_codex":0.000032053296,"about_ca_system_score_gemma":0.000029593388,"threshold_uncertainty_score":0.7123456},"labels":[],"label_agreement":null},{"id":"W2109865852","doi":"10.1109/mascot.2000.876427","title":"Towards a rate-based TCP protocol for the Web","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Lawrence Berkeley National Laboratory","keywords":"Computer network; TCP global synchronization; TCP Friendly Rate Control; Computer science; TCP acceleration; CUBIC TCP; Compound TCP; TCP tuning; Zeta-TCP; TCP Westwood; TCP Vegas; TCP delayed acknowledgment; TCP Westwood plus; Packet loss; Transmission Control Protocol; Network packet","score_opus":0.04175250164941926,"score_gpt":0.2726875923805101,"score_spread":0.23093509073109084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109865852","genre_codex":"methods","genre_gemma":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000003952437,0.000008066514,0.90293556,0.01945657,0.00011321718,0.06725561,5.921137e-7,0.0002518601,0.009974593],"genre_scores_gemma":[0.15504311,8.4307953e-7,0.02191555,0.008911935,0.00030455165,0.80464226,2.8113678e-7,0.000011584312,0.009169867],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993133,0.000040950617,0.00012660272,0.00019743049,0.000121063415,0.00020064681],"domain_scores_gemma":[0.9992124,0.00025768488,0.00003705735,0.00036880068,0.00007293271,0.00005114231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025265577,0.00008715141,0.00007844586,0.00002126607,0.00014411772,0.00015361025,0.0006254654,0.000031361596,0.0005442599],"category_scores_gemma":[0.000024053581,0.000048965238,0.000074314914,0.00017147818,0.00002705537,0.000100977595,0.000032687472,0.000058016605,0.000102665676],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014783266,0.000052779607,0.0000063713983,0.0000059750605,0.000008734881,0.0000011793986,0.00003557451,0.0010782382,0.000009128386,0.05824413,0.10437728,0.83616585],"study_design_scores_gemma":[0.0010417362,0.000056322653,0.00002637799,0.0000028537984,0.000001981604,7.060893e-7,0.0000024152132,0.69374985,0.00006713885,0.0001937298,0.30479905,0.000057827205],"about_ca_topic_score_codex":0.0000023931382,"about_ca_topic_score_gemma":0.00000799009,"teacher_disagreement_score":0.88102,"about_ca_system_score_codex":0.000011073182,"about_ca_system_score_gemma":0.000056543446,"threshold_uncertainty_score":0.59592646},"labels":[],"label_agreement":null},{"id":"W2110115565","doi":"10.1109/glocom.2007.469","title":"Hierarchical Provisioning Algorithm for Virtual Private Networks Using the Hose Model","year":2007,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Private network; Computer science; Scalability; Provisioning; Computer network; Distributed computing; Bandwidth (computing); Tree (set theory); Operating system; Mathematics","score_opus":0.018324767055686135,"score_gpt":0.2637637161636375,"score_spread":0.24543894910795133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110115565","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025962286,0.00007576299,0.9954561,0.0006420215,0.00038920323,0.0003962827,5.7095247e-7,0.0002072993,0.00023651162],"genre_scores_gemma":[0.4586699,0.0000036930903,0.5393633,0.0011537247,0.00037634934,0.000014224474,0.0000010579499,0.00001076963,0.00040696294],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986702,0.000034808523,0.0002581736,0.00033461457,0.00022174214,0.0004804684],"domain_scores_gemma":[0.99895144,0.00041729352,0.000066861474,0.00036988602,0.000077195764,0.00011735124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096510875,0.00013737974,0.00013260164,0.000044395594,0.00039450557,0.00018284003,0.00069771707,0.00008030897,0.0000026283838],"category_scores_gemma":[0.000020628531,0.00008885653,0.00009026523,0.00023541287,0.00006384304,0.00024117142,0.00018502465,0.00021769691,0.0000022245945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071872423,0.000014530778,0.0000042346696,3.7384714e-7,0.000007509083,0.0000017349671,0.000058427497,0.21625148,0.00001442904,0.12856747,0.00014612821,0.6549265],"study_design_scores_gemma":[0.0004203322,0.00006372429,0.000018465891,0.0000096725535,0.0000074888517,0.000009733895,0.000013886308,0.9961558,0.000029475754,0.0022420317,0.0008919941,0.000137367],"about_ca_topic_score_codex":0.0000026030057,"about_ca_topic_score_gemma":0.0000033113017,"teacher_disagreement_score":0.77990437,"about_ca_system_score_codex":0.000029204632,"about_ca_system_score_gemma":0.00007191568,"threshold_uncertainty_score":0.36234638},"labels":[],"label_agreement":null},{"id":"W2110635842","doi":"10.1109/hpsr.2014.6900892","title":"Big file protocol (BFP): A traffic shaping approach for efficient transport of large files","year":2014,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Goodput; Computer science; Computer network; Transport layer; Database transaction; File transfer; Reservation; Bandwidth (computing); Protocol (science); Distributed computing; Wireless; Database; Throughput; Operating system; Layer (electronics); Transfer (computing)","score_opus":0.021470088337462404,"score_gpt":0.24726812723241876,"score_spread":0.22579803889495637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110635842","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007857868,0.000005871283,0.9715295,0.00011331441,0.00007980532,0.023426345,0.0000403834,0.0002497573,0.0037692792],"genre_scores_gemma":[0.82028055,1.8020913e-7,0.09820346,0.0002828701,0.0001845664,0.080286816,0.000035836336,0.000016853577,0.0007088877],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985381,0.00004908665,0.0003648636,0.0004251943,0.00024514797,0.0003776484],"domain_scores_gemma":[0.9990736,0.00019777459,0.00012127684,0.0004026875,0.00010830412,0.000096324635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052818557,0.0001635031,0.00027326783,0.00008240106,0.00011296837,0.00003366021,0.00060913275,0.000076388176,0.0001612439],"category_scores_gemma":[0.000026439013,0.00013216908,0.00016796283,0.0002647146,0.00003749815,0.00006835891,0.000034012017,0.000080851016,0.0000071463114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007855779,0.0008019074,0.000029895251,0.0002598601,0.000040029536,8.165914e-7,0.00052523706,0.09949253,0.00008316389,0.08374091,0.010168344,0.80477875],"study_design_scores_gemma":[0.0015310576,0.00016134986,0.00016346083,0.000029147017,0.0000075586304,0.000002117737,0.000023356217,0.954031,0.00010586308,0.00003811864,0.043740336,0.00016662396],"about_ca_topic_score_codex":0.000002386714,"about_ca_topic_score_gemma":0.000006475439,"teacher_disagreement_score":0.873326,"about_ca_system_score_codex":0.000011750767,"about_ca_system_score_gemma":0.00007417287,"threshold_uncertainty_score":0.5389699},"labels":[],"label_agreement":null},{"id":"W2110691754","doi":"10.1016/j.ipl.2004.01.008","title":"Packet loss probability for DiffServ over IP and MPLS reliable homogeneous multicast networks","year":2004,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; École de Technologie Supérieure; Concordia University","funders":"","keywords":"Computer network; Multicast; Computer science; Multiprotocol Label Switching; Source-specific multicast; Xcast; IP multicast; Hybrid automatic repeat request; Distributed computing; Quality of service","score_opus":0.007454997472252719,"score_gpt":0.20679080822070448,"score_spread":0.19933581074845175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110691754","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11218255,0.000081294595,0.88110244,0.005772681,0.0001965612,0.0004065407,0.0000028516417,0.00021341165,0.00004169006],"genre_scores_gemma":[0.9530817,0.0000064868304,0.04030811,0.00637584,0.000098447024,0.00009958415,0.000013485807,0.0000067586398,0.000009587182],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989062,0.000013699598,0.0003612168,0.00020924734,0.00019014387,0.00031946762],"domain_scores_gemma":[0.99929005,0.000054988297,0.0001840842,0.00023904555,0.00013674238,0.00009511293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027553824,0.00015377776,0.0001474294,0.00006287406,0.0003030538,0.00053569593,0.00027841804,0.00007611275,0.0000019354115],"category_scores_gemma":[0.00003908417,0.00013990983,0.000044253276,0.00021208538,0.00008320667,0.0023143983,0.000061927414,0.000119445416,0.000007368816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005798286,0.00005265661,0.00097251916,0.00020418804,0.000019408333,0.0000033717604,0.0017700744,0.30538732,0.000034686665,0.0073551647,0.0013696984,0.68277293],"study_design_scores_gemma":[0.002168082,0.000060939885,0.0018559215,0.00011926855,0.000016345899,0.00004416586,0.00002702468,0.98585105,0.000071010756,0.0027621354,0.006686515,0.0003375347],"about_ca_topic_score_codex":0.0000065387303,"about_ca_topic_score_gemma":0.000002913778,"teacher_disagreement_score":0.84089917,"about_ca_system_score_codex":0.00007152183,"about_ca_system_score_gemma":0.00007018161,"threshold_uncertainty_score":0.5705357},"labels":[],"label_agreement":null},{"id":"W2110751308","doi":"10.1109/ccece.2003.1225990","title":"IP-based broadband satellite access systems for interactive multimedia services","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Computer network; Broadband networks; IP Multimedia Subsystem; Quality of service; Broadband; Broadband Integrated Services Digital Network; Network packet; Asynchronous Transfer Mode; Network architecture; Differentiated services; Key (lock); Architecture; Communications satellite; Queueing theory; Access network; Telecommunications; Satellite; Engineering; Operating system","score_opus":0.013812009391182493,"score_gpt":0.2649462695014646,"score_spread":0.2511342601102821,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110751308","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005382551,0.00069848757,0.9894151,0.0012062356,0.0010982143,0.00058479817,0.000004218012,0.00033468174,0.0012757204],"genre_scores_gemma":[0.98338187,0.000022328784,0.014794949,0.0011334337,0.00019816625,0.00014004463,0.000008357129,0.000009549264,0.00031132804],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989775,0.00003042871,0.00021036401,0.00035789097,0.00016285756,0.00026098435],"domain_scores_gemma":[0.9990528,0.00026296484,0.00009728862,0.00031311924,0.00016387852,0.00010995007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014443691,0.00014439569,0.00017474113,0.00007125775,0.00009434114,0.0005254885,0.00084651646,0.00005898834,0.0000074915415],"category_scores_gemma":[0.000007710052,0.0001169677,0.00007169294,0.00018731544,0.000021383845,0.00076308177,0.00006613692,0.00007407429,0.00003696277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001639265,0.00032000235,0.00048379594,0.0001772796,0.000114392446,0.000017472876,0.0008889597,0.16955371,0.000100836245,0.03763931,0.00055148266,0.7899888],"study_design_scores_gemma":[0.0023975093,0.00007659344,0.000431703,0.000090797184,0.000010657019,0.0000034283503,0.00004488504,0.9870253,0.00043903687,0.00028520433,0.009003904,0.0001909848],"about_ca_topic_score_codex":0.00016584575,"about_ca_topic_score_gemma":0.00010145797,"teacher_disagreement_score":0.97799927,"about_ca_system_score_codex":0.00004819175,"about_ca_system_score_gemma":0.000086688335,"threshold_uncertainty_score":0.5067298},"labels":[],"label_agreement":null},{"id":"W2111016530","doi":"10.1109/milcom.1994.473831","title":"Using token allocations in a leaky bucket scheme","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Leaky bucket; Token bucket; Computer science; Computer network; Traffic policing; Scheme (mathematics); Bandwidth (computing); Overhead (engineering); Network congestion; Smoothness; Simple (philosophy); Bandwidth allocation; Security token; Traffic shaping; Quality of service; Network traffic control; Mathematics; Operating system","score_opus":0.06807523114502315,"score_gpt":0.2583874008838727,"score_spread":0.19031216973884954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111016530","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022587683,0.0002388108,0.94859636,0.004083109,0.00015890523,0.00010827417,1.8916406e-7,0.00018728767,0.024039382],"genre_scores_gemma":[0.94460076,0.000009346134,0.05232507,0.0007635427,0.000050016286,0.000007893818,2.2221383e-7,0.00000305786,0.002240087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939185,0.000025588593,0.00012948038,0.00017789954,0.0001018254,0.00017335723],"domain_scores_gemma":[0.9996199,0.000037069283,0.000021428048,0.00024359387,0.000029170511,0.00004885934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000090702015,0.00006142417,0.000072742034,0.000093124996,0.000051959763,0.000065815264,0.00032014566,0.00003123959,0.00018939858],"category_scores_gemma":[0.000011213539,0.000058149788,0.00002347026,0.00047017087,0.000015603595,0.00026562103,0.000052868883,0.00007428973,0.00015267919],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015743692,0.00015405269,0.002219615,0.0000032600515,0.0000126251925,0.000017193757,0.0005080426,0.00671393,0.00034636262,0.59834296,0.0076475083,0.38403288],"study_design_scores_gemma":[0.00023979277,0.000007922385,0.00030464763,0.0000066259754,0.0000010892709,0.0000066760404,0.000010962224,0.99196666,0.000016893488,0.00041531053,0.006942787,0.00008065564],"about_ca_topic_score_codex":0.000027488088,"about_ca_topic_score_gemma":0.000059275182,"teacher_disagreement_score":0.9852527,"about_ca_system_score_codex":0.000025324,"about_ca_system_score_gemma":0.000016663807,"threshold_uncertainty_score":0.23712796},"labels":[],"label_agreement":null},{"id":"W2111101306","doi":"10.1109/icc.2001.936681","title":"Tools of computational intelligence as applied to bandwidth allocation in ATM networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Dynamic bandwidth allocation; Computer science; Bandwidth (computing); Bandwidth allocation; Asynchronous Transfer Mode; Artificial neural network; Distributed computing; Computational intelligence; Computer network; Artificial intelligence","score_opus":0.020843210864674763,"score_gpt":0.2302251915517293,"score_spread":0.20938198068705455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111101306","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037738462,0.00006361372,0.9833261,0.0012802327,0.00011221695,0.00022300729,2.2224465e-7,0.00007029374,0.011150476],"genre_scores_gemma":[0.9707078,0.000012018773,0.027753323,0.0011535157,0.000040745417,0.000027247434,0.0000020453977,0.000003637671,0.00029969812],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907464,0.000027754728,0.00028266618,0.00024891863,0.0001946252,0.00017140614],"domain_scores_gemma":[0.9993925,0.00021195089,0.00005316307,0.00020673401,0.00006302877,0.00007262129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017858969,0.00008718812,0.00013404957,0.0000811418,0.000029269642,0.00005635059,0.00041402676,0.00004389924,0.00014464854],"category_scores_gemma":[0.000018356928,0.00008371142,0.000026474643,0.0005404924,0.000020908361,0.00016146772,0.00006430438,0.000076133285,0.000148855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003298809,0.000027476954,0.00005539048,8.330051e-7,0.0000024302976,6.234904e-7,0.00011136513,0.4616086,0.000003027249,0.13528562,0.00031329627,0.40258804],"study_design_scores_gemma":[0.00015648856,0.000046467838,0.001363661,0.0000115367675,0.0000013955394,0.0000022693719,0.000016540645,0.9945495,0.00005501873,0.0031854503,0.0005121797,0.00009945692],"about_ca_topic_score_codex":0.0000111229265,"about_ca_topic_score_gemma":0.000019244233,"teacher_disagreement_score":0.9669339,"about_ca_system_score_codex":0.000024051777,"about_ca_system_score_gemma":0.000016865526,"threshold_uncertainty_score":0.34136528},"labels":[],"label_agreement":null},{"id":"W2111209963","doi":"10.1007/978-3-642-10445-9_20","title":"Automatic Stress Testing of Multi-tier Systems by Dynamic Bottleneck Switch Generation","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Burstiness; Computer science; Bottleneck; Testbed; Distributed computing; Computer network; Queueing theory; Session (web analytics); Throughput; Service (business); Real-time computing; Embedded system; Operating system; Wireless","score_opus":0.017089369859310487,"score_gpt":0.23317847025448563,"score_spread":0.21608910039517515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111209963","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00085910084,0.0018262422,0.9943735,0.000209508,0.001690803,0.0005263455,0.000011586452,0.00022609331,0.00027681064],"genre_scores_gemma":[0.67485183,0.000028381079,0.32395518,0.00033934333,0.0003381443,0.000015704596,0.000014344109,0.00003160433,0.00042549404],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964296,0.00006362132,0.0008038218,0.0012118948,0.00093068555,0.00056034536],"domain_scores_gemma":[0.99736667,0.0004330783,0.000586781,0.0010733721,0.00039110644,0.00014899677],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006941211,0.0005029373,0.0006520711,0.00044169318,0.00020448654,0.00045321,0.0022100366,0.00032088716,0.000005736489],"category_scores_gemma":[0.000090655354,0.00046499557,0.00009930996,0.0005853976,0.00028500627,0.00044420437,0.0003211476,0.0005277508,0.000012225831],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.2237216e-7,0.000033725693,0.000021337735,0.000039927072,0.000009509882,0.000013202179,0.00010625786,0.1679123,0.0005022756,0.0011601401,0.000030470495,0.83017004],"study_design_scores_gemma":[0.0003255485,0.00014989014,0.000052040778,0.00063011906,0.000013124972,0.000031043608,1.3854344e-7,0.99678296,0.00024931523,0.0011528471,0.00015465834,0.00045828606],"about_ca_topic_score_codex":0.000029974077,"about_ca_topic_score_gemma":0.000047757043,"teacher_disagreement_score":0.82971174,"about_ca_system_score_codex":0.00024434456,"about_ca_system_score_gemma":0.0004376276,"threshold_uncertainty_score":0.9997802},"labels":[],"label_agreement":null},{"id":"W2111286910","doi":"10.1109/his.2001.946708","title":"New World Campus networking","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Computer network; Computer science; Closet; Multicast; Campus network; Gigabit Ethernet; Local area network; Virtual LAN; Server; Data center; Quality of service; Edge device; Ethernet; Fiber Distributed Data Interface; Networking hardware; Metropolitan area network; Network switch; Simple (philosophy); Engineering; Cloud computing; Operating system","score_opus":0.0155075485009309,"score_gpt":0.19793226448573248,"score_spread":0.1824247159848016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111286910","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005048267,0.0009119345,0.8556278,0.0037967805,0.0010091711,0.000054994187,2.6255645e-8,0.0004246016,0.13812421],"genre_scores_gemma":[0.8050028,0.000034128476,0.04628354,0.0029180225,0.001210708,0.000004557846,1.9109191e-7,0.000006921895,0.14453915],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992464,0.000021237178,0.00012120584,0.00022249256,0.00013690026,0.000251749],"domain_scores_gemma":[0.9994341,0.00006818362,0.00003216579,0.00031085956,0.000017533359,0.00013715986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006814133,0.00008482927,0.000088882894,0.0000527057,0.000077236735,0.00013821993,0.0004756707,0.000023446015,0.0007265373],"category_scores_gemma":[0.000002762548,0.00007343607,0.000043904547,0.00043552177,0.000008403289,0.0001980196,0.00006819503,0.00008955711,0.0005988957],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.4100492e-7,0.0000051866723,0.00013636073,2.2879803e-7,0.000004217387,0.000005505423,0.0000312456,0.00033481448,0.000001001368,0.073054835,0.16014087,0.76628536],"study_design_scores_gemma":[0.00023314464,0.000011597543,0.0000935365,0.0000060197685,0.0000024043154,0.0000075118014,0.0000014440286,0.60534966,0.0000050035283,0.0011992024,0.39297968,0.00011080313],"about_ca_topic_score_codex":0.000012365405,"about_ca_topic_score_gemma":0.00007764494,"teacher_disagreement_score":0.80934423,"about_ca_system_score_codex":0.000012904245,"about_ca_system_score_gemma":0.000012551542,"threshold_uncertainty_score":0.79550743},"labels":[],"label_agreement":null},{"id":"W2111388916","doi":"10.1109/jsac.2011.110511","title":"On the Impact of Link Scheduling on End-to-End Delays in Large Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; End-to-end principle; Scheduling (production processes); End-to-end delay; Network delay; Multiplexing; Hop (telecommunications); Statistical time division multiplexing; Computer network; Distributed computing; Mathematical optimization; Mathematics; Telecommunications","score_opus":0.040576233895283774,"score_gpt":0.2916289727300065,"score_spread":0.25105273883472273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111388916","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7081045,0.0006026378,0.272554,0.008347451,0.0005378208,0.0007087653,0.000011286296,0.00012874858,0.0090048],"genre_scores_gemma":[0.9952396,0.00028422577,0.0036309375,0.00069351174,0.00009182126,0.000028964374,0.0000022929999,0.000013955443,0.000014699521],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783003,0.0007620116,0.00054810644,0.00019787799,0.00026378754,0.0003981871],"domain_scores_gemma":[0.99619484,0.0016484787,0.00027887846,0.0014719841,0.00026191495,0.00014390059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011706066,0.00018249298,0.0002505987,0.00040173283,0.00029896124,0.000084119696,0.002558721,0.00010618329,0.000053752115],"category_scores_gemma":[0.0002588025,0.00012984293,0.000121680525,0.0016026321,0.0000524115,0.0001565656,0.00012083104,0.0016409912,0.00002661597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037881554,0.0021804862,0.00686296,0.0000020430782,0.0001836778,0.000029107261,0.0033570342,0.6394783,0.00016038977,0.19246338,0.0014385143,0.15346526],"study_design_scores_gemma":[0.0010208092,0.00088531204,0.0515778,0.00042979137,0.000010317619,0.000038685732,0.000045175962,0.9421295,0.000060743576,0.0034098623,0.00016134745,0.00023063346],"about_ca_topic_score_codex":0.00005483311,"about_ca_topic_score_gemma":0.0002659617,"teacher_disagreement_score":0.30265117,"about_ca_system_score_codex":0.00019644573,"about_ca_system_score_gemma":0.00024225599,"threshold_uncertainty_score":0.71293813},"labels":[],"label_agreement":null},{"id":"W2111621642","doi":"10.1109/icca.2003.1595139","title":"Modeling and Resource Allocation for E-Businesses","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Resource allocation; Resource (disambiguation); Markov process; Scheme (mathematics); Markov chain; Resource management (computing); Session (web analytics); Operations research; Distributed computing; Computer network; Engineering; World Wide Web","score_opus":0.015878540624733557,"score_gpt":0.22179489351376866,"score_spread":0.2059163528890351,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111621642","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004160511,0.00021330111,0.9916586,0.0013740769,0.000056960263,0.00009270721,6.8483196e-8,0.00008812443,0.0023556247],"genre_scores_gemma":[0.9425174,0.00000864347,0.056436732,0.00048128693,0.000026876616,0.000016981798,4.4149718e-7,0.0000025040094,0.0005091397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996484,0.000013074771,0.000067155044,0.00013883693,0.0000457732,0.00008674573],"domain_scores_gemma":[0.999744,0.000050952516,0.000010280248,0.00011340164,0.00005352614,0.000027824672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013415042,0.000041072206,0.000045088218,0.00001913535,0.00006894161,0.00006484385,0.00008636088,0.000018757442,0.0000025111744],"category_scores_gemma":[0.000030917407,0.00003529944,0.000010833115,0.00007595002,0.0000062558825,0.00013451207,0.0000105122945,0.000016775177,0.0000020566338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022446832,0.000008207714,0.000013098907,0.000003887881,0.0000032544099,1.439955e-7,0.000045405315,0.035465084,0.0000320115,0.7649217,0.0005233135,0.19898163],"study_design_scores_gemma":[0.00020463196,0.00001000284,0.0000053583226,0.0000030721103,0.000002175593,0.0000031024806,0.000015285681,0.981347,0.000042395674,0.0031796088,0.015136472,0.00005084248],"about_ca_topic_score_codex":0.0000018439171,"about_ca_topic_score_gemma":0.0000034244965,"teacher_disagreement_score":0.94588196,"about_ca_system_score_codex":0.0000036581307,"about_ca_system_score_gemma":0.00001945552,"threshold_uncertainty_score":0.14394693},"labels":[],"label_agreement":null},{"id":"W2111692745","doi":"10.1016/j.comnet.2007.06.022","title":"Stability and TCP-friendliness of AIMD/RED systems with feedback delays","year":2007,"lang":"en","type":"article","venue":"Computer Networks","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Waterloo","funders":"","keywords":"Control theory (sociology); Computer science; Stability (learning theory); Transmission Control Protocol; Lyapunov function; Multiplicative function; Exponential stability; Flow control (data); Transmission (telecommunications); Flow (mathematics); Mathematics; Control (management); Telecommunications; Computer network; Mathematical analysis; Nonlinear system","score_opus":0.0088761823635611,"score_gpt":0.193013163034942,"score_spread":0.1841369806713809,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111692745","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028939435,0.0010140715,0.96788985,0.0001679963,0.00097115483,0.00030371628,9.585384e-7,0.0001817629,0.000531029],"genre_scores_gemma":[0.9833715,0.000020160809,0.015885659,0.00013543558,0.0005343898,0.000008137417,0.0000030138738,0.000012942801,0.000028791093],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824846,0.00009260691,0.00044659167,0.00050834095,0.00025920448,0.00044481835],"domain_scores_gemma":[0.99840575,0.0003478467,0.00019404852,0.0006340491,0.00022169575,0.00019659253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007664883,0.00022200134,0.0003739291,0.00006397342,0.000105906656,0.00012894161,0.00057868427,0.000120111385,0.0000050723424],"category_scores_gemma":[0.000003936361,0.00018039391,0.000049778537,0.000452755,0.0001413172,0.00025324262,0.00017626266,0.00021097418,0.0000021062403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020461084,0.00018535294,0.014660767,0.000086281805,0.00012775704,0.00007130893,0.00045669085,0.22231342,0.000009645731,0.037916597,0.0017429648,0.7222246],"study_design_scores_gemma":[0.00087379065,0.00019643448,0.00690145,0.00008273637,0.000014845078,0.000058109665,0.00001858759,0.9898015,0.000012343399,0.000059704675,0.0017555153,0.00022493672],"about_ca_topic_score_codex":0.000016634505,"about_ca_topic_score_gemma":0.00002646607,"teacher_disagreement_score":0.954432,"about_ca_system_score_codex":0.000026184696,"about_ca_system_score_gemma":0.000039212497,"threshold_uncertainty_score":0.735625},"labels":[],"label_agreement":null},{"id":"W2111722589","doi":"10.1109/glocom.1989.64115","title":"An analytical technique for evaluating packet routing policies in metropolitan area networks","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Topology (electrical circuits); Network packet; Ideal (ethics); Network topology; Upper and lower bounds; Computer network; Routing (electronic design automation); Metropolitan area network; Mathematics; Local area network","score_opus":0.04273137957150114,"score_gpt":0.3340366659269084,"score_spread":0.29130528635540726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111722589","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008875128,0.000052201773,0.98392147,0.00040172727,0.000102016995,0.00044447175,5.473608e-7,0.00018324987,0.0060191634],"genre_scores_gemma":[0.90449214,0.0000022187053,0.094687015,0.0005017511,0.000069167414,0.0001179574,0.0000016467972,0.000009654271,0.000118433214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983585,0.00021256557,0.000337701,0.00038094833,0.00018299733,0.0005272999],"domain_scores_gemma":[0.9989052,0.00038502677,0.00006903912,0.0004159893,0.000093740826,0.00013100117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001596023,0.00015165172,0.00022336395,0.00013359626,0.00012853614,0.00015997398,0.0004319888,0.00009676271,0.000019553261],"category_scores_gemma":[0.00023587506,0.00013297347,0.000073716925,0.0005654001,0.000038645212,0.00028255396,0.000034741315,0.00015761971,0.0000018612809],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006399555,0.00005235134,0.0027812868,0.0000020693383,0.000009311793,0.000001949437,0.000064518434,0.011629282,0.000089965164,0.95542705,0.00022082751,0.029714959],"study_design_scores_gemma":[0.00041144397,0.00017506315,0.00042639516,0.000015443811,0.000007735785,0.000008063657,0.00020287887,0.9925492,0.00017107656,0.0057420977,0.000114941286,0.00017570093],"about_ca_topic_score_codex":0.00004808149,"about_ca_topic_score_gemma":0.00008275061,"teacher_disagreement_score":0.9809199,"about_ca_system_score_codex":0.00013888221,"about_ca_system_score_gemma":0.00007761491,"threshold_uncertainty_score":0.54225004},"labels":[],"label_agreement":null},{"id":"W2111743199","doi":"10.1109/wowmom.2006.21","title":"An Adaptive Rate Control Algorithm for Real-time Streaming of 3D Image-Based Rendering over Heterogeneous Wireless Networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Rendering (computer graphics); Wireless network; Wireless; Real-time computing; Schema (genetic algorithms); Bandwidth (computing); Computer network; Algorithm; Artificial intelligence; Machine learning; Telecommunications","score_opus":0.005904478944837745,"score_gpt":0.21257731854782064,"score_spread":0.20667283960298288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111743199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0116823735,0.000059737024,0.986902,0.0000542054,0.00015594716,0.0004409888,0.000017773826,0.00030890622,0.0003780808],"genre_scores_gemma":[0.85539216,0.0000038692287,0.14396429,0.00014274729,0.00025621036,0.00006109365,0.000014853135,0.000022742803,0.00014200585],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982825,0.00013940845,0.00041186568,0.0005095739,0.00019123842,0.0004654472],"domain_scores_gemma":[0.9985885,0.00041041724,0.00021982577,0.00048514074,0.00018885745,0.000107245425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035441562,0.00024170827,0.00037693756,0.00007627813,0.00013104104,0.00012316514,0.00048556586,0.00010207087,0.00002224231],"category_scores_gemma":[0.0000037438558,0.00022661958,0.00013041054,0.00018961524,0.000067323585,0.00033100578,0.000032131393,0.0000891928,0.0000031298364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001022042,0.00013821201,0.00003638555,0.0000056587864,0.00005424336,0.000019640034,0.000014499302,0.37619996,0.004499399,0.002862055,0.00023469777,0.61583304],"study_design_scores_gemma":[0.002308726,0.00035084254,0.00019684383,0.000023499131,0.000029719464,0.0000039209813,0.0000051093552,0.99502695,0.0016316324,0.00013158967,0.000036121524,0.00025502464],"about_ca_topic_score_codex":0.00019421378,"about_ca_topic_score_gemma":0.000050422597,"teacher_disagreement_score":0.8437098,"about_ca_system_score_codex":0.000050343744,"about_ca_system_score_gemma":0.00007148251,"threshold_uncertainty_score":0.9241278},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.01793773157464332,"score_gpt":0.27351774689445757,"score_spread":0.2555800153198142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111757536","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0396566,0.00023854781,0.94500273,0.014029432,0.00068049645,0.00017137421,0.000006916818,0.00004179701,0.00017212464],"genre_scores_gemma":[0.9808778,0.00008009896,0.015992753,0.0018389288,0.000858269,0.00002038144,0.000010162031,0.000008512967,0.00031308908],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881124,0.00005028697,0.0004685634,0.00019003382,0.00035149406,0.00012836659],"domain_scores_gemma":[0.99818635,0.00010244793,0.00042856432,0.00013697134,0.0010176841,0.00012800435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050541584,0.00011825881,0.00015649859,0.00022855897,0.00005000976,0.00020935087,0.0005827453,0.00007143239,0.000009755131],"category_scores_gemma":[0.00006911282,0.000107946464,0.00008095504,0.000068592904,0.00003486339,0.0012077081,0.000026251639,0.0001156383,0.000006718657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018796373,0.00016816729,0.00021672358,0.0000038701737,0.00009542789,0.0000012754367,0.0007668106,0.0325059,0.0006685108,0.09580506,0.0021009347,0.8674794],"study_design_scores_gemma":[0.0022553452,0.00020980056,0.0006374035,0.00003005824,0.000022514205,0.0000884,0.00003324265,0.9824103,0.00040363317,0.0030861606,0.010700329,0.00012281844],"about_ca_topic_score_codex":0.0000033076872,"about_ca_topic_score_gemma":0.000015184246,"teacher_disagreement_score":0.9499044,"about_ca_system_score_codex":0.000080702586,"about_ca_system_score_gemma":0.000107596075,"threshold_uncertainty_score":0.44019288},"labels":[],"label_agreement":null},{"id":"W2112081353","doi":"10.1109/ccece.2000.849545","title":"A new self-organizing approach for congestion control in ATM networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Network packet; Queueing theory; Queue; Computer network; Network congestion; FIFO (computing and electronics); Asynchronous Transfer Mode; Throughput; Set (abstract data type); Network switch; Packet switching; Distributed computing; Real-time computing","score_opus":0.011771173906235157,"score_gpt":0.18922490824380686,"score_spread":0.1774537343375717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112081353","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015972788,0.00062074384,0.9925602,0.0020939612,0.00026362293,0.0005892166,3.4608183e-7,0.0004964601,0.00321569],"genre_scores_gemma":[0.8287835,0.000028416494,0.16807023,0.001232694,0.00032549293,0.0000667295,0.0000017666891,0.000012496638,0.0014786504],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870694,0.00006113687,0.00026791685,0.00041813563,0.00014062453,0.0004052398],"domain_scores_gemma":[0.99920744,0.00021730553,0.00006865964,0.00030679654,0.0000557805,0.00014402281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027666605,0.00016070399,0.00022667571,0.000073609765,0.000085476066,0.00015103156,0.0004666256,0.00011605451,0.000047505564],"category_scores_gemma":[0.000022786277,0.00014852593,0.00006717457,0.00039911273,0.000011060599,0.00032112031,0.000037388287,0.00014782685,0.000022781729],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022375441,0.00017659279,0.0010455652,0.000009361891,0.0000474471,0.0000057532657,0.0003547194,0.07193671,0.000018505012,0.124773495,0.029098043,0.7725114],"study_design_scores_gemma":[0.0026104627,0.000056031095,0.0002702937,0.0000072686576,0.00001173603,0.000010456352,0.000011282419,0.9911391,0.0000028672825,0.00022606985,0.0054706475,0.00018374705],"about_ca_topic_score_codex":0.0000135213795,"about_ca_topic_score_gemma":0.000017939175,"teacher_disagreement_score":0.91920245,"about_ca_system_score_codex":0.000051949042,"about_ca_system_score_gemma":0.000026598642,"threshold_uncertainty_score":0.6056711},"labels":[],"label_agreement":null},{"id":"W2112428909","doi":"10.1109/lcomm.2003.817289","title":"A heuristic algorithm for the point of presence design problem in IP networks","year":2003,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Heuristic; Node (physics); Computer network; Algorithm; Set (abstract data type); The Internet; Protocol (science); Point (geometry); Internet topology; Distributed computing; Network topology; Mathematics; Artificial intelligence","score_opus":0.031571328017999147,"score_gpt":0.2538452842160285,"score_spread":0.22227395619802934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112428909","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000472143,0.0011224418,0.98606,0.0116770575,0.00018506915,0.0007641193,0.0000012989425,0.000045685734,0.00009708458],"genre_scores_gemma":[0.52996105,0.00017558681,0.46807116,0.0012450125,0.000020846339,0.00048839103,0.0000010738531,0.000007794967,0.000029063338],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987519,0.00042598962,0.00030476417,0.00017929691,0.000112161724,0.00022589049],"domain_scores_gemma":[0.9951761,0.0028643187,0.0001291936,0.0017160997,0.00007977778,0.000034517914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008934368,0.00009970656,0.00013721369,0.000059793554,0.00018301644,0.000056526504,0.0021133355,0.00003580692,0.0000015517503],"category_scores_gemma":[0.000071458206,0.00008093751,0.000059758022,0.00042140897,0.00015988263,0.00014827895,0.00008735993,0.00019426855,0.0000025287495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000772969,0.00016230425,0.00006767701,0.000007852131,0.000049270486,0.0000015347409,0.0006548497,0.33169806,0.00017522991,0.052898213,0.012315597,0.6019617],"study_design_scores_gemma":[0.00037450698,0.000025424968,0.0000821066,0.00003467559,0.000010995895,0.0000054114635,0.000020710413,0.9948823,0.000043020314,0.0010605516,0.0033673039,0.00009300272],"about_ca_topic_score_codex":0.000018577524,"about_ca_topic_score_gemma":0.000015368625,"teacher_disagreement_score":0.6631842,"about_ca_system_score_codex":0.000029304523,"about_ca_system_score_gemma":0.0000576472,"threshold_uncertainty_score":0.39271384},"labels":[],"label_agreement":null},{"id":"W2112451998","doi":"10.1109/issse.2007.4294503","title":"Estimation and Simulation of Network Delay Traces for VoIP in Service Overlay Network","year":2007,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Network delay; Sampling (signal processing); TRACE (psycholinguistics); Voice over IP; End-to-end delay; Real-time computing; Network planning and design; Network traffic simulation; Algorithm; Computer network; Telecommunications; Network traffic control; Network packet; The Internet","score_opus":0.011492743501662886,"score_gpt":0.25824195812503437,"score_spread":0.2467492146233715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112451998","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05756474,0.00028893346,0.94078577,0.0004559033,0.00019482561,0.00029373213,4.265218e-7,0.00006462878,0.00035104976],"genre_scores_gemma":[0.910919,0.0000058617616,0.08840352,0.00043757397,0.00016459689,0.000008353332,0.0000030667102,0.000004703409,0.000053307183],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990804,0.00002849433,0.00031062396,0.00020473689,0.000118586075,0.0002571163],"domain_scores_gemma":[0.9987821,0.000818631,0.00011060438,0.00015198757,0.00008717877,0.000049509712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008632033,0.00009058372,0.00014865903,0.00004217364,0.00006113597,0.000037265232,0.00016136344,0.00007057249,0.0000039440956],"category_scores_gemma":[0.000020669406,0.00008457703,0.000025126208,0.00045032526,0.0000133568965,0.00030548836,0.000031383686,0.00005404651,0.0000018519452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002888243,0.000010805784,0.0006672365,0.000008235893,0.0000042466536,3.5814773e-7,0.0000849002,0.6980507,0.00000321287,0.0198206,0.0001805804,0.28114024],"study_design_scores_gemma":[0.000555537,0.000051499537,0.006067752,0.000031600997,0.000005557334,0.0000011045668,0.0000088264505,0.9884492,0.000009175282,0.003736065,0.0009912688,0.00009238204],"about_ca_topic_score_codex":0.000018196884,"about_ca_topic_score_gemma":0.0004189556,"teacher_disagreement_score":0.8533543,"about_ca_system_score_codex":0.0000143733205,"about_ca_system_score_gemma":0.0000226049,"threshold_uncertainty_score":0.3448951},"labels":[],"label_agreement":null},{"id":"W2112597333","doi":"10.1109/pacrim.2001.953698","title":"Realistic bursty traffic modeling for differentiated services network","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Burstiness; Computer science; Weighted fair queueing; Computer network; Quality of service; Differentiated services; Web traffic; Jitter; Traffic generation model; Queueing theory; Integrated services; Network packet; Distributed computing; The Internet; Operating system","score_opus":0.02354340931196054,"score_gpt":0.21003705009988233,"score_spread":0.1864936407879218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112597333","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015569002,0.0005137765,0.9802485,0.0010928324,0.00050730637,0.00026451965,0.000002309245,0.0006576385,0.0011441046],"genre_scores_gemma":[0.98381543,0.000041028863,0.0139617855,0.00066211435,0.000354732,0.000052073927,0.000010201421,0.000011799344,0.0010908601],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987709,0.00003571996,0.00024401523,0.0003735153,0.00015701498,0.00041882493],"domain_scores_gemma":[0.9992546,0.00011538946,0.000054420056,0.00037175577,0.00009016795,0.00011366122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013096062,0.00015579791,0.00018624446,0.00003510729,0.00020760662,0.00018396549,0.00060249807,0.000070523405,0.00007767665],"category_scores_gemma":[0.000004872072,0.00013145262,0.00009131216,0.00023743922,0.000011917419,0.00020817124,0.000054686814,0.00007907435,0.000058943308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007035423,0.00004907106,0.00001266371,0.000016665492,0.000028303557,0.0000013363416,0.00012233287,0.7190938,0.0000028668762,0.051147882,0.0037574708,0.22576055],"study_design_scores_gemma":[0.0005231377,0.000042322336,0.000011398365,0.000023210905,0.000015996746,0.0000024336837,0.000009297397,0.9965903,9.108589e-7,0.0010987611,0.0015094184,0.0001728219],"about_ca_topic_score_codex":0.000008982263,"about_ca_topic_score_gemma":0.000040643456,"teacher_disagreement_score":0.9682464,"about_ca_system_score_codex":0.000015597998,"about_ca_system_score_gemma":0.000007795679,"threshold_uncertainty_score":0.5360482},"labels":[],"label_agreement":null},{"id":"W2112609801","doi":"10.1109/wimob.2005.1512870","title":"TCP packet control for wireless networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Goodput; Computer network; Computer science; TCP Vegas; TCP Westwood; TCP global synchronization; TCP acceleration; Zeta-TCP; Packet loss; TCP Friendly Rate Control; Network packet; TCP Westwood plus; Transmission Control Protocol; Real-time computing; Wireless; Throughput; Telecommunications","score_opus":0.005075412707287205,"score_gpt":0.19504329887410263,"score_spread":0.18996788616681543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112609801","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009910093,0.00017395659,0.9903694,0.002409131,0.00051470136,0.00031552484,0.0000019901654,0.00038996484,0.0048343497],"genre_scores_gemma":[0.98776174,0.000003926401,0.006788724,0.0016341461,0.0006121272,0.00015596994,0.0000039608594,0.000008693731,0.003030714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899656,0.000033615583,0.00020460805,0.00029253546,0.00012283908,0.00034984894],"domain_scores_gemma":[0.99922156,0.0002577663,0.000058668065,0.0003127077,0.00008144113,0.00006783339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020583173,0.00012300572,0.00017044324,0.000031334752,0.000117441756,0.00014309374,0.00045532756,0.00007012165,0.000029514267],"category_scores_gemma":[0.000004872549,0.00010332962,0.00009671705,0.00014895585,0.000027394904,0.00017821528,0.000028051127,0.00006870263,0.000026264286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015898571,0.000037265687,0.00030621907,0.000001872157,0.000012714048,0.0000026346534,0.0000046054715,0.013067258,0.000013194879,0.6256064,0.0640148,0.2969171],"study_design_scores_gemma":[0.0014703447,0.0000457941,0.00047285043,0.000004098282,0.000007768818,0.000003863462,0.0000021778096,0.96453947,0.0000187152,0.0035678032,0.029717457,0.00014966977],"about_ca_topic_score_codex":0.000016721471,"about_ca_topic_score_gemma":0.0000405894,"teacher_disagreement_score":0.98677075,"about_ca_system_score_codex":0.000014927297,"about_ca_system_score_gemma":0.00002595233,"threshold_uncertainty_score":0.42136598},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01933816349824027,"score_gpt":0.2448934649100482,"score_spread":0.22555530141180793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112947567","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00257362,0.00021994639,0.9925183,0.003098761,0.00077851,0.0006421603,0.0000030175238,0.00010491978,0.000060751983],"genre_scores_gemma":[0.9721674,0.00009370369,0.023949977,0.0030271707,0.0003892083,0.00022712,0.0000023559426,0.000015241082,0.00012783575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998712,0.00012335305,0.00030051076,0.00039335096,0.00013364508,0.00033710984],"domain_scores_gemma":[0.9989095,0.0004741499,0.00009900801,0.00040267222,0.000054654716,0.000060025737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057833677,0.00019107443,0.00020487506,0.00010953684,0.00021228507,0.00025868346,0.0006853866,0.000097263866,0.0000063509683],"category_scores_gemma":[0.0000025573759,0.00015633066,0.00007698104,0.00029752846,0.000035949364,0.00036774194,0.000005306272,0.00024260487,0.0000069997736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039396604,0.00006867809,0.000045496778,0.000008421811,0.000024008159,0.0000016210817,0.00063810224,0.74831975,0.0000094044035,0.00020291863,0.00005917102,0.25058302],"study_design_scores_gemma":[0.0022894323,0.0000748841,0.00012519633,0.00007546343,0.000027071364,0.000008049691,0.000057061545,0.9924671,0.000036220827,0.000062159685,0.0046114014,0.00016596894],"about_ca_topic_score_codex":0.000017448427,"about_ca_topic_score_gemma":0.00038250943,"teacher_disagreement_score":0.96959376,"about_ca_system_score_codex":0.000042080774,"about_ca_system_score_gemma":0.000024087318,"threshold_uncertainty_score":0.63749796},"labels":[],"label_agreement":null},{"id":"W2112968540","doi":"10.1145/1364654.1364674","title":"Router buffer sizing revisited","year":2007,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"National Science Foundation","keywords":"Sizing; Computer science; Buffer (optical fiber); Router; Throughput; H-TCP; TCP tuning; TCP Friendly Rate Control; Testbed; Buffer overflow; Computer network; Real-time computing; Network congestion; Telecommunications; Network packet","score_opus":0.00807032357540587,"score_gpt":0.22495367729241134,"score_spread":0.21688335371700546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112968540","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029989032,0.000179022,0.95345783,0.0011785057,0.00022374054,0.000061523926,6.699181e-8,0.00033231886,0.0415681],"genre_scores_gemma":[0.9634475,0.000005163814,0.029956931,0.0031930576,0.0001949581,0.0000015522287,4.4600023e-7,0.000003768456,0.0031966316],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99927205,0.000016112854,0.00014407189,0.00019953113,0.00013531854,0.00023290455],"domain_scores_gemma":[0.99945796,0.00009869852,0.00002591507,0.00028827926,0.000047791716,0.00008137376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038025415,0.00007062198,0.000080745056,0.000045093562,0.000057322763,0.00008890511,0.00034489902,0.000035610108,0.00007841202],"category_scores_gemma":[0.000010872489,0.000056749963,0.000040068273,0.0002227405,0.000010571765,0.00021723294,0.000064682245,0.000071643364,0.00023355981],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031116103,0.000011289556,0.00046621906,0.0000012015103,0.0000065415184,0.00001646067,0.000055693577,0.000019439245,0.00009320264,0.22262537,0.0032990393,0.77340245],"study_design_scores_gemma":[0.0019280287,0.00015133824,0.024738904,0.00006750214,0.000020875988,0.00008229364,0.00005666481,0.47592184,0.0014653534,0.0044420054,0.4901912,0.0009339978],"about_ca_topic_score_codex":0.0000035239832,"about_ca_topic_score_gemma":0.0000053098715,"teacher_disagreement_score":0.96044856,"about_ca_system_score_codex":0.0000139384265,"about_ca_system_score_gemma":0.000011383994,"threshold_uncertainty_score":0.30020168},"labels":[],"label_agreement":null},{"id":"W2113042583","doi":"10.1109/icc.1995.524541","title":"Bursty traffic control using dynamic token allocation method","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Ottawa","funders":"","keywords":"Token bucket; Security token; Computer science; Leaky bucket; Computer network; Scheme (mathematics); Class (philosophy); Token passing; Simple (philosophy); Service (business); Quality of service; Mathematics; Artificial intelligence","score_opus":0.018435437390682884,"score_gpt":0.25579467007754825,"score_spread":0.23735923268686537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113042583","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060280357,0.00035591391,0.98803085,0.0027950355,0.00034511724,0.00020560768,6.6230945e-7,0.00042171436,0.0018170492],"genre_scores_gemma":[0.88457984,0.000014343682,0.11314617,0.0010004382,0.000071941344,0.000011993899,7.416517e-7,0.00000814877,0.0011663836],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987456,0.00014539753,0.00023475118,0.0003591455,0.00021846208,0.00029660086],"domain_scores_gemma":[0.9991807,0.00015334637,0.0000744717,0.0004042918,0.00008100338,0.00010618774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003156665,0.00014244538,0.00017920394,0.00007723207,0.00013318991,0.00013309493,0.00049559335,0.00007114407,0.00017611631],"category_scores_gemma":[0.000016481134,0.0001269533,0.00007901888,0.00030322222,0.000022271102,0.0003793032,0.000032552067,0.00011312044,0.00013454915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030971505,0.000050774433,0.000011005778,0.0000023346156,0.000025602138,0.0000048874977,0.00013349524,0.109147176,0.00029125062,0.012133135,0.0005566323,0.8776406],"study_design_scores_gemma":[0.0007571321,0.000032623786,0.000079663536,0.0000060972775,0.00001778591,0.000026777681,0.000011758071,0.9970131,0.000017479128,0.00012932194,0.0017448326,0.00016344938],"about_ca_topic_score_codex":0.000008572142,"about_ca_topic_score_gemma":0.0000131367915,"teacher_disagreement_score":0.8878659,"about_ca_system_score_codex":0.00006114204,"about_ca_system_score_gemma":0.000022639513,"threshold_uncertainty_score":0.5177005},"labels":[],"label_agreement":null},{"id":"W2113327416","doi":"10.1109/wcnc.2004.1311665","title":"Enabling real-time All-IP wireless networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer network; Computer science; Quality of service; Wireless network; Network architecture; Network packet; Reservation; Distributed computing; Wireless; Telecommunications","score_opus":0.009309795834139606,"score_gpt":0.2152801584990577,"score_spread":0.2059703626649181,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113327416","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011040486,0.000108989625,0.97083265,0.0024303563,0.00036132493,0.00012663046,1.5312263e-7,0.0007848552,0.0143145565],"genre_scores_gemma":[0.98183185,0.00013278292,0.013703532,0.0015878596,0.00035394,0.000014291235,0.000002342484,0.000011664995,0.0023617616],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988187,0.00003377546,0.00020023486,0.00035777927,0.00019304443,0.0003964604],"domain_scores_gemma":[0.9992276,0.000080301776,0.000053394837,0.00044081747,0.000050611463,0.00014729633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022363388,0.00013876696,0.00015970018,0.000047045087,0.000109272056,0.00017567749,0.0006559728,0.00007968462,0.00006485703],"category_scores_gemma":[0.000005311633,0.00012103161,0.00006788106,0.0002861821,0.000028723754,0.00031043642,0.00011246424,0.00012951915,0.0003193005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000079609335,0.00005952299,0.000030597028,0.0000020978748,0.000035815967,0.00004377091,0.00012980805,0.13227618,0.00028153294,0.35004312,0.00253764,0.51455194],"study_design_scores_gemma":[0.00090375455,0.00006024704,0.00015860175,0.000023959006,0.000009659176,0.000022844804,0.000010616331,0.99116445,0.00013175592,0.00224167,0.0049894555,0.0002829624],"about_ca_topic_score_codex":0.000054328157,"about_ca_topic_score_gemma":0.000014576828,"teacher_disagreement_score":0.97079134,"about_ca_system_score_codex":0.000043544194,"about_ca_system_score_gemma":0.000059019567,"threshold_uncertainty_score":0.4935526},"labels":[],"label_agreement":null},{"id":"W2113666857","doi":"10.1109/pccc.1996.493653","title":"TCP over ATM: simulation model and performance results","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Zeta-TCP; TCP acceleration; Computer network; TCP global synchronization; TCP tuning; Asynchronous Transfer Mode; TCP Friendly Rate Control; Transmission Control Protocol; CUBIC TCP; ATM adaptation layer; H-TCP; Distributed computing; Network packet","score_opus":0.02380935365007941,"score_gpt":0.21951514063523897,"score_spread":0.19570578698515956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113666857","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17537844,0.00012478996,0.7993317,0.001012397,0.00010182578,0.000091819646,6.9385146e-7,0.0002325019,0.023725813],"genre_scores_gemma":[0.9877277,0.000042046755,0.0054943273,0.00040909712,0.00004106111,0.0000025300344,3.5342595e-7,0.0000024959024,0.0062803626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944353,0.000010656137,0.0001161967,0.00019373222,0.00011481324,0.00012109902],"domain_scores_gemma":[0.9996354,0.000056933783,0.000028463366,0.00019975117,0.000029085131,0.00005035099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008057238,0.00006220831,0.00005863199,0.000023598966,0.000073737334,0.00006415877,0.00013727257,0.00003166403,0.000021879963],"category_scores_gemma":[0.000006194718,0.00005216358,0.000013990317,0.00009338114,0.000014406002,0.00038734265,0.00004232481,0.000049239075,0.000046360303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067265473,0.000010275749,0.00009963896,0.000001214738,0.0000021650246,5.0764146e-7,0.00011912364,0.50241697,0.000002406556,0.006677123,0.0016829876,0.48898086],"study_design_scores_gemma":[0.00050640805,0.000028433838,0.00097130693,0.000003835943,0.0000016238275,0.00000178068,8.7071885e-7,0.99695927,0.0000033556341,0.00013733256,0.0013110893,0.00007470098],"about_ca_topic_score_codex":0.000001302867,"about_ca_topic_score_gemma":0.0000019091253,"teacher_disagreement_score":0.81234926,"about_ca_system_score_codex":0.000007472354,"about_ca_system_score_gemma":0.0000046606824,"threshold_uncertainty_score":0.2127169},"labels":[],"label_agreement":null},{"id":"W2113958730","doi":"10.1109/glocom.2008.ecp.288","title":"A Simple, Two-Level Markovian Traffic Model for IPTV Video Sources","year":2008,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"IPTV; Computer science; Real-time computing; Markov process; Markov chain; Queue; Frame (networking); Computer network; Variable bitrate; Group of pictures; Algorithm; Bit rate; Decoding methods; Statistics","score_opus":0.04100074172206641,"score_gpt":0.2475681259144796,"score_spread":0.2065673841924132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113958730","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03278064,0.00010881516,0.9629179,0.0014022504,0.00015329191,0.00032345206,0.0000065284744,0.00048341285,0.0018237117],"genre_scores_gemma":[0.9055552,0.000012908649,0.08410675,0.0017890438,0.00017173406,0.00008840417,0.0000039181655,0.000014152177,0.008257892],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855477,0.000031708736,0.00026757884,0.0004625624,0.00023383019,0.00044954126],"domain_scores_gemma":[0.99901617,0.00019232453,0.00006693691,0.0004479208,0.0001038816,0.00017277588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002015067,0.00018733063,0.00021897044,0.00007965507,0.00031447026,0.00008849052,0.00076286116,0.000063565094,0.000031207],"category_scores_gemma":[0.000022304728,0.00016200716,0.00015090169,0.00021811808,0.000060867183,0.00033646025,0.0000795069,0.00009536576,0.000043883305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004103139,0.00010518116,0.00011154119,0.0000085405645,0.00003943167,0.000012215217,0.0008057384,0.39479882,0.00003171535,0.05701947,0.0306551,0.5163712],"study_design_scores_gemma":[0.001180619,0.000053686177,0.00015351971,0.0000042384127,0.000007750968,0.00002780108,0.00001460976,0.99248284,0.000017702532,0.0012400586,0.00458504,0.0002321178],"about_ca_topic_score_codex":0.0000087556655,"about_ca_topic_score_gemma":0.00008709884,"teacher_disagreement_score":0.8788111,"about_ca_system_score_codex":0.000023060558,"about_ca_system_score_gemma":0.00014956243,"threshold_uncertainty_score":0.66064596},"labels":[],"label_agreement":null},{"id":"W2114045559","doi":"10.1109/vetecf.2005.1559033","title":"Design of link layer protocols for error recovery in IP/CDMA2000 interconnections","year":2006,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"CDMA2000; Link layer; Computer science; Frame (networking); Radio Link Protocol; Computer network; Wireless; Layer (electronics); Data link layer; Transport layer; TCP tuning; Fading; Transmission Control Protocol; Physical layer; Channel (broadcasting); Telecommunications","score_opus":0.042070578783660655,"score_gpt":0.2844214149516306,"score_spread":0.24235083616796993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114045559","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00049328856,0.00001648359,0.9890561,0.001323164,0.00012899529,0.006865782,0.0000012290905,0.00010390361,0.0020110598],"genre_scores_gemma":[0.68475485,0.0000022890677,0.28609997,0.0004966806,0.00029450867,0.020630855,0.0000026371997,0.000017039125,0.00770121],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912447,0.000060790324,0.00030570553,0.00023109607,0.000086006214,0.00019193135],"domain_scores_gemma":[0.9992811,0.00028449926,0.000073592615,0.00025223006,0.000081967664,0.000026615087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031522033,0.00008953726,0.0001570593,0.00010765574,0.000036970683,0.000045238325,0.00032416452,0.00006240814,0.000036253765],"category_scores_gemma":[0.000022764574,0.0000791063,0.00006163627,0.0002575121,0.000018520743,0.00024952219,0.00003157057,0.00006683012,0.00001328585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001659787,0.00032138568,0.00020139704,0.000030239067,0.000023392571,0.0000038027235,0.000118651835,0.11679482,0.0010920962,0.13967758,0.013572242,0.72799844],"study_design_scores_gemma":[0.0016191476,0.00043493792,0.00042549428,0.00008190055,0.0000055738283,0.0000053686767,0.000014437129,0.96379083,0.0023802244,0.015788965,0.015238494,0.00021459485],"about_ca_topic_score_codex":0.000060835413,"about_ca_topic_score_gemma":0.00014266228,"teacher_disagreement_score":0.84699607,"about_ca_system_score_codex":0.00002835767,"about_ca_system_score_gemma":0.00008583518,"threshold_uncertainty_score":0.32258612},"labels":[],"label_agreement":null},{"id":"W2114058452","doi":"10.1109/lcn.2000.891078","title":"The performance of TCP over ATM on lossy ADSL networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; University of Calgary","funders":"H2020 European Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"CUBIC TCP; TCP global synchronization; Computer science; Asymmetric digital subscriber line; Computer network; TCP acceleration; TCP Friendly Rate Control; TCP tuning; Transmission Control Protocol; Zeta-TCP; TCP delayed acknowledgment; Packet loss; Digital subscriber line; Real-time computing; Network packet","score_opus":0.008372953829554075,"score_gpt":0.18654316232273946,"score_spread":0.17817020849318538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114058452","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37617484,0.0033223203,0.48094475,0.008469988,0.0030361982,0.0005867145,9.0011366e-7,0.00063626026,0.12682801],"genre_scores_gemma":[0.99144024,0.00028513835,0.00034879797,0.0007985184,0.00013531442,0.0000070639,1.171887e-7,0.0000038164217,0.006980979],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992189,0.000042708143,0.00016156303,0.00016592827,0.0001954093,0.00021553204],"domain_scores_gemma":[0.9991672,0.00024589448,0.00006014574,0.00044261618,0.00003607941,0.000048069687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018927026,0.000084755055,0.00009037609,0.00001632798,0.00017568853,0.000059350292,0.0005600197,0.000038734208,0.00013985163],"category_scores_gemma":[0.000007753136,0.000051229752,0.000050407732,0.00019160194,0.00005189184,0.0001303573,0.0000586642,0.00013923981,0.00010415747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010304809,0.000039387694,0.00083801686,0.0000016483914,0.000014221008,0.0000014811674,0.00005136655,0.023574838,0.000002723443,0.08550713,0.026717532,0.8632414],"study_design_scores_gemma":[0.00022554804,0.00011378312,0.0020028178,0.0000102491085,0.0000021155427,0.000002135467,0.000002484551,0.97396433,0.00002567122,0.000031641972,0.023550095,0.0000691297],"about_ca_topic_score_codex":0.0000021225212,"about_ca_topic_score_gemma":0.000004448926,"teacher_disagreement_score":0.9503895,"about_ca_system_score_codex":0.000009881479,"about_ca_system_score_gemma":0.0000061538854,"threshold_uncertainty_score":0.20890887},"labels":[],"label_agreement":null},{"id":"W2114215056","doi":"10.1109/glocom.2004.1378263","title":"QoS-oriented resource allocation for video traffic in the wireless internet","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Quality of service; Video quality; Application layer; Wireless; Wireless network; Network packet; Protocol stack; Resource allocation; Wireless sensor network; Telecommunications","score_opus":0.01074294141267584,"score_gpt":0.22796665242734374,"score_spread":0.2172237110146679,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114215056","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078739,0.00008927018,0.9017652,0.016364539,0.00018154537,0.00043116944,4.3780219e-7,0.00017104183,0.002257744],"genre_scores_gemma":[0.98926425,0.0000022870784,0.004894302,0.004075026,0.0002592681,0.00011098961,0.0000037678062,0.0000050121766,0.0013850776],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912226,0.0000785755,0.00020424667,0.00025376986,0.00013356148,0.0002075861],"domain_scores_gemma":[0.9993139,0.00025260274,0.00004733967,0.0003098104,0.000042344116,0.000034028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048505468,0.00009036482,0.00009177744,0.00005325908,0.000048742135,0.000091919,0.00068259245,0.00003582252,0.000012993624],"category_scores_gemma":[0.000018058143,0.00006276925,0.000047088746,0.00026366615,0.000022731587,0.00020360432,0.000032413194,0.000091704605,0.000030848525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018939285,0.000074003656,0.000021734373,0.0000023523735,0.0000054869993,9.814456e-7,0.0012324092,0.007423005,0.000009858917,0.20956302,0.030569533,0.75107867],"study_design_scores_gemma":[0.00050449464,0.00004107541,0.00010685632,0.000008357755,0.0000025477393,0.0000045701095,0.000099007084,0.7459192,0.000036640133,0.000050524603,0.25315505,0.00007165409],"about_ca_topic_score_codex":0.000007041493,"about_ca_topic_score_gemma":0.0002802614,"teacher_disagreement_score":0.91052526,"about_ca_system_score_codex":0.000030902786,"about_ca_system_score_gemma":0.000027878234,"threshold_uncertainty_score":0.2559656},"labels":[],"label_agreement":null},{"id":"W2114398437","doi":"10.1007/s10776-007-0061-6","title":"Enhancing Fairness and Throughput of TCP in Heterogeneous Wireless Access Networks","year":2007,"lang":"en","type":"article","venue":"International Journal of Wireless Information Networks","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer network; Computer science; TCP Westwood plus; TCP Friendly Rate Control; TCP global synchronization; TCP acceleration; CUBIC TCP; Zeta-TCP; TCP tuning; Network congestion; Wireless network; TCP Vegas; Throughput; Wireless; Network packet; Telecommunications","score_opus":0.007394912556597304,"score_gpt":0.25585527978806094,"score_spread":0.24846036723146364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114398437","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18842106,0.0003154947,0.80876744,0.00026326312,0.0018043986,0.00010306062,0.0000010140241,0.000023330793,0.0003009661],"genre_scores_gemma":[0.9971665,0.0005128892,0.0013068852,0.000520843,0.00046879565,0.0000030967992,0.00000495224,0.000007868048,0.000008162141],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973008,0.000066426466,0.0015277392,0.00013788448,0.0006581488,0.00030899592],"domain_scores_gemma":[0.99726844,0.00036597316,0.0012723184,0.00018420821,0.0007820066,0.0001270441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013863039,0.00018605776,0.00036068825,0.00045682766,0.0000455995,0.00030417487,0.0013547876,0.00016196992,0.000008375657],"category_scores_gemma":[0.00003694027,0.00017360706,0.00011122306,0.00040819336,0.00007905179,0.003363549,0.0002631939,0.00040945236,0.00000129408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001645413,0.00004856688,0.0037673002,0.000011330573,0.00008578918,0.000048384187,0.0005799563,0.3608658,0.000016616716,0.010364978,0.00011401063,0.6239327],"study_design_scores_gemma":[0.0015836667,0.00008385789,0.0048325667,0.00032773695,0.000010988484,0.00034310098,0.000120331875,0.99106663,0.00042960892,0.00034396545,0.0006469159,0.00021063186],"about_ca_topic_score_codex":0.000021226484,"about_ca_topic_score_gemma":0.00007886147,"teacher_disagreement_score":0.80874544,"about_ca_system_score_codex":0.00011026808,"about_ca_system_score_gemma":0.000082609266,"threshold_uncertainty_score":0.70794904},"labels":[],"label_agreement":null},{"id":"W2114597741","doi":"10.1109/glocom.2003.1258831","title":"Delay analysis for AIMD flows in wireless/IP networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer network; Computer science; Quality of service; Wireless network; Jitter; Queueing theory; Throughput; Channel (broadcasting); Wireless; Queue; Bottleneck; Real-time computing; Telecommunications; Embedded system","score_opus":0.009062106395231792,"score_gpt":0.2202081464066747,"score_spread":0.21114604001144288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114597741","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018498637,0.00012257085,0.9785564,0.0016309086,0.00019764956,0.00019380187,5.1390396e-7,0.00015733643,0.00064219156],"genre_scores_gemma":[0.96559304,0.000015878339,0.033090536,0.00085504405,0.0001109022,0.00006249243,0.0000042093698,0.0000053524373,0.0002625426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998942,0.000025556672,0.00023723346,0.00034676222,0.00012347054,0.0003249823],"domain_scores_gemma":[0.9993569,0.000115394665,0.000043854812,0.00034999874,0.000048878814,0.00008493789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025697573,0.000115183735,0.00022259269,0.00016174924,0.00006677281,0.000092537266,0.00049351325,0.00007513513,0.000017230721],"category_scores_gemma":[0.000007393445,0.00010074326,0.00016282874,0.0011770378,0.000014190434,0.00026215907,0.00005097932,0.00009435591,0.000014320097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070599644,0.000038737195,0.0007514673,0.0000010307715,0.00008106052,0.0000068396507,0.000041436422,0.6631807,0.0000025561417,0.17271453,0.00012056686,0.163054],"study_design_scores_gemma":[0.00086007,0.00003594225,0.0012195241,0.00000526688,0.000042343672,0.0000017172923,0.0000053238077,0.99475145,0.0000069232556,0.0021874025,0.0007451647,0.00013886884],"about_ca_topic_score_codex":0.000057626035,"about_ca_topic_score_gemma":0.0015826261,"teacher_disagreement_score":0.9470944,"about_ca_system_score_codex":0.000047726357,"about_ca_system_score_gemma":0.00004844081,"threshold_uncertainty_score":0.41081908},"labels":[],"label_agreement":null},{"id":"W2114907243","doi":"","title":"Market Managed Multi-service Internet (M3I): Economics driving Network Design","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"The Internet; Quality of service; Computer science; Scalability; Robustness (evolution); Network packet; Computer security; Computer network; Operations research; Engineering; World Wide Web","score_opus":0.029429256821346506,"score_gpt":0.19992436685472048,"score_spread":0.17049511003337398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114907243","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006390421,0.00020150289,0.9801128,0.0021305922,0.00068496866,0.0002262243,1.9993325e-7,0.000454571,0.015550094],"genre_scores_gemma":[0.6389064,0.0001249997,0.3308213,0.00526764,0.00035340892,0.00003639136,8.02032e-7,0.000021737964,0.024467278],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985169,0.00016526598,0.00029232597,0.00047242813,0.000090915826,0.00046213117],"domain_scores_gemma":[0.99884844,0.0002962578,0.00009531923,0.00056068215,0.000048789734,0.00015048988],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00046356436,0.00019763135,0.00020491799,0.0000527924,0.00011187648,0.000295806,0.001126982,0.00008097574,0.0009156478],"category_scores_gemma":[0.000012183929,0.00019107848,0.000070102826,0.00028013063,0.000020322765,0.00043435293,0.00025348767,0.00016459632,0.0005737509],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011584376,0.00010002683,0.0006388145,0.000007513567,0.00009075943,0.00002516747,0.0002952005,0.10550314,0.0000023351715,0.034801878,0.20807579,0.6504478],"study_design_scores_gemma":[0.0005365261,0.00002612062,0.0005640264,0.000017230073,0.000008238907,0.00001136422,0.000008975715,0.9724229,0.0000052244695,0.0002689487,0.025896119,0.00023435512],"about_ca_topic_score_codex":0.000015136016,"about_ca_topic_score_gemma":0.00016080307,"teacher_disagreement_score":0.86691976,"about_ca_system_score_codex":0.00004316413,"about_ca_system_score_gemma":0.000013209777,"threshold_uncertainty_score":0.9999977},"labels":[],"label_agreement":null},{"id":"W2115002145","doi":"10.1109/26.843194","title":"Extremal shape-controlled traffic patterns in high-speed networks","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Queueing theory; Upper and lower bounds; Ergodic theory; Queue; Probabilistic logic; Randomness; Channel (broadcasting); Computer science; Network packet; Channel capacity; Random variable; Renewal theory; Topology (electrical circuits); Mathematics; Computer network; Statistics; Combinatorics","score_opus":0.01734213812584941,"score_gpt":0.23626182671001797,"score_spread":0.21891968858416855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115002145","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060444098,0.0004133713,0.9295978,0.0059791803,0.00047120175,0.0008018522,0.00001467631,0.0005999939,0.001677842],"genre_scores_gemma":[0.9931263,0.0011488115,0.0034867178,0.00062516105,0.000054825043,0.0002773836,0.000008343812,0.000023999897,0.0012485052],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977872,0.00044123642,0.00061156217,0.0004492126,0.00025543178,0.00045537317],"domain_scores_gemma":[0.99653345,0.00071587774,0.00009303835,0.0024310902,0.00007113668,0.00015540762],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035968734,0.0002741179,0.00042132768,0.00025448375,0.00048354274,0.00017500333,0.0023051845,0.00015941309,0.00073464325],"category_scores_gemma":[0.0000035028074,0.00027634393,0.00022429289,0.00079754123,0.000102109116,0.00043122063,0.0000074349473,0.0007300268,0.00022844013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007382616,0.00046009087,0.000009049382,0.000001312496,0.00003520826,0.0000035685632,0.0001673275,0.45267445,0.0000076739,0.0011443214,0.00006137444,0.5453618],"study_design_scores_gemma":[0.0042841635,0.000082727915,0.00055426965,0.000050238203,0.00003220136,0.00001189417,0.000025692816,0.9934331,0.000008290317,0.000073048606,0.0011657529,0.00027859354],"about_ca_topic_score_codex":0.00006782137,"about_ca_topic_score_gemma":0.00088536006,"teacher_disagreement_score":0.93268216,"about_ca_system_score_codex":0.00009618845,"about_ca_system_score_gemma":0.00007991013,"threshold_uncertainty_score":0.9999689},"labels":[],"label_agreement":null},{"id":"W2115038766","doi":"10.1109/mascot.1995.378665","title":"The loading region: a framework for the performance evaluation of admission control policies for high speed networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Admission control; Scheduling (production processes); Sensitivity (control systems); Computer science; Control (management); Quality of service; Computer network; Artificial intelligence; Engineering; Operations management","score_opus":0.04191954590366734,"score_gpt":0.27397037477073344,"score_spread":0.2320508288670661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115038766","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003550716,0.0019403626,0.97601056,0.016220963,0.0007018949,0.0013273596,6.845375e-7,0.00006973303,0.00017772532],"genre_scores_gemma":[0.9938086,0.00020826701,0.0038548459,0.000807357,0.0005380274,0.00020692639,5.330248e-7,0.000008081586,0.0005673273],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987942,0.00008871476,0.00028109562,0.00020355653,0.00033133783,0.00030107805],"domain_scores_gemma":[0.99600226,0.002892626,0.0001944615,0.00048310347,0.0003760345,0.000051505573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012964517,0.00011888368,0.0001514935,0.000025283485,0.0006513582,0.00013232332,0.00067073427,0.00008159101,0.000015931962],"category_scores_gemma":[0.00026367974,0.00006225713,0.00010480374,0.00021799942,0.00006790626,0.00016832771,0.000034178676,0.000106084364,0.000002268528],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000482911,0.000016205133,0.0000690131,0.000003968997,0.000037317466,3.86052e-8,0.00014439451,0.07013394,0.000005604405,0.25367647,0.006223731,0.669641],"study_design_scores_gemma":[0.0011834999,0.00014144107,0.0004247948,0.000041100684,0.000062928164,0.0000025706818,0.000042391835,0.9902229,0.000047286012,0.003484051,0.0042592455,0.00008780949],"about_ca_topic_score_codex":0.0000045380057,"about_ca_topic_score_gemma":0.000004058889,"teacher_disagreement_score":0.9902579,"about_ca_system_score_codex":0.000030780517,"about_ca_system_score_gemma":0.000033116066,"threshold_uncertainty_score":0.50097865},"labels":[],"label_agreement":null},{"id":"W2115248402","doi":"10.1109/glocom.2005.1577728","title":"On optimizing token bucket parameters at the network edge under generalized processor sharing (GPS) scheduling","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Token bucket; Leaky bucket; Bounding overwatch; Computer science; Security token; Scheduling (production processes); Traffic shaping; Generalized processor sharing; Mathematical optimization; Computer network; Mathematics; Dynamic priority scheduling; Network traffic control; Quality of service; Round-robin scheduling","score_opus":0.03630965501397243,"score_gpt":0.27656494397902165,"score_spread":0.24025528896504922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115248402","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10827003,0.0036899014,0.79932237,0.048356973,0.001970973,0.0019377636,0.00006883754,0.0015359919,0.034847196],"genre_scores_gemma":[0.864261,0.0007963073,0.12633978,0.006324568,0.00036587534,0.00031147685,0.000057966146,0.000032803368,0.0015102435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99580806,0.0004346922,0.00091703836,0.00097233005,0.0005565851,0.0013112975],"domain_scores_gemma":[0.9951551,0.0005028262,0.00047414456,0.0031951133,0.00030910864,0.00036372265],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0009537711,0.0005838021,0.00055689964,0.000084083396,0.00177181,0.0009307023,0.0053757504,0.000258864,0.00019299112],"category_scores_gemma":[0.00006795697,0.0004981786,0.00027092858,0.0009741611,0.0002797666,0.0006923671,0.0010370372,0.00071717816,0.00054717873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053857893,0.00019277487,0.00021584312,0.000006889115,0.0001635477,0.0000031090165,0.0001296805,0.6326803,0.000018481865,0.21603303,0.03246374,0.118038744],"study_design_scores_gemma":[0.0017364474,0.000089049085,0.0003807539,0.00015143445,0.00008525272,0.00007691602,0.00007815197,0.9364707,0.00007854719,0.009892444,0.050128568,0.0008317407],"about_ca_topic_score_codex":0.00009804344,"about_ca_topic_score_gemma":0.0016217093,"teacher_disagreement_score":0.755991,"about_ca_system_score_codex":0.00071567803,"about_ca_system_score_gemma":0.00043191548,"threshold_uncertainty_score":0.999747},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010520426210779777,"score_gpt":0.21616616432632074,"score_spread":0.20564573811554096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115663543","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030916486,0.0009612512,0.9629928,0.0005837673,0.0021200376,0.0016612536,0.0000102109825,0.0004965938,0.0002576093],"genre_scores_gemma":[0.9950099,0.0007598667,0.0006675099,0.00016372006,0.00025913023,0.00043234215,0.000008687925,0.000040051877,0.0026587967],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99647516,0.00045696486,0.0008698304,0.0009261321,0.0005251591,0.00074672466],"domain_scores_gemma":[0.9982063,0.00042414464,0.00033245797,0.00056984305,0.00019283882,0.0002743946],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00089711644,0.00048756736,0.0006404754,0.00029179786,0.00043319035,0.0005777357,0.00047941288,0.00035712027,0.0000053389886],"category_scores_gemma":[0.00001979756,0.00050542643,0.00019881726,0.0005207755,0.0001295113,0.00036020504,0.0000066309035,0.00052868796,0.000023322542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010846639,0.00046085962,0.000068511086,0.00006027796,0.00011447393,0.000016790118,0.0008094138,0.45364448,0.00078274735,0.0034048369,0.00058370316,0.5389692],"study_design_scores_gemma":[0.006987603,0.0011985773,0.0013759569,0.00029757828,0.00009758354,0.000045786062,0.00005184727,0.9803876,0.0002346105,0.0002836407,0.008436831,0.00060236966],"about_ca_topic_score_codex":0.00010577456,"about_ca_topic_score_gemma":0.00032230493,"teacher_disagreement_score":0.9640934,"about_ca_system_score_codex":0.00014548536,"about_ca_system_score_gemma":0.000053497883,"threshold_uncertainty_score":0.9997397},"labels":[],"label_agreement":null},{"id":"W2115777847","doi":"10.1109/icc.2000.853734","title":"Design of proportional congestion control for high-speed networks with variable delays","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Ottawa","funders":"","keywords":"Bottleneck; Controller (irrigation); Computer science; Queue; Queueing theory; Control theory (sociology); Open-loop controller; Network congestion; Variable (mathematics); Node (physics); Computer network; Real-time computing; Control (management); Control engineering; Closed loop; Engineering; Embedded system; Mathematics","score_opus":0.01536420289389668,"score_gpt":0.19095726762167628,"score_spread":0.1755930647277796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115777847","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023933129,0.000141447,0.99705684,0.00089707255,0.000191412,0.00080530025,0.000002454579,0.00017045296,0.00049568823],"genre_scores_gemma":[0.817941,0.00000838969,0.18073438,0.0003448439,0.00010856748,0.000079219666,0.0000037063926,0.000008893183,0.000771006],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882185,0.000067219815,0.00029491616,0.00030702728,0.00022602016,0.00028296848],"domain_scores_gemma":[0.9987441,0.00038077284,0.00017071236,0.0002727146,0.0003482395,0.000083461186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036457414,0.00014212666,0.0002322652,0.00005009471,0.00010036635,0.000056260287,0.0003225773,0.00008325817,0.00013897271],"category_scores_gemma":[0.000021280159,0.0001075737,0.0000339509,0.00024800826,0.00005800749,0.00027195568,0.000016940516,0.00008203375,0.00000812174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010726716,0.00009404153,0.000075522155,0.00000497274,0.00005911996,0.0000019546403,0.000016976064,0.6762828,0.00009180245,0.2891595,0.002961712,0.03114432],"study_design_scores_gemma":[0.0026072303,0.00049366103,0.00013690595,0.000017454482,0.00003466481,0.000014379798,0.000002473307,0.99513066,0.000039964743,0.001059666,0.00031176436,0.00015119226],"about_ca_topic_score_codex":0.00000770761,"about_ca_topic_score_gemma":0.0000018158673,"teacher_disagreement_score":0.81770164,"about_ca_system_score_codex":0.00002156898,"about_ca_system_score_gemma":0.000053620708,"threshold_uncertainty_score":0.43867284},"labels":[],"label_agreement":null},{"id":"W2115808974","doi":"10.1109/itcc.2003.1197563","title":"Towards end-to-end loss guarantees for streaming video in a multi-hop IP network","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Packet loss; Computer network; Computer science; End-to-end principle; Hop (telecommunications); End-to-end delay; Data loss; Scheduling (production processes); End user; Quality of service; Network packet; Engineering","score_opus":0.019864899948137425,"score_gpt":0.26116170466261435,"score_spread":0.24129680471447693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115808974","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021195473,0.00025557447,0.97217077,0.0045003807,0.0005239037,0.0005195528,0.0000035838357,0.00025715082,0.0005736034],"genre_scores_gemma":[0.8235136,0.000013639687,0.17426372,0.0014708956,0.00024252798,0.00011527603,0.0000024476465,0.000011865168,0.00036602342],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982842,0.00003728635,0.00033323333,0.0005191389,0.00021783578,0.0006082842],"domain_scores_gemma":[0.99915427,0.00016564436,0.000057399964,0.00039770216,0.00008374383,0.0001412274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041003665,0.00020070432,0.00026967147,0.00010172488,0.000118946475,0.0001547501,0.00071183086,0.000082755294,0.00002860079],"category_scores_gemma":[0.000048183683,0.00017904035,0.00010374741,0.0005360901,0.00003342534,0.00030237256,0.00013625225,0.00012884187,0.000057408954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004045541,0.00011971502,0.00037515187,0.000009251108,0.00002469878,0.000027701282,0.00071141863,0.13392429,0.00004070777,0.122754976,0.0007600469,0.7412116],"study_design_scores_gemma":[0.00939255,0.00050420663,0.00946,0.0003435137,0.0000249279,0.000033645363,0.00023550888,0.9458797,0.0004896425,0.010841158,0.021707611,0.0010875245],"about_ca_topic_score_codex":0.00018541394,"about_ca_topic_score_gemma":0.0011079614,"teacher_disagreement_score":0.81195545,"about_ca_system_score_codex":0.0000852238,"about_ca_system_score_gemma":0.00015905547,"threshold_uncertainty_score":0.73010534},"labels":[],"label_agreement":null},{"id":"W2116052545","doi":"10.1109/icc.2005.1494360","title":"Optimization of resilient packet ring networks scheduling for MPEG-4 video streaming","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Jitter; Computer network; Network packet; Real-time computing; Scheduling (production processes); Quality of service; Transmission delay; Priority queue; End-to-end delay; Bitstream; Queue; Algorithm","score_opus":0.01018746595355916,"score_gpt":0.23067918185657615,"score_spread":0.220491715903017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116052545","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003600199,0.00026758594,0.99371505,0.000790534,0.00018707286,0.0002119327,5.0999137e-7,0.00015105213,0.0010760755],"genre_scores_gemma":[0.6317769,0.000019191191,0.3676826,0.0001451949,0.00018580667,0.00001488708,0.000002073371,0.000005487332,0.00016785458],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999057,0.000026472548,0.00028328228,0.0002586,0.00013680501,0.00023786312],"domain_scores_gemma":[0.9992306,0.00019637728,0.00011192276,0.0002721524,0.00012464167,0.000064305736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029245525,0.00009947624,0.00014365578,0.00005919864,0.000096575015,0.00006534884,0.00031289185,0.0000563974,0.000017494882],"category_scores_gemma":[0.000037674126,0.00009285271,0.00006536276,0.00019651446,0.00001796629,0.00032734065,0.00006443528,0.00006494419,0.0000024242163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069078974,0.00001693874,0.00005276247,0.000003322119,0.000007939163,1.5786807e-7,0.000037777194,0.70906615,0.00001408194,0.023916723,0.00012747163,0.26674977],"study_design_scores_gemma":[0.00049454975,0.00004007448,0.00004313603,0.000033248274,0.0000080157,0.0000013532149,0.000022905806,0.99829763,0.00024806138,0.00007609767,0.0006314708,0.000103443315],"about_ca_topic_score_codex":0.0000032358223,"about_ca_topic_score_gemma":0.000013291316,"teacher_disagreement_score":0.6281767,"about_ca_system_score_codex":0.000027665124,"about_ca_system_score_gemma":0.000033031705,"threshold_uncertainty_score":0.37864235},"labels":[],"label_agreement":null},{"id":"W2116204307","doi":"10.1023/a:1020157925260","title":"TCP Performance and Behaviors with Local Retransmissions","year":2002,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Goodput; Computer network; Timeout; TCP acceleration; Zeta-TCP; Transmission Control Protocol; TCP delayed acknowledgment; TCP Vegas; Throughput; TCP Westwood plus; Datagram; TCP global synchronization; Network packet; TCP Westwood; Wireless; Telecommunications","score_opus":0.01006158897202606,"score_gpt":0.18284181829171947,"score_spread":0.17278022931969342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116204307","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6087373,0.000543759,0.38904238,0.0013414278,0.000087237204,0.000030806375,5.8230746e-8,0.000018990875,0.00019805106],"genre_scores_gemma":[0.99385726,0.00015179976,0.005648035,0.00017883086,0.00010572942,1.8306925e-7,2.5629218e-8,0.0000049003033,0.00005325749],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992268,0.000071121314,0.00022476744,0.00007787847,0.00023021354,0.00016921671],"domain_scores_gemma":[0.9994471,0.00014298015,0.00008375852,0.00014409133,0.0000865422,0.000095517906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004914865,0.00008429006,0.00012801363,0.000046597463,0.00024101308,0.000051931373,0.0004225737,0.000026588901,0.00001589198],"category_scores_gemma":[0.0000048983516,0.00004596676,0.00002892229,0.00018000792,0.000089784626,0.00031306266,0.00004396329,0.00029579,0.0000036497675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014100225,0.00003251492,0.0024872131,0.0000052326945,0.00001736789,0.000023333467,0.0022225073,0.008386936,0.00009507457,0.00036815173,0.00051584846,0.98583174],"study_design_scores_gemma":[0.0006725939,0.00038797685,0.0057085427,0.00016931423,0.000040736577,0.0019340611,0.00026505432,0.9895344,0.00007788725,0.000024437459,0.0010633767,0.00012162611],"about_ca_topic_score_codex":0.0000024372841,"about_ca_topic_score_gemma":8.914085e-7,"teacher_disagreement_score":0.9857101,"about_ca_system_score_codex":0.000012612938,"about_ca_system_score_gemma":0.000018083805,"threshold_uncertainty_score":0.18744701},"labels":[],"label_agreement":null},{"id":"W2116555720","doi":"10.1109/wowmom.2008.4594814","title":"Mixed reliability video streaming in wireless networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Wireless; Packet loss; Video streaming; Reliability (semiconductor); Wireless network; Real-time computing; Network packet; Uncompressed video; Computer network; Video tracking; Video processing; Telecommunications; Computer hardware","score_opus":0.014749596681951563,"score_gpt":0.20258216191301442,"score_spread":0.18783256523106287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116555720","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31572145,0.000065490305,0.68023515,0.0006352552,0.00033390606,0.00010626718,1.1232562e-7,0.00022624322,0.002676114],"genre_scores_gemma":[0.993072,0.000040381517,0.005942499,0.00032923062,0.00008885087,0.000017196882,8.2085245e-7,0.0000048818683,0.0005041801],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988249,0.000091490794,0.00024687435,0.00037155655,0.00015990219,0.0003052923],"domain_scores_gemma":[0.9991586,0.00020983128,0.00004188594,0.00046230486,0.000041155476,0.000086182234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028287005,0.00011241307,0.00016744551,0.000049694445,0.00009620679,0.00003460666,0.0004860979,0.00007171521,0.000020730993],"category_scores_gemma":[0.000021549371,0.00009986318,0.000049149698,0.0004056273,0.000051755764,0.00028518162,0.0001030076,0.0001714081,0.000026201378],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016120388,0.00015003285,0.040601216,0.0000039044853,0.000008007631,0.000096106814,0.00020606254,0.04753338,0.000016117327,0.06569786,0.0035271035,0.8421441],"study_design_scores_gemma":[0.0004224783,0.00002299993,0.035124186,0.0000104021665,0.000001090407,0.000014879747,0.000010135322,0.9632947,0.000022124112,0.00027254704,0.0006694873,0.00013496268],"about_ca_topic_score_codex":0.00007191199,"about_ca_topic_score_gemma":0.00012952858,"teacher_disagreement_score":0.91576135,"about_ca_system_score_codex":0.00004072383,"about_ca_system_score_gemma":0.00004750527,"threshold_uncertainty_score":0.40723023},"labels":[],"label_agreement":null},{"id":"W2116605045","doi":"10.1109/mascot.2001.948870","title":"Improving ensemble-TCP performance on asymmetric networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Zeta-TCP; TCP global synchronization; TCP tuning; Transmission Control Protocol; Hypertext Transfer Protocol; Distributed computing; The Internet; World Wide Web; Network packet","score_opus":0.012664671867129397,"score_gpt":0.18430991677759534,"score_spread":0.17164524491046596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116605045","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054469723,0.0003749681,0.91745,0.00072160945,0.0006789208,0.00011390722,7.822376e-8,0.0004531459,0.074760415],"genre_scores_gemma":[0.9876158,0.000085411404,0.004450978,0.0018623128,0.00025418363,0.000013348683,2.865325e-7,0.000008053002,0.0057096025],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988307,0.00003499042,0.00018194188,0.0003483625,0.000230103,0.00037394438],"domain_scores_gemma":[0.9991803,0.00014782185,0.000062544634,0.00045312315,0.000041642892,0.00011456752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017732506,0.00014045439,0.00013013824,0.00013229129,0.00015819393,0.00014790047,0.0005760765,0.00006703818,0.00009225669],"category_scores_gemma":[0.000018305756,0.000116904564,0.000056592668,0.0007274097,0.000017234148,0.0003069416,0.00008125472,0.00019528434,0.0005181063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023653417,0.00003181171,0.00014466715,0.00000177597,0.0000050281405,0.0000045451525,0.000015801206,0.0113847945,0.0000034149834,0.01805735,0.005141436,0.96520704],"study_design_scores_gemma":[0.00033701706,0.00013958206,0.00048830925,0.000008151645,0.00000301907,0.000009479647,0.0000020577004,0.99397826,0.00004354416,0.000020330186,0.004811043,0.00015923307],"about_ca_topic_score_codex":0.0000041166336,"about_ca_topic_score_gemma":0.0000016935707,"teacher_disagreement_score":0.9825934,"about_ca_system_score_codex":0.000029069446,"about_ca_system_score_gemma":0.00000765072,"threshold_uncertainty_score":0.665938},"labels":[],"label_agreement":null},{"id":"W2116644713","doi":"10.1109/comst.2003.5341336","title":"A survey of congestion control schemes for multicast video applications","year":2003,"lang":"en","type":"article","venue":"IEEE Communications Surveys & Tutorials","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Multicast; Computer science; Computer network; Source-specific multicast; Xcast; Network congestion; Pragmatic General Multicast; Protocol Independent Multicast; IP multicast; Reliable multicast","score_opus":0.06006263821581065,"score_gpt":0.3139988111232882,"score_spread":0.25393617290747755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116644713","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009650434,0.0013724549,0.9936581,0.00048956,0.001035316,0.0016258109,0.00019517583,0.00018697778,0.00047155688],"genre_scores_gemma":[0.96376616,0.00014412892,0.034298245,0.000082599196,0.00011678982,0.0013588783,0.000073891555,0.000021397618,0.00013793437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99405813,0.0040511354,0.0008646684,0.0004221327,0.00026488272,0.00033902982],"domain_scores_gemma":[0.9862383,0.008405359,0.00048300737,0.00310441,0.0016323922,0.00013655523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008828383,0.00022479864,0.0005156929,0.00013637448,0.00039219522,0.00011850873,0.0021229975,0.00015449707,0.000010080184],"category_scores_gemma":[0.002067546,0.00023418116,0.00013876126,0.0007463745,0.0002961629,0.00032740773,0.000084910505,0.0001715705,0.000032969907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049519596,0.0010565337,0.007586516,0.000046093905,0.00035020043,3.2602165e-7,0.00026109032,0.0013569419,0.0034785888,0.6616905,0.002665343,0.3214584],"study_design_scores_gemma":[0.01584473,0.00054722617,0.06679363,0.00017661424,0.00037337365,0.00001881029,0.000090865775,0.24975748,0.004375337,0.010220204,0.649605,0.0021967192],"about_ca_topic_score_codex":0.00016356372,"about_ca_topic_score_gemma":0.00039277476,"teacher_disagreement_score":0.9628011,"about_ca_system_score_codex":0.00006065723,"about_ca_system_score_gemma":0.00037494404,"threshold_uncertainty_score":0.9549631},"labels":[],"label_agreement":null},{"id":"W2116776909","doi":"10.1109/ccece.2014.6901082","title":"An adaptive compression technique based on real-time RTT feedback","year":2014,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Computer network; Packet loss; Lossless compression; Network packet; Real-time computing; Network traffic control; Data compression; Transmission delay; Data compression ratio; Latency (audio); Network congestion; Processing delay; Quality of service; End-to-end delay; Image compression; Algorithm; Telecommunications","score_opus":0.007612368056187124,"score_gpt":0.2209329445098944,"score_spread":0.21332057645370728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116776909","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006225707,0.0000028934364,0.93652225,0.000623382,0.000096353295,0.00023072743,6.3437193e-7,0.00072127365,0.061179947],"genre_scores_gemma":[0.90805334,0.0000013536775,0.08992373,0.0011146285,0.00010590892,0.00004284746,0.0000028352522,0.000009123139,0.0007462534],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880356,0.00021357792,0.00014571087,0.00038820208,0.00023013292,0.00021881738],"domain_scores_gemma":[0.9988501,0.00019866848,0.000054121036,0.00068206154,0.00007082499,0.0001442016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033755566,0.00014000243,0.00015318667,0.000068030415,0.00011109717,0.0000833342,0.0006428367,0.00008123184,0.00011944489],"category_scores_gemma":[0.000008852521,0.00010958361,0.00004616032,0.000170841,0.000031934553,0.00020591887,0.000043981214,0.000115854615,0.00026646676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011252284,0.0002643355,0.00005841484,0.0000029747396,0.0000056659164,0.0000055723476,0.000039147006,0.017305372,0.0067175766,0.15824108,0.010482017,0.8067653],"study_design_scores_gemma":[0.00039691248,0.00058786897,0.00043067356,0.000032950895,0.0000024154626,0.0000014499785,0.000002182497,0.9932155,0.0016338507,0.00070973183,0.0028266255,0.000159837],"about_ca_topic_score_codex":0.000018468072,"about_ca_topic_score_gemma":0.000003242061,"teacher_disagreement_score":0.9759101,"about_ca_system_score_codex":0.00002172588,"about_ca_system_score_gemma":0.000037080245,"threshold_uncertainty_score":0.44686902},"labels":[],"label_agreement":null},{"id":"W2116918320","doi":"10.1109/icfin.2009.5339575","title":"Improving data QoS in vehicular communication","year":2009,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Quality of service; Computer science; Computer network; Throughput; Vehicular ad hoc network; Controller (irrigation); Node (physics); Queue; Wireless ad hoc network; Network congestion; Queueing theory; Real-time computing; Distributed computing; Network packet; Wireless; Engineering; Telecommunications","score_opus":0.020112030339468446,"score_gpt":0.24596983177306586,"score_spread":0.2258578014335974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116918320","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048235697,0.0005610703,0.9795462,0.0094337,0.00013968376,0.00012754391,3.632492e-7,0.00020796344,0.005159892],"genre_scores_gemma":[0.9614607,0.000021044116,0.037041984,0.0012759744,0.000053218406,0.0000021543901,0.0000069360954,0.0000013616519,0.00013663915],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943054,0.000047820406,0.00011944406,0.00019622056,0.000088560184,0.00011741274],"domain_scores_gemma":[0.9985386,0.000046340825,0.000029259414,0.0013377003,0.00001898008,0.000029126375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030784417,0.00004771049,0.00006240753,0.000033632903,0.0000412678,0.00008134115,0.0015426456,0.000026572732,0.000007208062],"category_scores_gemma":[0.000020704809,0.000042932614,0.000009768683,0.00017220165,0.000008210641,0.00050836254,0.00020024872,0.000088889836,0.00002599538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010436588,0.000024542856,0.00008280723,4.4587546e-7,0.0000010165791,0.0000025056756,0.000032985485,0.0003787982,0.000067841276,0.066811025,0.0016558153,0.93094116],"study_design_scores_gemma":[0.00024380404,0.000015177674,0.002221055,0.000006685674,0.0000011689953,0.000002341253,0.0000072944795,0.9923885,0.000018357161,0.0006711027,0.0043590637,0.00006545181],"about_ca_topic_score_codex":0.000034861234,"about_ca_topic_score_gemma":0.000054809298,"teacher_disagreement_score":0.9920097,"about_ca_system_score_codex":0.00001202979,"about_ca_system_score_gemma":0.000027261349,"threshold_uncertainty_score":0.28666452},"labels":[],"label_agreement":null},{"id":"W2117016141","doi":"10.1109/policy.2004.1309174","title":"Policy control model: a key factor for the success of policy in telecom applications","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Innovation, Science and Economic Development Canada","funders":"","keywords":"Computer science; Context (archaeology); Key (lock); Stateless protocol; Control (management); Telecommunications; Telecommunications service; Process management; Computer network; Computer security; Engineering","score_opus":0.01183557190670202,"score_gpt":0.27069067070490266,"score_spread":0.2588550987982006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117016141","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012428828,0.00008171456,0.973986,0.022844,0.00002375064,0.0008424249,0.000018781675,0.0000821226,0.0008783066],"genre_scores_gemma":[0.989587,0.000019793039,0.007960368,0.0016059141,0.00016162821,0.0004529119,6.4848854e-7,0.000006776937,0.00020495843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991375,0.000017332408,0.00024825297,0.00020929117,0.00012729068,0.00026029052],"domain_scores_gemma":[0.9990338,0.00031728757,0.00007790561,0.0004245424,0.000085653366,0.00006081481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001219857,0.000101378304,0.0001611604,0.00014473831,0.00008576683,0.000052880318,0.00085196993,0.000047287864,0.0000029663324],"category_scores_gemma":[0.000040296643,0.0000696555,0.000079026715,0.0005770457,0.000049993687,0.00015754184,0.00004491755,0.00007532339,0.00000489858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007658333,0.00004772927,0.000060204686,0.000003566383,0.000010857462,7.8787664e-8,0.00021393789,0.14997959,0.000039569146,0.7088273,0.000019708514,0.1407898],"study_design_scores_gemma":[0.0020555353,0.000037877726,0.0008496803,0.0000059019017,0.0000054337424,0.000001660163,0.000012952514,0.96010405,0.00009788414,0.035506044,0.0012144496,0.00010850516],"about_ca_topic_score_codex":0.00044930333,"about_ca_topic_score_gemma":0.0003434127,"teacher_disagreement_score":0.98834413,"about_ca_system_score_codex":0.000065852626,"about_ca_system_score_gemma":0.00052354886,"threshold_uncertainty_score":0.2840469},"labels":[],"label_agreement":null},{"id":"W2117051459","doi":"10.1109/glocom.1996.591893","title":"Dynamic rate control of VBR MPEG video transmission over ATM networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Instituto de Telecomunicações","keywords":"Variable bitrate; Computer science; Computer network; Quality of service; Asynchronous Transfer Mode; Real-time computing; Network congestion; Constant bitrate; Transmission (telecommunications); Bit rate; Scheme (mathematics); Telecommunications","score_opus":0.0056083845345355435,"score_gpt":0.19464636306008282,"score_spread":0.18903797852554727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117051459","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002287248,0.0015108006,0.9900892,0.0018317945,0.00031177176,0.00020672388,9.088331e-7,0.00021685127,0.0035446957],"genre_scores_gemma":[0.9923098,0.0002057497,0.0035180254,0.0011164437,0.000052232455,0.000012272856,8.7656935e-7,0.000010135931,0.0027744817],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865645,0.00012284903,0.0003406404,0.00034583814,0.00020468172,0.0003295301],"domain_scores_gemma":[0.99903226,0.00022941333,0.00010429446,0.00043099766,0.0000619607,0.00014105633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002584255,0.00016863136,0.0002712085,0.000055111264,0.00008059119,0.000058742982,0.00054882205,0.00010210464,0.00063010835],"category_scores_gemma":[0.000008175412,0.0001353354,0.00013538949,0.00029889875,0.000048485763,0.00028060575,0.000031718046,0.00015068843,0.00005181106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029443736,0.00009968854,0.00016157208,0.00000699356,0.000044588618,0.000012127619,0.00009041284,0.04372388,0.00038056597,0.02157285,0.0041823713,0.9296955],"study_design_scores_gemma":[0.0016303182,0.00008140251,0.00092193147,0.000024477857,0.000016299626,0.000004882029,0.0000027102603,0.9881338,0.000023190269,0.0002600598,0.008739513,0.00016140997],"about_ca_topic_score_codex":0.000008676409,"about_ca_topic_score_gemma":0.0000071443055,"teacher_disagreement_score":0.99002254,"about_ca_system_score_codex":0.00002256849,"about_ca_system_score_gemma":0.000013948746,"threshold_uncertainty_score":0.6899245},"labels":[],"label_agreement":null},{"id":"W2117259077","doi":"10.1109/glocom.2001.965886","title":"Using TCP models to understand bandwidth assurance in a Differentiated Services network","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Computer network; Provisioning; Bandwidth (computing); Network traffic control; Bandwidth management; Network packet; Distributed computing","score_opus":0.06524398549172522,"score_gpt":0.23369381464375688,"score_spread":0.16844982915203166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117259077","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058606718,0.00043798253,0.9359385,0.0009267137,0.00025906594,0.00018660707,6.40667e-7,0.0001860463,0.0034577274],"genre_scores_gemma":[0.9789558,0.00003202704,0.019177832,0.0012907193,0.00007885577,0.000005186862,5.250986e-7,0.000008020765,0.00045101374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872774,0.00006767496,0.00022552013,0.0003663159,0.00020607881,0.00040667038],"domain_scores_gemma":[0.9993878,0.000076876466,0.00004517686,0.00032275874,0.00004105134,0.00012631001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012387625,0.00014645571,0.00019558362,0.000074784286,0.00009308527,0.00018042354,0.00050142163,0.000057267294,0.000085162574],"category_scores_gemma":[0.0000014763397,0.00013050115,0.000038745566,0.0007914987,0.000011564158,0.00042730695,0.00009911502,0.0000961783,0.00004547246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012219552,0.000068871996,0.0006806517,0.000011435072,0.000020244075,0.000011579398,0.0010216401,0.9174268,0.000037501257,0.043540422,0.0014854098,0.035683203],"study_design_scores_gemma":[0.0005069202,0.000021127475,0.00032236142,0.000069006004,0.0000034090974,0.0000026071,0.00003982242,0.99570864,0.000004371655,0.002952094,0.00019633374,0.00017330676],"about_ca_topic_score_codex":0.000063375264,"about_ca_topic_score_gemma":0.00056031375,"teacher_disagreement_score":0.9203491,"about_ca_system_score_codex":0.000046636156,"about_ca_system_score_gemma":0.000013735156,"threshold_uncertainty_score":0.53216827},"labels":[],"label_agreement":null},{"id":"W2117376236","doi":"10.1109/icc.2006.254876","title":"A Feedback Control Model for Multiple-Link Adaptive Bandwidth Provisioning Systems","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Provisioning; Computer science; Bandwidth (computing); Quality of service; Computer network; Dynamic bandwidth allocation; Bandwidth allocation; Adaptive control; Distributed computing; Control (management)","score_opus":0.07987083732580426,"score_gpt":0.3013197851380725,"score_spread":0.22144894781226826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117376236","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030145934,0.00017547655,0.97151893,0.010837035,0.0006653049,0.0008571741,0.0001755897,0.00025456105,0.015214485],"genre_scores_gemma":[0.9635703,0.000047913596,0.031905893,0.00042992076,0.00027190355,0.0007329515,0.00008134521,0.000018371042,0.0029414298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982044,0.00013314394,0.0005258214,0.0004344179,0.0003909355,0.00031124754],"domain_scores_gemma":[0.99657303,0.0007928175,0.0002989117,0.0012777034,0.00096923846,0.00008830923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003502866,0.00023557647,0.00025466562,0.0001670216,0.0004110429,0.00044125156,0.0028625936,0.00010932456,0.000009022539],"category_scores_gemma":[0.00006582832,0.00022897951,0.0001368461,0.00016014547,0.000116905445,0.00042775896,0.00013532452,0.00028142126,0.000067561305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060752944,0.00015816845,0.00008384976,0.0000030189572,0.000050081664,6.5728887e-7,0.00006810612,0.14141497,0.00017406185,0.8312252,0.0034126306,0.02334846],"study_design_scores_gemma":[0.0017396513,0.00007815917,0.000109422486,0.00009174436,0.000015716763,0.000004609383,0.000028331991,0.9845036,0.000016473889,0.008904089,0.004263283,0.00024490792],"about_ca_topic_score_codex":0.00013829397,"about_ca_topic_score_gemma":0.00022581765,"teacher_disagreement_score":0.9632688,"about_ca_system_score_codex":0.00013219636,"about_ca_system_score_gemma":0.0002562961,"threshold_uncertainty_score":0.93375134},"labels":[],"label_agreement":null},{"id":"W2117573063","doi":"10.1109/imtc.2009.5168508","title":"Measurement-based traffic characterization for Web 2.0 applications","year":2009,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Popularity; Web service; Quality of service; Web traffic; Traffic generation model; Web application; World Wide Web; Computer network; The Internet","score_opus":0.016656442769663344,"score_gpt":0.22327849149744422,"score_spread":0.20662204872778087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117573063","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008940681,0.000033464803,0.9910843,0.006362085,0.00008355672,0.0005493306,0.0000017788199,0.00043063343,0.0005608074],"genre_scores_gemma":[0.9824136,0.0000018591796,0.014692681,0.0023770924,0.00012515807,0.00021747276,0.000012828495,0.000003592103,0.00015571802],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927545,0.000016681812,0.00014389909,0.00022377758,0.00018098764,0.00015922637],"domain_scores_gemma":[0.9994444,0.000019970548,0.000048492457,0.00025759568,0.00016911789,0.000060392507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019604962,0.00007941717,0.000081010825,0.00004969541,0.00011046632,0.000093431845,0.00031195633,0.000034411678,0.00000880269],"category_scores_gemma":[0.0000071161926,0.00007315489,0.000052172352,0.00020782829,0.000007720912,0.00015996094,0.0000047204735,0.000031335403,0.00003356333],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049717623,0.00006850905,0.000003491905,0.0000022948798,0.00000329704,9.226482e-8,0.00000676093,0.00093225983,0.0059291786,0.054102775,0.0005128679,0.9384335],"study_design_scores_gemma":[0.0006443096,0.000066310175,0.000711215,0.0000060040893,0.000006741483,5.561431e-7,0.0000011981966,0.9323879,0.00028342998,0.0002007542,0.06557412,0.00011746723],"about_ca_topic_score_codex":8.0922355e-8,"about_ca_topic_score_gemma":0.0000017324468,"teacher_disagreement_score":0.9815195,"about_ca_system_score_codex":0.000026160647,"about_ca_system_score_gemma":0.00010196307,"threshold_uncertainty_score":0.298317},"labels":[],"label_agreement":null},{"id":"W2117580831","doi":"10.1109/icc.1997.609998","title":"Fuzzy leaky bucket congestion control in ATM networks with Markovian and self-similar traffic","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Fuzzy logic; Computer science; Leaky bucket; Fuzzy control system; Network congestion; Asynchronous Transfer Mode; Control theory (sociology); Fuzzy set; Mathematical optimization; Control (management); Mathematics; Artificial intelligence; Computer network; Quality of service","score_opus":0.0056902571976345535,"score_gpt":0.17059297448457378,"score_spread":0.16490271728693923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117580831","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14479615,0.0040236413,0.80845785,0.017102653,0.00069907866,0.0016908206,0.0000033957735,0.002015727,0.021210704],"genre_scores_gemma":[0.9925842,0.00023706688,0.0046986854,0.0017712686,0.00012418316,0.00004681383,0.0000013668323,0.000015458476,0.0005209007],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982836,0.00015516863,0.00028673877,0.00055442477,0.00023387036,0.0004861791],"domain_scores_gemma":[0.9990547,0.00022197954,0.00008263054,0.00038139566,0.00006574682,0.00019360075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003288318,0.00025375935,0.00031040222,0.00011138315,0.00011834769,0.00019685,0.0003632669,0.00014019998,0.000052522384],"category_scores_gemma":[0.00000957621,0.00020613274,0.000039686176,0.00043601653,0.000073956515,0.00042141342,0.000041496503,0.00027435806,0.000025613142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009249716,0.00037861805,0.005736646,0.000014929176,0.00009064976,0.00016823685,0.00048669812,0.14146836,0.0000038039175,0.030783478,0.006496114,0.81428],"study_design_scores_gemma":[0.0032002775,0.00024365295,0.0053265924,0.0000306826,0.000021239664,0.00006791098,0.000022456503,0.9874527,4.985665e-7,0.000081191756,0.003255365,0.00029744767],"about_ca_topic_score_codex":0.000009484222,"about_ca_topic_score_gemma":0.00026264635,"teacher_disagreement_score":0.8477881,"about_ca_system_score_codex":0.00004249975,"about_ca_system_score_gemma":0.000023155875,"threshold_uncertainty_score":0.84058493},"labels":[],"label_agreement":null},{"id":"W2117751957","doi":"10.1109/icc.2002.997060","title":"Bandwidth allocation and preemption for supporting differentiated-service-aware traffic engineering in multi-service networks","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Nortel (Canada)","funders":"","keywords":"Preemption; Computer science; Bandwidth (computing); Dynamic bandwidth allocation; Bandwidth allocation; Computer network; Bandwidth management; Fragmentation (computing); Distributed computing; Operating system","score_opus":0.01803744647422681,"score_gpt":0.23484783664024478,"score_spread":0.21681039016601797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117751957","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20445973,0.00010653476,0.7942419,0.00042306978,0.00016734921,0.0003870662,3.9664076e-7,0.00019800298,0.000015947895],"genre_scores_gemma":[0.9870384,0.000018956303,0.012300334,0.0004220892,0.000036249003,0.000106469604,0.000013400013,0.000013684779,0.0000504468],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988019,0.00004502102,0.00031651784,0.00037982443,0.00010172968,0.0003550321],"domain_scores_gemma":[0.9993802,0.00013836888,0.00008454634,0.00021185364,0.00009285957,0.000092219874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033769998,0.00016711497,0.00017391366,0.000088536864,0.00007597402,0.0001290079,0.00021901476,0.00010262902,0.000009073826],"category_scores_gemma":[0.00002597559,0.00016298665,0.000032116426,0.00038092388,0.0000048487436,0.0003344726,0.00003347142,0.00011682401,0.000002847267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001817386,0.00013155676,0.002666891,0.00010726727,0.000028445778,0.000002307973,0.000706366,0.7931256,0.00012319826,0.013035578,0.00006891748,0.18998568],"study_design_scores_gemma":[0.0015716575,0.000032828106,0.005741188,0.000042084823,0.000009352024,0.000005051845,0.000038796457,0.9921662,0.00003421628,0.000023910248,0.00014518961,0.00018952314],"about_ca_topic_score_codex":0.000015118702,"about_ca_topic_score_gemma":0.0005555111,"teacher_disagreement_score":0.78257865,"about_ca_system_score_codex":0.00002960765,"about_ca_system_score_gemma":0.000027996874,"threshold_uncertainty_score":0.66464025},"labels":[],"label_agreement":null},{"id":"W2117842023","doi":"10.1109/ccece.2003.1226063","title":"An adaptive playout algorithm with delay spike detection for real-time VoIP","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Network packet; Voice over IP; Algorithm; Real-time computing; Network delay; The Internet; Computer network; End-to-end delay","score_opus":0.006835292610438472,"score_gpt":0.21082223318718027,"score_spread":0.2039869405767418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117842023","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00464946,0.000012795347,0.99277866,0.00022924558,0.00014100397,0.00035819534,0.0000030038384,0.0004823017,0.0013453392],"genre_scores_gemma":[0.6163699,0.0000033895642,0.38268206,0.00020202603,0.00018081468,0.00007165783,0.000003022836,0.000011426302,0.00047573543],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990022,0.000025561547,0.00013847875,0.00038968955,0.00017133796,0.00027270967],"domain_scores_gemma":[0.9992955,0.00005415435,0.000058751473,0.00032452084,0.00013596631,0.00013114531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015473708,0.0001411964,0.00013759192,0.00005598488,0.0001604916,0.000103589606,0.00033120738,0.00006477104,0.000010760381],"category_scores_gemma":[0.0000030978765,0.00010918167,0.000044476827,0.00019793693,0.000031906937,0.00048368264,0.000019972702,0.00007250687,0.000054059892],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008204174,0.00006909982,0.0000031039574,0.0000011362973,0.000025758198,0.000010382281,0.00014089837,0.014708446,0.00033861081,0.01829143,0.00006985374,0.96625924],"study_design_scores_gemma":[0.0015398538,0.0017839931,0.00011359229,0.000011024811,0.000016050824,0.000043640346,0.000032338357,0.9932477,0.0010217372,0.0014831931,0.00048382254,0.00022306586],"about_ca_topic_score_codex":0.00009751873,"about_ca_topic_score_gemma":0.0001716737,"teacher_disagreement_score":0.9785392,"about_ca_system_score_codex":0.000059775248,"about_ca_system_score_gemma":0.000098423654,"threshold_uncertainty_score":0.4452299},"labels":[],"label_agreement":null},{"id":"W2117890135","doi":"10.1109/imtc.2005.1604593","title":"Packet Loss Measurement and Control for VPN based Services","year":2005,"lang":"en","type":"article","venue":"2005 IEEE Instrumentationand Measurement Technology Conference Proceedings","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Packet loss; Computer network; Computer science; Bandwidth throttling; Quality of service; Network packet; Provisioning; Service provider; Controller (irrigation); Packet switching; End-to-end delay; Service (business); Real-time computing; Engineering","score_opus":0.02303898404500268,"score_gpt":0.22692078647541852,"score_spread":0.20388180243041584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117890135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.098691255,0.00079071004,0.84973586,0.046545774,0.0004943039,0.002177319,0.000018845276,0.0010367101,0.0005092516],"genre_scores_gemma":[0.9762818,0.00006223512,0.021166652,0.0015346417,0.00013857555,0.000757884,0.0000029691776,0.000017504652,0.000037729646],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971849,0.000016427004,0.0005016509,0.0007363063,0.00093709514,0.0006236642],"domain_scores_gemma":[0.99766755,0.000028397486,0.00029110134,0.00022740262,0.0016145261,0.00017100638],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001146299,0.00034835484,0.00034715552,0.00034296446,0.000347009,0.00028695786,0.00072770106,0.00022179885,0.000019296482],"category_scores_gemma":[0.000050076804,0.00033459096,0.000069046146,0.00029956174,0.00017596042,0.0007805323,0.00004611689,0.0001969038,0.000017121456],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018160949,0.00032256058,0.010463411,0.00020216519,0.00023487893,0.0000018628833,0.0004182385,0.000095117975,0.02839112,0.10355098,0.0021249945,0.8540131],"study_design_scores_gemma":[0.030748144,0.0012038379,0.003759727,0.0009342887,0.0003996175,0.0000907373,0.0010678195,0.7424484,0.097644456,0.021924974,0.0975294,0.0022485985],"about_ca_topic_score_codex":0.0000037997274,"about_ca_topic_score_gemma":0.000076724304,"teacher_disagreement_score":0.87759054,"about_ca_system_score_codex":0.00027680106,"about_ca_system_score_gemma":0.00033336453,"threshold_uncertainty_score":0.9999106},"labels":[],"label_agreement":null},{"id":"W2118083943","doi":"10.1109/cjece.2005.1541738","title":"On the point-of-presence optimization problem in IP networks","year":2005,"lang":"en","type":"article","venue":"Canadian Journal of Electrical and Computer Engineering","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Computer network; Node (physics); Set (abstract data type); Routing (electronic design automation); Point (geometry); Protocol (science); The Internet; Routing protocol; Optimization problem; Distributed computing; Algorithm; Mathematics; Engineering","score_opus":0.003691880056747633,"score_gpt":0.15404893974031006,"score_spread":0.15035705968356242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118083943","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064766724,0.0007277066,0.9906861,0.0018697021,0.00013635364,0.00005452201,8.9064116e-8,0.000007075732,0.000041731433],"genre_scores_gemma":[0.97582984,0.000025835901,0.023674348,0.00028171806,0.00017728427,0.0000013379863,8.029294e-8,0.0000036887807,0.000005857211],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938095,0.000027476286,0.00022253937,0.000084591,0.0000827203,0.0002017302],"domain_scores_gemma":[0.9993337,0.00029731382,0.00006267005,0.00008501574,0.000052145795,0.00016915626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020352817,0.00007248743,0.00012057707,0.00016402136,0.000032581484,0.000061951505,0.0003187886,0.00003475212,0.000003799004],"category_scores_gemma":[0.000030532687,0.000053215546,0.000031812113,0.00036138468,0.000012355118,0.00015189948,0.000012518769,0.00023684851,3.1504624e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018816067,0.0000044912777,0.000060577036,0.00000105785,0.0000055633677,0.000010895798,0.000045655328,0.84800273,9.026387e-7,0.031281684,0.00032758206,0.12025699],"study_design_scores_gemma":[0.00016257979,0.00009815963,0.00043540698,0.00005722269,0.0000020108423,0.00004685524,5.7282864e-7,0.9985495,0.0000053408717,0.00015109153,0.00043392376,0.00005730236],"about_ca_topic_score_codex":0.00002650006,"about_ca_topic_score_gemma":0.000057138495,"teacher_disagreement_score":0.9693532,"about_ca_system_score_codex":0.000037930367,"about_ca_system_score_gemma":0.00010370436,"threshold_uncertainty_score":0.2170067},"labels":[],"label_agreement":null},{"id":"W2118117953","doi":"10.1109/pacrim.1997.620374","title":"End-to-end acknowledgments for indirect TCP over wireless internetworks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Zeta-TCP; Computer network; TCP acceleration; Computer science; TCP global synchronization; TCP hole punching; TCP Friendly Rate Control; TCP tuning; TCP Westwood; Compound TCP; Transmission Control Protocol; Network packet","score_opus":0.020561859743106252,"score_gpt":0.23799840500429656,"score_spread":0.2174365452611903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118117953","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012492822,0.00021849608,0.9647756,0.0011798055,0.0015828246,0.00045297563,0.0000027097467,0.00037432867,0.018920416],"genre_scores_gemma":[0.96854395,0.000018376004,0.006620483,0.0021479118,0.00040593738,0.00011299005,0.0000019263055,0.000014260056,0.022134174],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986337,0.00004013675,0.00023515166,0.00045698957,0.00020997727,0.00042405393],"domain_scores_gemma":[0.9990628,0.00019278548,0.000057105615,0.00040896007,0.000085341126,0.0001930325],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00019133848,0.00017480686,0.00021066939,0.000091654285,0.00009798801,0.00017973245,0.00081653934,0.000083016,0.0010836663],"category_scores_gemma":[0.00001690689,0.00015332103,0.00010429485,0.0003098401,0.000024192092,0.00025377594,0.00017662882,0.000117001546,0.0005439302],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008975913,0.00007301772,0.00032114855,0.0000043061887,0.00004002478,0.0000033921465,0.00024057977,0.0002379119,0.000017379207,0.016337939,0.11646106,0.86625427],"study_design_scores_gemma":[0.00086108386,0.00011883624,0.0004373151,0.000032268024,0.0000105674035,0.0000038168046,0.000007606312,0.8638213,0.00015624332,0.00023492715,0.13405253,0.0002634891],"about_ca_topic_score_codex":0.000005482621,"about_ca_topic_score_gemma":0.00006473602,"teacher_disagreement_score":0.95815516,"about_ca_system_score_codex":0.000046043886,"about_ca_system_score_gemma":0.000014897538,"threshold_uncertainty_score":0.9998295},"labels":[],"label_agreement":null},{"id":"W2118670142","doi":"10.1109/icc.1995.524274","title":"A connectionist implementation of the VCQ ATM switch","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Connectionism; Asynchronous Transfer Mode; Queue; Quality of service; Scheduling (production processes); Queueing theory; Distributed computing; Computer network; Artificial neural network; Artificial intelligence","score_opus":0.011321966644110025,"score_gpt":0.21832390335515792,"score_spread":0.20700193671104788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118670142","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057921965,0.0001765875,0.8791639,0.032739475,0.0011345586,0.00039585735,0.0000014113863,0.0002396506,0.028226588],"genre_scores_gemma":[0.99647444,0.0000054736315,0.0009574758,0.00062469096,0.000036520098,0.000008307535,1.1511898e-7,0.0000015866754,0.0018913883],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955225,0.000027611171,0.00011650662,0.00010241784,0.00011628339,0.00008492998],"domain_scores_gemma":[0.99963194,0.00003479805,0.00005128011,0.00022083883,0.00004204186,0.000019111403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000067877845,0.000040124916,0.000048846272,0.000011952901,0.00009819029,0.00003848023,0.00027168504,0.000014003005,0.00039599198],"category_scores_gemma":[0.000003592026,0.000026376943,0.000039006976,0.0001904681,0.00001853555,0.00010210096,0.00004214426,0.000033068034,0.000034807075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.455948e-7,0.000027016224,0.0016893528,0.0000019666563,0.000013934482,3.6003965e-7,0.00029957746,0.0001453065,0.00014506279,0.27341238,0.021314723,0.7029496],"study_design_scores_gemma":[0.0022369819,0.00017607029,0.019198488,0.000015772366,0.00002699906,0.000033604305,0.00051144283,0.87458575,0.004903272,0.0035711762,0.09443087,0.000309596],"about_ca_topic_score_codex":0.000047997317,"about_ca_topic_score_gemma":0.00014901732,"teacher_disagreement_score":0.9385525,"about_ca_system_score_codex":0.000010089186,"about_ca_system_score_gemma":0.000011311129,"threshold_uncertainty_score":0.43358347},"labels":[],"label_agreement":null},{"id":"W2118703723","doi":"10.1109/glocom.2010.5683724","title":"Design and Evaluation of an Intelligent Rate Controller for Heterogeneous Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Router; Bottleneck; Bandwidth (computing); Network congestion; Queue; Fuzzy logic; Controller (irrigation); Queueing theory; Computer network; Real-time computing; Network packet; Embedded system","score_opus":0.031329430815312934,"score_gpt":0.27827891418254325,"score_spread":0.24694948336723033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118703723","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046366937,0.00013138767,0.9522083,0.00015526693,0.00032608316,0.0007103296,2.3192659e-7,0.00005055901,0.000050953564],"genre_scores_gemma":[0.9545765,0.0000075301086,0.044993382,0.0002027992,0.00008266192,0.00009052106,0.0000010120077,0.0000047561343,0.00004083219],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991533,0.00016070425,0.00018159338,0.00022219888,0.00013950965,0.00014268966],"domain_scores_gemma":[0.9990904,0.0002888206,0.00007144416,0.00021253477,0.0002610067,0.000075809476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001890861,0.00008164034,0.00012992726,0.00003203322,0.00005580847,0.000062571395,0.00021685837,0.000058792484,0.000019023904],"category_scores_gemma":[0.000033848846,0.000065843196,0.00003148236,0.00006111224,0.000030926876,0.00014126247,0.000024838791,0.00006144624,0.0000013342744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003838986,0.000025010739,0.0000056109907,9.68206e-7,0.000015730495,1.770469e-7,0.00003643991,0.2181415,0.000624969,0.011262406,0.000053624324,0.7697952],"study_design_scores_gemma":[0.001009966,0.00016850904,0.00005229945,0.000002133383,0.000025720343,0.0000054270035,0.0000029820778,0.9937205,0.0013223748,0.003423196,0.00018993772,0.000077002005],"about_ca_topic_score_codex":0.000002474904,"about_ca_topic_score_gemma":0.000017170903,"teacher_disagreement_score":0.90820956,"about_ca_system_score_codex":0.000005497909,"about_ca_system_score_gemma":0.0000381559,"threshold_uncertainty_score":0.26850075},"labels":[],"label_agreement":null},{"id":"W2118706526","doi":"10.1109/acc.2006.1657494","title":"Robust feedback linearization-based congestion control using a fluid flow model","year":2006,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Fluid queue; Control theory (sociology); Linearization; Computer science; Robust control; Queueing theory; Feedback linearization; Controller (irrigation); Sliding mode control; Network congestion; Convergence (economics); Flow control (data); Probabilistic logic; Variable structure control; Mathematical optimization; Control system; Mathematics; Nonlinear system; Engineering; Control (management)","score_opus":0.020063002184710504,"score_gpt":0.20514837678724698,"score_spread":0.1850853746025365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118706526","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025341727,0.00008472983,0.9934137,0.0015309897,0.00025558035,0.000261047,0.0000046814257,0.0004897137,0.0014253916],"genre_scores_gemma":[0.80365944,0.0000010492116,0.19440947,0.0010901103,0.0002103894,0.000015181774,0.0000123783975,0.00001249111,0.0005894969],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985945,0.00006897818,0.00031823158,0.0004070826,0.00028649197,0.0003247195],"domain_scores_gemma":[0.99905795,0.00012140279,0.00009140789,0.0003891452,0.0002484046,0.00009171432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021488377,0.00018734067,0.00020096195,0.00009600529,0.00018976066,0.00023851347,0.00038015368,0.000108398795,0.000037412203],"category_scores_gemma":[0.000021056452,0.00017542952,0.00008454252,0.0003414356,0.000044397533,0.00035792758,0.000027884056,0.00010660616,0.000046532117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014218549,0.000056336587,0.00016247749,0.000003050259,0.0000073165247,0.0000030498834,0.0000064417754,0.962996,0.00041295518,0.023024267,0.00089961913,0.012414255],"study_design_scores_gemma":[0.0017075778,0.000025547144,0.00012748805,0.000014871013,0.000019962734,0.0000039938377,0.0000014690822,0.9969979,0.00010875476,0.00060279947,0.00017002723,0.00021961803],"about_ca_topic_score_codex":0.00005833136,"about_ca_topic_score_gemma":0.000035583933,"teacher_disagreement_score":0.8011252,"about_ca_system_score_codex":0.00006104082,"about_ca_system_score_gemma":0.00023219833,"threshold_uncertainty_score":0.7153808},"labels":[],"label_agreement":null},{"id":"W2118733567","doi":"10.3233/scc-2001-258","title":"Trans‐Pacific Demonstrations (TPD): Network architecture, engineering and results","year":2001,"lang":"en","type":"article","venue":"Space Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Backup; Satellite; Telecommunications; Network architecture; Computer science; Communications satellite; Submarine; Telecommunications network; Computer network; Engineering; Operating system; Marine engineering","score_opus":0.014815259960883705,"score_gpt":0.2245896010008137,"score_spread":0.20977434103993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118733567","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008067989,0.0025203247,0.9273345,0.053196855,0.00014070288,0.00023666085,0.000005696988,0.0004393962,0.01531906],"genre_scores_gemma":[0.8640971,0.0012723499,0.13395452,0.000113251415,0.00008076636,0.00004665224,0.000012538144,0.000009391788,0.00041343665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990157,0.00009565429,0.00026003754,0.0002415572,0.000111940055,0.0002751509],"domain_scores_gemma":[0.99766415,0.00044095304,0.00006985676,0.0016382169,0.000057649704,0.0001291925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002981334,0.00013296473,0.00013044535,0.00007367861,0.00043256968,0.00015883181,0.0010441144,0.000060579434,0.0000032446471],"category_scores_gemma":[0.000050811046,0.0001373015,0.000047646405,0.00057764683,0.00009961973,0.00019517302,0.00017449482,0.00029259862,0.000010018288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002076609,0.00010667105,0.0006316505,0.000006124661,0.00006878817,0.000006585595,0.0013929455,0.07453177,0.00021409101,0.56469274,0.005429861,0.35289803],"study_design_scores_gemma":[0.00054770743,0.000038723374,0.0018524292,0.000042438784,0.000018368188,0.000067740395,0.0000516275,0.56983936,0.000003798414,0.002671068,0.4246257,0.00024102919],"about_ca_topic_score_codex":0.0000109955245,"about_ca_topic_score_gemma":0.00016362805,"teacher_disagreement_score":0.8632903,"about_ca_system_score_codex":0.0000162527,"about_ca_system_score_gemma":0.00004865015,"threshold_uncertainty_score":0.5598993},"labels":[],"label_agreement":null},{"id":"W2118861160","doi":"10.1109/ccece.2004.1349765","title":"A TCP congestion control algorithm for wireless Internet connections","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"TCP Friendly Rate Control; Computer science; TCP tuning; TCP Westwood plus; TCP Vegas; H-TCP; Computer network; CUBIC TCP; Network congestion; TCP global synchronization; TCP acceleration; Zeta-TCP; Algorithm; Frame (networking); The Internet; Network packet; Operating system","score_opus":0.009513138159514956,"score_gpt":0.2226926834157121,"score_spread":0.21317954525619714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118861160","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014595072,0.00006569867,0.9907422,0.004979857,0.00089580886,0.0004903035,0.00000679591,0.0005329487,0.0008268477],"genre_scores_gemma":[0.93693125,0.000006260903,0.05983009,0.001450236,0.00021973888,0.00022262464,0.0000050418616,0.000009943296,0.0013248061],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998962,0.000031911884,0.00022564772,0.0003579149,0.0001376019,0.00028496562],"domain_scores_gemma":[0.99916357,0.00019436033,0.00007001486,0.00026791487,0.00018308111,0.00012105773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019426596,0.00014215916,0.00018502802,0.0000717388,0.0001159291,0.00015293606,0.00040325892,0.00007942341,0.000027416578],"category_scores_gemma":[0.000020867308,0.00012859044,0.00010351527,0.00017945791,0.00004555804,0.000304156,0.000032945896,0.000098655495,0.000078435274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007494578,0.000054556047,0.000010561244,0.0000017336012,0.000031645835,0.000002750709,0.000049087826,0.0014176378,0.000035210378,0.41101512,0.00096012885,0.58641404],"study_design_scores_gemma":[0.0048303693,0.00023737283,0.00012053435,0.000020866868,0.000021865382,0.000038495895,0.000025561067,0.9774847,0.00023480198,0.0060759024,0.010680043,0.0002294903],"about_ca_topic_score_codex":0.00004774714,"about_ca_topic_score_gemma":0.00005760647,"teacher_disagreement_score":0.97606707,"about_ca_system_score_codex":0.000064043954,"about_ca_system_score_gemma":0.000095371,"threshold_uncertainty_score":0.5243766},"labels":[],"label_agreement":null},{"id":"W2119094792","doi":"10.1109/qshine.2005.41","title":"Path Protection with Pre-identification for MPLS Networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Backup; Multiprotocol Label Switching; Computer science; Reservation; Computer network; Path (computing); Focus (optics); Identification (biology); Distributed computing; Quality of service; Database","score_opus":0.008427419028996418,"score_gpt":0.20779568463933165,"score_spread":0.19936826561033524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119094792","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014901427,0.00005742463,0.9944264,0.0024106528,0.00014769427,0.0007165026,3.0795843e-7,0.00030655245,0.00044430824],"genre_scores_gemma":[0.9617816,0.0000056784856,0.034343343,0.00030042056,0.00033677166,0.00037980525,0.0000024193102,0.0000061157343,0.0028438473],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992919,0.000021667176,0.00014530787,0.0002600546,0.0001109347,0.00017015617],"domain_scores_gemma":[0.99948835,0.000033387485,0.000070955386,0.000271328,0.00008982961,0.000046160294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020401445,0.000078227655,0.0000714584,0.000029092162,0.00012198828,0.00014417368,0.0002331797,0.000042039304,0.000008733005],"category_scores_gemma":[0.0000063581433,0.000059466147,0.000029607249,0.00015885588,0.000013522197,0.00038760967,0.000016500226,0.000058068865,0.000017046363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024498004,0.000030093572,0.000025522751,0.000003195294,0.0000088502065,1.5533553e-7,0.000049251506,0.039014906,0.00004342022,0.038459647,0.0012755695,0.9210649],"study_design_scores_gemma":[0.0003933959,0.00009408079,0.00083834375,0.000008040737,0.0000057446127,0.0000056746144,0.0000038483154,0.98255426,0.0001101602,0.0002187689,0.01567273,0.0000949372],"about_ca_topic_score_codex":0.000004526964,"about_ca_topic_score_gemma":0.000033106397,"teacher_disagreement_score":0.96029145,"about_ca_system_score_codex":0.00002443394,"about_ca_system_score_gemma":0.000022442766,"threshold_uncertainty_score":0.24249591},"labels":[],"label_agreement":null},{"id":"W2119100512","doi":"10.1109/infcom.1996.493345","title":"AAL1 with FEC for the transport of CBR MPEG2 video over ATM networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Asynchronous Transfer Mode; Interleaving; Byte; Computer network; Quality of service; Key (lock); Convergence (economics); Forward error correction; Real-time computing; Telecommunications; Decoding methods; Computer hardware; Computer security","score_opus":0.010278466615812023,"score_gpt":0.18695056894958767,"score_spread":0.17667210233377564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119100512","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023791757,0.0005665502,0.99164283,0.0017771838,0.00019835969,0.00032309527,0.000001058978,0.000104762476,0.0030069686],"genre_scores_gemma":[0.991005,0.000056736335,0.00487238,0.00088956946,0.00014864656,0.000047398375,6.5951e-7,0.000007986542,0.0029716478],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991738,0.000016292915,0.00017794916,0.00022488167,0.00017500694,0.00023202866],"domain_scores_gemma":[0.9991218,0.00029026225,0.00006515496,0.00041089187,0.000057586778,0.00005430749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016066666,0.00011145789,0.00015093533,0.000017992003,0.00009714015,0.000030587064,0.0005168268,0.000046364345,0.00015388441],"category_scores_gemma":[0.0000029249823,0.00006223507,0.00008676541,0.00020131945,0.000059869657,0.00015519699,0.000016167944,0.00008109066,0.0000064791852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072328505,0.00012137924,0.002725331,0.00001170395,0.0001416462,0.0000067965957,0.0003146992,0.11213766,0.0000072758726,0.14446922,0.024440415,0.71555156],"study_design_scores_gemma":[0.0008031097,0.00012810888,0.003149381,0.000012447856,0.000027088056,0.0000051094694,0.000008885243,0.97250766,0.000015408825,0.00007809495,0.023157163,0.00010752016],"about_ca_topic_score_codex":0.000017463966,"about_ca_topic_score_gemma":0.0000864729,"teacher_disagreement_score":0.9886258,"about_ca_system_score_codex":0.0000072598255,"about_ca_system_score_gemma":0.000013947325,"threshold_uncertainty_score":0.25378725},"labels":[],"label_agreement":null},{"id":"W2119196405","doi":"10.1109/glocom.1992.276588","title":"Self-optimizing window flow control in high speed data networks","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Computer science; Window (computing); Convergence (economics); Stability (learning theory); Perturbation (astronomy); Algorithm; Process (computing); Network topology; Rate of convergence; Control theory (sociology); Artificial intelligence; Control (management); Machine learning; Computer network","score_opus":0.013130669496670005,"score_gpt":0.21268450657332738,"score_spread":0.1995538370766574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119196405","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005196505,0.00038975733,0.9909739,0.001096784,0.0007375142,0.0002865425,0.0000018578181,0.00040339425,0.0055906116],"genre_scores_gemma":[0.8447061,0.000041153617,0.15293261,0.0018696182,0.0001530751,0.000006704226,0.0000071882205,0.000010952848,0.00027259605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981181,0.0002093588,0.00032400704,0.00062283187,0.00022055865,0.0005051352],"domain_scores_gemma":[0.998221,0.0002573063,0.000070256996,0.0012713913,0.00004394629,0.00013613072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007727594,0.00018790437,0.00027810916,0.000080628415,0.00008785823,0.00020557405,0.0014263429,0.00010104195,0.00007473331],"category_scores_gemma":[0.000040140552,0.00016928703,0.000039279344,0.00046278792,0.00002257315,0.0006597842,0.00015449728,0.00025138224,0.000063212814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025210798,0.00021898071,0.002609825,0.0000062550416,0.00008624884,0.00010461928,0.000102700986,0.5998992,0.000012642419,0.21601322,0.0071908617,0.17373025],"study_design_scores_gemma":[0.0023183504,0.000027236476,0.0003044601,0.000010237394,0.000010977968,0.000014106244,0.000009081421,0.98956466,0.00000430167,0.0002644808,0.0072589386,0.00021316593],"about_ca_topic_score_codex":0.000019257994,"about_ca_topic_score_gemma":0.00004484445,"teacher_disagreement_score":0.8441864,"about_ca_system_score_codex":0.000037966995,"about_ca_system_score_gemma":0.000083002036,"threshold_uncertainty_score":0.6903325},"labels":[],"label_agreement":null},{"id":"W2119383750","doi":"10.1007/0-387-25551-6_10","title":"Duality-Based TCP Congestion Control with Error Analysis","year":2006,"lang":"en","type":"book-chapter","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université de Montréal; Group for Research in Decision Analysis; Institut National de la Recherche Scientifique","funders":"","keywords":"Network congestion; Computer science; Duality (order theory); Mathematical optimization; Bounded function; Utility maximization; Tracking error; Dual (grammatical number); Optimization problem; Maximization; Control (management); Algorithm; Mathematics; Computer network; Mathematical economics; Artificial intelligence","score_opus":0.010489142563322574,"score_gpt":0.20571538237260265,"score_spread":0.19522623980928008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119383750","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009548862,0.00015900667,0.71240765,0.0018489142,0.0001418657,0.0003286459,0.000023615774,0.00049860793,0.28458217],"genre_scores_gemma":[0.35302448,0.000006395248,0.009013471,0.0028911706,0.00033152243,0.00005925763,0.0001670648,0.000054257933,0.63445234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99737734,0.00007203135,0.00053282734,0.00093264785,0.0007025903,0.00038257847],"domain_scores_gemma":[0.99762267,0.00029765835,0.00042059872,0.0010966547,0.00037538123,0.00018706781],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003407876,0.00053955294,0.0008756714,0.00047181043,0.00014278319,0.00024421257,0.0007407099,0.00036768123,0.0004395232],"category_scores_gemma":[0.000006325577,0.00042706507,0.00042704277,0.0002694733,0.00014080653,0.00017567886,0.00004122917,0.00038826768,0.00018667208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009435604,0.000059724276,0.00020661525,0.000018884739,0.0017086883,0.00012053781,0.000010973041,0.098921865,0.000001022277,0.83930975,0.01031026,0.04923731],"study_design_scores_gemma":[0.003451359,0.0003166529,0.00063591654,0.00009353977,0.0029531003,0.000011726715,0.0000021281435,0.8425514,0.000003220628,0.002377859,0.14628933,0.0013137502],"about_ca_topic_score_codex":0.000052750056,"about_ca_topic_score_gemma":0.00040632064,"teacher_disagreement_score":0.8369319,"about_ca_system_score_codex":0.00008607032,"about_ca_system_score_gemma":0.00026441025,"threshold_uncertainty_score":0.9998181},"labels":[],"label_agreement":null},{"id":"W2119563075","doi":"10.1109/icc.2005.1494548","title":"Modeling wireless link layer by network for efficient evaluations of multimedia QoS","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Network calculus; Computer science; Quality of service; Concatenation (mathematics); Wireless network; Wireless; Computer network; Modular design; Multi-frequency network; Heterogeneous network; Distributed computing; Telecommunications; Mathematics","score_opus":0.022499688991217924,"score_gpt":0.27483470303257473,"score_spread":0.25233501404135683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119563075","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011083258,0.00038678845,0.9844387,0.0027645868,0.0003969506,0.00040163085,0.000004212124,0.00013635587,0.00038747862],"genre_scores_gemma":[0.8502755,0.000009240852,0.14816606,0.0003961843,0.00062895665,0.00007420252,0.000006334266,0.0000076537945,0.00043584092],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885035,0.000038761278,0.00031305916,0.00027015613,0.0002438289,0.00028385944],"domain_scores_gemma":[0.9990884,0.00022878303,0.00006360086,0.000306912,0.0002274822,0.000084820706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045824045,0.00010819283,0.00016455383,0.000033051943,0.0001106392,0.000038219536,0.0004071451,0.00006332056,0.000026462321],"category_scores_gemma":[0.00002151923,0.000095194395,0.00008493982,0.00019489467,0.000020182184,0.000100613885,0.000051252584,0.00007183389,0.000023400042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042434904,0.000031942796,0.000005311398,0.0000017246471,0.000009364137,3.7367013e-8,0.000072330986,0.6273333,0.000102434344,0.0075534624,0.0044170455,0.3604688],"study_design_scores_gemma":[0.0007045429,0.000032493565,0.0000050817744,0.0000145879185,0.000014342801,5.2563837e-7,0.0000073309766,0.9960374,0.00024187585,0.00012689986,0.0027007188,0.00011418681],"about_ca_topic_score_codex":0.0000076907,"about_ca_topic_score_gemma":0.000019792291,"teacher_disagreement_score":0.8391923,"about_ca_system_score_codex":0.0000235381,"about_ca_system_score_gemma":0.00007359578,"threshold_uncertainty_score":0.38819146},"labels":[],"label_agreement":null},{"id":"W2119609284","doi":"10.1109/ccece.2004.1349656","title":"The performance of TCP congestion control algorithm over high-speed transmission links","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Computer network; CUBIC TCP; TCP Friendly Rate Control; Transmission Control Protocol; TCP global synchronization; Network congestion; Throughput; TCP acceleration; TCP tuning; Explicit Congestion Notification; TCP Westwood plus; Transmission (telecommunications); Random early detection; Queue; Network packet; Active queue management; Wireless; Telecommunications","score_opus":0.004527862034807796,"score_gpt":0.1974938575533518,"score_spread":0.19296599551854401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119609284","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06831425,0.0003586221,0.92549723,0.0045000743,0.0004542707,0.00025464778,0.0000013609192,0.00017343141,0.00044613006],"genre_scores_gemma":[0.9878596,0.00019557525,0.010858001,0.00043872447,0.0001066115,0.0000093408935,0.0000012313508,0.0000068041413,0.00052408606],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988077,0.000054648786,0.0003070106,0.00024355095,0.00032693456,0.0002601511],"domain_scores_gemma":[0.99912477,0.00017258743,0.000108366796,0.00036411625,0.0001358236,0.00009435721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034566867,0.00013683559,0.00017721855,0.00003813346,0.00021736117,0.000075517375,0.00055779243,0.00013131552,0.000024467927],"category_scores_gemma":[0.000008102823,0.00008614817,0.00007614496,0.00021528918,0.00008910287,0.00029348853,0.000027047436,0.00024073244,0.000026705678],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031652853,0.000043360484,0.00007760643,0.000003983934,0.000022046033,0.0000019708932,0.000057500845,0.015124134,0.000423095,0.048669353,0.00012953342,0.93541574],"study_design_scores_gemma":[0.0038387277,0.0003057711,0.0062340633,0.000047830003,0.000018479834,0.000009802671,0.000007689289,0.980956,0.0018088282,0.0008920638,0.005698541,0.00018216063],"about_ca_topic_score_codex":0.00003102673,"about_ca_topic_score_gemma":0.0000042099464,"teacher_disagreement_score":0.96583194,"about_ca_system_score_codex":0.000031129148,"about_ca_system_score_gemma":0.00010114796,"threshold_uncertainty_score":0.35130203},"labels":[],"label_agreement":null},{"id":"W2120361914","doi":"10.1109/glocom.1998.776621","title":"Integrated services mappings on ATM networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Datagram; Subnetwork; Computer network; Computer science; Internetworking; ATM adaptation layer; Asynchronous Transfer Mode; Integrated services; Scheduling (production processes); Operating system; Network packet; The Internet; Engineering","score_opus":0.010514042217525641,"score_gpt":0.1790456269243517,"score_spread":0.16853158470682605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120361914","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046133166,0.00034784427,0.91910094,0.0047414447,0.000667573,0.00013934469,3.1900362e-7,0.000919047,0.069470145],"genre_scores_gemma":[0.9832861,0.000041118095,0.003504249,0.005729842,0.00014786208,0.000010858276,0.0000013014883,0.000005790656,0.0072729],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915725,0.0000349357,0.0001385321,0.00028182048,0.00014291891,0.00024453094],"domain_scores_gemma":[0.99941736,0.00006775485,0.00003939572,0.00034386173,0.00004368632,0.00008794525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008465232,0.00012038911,0.00011038244,0.000042751733,0.000087775814,0.00016118954,0.0005968029,0.000060416023,0.0003740349],"category_scores_gemma":[0.000002409864,0.000091987924,0.000045420355,0.00034150048,0.000015997033,0.00020222567,0.00005540701,0.00014009063,0.00063433987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003542864,0.000052156734,0.000126676,0.0000023564596,0.000016184204,0.000011330936,0.00012643904,0.0068108356,0.000004709594,0.09147886,0.018557364,0.8828095],"study_design_scores_gemma":[0.00022083594,0.000052511805,0.00015481283,0.000019156529,0.000002114215,0.0000043202444,0.000013576127,0.93676037,0.0000058106134,0.0001625329,0.062490772,0.000113210626],"about_ca_topic_score_codex":0.000015032765,"about_ca_topic_score_gemma":0.000015812828,"teacher_disagreement_score":0.97867274,"about_ca_system_score_codex":0.000015902471,"about_ca_system_score_gemma":0.0000038123355,"threshold_uncertainty_score":0.81533676},"labels":[],"label_agreement":null},{"id":"W2120886355","doi":"10.1109/glocom.2004.1378857","title":"Improving TCP performance in wired-wireless networks by using a novel adaptive bandwidth estimation mechanism","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Burstiness; Computer science; TCP Westwood plus; TCP acceleration; Computer network; CUBIC TCP; TCP global synchronization; TCP Friendly Rate Control; Zeta-TCP; TCP Westwood; Compound TCP; Bandwidth (computing); HSTCP; H-TCP; Transmission Control Protocol; Real-time computing; Network packet","score_opus":0.0110586978014805,"score_gpt":0.2022383169557385,"score_spread":0.191179619154258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120886355","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09862529,0.00006473801,0.9002941,0.00018362384,0.00026662758,0.00022004265,6.355151e-7,0.0001781036,0.00016684308],"genre_scores_gemma":[0.9080288,0.000008489908,0.091570035,0.00025133655,0.000054435066,0.00001959836,0.0000020365694,0.000010849977,0.000054459622],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986552,0.000024557345,0.00028788814,0.0004066943,0.00023306052,0.0003925814],"domain_scores_gemma":[0.9994221,0.000049306786,0.00011889531,0.00026223346,0.000056831715,0.00009066889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028701717,0.00018212452,0.00019380431,0.000088737295,0.00014381298,0.00013298605,0.00041520127,0.000102922655,0.0000060407706],"category_scores_gemma":[0.0000064158685,0.000173595,0.000040697305,0.00043994407,0.00002702336,0.0008213974,0.0001038699,0.00017510708,0.0000061603023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012142558,0.00006585334,0.000041291638,0.0000041933095,0.000007031258,0.0000028328413,0.00016422583,0.5985787,0.00094104564,0.07245339,0.000009778231,0.32771954],"study_design_scores_gemma":[0.0012523214,0.000076092896,0.000058421785,0.00006363674,0.000005227512,0.0000147211085,0.000022627952,0.99715775,0.00061001576,0.0005080159,0.000010512424,0.00022062649],"about_ca_topic_score_codex":0.00013283665,"about_ca_topic_score_gemma":0.000063537875,"teacher_disagreement_score":0.8094035,"about_ca_system_score_codex":0.00017024892,"about_ca_system_score_gemma":0.00012651623,"threshold_uncertainty_score":0.70789987},"labels":[],"label_agreement":null},{"id":"W2121049513","doi":"10.1109/pccc.2003.1203714","title":"A novel fair bandwidth allocation algorithm for TCP window control","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Space Agency","keywords":"Computer science; Bandwidth allocation; Bandwidth (computing); TCP Friendly Rate Control; TCP global synchronization; Algorithm; Throughput; Zeta-TCP; TCP tuning; TCP acceleration; Max-min fairness; TCP Westwood plus; Network congestion; Computer network; Window (computing); CUBIC TCP; HSTCP; Network packet; Resource allocation; Telecommunications","score_opus":0.010243608622685097,"score_gpt":0.21627393836467437,"score_spread":0.2060303297419893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121049513","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000052188472,0.00009757037,0.9936338,0.0017090954,0.0004941768,0.0005140136,0.0000036801252,0.000249327,0.0032461314],"genre_scores_gemma":[0.6163101,0.00000436952,0.37782058,0.0025632638,0.00014178816,0.00018020887,0.0000031282561,0.000010232858,0.0029662815],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989476,0.000040723742,0.00020464482,0.00034278142,0.00017023203,0.00029400876],"domain_scores_gemma":[0.9991319,0.00020911962,0.000064245505,0.0003225861,0.00016495577,0.00010719375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037046705,0.00013282942,0.00016351695,0.0000495519,0.00012355864,0.00012005079,0.00034950263,0.000064722146,0.000031510765],"category_scores_gemma":[0.000041922664,0.00011483428,0.000087566885,0.00018187627,0.000022386605,0.00027740566,0.000013631609,0.000065262706,0.00003929628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044259777,0.00007244747,0.000022781998,0.0000019052223,0.000026680633,6.305465e-7,0.00003122496,0.0006081726,0.00026819666,0.26626223,0.0025957674,0.7301055],"study_design_scores_gemma":[0.00366589,0.00010060527,0.00015038553,0.0000055485334,0.0000138338555,0.000015981776,0.000012959712,0.95574874,0.00032468518,0.0016376545,0.038126297,0.00019743136],"about_ca_topic_score_codex":0.000004440381,"about_ca_topic_score_gemma":0.000008546065,"teacher_disagreement_score":0.95514053,"about_ca_system_score_codex":0.000025661859,"about_ca_system_score_gemma":0.000102769234,"threshold_uncertainty_score":0.46828058},"labels":[],"label_agreement":null},{"id":"W2121062382","doi":"10.1109/atm.1999.786904","title":"Performance studies of IP over ATM via access flow controlled virtual networks","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Institut National de la Recherche Scientifique","funders":"","keywords":"Computer network; Computer science; Optical IP Switching; Asynchronous Transfer Mode; Network packet; ATM adaptation layer; IP tunnel; Packet switching; Access network; Throughput; Loose Source Routing; IP forwarding; Distributed computing; Internet protocol suite; Internet Protocol; The Internet; Telecommunications; Operating system; Routing protocol","score_opus":0.02024123613032498,"score_gpt":0.26613798190224336,"score_spread":0.2458967457719184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121062382","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0376289,0.0012847501,0.95386255,0.00024910452,0.0011594726,0.00033850002,3.152591e-7,0.00016021215,0.005316192],"genre_scores_gemma":[0.99409664,0.00026934728,0.0032371671,0.00077231345,0.00010919032,0.000044788467,4.274812e-7,0.0000076653005,0.0014624819],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985546,0.00012722735,0.0004020893,0.00031679464,0.000271312,0.00032798818],"domain_scores_gemma":[0.99880666,0.00036510514,0.00015028978,0.00042140114,0.00017463362,0.000081943894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048780517,0.00018691891,0.0004906447,0.000058150326,0.00012823244,0.00007806273,0.00067681726,0.00006914008,0.000091446156],"category_scores_gemma":[0.00005626087,0.00013824076,0.000119865836,0.00035424423,0.0000882288,0.00058306573,0.00013101654,0.0001266169,0.000016498043],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019976877,0.00013860573,0.0034585977,0.000014743106,0.00039473615,0.000007234404,0.0002023274,0.2661504,0.000019915346,0.06733124,0.00472459,0.6573579],"study_design_scores_gemma":[0.0036715812,0.00015100866,0.0010550255,0.00002072699,0.000023900093,0.0000047714193,0.000018569704,0.9934481,0.00006727392,0.00015589458,0.0012103999,0.00017279542],"about_ca_topic_score_codex":0.0000022819768,"about_ca_topic_score_gemma":0.000008656825,"teacher_disagreement_score":0.95646775,"about_ca_system_score_codex":0.000023540968,"about_ca_system_score_gemma":0.00004947206,"threshold_uncertainty_score":0.56372947},"labels":[],"label_agreement":null},{"id":"W2121485000","doi":"10.1109/glocom.1993.318255","title":"Bandwidth management/policing in ATM networks for serving multi-category traffic using a simple learning algorithm and a bucket bank","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Asynchronous Transfer Mode; Computer science; Asynchronous communication; Bandwidth (computing); Computer network; Constant bitrate; Algorithm; Simple (philosophy); Bandwidth allocation; Real-time computing; Variable bitrate; Bit rate","score_opus":0.025549808610268687,"score_gpt":0.2415730491480019,"score_spread":0.21602324053773322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121485000","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026591713,0.00052876334,0.9715813,0.00016294305,0.00014120602,0.00045011414,5.2463673e-7,0.00025954543,0.00028391284],"genre_scores_gemma":[0.860579,0.00011079235,0.13801256,0.0004608794,0.00013250699,0.00004399199,0.0000025958293,0.000022081393,0.0006355787],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983302,0.00009256921,0.00032278136,0.00052689464,0.00013684457,0.000590746],"domain_scores_gemma":[0.9993134,0.00019748986,0.00009023595,0.00024304567,0.000039483704,0.00011631152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041741447,0.00021811826,0.00026326184,0.00017397701,0.00027934293,0.00024247945,0.00034967807,0.0000908642,0.000026450265],"category_scores_gemma":[0.000011376239,0.00021708953,0.000065049135,0.00046340137,0.000030181116,0.00040224244,0.00017726676,0.00021885002,0.0000040988284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033561257,0.000039033046,0.00028296476,0.000017686018,0.000021633254,0.000013709653,0.00035930637,0.27322465,0.0000032591518,0.0013195757,0.00013860839,0.72457623],"study_design_scores_gemma":[0.0018563541,0.000045204502,0.0004057856,0.000046239238,0.000017730685,0.000016913982,0.00016096677,0.99614507,0.0000016168835,0.00008427608,0.0009580971,0.00026174306],"about_ca_topic_score_codex":0.000059149956,"about_ca_topic_score_gemma":0.00009832428,"teacher_disagreement_score":0.8339873,"about_ca_system_score_codex":0.00005120301,"about_ca_system_score_gemma":0.000009083398,"threshold_uncertainty_score":0.8852654},"labels":[],"label_agreement":null},{"id":"W2121558058","doi":"10.1109/rws.2008.4463618","title":"The use of explicit congestion notification to shape traffic of an intelligent satellite system","year":2008,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Algonquin College","funders":"","keywords":"Computer science; Explicit Congestion Notification; Computer network; Geostationary orbit; Network packet; Traffic flow (computer networking); Network congestion; Real-time computing; Communications satellite; Traffic congestion; Terminal (telecommunication); Satellite; Engineering; Transport engineering","score_opus":0.06405515095392046,"score_gpt":0.23871345122363036,"score_spread":0.1746583002697099,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121558058","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62087184,0.00014916054,0.37750468,0.00052865007,0.00027689477,0.00038894778,0.0000014552531,0.00016139536,0.000117006304],"genre_scores_gemma":[0.9918644,0.000090984875,0.0076645166,0.00007651206,0.00003749182,0.000026174343,0.0000021845094,0.000005927429,0.00023183688],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987546,0.00011800222,0.00044112228,0.0002561135,0.00026767232,0.0001624661],"domain_scores_gemma":[0.9985735,0.00029131348,0.00015629015,0.0006109814,0.0002678755,0.000100064244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029006394,0.00010274767,0.00016542018,0.00006907046,0.00012200664,0.000047938687,0.00053409685,0.00004715871,0.000004163369],"category_scores_gemma":[0.00003207034,0.00007260867,0.00005563511,0.0003506894,0.00005081109,0.0002872209,0.00004211923,0.000056258537,0.000026836862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033198437,0.00005869058,0.000056921763,0.000009783094,0.000013426255,0.0000016470466,0.0006596962,0.034195814,0.00049598137,0.092800684,0.00012309413,0.87155104],"study_design_scores_gemma":[0.00014593611,0.00018486966,0.0031501509,0.00003808931,0.000008245823,0.000019043391,0.00015826136,0.98857343,0.0023191979,0.000009837233,0.0052797636,0.000113202615],"about_ca_topic_score_codex":0.000020150113,"about_ca_topic_score_gemma":0.000033414268,"teacher_disagreement_score":0.9543776,"about_ca_system_score_codex":0.000034261087,"about_ca_system_score_gemma":0.000053021424,"threshold_uncertainty_score":0.2960896},"labels":[],"label_agreement":null},{"id":"W2121778557","doi":"10.1109/iscc.2001.935365","title":"A scheme for QoS-based dynamic multicast routing","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Multicast; Computer network; Computer science; Distance Vector Multicast Routing Protocol; Protocol Independent Multicast; Xcast; Source-specific multicast; Distributed computing; Pragmatic General Multicast; Multicast address","score_opus":0.019925663449351608,"score_gpt":0.23639731914229486,"score_spread":0.21647165569294324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121778557","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018127839,0.00006670414,0.9915675,0.0036184327,0.00026258398,0.0001983157,8.0539974e-7,0.0003446299,0.0021282602],"genre_scores_gemma":[0.82017726,9.702919e-7,0.1770453,0.0009636261,0.0000649704,0.00003637381,7.3796434e-7,0.000005465032,0.0017053093],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923307,0.000015738535,0.00013902388,0.0002518475,0.00010482544,0.00025548795],"domain_scores_gemma":[0.99938226,0.00018272501,0.00003646905,0.0002707088,0.00005790837,0.00006991602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011770304,0.000088219866,0.000096166696,0.000034256784,0.000108004795,0.00009407588,0.00035031338,0.000036791767,0.000082294326],"category_scores_gemma":[0.000035646848,0.000077512,0.00006816416,0.00014073156,0.000017512033,0.00012749604,0.000030759165,0.000056237423,0.00011227025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005998724,0.00010246184,0.00013778353,0.000007546392,0.000014995685,0.0000043665423,0.00008393266,0.0015083716,0.00020999898,0.07989451,0.0035939026,0.9144361],"study_design_scores_gemma":[0.00080692564,0.000040006606,0.000057772304,0.000008070008,0.000002987637,0.0000018122504,0.0000058827354,0.9941715,0.000033048193,0.00006868128,0.004694276,0.000109028086],"about_ca_topic_score_codex":0.0000022315874,"about_ca_topic_score_gemma":0.00000914301,"teacher_disagreement_score":0.99266315,"about_ca_system_score_codex":0.000020882993,"about_ca_system_score_gemma":0.00001356504,"threshold_uncertainty_score":0.31608477},"labels":[],"label_agreement":null},{"id":"W2121887548","doi":"10.1109/cnsr.2006.41","title":"Periodic Data Traffic Modeling and Predicition-Based Bandwith Allocation","year":2006,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Moncton","funders":"Natural Sciences and Engineering Research Council of Canada; Atlantic Canada Opportunities Agency; Nortel Networks Inc","keywords":"Autocorrelation; Provisioning; Autoregressive model; Computer science; Internet traffic; Bandwidth (computing); Marginal distribution; Gaussian; Traffic generation model; The Internet; Data modeling; Pedestrian; Real-time computing; Computer network; Statistics; Engineering; Mathematics; Transport engineering","score_opus":0.016863131754590133,"score_gpt":0.21526074561466793,"score_spread":0.1983976138600778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121887548","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043930504,0.00028375286,0.952491,0.002120378,0.00008076292,0.00011202229,0.000002673851,0.00027406163,0.00070485845],"genre_scores_gemma":[0.98312783,0.0000063580846,0.016174007,0.00037107177,0.000117818025,0.000010064201,0.000055411674,0.00000449539,0.00013296073],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916,0.000027600146,0.00015165357,0.00035648694,0.00016041356,0.00014386403],"domain_scores_gemma":[0.9993306,0.00004664009,0.000028654262,0.00049758994,0.000048445498,0.000048067257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001845101,0.00008607802,0.00008419981,0.000046789683,0.00012548492,0.00016879578,0.0004258534,0.000035246183,0.00001386186],"category_scores_gemma":[0.0000065129752,0.000073575015,0.0000125522665,0.00013299321,0.0000284419,0.0003713868,0.00005484029,0.000056089957,0.000008513145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007469343,0.00005208287,0.00013462956,0.000007227036,0.000005919756,0.0000025919373,0.000034521177,0.7580498,0.000027777574,0.019794732,0.002001142,0.21988209],"study_design_scores_gemma":[0.00046267873,0.000023572018,0.00013958364,0.000011248138,0.000007581964,0.0000037681134,0.000008432117,0.9985362,0.000004235428,0.00019928855,0.0005086338,0.00009473748],"about_ca_topic_score_codex":0.00003929418,"about_ca_topic_score_gemma":0.00008293152,"teacher_disagreement_score":0.9391973,"about_ca_system_score_codex":0.000010197706,"about_ca_system_score_gemma":0.000080933416,"threshold_uncertainty_score":0.3000302},"labels":[],"label_agreement":null},{"id":"W2121901851","doi":"10.1016/j.jvcir.2004.11.011","title":"Split-domain video transmission protocol for video streaming over hybrid wired–wireless connections","year":2005,"lang":"en","type":"article","venue":"Journal of Visual Communication and Image Representation","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Wireless; Wireless network; Transmission (telecommunications); Live streaming; Protocol (science); Video streaming; The Internet; Domain (mathematical analysis); Telecommunications","score_opus":0.02297749848471806,"score_gpt":0.35933865029128675,"score_spread":0.33636115180656867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121901851","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023477327,0.0001062594,0.96157265,0.004615443,0.00005650081,0.009797054,0.0000016687117,0.000051005263,0.0003220745],"genre_scores_gemma":[0.8286335,0.0001266682,0.16314742,0.00048750365,0.00034331784,0.0070819515,0.000009154716,0.000022541948,0.00014793554],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984449,0.00029959076,0.0006388754,0.0001880614,0.00027337857,0.00015519808],"domain_scores_gemma":[0.99803513,0.0005043371,0.0005746946,0.0003477082,0.00041369538,0.00012445038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007563164,0.00012978129,0.000218112,0.0001518628,0.00032957995,0.0002785808,0.00041769855,0.00003992916,0.00002554622],"category_scores_gemma":[0.000074841824,0.00011607167,0.00012420728,0.00019289152,0.000069254325,0.0015939664,0.000066548266,0.00018182177,0.0000020624527],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024910812,0.00032873865,0.00013297827,0.000032585347,0.000045399986,0.0000023636574,0.0006595555,0.00032749015,0.010393657,0.0065274197,0.0036545193,0.9776462],"study_design_scores_gemma":[0.0074054836,0.00059353973,0.002030131,0.0003174429,0.000047871355,0.00022221208,0.0004668744,0.8824865,0.008470417,0.003353459,0.09428884,0.00031719115],"about_ca_topic_score_codex":0.000008812658,"about_ca_topic_score_gemma":0.000006770798,"teacher_disagreement_score":0.977329,"about_ca_system_score_codex":0.000059589274,"about_ca_system_score_gemma":0.000086102,"threshold_uncertainty_score":0.47332653},"labels":[],"label_agreement":null},{"id":"W2122062742","doi":"10.1109/glocom.2006.921","title":"WLCp2-10: Configurable Acknowledgment Delay (CAD) Mechanism for Asymmetric Space-Internet Links","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"","keywords":"Computer science; CAD; The Internet; Channel (broadcasting); Mechanism (biology); Throughput; Computer network; Telecommunications; Wireless; Engineering","score_opus":0.010154925712233,"score_gpt":0.22084814556312668,"score_spread":0.21069321985089368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122062742","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015533938,0.0005997326,0.9602605,0.0025905655,0.0015633408,0.00051298644,0.000013876488,0.00038466472,0.032520954],"genre_scores_gemma":[0.94448465,0.000017279348,0.020153802,0.000915017,0.0006051862,0.00014224167,0.000022673514,0.000022029568,0.033637125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824375,0.0000534699,0.00035019335,0.00054215034,0.0002585289,0.0005519134],"domain_scores_gemma":[0.9987472,0.00019080554,0.00014156968,0.0004969009,0.00028680015,0.00013667719],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003044088,0.00024163703,0.0002827733,0.00014818356,0.00013639824,0.00026938453,0.0008520032,0.00021330277,0.00017559319],"category_scores_gemma":[0.000039491093,0.00022840557,0.00016982386,0.00043570204,0.00002653839,0.00021744418,0.00011804675,0.0002065913,0.00077844295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018047776,0.000108706925,0.000034762346,0.000011178741,0.000034189092,0.000010556904,0.0000255331,0.00038505308,0.000048919967,0.74661505,0.1523222,0.10038581],"study_design_scores_gemma":[0.002320209,0.00032305697,0.00014104831,0.000043156382,0.000044238,0.000026378326,0.000011998188,0.5846174,0.002801834,0.034561563,0.37457788,0.00053127523],"about_ca_topic_score_codex":0.000118016986,"about_ca_topic_score_gemma":0.0001394045,"teacher_disagreement_score":0.94293123,"about_ca_system_score_codex":0.0001072764,"about_ca_system_score_gemma":0.00009093535,"threshold_uncertainty_score":0.9999996},"labels":[],"label_agreement":null},{"id":"W2122162677","doi":"10.1109/icc.1989.49926","title":"End-to-end flow control in interconnected local area ring networks","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Queue; Token ring; Subnetwork; Local area network; Computer science; Ring (chemistry); Computer network; Backbone network; Throughput; Ring network; Token bus network; Flow control (data); Topology (electrical circuits); Security token; Network topology; Mathematics; Telecommunications","score_opus":0.008194446426018558,"score_gpt":0.1999106921011424,"score_spread":0.19171624567512385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122162677","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023891449,0.0001368999,0.987023,0.0016454193,0.000688178,0.0002581872,5.8672106e-7,0.0002717451,0.007586831],"genre_scores_gemma":[0.98689353,0.000004470359,0.009340317,0.0031359517,0.00012694336,0.000046497124,0.0000012785513,0.000010822447,0.00044017946],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982504,0.00018053198,0.00033680527,0.000497776,0.00019315004,0.0005413095],"domain_scores_gemma":[0.99892443,0.00030845735,0.00004335919,0.00044346793,0.000061538216,0.00021877092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046381162,0.00019859702,0.00027637978,0.00014183417,0.00006745484,0.00014364139,0.00054882566,0.00009830328,0.00038337053],"category_scores_gemma":[0.0000632668,0.00017918901,0.000071276794,0.0006036198,0.000036982023,0.00025720452,0.000065391796,0.0002631583,0.000096349155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002561854,0.00006269875,0.0008691816,0.0000017181187,0.000024891739,0.00005621588,0.00012554681,0.37603825,0.00002240086,0.12291623,0.0024476969,0.49740952],"study_design_scores_gemma":[0.0014484031,0.00006514748,0.00054086436,0.000020918242,0.0000049324085,0.000018789442,0.00003316229,0.98799473,0.000029337085,0.00030914848,0.009307455,0.00022712491],"about_ca_topic_score_codex":0.000023552226,"about_ca_topic_score_gemma":0.00041548425,"teacher_disagreement_score":0.9845044,"about_ca_system_score_codex":0.00007266847,"about_ca_system_score_gemma":0.000053797514,"threshold_uncertainty_score":0.7307116},"labels":[],"label_agreement":null},{"id":"W2122575460","doi":"10.1109/icc.2001.936616","title":"Multiple path routing in networks with inaccurate link state information","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Computer network; Link-state routing protocol; Private Network-to-Network Interface; Equal-cost multi-path routing; Static routing; Shortest path problem; Multipath routing; Network topology; Routing protocol; Path vector protocol; Dynamic Source Routing; Routing domain; Routing (electronic design automation); Destination-Sequenced Distance Vector routing; Policy-based routing; Distributed computing; Topology (electrical circuits); Mathematics; Theoretical computer science; Graph","score_opus":0.00811868541328669,"score_gpt":0.17380829207698684,"score_spread":0.16568960666370014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122575460","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015279962,0.00003925434,0.9803434,0.0009000852,0.00011616124,0.00016507748,3.1658806e-7,0.00022200908,0.002933745],"genre_scores_gemma":[0.9916502,0.000029464065,0.0072642695,0.00076430023,0.00004503476,0.00001671719,0.0000019742956,0.0000035252342,0.00022451853],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915737,0.0000384673,0.00024538956,0.00014464025,0.00013871929,0.00027544406],"domain_scores_gemma":[0.9994806,0.00009499157,0.00008940661,0.00021678802,0.0000575175,0.000060679897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018463636,0.00010292084,0.00010661066,0.00006496295,0.00006581034,0.00018909018,0.00027017962,0.000037411457,0.00001954158],"category_scores_gemma":[0.000016325534,0.00007912356,0.000017664866,0.0004061428,0.000014204839,0.0013247657,0.000053487132,0.00015852734,0.00007127932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075142407,0.000013025527,0.0040748995,0.0000013932458,0.0000041041717,0.000006848404,0.00066571595,0.1875789,3.8872454e-7,0.0047597396,0.00032882215,0.80255866],"study_design_scores_gemma":[0.0008402779,0.00004855009,0.003283214,0.000020861231,0.0000010382852,0.0000047008316,0.000020863563,0.9942116,0.0000025978698,0.00003829572,0.0014041436,0.00012383566],"about_ca_topic_score_codex":0.00004392817,"about_ca_topic_score_gemma":0.00012666335,"teacher_disagreement_score":0.9763702,"about_ca_system_score_codex":0.000027315737,"about_ca_system_score_gemma":0.00001337312,"threshold_uncertainty_score":0.32265648},"labels":[],"label_agreement":null},{"id":"W2122715073","doi":"10.1109/nca.2007.38","title":"Scalable Communication for High Performance and Inexpensive Reliable QoS using Relaxed Recovery","year":2007,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Backup; Scalability; Computer science; Computer network; Quality of service; Distributed computing; Overhead (engineering); Broadcasting (networking); Path (computing); Routing (electronic design automation); High availability; Database","score_opus":0.015323440698337088,"score_gpt":0.23122142840341817,"score_spread":0.2158979877050811,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122715073","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3165044,0.00025542933,0.6806598,0.0004829827,0.00029564628,0.0002325566,3.7224132e-7,0.000108557484,0.0014602994],"genre_scores_gemma":[0.8379431,0.00011492941,0.1600072,0.00053645263,0.0000665773,0.000010046427,0.0000023780533,0.0000061202018,0.0013132354],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992533,0.000016800655,0.00019772306,0.00020903347,0.00009506176,0.00022810498],"domain_scores_gemma":[0.99906856,0.00024196984,0.00007860216,0.00039459884,0.00015774388,0.00005852252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054394786,0.00008578332,0.00011872069,0.00005525833,0.00024744202,0.00008836002,0.00027740924,0.000060312646,0.0000064118194],"category_scores_gemma":[0.000026494738,0.00007953035,0.000019293477,0.00017650453,0.000035048422,0.0005804133,0.000102201804,0.00008065359,0.000007357537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023622163,0.00009376043,0.0026610233,0.000047744987,0.00005241543,0.0000029685393,0.00038870584,0.012058651,0.0014996338,0.17279357,0.014967936,0.79519737],"study_design_scores_gemma":[0.0010727202,0.00016287774,0.00250498,0.00006040241,0.00001234152,0.000017693343,0.000062566316,0.98584795,0.0015462473,0.0017600277,0.006730132,0.00022208443],"about_ca_topic_score_codex":0.00005160709,"about_ca_topic_score_gemma":0.00002360067,"teacher_disagreement_score":0.9737893,"about_ca_system_score_codex":0.000040060313,"about_ca_system_score_gemma":0.000037101487,"threshold_uncertainty_score":0.32431537},"labels":[],"label_agreement":null},{"id":"W2122851186","doi":"10.1109/atm.1997.624664","title":"Call admission control and routing for multipoint connections in ATM based networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Computer science; Computer network; Connection (principal bundle); Routing (electronic design automation); Admission control; Path (computing); Maximization; Resource consumption; Distributed computing; Metric (unit); Resource allocation; Control (management); Mathematical optimization; Quality of service; Engineering; Mathematics; Artificial intelligence","score_opus":0.014206603513613487,"score_gpt":0.21665511142091912,"score_spread":0.20244850790730562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122851186","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017283566,0.0002412274,0.9914276,0.005310923,0.000199149,0.00044677817,8.622684e-7,0.00016414397,0.00048093576],"genre_scores_gemma":[0.9844858,0.000009006695,0.013337594,0.0015804471,0.00009148919,0.00008477424,7.761672e-7,0.0000062200247,0.00040388425],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990783,0.000057857054,0.00021577487,0.00029941488,0.00007607146,0.00027260775],"domain_scores_gemma":[0.9989889,0.0006085429,0.000049858696,0.00018240749,0.000045452067,0.0001248148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025797595,0.00010811738,0.00015535361,0.00005415995,0.00013766707,0.000085475236,0.00015947176,0.0000703914,0.000029346123],"category_scores_gemma":[0.000082187704,0.00009318131,0.000047141635,0.00015676006,0.000019318579,0.00014352208,0.000024706607,0.00010591317,0.0000042672655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004619047,0.0001613025,0.0039872616,0.000008332019,0.000018232033,0.000009407754,0.0001525527,0.13533261,0.00006199155,0.04335232,0.004475009,0.8123948],"study_design_scores_gemma":[0.0030839867,0.00007280109,0.00095865404,0.000022869805,0.0000053289236,0.0000037740856,0.0000088012,0.9926736,0.000006171795,0.00006711159,0.0029744378,0.00012249894],"about_ca_topic_score_codex":0.000023833205,"about_ca_topic_score_gemma":0.00010604732,"teacher_disagreement_score":0.98275745,"about_ca_system_score_codex":0.000024644742,"about_ca_system_score_gemma":0.000013109794,"threshold_uncertainty_score":0.37998235},"labels":[],"label_agreement":null},{"id":"W2122857222","doi":"10.1016/j.comcom.2008.07.016","title":"Priority queuing of long-range dependent traffic","year":2008,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Queue management system; Queue; Bulk queue; Multilevel queue; Queueing theory; Priority queue; Real-time computing; Computer network","score_opus":0.03468011940471879,"score_gpt":0.2530783233760022,"score_spread":0.21839820397128343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122857222","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059206527,0.0017287553,0.93547046,0.0018709531,0.00030312897,0.00021919036,0.0000022160332,0.00031388915,0.0008848844],"genre_scores_gemma":[0.8969561,0.0003484735,0.102304496,0.00019384696,0.00007404754,0.000021165584,0.000005029961,0.0000073940823,0.00008944201],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987469,0.0002060103,0.00036237636,0.0002474322,0.00022624146,0.00021107148],"domain_scores_gemma":[0.99676585,0.00030345182,0.00014975526,0.0024976886,0.00018733836,0.00009591327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022899109,0.00013084695,0.00022100096,0.000097909484,0.00034335992,0.00004179033,0.0030104434,0.00006047042,0.0000069180314],"category_scores_gemma":[0.000010771519,0.00013522961,0.00010618655,0.0003634951,0.00018014258,0.00028207886,0.0007891061,0.00023283172,0.00004072774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005921416,0.0005261143,0.005419294,0.00001637134,0.00007253193,0.000021383226,0.002483014,0.0089732865,0.000017939334,0.046412345,0.0016413097,0.9344105],"study_design_scores_gemma":[0.00065955543,0.00007278419,0.024885604,0.00004365229,0.000014525298,0.000126641,0.000009469121,0.97005486,0.000022004982,0.00017541183,0.0036971706,0.00023832377],"about_ca_topic_score_codex":0.000013827977,"about_ca_topic_score_gemma":0.000051584146,"teacher_disagreement_score":0.96108156,"about_ca_system_score_codex":0.000034437577,"about_ca_system_score_gemma":0.00011973499,"threshold_uncertainty_score":0.5594203},"labels":[],"label_agreement":null},{"id":"W2122981288","doi":"10.1109/lcn.2008.4664297","title":"Detecting changes in the Hurst parameter","year":2008,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Hurst exponent; Computer science; Variance (accounting); Estimation theory; Wavelet; Detrended fluctuation analysis; Moving average; Rescaled range; Bandwidth (computing); Algorithm; Mathematics; Statistics; Artificial intelligence","score_opus":0.027147669892992023,"score_gpt":0.22210978028390985,"score_spread":0.19496211039091782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122981288","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35973817,0.00028272116,0.5981763,0.023563353,0.0004710056,0.00029662254,1.411605e-7,0.0003326349,0.017139014],"genre_scores_gemma":[0.9934015,0.000010929855,0.003542333,0.0026477224,0.00007591072,0.000020302778,6.9511e-8,0.0000018001834,0.000299427],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994615,0.00005911566,0.00006877666,0.00013751116,0.00011545746,0.00015768355],"domain_scores_gemma":[0.999501,0.000218694,0.000018379025,0.00023073114,0.0000126382165,0.000018592591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020686476,0.000052081105,0.000056896657,0.000032669283,0.00009520646,0.000039157847,0.00045407526,0.000021717744,0.000013869281],"category_scores_gemma":[0.000023700493,0.00003171237,0.000019654732,0.00022703933,0.000021377427,0.00008843065,0.000034057284,0.00008939896,0.00003745235],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002489648,0.000029697547,0.002316745,0.0000010976416,0.0000041076696,0.00005608376,0.0022464194,0.00017588936,0.00002948428,0.018069113,0.0013628285,0.97570604],"study_design_scores_gemma":[0.0013420735,0.00027132212,0.03393697,0.000025309335,0.0000066481166,0.00052010466,0.0006032353,0.9247144,0.0005921456,0.0027594874,0.034688048,0.00054024335],"about_ca_topic_score_codex":0.000012969041,"about_ca_topic_score_gemma":0.00020380851,"teacher_disagreement_score":0.9751658,"about_ca_system_score_codex":0.000006010123,"about_ca_system_score_gemma":0.000011636297,"threshold_uncertainty_score":0.1293193},"labels":[],"label_agreement":null},{"id":"W2123118696","doi":"10.1109/icc.2004.1312676","title":"Adaptive sampling for network performance measurement under voice traffic","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada); Carleton University","funders":"","keywords":"Computer science; Sampling (signal processing); Adaptive sampling; Jitter; Quality of service; Real-time computing; The Internet; Throughput; Network performance; Network topology; Network management; Computer network; Telecommunications","score_opus":0.05998110425496898,"score_gpt":0.24177989255239857,"score_spread":0.1817987882974296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123118696","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059134774,0.00034740544,0.98967105,0.001725647,0.00058444025,0.00038352003,3.8920766e-7,0.000337342,0.0010367193],"genre_scores_gemma":[0.88368964,0.000015161497,0.1146228,0.0010846304,0.00036321595,0.000075067226,7.191291e-7,0.0000094201,0.00013935541],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862504,0.000020017134,0.00021670671,0.0003628191,0.00033365173,0.00044174984],"domain_scores_gemma":[0.9992507,0.00008275736,0.00006163511,0.0002935981,0.0002086461,0.00010268223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052755815,0.00015381095,0.00015551267,0.000031745873,0.00026308466,0.00009656294,0.00047034275,0.000054967844,0.0000046706327],"category_scores_gemma":[0.000009959892,0.00013402222,0.00008396502,0.0002470184,0.00002557514,0.0002912753,0.000047023204,0.00010125086,0.000054755837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016742948,0.000025853551,0.0000037939756,0.000003317911,0.000021366739,2.6214602e-7,0.00004992194,0.71203834,0.000005507539,0.071326986,0.00039387643,0.21611404],"study_design_scores_gemma":[0.0017404545,0.00030831053,0.00056586025,0.00007098325,0.000019724948,0.0000072527164,0.000041465817,0.9856342,0.000047616533,0.004077622,0.0071630287,0.0003234821],"about_ca_topic_score_codex":0.0000031126142,"about_ca_topic_score_gemma":0.000049076054,"teacher_disagreement_score":0.87777615,"about_ca_system_score_codex":0.00013749025,"about_ca_system_score_gemma":0.00017691257,"threshold_uncertainty_score":0.54652673},"labels":[],"label_agreement":null},{"id":"W2123267194","doi":"10.1109/twc.2007.026506","title":"Long-lifetime capacity upgrades of ring networks for unpredictable traffic","year":2007,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Computer science; Computer network; The Internet; Distributed computing; Chordal graph; Graph; Theoretical computer science","score_opus":0.028420017310033446,"score_gpt":0.27572639394101967,"score_spread":0.24730637663098623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123267194","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12568428,0.00087193586,0.8705145,0.0013443595,0.00044374584,0.0003214644,0.000004020342,0.00012323177,0.0006924475],"genre_scores_gemma":[0.9757884,0.00035792132,0.023384226,0.00017030194,0.00019457535,0.000020967294,0.000004634332,0.000014394584,0.00006458003],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981586,0.00023045325,0.0007048371,0.0001985838,0.0002596477,0.00044790175],"domain_scores_gemma":[0.99626744,0.0017023097,0.00036819413,0.0010038038,0.00049049896,0.00016776157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014858167,0.00016372399,0.00028830464,0.00031805644,0.00038864394,0.00010146462,0.0020219313,0.00012417616,0.0000044958674],"category_scores_gemma":[0.0001708213,0.0001593282,0.00011418791,0.0012040036,0.00011207888,0.00028815077,0.00006921566,0.0007957886,0.0000024693454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022793625,0.0014299309,0.005829832,0.000020821957,0.00022634112,0.000013790625,0.001127726,0.56415075,0.00041044306,0.03803239,0.0034163594,0.3851137],"study_design_scores_gemma":[0.0014835703,0.00024117416,0.01206856,0.00024412025,0.000028150644,0.00011393384,0.00003332946,0.98265964,0.00022736269,0.0006850098,0.0019768653,0.00023828972],"about_ca_topic_score_codex":0.000008424382,"about_ca_topic_score_gemma":0.00028324503,"teacher_disagreement_score":0.85010415,"about_ca_system_score_codex":0.000139336,"about_ca_system_score_gemma":0.00016201517,"threshold_uncertainty_score":0.64972156},"labels":[],"label_agreement":null},{"id":"W2123682542","doi":"10.1109/tnet.2006.876199","title":"Dynamic inter-SLA resource sharing in path-oriented differentiated services networks","year":2006,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Computer science; Computer network; Spare part; Quality of service; Bandwidth (computing); Service-level agreement; Dynamic bandwidth allocation; Differentiated services; Shared resource; Service level; Bandwidth management; Distributed computing; Overhead (engineering); Bandwidth allocation; Operating system","score_opus":0.006542617317342361,"score_gpt":0.2084842481203477,"score_spread":0.2019416308030053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123682542","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04929976,0.0004771624,0.9462207,0.0003598973,0.0021297205,0.0003197679,0.0000027648082,0.0006829144,0.0005072883],"genre_scores_gemma":[0.9962947,0.00006628772,0.002375429,0.00033058372,0.0003312898,0.00007592796,0.000020871574,0.0000451817,0.00045976817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970445,0.00016647729,0.00067523145,0.0009319378,0.000338222,0.00084362115],"domain_scores_gemma":[0.99826497,0.00026012197,0.0001954083,0.0010902387,0.00006059518,0.00012869648],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033909385,0.0004089105,0.0003916225,0.00033103692,0.00038887342,0.00031326286,0.0013955123,0.0002265898,0.00002456365],"category_scores_gemma":[0.0000017702813,0.0004258853,0.00018936241,0.0013449251,0.000051020597,0.00037961843,0.00004100241,0.00077861414,0.000022382204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065964894,0.00023843959,0.0013619127,0.000016205771,0.0000456361,0.00004767085,0.00018699128,0.71412367,0.000038948638,0.00039032882,0.00009331247,0.2833909],"study_design_scores_gemma":[0.0010708796,0.000065987966,0.0018536726,0.00046069024,0.000028398614,0.00001614965,0.00003927104,0.9919395,0.00001783667,0.0006573095,0.003432806,0.0004175352],"about_ca_topic_score_codex":0.00012994806,"about_ca_topic_score_gemma":0.0016866084,"teacher_disagreement_score":0.9469949,"about_ca_system_score_codex":0.000176247,"about_ca_system_score_gemma":0.000022259668,"threshold_uncertainty_score":0.9998193},"labels":[],"label_agreement":null},{"id":"W2123732273","doi":"10.1109/milcom.1989.103926","title":"Application of stochastic automaton theory for routing in a packet-switched network","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Shortest path problem; Computer science; Routing (electronic design automation); Equal-cost multi-path routing; Network packet; Queue; Private Network-to-Network Interface; Automaton; K shortest path routing; Link-state routing protocol; Static routing; Constrained Shortest Path First; Algorithm; Computer network; Theoretical computer science; Routing protocol; Graph","score_opus":0.007834335224280928,"score_gpt":0.22800889010830672,"score_spread":0.2201745548840258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123732273","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004148852,0.00007167189,0.9940916,0.00013659193,0.00010665053,0.00040231092,2.8650948e-7,0.0001148663,0.00092721166],"genre_scores_gemma":[0.9664439,5.682577e-7,0.03317765,0.00013752845,0.000037180067,0.00011028874,9.578278e-7,0.0000053318686,0.000086593536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991633,0.00007652477,0.0002376824,0.00021338888,0.000088932844,0.00022012611],"domain_scores_gemma":[0.99910486,0.0004596842,0.00009635831,0.00025356442,0.000050031278,0.000035487294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084468746,0.000079054786,0.00014467258,0.000035981055,0.000040924842,0.000019849582,0.00023307756,0.000046038807,0.0000050583967],"category_scores_gemma":[0.00007106857,0.00007104583,0.000042226893,0.00030345135,0.00001671395,0.00009131347,0.000020439342,0.00005192777,0.0000062575955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008152148,0.000022180697,0.00015517142,0.0000037794655,0.000004998388,9.259193e-8,0.000085406675,0.019237077,0.000045865803,0.84944326,0.00006667146,0.13092735],"study_design_scores_gemma":[0.00054206705,0.000028898798,0.00027043946,0.000015419218,0.0000039212036,0.0000013644881,0.00002813086,0.951114,0.00005538947,0.047706462,0.000148353,0.0000855787],"about_ca_topic_score_codex":0.0000028906964,"about_ca_topic_score_gemma":0.00001038985,"teacher_disagreement_score":0.96229506,"about_ca_system_score_codex":0.000018550923,"about_ca_system_score_gemma":0.000052650335,"threshold_uncertainty_score":0.28971648},"labels":[],"label_agreement":null},{"id":"W2123733129","doi":"10.1109/saci.2011.5873011","title":"PIM-SSM within DiffServ-aware MPLS traffic engineering","year":2011,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Multiprotocol Label Switching; Computer network; Multicast; Computer science; Quality of service; Traffic engineering; Label Distribution Protocol; IP multicast; Virtual routing and forwarding; Routing protocol; Routing (electronic design automation); Label switching; Routing table","score_opus":0.018424666247843058,"score_gpt":0.17660407846331302,"score_spread":0.15817941221546997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123733129","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059957188,0.00009300247,0.93345,0.00028458904,0.00091826305,0.00014324534,5.1316704e-7,0.0011045935,0.004048632],"genre_scores_gemma":[0.97660816,0.000004165303,0.02204719,0.0003447115,0.000101606034,0.000018980581,6.868057e-7,0.000010521644,0.0008639763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902266,0.00002098667,0.00020824393,0.00030452458,0.00016712197,0.0002764432],"domain_scores_gemma":[0.9993188,0.000043593805,0.000044311324,0.00040953985,0.000046246696,0.00013751548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014831517,0.00014644499,0.00014193628,0.000063978674,0.00006525072,0.000065207736,0.0006511815,0.00006241064,0.00012406336],"category_scores_gemma":[0.000009339709,0.00012407349,0.00006385382,0.0002338722,0.000015800477,0.0003013579,0.00008332872,0.00013379585,0.00017454095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016747887,0.00019659917,0.00027965667,0.000021990561,0.00007886285,0.00008427666,0.0039011645,0.029312199,0.00018514905,0.5036849,0.0034744495,0.45876402],"study_design_scores_gemma":[0.0003448949,0.000060167975,0.0012704543,0.000016983158,0.0000065054523,0.000019771987,0.000036871857,0.99645716,0.00016946551,0.00014497661,0.0012378921,0.00023484544],"about_ca_topic_score_codex":0.0000074297577,"about_ca_topic_score_gemma":0.000012410781,"teacher_disagreement_score":0.96714497,"about_ca_system_score_codex":0.000016225062,"about_ca_system_score_gemma":0.00003500891,"threshold_uncertainty_score":0.505957},"labels":[],"label_agreement":null},{"id":"W2123788218","doi":"10.1109/cnsr.2011.43","title":"Dynamic Resource Allocation Based on Weighted Max-Min Fairness","year":2011,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Max-min fairness; Bandwidth allocation; Bandwidth (computing); Scheduling (production processes); Dynamic bandwidth allocation; Resource allocation; Fairness measure; Computer network; Distributed computing; Shared resource; Resource management (computing); Mathematical optimization; Throughput; Telecommunications","score_opus":0.011691359268476389,"score_gpt":0.19913088666929002,"score_spread":0.18743952740081363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123788218","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036936041,0.000017300867,0.944876,0.0016011501,0.00018611843,0.0001411475,3.7529352e-7,0.00042894817,0.04905532],"genre_scores_gemma":[0.9722369,0.0000011022865,0.023314267,0.0016263796,0.000022468346,0.000024328001,0.0000043297873,0.000007731473,0.0027624974],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902546,0.00007484576,0.00015589417,0.0003302851,0.0002074267,0.00020607136],"domain_scores_gemma":[0.9992036,0.00007459601,0.000052121126,0.0005304381,0.000055016426,0.000084234525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019241282,0.00011730368,0.00010064429,0.00008760406,0.00008052016,0.000049536822,0.0005693422,0.00006027807,0.00016949003],"category_scores_gemma":[0.0000077468685,0.000098250464,0.000044746357,0.00027108498,0.000026397382,0.00014340345,0.000037480335,0.00009207048,0.00026352608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050442835,0.00018247734,0.00013177189,0.0000048202933,0.000011900758,0.000014207119,0.0002542682,0.0010217514,0.000052239426,0.23422284,0.0022201696,0.76183313],"study_design_scores_gemma":[0.00042175385,0.00009101025,0.0017008283,0.000012989989,0.0000044449644,0.0000018244798,0.000014483532,0.9916668,0.00015905616,0.0008417619,0.004943165,0.0001418853],"about_ca_topic_score_codex":0.0000140908705,"about_ca_topic_score_gemma":0.000022389813,"teacher_disagreement_score":0.99064505,"about_ca_system_score_codex":0.000031993848,"about_ca_system_score_gemma":0.00004558565,"threshold_uncertainty_score":0.40065375},"labels":[],"label_agreement":null},{"id":"W2123959614","doi":"10.1109/glocom.2006.28","title":"CAM04-5: Toward Understanding the Behavior of BGP During Large-Scale Power Outages","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Blackout; Computer science; Computer network; Prefix; Routing protocol; The Internet; Metric (unit); Border Gateway Protocol; Routing (electronic design automation); Network mapping; Distributed computing; Power (physics); Computer security; Static routing; Electric power system; Engineering; World Wide Web","score_opus":0.01302629165740183,"score_gpt":0.21943234846117934,"score_spread":0.20640605680377752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123959614","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29859516,0.000485123,0.6925926,0.0018866466,0.0007842736,0.00031442585,0.000012865127,0.00021887427,0.005110024],"genre_scores_gemma":[0.99809873,0.000005110185,0.0011761874,0.00009914211,0.000088477944,0.000023038507,0.0000013904702,0.0000068764157,0.0005010511],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9989722,0.000048969057,0.00022197538,0.00022802697,0.00022991073,0.00029894864],"domain_scores_gemma":[0.99939144,0.00005898606,0.000094283176,0.00037648212,0.000036583882,0.00004224216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019855314,0.000114354014,0.00014848314,0.000040058032,0.0001768428,0.00008808386,0.00055869005,0.00005018229,0.00005075889],"category_scores_gemma":[0.0000048790193,0.000085816064,0.00009318802,0.00020233492,0.000050717856,0.00015970638,0.00013519934,0.00011014387,0.000022053451],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086152344,0.0011592543,0.118202455,0.00007999415,0.0001580206,0.00021576318,0.0067035104,0.0077299033,0.0027423874,0.78413254,0.017365618,0.061424416],"study_design_scores_gemma":[0.013544435,0.00065260695,0.7415377,0.0003926943,0.00044661277,0.00035962203,0.01058495,0.13137482,0.005780731,0.033911653,0.057981666,0.0034325095],"about_ca_topic_score_codex":0.000039859064,"about_ca_topic_score_gemma":0.00010567292,"teacher_disagreement_score":0.7502209,"about_ca_system_score_codex":0.00006482543,"about_ca_system_score_gemma":0.000030998825,"threshold_uncertainty_score":0.34994775},"labels":[],"label_agreement":null},{"id":"W2124044732","doi":"10.1109/glocom.1998.775768","title":"An ATM scheduler supporting all adaptation alternatives for real-time services","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Jitter; Computer science; Queueing theory; Computer network; Asynchronous Transfer Mode; Scheduling (production processes); Multiplexing; Time-division multiplexing; Real-time computing; ATM adaptation layer; Statistical time division multiplexing; Distributed computing; Telecommunications; Engineering","score_opus":0.025472951024990576,"score_gpt":0.27153582253936603,"score_spread":0.24606287151437545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124044732","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067551196,0.000052468455,0.92301977,0.0018969551,0.00018655902,0.00029020704,0.0000019039354,0.00052935624,0.006471602],"genre_scores_gemma":[0.8764883,0.000019373145,0.12041825,0.0006646452,0.0001757301,0.000035840112,0.000007913644,0.0000085277,0.0021813926],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990302,0.000045266166,0.0002061825,0.00031653472,0.00015029903,0.0002515295],"domain_scores_gemma":[0.9993232,0.00009999742,0.00011318323,0.0002649795,0.00010265747,0.000095967094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002291535,0.00010496575,0.000111880036,0.000040175622,0.00009374407,0.00017337577,0.000469662,0.000038145547,0.0002020299],"category_scores_gemma":[0.0000057957627,0.00009222167,0.00004607587,0.00009261577,0.00001274679,0.0008324589,0.000029193336,0.000039882252,0.00013293023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011120084,0.00012507582,0.00017129627,0.000015394853,0.00004784811,0.0000045134034,0.0027175436,0.0073807696,0.0014497499,0.08928861,0.00095753267,0.89783055],"study_design_scores_gemma":[0.00037770282,0.00010800699,0.00018412962,0.000007533257,0.0000067961905,0.0000023778043,0.000091974995,0.9960979,0.00014997102,0.0008141094,0.0020336148,0.00012587545],"about_ca_topic_score_codex":0.000031770327,"about_ca_topic_score_gemma":0.000028613273,"teacher_disagreement_score":0.98871714,"about_ca_system_score_codex":0.000012272399,"about_ca_system_score_gemma":0.000009844666,"threshold_uncertainty_score":0.37606907},"labels":[],"label_agreement":null},{"id":"W2124228745","doi":"10.1109/icpp-w.2008.25","title":"An Analysis of QoS Provisioning for Sockets Direct Protocol vs. IPoIB over Modern InfiniBand Networks","year":2008,"lang":"en","type":"article","venue":"Proceedings - International Workshops on Parallel Processing","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"InfiniBand; Quality of service; Computer science; Computer network; Provisioning; Service (business); Protocol (science); Distributed computing","score_opus":0.01926760105681429,"score_gpt":0.30079149184214266,"score_spread":0.28152389078532836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124228745","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017499374,0.00007644133,0.96743387,0.00058623095,0.0002761893,0.010861753,0.0000068458075,0.000387166,0.0028721176],"genre_scores_gemma":[0.96513915,0.000010125245,0.018165814,0.00051044114,0.00052204286,0.015270393,0.00002348261,0.000035607678,0.00032293453],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969347,0.000022817174,0.00076708914,0.0009252384,0.00081277255,0.0005373869],"domain_scores_gemma":[0.99760413,0.00018888518,0.0007308368,0.00024732648,0.001047819,0.00018101603],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058159936,0.00037013777,0.0005694568,0.00057155365,0.00048380633,0.00044576894,0.0013391952,0.00019339827,0.000020444555],"category_scores_gemma":[0.00014272617,0.000338271,0.00027733963,0.0011433774,0.000108110995,0.0015905955,0.00013298537,0.00030687323,0.000002113701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016177099,0.0008059843,0.021084385,0.00011310904,0.00092551776,0.000008270156,0.0037985952,0.58666015,0.00013213458,0.009735779,0.0022118946,0.37290645],"study_design_scores_gemma":[0.0015148565,0.00021326327,0.0047506457,0.00020142274,0.00010784439,0.000006750306,0.0000381406,0.98987997,0.000058839283,0.00038193705,0.0024715695,0.00037477718],"about_ca_topic_score_codex":0.0000046140726,"about_ca_topic_score_gemma":0.000004306352,"teacher_disagreement_score":0.94926804,"about_ca_system_score_codex":0.00011863508,"about_ca_system_score_gemma":0.00016127432,"threshold_uncertainty_score":0.99990696},"labels":[],"label_agreement":null},{"id":"W2124726667","doi":"10.1109/icccn.1997.623338","title":"Heuristic algorithms for path selection in private ATM networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Shortest path problem; Heuristic; K shortest path routing; Constrained Shortest Path First; Path (computing); Mathematical optimization; Consistent heuristic; Computer science; Longest path problem; Selection (genetic algorithm); Algorithm; Shortest Path Faster Algorithm; Incremental heuristic search; Mathematics; Search algorithm; Theoretical computer science; Artificial intelligence; Graph; Computer network; Beam search","score_opus":0.0177850890709567,"score_gpt":0.22054427334645474,"score_spread":0.20275918427549805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124726667","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010700548,0.00020746188,0.99634403,0.00064485666,0.00030728104,0.00026514838,2.9635322e-7,0.0002232416,0.0009376124],"genre_scores_gemma":[0.9512511,0.000047087542,0.046195306,0.00051669654,0.00024348887,0.000083367624,0.0000010151036,0.000007781046,0.001654166],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991014,0.000034759607,0.00018513865,0.0002865027,0.0000973353,0.000294834],"domain_scores_gemma":[0.99959946,0.0001251512,0.000041950887,0.00013760505,0.00003563165,0.000060214992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016979223,0.00009924819,0.0001205011,0.000049376275,0.000074237185,0.000081716615,0.00027273266,0.00005959083,0.000042073665],"category_scores_gemma":[0.000017013232,0.00008977685,0.000043712265,0.00035379504,0.0000119454435,0.00017697475,0.00003249717,0.00009933206,0.00002788339],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005065014,0.00006873868,0.0005836689,0.000003334284,0.000007714263,0.0000042245833,0.00004896793,0.027902834,0.000005370992,0.058132112,0.0061518573,0.90708613],"study_design_scores_gemma":[0.00056173926,0.00007927993,0.0008276661,0.000008227525,0.0000027689002,0.000006315541,0.0000015944277,0.99058133,0.0000043983664,0.0009205046,0.0068896823,0.00011647314],"about_ca_topic_score_codex":0.000005984624,"about_ca_topic_score_gemma":0.000017491895,"teacher_disagreement_score":0.9626785,"about_ca_system_score_codex":0.000032927812,"about_ca_system_score_gemma":0.000006890862,"threshold_uncertainty_score":0.36609936},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0200924775204729,"score_gpt":0.23251640923868425,"score_spread":0.21242393171821133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124920704","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022619322,0.000051017316,0.9662616,0.0009340045,0.00024030983,0.0015253177,0.0000018759166,0.00015011308,0.008216415],"genre_scores_gemma":[0.99483216,0.0000059320223,0.0030866521,0.00021508905,0.00003474636,0.00021867183,2.8717477e-7,0.000003960262,0.0016024818],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924195,0.000047132835,0.00017902697,0.00023474146,0.0001493081,0.00014786387],"domain_scores_gemma":[0.9993827,0.00013325372,0.00007525264,0.00027145885,0.0000954819,0.00004188099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012521593,0.000084407664,0.0001506275,0.000058868944,0.000054250977,0.00002838308,0.00030840174,0.000024735313,0.00003300153],"category_scores_gemma":[0.000008038591,0.00007233276,0.000043361928,0.00013894621,0.000013759716,0.0001522268,0.00003238068,0.00003700708,0.000015049944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034511177,0.00056410575,0.00008531273,0.0000060208686,0.00011997234,0.0000048577635,0.00056630874,0.0011862222,0.0000067674255,0.12100687,0.0017751941,0.87464386],"study_design_scores_gemma":[0.010880457,0.0013961944,0.003987992,0.000015773792,0.00009196594,0.000004083113,0.0009884442,0.9773916,0.00004881284,0.0009579461,0.0039998083,0.00023693682],"about_ca_topic_score_codex":0.0000066778275,"about_ca_topic_score_gemma":0.000020178455,"teacher_disagreement_score":0.97620535,"about_ca_system_score_codex":0.000016179903,"about_ca_system_score_gemma":0.0000036952854,"threshold_uncertainty_score":0.29496446},"labels":[],"label_agreement":null},{"id":"W2125280768","doi":"10.1109/lcomm.2009.090979","title":"Output characterization of constant bit rate traffic in FIFO networks","year":2009,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; FIFO (computing and electronics); Constant (computer programming); Constant bitrate; Computer network; Packet switching; Characterization (materials science); Bit rate; Algorithm; Network packet; Variable bitrate; Computer hardware","score_opus":0.01749958778141531,"score_gpt":0.23177171644539957,"score_spread":0.21427212866398426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125280768","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36066726,0.00024132291,0.59392625,0.044011507,0.00030563405,0.00034081223,0.000004022326,0.00017940819,0.0003237848],"genre_scores_gemma":[0.99222255,0.00025899458,0.0030233148,0.004378336,0.000037780763,0.000021916912,0.000021665124,0.0000059626955,0.000029498617],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875355,0.0002868376,0.00042730008,0.0002100537,0.000098241515,0.0002239914],"domain_scores_gemma":[0.99799436,0.00019389868,0.00019418572,0.0014982496,0.0000665699,0.00005274025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037340468,0.00012684095,0.00020673369,0.00017090929,0.00010301079,0.000064904416,0.0015762671,0.000059405604,0.0000029383484],"category_scores_gemma":[0.000013565066,0.000133867,0.000060902883,0.000639696,0.00011134427,0.00030663278,0.00006436981,0.00022971487,0.000010339445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028570037,0.00038631257,0.0003941539,0.0000065533077,0.00003323142,0.000009192137,0.0009873351,0.09547151,0.041293193,0.03263182,0.0014941363,0.827264],"study_design_scores_gemma":[0.00066828355,0.000045142184,0.0096843,0.00007275013,0.000009601199,0.000005094166,0.000010507962,0.9863406,0.00014347277,0.00009092919,0.0027183713,0.00021098691],"about_ca_topic_score_codex":0.000004312591,"about_ca_topic_score_gemma":0.000017866332,"teacher_disagreement_score":0.8908691,"about_ca_system_score_codex":0.00004106799,"about_ca_system_score_gemma":0.000042658456,"threshold_uncertainty_score":0.5458937},"labels":[],"label_agreement":null},{"id":"W2125488691","doi":"10.1109/iscc.2001.935371","title":"MBA: a tool for multicast billing and accounting","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Multicast; Computer science; Protocol Independent Multicast; Pragmatic General Multicast; IP multicast; Source-specific multicast; Computer network; Xcast; Inter-domain; Router; Distance Vector Multicast Routing Protocol; Debugging; Internet Group Management Protocol; Distributed computing; Operating system","score_opus":0.01919200072062762,"score_gpt":0.2107482118532623,"score_spread":0.19155621113263469,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125488691","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01593373,0.00020927824,0.98065966,0.001624579,0.00013698402,0.00014785978,3.1745896e-7,0.00015930396,0.0011282776],"genre_scores_gemma":[0.9241151,0.000016314905,0.07446998,0.0006030901,0.00011106315,0.000020300571,1.18113384e-7,0.0000034770837,0.00066052773],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994769,0.000007077803,0.00010013509,0.00018928661,0.000064077285,0.00016253287],"domain_scores_gemma":[0.9995959,0.00017643516,0.000023266242,0.00013090548,0.000041019302,0.000032500222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011881773,0.000059309088,0.000071599716,0.000025209538,0.000115876566,0.00015284083,0.00015066403,0.00002489247,0.000023484115],"category_scores_gemma":[0.00003260444,0.000048003207,0.000024614292,0.000079349054,0.000014888573,0.00023058978,0.000042001087,0.000035576886,0.000020789525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011290421,0.000013111665,0.0002456715,0.0000040543373,0.000005645324,0.0000010373246,0.000116025294,0.00013539437,0.00004919497,0.055164613,0.0011719612,0.94309217],"study_design_scores_gemma":[0.00037191476,0.000017569673,0.00010714509,0.000005745464,0.000003104024,0.0000054601182,0.000008558357,0.9890663,0.000019351146,0.00028618,0.010029299,0.00007937166],"about_ca_topic_score_codex":0.0000015073722,"about_ca_topic_score_gemma":0.0000020531406,"teacher_disagreement_score":0.9889309,"about_ca_system_score_codex":0.0000047265403,"about_ca_system_score_gemma":0.0000037087943,"threshold_uncertainty_score":0.1957514},"labels":[],"label_agreement":null},{"id":"W2125521367","doi":"10.1109/icc.1988.13574","title":"Time constrained applications on a LAN-a performance study","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Constraint (computer-aided design); Computer science; Layer (electronics); Protocol (science); Measure (data warehouse); Data link layer; Application layer; Local area network; Time constraint; Function (biology); Architecture; Computer network; Physical layer; Data mining; Mathematics; Operating system","score_opus":0.007895112547342818,"score_gpt":0.21217899356538086,"score_spread":0.20428388101803804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125521367","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0837619,0.000032690008,0.64156723,0.00070420967,0.00014466376,0.0011742106,8.869928e-7,0.00073616893,0.271878],"genre_scores_gemma":[0.9908266,0.0000014920023,0.0028465772,0.0004688519,0.000027511911,0.00012377466,4.4398354e-7,0.0000031477687,0.005701588],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993507,0.000045004457,0.00010923596,0.00022038692,0.00012911043,0.00014556269],"domain_scores_gemma":[0.99944997,0.00007301116,0.000025571762,0.00035643316,0.00003658376,0.000058456717],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00017326065,0.00007643018,0.000081993865,0.000034935212,0.00010606449,0.00004906737,0.0002834014,0.000019390442,0.00013078171],"category_scores_gemma":[0.000006340265,0.0000625742,0.000020861042,0.0002114669,0.000026042537,0.000089368026,0.000015951833,0.00006514323,0.0011162936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006536174,0.0006701438,0.0010604782,0.000002298152,0.00003322241,0.000004541594,0.00024563042,0.0015879496,0.00003132821,0.49205077,0.0025537438,0.50175333],"study_design_scores_gemma":[0.0042076265,0.0015757394,0.0036893443,0.000017001232,0.000029253608,0.000045856843,0.0003278582,0.8293085,0.00023567496,0.0010541184,0.15870579,0.000803227],"about_ca_topic_score_codex":4.7822294e-7,"about_ca_topic_score_gemma":0.0000011728292,"teacher_disagreement_score":0.90706474,"about_ca_system_score_codex":0.000010507883,"about_ca_system_score_gemma":0.000044513945,"threshold_uncertainty_score":0.99966145},"labels":[],"label_agreement":null},{"id":"W2125530070","doi":"10.1109/glocom.1994.512820","title":"A new approach in the transient analysis of ATM multiplexers with bursty sources","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Multiplexer; Markov process; Transient (computer programming); Computer science; Probability-generating function; Superposition principle; Queue; Generating function; Markov chain; Random variable; Markovian arrival process; Queueing theory; Transient analysis; Function (biology); Stochastic process; Asynchronous Transfer Mode; Moment-generating function; Algorithm; Binary number; Steady state (chemistry); Mathematics; Multiplexing; Statistics; Computer network; Discrete mathematics; Mathematical analysis; Telecommunications","score_opus":0.017209584458843446,"score_gpt":0.1974745209185882,"score_spread":0.18026493645974476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125530070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03750427,0.00014714136,0.95310426,0.0013053239,0.000013743683,0.00013456057,3.275965e-7,0.000039843944,0.0077505307],"genre_scores_gemma":[0.9769996,0.000008042104,0.022102287,0.00026642167,0.000013126361,0.000008886572,6.0722914e-7,0.0000019044196,0.0005991203],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991913,0.00006579039,0.000145838,0.00021486967,0.00023674466,0.00014549367],"domain_scores_gemma":[0.9994581,0.000096597985,0.000042617532,0.0003403987,0.000020039224,0.000042270203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018395923,0.00007808156,0.00016991836,0.00012190544,0.00003142527,0.000042567164,0.00053652166,0.000023796083,0.00007196096],"category_scores_gemma":[0.0000023749149,0.000042054216,0.00008137275,0.0015426878,0.000030493518,0.00009031232,0.000011810285,0.00006714129,0.000004209945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000252891,0.00032680537,0.007880781,0.000006223198,0.00051207945,0.000007973796,0.019243972,0.36014485,0.0000108181275,0.029231539,0.0023086143,0.58030105],"study_design_scores_gemma":[0.00046316223,0.000035039422,0.009467793,0.0000028060604,0.00009691594,0.0000018817677,0.00031840784,0.98876494,0.000002794378,0.000009197725,0.00076933426,0.00006773557],"about_ca_topic_score_codex":0.00012641319,"about_ca_topic_score_gemma":0.00020491592,"teacher_disagreement_score":0.9394953,"about_ca_system_score_codex":0.0000067325254,"about_ca_system_score_gemma":0.000011821484,"threshold_uncertainty_score":0.17149211},"labels":[],"label_agreement":null},{"id":"W2125698398","doi":"10.1109/ccece.2009.5090106","title":"Dynamic admission control and path allocation for SLAs in DiffServ networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Quality of service; Service level; Admission control; Computer network; Path (computing); Context (archaeology); Throughput; Blocking (statistics); Distributed computing; Prioritization","score_opus":0.004385523136421856,"score_gpt":0.21759467149678746,"score_spread":0.2132091483603656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125698398","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009759118,0.00044465813,0.98235846,0.0066386648,0.00012833624,0.00035280557,2.6923317e-7,0.000110659435,0.00020701058],"genre_scores_gemma":[0.989895,0.000056146735,0.0078925295,0.0017897406,0.000037858157,0.00002710752,0.000002933898,0.0000032736928,0.00029542885],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925536,0.000034001787,0.00017164937,0.00025746317,0.000079870544,0.00020164033],"domain_scores_gemma":[0.9995439,0.00011778509,0.000043359047,0.00017567776,0.00003479215,0.00008447749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020469818,0.000094011564,0.00012744022,0.000046261644,0.00006139928,0.00007092412,0.00018929069,0.00006569166,0.0000029807293],"category_scores_gemma":[0.000017470416,0.00007811218,0.000028167831,0.00013034003,0.0000093193385,0.00019992366,0.000014302593,0.00006887596,0.000001672525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003678878,0.000048307065,0.00032942177,0.0000022096447,0.0000034033849,0.0000017187468,0.000042323518,0.007836337,0.00009437311,0.05777147,0.00047979923,0.93335384],"study_design_scores_gemma":[0.001528548,0.00013439072,0.017940698,0.000017968152,0.0000036927827,0.0000027144126,0.0000052861783,0.97676295,0.0000018713558,0.002810286,0.0006929134,0.0000987059],"about_ca_topic_score_codex":0.0000034142558,"about_ca_topic_score_gemma":0.000028781442,"teacher_disagreement_score":0.98013586,"about_ca_system_score_codex":0.000021416441,"about_ca_system_score_gemma":0.000023272534,"threshold_uncertainty_score":0.31853223},"labels":[],"label_agreement":null},{"id":"W2125837860","doi":"10.1109/glocom.2000.891929","title":"Enhancing network performance with TCP rate control","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Computer network; Computer science; TCP Friendly Rate Control; TCP tuning; TCP global synchronization; TCP acceleration; TCP Westwood plus; Network congestion; CUBIC TCP; TCP delayed acknowledgment; HSTCP; Compound TCP; Zeta-TCP; Network traffic control; Transmission Control Protocol; Flow control (data); Network packet; Distributed computing","score_opus":0.006835023824152886,"score_gpt":0.16489302693279495,"score_spread":0.15805800310864207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125837860","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010903312,0.00028792638,0.96347195,0.0019781867,0.0002909599,0.00016187644,1.3807048e-7,0.00041909062,0.022486566],"genre_scores_gemma":[0.9821571,0.000041027783,0.009210289,0.0027124067,0.00029052355,0.000024680809,1.9812536e-7,0.00000781721,0.005555953],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889797,0.000058270743,0.00017538463,0.0002937089,0.00016413942,0.00041050836],"domain_scores_gemma":[0.99926585,0.00012755468,0.000060588576,0.0003703705,0.00006735939,0.00010829974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002571185,0.00013861734,0.0001654108,0.00002708872,0.00018065063,0.00012680747,0.0004306462,0.000037854425,0.00024513097],"category_scores_gemma":[0.0000051587663,0.00009993474,0.000033488832,0.00031009503,0.000030956657,0.0003984313,0.000033010976,0.00012557187,0.0003850581],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000436078,0.00006908774,0.0026210118,0.000011394942,0.00008115713,0.000037264876,0.00020532178,0.09266803,0.00009006307,0.059520867,0.017468218,0.82718396],"study_design_scores_gemma":[0.0010010572,0.00014485129,0.00086930615,0.000025421074,0.000008295951,0.0000187729,0.0000039749625,0.9852728,0.00008013531,0.00004746889,0.012339996,0.00018789254],"about_ca_topic_score_codex":0.000002089723,"about_ca_topic_score_gemma":0.000017565808,"teacher_disagreement_score":0.9712538,"about_ca_system_score_codex":0.00001717815,"about_ca_system_score_gemma":0.000017549835,"threshold_uncertainty_score":0.49492714},"labels":[],"label_agreement":null},{"id":"W2125841758","doi":"10.1109/infcom.1990.91249","title":"Performance modeling of the SIGnet MAN backbone","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Bandwidth (computing); Computer network; Queueing theory; Multiplexing; Exploit; Network topology; Queue; Topology (electrical circuits); Multicast; Distributed computing; Engineering; Telecommunications","score_opus":0.017765240349897654,"score_gpt":0.1718013862970912,"score_spread":0.15403614594719356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125841758","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22188729,0.00024572483,0.7139332,0.0029896877,0.00034131788,0.0001361248,2.4613144e-7,0.00013682437,0.060329523],"genre_scores_gemma":[0.99396455,0.00002285202,0.002918675,0.00038274177,0.00003399659,0.000002964409,4.094479e-8,0.0000021852281,0.0026719836],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994968,0.000018539733,0.00011764838,0.00011302772,0.00013777104,0.0001161893],"domain_scores_gemma":[0.9995692,0.000018405315,0.000029212364,0.00032490358,0.00003377807,0.000024544757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007859936,0.000050870003,0.00006487873,0.0000145700715,0.00006174805,0.000018528704,0.000516928,0.000020117486,0.00010957506],"category_scores_gemma":[0.0000029399716,0.000031762265,0.00003623799,0.00016048123,0.000017877179,0.00013653834,0.000076358214,0.00005433131,0.000048817026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002392836,0.00005814152,0.0009415114,0.000009120758,0.000013029502,6.774298e-7,0.00032219203,0.35397267,0.00012271963,0.03866223,0.0043272977,0.60156804],"study_design_scores_gemma":[0.00012788207,0.000016477534,0.00013361395,0.000007820787,0.0000019243794,0.0000023624673,0.0000041253984,0.9990654,0.000056552013,0.00006966849,0.00046876835,0.00004538587],"about_ca_topic_score_codex":0.0000031436905,"about_ca_topic_score_gemma":0.000002282954,"teacher_disagreement_score":0.77207726,"about_ca_system_score_codex":0.000005059687,"about_ca_system_score_gemma":0.0000062125628,"threshold_uncertainty_score":0.12952276},"labels":[],"label_agreement":null},{"id":"W2126036937","doi":"10.1109/icdcsw.2003.1203617","title":"On loss-aware packet scheduling for video transport over a multi-hop IP network","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Packet loss; Computer science; Computer network; Scheduling (production processes); Hop (telecommunications); End-to-end delay; Data loss; End-to-end principle; Quality of service; Network packet; Distributed computing; Engineering","score_opus":0.01663745615301623,"score_gpt":0.251163692300094,"score_spread":0.23452623614707777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126036937","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024855973,0.00010551123,0.9714836,0.0017766879,0.00064070226,0.00042861386,0.000004891699,0.00043543175,0.00026862283],"genre_scores_gemma":[0.89268845,0.000008259716,0.10247613,0.0039532664,0.00037576907,0.00007654613,0.000006688527,0.000017847506,0.00039706062],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984448,0.000019831834,0.00027638886,0.0005161308,0.00023155953,0.00051128754],"domain_scores_gemma":[0.99906313,0.00016909535,0.00007190564,0.00044416013,0.00008967315,0.0001620135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025109644,0.0002127766,0.00022980738,0.000045823577,0.00019734656,0.00008338623,0.0005257824,0.000092191956,0.000047530095],"category_scores_gemma":[0.000016199314,0.00018346112,0.00017447225,0.00028036314,0.000036561483,0.0002769586,0.000027683154,0.00015955501,0.0000815306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011187448,0.00019743021,0.00053406256,0.000017197737,0.00006042582,0.000034409168,0.00018014488,0.48545536,0.0000140057555,0.43707407,0.0018265874,0.074494414],"study_design_scores_gemma":[0.008118759,0.000363092,0.0018058288,0.0001999596,0.000032220316,0.0000131925435,0.000023976801,0.96364397,0.000112672795,0.014094995,0.010887298,0.0007040149],"about_ca_topic_score_codex":0.000015262622,"about_ca_topic_score_gemma":0.00008734167,"teacher_disagreement_score":0.86900747,"about_ca_system_score_codex":0.000051207604,"about_ca_system_score_gemma":0.00012580617,"threshold_uncertainty_score":0.74813277},"labels":[],"label_agreement":null},{"id":"W2126081251","doi":"10.1109/ccece.1998.685626","title":"DESNET: a generic tool for the representation of computer networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université TÉLUQ","funders":"","keywords":"Computer science; Network topology; Representation (politics); Routing (electronic design automation); Distributed computing; Computer network","score_opus":0.028778396289672176,"score_gpt":0.23189169396655473,"score_spread":0.20311329767688255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126081251","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006730208,0.00048693636,0.99647707,0.0013139339,0.00037686253,0.00026552033,2.2657676e-7,0.00007244707,0.0003339734],"genre_scores_gemma":[0.9422194,0.000051135758,0.05561625,0.00086346106,0.00033523192,0.000054012733,6.2683563e-7,0.000004308776,0.00085557235],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993939,0.000031223008,0.00016634885,0.0001682982,0.00010191238,0.00013834186],"domain_scores_gemma":[0.999093,0.00040543466,0.00006380075,0.00033606906,0.0000801748,0.000021548349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011534306,0.00006208671,0.00009331984,0.000018482331,0.00007912423,0.00005471436,0.00039460234,0.000028416438,0.000048766524],"category_scores_gemma":[0.000008005567,0.000040276696,0.00006378166,0.0002840277,0.000026258916,0.00011961472,0.00004992451,0.000038032103,0.000009783308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029808434,0.000017118631,0.00013967523,0.0000015882896,0.00001767406,3.3639748e-7,0.000060743016,0.15726066,0.0000039612355,0.025052112,0.022946317,0.79449683],"study_design_scores_gemma":[0.0002988902,0.000044390366,0.0008580574,0.0000031425277,0.000007842739,0.0000033479873,0.0000030674341,0.9951272,0.00001536518,0.0001421675,0.0034412774,0.00005524756],"about_ca_topic_score_codex":0.000004214789,"about_ca_topic_score_gemma":0.0000030950089,"teacher_disagreement_score":0.9415464,"about_ca_system_score_codex":0.0000056332774,"about_ca_system_score_gemma":0.0000049472133,"threshold_uncertainty_score":0.1642436},"labels":[],"label_agreement":null},{"id":"W2126143541","doi":"10.1109/icme.2004.1394237","title":"Network-level loss control schemes for streaming video","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Packet loss; Computer science; Computer network; Quality of service; Network congestion; Network packet; Router; Scheduling (production processes); Processing delay; Real-time computing; Transmission delay; Engineering","score_opus":0.01914271898461711,"score_gpt":0.2365083148711052,"score_spread":0.2173655958864881,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126143541","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007934579,0.00041120284,0.98659074,0.009272822,0.0003080634,0.00031783016,0.0000035936166,0.00035110064,0.0019511722],"genre_scores_gemma":[0.860068,0.000006724983,0.13182004,0.0041944818,0.0011309903,0.00007789988,0.0000018214128,0.000009507624,0.0026905392],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987317,0.000029632403,0.00024700025,0.00035512506,0.00016307991,0.00047349668],"domain_scores_gemma":[0.99897987,0.00035557558,0.00007131054,0.00036242115,0.00011406328,0.000116786076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003000481,0.00015240507,0.0001970487,0.000033176904,0.00017304679,0.00014654204,0.00057507417,0.000067313755,0.000045589386],"category_scores_gemma":[0.000028850782,0.00013193392,0.00009715768,0.00015473097,0.000030516621,0.00040679393,0.000055384447,0.00008522219,0.000075282296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014376255,0.000024533376,0.00022639227,0.0000022374256,0.000024448584,0.0000013530802,0.000019731564,0.007083121,0.00001166756,0.23846336,0.013710274,0.7404185],"study_design_scores_gemma":[0.0017571637,0.000050634117,0.0002483757,0.000011947853,0.000012187977,0.000006679345,0.0000046246705,0.78954804,0.000047878948,0.0018558899,0.20626268,0.00019390203],"about_ca_topic_score_codex":0.000003081147,"about_ca_topic_score_gemma":0.000032763637,"teacher_disagreement_score":0.85927457,"about_ca_system_score_codex":0.000028732517,"about_ca_system_score_gemma":0.00006336092,"threshold_uncertainty_score":0.53801095},"labels":[],"label_agreement":null},{"id":"W2126305659","doi":"10.1109/icc.1998.685136","title":"Techniques to increase MPEG-2 error resilience in the VBR video transmission over ATM networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Variable bitrate; Asynchronous Transfer Mode; Computer network; Resilience (materials science); MPEG-2; ATM adaptation layer; Transmission (telecommunications); MPEG-4; Real-time computing; Set (abstract data type); Telecommunications; Bit rate; Coding (social sciences)","score_opus":0.011704295988610473,"score_gpt":0.23587208893567366,"score_spread":0.22416779294706318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126305659","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007196004,0.00036962784,0.96692383,0.011382839,0.00009493356,0.00047559533,2.9388974e-7,0.0003464362,0.013210448],"genre_scores_gemma":[0.9750377,0.000067533125,0.014174461,0.009135496,0.00011936038,0.00008228463,3.8695163e-7,0.0000069845573,0.0013758113],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846786,0.00018772224,0.00025537316,0.00041096203,0.00031609516,0.0003619939],"domain_scores_gemma":[0.9989678,0.000236971,0.000037582296,0.0005847363,0.000031669802,0.00014121176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055422913,0.0001563493,0.00014835695,0.00008329562,0.00013593436,0.0001449033,0.0011904328,0.00008400035,0.00018559257],"category_scores_gemma":[0.000025906402,0.00010115869,0.000060439066,0.0007724183,0.000038484264,0.0003229278,0.00007973689,0.00022270474,0.000051820047],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015776464,0.00008718175,0.00024799418,0.0000019640308,0.0000024666388,0.000032471653,0.00053947157,0.0027846824,0.000054810844,0.011262401,0.04090007,0.9440707],"study_design_scores_gemma":[0.0002739249,0.00011477025,0.0020893882,0.000048543778,0.000004095029,0.000016510865,0.000031311258,0.9192137,0.00006228824,0.0003361075,0.07759889,0.00021042927],"about_ca_topic_score_codex":0.00009697414,"about_ca_topic_score_gemma":0.00007992228,"teacher_disagreement_score":0.9678417,"about_ca_system_score_codex":0.000026830088,"about_ca_system_score_gemma":0.000014472457,"threshold_uncertainty_score":0.41251314},"labels":[],"label_agreement":null},{"id":"W2126433194","doi":"10.1109/ccece.1997.608365","title":"Proactive congestion controls for real time services","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Computer network; Network congestion; Markov process; Path (computing); Real-time computing; Expression (computer science); Probability distribution; Mathematics; Statistics","score_opus":0.010928357924324764,"score_gpt":0.20752193372649066,"score_spread":0.1965935758021659,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126433194","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011051496,0.00024609503,0.8883168,0.009340115,0.0005490205,0.0018181286,0.000009606228,0.0014658899,0.087202825],"genre_scores_gemma":[0.9676105,0.000030368587,0.017867474,0.00093989633,0.00026199193,0.00022102277,0.00000492955,0.00001018572,0.013053676],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991606,0.000036734917,0.00014891225,0.00029105996,0.00013121344,0.0002315111],"domain_scores_gemma":[0.99927706,0.00021232596,0.00006320476,0.00024209314,0.00012591829,0.000079413374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013617167,0.00010943919,0.00014831201,0.000036293866,0.00010440649,0.00012555944,0.00036358312,0.000059738155,0.00012696916],"category_scores_gemma":[0.0000078772955,0.00009172712,0.00005879727,0.00010924696,0.000019997413,0.0004066084,0.000031685242,0.000049569993,0.00031895508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037404825,0.00011409586,0.00005504765,0.000010864349,0.00007584626,0.0000029841733,0.00033538858,0.00037275007,0.00065096834,0.18905188,0.0064776377,0.80281514],"study_design_scores_gemma":[0.0011000386,0.00014007109,0.0002796883,0.0000072488265,0.000013742408,0.0000049028768,0.000010722907,0.9879941,0.000096448566,0.0010903828,0.009122715,0.00013998958],"about_ca_topic_score_codex":0.000010003415,"about_ca_topic_score_gemma":0.0000073841966,"teacher_disagreement_score":0.9876213,"about_ca_system_score_codex":0.00002090721,"about_ca_system_score_gemma":0.000010899985,"threshold_uncertainty_score":0.40996286},"labels":[],"label_agreement":null},{"id":"W2126485411","doi":"10.1109/hpsr.2005.1503263","title":"Self-tuning multiloop PI rate controller for an MOMO AQM router with interval gain margin assignment","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Active queue management; Control theory (sociology); Router; Phase margin; Computer science; Robustness (evolution); MIMO; Queueing theory; PID controller; Queue; Network congestion; Computer network; Engineering; Amplifier; Bandwidth (computing); Operational amplifier; Control (management); Control engineering","score_opus":0.015733041301505088,"score_gpt":0.23861421186219348,"score_spread":0.2228811705606884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126485411","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00242837,0.000037982125,0.98941696,0.00416806,0.00016523413,0.000710454,0.0000019983934,0.00047801746,0.0025929417],"genre_scores_gemma":[0.81279445,0.0000037495136,0.17996837,0.0033462818,0.00030828879,0.00018389855,0.0000030379742,0.000018383114,0.0033735605],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983425,0.00014225341,0.0002960366,0.0005305059,0.00021409772,0.00047458307],"domain_scores_gemma":[0.9989858,0.0002020325,0.00010451425,0.00038891396,0.00011964893,0.00019909222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006254483,0.00023826105,0.00028159504,0.00006702817,0.00014829703,0.00028277902,0.0005902378,0.0000673987,0.000047272],"category_scores_gemma":[0.000009181381,0.00017343108,0.00008762008,0.00011674256,0.000026719203,0.0006933192,0.00007917069,0.00012904844,0.000042128813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003407613,0.0003827934,0.00018192116,0.000011147584,0.000186731,0.000009556902,0.0007200836,0.019540504,0.00030078366,0.03912959,0.004988822,0.9342073],"study_design_scores_gemma":[0.0044295327,0.0004725611,0.00007087084,0.00001616362,0.000022903416,0.000008012822,0.00005143866,0.95728344,0.00016465454,0.00008825135,0.03712361,0.00026854145],"about_ca_topic_score_codex":0.0000062893964,"about_ca_topic_score_gemma":0.000061700055,"teacher_disagreement_score":0.93774295,"about_ca_system_score_codex":0.00007829712,"about_ca_system_score_gemma":0.00006464473,"threshold_uncertainty_score":0.7072314},"labels":[],"label_agreement":null},{"id":"W2126491814","doi":"10.1109/icme.2000.869663","title":"TBLB algorithm for servicing real-time multimedia traffic streams","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Token bucket; Computer science; Leaky bucket; Quality of service; Jitter; Computer network; Real-time computing; Network packet; Traffic policing; Bandwidth (computing); Security token; Traffic shaping; Algorithm; Network traffic control","score_opus":0.011881406614241606,"score_gpt":0.2117701026067555,"score_spread":0.19988869599251388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126491814","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037106618,0.00013200307,0.98580337,0.0017221806,0.00047045606,0.00045935166,0.000005860693,0.0010262163,0.0066699325],"genre_scores_gemma":[0.17967471,0.0000977938,0.797357,0.0010693243,0.0007500766,0.00012798971,0.000010577416,0.000034367633,0.020878114],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987218,0.000033940323,0.00023538442,0.00041354916,0.00019291946,0.000402437],"domain_scores_gemma":[0.99895066,0.00033277564,0.00006105011,0.0004068937,0.00009233581,0.00015626008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016550912,0.00016903454,0.00020302444,0.00006147197,0.00013849346,0.00012363828,0.00057783216,0.00007876798,0.00034255855],"category_scores_gemma":[0.000012290694,0.00014744446,0.000102645085,0.00024062338,0.000023830824,0.00029074994,0.00005339218,0.000077714176,0.00046658618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011967979,0.0000548086,0.0000020459524,0.0000026900973,0.000015801585,0.0000043090113,0.00019249224,0.0012182947,0.00004124016,0.0009822886,0.008399714,0.98908514],"study_design_scores_gemma":[0.00071484287,0.00008430454,0.000011743085,0.000013110774,0.000010284624,0.000007957315,0.000017818427,0.9945756,0.000047497553,0.000053877615,0.0042692064,0.0001937383],"about_ca_topic_score_codex":0.000015466263,"about_ca_topic_score_gemma":0.000012578031,"teacher_disagreement_score":0.9933573,"about_ca_system_score_codex":0.000026802156,"about_ca_system_score_gemma":0.000017329028,"threshold_uncertainty_score":0.601261},"labels":[],"label_agreement":null},{"id":"W2126588260","doi":"10.1109/glocom.1989.63958","title":"A distributed queue metropolitan area network for combined video, voice, wideband data and narrowband data","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer network; Computer science; Narrowband; Network packet; Wideband; Frame (networking); Priority queue; Queueing theory; Queue; Protocol (science); Distributed computing; Real-time computing; Telecommunications; Engineering; Electronic engineering","score_opus":0.03730670004212671,"score_gpt":0.2646293479321763,"score_spread":0.22732264789004958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126588260","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00070490123,0.0012891998,0.9928568,0.0022955202,0.00044398347,0.00060764706,0.000421127,0.00022868493,0.0011521161],"genre_scores_gemma":[0.9317266,0.000079409256,0.064247906,0.0013215655,0.00024264661,0.00006453758,0.0014418735,0.0000235047,0.0008519726],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977653,0.00013411752,0.00034990476,0.0009973028,0.00021040131,0.0005429413],"domain_scores_gemma":[0.99599046,0.00065035955,0.00011198564,0.0028980938,0.0001060789,0.0002430299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009483804,0.00023444212,0.00033277035,0.000042748885,0.0003044025,0.00035753756,0.0023171376,0.00008712927,0.000022661308],"category_scores_gemma":[0.0002887117,0.00019788921,0.00003080087,0.000424569,0.00009270624,0.0009202616,0.0006802388,0.00012519924,0.0000076066835],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008615084,0.0001244074,0.0028410496,0.000022425816,0.00016201478,0.000010897698,0.00002943466,0.0002185114,0.000012147583,0.34560952,0.6196217,0.031261735],"study_design_scores_gemma":[0.0022584582,0.0001374413,0.00022034592,0.000025029985,0.000051043575,0.000023323515,0.000048510665,0.7018386,0.00001082246,0.007017668,0.28804362,0.0003251081],"about_ca_topic_score_codex":0.00004031154,"about_ca_topic_score_gemma":0.00035961912,"teacher_disagreement_score":0.9310217,"about_ca_system_score_codex":0.000035303758,"about_ca_system_score_gemma":0.00012395729,"threshold_uncertainty_score":0.80696875},"labels":[],"label_agreement":null},{"id":"W2126771198","doi":"10.1109/icme.2003.1220964","title":"Receiver-driven layered multicast using active networks","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Multicast; Computer network; Computer science; Reliable multicast; Source-specific multicast; Distributed computing; Pragmatic General Multicast; Packet loss; Xcast; Network packet; Protocol Independent Multicast; Network congestion; Distance Vector Multicast Routing Protocol","score_opus":0.021165746450447297,"score_gpt":0.24029018922565484,"score_spread":0.21912444277520754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126771198","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009224945,0.000059857313,0.9780038,0.00019118002,0.0005266375,0.00013925579,3.7153686e-7,0.00020743495,0.011646548],"genre_scores_gemma":[0.9441616,0.000010419201,0.054886892,0.00041832318,0.00008261434,0.0000057364027,3.80505e-7,0.0000074028076,0.0004266136],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895287,0.00012267283,0.0001497875,0.0003198793,0.00014055753,0.00031423647],"domain_scores_gemma":[0.99929184,0.000118335636,0.00005697463,0.00033767655,0.000074443764,0.00012073974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011492408,0.00012594537,0.00014172067,0.000041161715,0.00014167608,0.000086701715,0.00034652467,0.00007324929,0.00010249795],"category_scores_gemma":[0.00002864422,0.00011276332,0.000059499638,0.0002898805,0.000032372063,0.0003028536,0.000051015923,0.00014337266,0.000049652943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015653146,0.000088596236,0.00042620915,0.000001677163,0.00006148925,0.000028584787,0.0002215304,0.2832583,0.00024509087,0.20056255,0.0008524992,0.5142378],"study_design_scores_gemma":[0.00047993608,0.00002427843,0.00026748868,0.000008162107,0.0000065901895,0.000017454984,0.000031483985,0.994286,0.00014379459,0.00020464415,0.004370496,0.00015964899],"about_ca_topic_score_codex":0.0000098839255,"about_ca_topic_score_gemma":0.000011615348,"teacher_disagreement_score":0.9349367,"about_ca_system_score_codex":0.000043290973,"about_ca_system_score_gemma":0.000049263068,"threshold_uncertainty_score":0.45983547},"labels":[],"label_agreement":null},{"id":"W2126781925","doi":"10.1016/j.comcom.2013.03.001","title":"Comparison of PI controllers designed for the delay model of TCP/AQM networks","year":2013,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université de Montréal","funders":"","keywords":"Active queue management; Computer science; Network congestion; Robustness (evolution); Queue; Computer network; Flow control (data); PID controller; Control theory (sociology); Control (management); Control engineering; Engineering; Network packet","score_opus":0.06081634683340278,"score_gpt":0.2979869743649653,"score_spread":0.2371706275315625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126781925","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000630355,0.0019675256,0.9918223,0.004145673,0.00016470396,0.0009368739,0.000003757585,0.0000837338,0.00024505836],"genre_scores_gemma":[0.7493468,0.00007892042,0.24995136,0.00029591157,0.000038322287,0.00022992743,0.0000056015924,0.0000082516535,0.000044885397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986347,0.000177676,0.00060194626,0.00019642626,0.0001553165,0.00023391834],"domain_scores_gemma":[0.99426425,0.0023642865,0.00036464515,0.0024418093,0.00049562484,0.00006938011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035914214,0.00014593391,0.00037438518,0.00006297169,0.00030983306,0.00007796717,0.0037253366,0.000074603966,0.0000051523034],"category_scores_gemma":[0.000020628782,0.000112207614,0.00017847915,0.0002678395,0.00024296038,0.00021766302,0.000551623,0.00017484413,0.000005411771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008891045,0.00015469635,0.00016799747,0.000005641587,0.00009549399,1.8292237e-8,0.00046355752,0.6373667,0.0000769968,0.09532076,0.007362972,0.25897625],"study_design_scores_gemma":[0.00075366447,0.00008510524,0.00027214826,0.00002259523,0.00003771489,7.888955e-7,0.000028194745,0.99640316,0.000029201668,0.0014582655,0.00079800835,0.000111182984],"about_ca_topic_score_codex":0.000023213244,"about_ca_topic_score_gemma":0.000017098359,"teacher_disagreement_score":0.7487165,"about_ca_system_score_codex":0.000018046328,"about_ca_system_score_gemma":0.000084909756,"threshold_uncertainty_score":0.69226646},"labels":[],"label_agreement":null},{"id":"W2126873652","doi":"","title":"An empirical evaluation of short-period prediction performance","year":2009,"lang":"en","type":"article","venue":"International Symposium on Performance Evaluation of Computer and Telecommunication Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Autoregressive integrated moving average; Computer science; Network packet; Granularity; Throughput; Performance prediction; Mean squared prediction error; Byte; Variance (accounting); Mean squared error; Autoregressive model; Time series; Data mining; Algorithm; Statistics; Machine learning; Simulation; Mathematics","score_opus":0.04073134206951005,"score_gpt":0.32311414619898166,"score_spread":0.2823828041294716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126873652","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95398575,0.00025537173,0.04036621,0.0009491888,0.00094398163,0.00072040065,0.0000069493503,0.00009273624,0.0026794223],"genre_scores_gemma":[0.99754494,0.00023234815,0.0016887361,0.00010791251,0.00023446791,0.00009234368,0.000081076316,0.000008061119,0.00001008539],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957948,0.0006785835,0.0008816182,0.00038441533,0.0020939435,0.00016667561],"domain_scores_gemma":[0.99595046,0.00009250524,0.00041432198,0.0008932503,0.00256539,0.000084058214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046616527,0.00019683906,0.00028163657,0.00024702703,0.00015558823,0.00012774572,0.0010176391,0.00011260697,0.000015682095],"category_scores_gemma":[0.000022275173,0.0001876892,0.000062778774,0.0002901271,0.00006266052,0.0011767866,0.000066134584,0.0001704216,0.000006210314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004894334,0.00025697387,0.005143985,0.000011076387,0.000044340137,4.582342e-8,0.00056422356,0.35018188,0.0004834847,0.0019445701,0.000080119455,0.64124036],"study_design_scores_gemma":[0.0010575909,0.0007231679,0.1355173,0.0001243957,0.000051924995,0.000018395365,0.000023358249,0.86138326,0.000597673,0.00005040906,0.00031657415,0.00013597285],"about_ca_topic_score_codex":0.0000043394284,"about_ca_topic_score_gemma":0.000001181309,"teacher_disagreement_score":0.6411044,"about_ca_system_score_codex":0.00017767296,"about_ca_system_score_gemma":0.000182255,"threshold_uncertainty_score":0.76537436},"labels":[],"label_agreement":null},{"id":"W2126908489","doi":"10.1109/glocom.1996.591933","title":"Performance analysis of per-VC queueing","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Queueing theory; FIFO (computing and electronics); Computer science; Computer network; Layered queueing network; Queue; Schedule; Real-time computing; Operating system","score_opus":0.01306614564485828,"score_gpt":0.19507995638644002,"score_spread":0.18201381074158174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126908489","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29715878,0.0002817919,0.6228108,0.0009269446,0.00015232545,0.000060365703,3.7804452e-7,0.00020040432,0.07840825],"genre_scores_gemma":[0.9922105,0.000042487456,0.005078559,0.0001974476,0.000021027658,0.0000026295968,2.5414664e-7,0.0000016491167,0.0024454393],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994204,0.000017897422,0.00014475369,0.00015202962,0.00014030746,0.00012462537],"domain_scores_gemma":[0.9995357,0.000044451946,0.00004474905,0.00028809145,0.000047962032,0.000039044113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000955256,0.00005523969,0.00014027483,0.00013826363,0.00004273683,0.000025637317,0.0003443761,0.000021892482,0.000493357],"category_scores_gemma":[0.000003904764,0.000045911536,0.00008232103,0.0007792913,0.000017786644,0.00019693527,0.000039901537,0.000040999665,0.00006461392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012571948,0.00004212481,0.01087232,0.000003635266,0.00022373596,0.0000013739308,0.0003430568,0.01731779,0.000049298782,0.034939013,0.0008575846,0.9353488],"study_design_scores_gemma":[0.00008651048,0.000021020354,0.0059947823,0.0000024594267,0.000056973236,7.451988e-7,0.0000065350873,0.99249,0.00003870227,0.000008155066,0.0012354256,0.000058694215],"about_ca_topic_score_codex":0.000008618611,"about_ca_topic_score_gemma":0.000010087692,"teacher_disagreement_score":0.9751722,"about_ca_system_score_codex":0.00000721909,"about_ca_system_score_gemma":0.000005269609,"threshold_uncertainty_score":0.54019135},"labels":[],"label_agreement":null},{"id":"W2126955932","doi":"10.1109/iscc.2001.935391","title":"End-to-end QoS guarantees over Diffserv networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer network; Quality of service; Integrated services; Scalability; Computer science; Differentiated services; Reservation; Mobile QoS; The Internet; Stateful firewall; OpenFlow; Distributed computing; Service (business); Software-defined networking; Service provider; Traffic engineering","score_opus":0.011470285643508245,"score_gpt":0.2035288748471742,"score_spread":0.19205858920366595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126955932","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054853493,0.00062426145,0.9674086,0.0045309905,0.0013014604,0.00019541131,7.5652287e-7,0.00051930995,0.019933872],"genre_scores_gemma":[0.9790917,0.00005300464,0.004554565,0.0055341152,0.00067687273,0.000024868741,7.987981e-7,0.0000101742435,0.010053886],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986308,0.00004943511,0.00021815932,0.00041314735,0.0002731781,0.00041525252],"domain_scores_gemma":[0.9990429,0.00014418451,0.000041558018,0.0005535472,0.00004047397,0.00017731336],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00013109956,0.00016673908,0.00017446023,0.00006805659,0.00013089359,0.00019500303,0.00077653525,0.00007394818,0.0020766112],"category_scores_gemma":[0.000011622332,0.00013787254,0.00008763398,0.00040226607,0.00002837099,0.00029323614,0.0001563858,0.00014720927,0.00062877603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050761414,0.00007473437,0.0005485103,0.0000016249055,0.00002364722,0.000022555338,0.00015715834,0.009193869,0.00001933539,0.08869822,0.10746929,0.793786],"study_design_scores_gemma":[0.00040178475,0.00005714503,0.002657669,0.000011239023,0.0000056964686,0.000009999442,0.0000056599692,0.9241031,0.000010824399,0.00016339227,0.072363734,0.00020980186],"about_ca_topic_score_codex":0.000017661876,"about_ca_topic_score_gemma":0.000039445666,"teacher_disagreement_score":0.97360635,"about_ca_system_score_codex":0.000020577416,"about_ca_system_score_gemma":0.0000075677444,"threshold_uncertainty_score":0.9988356},"labels":[],"label_agreement":null},{"id":"W2127094827","doi":"10.1109/glocom.1999.831663","title":"Scheduling multiservice traffic for wireless ATM transmission over TDMA/TDD channels","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer network; Time division multiple access; Computer science; Wireless broadband; Quality of service; Scheduling (production processes); Wireless; Wireless network; Engineering; Telecommunications","score_opus":0.014026845533122471,"score_gpt":0.23931959122418378,"score_spread":0.2252927456910613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127094827","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059176948,0.00034370643,0.93727016,0.0009511314,0.0006806081,0.0004421417,9.3466116e-7,0.0003847804,0.0007496022],"genre_scores_gemma":[0.9081271,0.000028684239,0.08949928,0.00093925535,0.00012833672,0.0000733646,0.000002218079,0.000017678049,0.0011840506],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984878,0.000073114286,0.00027015558,0.0005038615,0.00022079126,0.00044431945],"domain_scores_gemma":[0.99907607,0.00021135944,0.00006369238,0.00034891235,0.000105310275,0.00019464247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034305707,0.00020418336,0.00022301477,0.000060468516,0.0002197457,0.00015586507,0.0005121829,0.00011734226,0.000083082494],"category_scores_gemma":[0.000013245868,0.0001763337,0.00013998526,0.00030218458,0.00001965333,0.00037091377,0.000020994501,0.00011953921,0.000035426394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024214212,0.00012241544,0.00001432664,0.00003295095,0.000027696504,0.0000047173335,0.00040015214,0.058077585,0.000504851,0.09158614,0.0005481054,0.84865683],"study_design_scores_gemma":[0.0016750536,0.00006418333,0.000023454739,0.000037653743,0.000011954834,0.000007226894,0.000031746822,0.9673776,0.00083492836,0.00035456524,0.029321387,0.00026024776],"about_ca_topic_score_codex":0.0000043447453,"about_ca_topic_score_gemma":0.0000075076555,"teacher_disagreement_score":0.9093,"about_ca_system_score_codex":0.000025049927,"about_ca_system_score_gemma":0.00008268425,"threshold_uncertainty_score":0.719068},"labels":[],"label_agreement":null},{"id":"W2127225591","doi":"10.1109/ccece.2004.1347737","title":"Effects of network topology and routing on traffic in packet-switching network model","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer network; Computer science; End-to-end delay; Processing delay; Network topology; Network packet; Source routing; Traffic generation model; Burst switching; Link state packet; Routing table; Routing protocol; Network simulation; Network traffic control; Circuit switching; Network delay; Packet switching; Distributed computing; Transmission delay","score_opus":0.006006430677820683,"score_gpt":0.20893475685311988,"score_spread":0.20292832617529918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127225591","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3774331,0.0003434539,0.62037796,0.000683477,0.00023799027,0.00018038305,4.9213888e-8,0.00010294811,0.00064066675],"genre_scores_gemma":[0.9794216,0.000036008463,0.019453602,0.00085192826,0.00017930313,0.000011439093,2.4716718e-7,0.0000078962,0.000037946964],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874645,0.00007995745,0.0002756922,0.00034541084,0.000110909656,0.00044154716],"domain_scores_gemma":[0.99920946,0.00039115336,0.00008589488,0.00021718323,0.00001938068,0.000076915065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037545725,0.00014960424,0.0002741255,0.00005056116,0.00008957381,0.000036069956,0.00028919976,0.00009388093,0.0000011929919],"category_scores_gemma":[0.000023744773,0.00013234127,0.000042558735,0.00031600503,0.00003341682,0.00013505836,0.00009249536,0.00020721798,0.0000033411661],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010956197,0.000025286705,0.00012688371,0.0000059980075,0.0000057498582,0.000008110715,0.00017671012,0.62689316,0.000009823208,0.2575545,0.000043975204,0.11513885],"study_design_scores_gemma":[0.0011880811,0.00013119569,0.0009084152,0.00012253477,0.0000060387492,0.0000059515905,0.0000089526275,0.9795281,0.000025635189,0.017920554,0.00001297071,0.00014157043],"about_ca_topic_score_codex":0.00001664204,"about_ca_topic_score_gemma":0.000116291034,"teacher_disagreement_score":0.60198855,"about_ca_system_score_codex":0.000030949544,"about_ca_system_score_gemma":0.000055336164,"threshold_uncertainty_score":0.5396721},"labels":[],"label_agreement":null},{"id":"W2127671149","doi":"10.1109/pccc.2003.1203718","title":"Active queue management and global fairness objectives","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Active queue management; Network topology; Computer science; Network congestion; Queue; Computer network; Fairness measure; Flow control (data); Network packet; Distributed computing; Throughput; Telecommunications","score_opus":0.0052763652724466,"score_gpt":0.2112775351055421,"score_spread":0.2060011698330955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127671149","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006105031,0.00015641536,0.8100031,0.00035229066,0.00019990664,0.00013163743,4.428707e-7,0.00014386442,0.18290731],"genre_scores_gemma":[0.9851665,0.000021664817,0.012834892,0.00033015796,0.000014282677,0.000015677364,1.3617503e-7,0.0000017605718,0.0016149682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937934,0.000050239432,0.00006769788,0.00025114982,0.00009997892,0.00015159925],"domain_scores_gemma":[0.999698,0.000025713593,0.000019492247,0.00017022091,0.000025949266,0.00006066202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000075578064,0.000078521305,0.0000748695,0.000017356466,0.00006872107,0.00007930663,0.00016760972,0.000023211962,0.000018674169],"category_scores_gemma":[0.0000046389164,0.000066160974,0.000019388188,0.00017784671,0.000027275793,0.00021050131,0.000056693818,0.000033969078,0.000022081238],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023771097,0.0000133420735,0.00020697575,0.000001410241,0.000015666486,0.0000053736344,0.000039054165,0.000042038726,3.5358852e-7,0.6665929,0.00023454308,0.332846],"study_design_scores_gemma":[0.009159626,0.00054695667,0.24647787,0.00010099342,0.000123178,0.00031055626,0.003843874,0.24462466,0.00083855004,0.33898136,0.15259863,0.002393728],"about_ca_topic_score_codex":0.000005702308,"about_ca_topic_score_gemma":0.000014511029,"teacher_disagreement_score":0.9790614,"about_ca_system_score_codex":0.000026712949,"about_ca_system_score_gemma":0.000016229666,"threshold_uncertainty_score":0.2697966},"labels":[],"label_agreement":null},{"id":"W2127936354","doi":"10.1109/icc.2006.254710","title":"IP Traffic Matrix Estimation Methods: Comparisons and Improvements","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Maximization; Entropy (arrow of time); Entropy maximization; Mathematical optimization; Internet traffic; Linear programming; Data mining; The Internet; Point (geometry); Matrix (chemical analysis); Traffic generation model; Traffic engineering; Principle of maximum entropy; Algorithm; Artificial intelligence; Mathematics; Real-time computing; Computer network","score_opus":0.06709238678803496,"score_gpt":0.37955372958572425,"score_spread":0.3124613427976893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127936354","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044282707,0.0002670364,0.95581853,0.01527404,0.0006212336,0.00031177758,0.000029759343,0.00030592544,0.022943418],"genre_scores_gemma":[0.79147804,0.00011666002,0.20683564,0.00027904828,0.00006432584,0.000093440154,0.000058312573,0.000008705643,0.0010657989],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852777,0.00021522859,0.00041888136,0.00034074255,0.00028850455,0.00020890501],"domain_scores_gemma":[0.99805033,0.00032915972,0.0002119677,0.0010573928,0.00027560952,0.00007554115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037276512,0.00018248468,0.00017978813,0.00018106485,0.0002990885,0.00037671003,0.0018708487,0.00007523293,0.000044678367],"category_scores_gemma":[0.000030132787,0.00018665809,0.00005975029,0.00020726163,0.0001379043,0.00041011896,0.00021366702,0.00026505603,0.00009393639],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008277261,0.00020470987,0.00006789756,0.000002358273,0.00003112809,7.395144e-7,0.00005636398,0.0059119766,0.00032259387,0.683676,0.0043460764,0.30537188],"study_design_scores_gemma":[0.0006087261,0.00004501459,0.0009440289,0.000032893375,0.000012989692,0.000007650277,0.000029403418,0.9798089,0.00009135421,0.007190453,0.011038468,0.00019010264],"about_ca_topic_score_codex":0.0000986485,"about_ca_topic_score_gemma":0.00013706597,"teacher_disagreement_score":0.9738969,"about_ca_system_score_codex":0.00007207189,"about_ca_system_score_gemma":0.00008847767,"threshold_uncertainty_score":0.76116955},"labels":[],"label_agreement":null},{"id":"W2128312395","doi":"10.1109/icct.2000.890861","title":"A novel cost model for active networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Reservation; Bandwidth (computing); Computer network; Node (physics); Active networking; Distributed computing; Routing (electronic design automation); Engineering","score_opus":0.03913338872290147,"score_gpt":0.23243907269877567,"score_spread":0.1933056839758742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128312395","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000039150596,0.000061487386,0.99127173,0.0017634787,0.000189939,0.0003095588,0.0000020548919,0.00020788786,0.0061547],"genre_scores_gemma":[0.89997977,0.000013515717,0.09068394,0.0021354363,0.00015015296,0.00014071865,8.558651e-7,0.000007119492,0.0068884958],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931026,0.000006400946,0.00010582547,0.00024200464,0.0000873177,0.00024822273],"domain_scores_gemma":[0.9994702,0.00011344626,0.0000339377,0.00024251861,0.000059172893,0.000080745805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000065807384,0.00008805208,0.00009821877,0.000024009616,0.00009392506,0.0000724554,0.0003812474,0.00004998324,0.000031432344],"category_scores_gemma":[0.000008921931,0.000076206205,0.00006096861,0.00012351185,0.000016254371,0.00023348644,0.000046679546,0.00006898188,0.000024477762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004538603,0.000041736697,0.0000013023907,5.355876e-7,0.000008971258,2.661774e-7,0.00007325194,0.24404638,0.000007712295,0.11505042,0.010870208,0.6298947],"study_design_scores_gemma":[0.0006420728,0.00002263082,0.000010811531,0.0000028210306,0.0000041802496,0.000003413247,0.0000037961076,0.9950201,0.000006202624,0.00041469623,0.0037624666,0.00010683567],"about_ca_topic_score_codex":0.000001564628,"about_ca_topic_score_gemma":0.0000106669395,"teacher_disagreement_score":0.9005878,"about_ca_system_score_codex":0.000018659874,"about_ca_system_score_gemma":0.000009763993,"threshold_uncertainty_score":0.31075987},"labels":[],"label_agreement":null},{"id":"W2128448269","doi":"10.1109/infcom.1996.493351","title":"Robust non-probabilistic bounds for delay and throughput in credit-based flow control","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Probabilistic logic; Computer science; Throughput; Flow control (data); Flow (mathematics); Computer network; Artificial intelligence; Mathematics; Telecommunications","score_opus":0.022681112104409186,"score_gpt":0.20943377256469206,"score_spread":0.18675266046028288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128448269","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028263985,0.00027306058,0.9910178,0.0034223471,0.00036630308,0.000507493,0.0000046606224,0.00013809072,0.0014438502],"genre_scores_gemma":[0.9395405,0.0000071762424,0.05795711,0.0017288253,0.00015730924,0.000146562,0.0000017215904,0.000009277526,0.00045151231],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876857,0.000040722745,0.00025473174,0.00043039393,0.00014911273,0.00035644422],"domain_scores_gemma":[0.9989517,0.00048273325,0.000048343656,0.00033098648,0.000080943006,0.00010531985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002783235,0.00015877472,0.00023387553,0.00006957889,0.00011015016,0.00017700718,0.00034774072,0.000081675826,0.000061758095],"category_scores_gemma":[0.00006123889,0.00013746966,0.00005914974,0.0002086789,0.00006614153,0.00024115437,0.000029734454,0.00010124379,0.000018493181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008515496,0.00035158716,0.0010654245,0.00005622009,0.000044100074,0.000039561033,0.00029958226,0.3542394,0.00002750641,0.060524944,0.027755829,0.5555107],"study_design_scores_gemma":[0.0034403724,0.00015232619,0.00041347704,0.000016055941,0.000010572082,0.0000057901166,0.000005028497,0.9919967,0.000003298468,0.0008558722,0.00292361,0.00017689797],"about_ca_topic_score_codex":0.000017968532,"about_ca_topic_score_gemma":0.00014796923,"teacher_disagreement_score":0.9367141,"about_ca_system_score_codex":0.000036384434,"about_ca_system_score_gemma":0.00004101854,"threshold_uncertainty_score":0.560585},"labels":[],"label_agreement":null},{"id":"W2128618825","doi":"10.1109/nca.2008.48","title":"Learning Minimum Delay Paths in Service Overlay Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Scalability; Overlay; Overlay network; Learning automata; Routing (electronic design automation); Distributed computing; Service (business); Automaton; Computer network; Theoretical computer science","score_opus":0.010229899199867169,"score_gpt":0.1998989355738447,"score_spread":0.18966903637397753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128618825","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13688542,0.00035865544,0.8451852,0.0020632446,0.00049408415,0.00015277318,1.0178164e-7,0.0004755002,0.014385024],"genre_scores_gemma":[0.99179524,0.00006681724,0.003457953,0.0023294566,0.0001289052,0.000013527546,0.0000012151022,0.000007541223,0.0021993269],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885845,0.0000922956,0.00021361356,0.0003181296,0.00017321794,0.00034426735],"domain_scores_gemma":[0.9993776,0.00015734357,0.00005002354,0.00026814258,0.00005357218,0.00009329548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002006486,0.00012366443,0.00015234569,0.00006217491,0.00012664139,0.00004619457,0.00048409737,0.00008103749,0.000051511757],"category_scores_gemma":[0.000013258477,0.00011314891,0.00004149994,0.0005828522,0.000017563485,0.00028791252,0.00011465052,0.00027033352,0.00011286911],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002353164,0.00011366157,0.019050227,0.0000050335284,0.00001970358,0.00038115212,0.0015082494,0.54713374,0.000026533568,0.020251647,0.006255594,0.40523094],"study_design_scores_gemma":[0.0004902609,0.000044775225,0.0048739654,0.000010701127,0.0000014401893,0.000054260443,0.000025482748,0.9855747,0.0000031920863,0.000054744698,0.008711606,0.00015482536],"about_ca_topic_score_codex":0.00005240742,"about_ca_topic_score_gemma":0.00012716097,"teacher_disagreement_score":0.85490984,"about_ca_system_score_codex":0.000024369174,"about_ca_system_score_gemma":0.00004927426,"threshold_uncertainty_score":0.46140787},"labels":[],"label_agreement":null},{"id":"W2128631468","doi":"10.1109/ccece.2003.1226014","title":"Aggregation of long-range dependent traffic streams using multifractal wavelet models","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Traffic generation model; Computer science; Quality of service; Aggregate (composite); Multifractal system; Traffic classification; Queue; Provisioning; Computer network; Range (aeronautics); Wavelet; Internet traffic; Real-time computing; Fractal; Engineering; Mathematics; The Internet; Artificial intelligence","score_opus":0.02169783466041103,"score_gpt":0.23378459219861367,"score_spread":0.21208675753820264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128631468","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4429042,0.00008527756,0.5563329,0.00014203142,0.000118156546,0.000110671055,0.0000010408371,0.00009263561,0.0002130667],"genre_scores_gemma":[0.96490544,0.00001482512,0.03485726,0.00007918626,0.000061142404,0.0000050737876,0.0000022946313,0.000007742809,0.00006700749],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988675,0.000031329724,0.00027125847,0.00028904932,0.0003144268,0.00022642266],"domain_scores_gemma":[0.999338,0.000042110838,0.00011698208,0.00031452626,0.00010399013,0.00008442628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014442136,0.00013156177,0.00016750523,0.0000777785,0.000067932095,0.00005759976,0.0003709725,0.000071629926,0.000014945783],"category_scores_gemma":[0.0000070121782,0.00011806329,0.0000781923,0.00020895978,0.000033271263,0.00061387895,0.00005527625,0.00009183745,0.0000123344425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054417974,0.00007079192,0.00002453232,0.000003604546,0.000010655477,0.000010446454,0.00016830146,0.46139976,0.00005351702,0.0078100027,0.0000035687963,0.5304394],"study_design_scores_gemma":[0.0010629619,0.000048882248,0.00006655142,0.0000333855,0.000011206069,0.000027180091,0.000025601736,0.9968255,0.0008323273,0.00092509063,0.0000040144064,0.00013728662],"about_ca_topic_score_codex":0.00008441589,"about_ca_topic_score_gemma":0.00014444659,"teacher_disagreement_score":0.5354258,"about_ca_system_score_codex":0.0000668195,"about_ca_system_score_gemma":0.000102902566,"threshold_uncertainty_score":0.4814481},"labels":[],"label_agreement":null},{"id":"W2129112203","doi":"10.1109/ccece.2004.1345298","title":"Implementing an IPv6 QoS management scheme using flow label & class of service fields","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University; Dalhousie University","funders":"","keywords":"Quality of service; Computer network; Computer science; Integrated services; Traffic classification; Mobile QoS; Scheduling (production processes); Resource Reservation Protocol; Router; Distributed computing; The Internet; Service provider; Service (business); Internet Protocol; Engineering","score_opus":0.034724174941348246,"score_gpt":0.28067789944748,"score_spread":0.24595372450613176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129112203","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.101448886,0.000037575566,0.89276075,0.0016079053,0.00024518848,0.00016342755,8.8591867e-7,0.00015100349,0.0035843868],"genre_scores_gemma":[0.45613942,0.0000054844827,0.54187363,0.0015973491,0.000109662375,0.00000706355,0.0000032578703,0.000006965088,0.00025715443],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879456,0.000028384371,0.0002734703,0.0003014969,0.00023754002,0.0003645463],"domain_scores_gemma":[0.99920976,0.000020240912,0.000087167035,0.00049370585,0.00010785167,0.00008126403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030047543,0.0001200852,0.00014002222,0.00006504061,0.00013037627,0.000083642386,0.0005812933,0.00004980691,0.00006568744],"category_scores_gemma":[0.0000025959816,0.00011460176,0.000037727044,0.00036989572,0.000012168846,0.00036035295,0.0002857056,0.00008639663,0.000024780968],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015424366,0.00029687086,0.0004048253,0.00009502996,0.00013789376,0.000016888014,0.0008367826,0.049698435,0.0016240593,0.39455265,0.00041949315,0.55190164],"study_design_scores_gemma":[0.0014753034,0.000042973483,0.00014743794,0.00004548045,0.000020194702,0.0000068458335,0.00010930865,0.98851585,0.00026586023,0.0013710127,0.007783719,0.00021598801],"about_ca_topic_score_codex":0.00013718,"about_ca_topic_score_gemma":0.00059432915,"teacher_disagreement_score":0.93881744,"about_ca_system_score_codex":0.000032079857,"about_ca_system_score_gemma":0.00004300862,"threshold_uncertainty_score":0.46733242},"labels":[],"label_agreement":null},{"id":"W2129114148","doi":"10.1109/wescan.1997.627103","title":"Neural network-based ATM QoS estimation","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Research Manitoba","funders":"","keywords":"Asynchronous Transfer Mode; Quality of service; Computer science; Computer network; Mobile QoS; Learning vector quantization; Integrated Services Digital Network; Artificial neural network; Traffic classification; ATM adaptation layer; Network congestion; Quantization (signal processing); Key (lock); Service provider; Service (business); Artificial intelligence; Algorithm","score_opus":0.015402432782594379,"score_gpt":0.2035221256573325,"score_spread":0.18811969287473812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129114148","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015101983,0.00016763603,0.9840419,0.0052123936,0.00068717217,0.000112406815,1.4918662e-7,0.00053111045,0.0077370023],"genre_scores_gemma":[0.9440949,0.0000025038046,0.051325303,0.0027417338,0.00029054895,0.000015375823,0.0000011607931,0.0000049201235,0.0015235493],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991688,0.00004470665,0.00014511954,0.000222471,0.00016696363,0.0002519438],"domain_scores_gemma":[0.9994216,0.000098452096,0.000042071435,0.00031803787,0.00003822857,0.000081608814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010201675,0.00009528977,0.00009223292,0.00002605014,0.00010943305,0.00012398892,0.0003644824,0.00003922562,0.00032130806],"category_scores_gemma":[0.000010358282,0.00008234942,0.000049873324,0.00026182702,0.000019236146,0.00026143793,0.000032125034,0.00007828255,0.0003729751],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012217097,0.00001898274,0.00012730062,9.755178e-7,0.0000029583573,0.0000044545513,0.000012970238,0.349397,0.0000014495611,0.024604011,0.030180862,0.5956478],"study_design_scores_gemma":[0.0003370786,0.000038268357,0.00028795208,0.0000043410973,0.0000033352428,0.0000040663444,5.472687e-7,0.99341226,0.0000074876834,0.00028711394,0.0055126515,0.00010489201],"about_ca_topic_score_codex":0.0000031988761,"about_ca_topic_score_gemma":0.000005029577,"teacher_disagreement_score":0.9425847,"about_ca_system_score_codex":0.000014122193,"about_ca_system_score_gemma":0.000010067584,"threshold_uncertainty_score":0.4793965},"labels":[],"label_agreement":null},{"id":"W2129169961","doi":"10.1109/icc.2011.5963260","title":"Stability Analysis and Evaluation of the IntelRate Controller for High-Speed Heterogeneous Networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bottleneck; Bandwidth (computing); Computer science; Control theory (sociology); Controller (irrigation); Control (management); Computer network; Embedded system","score_opus":0.04350924502228733,"score_gpt":0.2437369887495582,"score_spread":0.20022774372727087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129169961","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19846682,0.00012878205,0.8004188,0.00013766097,0.00014480024,0.00046335606,0.0000014339712,0.000029736617,0.00020860405],"genre_scores_gemma":[0.9974111,0.000004194863,0.0023504568,0.00013990873,0.00002427962,0.00003263237,7.6780543e-7,0.0000027347826,0.000033980235],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896175,0.00021091147,0.0002388832,0.00024472098,0.00020777402,0.00013593433],"domain_scores_gemma":[0.99895006,0.00016932953,0.00012276824,0.00036615707,0.0003513464,0.000040318704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012090827,0.00008400761,0.00020359845,0.000037092123,0.00007156458,0.000028981265,0.00031642686,0.0000445261,0.000060630966],"category_scores_gemma":[0.000046302757,0.000052096202,0.000120058954,0.00034970962,0.00006153072,0.000090472946,0.00007218167,0.00004336735,5.3976703e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018069982,0.00014658198,0.010471963,0.000006848692,0.0011488247,2.0293722e-7,0.0006990422,0.060795456,0.00012343348,0.057357594,0.00010785074,0.8689615],"study_design_scores_gemma":[0.0008139706,0.000047372832,0.014211448,0.0000017732476,0.00039321173,4.852659e-7,0.00000995384,0.9810489,0.0006045799,0.0027990907,0.000007945736,0.000061256615],"about_ca_topic_score_codex":0.00005208922,"about_ca_topic_score_gemma":0.00020623251,"teacher_disagreement_score":0.92025346,"about_ca_system_score_codex":0.000016753236,"about_ca_system_score_gemma":0.000028449811,"threshold_uncertainty_score":0.21244214},"labels":[],"label_agreement":null},{"id":"W2129614542","doi":"10.1109/qshine.2005.25","title":"Finite Buffer Queue Analysis and Scheduling for Heavy-Tailed Traffic in Packet-SwitchingWireless Networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Traffic generation model; Computer science; Computer network; Queueing theory; Wireless network; Network traffic control; Buffer overflow; Queue; Telecommunications link; Internet traffic; Internet traffic engineering; Network packet; Wireless; Real-time computing; The Internet; Telecommunications","score_opus":0.008661381730409305,"score_gpt":0.22973617954495948,"score_spread":0.22107479781455017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129614542","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18965212,0.0004798702,0.80732685,0.0019533418,0.00009519398,0.0002319635,7.4547927e-7,0.00016833497,0.000091571],"genre_scores_gemma":[0.9603565,0.00006593082,0.038144086,0.000911927,0.00022133863,0.00006233271,0.0000049926907,0.000010789196,0.00022212323],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984526,0.00007696083,0.0003708993,0.00053049455,0.00012591286,0.00044313344],"domain_scores_gemma":[0.99881846,0.00055809325,0.00008099072,0.000342477,0.000058786427,0.00014120896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054093037,0.00019654124,0.00037743803,0.00027071402,0.00013273318,0.00022762445,0.00037723454,0.000119796416,0.000018560562],"category_scores_gemma":[0.00003180679,0.00017413328,0.00014116215,0.000976658,0.00002928792,0.0003546789,0.000066729124,0.00019604727,0.0000060251027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022908585,0.000036157755,0.0016404694,0.0000029252158,0.00006766139,0.0000016624539,0.00012679277,0.5878554,0.000001944801,0.0068626073,0.00004042936,0.40334105],"study_design_scores_gemma":[0.0009862465,0.000037747497,0.0016226881,0.000015312584,0.00006362462,0.0000017020532,0.000027546757,0.9964206,0.000008427991,0.00011639872,0.0004722971,0.00022739345],"about_ca_topic_score_codex":0.000018087127,"about_ca_topic_score_gemma":0.0017762679,"teacher_disagreement_score":0.7707044,"about_ca_system_score_codex":0.00003753886,"about_ca_system_score_gemma":0.000037454025,"threshold_uncertainty_score":0.7100949},"labels":[],"label_agreement":null},{"id":"W2129913025","doi":"10.1109/icc.2008.1086","title":"Can We Multiplex IPTV and TCP?","year":2008,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"IPTV; Computer network; Computer science; Quality of service; Multiplexing; TCP global synchronization; Transmission Control Protocol; Telecommunications","score_opus":0.016327281635977058,"score_gpt":0.19740299115133247,"score_spread":0.18107570951535543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129913025","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.124703534,0.0013158513,0.8123758,0.03761848,0.0006366851,0.0002758914,0.000001279236,0.0009264088,0.022146089],"genre_scores_gemma":[0.9847797,0.00013228336,0.00975264,0.0009128542,0.00006630961,0.0000054336274,2.428306e-7,0.0000026479047,0.0043478543],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994874,0.000017282175,0.000077842116,0.00018329379,0.00009164556,0.00014253725],"domain_scores_gemma":[0.99963766,0.000050683106,0.000016323003,0.00018590034,0.000023003471,0.00008642408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000042128184,0.0000632963,0.00007324605,0.000024671843,0.00010763905,0.000030126977,0.00019984094,0.00002539673,0.00002684818],"category_scores_gemma":[0.000006024028,0.00005144896,0.000018460456,0.00009504905,0.00003993299,0.000104519735,0.000059273298,0.000050244085,0.00003213568],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030379458,0.000024528259,0.0024695918,0.0000019696442,0.0000102694075,0.00003994157,0.0005555791,0.00011822963,0.00006110961,0.07780026,0.010843249,0.90807223],"study_design_scores_gemma":[0.0013112206,0.00008428356,0.013945124,0.000010494057,0.00000453407,0.00021016278,0.00003624031,0.9053868,0.00014054564,0.0020296527,0.076511875,0.00032907218],"about_ca_topic_score_codex":0.00003380322,"about_ca_topic_score_gemma":0.00005980184,"teacher_disagreement_score":0.90774316,"about_ca_system_score_codex":0.0000058597248,"about_ca_system_score_gemma":0.000029468303,"threshold_uncertainty_score":0.20980276},"labels":[],"label_agreement":null},{"id":"W2130038746","doi":"10.1109/infcomw.2009.5072124","title":"Denial of Service Attacks in Networks with Tiny Buffers","year":2009,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Denial-of-service attack; Computer science; Bottleneck; Computer network; Network packet; Throughput; Synchronizing; Computer security; Context (archaeology); The Internet; Transmission (telecommunications); Telecommunications; Wireless; Operating system; Embedded system","score_opus":0.004672344225219753,"score_gpt":0.19633911682659758,"score_spread":0.19166677260137782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130038746","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07829816,0.00009454611,0.9071801,0.0057364497,0.00011658022,0.00014845828,1.3398228e-7,0.00012997394,0.008295631],"genre_scores_gemma":[0.98843193,0.0000044847798,0.008655363,0.0026813033,0.00005968756,0.0000027893245,4.8896084e-7,0.000002587612,0.0001613463],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928236,0.000030340252,0.0001580407,0.00019194886,0.00013903576,0.00019828923],"domain_scores_gemma":[0.9995359,0.00005145215,0.000047663583,0.000247738,0.00006332162,0.00005387661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011748106,0.00008560914,0.00013842435,0.000044811964,0.000020774276,0.000028520684,0.0004036323,0.000046403795,0.000016980239],"category_scores_gemma":[0.0000023849072,0.00006560582,0.000020314956,0.00048260234,0.00001296872,0.0001566003,0.000025916754,0.00009789434,0.000008089663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010994249,0.00013606063,0.0039467732,0.0000048388583,0.000015855363,0.000031864296,0.00034165743,0.19183455,0.000038457743,0.06504602,0.0015856802,0.7369083],"study_design_scores_gemma":[0.0009442194,0.00018340143,0.015150954,0.00002833484,0.000004050006,0.000009287101,0.000016890568,0.9828851,0.000029950766,0.00022258506,0.00039443327,0.00013075754],"about_ca_topic_score_codex":0.000034580098,"about_ca_topic_score_gemma":0.0003280493,"teacher_disagreement_score":0.9101338,"about_ca_system_score_codex":0.000011427515,"about_ca_system_score_gemma":0.00004039306,"threshold_uncertainty_score":0.26753277},"labels":[],"label_agreement":null},{"id":"W2130189124","doi":"10.1109/ccece.2009.5090139","title":"QoS evaluation of a voice over IP network with video: A case study","year":2009,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Voice over IP; Computer science; Jitter; Computer network; Codec; Quality of service; FIFO (computing and electronics); Bandwidth (computing); Queueing theory; Latency (audio); Telecommunications; The Internet; Computer hardware","score_opus":0.021718745072944964,"score_gpt":0.27967029264070886,"score_spread":0.2579515475677639,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130189124","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66566664,0.00015736742,0.32982773,0.00043006425,0.00018537686,0.0007885716,1.8114517e-7,0.0001413817,0.0028026819],"genre_scores_gemma":[0.9952411,8.212757e-7,0.0039365264,0.0004661312,0.0001796483,0.000025455902,2.451163e-7,0.0000032955581,0.0001467627],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858606,0.00019009617,0.00020373921,0.00027868513,0.00055173115,0.00018968107],"domain_scores_gemma":[0.99903584,0.00009294229,0.000094942305,0.00043974226,0.00027223764,0.00006427754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009908149,0.00010649767,0.00015247097,0.000038187412,0.00007721573,0.000057591442,0.00024702988,0.000028223916,0.00003747132],"category_scores_gemma":[0.000014756289,0.00007799034,0.000030733678,0.00045110937,0.000014413549,0.00025427341,0.000028388657,0.00007266427,0.0000098974815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046354577,0.00044832178,0.0023310632,0.000001598909,0.000060299197,0.00029305363,0.0009582244,0.07035781,0.000004945689,0.0072766356,0.0032834911,0.9149382],"study_design_scores_gemma":[0.0025116166,0.0009959168,0.011700614,0.00001695175,0.0000997458,0.00027747828,0.0002319364,0.9832697,0.0000045204083,0.00048274032,0.0002528924,0.00015591376],"about_ca_topic_score_codex":0.00007582178,"about_ca_topic_score_gemma":0.0004135985,"teacher_disagreement_score":0.9147823,"about_ca_system_score_codex":0.00002397351,"about_ca_system_score_gemma":0.00011485754,"threshold_uncertainty_score":0.31803536},"labels":[],"label_agreement":null},{"id":"W2130320317","doi":"10.1109/glocom.1997.644370","title":"Model of a queue with almost self-similar or fractal-like traffic","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Queue; Traffic equations; Computer science; Fractal; Variable bitrate; Traffic generation model; Queueing theory; Network packet; Poisson distribution; Real-time computing; Computer network; Mathematics; Layered queueing network; Statistics; Bit rate; Mathematical analysis","score_opus":0.02241160155935184,"score_gpt":0.20210435783091318,"score_spread":0.17969275627156134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130320317","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046189327,0.00020891055,0.9380857,0.003136608,0.00014167826,0.00032255496,0.0000027386122,0.00078752806,0.011124962],"genre_scores_gemma":[0.9305961,0.000041651598,0.06406018,0.001226185,0.000035201665,0.000016899457,4.6306891e-7,0.000010642547,0.0040126415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886394,0.000031934713,0.0002210781,0.00032966008,0.00028714963,0.0002662507],"domain_scores_gemma":[0.9991386,0.00008581641,0.0000828378,0.00047933127,0.00009747309,0.00011593649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010249211,0.00015811615,0.00021548204,0.00005982786,0.00006849063,0.000051325984,0.00055703,0.00006564272,0.00019445433],"category_scores_gemma":[0.000005099277,0.000104175735,0.00005338959,0.00034880108,0.000038610768,0.000430313,0.000049362647,0.00011533057,0.00005160615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000098698634,0.0008800477,0.000079776895,0.000034602315,0.0001676826,0.000072507326,0.0021153386,0.46436527,0.00008204179,0.04355201,0.028993247,0.45955878],"study_design_scores_gemma":[0.000699311,0.00019110627,0.000012252533,0.00001436313,0.000014931719,0.000024159359,0.000023474518,0.9959129,0.000027156982,0.000034679724,0.0028787327,0.00016691395],"about_ca_topic_score_codex":0.0000034544014,"about_ca_topic_score_gemma":0.000039890358,"teacher_disagreement_score":0.8844068,"about_ca_system_score_codex":0.000016962134,"about_ca_system_score_gemma":0.000069985734,"threshold_uncertainty_score":0.4248163},"labels":[],"label_agreement":null},{"id":"W2130375202","doi":"10.1109/icsmc.2002.1176009","title":"A novel computational intelligence approach for multiple-point routing in communication networks","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Multicast; Computer science; Routing (electronic design automation); Tree (set theory); Steiner tree problem; Feature (linguistics); Genetic algorithm; Theoretical computer science; Artificial intelligence; Mathematical optimization; Distributed computing; Machine learning; Computer network; Mathematics","score_opus":0.028306193925555882,"score_gpt":0.2470683666746808,"score_spread":0.2187621727491249,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130375202","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000121504025,0.00010322103,0.9963212,0.00039824558,0.00007854341,0.00040648156,4.989084e-7,0.0001097195,0.0024605773],"genre_scores_gemma":[0.56366014,0.0000034820202,0.4358887,0.0003212164,0.000012251006,0.00006334714,0.0000069025405,0.0000037697523,0.000040183062],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989594,0.00008253824,0.00031161294,0.0002869714,0.00011487556,0.00024460445],"domain_scores_gemma":[0.998712,0.0007401653,0.000083688334,0.0003214648,0.00009050216,0.000052152813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074834924,0.000107748594,0.0001333845,0.00005946373,0.00012384269,0.000100567064,0.000512756,0.000058324396,0.0000042459264],"category_scores_gemma":[0.00011399095,0.00010404061,0.000050645653,0.0003218197,0.000032932647,0.00023751298,0.00006305349,0.00014113348,0.0000026973053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032684197,0.00006416773,0.00025602596,0.0000014466042,0.0000034926124,8.050221e-8,0.0000998922,0.5392926,0.0000014586465,0.41191623,0.00004528854,0.048316054],"study_design_scores_gemma":[0.000513715,0.000017938897,0.00029144873,0.000011267579,0.000001846697,0.000007826748,0.00010519622,0.9953405,0.000008588062,0.0034424323,0.00013200854,0.00012718329],"about_ca_topic_score_codex":0.000015785083,"about_ca_topic_score_gemma":0.000028629842,"teacher_disagreement_score":0.5635386,"about_ca_system_score_codex":0.000042500153,"about_ca_system_score_gemma":0.0000439081,"threshold_uncertainty_score":0.42426533},"labels":[],"label_agreement":null},{"id":"W2130542684","doi":"10.1109/infcom.1995.515858","title":"Design and analysis of a credit-based controller for congestion control in B-ISDN/ATM networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Queueing theory; Controller (irrigation); Computer network; Weighting; Network congestion; Integrated Services Digital Network; Network packet","score_opus":0.018331526386608808,"score_gpt":0.21689402585247333,"score_spread":0.19856249946586452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130542684","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010451841,0.0007395903,0.9958447,0.0013403551,0.00010845311,0.00072241,0.0000033127365,0.000085196516,0.00011075396],"genre_scores_gemma":[0.97648543,0.000024676203,0.022166142,0.0009858613,0.000043764296,0.00015897522,0.0000028567138,0.0000067725373,0.0001255293],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856585,0.00018206413,0.00041408697,0.00037734094,0.0001635756,0.00029707342],"domain_scores_gemma":[0.9977546,0.0016007471,0.00015307442,0.00025701325,0.00013903558,0.000095560485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066996954,0.0001602807,0.00053746364,0.00033181615,0.000056120152,0.000067385576,0.0002712875,0.00011281952,0.000042941774],"category_scores_gemma":[0.000060781702,0.00013950908,0.00013731305,0.00084357645,0.00006399932,0.00016652166,0.000016182918,0.00008812515,0.0000015443942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017165656,0.00011681377,0.0017331957,0.0000046770397,0.00033811905,0.000002865448,0.000056256416,0.77955526,0.000043007934,0.011469352,0.0010284646,0.20548034],"study_design_scores_gemma":[0.0056891125,0.00018796122,0.0025125102,0.0000109233415,0.000285186,6.7613007e-7,0.0000045036527,0.9907801,0.0000077071245,0.00012529295,0.00024893184,0.00014706484],"about_ca_topic_score_codex":0.000013748829,"about_ca_topic_score_gemma":0.000028388306,"teacher_disagreement_score":0.97544026,"about_ca_system_score_codex":0.000022809696,"about_ca_system_score_gemma":0.000018176514,"threshold_uncertainty_score":0.5689015},"labels":[],"label_agreement":null},{"id":"W2130633424","doi":"10.1109/dnsr.2004.1344715","title":"Similarities between voice and high speed Internet traffic provisioning","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Moncton; Nortel (Canada)","funders":"","keywords":"Provisioning; Computer science; Internet traffic; The Internet; Similarity (geometry); Traffic generation model; Self-similarity; Computer network; Internet traffic engineering; Voice over IP; Real-time computing; World Wide Web; Artificial intelligence","score_opus":0.01195251088100964,"score_gpt":0.21518968353935577,"score_spread":0.20323717265834612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130633424","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4268953,0.00017951091,0.5663553,0.004440557,0.00020904069,0.0001541135,9.556712e-7,0.0004498994,0.0013153363],"genre_scores_gemma":[0.98196,0.000008225971,0.016544841,0.00051581935,0.00015487129,0.0000029914252,0.0000018604361,0.000006316817,0.0008050919],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991087,0.000026049578,0.00017455594,0.00030712297,0.00016090527,0.00022267837],"domain_scores_gemma":[0.9995105,0.00010750627,0.000039601477,0.00020061636,0.000039579583,0.00010214972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015019756,0.00012117455,0.00015518736,0.000056735495,0.0000796965,0.00024200318,0.0003615935,0.000055299213,0.000014085064],"category_scores_gemma":[0.000014806752,0.00010243697,0.00003002235,0.00013716081,0.00005246339,0.00035462534,0.00012551482,0.00012582427,0.000042866734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006629592,0.00003338702,0.00057859096,0.000010971815,0.000034435765,0.00001834763,0.00079545076,0.007202033,0.000015519972,0.19605574,0.00078147015,0.79446745],"study_design_scores_gemma":[0.011538572,0.0015365887,0.043122746,0.00047628084,0.00013064832,0.00014235332,0.0006061988,0.8750912,0.0017489574,0.036068987,0.027168745,0.0023687116],"about_ca_topic_score_codex":0.000047870555,"about_ca_topic_score_gemma":0.000027803371,"teacher_disagreement_score":0.86788917,"about_ca_system_score_codex":0.000022373692,"about_ca_system_score_gemma":0.000046302233,"threshold_uncertainty_score":0.41772583},"labels":[],"label_agreement":null},{"id":"W2130719206","doi":"10.1109/pacrim.2005.1517249","title":"Admission control of multimedia sessions to a set of multimedia servers connected by an enterprise network","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Reservation; Computer science; Quality of service; Server; Selection (genetic algorithm); Computer network; Admission control; Revenue; Set (abstract data type); Service (business); Control (management); Multimedia; IP Multimedia Subsystem; Quality (philosophy)","score_opus":0.008750235858298311,"score_gpt":0.2462231812859295,"score_spread":0.23747294542763117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130719206","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09157276,0.00025244517,0.9030305,0.0033075942,0.00044792026,0.000706289,0.000063150546,0.00030058256,0.00031877466],"genre_scores_gemma":[0.928173,0.000012772821,0.07011148,0.0010834376,0.00020478124,0.0000286662,0.00002378703,0.000013181369,0.0003488915],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797755,0.00021132923,0.00056961837,0.00044493194,0.0003719634,0.00042461432],"domain_scores_gemma":[0.99785644,0.0004714791,0.00022400521,0.0006254598,0.00024570693,0.0005769293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035793174,0.00022217458,0.00043276377,0.00009329452,0.000079423684,0.000030833664,0.00082770654,0.00012651844,0.00030246642],"category_scores_gemma":[0.000116413335,0.00018530754,0.000111747875,0.000475381,0.000054463784,0.0003810444,0.00012315782,0.00014539875,0.00004580189],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036359866,0.00054026546,0.0033145577,0.000017909886,0.0001220997,0.000005230133,0.0019756106,0.054728366,0.015108356,0.0010962146,0.07174531,0.8509825],"study_design_scores_gemma":[0.002778272,0.000276307,0.0007431046,0.00008438208,0.000022756245,0.0000020703567,0.0000675033,0.98368263,0.0017897164,0.000018031227,0.010313105,0.00022212302],"about_ca_topic_score_codex":0.000054083448,"about_ca_topic_score_gemma":0.00007036092,"teacher_disagreement_score":0.92895424,"about_ca_system_score_codex":0.000029527417,"about_ca_system_score_gemma":0.00012600566,"threshold_uncertainty_score":0.7556622},"labels":[],"label_agreement":null},{"id":"W2130835518","doi":"10.1109/icccn.2003.1284208","title":"An efficient scheme for QoS information update among edge routers using multicast","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Multicast; Computer network; Computer science; Quality of service; Flooding (psychology); Dissemination; Enhanced Data Rates for GSM Evolution; The Internet; Scheme (mathematics); Distributed computing; World Wide Web; Telecommunications","score_opus":0.011064683317159886,"score_gpt":0.24205698677410517,"score_spread":0.2309923034569453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130835518","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23301342,0.0000053990852,0.7656808,0.00031148063,0.0003961835,0.0002760764,0.0000015422778,0.00019060799,0.00012451663],"genre_scores_gemma":[0.7894894,4.940295e-7,0.2098187,0.00056408497,0.00009182458,0.000017966155,0.0000062964295,0.0000038470253,0.000007377707],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916404,0.000014196825,0.00022414408,0.00018304604,0.00015315613,0.00026140193],"domain_scores_gemma":[0.99935764,0.000022926115,0.000075322605,0.00030812537,0.00011578545,0.0001201845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001820945,0.000109278866,0.00010059534,0.00007738303,0.00015733088,0.00026728783,0.0003769807,0.000048897033,0.0000052227606],"category_scores_gemma":[0.000012051412,0.000097018834,0.00005214966,0.00017231585,0.00003306414,0.0012237142,0.000045659646,0.000058557245,0.00004322267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001660288,0.0000874677,0.00014448937,0.000009034382,0.000015443065,0.0000013533522,0.00063431123,0.6741555,0.00014888597,0.1919292,0.00012131532,0.1327364],"study_design_scores_gemma":[0.0011094043,0.00004500709,0.00038914176,0.0000123030095,0.0000053572458,0.000003194634,0.000048435526,0.9973086,0.00022582388,0.00009788654,0.00061385334,0.00014098424],"about_ca_topic_score_codex":0.000018730938,"about_ca_topic_score_gemma":0.000009079375,"teacher_disagreement_score":0.556476,"about_ca_system_score_codex":0.00006494792,"about_ca_system_score_gemma":0.00006666222,"threshold_uncertainty_score":0.39563134},"labels":[],"label_agreement":null},{"id":"W2130871161","doi":"10.1002/nem.452","title":"Interworking of switched ethernet and ATM flow control mechanisms","year":2002,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Computer science; Computer network; Flow control (data); Ethernet; Ethernet flow control; Flow (mathematics); TCP Friendly Rate Control; Transmission Control Protocol","score_opus":0.00989592912454802,"score_gpt":0.20677692915115095,"score_spread":0.19688100002660294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130871161","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015242143,0.0011325518,0.9899834,0.0031734344,0.0018871343,0.000110031346,8.008457e-7,0.000023079216,0.002165376],"genre_scores_gemma":[0.9554577,0.00044851936,0.042457733,0.00087272975,0.0004895539,0.000003564469,3.216476e-7,0.0000075817115,0.00026232775],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985208,0.00007506376,0.00052527856,0.00016029099,0.0005384533,0.00018010533],"domain_scores_gemma":[0.99892014,0.00012820268,0.00048041248,0.00016013955,0.000234763,0.0000763589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055643683,0.00012310884,0.00023094774,0.00012916134,0.00003346084,0.0001082637,0.00091689476,0.00003827327,0.00007527965],"category_scores_gemma":[0.000011088539,0.00010738482,0.00011080113,0.00013392852,0.00002948767,0.00023658285,0.00017285872,0.00014793954,0.0000075693038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006674505,0.00008310692,0.0002195935,0.00000684332,0.00071920943,0.0001612316,0.00021937434,0.046942994,0.00002062188,0.09703656,0.0051585445,0.8493652],"study_design_scores_gemma":[0.002689625,0.00019535031,0.0006877099,0.00027764932,0.00006847248,0.00012476745,0.000044246917,0.96193695,0.000013917636,0.018164326,0.015636079,0.00016088203],"about_ca_topic_score_codex":0.0000012164776,"about_ca_topic_score_gemma":0.0000021343765,"teacher_disagreement_score":0.9539335,"about_ca_system_score_codex":0.00004215767,"about_ca_system_score_gemma":0.0000066293405,"threshold_uncertainty_score":0.43790257},"labels":[],"label_agreement":null},{"id":"W2130933107","doi":"10.1109/icct.1996.545063","title":"Self-similar traffic and its implications for ATM network design","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Instituto de Telecomunicações","keywords":"Computer science; Asynchronous Transfer Mode; Traffic generation model; Range (aeronautics); Ethernet; Fractal; Computer network; Distributed computing; Real-time computing; Mathematics; Engineering","score_opus":0.036799511254085975,"score_gpt":0.2302394354584057,"score_spread":0.1934399242043197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130933107","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031473092,0.001826074,0.98604983,0.00959539,0.00014403986,0.00053393125,0.000001084588,0.0005330898,0.0010018437],"genre_scores_gemma":[0.68690723,0.00029317482,0.30957967,0.0015020852,0.00028389442,0.00020967735,9.3092353e-7,0.000011269077,0.0012120679],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991419,0.000041580053,0.00015185961,0.00030956618,0.00006171618,0.00029341472],"domain_scores_gemma":[0.99919224,0.00032724332,0.000040022787,0.00025414373,0.00007143807,0.00011489558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018901732,0.00010974638,0.000119535616,0.000024008872,0.00023532064,0.000107036816,0.0003349508,0.00005451427,0.00002408824],"category_scores_gemma":[0.0000114258755,0.00009791251,0.00004310903,0.00021985712,0.000011280645,0.00019733039,0.000036933954,0.0000521315,0.000034948345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037150182,0.000070374335,0.000022081507,0.000007555314,0.000036808928,7.509836e-7,0.0001513942,0.03784007,0.000007783956,0.33505568,0.08108419,0.5457196],"study_design_scores_gemma":[0.0003862216,0.000071335795,0.00011951767,0.0000033153165,0.000013419353,0.000010733063,0.000001796147,0.9672122,0.0000042682896,0.0013874958,0.030661792,0.00012793252],"about_ca_topic_score_codex":9.5954796e-8,"about_ca_topic_score_gemma":0.000001680033,"teacher_disagreement_score":0.92937213,"about_ca_system_score_codex":0.000011994272,"about_ca_system_score_gemma":0.0000156946,"threshold_uncertainty_score":0.39927563},"labels":[],"label_agreement":null},{"id":"W2131606903","doi":"10.1109/waina.2011.147","title":"STARS: A Framework for Statistically Rigorous Simulation-Based Network Research","year":2011,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Distributed computing; Set (abstract data type); Cloud computing; Wireless ad hoc network; Network simulation; Grid; Mobile ad hoc network; Grid computing; Wireless network; Wireless","score_opus":0.12759311877735308,"score_gpt":0.3613851320515566,"score_spread":0.23379201327420351,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131606903","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017650788,0.00006428723,0.9953538,0.0005999933,0.00033731232,0.0005281652,0.0000041060684,0.00029991948,0.0026358673],"genre_scores_gemma":[0.51118237,9.566785e-7,0.48773044,0.00061605906,0.00017732174,0.000077499484,0.00000162589,0.000008258683,0.00020548252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980935,0.00017345608,0.0002682469,0.00043259497,0.00039939504,0.0006328165],"domain_scores_gemma":[0.9927493,0.005962208,0.000051157498,0.0005679967,0.00049060956,0.00017874656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001087936,0.00012582056,0.00016225413,0.00007223685,0.0002960455,0.0001437932,0.00075740623,0.00011161729,0.00025376052],"category_scores_gemma":[0.000494119,0.000110091394,0.00006247028,0.00048795738,0.000089598674,0.00016078696,0.0000741376,0.00024550103,0.00010526335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006157893,0.000051487492,0.00013779149,0.000005126269,0.000013049836,0.0000052976097,0.00011412428,0.07691801,4.036167e-7,0.78291005,0.002579691,0.13720337],"study_design_scores_gemma":[0.00031693224,0.0002165632,0.0003294344,0.000018959452,0.0000042101897,2.127772e-7,0.0000070327465,0.7754958,0.000004543703,0.21917085,0.004317015,0.000118387456],"about_ca_topic_score_codex":0.000025136087,"about_ca_topic_score_gemma":0.000028722288,"teacher_disagreement_score":0.6985778,"about_ca_system_score_codex":0.000034683948,"about_ca_system_score_gemma":0.0002166301,"threshold_uncertainty_score":0.44893968},"labels":[],"label_agreement":null},{"id":"W2131682084","doi":"10.1109/glocom.1999.830028","title":"Resource allocation issues for long-tailed LRD Internet WAN traffic","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Bandwidth (computing); Multiplexing; Computer network; Bandwidth allocation; Homogeneous; Quality of service; Statistical time division multiplexing; Resource allocation; Computation; The Internet; Admission control; Mathematical optimization; Distributed computing; Mathematics; Algorithm; Telecommunications","score_opus":0.013696608812363583,"score_gpt":0.24151535528055462,"score_spread":0.22781874646819103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131682084","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0154728005,0.0003547081,0.9735968,0.004101997,0.0003019202,0.00037104532,4.932768e-7,0.00041377614,0.00538645],"genre_scores_gemma":[0.96318907,0.0000074016034,0.016447818,0.0008138607,0.00010839132,0.00006890645,0.0000066006173,0.000010242446,0.019347701],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894345,0.00007939488,0.00021130143,0.0003532963,0.00015220526,0.00026035227],"domain_scores_gemma":[0.9992861,0.00012518534,0.000056981742,0.00035721983,0.00008548714,0.00008899201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003374406,0.00012730958,0.00014071642,0.00005589018,0.000070506016,0.00015652081,0.00047009037,0.000063037725,0.000080923906],"category_scores_gemma":[0.000051186595,0.00011078833,0.000073281255,0.00017813679,0.00002587585,0.00020310955,0.000025642263,0.000069190835,0.00008941542],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020081636,0.00008118425,0.00015096032,0.000010441325,0.000030154655,0.000002671995,0.00043527703,0.0035495202,0.000016897984,0.32760167,0.045414638,0.6226865],"study_design_scores_gemma":[0.0008534643,0.00018442185,0.00020888218,0.000022087374,0.000014397412,0.000012292276,0.00006714821,0.59118915,0.0006119739,0.0007060487,0.40584767,0.00028246854],"about_ca_topic_score_codex":0.000002620603,"about_ca_topic_score_gemma":0.000035662048,"teacher_disagreement_score":0.95714897,"about_ca_system_score_codex":0.000025736876,"about_ca_system_score_gemma":0.000041938474,"threshold_uncertainty_score":0.4517817},"labels":[],"label_agreement":null},{"id":"W2131890523","doi":"10.1109/actea.2009.5227907","title":"Testing a new proposed IPv6 QoS management model in inter and intra domains","year":2009,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Quality of service; Computer science; Computer network; Network packet; IPv6; Mobile QoS; The Internet; Packet loss; Differentiated services; Distributed computing; Service (business); Operating system; Service delivery framework","score_opus":0.014151843199723853,"score_gpt":0.21953719486761542,"score_spread":0.20538535166789157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131890523","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020396754,0.000040425708,0.9598818,0.0040032463,0.00006220763,0.0002315963,6.1692795e-8,0.0001754433,0.015208464],"genre_scores_gemma":[0.81294507,0.0000041945195,0.1845419,0.0012809442,0.00004701003,0.0000032342093,1.4007107e-7,0.00000249408,0.0011750051],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992258,0.000017215754,0.00016161113,0.00027799403,0.000104563434,0.00021280024],"domain_scores_gemma":[0.9996379,0.000030459792,0.000026787438,0.00020104057,0.000017514796,0.00008630118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012952887,0.00009689071,0.00010092183,0.0000775043,0.000035724148,0.00011611949,0.00027909115,0.000027851569,0.0000046915106],"category_scores_gemma":[0.000007772224,0.000080559665,0.000015281568,0.00023925716,0.0000128293495,0.00022106802,0.000081495644,0.00008432442,0.000009323496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053352996,0.000029667317,0.00016361335,0.0000024542674,0.0000038211765,0.000019322388,0.00015206447,0.003280195,0.00004467878,0.10190026,0.001099131,0.89329946],"study_design_scores_gemma":[0.00077644666,0.0000610955,0.0027716167,0.000031087526,0.000003689686,0.000006604134,0.000013957316,0.9850815,0.000012213625,0.010879633,0.0002500143,0.00011216337],"about_ca_topic_score_codex":0.000010239154,"about_ca_topic_score_gemma":0.000023115865,"teacher_disagreement_score":0.9818013,"about_ca_system_score_codex":0.000022107983,"about_ca_system_score_gemma":0.000030185969,"threshold_uncertainty_score":0.3285128},"labels":[],"label_agreement":null},{"id":"W2132051115","doi":"10.1016/j.jss.2009.09.034","title":"Survivable ATM mesh networks: Techniques and performance evaluation","year":2009,"lang":"en","type":"article","venue":"Journal of Systems and Software","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; Toronto Metropolitan University","funders":"","keywords":"Survivability; Computer network; Computer science; Network topology; Spare part; Mesh networking; Reliability (semiconductor); Node (physics); Multiprotocol Label Switching; Distributed computing; Optical mesh network; Path (computing); Network planning and design; Wireless mesh network; Engineering; Quality of service; Telecommunications","score_opus":0.012332304580997941,"score_gpt":0.232347916942082,"score_spread":0.22001561236108408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132051115","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34664866,0.022867067,0.6284496,0.000554974,0.0007470542,0.00033469932,5.3392944e-7,0.000112280686,0.00028510005],"genre_scores_gemma":[0.99498487,0.0010069857,0.0035063466,0.00006543486,0.00034741435,0.0000028114148,2.2713915e-7,0.0000027992705,0.00008309032],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991338,0.000079438905,0.0002911105,0.00010737049,0.00026584402,0.00012243245],"domain_scores_gemma":[0.99921787,0.00006356291,0.00023473095,0.000115870214,0.0002866995,0.00008129193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011936453,0.000082582446,0.00019783886,0.000057414254,0.00010528173,0.00017500896,0.00015353737,0.000056521207,0.0000012744764],"category_scores_gemma":[0.000021342996,0.000062203726,0.000027652384,0.00010514129,0.000015191399,0.0005073885,0.000018348559,0.000116404444,3.6604925e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013204831,0.00001195352,0.003923358,0.000011186784,0.000012869528,0.000008917151,0.00007140297,0.0010759379,0.0000032147293,0.0014442545,0.0007310269,0.99269265],"study_design_scores_gemma":[0.0011270511,0.0011674073,0.021220718,0.00063832925,0.000049633112,0.0012034526,0.000070280206,0.9660086,0.000012120212,0.0003730412,0.007876739,0.00025264957],"about_ca_topic_score_codex":0.000002784072,"about_ca_topic_score_gemma":5.4044096e-7,"teacher_disagreement_score":0.99244004,"about_ca_system_score_codex":0.000021886159,"about_ca_system_score_gemma":0.000046883273,"threshold_uncertainty_score":0.25365943},"labels":[],"label_agreement":null},{"id":"W2132173431","doi":"10.1109/glocom.1999.829985","title":"Reference queue tracking strategies for delay guarantees in ATM networks","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Queue; Computer network; Scheduling (production processes); Real-time computing; Multilevel queue; Queueing theory; Multiplexer; Queue management system; Multiplexing; Mathematics; Mathematical optimization; Telecommunications","score_opus":0.025012302615751356,"score_gpt":0.25490983304093884,"score_spread":0.22989753042518749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132173431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070243636,0.00050902035,0.98025304,0.0002461839,0.0002643663,0.00022745346,3.7999664e-7,0.0001650506,0.011310131],"genre_scores_gemma":[0.9799872,0.00003630536,0.01908198,0.00040885885,0.00004861601,0.000060013426,0.0000011258242,0.000006682453,0.00036918483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988778,0.00007522096,0.00024579777,0.0003337132,0.00010636622,0.00036109446],"domain_scores_gemma":[0.9993153,0.00024381718,0.000051570893,0.0002712258,0.000067839595,0.000050205294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038030656,0.00013329118,0.00016674967,0.000052942767,0.000083670915,0.00024861054,0.00041810208,0.00008585654,0.000023670638],"category_scores_gemma":[0.00002418969,0.000114753406,0.00004760035,0.0002630948,0.000025362124,0.00053259236,0.000020293666,0.00013841348,0.0000081548815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007210623,0.00002413193,0.0002184764,0.0000030857866,0.0000057518987,0.000005615972,0.00009809444,0.041535065,0.000010446628,0.8365058,0.00039258462,0.12119379],"study_design_scores_gemma":[0.00082636526,0.00008437884,0.000502712,0.000032621003,0.0000043959935,0.00001476399,0.00021156088,0.9720622,0.000033421577,0.017062692,0.008910425,0.00025450042],"about_ca_topic_score_codex":0.000023107443,"about_ca_topic_score_gemma":0.0005004784,"teacher_disagreement_score":0.97296286,"about_ca_system_score_codex":0.000021909276,"about_ca_system_score_gemma":0.000104303384,"threshold_uncertainty_score":0.46795082},"labels":[],"label_agreement":null},{"id":"W2132299295","doi":"10.1109/ccece.2008.4564484","title":"Convergence-speed enhancement of two classes of (Ω,α)-fair rate allocation algorithms","year":2008,"lang":"en","type":"article","venue":"Conference proceedings - Canadian Conference on Electrical and Computer Engineering","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Convergence (economics); Rate of convergence; Algorithm; Computer science; Mathematical optimization; Topology (electrical circuits); Mathematics; Key (lock)","score_opus":0.028039224576990283,"score_gpt":0.22292940254972463,"score_spread":0.19489017797273434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132299295","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19629125,0.00018316423,0.80115557,0.0008358613,0.0003402337,0.00034934568,0.000005809231,0.00013626392,0.0007025166],"genre_scores_gemma":[0.98347586,0.0003733338,0.015525832,0.00020344727,0.00012650926,0.000030170275,0.00000845883,0.000017093056,0.00023927212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976094,0.000026509228,0.0006110294,0.0006722337,0.00038725534,0.0006935825],"domain_scores_gemma":[0.99800706,0.000115131705,0.00023434429,0.00026707433,0.0008144852,0.0005619216],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002592133,0.00038776099,0.00056910166,0.0004436101,0.00014738533,0.0001203112,0.000798429,0.00014420954,0.000051098894],"category_scores_gemma":[0.000049719125,0.00039041624,0.00008855955,0.00078572164,0.00013503869,0.00038009716,0.00009175166,0.00034820617,0.000017218374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057410172,0.0002204695,0.0023279672,0.00018718284,0.00020454702,0.000015527065,0.0021288567,0.0020549987,0.01794699,0.6946654,0.0010607503,0.27912995],"study_design_scores_gemma":[0.00073587615,0.00042744086,0.0019077946,0.00019290246,0.00002084827,0.00004276048,0.000010846045,0.9895741,0.0027912827,0.0006740468,0.0031008625,0.0005212889],"about_ca_topic_score_codex":0.0014950414,"about_ca_topic_score_gemma":0.0005191701,"teacher_disagreement_score":0.987519,"about_ca_system_score_codex":0.00009495027,"about_ca_system_score_gemma":0.0007965419,"threshold_uncertainty_score":0.9998548},"labels":[],"label_agreement":null},{"id":"W2132362505","doi":"10.1109/waina.2008.66","title":"RealNet: A Topology Generator Based on Real Internet Topology","year":2008,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Internet topology; Computer science; Topology (electrical circuits); Logical topology; Routing table; Computer network; Hierarchical routing; Distributed computing; Static routing; Extension topology; traceroute; Network topology; Routing protocol; Routing (electronic design automation); General topology; Engineering; Mathematics; Topological space","score_opus":0.01664443540555693,"score_gpt":0.23041258046800597,"score_spread":0.21376814506244904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132362505","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056874964,0.000047900525,0.8439886,0.009183284,0.0012900727,0.00016804648,0.000001173616,0.00056914415,0.08787682],"genre_scores_gemma":[0.97473127,0.000022475824,0.009889916,0.007602307,0.00025868724,0.0000235896,0.0000027873339,0.0000071218146,0.007461839],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988381,0.00012665741,0.00019310803,0.00039788097,0.00013715061,0.00030705475],"domain_scores_gemma":[0.9991619,0.00014701238,0.00004823524,0.00047733964,0.000049569942,0.00011591862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011896663,0.00013410138,0.00018189222,0.000086794666,0.000089250156,0.000021993277,0.00055315596,0.00010661022,0.00041967543],"category_scores_gemma":[0.000015438265,0.000111944195,0.00006168484,0.00015553791,0.00011107896,0.000076161195,0.00006777023,0.00013363156,0.00032762936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007912816,0.00017650853,0.0022170057,0.0000024049002,0.000025737061,0.00029260438,0.00025802403,0.001573062,0.000104248815,0.7416504,0.10278609,0.15083478],"study_design_scores_gemma":[0.0010327554,0.0005927744,0.0019413135,0.0000043678524,0.0000042887586,0.00009903741,0.0000072414473,0.9537528,0.00036959286,0.0004781632,0.0414761,0.00024152237],"about_ca_topic_score_codex":0.00016195264,"about_ca_topic_score_gemma":0.000083000414,"teacher_disagreement_score":0.9521798,"about_ca_system_score_codex":0.000033018765,"about_ca_system_score_gemma":0.0001125134,"threshold_uncertainty_score":0.45951515},"labels":[],"label_agreement":null},{"id":"W2132443825","doi":"10.1109/infcom.2011.5934905","title":"The impact of link scheduling on long paths: Statistical analysis and optimal bounds","year":2011,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Burstiness; Network calculus; Computer science; Scheduling (production processes); Network packet; Upper and lower bounds; Key (lock); Mathematical optimization; Computer network; Distributed computing; Quality of service; Mathematics","score_opus":0.016452012168719263,"score_gpt":0.26089900889591777,"score_spread":0.2444469967271985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132443825","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13586484,0.00008190967,0.8623655,0.00008185429,0.00003705753,0.000042917385,0.0000014064353,0.000035825222,0.0014887082],"genre_scores_gemma":[0.96375155,0.000021896869,0.036062814,0.000031468764,0.000030310975,0.0000029588152,6.6544897e-7,0.0000025288577,0.00009582727],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992897,0.00005439413,0.00016619108,0.00018420124,0.00013146747,0.00017407084],"domain_scores_gemma":[0.99920934,0.000313493,0.00005514215,0.00027815087,0.00005877387,0.0000850867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029285136,0.00008162373,0.00014148312,0.000059341397,0.00011355455,0.000095835945,0.00027142226,0.000031739568,0.00004384221],"category_scores_gemma":[0.000032954147,0.00004599658,0.00008472482,0.00029836933,0.00008432903,0.00009169571,0.00005765617,0.000087881745,0.000006244085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004986277,0.000051769526,0.014351571,0.0000015659864,0.00048134863,0.000010869706,0.00029453894,0.0053541446,0.000007782864,0.1843818,0.000051814295,0.79496294],"study_design_scores_gemma":[0.00016303343,0.0002736151,0.12737286,0.0000034131867,0.000054349657,0.000002020213,0.000013981962,0.8714322,0.000023659064,0.0005835305,0.000009066015,0.00006831241],"about_ca_topic_score_codex":0.00008797159,"about_ca_topic_score_gemma":0.000022360673,"teacher_disagreement_score":0.866078,"about_ca_system_score_codex":0.000010797928,"about_ca_system_score_gemma":0.000046154542,"threshold_uncertainty_score":0.18756862},"labels":[],"label_agreement":null},{"id":"W2132578679","doi":"10.1109/tnsm.2009.031103","title":"Queueing-Model-Based Adaptive Control of Multi-Tiered Web Applications","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Network and Service Management","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Office of Naval Research; Multidisciplinary University Research Initiative; Natural Sciences and Engineering Research Council of Canada; Defense Advanced Research Projects Agency","keywords":"Testbed; Computer science; Queueing theory; The Internet; Distributed computing; Scheme (mathematics); Adaptive control; Admission control; Resource allocation; Computer network; Real-time computing; Quality of service; Control (management); Operating system","score_opus":0.016810629983759044,"score_gpt":0.21129280798723757,"score_spread":0.19448217800347853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132578679","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038609642,0.00018740901,0.9962047,0.0010263058,0.0001803972,0.0007772936,0.000010380426,0.00019507438,0.00103238],"genre_scores_gemma":[0.9549389,0.000288365,0.04171657,0.0023165129,0.00004542172,0.0004010578,0.0000014602011,0.000013978198,0.00027775767],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865246,0.00007321746,0.000312417,0.0004247175,0.00023561923,0.0003015604],"domain_scores_gemma":[0.99903876,0.00010181585,0.00011243034,0.0005027858,0.000121446596,0.00012278235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015766252,0.00020569946,0.00025240262,0.00011718885,0.00038865217,0.000029128189,0.00041617148,0.000070212816,0.000008668551],"category_scores_gemma":[1.9171732e-7,0.00020587246,0.00009369263,0.0005868807,0.000061133585,0.0001289994,0.0000049610785,0.00015746569,0.000016707085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063626794,0.0002062833,0.0000072457424,0.000026767375,0.00010155036,0.00000479573,0.000092806375,0.85417783,0.000008633992,0.004622104,0.00012722073,0.14056115],"study_design_scores_gemma":[0.0020834876,0.00008525678,0.000063399886,0.00003777261,0.00007620713,0.0000028774468,0.000026395279,0.995029,0.000025354095,0.00012909186,0.0022475698,0.00019359903],"about_ca_topic_score_codex":0.000014304569,"about_ca_topic_score_gemma":0.000099352044,"teacher_disagreement_score":0.95455277,"about_ca_system_score_codex":0.00002923049,"about_ca_system_score_gemma":0.00006465381,"threshold_uncertainty_score":0.83952355},"labels":[],"label_agreement":null},{"id":"W2133199246","doi":"10.1109/pimrc.2003.1259135","title":"Improving end-to-end quality of services in 3G wireless networks by wireless early regulation of real-time flows","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer network; General Packet Radio Service; Computer science; UMTS frequency bands; Network packet; Wireless network; Quality of service; Core network; Wireless WAN; Wireless; UMTS Terrestrial Radio Access Network; Radio resource management; Wi-Fi array; Radio access network; Telecommunications; Mobile station; Base station","score_opus":0.007102591545031308,"score_gpt":0.22358005529815408,"score_spread":0.21647746375312277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133199246","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66969496,0.000036393485,0.3292209,0.0002378579,0.00009348747,0.00020132081,0.0000029540704,0.000082713144,0.0004294376],"genre_scores_gemma":[0.9939288,0.0000126474615,0.005718859,0.000091324306,0.000056535744,0.000014400589,0.000007642696,0.000010699069,0.00015912813],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801975,0.00014471714,0.0007116689,0.00042547696,0.0003822179,0.00031614336],"domain_scores_gemma":[0.99872345,0.00016348792,0.00031918674,0.0005267478,0.000158344,0.00010878975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007572543,0.00017165364,0.00040651183,0.00010785432,0.00004718371,0.000054390068,0.0006585415,0.00012844952,0.000025765434],"category_scores_gemma":[0.0000058438386,0.00016457448,0.00007419645,0.0006365011,0.0000400059,0.00044999112,0.00013945001,0.00011986942,0.000007807031],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013445558,0.0002534276,0.0031994176,0.00010568327,0.000039572362,0.0000026839807,0.0013796083,0.14086393,0.09429349,0.04777851,0.00006124124,0.71188796],"study_design_scores_gemma":[0.001236098,0.00012594774,0.03538198,0.00012329838,0.000007990713,0.0000010277276,0.00004692099,0.95913285,0.003238866,0.00044361973,0.00001351239,0.00024786245],"about_ca_topic_score_codex":0.0053005177,"about_ca_topic_score_gemma":0.0012813025,"teacher_disagreement_score":0.81826895,"about_ca_system_score_codex":0.00005796435,"about_ca_system_score_gemma":0.000083316234,"threshold_uncertainty_score":0.80128324},"labels":[],"label_agreement":null},{"id":"W2133600388","doi":"10.1109/icme.2004.1394166","title":"A user-centered approach to enhance QoS for networked video","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Quality of service; Computer science; Scheme (mathematics); Computer network; Mobile QoS; Network management; Service (business); Point (geometry); Video streaming; Buffer (optical fiber); Multimedia; Service delivery framework; Telecommunications","score_opus":0.013893445499896124,"score_gpt":0.2533579697790658,"score_spread":0.23946452427916964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133600388","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009340156,0.00009851343,0.9783887,0.0046008667,0.0004022828,0.00062869873,0.0000010320924,0.00035512552,0.014590731],"genre_scores_gemma":[0.6453366,0.000006218502,0.34104013,0.0052258177,0.000944486,0.00026678236,0.0000023280431,0.00001038578,0.007167222],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986958,0.000031639884,0.00022281797,0.0004812588,0.00015690117,0.00041161728],"domain_scores_gemma":[0.999134,0.00008667515,0.00004519559,0.00047995636,0.00007630031,0.0001778508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022837531,0.0001426472,0.00016868331,0.0000473107,0.000101613536,0.00014822434,0.0007974777,0.000052013536,0.000017317818],"category_scores_gemma":[0.000013084315,0.00012444778,0.0000856685,0.00026803892,0.00001269308,0.0002820126,0.00010522603,0.00006873209,0.00013764424],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002695915,0.00009719153,0.000014852629,0.0000033538336,0.000014405197,1.9937214e-7,0.00010364396,0.012273993,0.000049185874,0.045412935,0.086181104,0.8558222],"study_design_scores_gemma":[0.00034758047,0.000043515007,0.000024675746,0.0000066930356,0.0000037342954,0.0000026966882,0.0000055885776,0.5963185,0.00018145988,0.00007695773,0.4028466,0.00014198228],"about_ca_topic_score_codex":0.0000030437297,"about_ca_topic_score_gemma":0.0000192358,"teacher_disagreement_score":0.85568017,"about_ca_system_score_codex":0.000032542266,"about_ca_system_score_gemma":0.000036887293,"threshold_uncertainty_score":0.5074833},"labels":[],"label_agreement":null},{"id":"W2133630653","doi":"10.1109/ccgrid.2004.1336572","title":"GTP: group transport protocol for lambda-grids","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canarie; National Science Foundation","keywords":"Computer network; Computer science; Bandwidth (computing); Wavelength-division multiplexing; Distributed computing; Multiplexing; GTP'; Transfer (computing); Throughput; Protocol (science); Wireless; Telecommunications; Wavelength; Physics","score_opus":0.016882386775972657,"score_gpt":0.2668890823627976,"score_spread":0.250006695586825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133630653","genre_codex":"methods","genre_gemma":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009894459,0.0000019891215,0.9266176,0.0018798232,0.0001244569,0.06521544,8.3540976e-7,0.0003938936,0.005666983],"genre_scores_gemma":[0.22619364,4.7049045e-7,0.15053527,0.002138827,0.00040440742,0.6182425,0.000003475495,0.000017798578,0.002463608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99909997,0.000009369124,0.00018632952,0.00029471357,0.00015048253,0.00025912447],"domain_scores_gemma":[0.9995007,0.000031367083,0.000035701767,0.00028946233,0.000052607204,0.00009015542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016276893,0.00011253854,0.00011957069,0.000031659783,0.00009289425,0.00004805113,0.0004694791,0.00005243013,0.000032677806],"category_scores_gemma":[0.0000034832126,0.0000897441,0.00009291647,0.00015411885,0.000022838329,0.00025177473,0.0000171642,0.000062776046,0.000040016475],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035382,0.000120981436,0.000088187284,0.000016989468,0.000011500227,0.000006367111,0.00007630688,0.0011201669,0.00004734795,0.79603887,0.0014947952,0.20094311],"study_design_scores_gemma":[0.017490398,0.0011952851,0.0029410557,0.00009172005,0.00001964915,0.000036015026,0.000024291841,0.08183304,0.0009356139,0.046427395,0.84811956,0.0008859849],"about_ca_topic_score_codex":0.000009834545,"about_ca_topic_score_gemma":0.000043486056,"teacher_disagreement_score":0.84662473,"about_ca_system_score_codex":0.000023670129,"about_ca_system_score_gemma":0.00007897972,"threshold_uncertainty_score":0.3659658},"labels":[],"label_agreement":null},{"id":"W2134271575","doi":"10.1109/pccc.2000.830362","title":"Performance evaluation of joint per-VC scheduling and credit-based flow control in high-speed ATM WANs","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Scheduling (production processes); Flow control (data); Asynchronous Transfer Mode; Real-time computing; Engineering","score_opus":0.02765558275233663,"score_gpt":0.22182159972380056,"score_spread":0.19416601697146393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134271575","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6148025,0.000427888,0.38099706,0.0020291742,0.00024802695,0.00033108535,0.0000010563679,0.00008114167,0.0010820901],"genre_scores_gemma":[0.9832727,0.000020673488,0.016235918,0.0003165889,0.0000780172,0.00001856172,0.0000012059222,0.0000053712547,0.00005098566],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985818,0.00013165623,0.0003152158,0.0002870921,0.00046637206,0.00021785621],"domain_scores_gemma":[0.9992383,0.00010315914,0.000090126174,0.00027546534,0.00022516304,0.00006779084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009536685,0.00012209159,0.0002208233,0.00011063187,0.00006309837,0.00004924416,0.0002063767,0.00006160265,0.00019964855],"category_scores_gemma":[0.000046554345,0.00010711871,0.00003785176,0.0002129317,0.00004717261,0.0002926157,0.000025267236,0.00011299395,0.000022150505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016218288,0.00008335879,0.0022355106,0.000011492056,0.000012678151,0.0000013121039,0.00021523634,0.4274241,0.00041165014,0.0017000528,0.0000854049,0.56780297],"study_design_scores_gemma":[0.0037450818,0.00010268089,0.008441242,0.000035563546,0.000019871452,0.0000020102932,0.000016537033,0.9872901,0.00014549057,0.000046125348,0.00003406146,0.000121276826],"about_ca_topic_score_codex":0.00001682655,"about_ca_topic_score_gemma":0.00002662257,"teacher_disagreement_score":0.5676817,"about_ca_system_score_codex":0.000045792684,"about_ca_system_score_gemma":0.00005522135,"threshold_uncertainty_score":0.4368174},"labels":[],"label_agreement":null},{"id":"W2134612671","doi":"10.1109/infcom.1996.497915","title":"Source policing for ATM systems based on peakedness rate","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Queue; Computer science; Queueing theory; Function (biology); Computer network; Real-time computing; Server","score_opus":0.021436618118985677,"score_gpt":0.21117424165882268,"score_spread":0.189737623539837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134612671","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018973858,0.000049730814,0.9869598,0.0025942214,0.0005917839,0.0002783382,7.421057e-7,0.00035304297,0.007274926],"genre_scores_gemma":[0.9846889,0.0000015606053,0.001851942,0.002301112,0.00025723904,0.000060156883,6.759811e-7,0.00000916405,0.010829297],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991277,0.00006201765,0.00015040096,0.00026683733,0.00012780023,0.00026528095],"domain_scores_gemma":[0.9991208,0.00031860484,0.000050306386,0.00036414634,0.00005910936,0.00008703807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002371327,0.0001085498,0.0001330709,0.000053622076,0.00013760514,0.00017239687,0.0003837108,0.000040315204,0.000025679923],"category_scores_gemma":[0.000020549382,0.00008839331,0.00006160768,0.0001645801,0.000012946169,0.00010505659,0.00002058207,0.000055042095,0.0001071379],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021146037,0.00012023116,0.00013624887,0.000033737742,0.0000211467,0.0000040245964,0.0002747162,0.3633417,0.000059540274,0.18693115,0.039907802,0.40914857],"study_design_scores_gemma":[0.00064002536,0.00008183729,0.000037841975,0.000023509763,0.0000038995445,0.0000019271047,0.000011802421,0.9745944,0.000020908863,0.000027148419,0.02443756,0.000119155426],"about_ca_topic_score_codex":0.000028958386,"about_ca_topic_score_gemma":0.0000053070917,"teacher_disagreement_score":0.9851079,"about_ca_system_score_codex":0.000024482879,"about_ca_system_score_gemma":0.00001422543,"threshold_uncertainty_score":0.36045745},"labels":[],"label_agreement":null},{"id":"W2134972025","doi":"10.3844/jcssp.2007.658.665","title":"An Improved Resource Reservation Protocol","year":2007,"lang":"en","type":"article","venue":"Journal of Computer Science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Protocol (science); Reservation; Computer network; Resource (disambiguation); Distributed computing","score_opus":0.012423591394073532,"score_gpt":0.28715954422499307,"score_spread":0.27473595283091956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134972025","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01167885,0.000005424927,0.9837714,0.0007868231,0.00050344935,0.0029461395,6.153161e-8,0.000056937242,0.00025095593],"genre_scores_gemma":[0.6431691,2.9589148e-7,0.35451055,0.00110191,0.0010449387,0.00013845638,7.495104e-8,0.0000060485186,0.00002860847],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979023,0.00006665521,0.0005659136,0.0002773903,0.0008105881,0.00037717522],"domain_scores_gemma":[0.9978021,0.00011282458,0.0005012873,0.0005191985,0.00074968615,0.00031492242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005351972,0.000110227484,0.00016373253,0.0003397025,0.00023208153,0.0004716629,0.0026398723,0.000041580148,0.0000030286583],"category_scores_gemma":[0.000044109252,0.00008640045,0.00006478031,0.0011738726,0.00016473286,0.0025337297,0.00015733147,0.00023700693,0.000004165193],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007475243,0.000110771856,0.00027135896,0.000004155738,0.000004740652,0.000036146706,0.00027413236,0.0026023732,0.004046255,0.010508132,0.00070671696,0.98136044],"study_design_scores_gemma":[0.000982045,0.001314432,0.008019723,0.000040314688,0.000002912864,0.00020738208,0.00001020106,0.9617045,0.0019284564,0.001039926,0.024585119,0.00016499143],"about_ca_topic_score_codex":0.0000019090976,"about_ca_topic_score_gemma":0.00000239362,"teacher_disagreement_score":0.98119545,"about_ca_system_score_codex":0.00007523412,"about_ca_system_score_gemma":0.00038423354,"threshold_uncertainty_score":0.49055836},"labels":[],"label_agreement":null},{"id":"W2134977040","doi":"10.1109/11.868929","title":"On the use of frame-based slice size for the robust transmission of MPEG video over ATM networks","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Broadcasting","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Robustness (evolution); Real-time computing; MPEG-2; Video compression picture types; Frame (networking); MPEG-4; Asynchronous Transfer Mode; Transmission (telecommunications); Video processing; Video tracking; Computer network; Computer hardware; Coding (social sciences); Telecommunications","score_opus":0.03703248174867928,"score_gpt":0.22917863614640252,"score_spread":0.19214615439772326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134977040","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01413073,0.0000864462,0.9833443,0.0014256352,0.00030199924,0.0005360513,0.000011108169,0.00009029998,0.000073428324],"genre_scores_gemma":[0.98835826,0.000042532953,0.010106026,0.0009952852,0.00006755935,0.00007948854,4.323325e-7,0.000019891782,0.0003304997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849737,0.0001489714,0.0004158072,0.0003219796,0.00031925843,0.0002966442],"domain_scores_gemma":[0.9902785,0.00882568,0.00015406228,0.000574294,0.00010144132,0.000066054985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037091054,0.0001995119,0.00022618269,0.000046791192,0.00044334398,0.00007915074,0.0005497328,0.00011038784,0.00023611909],"category_scores_gemma":[0.000029389246,0.00012568319,0.00026873415,0.00044334438,0.00010397684,0.00018997765,0.0000012032502,0.00035444048,0.0000037234265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014119425,0.00007877213,0.0000011808182,0.0000068017716,0.000025177591,3.379573e-7,0.0000869875,0.59680855,0.00011650936,0.00023454598,0.00017992298,0.40232006],"study_design_scores_gemma":[0.0008010492,0.00021429769,0.00006883544,0.0001925784,0.00005877703,0.0000023551797,0.00001148365,0.9935423,0.0011357556,0.000040478135,0.0038011258,0.00013092208],"about_ca_topic_score_codex":0.000054093485,"about_ca_topic_score_gemma":0.000012922338,"teacher_disagreement_score":0.97422755,"about_ca_system_score_codex":0.000024067476,"about_ca_system_score_gemma":0.00006573211,"threshold_uncertainty_score":0.5125212},"labels":[],"label_agreement":null},{"id":"W2135079446","doi":"10.1109/aina.2008.134","title":"SQUARE: A New TCP Variant for Future High Speed and Long Delay Environments","year":2008,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Bottleneck; Computer science; Computer network; TCP Friendly Rate Control; Network congestion; HSTCP; Bandwidth (computing); TCP global synchronization; Transmission Control Protocol; The Internet; Distributed computing; Embedded system; Network packet","score_opus":0.010042257149854761,"score_gpt":0.19396380149768844,"score_spread":0.18392154434783367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135079446","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015984144,0.000341125,0.9783411,0.0042893807,0.0004350984,0.00025064716,0.0000011601794,0.00009431855,0.00026300678],"genre_scores_gemma":[0.93995667,0.00013887465,0.046574447,0.0015164536,0.00070506113,0.000010444433,0.0000033938593,0.0000095818195,0.011085078],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991699,0.000019103685,0.00013599958,0.00031181463,0.00014339441,0.00021980463],"domain_scores_gemma":[0.9994783,0.000059830643,0.00004003478,0.0002532646,0.000010196839,0.00015837536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007308534,0.00011570159,0.00012894104,0.00002774384,0.00014199669,0.0000502694,0.00025879176,0.00006235023,0.00005195358],"category_scores_gemma":[0.0000041316116,0.00009490588,0.00004079087,0.00008201007,0.000026076259,0.00020358824,0.00006404331,0.00006181846,0.000033095766],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054285396,0.000105999774,0.0010051547,0.000007208773,0.0000723737,0.0001746217,0.00061347627,0.0009633218,0.000065002896,0.14979953,0.0387889,0.80835015],"study_design_scores_gemma":[0.00947282,0.00070109166,0.054008964,0.000028195002,0.00006537701,0.001019899,0.000062725994,0.6329783,0.00020774816,0.004868279,0.29549336,0.001093213],"about_ca_topic_score_codex":0.00001693354,"about_ca_topic_score_gemma":0.000011249137,"teacher_disagreement_score":0.9317667,"about_ca_system_score_codex":0.0000146351495,"about_ca_system_score_gemma":0.0000445093,"threshold_uncertainty_score":0.38701496},"labels":[],"label_agreement":null},{"id":"W2135120519","doi":"10.1109/wcnc.2002.993378","title":"Performance evaluations of PRR-CFDAMA for TCP traffic over geosynchronous satellite links","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer network; Computer science; TCP acceleration; Zeta-TCP; Transmission Control Protocol; TCP tuning; TCP global synchronization; Throughput; TCP Friendly Rate Control; File Transfer Protocol; The Internet; Telecommunications; Wireless; Operating system; Network packet","score_opus":0.014995249526203019,"score_gpt":0.2545455760810302,"score_spread":0.23955032655482716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135120519","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27740443,0.00066804106,0.71015227,0.0005061765,0.0005791424,0.0007240216,0.0000030314,0.00021743069,0.009745426],"genre_scores_gemma":[0.9703351,0.00008614838,0.027451416,0.0002866458,0.00006167423,0.00007053409,0.0000028623376,0.000008547623,0.0016970357],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881697,0.000058405898,0.0003163475,0.0002944035,0.0002323654,0.0002814904],"domain_scores_gemma":[0.9990012,0.00021007264,0.000103340186,0.00041135694,0.00019515117,0.0000788764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047392433,0.00012977,0.00018190798,0.000072052106,0.000117940624,0.000048232992,0.0003628904,0.00011098908,0.000114328344],"category_scores_gemma":[0.000042771757,0.00011405755,0.000100399964,0.0002664148,0.00004217339,0.0002634726,0.00002076924,0.00011599894,0.00003768711],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009415053,0.00009136142,0.0003540021,0.000021065433,0.000026438835,3.4076157e-7,0.00020514279,0.021576174,0.000060735085,0.06181257,0.00073868234,0.9151041],"study_design_scores_gemma":[0.0010600813,0.00021037199,0.00353951,0.000020002184,0.000022511309,0.0000060337757,0.000013382493,0.9647459,0.00037823385,0.0002497745,0.029569037,0.00018516996],"about_ca_topic_score_codex":0.0000012731084,"about_ca_topic_score_gemma":0.000009324886,"teacher_disagreement_score":0.9431697,"about_ca_system_score_codex":0.000027629423,"about_ca_system_score_gemma":0.00019351477,"threshold_uncertainty_score":0.4651132},"labels":[],"label_agreement":null},{"id":"W2135222901","doi":"10.5539/cis.v7n2p1","title":"Realistic Network Traffic Profile Generation: Theory and Practice","year":2014,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Provisioning; Traffic generation model; Context (archaeology); Network traffic simulation; The Internet; Internet traffic; Order (exchange); Data science; Network traffic control; Real-time computing; Computer network; World Wide Web; Network packet","score_opus":0.010490144135032808,"score_gpt":0.23558067775721203,"score_spread":0.22509053362217923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135222901","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035524194,0.00007998233,0.9889585,0.0012170891,0.0006046494,0.00014079873,5.054279e-7,0.00012651345,0.0053195525],"genre_scores_gemma":[0.90339285,0.000050920647,0.09003975,0.005997238,0.00047183337,0.000013226296,0.0000039757974,0.000002178358,0.000028037775],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988581,0.00015467075,0.00024028104,0.00022351903,0.0002930197,0.00023038576],"domain_scores_gemma":[0.998766,0.00046396774,0.00012045134,0.00026521893,0.00024394691,0.00014042432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030601192,0.000099276716,0.00010181171,0.00009431601,0.00050249114,0.0009287157,0.00037790296,0.000031880605,0.0000038853473],"category_scores_gemma":[0.00023039638,0.00008389333,0.000013032412,0.00049483014,0.00024045208,0.007884554,0.00018563677,0.00008089451,0.000026586093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037022655,0.0000028865543,0.0000032457008,0.0000027925043,0.0000012981735,1.3578415e-7,0.0003479795,0.006066388,0.0000025092193,0.4585918,0.0011723121,0.53380495],"study_design_scores_gemma":[0.00022473378,0.000077607125,0.00069775555,0.000009172496,0.0000040694767,0.000073980664,0.000014330413,0.95545876,0.000003473477,0.00066037296,0.042662494,0.00011322588],"about_ca_topic_score_codex":9.106703e-7,"about_ca_topic_score_gemma":3.5567078e-7,"teacher_disagreement_score":0.9493924,"about_ca_system_score_codex":0.000013197663,"about_ca_system_score_gemma":0.00008008952,"threshold_uncertainty_score":0.8955627},"labels":[],"label_agreement":null},{"id":"W2135251503","doi":"10.1109/lcn.2002.1181764","title":"Performance analysis of token-based fast TCP in systems supporting large windows","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Computer network; TCP global synchronization; TCP acceleration; TCP tuning; Network packet; TCP Friendly Rate Control; Zeta-TCP; TCP Westwood plus; Bandwidth (computing); Traverse; HSTCP; CUBIC TCP; Real-time computing; Network congestion","score_opus":0.008199465610243008,"score_gpt":0.222717653700014,"score_spread":0.214518188089771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135251503","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36509103,0.00008431257,0.6254683,0.000080499565,0.0001857591,0.0001540827,0.0000017891139,0.00007948247,0.008854709],"genre_scores_gemma":[0.99797606,0.0000029102798,0.0014394263,0.00014503453,0.00001108817,0.00001530504,0.0000023840041,0.0000034278748,0.00040433474],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986942,0.00010263309,0.00043059263,0.0002451109,0.00022192785,0.0003055586],"domain_scores_gemma":[0.99925536,0.00009950504,0.00015583156,0.00035283624,0.00007588647,0.000060558334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079030497,0.000098279124,0.00029499384,0.00030511676,0.000044205575,0.000044050183,0.00032229512,0.00004369916,0.000073879586],"category_scores_gemma":[0.00002490979,0.00008581243,0.00009172956,0.0015593601,0.000014052977,0.00017703089,0.000021256727,0.000079528145,0.00001158608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008578198,0.0001601031,0.34221464,0.00003296015,0.00015450593,0.000010572312,0.00024435073,0.5660485,0.00006497425,0.05557825,0.00016252788,0.03531999],"study_design_scores_gemma":[0.00049669616,0.000027117563,0.010098659,0.000014112058,0.000036960435,8.0251374e-7,0.00006107451,0.9882654,0.00011595586,0.000002276464,0.0007814667,0.00009945756],"about_ca_topic_score_codex":0.000024923387,"about_ca_topic_score_gemma":0.00007534905,"teacher_disagreement_score":0.63288504,"about_ca_system_score_codex":0.00002396057,"about_ca_system_score_gemma":0.000087589025,"threshold_uncertainty_score":0.34993297},"labels":[],"label_agreement":null},{"id":"W2135331813","doi":"10.1109/glocom.2001.966200","title":"Deadline based channel scheduling","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Earliest deadline first scheduling; Scheduling (production processes); Network packet; Real-time computing; Dynamic priority scheduling; Round-robin scheduling; Computer network; Fair-share scheduling; Rate-monotonic scheduling; Deadline-monotonic scheduling; Queue; Priority queue; Distributed computing; Quality of service; Mathematical optimization; Mathematics","score_opus":0.02218514546706572,"score_gpt":0.20349992358559815,"score_spread":0.18131477811853244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135331813","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00086958555,0.00022586102,0.9812774,0.007335221,0.00023168279,0.00005345679,1.338234e-7,0.0003842797,0.009622402],"genre_scores_gemma":[0.93829525,0.0000054497705,0.05690332,0.002883489,0.00012658443,0.000007797635,3.259667e-7,0.0000037169975,0.0017740445],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993747,0.000020255453,0.00010358524,0.00019428921,0.00012299464,0.00018420139],"domain_scores_gemma":[0.999539,0.00005839377,0.000022897353,0.00026257444,0.000040191637,0.00007693935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000097074895,0.00007126813,0.000074322605,0.000041241714,0.00006971443,0.00006909832,0.00035435517,0.000030920597,0.00028242604],"category_scores_gemma":[0.0000125297465,0.00006083865,0.000038752012,0.00019918951,0.000011938496,0.00014891944,0.000031751973,0.00006629492,0.00042582388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023762848,0.00010754889,0.00006625262,0.0000038537733,0.000011013413,0.00001996678,0.000071677736,0.04220038,0.000044423912,0.1037555,0.0066148182,0.84710217],"study_design_scores_gemma":[0.00032616378,0.000020991156,0.000027485688,0.000004841813,0.0000016383193,0.0000026818639,0.00000237121,0.99479026,0.00007275468,0.00025621656,0.0044091237,0.000085495885],"about_ca_topic_score_codex":0.0000020007035,"about_ca_topic_score_gemma":0.0000024360993,"teacher_disagreement_score":0.95258987,"about_ca_system_score_codex":0.000008116196,"about_ca_system_score_gemma":0.0000091824,"threshold_uncertainty_score":0.54732466},"labels":[],"label_agreement":null},{"id":"W2135488208","doi":"10.1109/ccece.1996.548279","title":"Traffic classification and resource allocation in ATM networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Asynchronous Transfer Mode; Computer science; Computer network; Quality of service; Broadband Integrated Services Digital Network; Broadband networks; ATM adaptation layer; Asynchronous communication; Traffic classification; Integrated Services Digital Network; Resource allocation; Broadband; Resource management (computing); Distributed computing; Telecommunications","score_opus":0.019152807518895823,"score_gpt":0.20384608430471912,"score_spread":0.1846932767858233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135488208","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067894526,0.0013870698,0.9047612,0.012462241,0.00016112068,0.00027843507,1.05148054e-7,0.00039314682,0.012662169],"genre_scores_gemma":[0.9963404,0.00010043114,0.0019341501,0.00052756595,0.0000615391,0.000017224516,0.0000011171485,0.0000037870793,0.0010138127],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992708,0.00005900833,0.00015869146,0.00025711922,0.00009582181,0.00015855035],"domain_scores_gemma":[0.99958014,0.00008185483,0.0000371693,0.00022831142,0.000017066906,0.000055475582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017788801,0.000073275,0.00007852204,0.000057122175,0.000052460156,0.00008511978,0.00020526843,0.000058642858,0.000025041249],"category_scores_gemma":[0.000009086963,0.00006845267,0.000015003916,0.00029508225,0.000024602079,0.00020774007,0.00002659049,0.000094211406,0.000025321237],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018218481,0.000031244133,0.00034870536,0.0000010764443,0.0000020923135,0.0000014638637,0.00016226561,0.021221811,0.0000060867005,0.044972397,0.0026806293,0.9305704],"study_design_scores_gemma":[0.00029159503,0.00001968014,0.007335917,0.0000064896694,0.0000015420077,0.0000050144718,0.000024024925,0.9843718,8.3391654e-7,0.000051768995,0.007810081,0.00008128186],"about_ca_topic_score_codex":0.0000024299302,"about_ca_topic_score_gemma":0.000029587623,"teacher_disagreement_score":0.96314996,"about_ca_system_score_codex":0.000019867493,"about_ca_system_score_gemma":0.000004059128,"threshold_uncertainty_score":0.27914187},"labels":[],"label_agreement":null},{"id":"W2135648181","doi":"10.1109/scac.1995.523652","title":"Dynamic routing for multimedia traffic over ATM networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Computer network; Static routing; Policy-based routing; Dynamic Source Routing; Link-state routing protocol; Hierarchical routing; Distributed computing; Routing (electronic design automation); Multipath routing; Routing table; Testbed; Routing protocol; Destination-Sequenced Distance Vector routing","score_opus":0.01090486686164965,"score_gpt":0.2187202649031927,"score_spread":0.20781539804154306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135648181","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053020744,0.0004037306,0.9903148,0.0010068035,0.0007563603,0.00029841557,7.9481924e-7,0.0005237773,0.0013932425],"genre_scores_gemma":[0.9514284,0.000025153548,0.043983467,0.0007726259,0.00017207075,0.00004511215,0.000002329521,0.000012225882,0.003558618],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988229,0.000028092603,0.00021988829,0.00036744904,0.0001397934,0.00042185068],"domain_scores_gemma":[0.9991431,0.00030874988,0.00006297571,0.00033158547,0.00004126013,0.00011233034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017234629,0.00014632358,0.00015962977,0.00003822092,0.00014771856,0.00013073317,0.0004937161,0.00008502601,0.00015049924],"category_scores_gemma":[0.000023013454,0.00012889144,0.00011241808,0.00020887924,0.000025765235,0.00024390905,0.000053848442,0.00011372441,0.000069998045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002993677,0.000038129194,0.000028399236,0.0000017283239,0.000015214677,0.0000026181326,0.000111016314,0.06732362,0.0000035944513,0.0063081556,0.006209346,0.9199552],"study_design_scores_gemma":[0.0008291916,0.00004431929,0.00020922892,0.000008401538,0.000007778317,0.000004715273,0.0000074574664,0.994364,0.0000011137673,0.00003680031,0.004311836,0.0001751543],"about_ca_topic_score_codex":0.0000018420499,"about_ca_topic_score_gemma":0.000023345865,"teacher_disagreement_score":0.9463313,"about_ca_system_score_codex":0.000031585583,"about_ca_system_score_gemma":0.000008524492,"threshold_uncertainty_score":0.525604},"labels":[],"label_agreement":null},{"id":"W2135653889","doi":"10.1109/ccece.2003.1226068","title":"Performance behavior evaluation of Internet congestion control policing mechanisms","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Token bucket; Computer science; Computer network; Quality of service; Leaky bucket; Packet loss; The Internet; EWMA chart; Network packet; Throughput; Poisson distribution; Real-time computing; Telecommunications; Control chart; Statistics","score_opus":0.019405840990383606,"score_gpt":0.2504109011398749,"score_spread":0.2310050601494913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135653889","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36711523,0.000020804899,0.630884,0.00033899062,0.00025320708,0.00028512286,4.8851825e-7,0.00009923499,0.0010029703],"genre_scores_gemma":[0.99330956,0.0000039453844,0.006250232,0.00023101096,0.00003501682,0.000074127754,0.0000015798989,0.000005136952,0.00008940732],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988203,0.0000678948,0.0002511162,0.00021389124,0.00047338754,0.00017339167],"domain_scores_gemma":[0.99920404,0.000031779913,0.00011622292,0.00026224836,0.00032864095,0.000057077712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007641802,0.0001018209,0.00014411166,0.0000821669,0.00004016138,0.000036516674,0.00033272212,0.00005508755,0.00004508808],"category_scores_gemma":[0.000022716322,0.000090736256,0.0000455605,0.00016502038,0.000026139818,0.00034841814,0.00003460945,0.00007446457,0.00003330588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000138807445,0.000098295626,0.0007170954,0.0000060495026,0.000020680465,0.0000010945197,0.00022715017,0.046359994,0.0032790254,0.26385683,0.00002636548,0.6853936],"study_design_scores_gemma":[0.002951918,0.00020950369,0.011072194,0.00004319337,0.00007167862,0.000014895619,0.000013569585,0.97659653,0.006915532,0.0019639172,0.000011040468,0.00013600645],"about_ca_topic_score_codex":0.00009803426,"about_ca_topic_score_gemma":0.000028503593,"teacher_disagreement_score":0.9302366,"about_ca_system_score_codex":0.00008781569,"about_ca_system_score_gemma":0.00012807047,"threshold_uncertainty_score":0.3700117},"labels":[],"label_agreement":null},{"id":"W2135943273","doi":"10.1109/icc.2004.1312870","title":"The complexity of computing virtual-time in weighted fair queuing schedulers","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Weighted fair queueing; Computer science; Iterated function; Queueing theory; Network packet; Time complexity; Scheduling (production processes); Algorithm; Mathematical optimization; Mathematics; Computer network","score_opus":0.015254195221328457,"score_gpt":0.22443564860929058,"score_spread":0.20918145338796212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135943273","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17099853,0.00008312737,0.81946313,0.005436845,0.00025743459,0.0001718662,3.397763e-7,0.00020282333,0.0033859357],"genre_scores_gemma":[0.9755332,0.000004559934,0.024082456,0.00021074439,0.00003457508,0.0000020852383,5.3022177e-7,0.0000042083284,0.00012767439],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989175,0.00007985919,0.00030891455,0.0002227833,0.00020380648,0.00026711746],"domain_scores_gemma":[0.9992815,0.00018366189,0.00009620396,0.0003207064,0.00006475218,0.000053136737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004681251,0.000102008074,0.00016561899,0.000054876065,0.00015723739,0.00007256304,0.00068942056,0.000039312392,0.000009834955],"category_scores_gemma":[0.000022396356,0.000072503884,0.000053881526,0.00042678395,0.00021307998,0.00016347789,0.00014792854,0.00014205664,0.00004136773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065499025,0.000040415907,0.00011173368,0.0000016735318,0.0000114839895,0.0000034007753,0.0003155033,0.013242357,0.00017067946,0.8596489,0.00006982834,0.12637748],"study_design_scores_gemma":[0.0009883427,0.000057121262,0.002181883,0.000047112997,0.0000022273498,0.000004652756,0.00011206453,0.9825384,0.00038366366,0.013326269,0.00022572173,0.00013255599],"about_ca_topic_score_codex":0.00007717743,"about_ca_topic_score_gemma":0.00011129707,"teacher_disagreement_score":0.96929604,"about_ca_system_score_codex":0.000046738864,"about_ca_system_score_gemma":0.00009009131,"threshold_uncertainty_score":0.29566225},"labels":[],"label_agreement":null},{"id":"W2135952349","doi":"10.1109/glocom.2003.1258958","title":"A new traffic rate estimation and monitoring algorithm for the QoS-enabled Internet","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"EWMA chart; Estimator; Quality of service; Computer science; Real-time computing; The Internet; Algorithm; Traffic flow (computer networking); Sliding window protocol; Internet traffic; Computer network; Window (computing); Mathematics; Statistics","score_opus":0.011876630745435659,"score_gpt":0.23181283476998793,"score_spread":0.21993620402455227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135952349","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018670993,0.0002573831,0.9931326,0.0035353175,0.00070447224,0.0002692127,2.21963e-7,0.00017968134,0.000053998392],"genre_scores_gemma":[0.56714284,0.00002910424,0.4297938,0.00019969644,0.00041252922,0.000047469515,5.947273e-7,0.0000066309067,0.002367304],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941397,0.0000151054455,0.00012228853,0.00020085077,0.00008193943,0.00016586795],"domain_scores_gemma":[0.99950355,0.00018711516,0.000036776815,0.00016828183,0.00003588121,0.00006836762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021195399,0.00008845956,0.00008375627,0.000025842997,0.00010007011,0.00024849863,0.0002805432,0.000031303087,0.000004358365],"category_scores_gemma":[0.000013791728,0.000052483916,0.000032377233,0.0001163765,0.000014428057,0.00026604152,0.00004212658,0.00006216637,0.000010528043],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030086035,0.000005811383,0.0000019818783,0.0000013982313,0.000012206379,8.1343256e-7,0.00019426834,0.03201439,0.0000066651855,0.009646951,0.000507845,0.95760465],"study_design_scores_gemma":[0.0009924069,0.000055204535,0.0001285824,0.000016376278,0.000010874961,0.000007699266,0.000023550392,0.99533874,0.00020756057,0.0013620174,0.0017759694,0.00008099626],"about_ca_topic_score_codex":0.000029130018,"about_ca_topic_score_gemma":0.000007946408,"teacher_disagreement_score":0.96332437,"about_ca_system_score_codex":0.000022230694,"about_ca_system_score_gemma":0.00006185579,"threshold_uncertainty_score":0.23962781},"labels":[],"label_agreement":null},{"id":"W2136102424","doi":"10.1109/ccece.2002.1012987","title":"Real-time video applications over ABR using FASTRAC-a rate control algorithm","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Quality of service; Real-time computing; Adaptation (eye); Response time; File transfer; Transfer (computing); Computer network; Operating system","score_opus":0.007812773669579678,"score_gpt":0.23053751844334275,"score_spread":0.22272474477376308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136102424","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010897655,0.000058726117,0.9838697,0.00025172046,0.00014936924,0.00038436987,0.000003908723,0.0003564485,0.013835998],"genre_scores_gemma":[0.5570393,0.000043408592,0.4330445,0.0018275148,0.00037872783,0.00019617075,0.000004564912,0.0000338625,0.007431927],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986292,0.00013958033,0.00026944684,0.00042269053,0.00018385197,0.00035522357],"domain_scores_gemma":[0.99890614,0.0001964531,0.00009461982,0.00053821254,0.0001074638,0.00015708755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039204335,0.00016607958,0.0002003295,0.00006281081,0.00019396537,0.0001794027,0.00041129574,0.00007204546,0.00027948123],"category_scores_gemma":[0.000012076194,0.00015218517,0.00008295269,0.00035024533,0.00004276411,0.00034328672,0.000028952156,0.00010819288,0.00032667813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065122476,0.00014518407,0.000097718446,0.000004189039,0.00008317844,0.0000146831335,0.00005454583,0.007710162,0.007624721,0.3578365,0.002910648,0.62351197],"study_design_scores_gemma":[0.0010346917,0.000022779754,0.00023575267,0.0000055519536,0.000020869473,0.000019593506,0.000006553995,0.9742273,0.0002175644,0.001791246,0.022184739,0.00023335929],"about_ca_topic_score_codex":0.000026912812,"about_ca_topic_score_gemma":0.0000024850015,"teacher_disagreement_score":0.96651715,"about_ca_system_score_codex":0.000047540096,"about_ca_system_score_gemma":0.00012637947,"threshold_uncertainty_score":0.6205931},"labels":[],"label_agreement":null},{"id":"W2136425853","doi":"10.1109/infcom.1997.631164","title":"Queueing analysis of a distributed explicit rate allocation algorithm for ABR services","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Queueing theory; Computer science; Bounding overwatch; Computer network; Node (physics); Layered queueing network; Flow control (data); Bandwidth (computing); Distributed computing; Queue; Resource allocation; Algorithm; Asynchronous Transfer Mode; Engineering","score_opus":0.01250137678477294,"score_gpt":0.22292247174437063,"score_spread":0.21042109495959768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136425853","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041414374,0.00012677557,0.9944926,0.00068189943,0.000068145906,0.00014076858,0.000012085021,0.00011960804,0.00021668387],"genre_scores_gemma":[0.957149,0.000018144177,0.041928887,0.0003279104,0.00004133481,0.000049170165,0.00003347086,0.000003699158,0.0004483814],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923813,0.000036063342,0.00022733539,0.0002335251,0.00010975342,0.00015521451],"domain_scores_gemma":[0.99925953,0.0001394125,0.000108956345,0.00028300754,0.00015996824,0.00004912954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019442472,0.00008301538,0.0001941689,0.00012193921,0.00006180775,0.00006314647,0.00036167048,0.000036400306,0.000051469768],"category_scores_gemma":[0.0000048634934,0.00007338101,0.00011453406,0.0009780036,0.00000841367,0.00023886726,0.000033873377,0.000028337487,0.000007449092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020990917,0.000054887885,0.00011886434,0.000008220577,0.00034010658,5.912592e-7,0.00025268516,0.008583277,0.00010658349,0.023380889,0.00026943802,0.96688235],"study_design_scores_gemma":[0.00027006268,0.000031085354,0.0006624694,0.0000059223125,0.00014055296,2.653238e-7,0.000032644017,0.9972574,0.0001641966,0.00013870408,0.0012119554,0.000084701656],"about_ca_topic_score_codex":0.00004622999,"about_ca_topic_score_gemma":0.00006571823,"teacher_disagreement_score":0.98867416,"about_ca_system_score_codex":0.0000134411,"about_ca_system_score_gemma":0.0000069072817,"threshold_uncertainty_score":0.29923907},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.007654079166757839,"score_gpt":0.22581322743922286,"score_spread":0.21815914827246502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136453240","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035794713,0.001837464,0.95536166,0.0016748179,0.000988738,0.0005381879,0.0000017049323,0.0003574122,0.0034452733],"genre_scores_gemma":[0.9593784,0.000058879963,0.03774493,0.0008003398,0.00012731901,0.00009508686,0.0000037141758,0.000009095489,0.0017822351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988012,0.00009169988,0.0002339415,0.00034735198,0.00013341542,0.00039243588],"domain_scores_gemma":[0.99932545,0.00017920425,0.00005284833,0.00030949013,0.000062415165,0.000070610455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027247888,0.00014424523,0.00021406589,0.000041793824,0.0000848678,0.0001380398,0.00044869218,0.00006447633,0.0000623031],"category_scores_gemma":[0.000012631246,0.000120674595,0.000060595205,0.000368548,0.000009787216,0.00024170299,0.000030415718,0.00007479369,0.000036267887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008460445,0.00032395005,0.017891703,0.00011330335,0.00010567468,0.000012959599,0.00067868864,0.046385925,0.00016208882,0.6778495,0.02203273,0.23435888],"study_design_scores_gemma":[0.0016077973,0.00006344959,0.003536397,0.000067746114,0.0000064305655,0.0000024577093,0.00001818453,0.9123114,0.000084541585,0.0065242187,0.075495325,0.00028208536],"about_ca_topic_score_codex":0.000020320522,"about_ca_topic_score_gemma":0.00059332943,"teacher_disagreement_score":0.9235837,"about_ca_system_score_codex":0.0000132060295,"about_ca_system_score_gemma":0.00003384135,"threshold_uncertainty_score":0.49209672},"labels":[],"label_agreement":null},{"id":"W2136647855","doi":"10.1109/iccw.2009.5207974","title":"Pre-Congestion Notification Using Packet-Specific Dual Marking","year":2009,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Computer science; Computer network; Header; Network packet; IPv4; IPv6; Network congestion; Packet loss; The Internet; Encoding (memory); Explicit Congestion Notification; Operating system","score_opus":0.023476323099696994,"score_gpt":0.24485049299427863,"score_spread":0.22137416989458164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136647855","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073870376,0.00023372566,0.9196636,0.001910726,0.0004882924,0.0001722365,2.948129e-7,0.00041360778,0.00324715],"genre_scores_gemma":[0.9667775,0.000020138797,0.032002985,0.00043855564,0.0002817133,0.000003861763,0.0000030940241,0.0000049459054,0.00046719704],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884975,0.00006666256,0.00022952263,0.00037504663,0.00022797454,0.00025101667],"domain_scores_gemma":[0.99926615,0.0000612952,0.00008625699,0.00042050157,0.00008427476,0.000081542894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027438888,0.0001256488,0.00011492177,0.00008099637,0.00015598774,0.00023822472,0.00029984638,0.000069907546,0.000041609346],"category_scores_gemma":[0.000010812111,0.000118781005,0.000047689362,0.00031101753,0.000020276704,0.0005067286,0.000028879213,0.000110863046,0.000060018872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009847102,0.000036805715,0.0001267436,9.2561527e-7,0.0000042070546,0.000004582503,0.000112173286,0.002957484,0.0017364274,0.1257224,0.0009097866,0.86837864],"study_design_scores_gemma":[0.00046405874,0.00008240884,0.022105841,0.000026277537,0.00000851188,0.000042412856,0.000017537155,0.9642574,0.0004584981,0.0031616886,0.00907411,0.00030121504],"about_ca_topic_score_codex":0.0000042222687,"about_ca_topic_score_gemma":0.000002623865,"teacher_disagreement_score":0.96129996,"about_ca_system_score_codex":0.000060809598,"about_ca_system_score_gemma":0.000040231862,"threshold_uncertainty_score":0.48437488},"labels":[],"label_agreement":null},{"id":"W2136766115","doi":"10.1109/icccn.2008.ecp.95","title":"A Study of Unreserved Backup Paths for Reliable QoS under Single Link Failure","year":2008,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Backup; Computer science; Path (computing); Computer network; Computation; Distributed computing; Algorithm; Operating system","score_opus":0.04563616111819279,"score_gpt":0.2415440024908382,"score_spread":0.1959078413726454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136766115","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19206752,0.000096423275,0.8017246,0.0027621225,0.00043246752,0.00089610287,0.0000014378024,0.00025539752,0.0017638904],"genre_scores_gemma":[0.9622815,0.00000395358,0.0335703,0.00030077205,0.00016025302,0.0000627336,0.0000013093454,0.0000094855895,0.0036096883],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887186,0.000043216744,0.0002777656,0.00032893175,0.00022844812,0.00024979672],"domain_scores_gemma":[0.99891883,0.00018425498,0.000086614134,0.00052739575,0.00020492377,0.000077986784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018168446,0.00012080942,0.00021666508,0.00005469204,0.00013928117,0.000037171725,0.0005725809,0.00006082231,0.000030305455],"category_scores_gemma":[0.000023885417,0.000100231206,0.00007396608,0.00030017726,0.000029925252,0.00022859543,0.00010419582,0.00007865788,0.000018452312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045841958,0.01160057,0.00985411,0.00013456469,0.00078895,0.0001798792,0.011735884,0.10860709,0.0041017802,0.26033148,0.34061998,0.25158727],"study_design_scores_gemma":[0.025793746,0.010867048,0.008617593,0.00012919707,0.00013255126,0.00010143853,0.00433688,0.8573737,0.0020118002,0.007217487,0.08163789,0.0017806494],"about_ca_topic_score_codex":0.00003442661,"about_ca_topic_score_gemma":0.00012319995,"teacher_disagreement_score":0.77021396,"about_ca_system_score_codex":0.000018786772,"about_ca_system_score_gemma":0.0000764869,"threshold_uncertainty_score":0.40873098},"labels":[],"label_agreement":null},{"id":"W2137315096","doi":"10.1109/ipccc.2001.918630","title":"QoS-aware hierarchical multicast routing on next generation internetworks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Computer network; Distributed computing; Multicast; Protocol Independent Multicast; Distance Vector Multicast Routing Protocol; Routing protocol; Quality of service; Inter-domain; Xcast; Routing (electronic design automation)","score_opus":0.06707163603544974,"score_gpt":0.23952105234362725,"score_spread":0.1724494163081775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137315096","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01048386,0.00006889938,0.97341067,0.0038145615,0.0010302584,0.00013624845,2.9643508e-7,0.0003936202,0.010661591],"genre_scores_gemma":[0.9877698,0.00001415307,0.006659665,0.002208193,0.0011493161,0.000013700718,0.000002122304,0.000008140714,0.0021749197],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882334,0.00008317222,0.00021375435,0.00037816865,0.00021028244,0.00029128685],"domain_scores_gemma":[0.99930674,0.00013523523,0.000043786902,0.00034921453,0.000045366025,0.000119653385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013565387,0.00013422509,0.00012162122,0.00004848335,0.00013385854,0.00029166177,0.0004339094,0.00007619288,0.00035732862],"category_scores_gemma":[0.000022940165,0.00011259986,0.00006287198,0.00017411134,0.000027387274,0.0002773244,0.000093202696,0.00023882354,0.00045248808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031744457,0.00006960411,0.000054752538,8.6035755e-7,0.0000105736435,0.00001357094,0.00021118336,0.004217972,0.00006348898,0.09933356,0.012859916,0.88316137],"study_design_scores_gemma":[0.00032731227,0.00007641183,0.00005914727,0.000014680432,0.000002834561,0.000009087099,0.000010027937,0.996606,0.000032165874,0.000051789724,0.0026717617,0.00013878212],"about_ca_topic_score_codex":0.0000050858616,"about_ca_topic_score_gemma":0.000013718979,"teacher_disagreement_score":0.992388,"about_ca_system_score_codex":0.00003055972,"about_ca_system_score_gemma":0.0000072440157,"threshold_uncertainty_score":0.581597},"labels":[],"label_agreement":null},{"id":"W2137702143","doi":"10.1109/icc.2005.1494383","title":"Improved fairness algorithm to prevent tail node induced oscillations in RPR","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Workgroup; Computer science; Node (physics); Protocol (science); Throughput; Network packet; Computer network; Algorithm; Distributed computing; Engineering; Telecommunications","score_opus":0.011160251412900592,"score_gpt":0.23902368753089637,"score_spread":0.22786343611799578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137702143","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024371216,0.000028156315,0.9613072,0.010929345,0.00026787032,0.0003414332,0.0000010065722,0.00022066645,0.0025331068],"genre_scores_gemma":[0.8918479,0.0000021767082,0.104492314,0.001553733,0.00016325362,0.000067083325,9.742895e-7,0.000006030444,0.001866543],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891835,0.00004493292,0.00024188882,0.0003446047,0.00016241439,0.00028778563],"domain_scores_gemma":[0.9993367,0.000055535875,0.000036149708,0.00036980605,0.0000655733,0.0001362221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020596202,0.000116176,0.00013349742,0.000114459544,0.00006492587,0.0000968327,0.00047434095,0.000058351197,0.000049314152],"category_scores_gemma":[0.000017698245,0.00010597612,0.00003985317,0.00049753545,0.000008139392,0.00031134117,0.00012596895,0.00011200159,0.00014213781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015675549,0.00008486643,0.000040356543,7.115969e-7,0.00000454741,0.0000014750487,0.00022903948,0.0036905052,0.0004171448,0.0067029865,0.0005152393,0.9883116],"study_design_scores_gemma":[0.00042112928,0.000040466188,0.00142144,0.000009046543,0.0000021996877,0.0000028747254,0.00002254738,0.9895668,0.0003887499,0.0001819209,0.0077640633,0.00017878096],"about_ca_topic_score_codex":0.000060581813,"about_ca_topic_score_gemma":0.00043452374,"teacher_disagreement_score":0.9881328,"about_ca_system_score_codex":0.00007564795,"about_ca_system_score_gemma":0.000088558685,"threshold_uncertainty_score":0.43215805},"labels":[],"label_agreement":null},{"id":"W2137821592","doi":"10.1109/hoti.2012.16","title":"Caliper: Precise and Responsive Traffic Generator","year":2012,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Calipers; Generator (circuit theory); Computer science; Computer graphics (images); Engineering; Physics; Mechanical engineering; Power (physics)","score_opus":0.010163182960566628,"score_gpt":0.2157338263721544,"score_spread":0.2055706434115878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137821592","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77157253,0.0029712054,0.2190044,0.0023460211,0.0008141871,0.00020624266,0.0000011324975,0.00039420568,0.0026900833],"genre_scores_gemma":[0.9860037,0.000032629054,0.010869762,0.0008273972,0.00025928154,0.000015134922,3.550481e-7,0.0000044260205,0.0019872978],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992923,0.000063532316,0.00010353384,0.00017422537,0.000113356335,0.0002530404],"domain_scores_gemma":[0.99942195,0.00009436193,0.000021964799,0.00023290917,0.000037180744,0.00019165302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002216621,0.000084869695,0.000092656715,0.000036742666,0.00008009293,0.00007289686,0.0001939171,0.000042375024,0.000039981212],"category_scores_gemma":[0.000019341162,0.00006747585,0.000024506313,0.0001242333,0.000026788899,0.00034906995,0.00006165548,0.000060301903,0.00007691244],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013663942,0.000044961165,0.00038277748,0.000001813754,0.00001216529,0.000003152869,0.0007816202,0.00018325151,0.00015027737,0.06392728,0.012909028,0.92159003],"study_design_scores_gemma":[0.0018236651,0.00019484389,0.008148068,0.000017417857,0.000030368405,0.00015130245,0.00018076834,0.6778568,0.0010610268,0.0002595832,0.30951723,0.0007589464],"about_ca_topic_score_codex":0.0000015712642,"about_ca_topic_score_gemma":0.0000038259973,"teacher_disagreement_score":0.9208311,"about_ca_system_score_codex":0.000010316048,"about_ca_system_score_gemma":0.000029685212,"threshold_uncertainty_score":0.27515852},"labels":[],"label_agreement":null},{"id":"W2138183536","doi":"10.1109/icc.2012.6364592","title":"On the performance of Redundant Traffic Elimination in WLANs","year":2012,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Computer network; Ethernet; Bandwidth (computing); Frame (networking); Exploit; Bandwidth allocation; Real-time computing; Computer security","score_opus":0.011251632143460904,"score_gpt":0.2083745769092746,"score_spread":0.1971229447658137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138183536","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9733803,0.000056908186,0.020826068,0.0022850153,0.00018674778,0.00009250631,1.1412578e-7,0.000036571655,0.0031357356],"genre_scores_gemma":[0.9989101,0.000011179957,0.0004085243,0.00025582922,0.0000329173,0.000009764804,2.115911e-7,0.0000017620088,0.0003696714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950385,0.000040003404,0.00011499421,0.00007407663,0.00012630773,0.00014077836],"domain_scores_gemma":[0.9995872,0.00015071993,0.000035047673,0.00018465347,0.000019463214,0.000022966322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036871945,0.000046419787,0.000056848443,0.000040295246,0.000030900086,0.000016443708,0.00025497362,0.000019792535,0.000020626714],"category_scores_gemma":[0.0000124994585,0.00002804638,0.000024296962,0.00018362456,0.000019003555,0.0002609491,0.00001806546,0.00006439842,0.000025639196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008519421,0.00009565846,0.00050590816,0.0000031987702,0.0000036729245,1.9829267e-7,0.00061641855,0.0070862863,0.00005401999,0.6459452,0.0004908447,0.3451901],"study_design_scores_gemma":[0.0002279667,0.00010287844,0.019495431,0.00002220066,0.0000022172412,0.0000024868332,0.000044129305,0.9788715,0.00049083127,0.00007065439,0.00059731735,0.000072336756],"about_ca_topic_score_codex":0.0000016123491,"about_ca_topic_score_gemma":0.000004565239,"teacher_disagreement_score":0.97178525,"about_ca_system_score_codex":0.000012923139,"about_ca_system_score_gemma":0.0000147058945,"threshold_uncertainty_score":0.11436982},"labels":[],"label_agreement":null},{"id":"W2138432808","doi":"10.1145/1298275.1298285","title":"Performance evaluation of packet loss differentiation algorithms for wireless networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Packet loss; Wireless; Algorithm; Wireless network; Computer network; Network congestion; Network packet; Bandwidth (computing); Telecommunications","score_opus":0.025658073013728737,"score_gpt":0.27229713793652965,"score_spread":0.2466390649228009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138432808","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26419783,0.00005104026,0.7344754,0.000091038266,0.0003990942,0.00028761264,4.690703e-7,0.00005773762,0.00043983237],"genre_scores_gemma":[0.99265397,0.000016783211,0.006918044,0.00006841189,0.00018738315,0.00003148713,0.000009123369,0.0000051215197,0.00010965544],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988935,0.00003830208,0.00026508086,0.0002042386,0.0003763618,0.00022252223],"domain_scores_gemma":[0.9990419,0.00015008262,0.00012798171,0.000237794,0.00039286632,0.000049372375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016671615,0.00008848163,0.00012351798,0.00005593354,0.00007422027,0.000029837342,0.00027237626,0.00006349279,0.00001542967],"category_scores_gemma":[0.00001326989,0.000076574055,0.000053036485,0.00020640339,0.000023455099,0.0002515861,0.00003013394,0.000051124596,0.000002753527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015824004,0.000033905857,0.0018438413,0.0000048506363,0.00001338889,9.6792e-8,0.000051304258,0.010095203,0.000025598274,0.010343634,0.00015694913,0.9774154],"study_design_scores_gemma":[0.00087694725,0.000068977046,0.0240554,0.000012656653,0.000022307757,0.0000013114416,0.000009422993,0.97401017,0.00053986243,0.00022984749,0.000081323415,0.00009179402],"about_ca_topic_score_codex":0.0000022753795,"about_ca_topic_score_gemma":0.000014047521,"teacher_disagreement_score":0.9773236,"about_ca_system_score_codex":0.000035384965,"about_ca_system_score_gemma":0.000037274374,"threshold_uncertainty_score":0.31225994},"labels":[],"label_agreement":null},{"id":"W2138816454","doi":"10.1109/mascot.2008.4770565","title":"TCP over WiMAX: A Measurement Study","year":2008,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer network; Computer science; TCP Westwood plus; Zeta-TCP; WiMAX; TCP global synchronization; TCP acceleration; Throughput; TCP Friendly Rate Control; TCP Vegas; Transmission Control Protocol; Wireless; Network packet; Telecommunications","score_opus":0.0401655774558351,"score_gpt":0.2226048592541748,"score_spread":0.1824392817983397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138816454","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.114304684,0.00019150841,0.8603984,0.0011199579,0.00054587214,0.00044106712,1.267621e-7,0.00058500585,0.022413384],"genre_scores_gemma":[0.9958338,0.000004440967,0.0018829283,0.0007120655,0.00007482466,0.000022907163,5.530371e-8,0.0000034164593,0.0014655304],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888444,0.000049533715,0.00013451042,0.00024776353,0.000510197,0.00017353076],"domain_scores_gemma":[0.9994126,0.00001939816,0.000026450598,0.00037075195,0.00009482526,0.00007600732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025108166,0.00008462646,0.00010031617,0.000033833498,0.00012226243,0.00003855904,0.0004044723,0.000017640406,0.000095583026],"category_scores_gemma":[0.000010576808,0.00006707655,0.00003841925,0.00017980815,0.0000167787,0.00017011241,0.00007572633,0.00006182965,0.00017018594],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039627917,0.002421869,0.04246474,0.000004855115,0.00021874152,0.00036906236,0.00352717,0.00096623605,0.00016655582,0.07628595,0.12344803,0.75008714],"study_design_scores_gemma":[0.010444952,0.0016641741,0.3667864,0.000029575893,0.000049969032,0.00016952014,0.000325082,0.50872606,0.0001812646,0.0011876771,0.10905899,0.0013763178],"about_ca_topic_score_codex":0.00001865638,"about_ca_topic_score_gemma":0.000032540367,"teacher_disagreement_score":0.88152915,"about_ca_system_score_codex":0.000029777466,"about_ca_system_score_gemma":0.00006557286,"threshold_uncertainty_score":0.27353024},"labels":[],"label_agreement":null},{"id":"W2138999737","doi":"10.1109/icc.2011.5963498","title":"Stable Queue Management for Supporting TCP Flows over Wireless Networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Victoria","funders":"","keywords":"Active queue management; Network congestion; Wireless network; Computer science; Computer network; Wireless; Radio resource management; Network packet; Packet loss; Queue; Telecommunications","score_opus":0.017391930492120164,"score_gpt":0.22729464893977702,"score_spread":0.20990271844765684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138999737","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031225192,0.000050767274,0.96881765,0.00014667073,0.0006184244,0.00041131474,6.2370947e-7,0.00031385655,0.026518177],"genre_scores_gemma":[0.9217398,0.000017523254,0.070189446,0.0009996736,0.00016189333,0.00013309055,0.000002692179,0.00001349628,0.006742345],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987136,0.000025462277,0.00027236203,0.00037281873,0.00014273838,0.00047302168],"domain_scores_gemma":[0.99928457,0.0000576768,0.00008996028,0.00040927305,0.000051558156,0.00010695015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037638436,0.00013639902,0.0001559613,0.00004556259,0.00013053518,0.000096194395,0.0005867665,0.00005457344,0.00022847114],"category_scores_gemma":[0.0000029919713,0.00011977931,0.00008215984,0.00017533451,0.00001397662,0.00031015833,0.00015057283,0.00007419845,0.000027938891],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015757214,0.000049342758,0.00022756931,0.000012274355,0.000042473832,0.000010980578,0.00012247438,0.0016936561,0.0000032351422,0.4049055,0.010063828,0.5828529],"study_design_scores_gemma":[0.0005638475,0.000044590353,0.00039190624,0.000012390859,0.000013556985,0.0000020558816,0.000036015746,0.98456454,0.00003632837,0.0014442485,0.012709105,0.00018141247],"about_ca_topic_score_codex":0.000027728529,"about_ca_topic_score_gemma":0.000047375826,"teacher_disagreement_score":0.9828709,"about_ca_system_score_codex":0.000021418748,"about_ca_system_score_gemma":0.000018087458,"threshold_uncertainty_score":0.48844585},"labels":[],"label_agreement":null},{"id":"W2139079053","doi":"10.1007/s11235-009-9201-x","title":"A new structure-preserving method of sampling for predicting self-similar traffic","year":2009,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Autoregressive integrated moving average; Sampling (signal processing); Internet traffic; Data mining; Self-similarity; Systematic sampling; Stratified sampling; Bandwidth (computing); Traffic generation model; Real-time computing; The Internet; Time series; Statistics; Machine learning; Computer network; Telecommunications; Detector; Mathematics","score_opus":0.027796069818095452,"score_gpt":0.29910364441144,"score_spread":0.27130757459334454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139079053","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042298497,0.0015734915,0.9914767,0.0010232663,0.00025123497,0.00064324995,0.000004076257,0.00045291902,0.0003452069],"genre_scores_gemma":[0.58409667,0.000020117755,0.4156321,0.00006427815,0.00011665175,0.000016085765,0.000005560633,0.000006960741,0.000041548938],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983956,0.00026827006,0.000583337,0.00027934366,0.00022039715,0.00025306008],"domain_scores_gemma":[0.99727136,0.00070950686,0.00040218807,0.0013069857,0.00021260949,0.000097337965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009205797,0.00014941319,0.000322622,0.000108864886,0.00019089665,0.00013624868,0.0017800038,0.00010144091,0.000004048807],"category_scores_gemma":[0.000084133055,0.00014692648,0.0000940266,0.00037186325,0.0000074535715,0.00031920013,0.000098218574,0.00016002721,0.000001412005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017660974,0.000047895795,0.000077555655,0.00006069975,0.00007519888,1.6823707e-7,0.0020578995,0.14704438,0.0014681068,0.040725216,0.0011297077,0.8072955],"study_design_scores_gemma":[0.000623897,0.00009859174,0.00029497955,0.00009068241,0.000023560146,0.00001573986,0.00010154379,0.9896876,0.00014807498,0.00074515416,0.008017047,0.00015312378],"about_ca_topic_score_codex":0.000025108353,"about_ca_topic_score_gemma":0.0000104913815,"teacher_disagreement_score":0.8426432,"about_ca_system_score_codex":0.000048430808,"about_ca_system_score_gemma":0.00012581058,"threshold_uncertainty_score":0.5991488},"labels":[],"label_agreement":null},{"id":"W2139159357","doi":"10.1109/glocom.2008.ecp.286","title":"An End-to-End Performance Inference Technique for Peer-to-Peer Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"End-to-end principle; Computer science; Quality of service; Computer network; Inference; Peer-to-peer; End user; Simulated annealing; Distributed computing; Artificial intelligence; World Wide Web; Machine learning","score_opus":0.01922622926410862,"score_gpt":0.2603689346952663,"score_spread":0.24114270543115768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139159357","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010076831,0.000016764507,0.98170584,0.0039381995,0.00037847075,0.0008283049,0.0000026004434,0.00047113802,0.0025818413],"genre_scores_gemma":[0.8473032,0.0000092389355,0.14407198,0.0027950413,0.00029109503,0.000448206,0.000005937511,0.000013567594,0.005061695],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981323,0.000039732684,0.00027187009,0.00055588013,0.0004606482,0.0005395705],"domain_scores_gemma":[0.99819434,0.00016778044,0.000050914383,0.0007278329,0.00049202965,0.00036711877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005863139,0.00021151094,0.00021981602,0.00012550646,0.00030994497,0.0001264053,0.0012044461,0.00011259128,0.000068866],"category_scores_gemma":[0.00006309826,0.00018765611,0.00006489984,0.0005302188,0.000042267093,0.0005261962,0.00013384424,0.0001840503,0.00008837106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059435155,0.00012838877,0.0019574198,0.000007961772,0.0000192321,0.0000117871805,0.00055820367,0.096502736,0.00044142365,0.039890002,0.037568085,0.8228553],"study_design_scores_gemma":[0.00036650422,0.00062596035,0.0033533394,0.000020715348,0.0000052980254,0.00003709801,0.000009637776,0.92235595,0.0011355432,0.00012876408,0.071549356,0.00041185398],"about_ca_topic_score_codex":0.000015889316,"about_ca_topic_score_gemma":0.00002708237,"teacher_disagreement_score":0.83763385,"about_ca_system_score_codex":0.000037316502,"about_ca_system_score_gemma":0.00011432664,"threshold_uncertainty_score":0.7652395},"labels":[],"label_agreement":null},{"id":"W2139180708","doi":"10.1109/fpt.2004.1393316","title":"An FPGA implementation of a modified version of RED algorithm","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Random early detection; Network packet; Field-programmable gate array; Baud; Algorithm; Network congestion; Parallel computing; Computer network; Embedded system; Active queue management; Telecommunications","score_opus":0.010208051911891001,"score_gpt":0.26498842201069855,"score_spread":0.25478037009880755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139180708","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041573394,0.000019408564,0.9565917,0.0006169148,0.000063552216,0.0000900079,0.0000020407922,0.000053262334,0.0009896943],"genre_scores_gemma":[0.92685485,0.0000050757094,0.072951205,0.000077747725,0.000036024274,0.0000027006454,0.0000031965808,0.0000017309362,0.00006744643],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944353,0.00002979379,0.00017648935,0.000121047175,0.00014460066,0.0000845425],"domain_scores_gemma":[0.99958223,0.00002022272,0.00007747777,0.00020964324,0.00007460354,0.00003581603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012805022,0.00004448462,0.00008355775,0.000044941193,0.000020321699,0.0000092772425,0.00023705943,0.000021447977,0.00008092689],"category_scores_gemma":[0.0000011736557,0.000040074883,0.000028544871,0.00012630751,0.000012398156,0.00027683764,0.000024168949,0.0000227095,0.0000047738545],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042517727,0.000034180302,0.00003786045,0.0000012856302,0.0000055451096,1.7700032e-7,0.00011472095,0.0015099028,0.0011047072,0.005938844,0.0005108257,0.9907377],"study_design_scores_gemma":[0.00096877775,0.00016584065,0.0018334474,0.0000039460188,0.0000059422873,9.673352e-7,0.00010251666,0.9763013,0.019580029,0.0002105857,0.0007640645,0.000062573665],"about_ca_topic_score_codex":0.000040368344,"about_ca_topic_score_gemma":0.00002069791,"teacher_disagreement_score":0.99067515,"about_ca_system_score_codex":0.000010676918,"about_ca_system_score_gemma":0.000031250354,"threshold_uncertainty_score":0.16342063},"labels":[],"label_agreement":null},{"id":"W2139338331","doi":"10.1109/surv.2010.040710.00078","title":"A Survey of PCN-Based Admission Control and Flow Termination","year":2010,"lang":"en","type":"article","venue":"IEEE Communications Surveys & Tutorials","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada); Nortel (Canada)","funders":"","keywords":"Computer science; Standardization; Admission control; Computer network; Flow control (data); Function (biology); Process (computing); Network congestion; Quality of service; Network packet; Operating system","score_opus":0.03047652438322616,"score_gpt":0.2878048703507955,"score_spread":0.2573283459675693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139338331","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09701207,0.00067716464,0.89302236,0.0026648338,0.004696004,0.00088148593,0.00014940473,0.00031803056,0.00057866256],"genre_scores_gemma":[0.986585,0.000037986007,0.012984074,0.00009074266,0.00012678641,0.000057506648,0.000042620777,0.0000118019225,0.00006343274],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995635,0.0030525483,0.0005425,0.000293343,0.00027237934,0.00020428291],"domain_scores_gemma":[0.9922604,0.0042197844,0.00032677202,0.0023135815,0.00073572935,0.00014373215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072618662,0.00016563758,0.00034969792,0.00013732749,0.0002554627,0.00011955665,0.0016580776,0.0001535711,0.000013863716],"category_scores_gemma":[0.0012748021,0.00015832741,0.000058331047,0.0004490914,0.00024037794,0.000291456,0.00012694593,0.0002827836,0.000011304193],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045462566,0.00045330828,0.017354101,0.000019070045,0.00006115791,0.0000013010163,0.0002893055,0.000563513,0.025755389,0.008102302,0.0014541436,0.9459009],"study_design_scores_gemma":[0.0024036,0.00010016837,0.2552886,0.00004038485,0.000029508436,0.0000034432314,0.0000045813504,0.73547995,0.0010206312,0.00037238764,0.004937942,0.00031880784],"about_ca_topic_score_codex":0.00042428644,"about_ca_topic_score_gemma":0.0016742129,"teacher_disagreement_score":0.94558215,"about_ca_system_score_codex":0.000018122219,"about_ca_system_score_gemma":0.00033120887,"threshold_uncertainty_score":0.64564043},"labels":[],"label_agreement":null},{"id":"W2139613469","doi":"10.1109/ccece.2005.1556915","title":"Comparison between BECN-capable TCP new-Reno and TCP Vegas","year":2006,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Zeta-TCP; TCP Vegas; TCP Westwood; Compound TCP; Computer network; Computer science; TCP global synchronization; TCP acceleration; TCP Friendly Rate Control; TCP Westwood plus; TCP hole punching; TCP tuning; H-TCP; Bottleneck; Transmission Control Protocol; Network packet; Embedded system","score_opus":0.01590366185377781,"score_gpt":0.2457551937119747,"score_spread":0.2298515318581969,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139613469","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032797337,0.0008015002,0.923653,0.0048100906,0.00028769867,0.0001656049,0.0000010655889,0.000475946,0.037007723],"genre_scores_gemma":[0.9682529,0.000005807845,0.016272102,0.0003618082,0.0004891793,0.0000045885427,0.000003890108,0.000007515001,0.014602217],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988025,0.000038968145,0.00026881974,0.0003592675,0.00021227954,0.00031820041],"domain_scores_gemma":[0.9992688,0.00013453371,0.000068971385,0.00032784435,0.00004021362,0.00015964934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014918721,0.00014687424,0.00024859293,0.000058629576,0.0001324731,0.00023900255,0.0004221678,0.00007201922,0.00008041545],"category_scores_gemma":[0.000005770272,0.00012885682,0.000042133535,0.00022312775,0.00004205247,0.00028448296,0.00011667723,0.0001273082,0.00015696055],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052128594,0.000053869793,0.039264064,0.000004664516,0.000023702816,0.000004808104,0.00009648585,0.0011306346,0.00005295614,0.15476583,0.18029381,0.62430394],"study_design_scores_gemma":[0.0027221532,0.00025336994,0.09176671,0.000033753244,0.0000555727,0.000016860384,0.00004015243,0.40237695,0.0006766765,0.013326724,0.4879123,0.00081878685],"about_ca_topic_score_codex":0.00044824975,"about_ca_topic_score_gemma":0.00013722754,"teacher_disagreement_score":0.93545556,"about_ca_system_score_codex":0.000016904163,"about_ca_system_score_gemma":0.0000622042,"threshold_uncertainty_score":0.52546287},"labels":[],"label_agreement":null},{"id":"W2139810283","doi":"10.1109/glocom.2004.1378278","title":"An enhanced algorithm for fair traffic conditioning in differentiated services networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Differentiated services; Quality of service; Computer network; Network packet; Bandwidth (computing); Fairness measure; Packet loss; Service (business); Max-min fairness; Algorithm; Throughput; Telecommunications","score_opus":0.00541106987680708,"score_gpt":0.22902576536244829,"score_spread":0.2236146954856412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139810283","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061147805,0.00010032082,0.93723303,0.0004384029,0.00022581882,0.00028138488,0.0000018393806,0.00041089568,0.0001605152],"genre_scores_gemma":[0.94194514,0.0000096471185,0.056698143,0.00070854725,0.0002742121,0.00009836934,0.000037162303,0.000009586927,0.00021919831],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988075,0.000052554475,0.00026402276,0.00039474518,0.00011869591,0.0003624658],"domain_scores_gemma":[0.99939656,0.000098888086,0.00006789182,0.00027062008,0.00006336236,0.00010265804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001564049,0.00014884074,0.00018263518,0.000083297506,0.000116077674,0.00019384934,0.0005326529,0.000087945074,0.000048920127],"category_scores_gemma":[0.0000014453366,0.00013821195,0.000054381362,0.00025690114,0.000017467253,0.00067551737,0.000028699162,0.000107724394,0.000013780689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004485213,0.00008249193,0.000014016482,0.0000024030192,0.000008684583,7.847916e-7,0.0001539184,0.15233442,0.000044710836,0.002234945,0.00008382293,0.8450353],"study_design_scores_gemma":[0.0012000444,0.00008071802,0.0007271828,0.000020129095,0.000005174248,0.0000017006564,0.00004841879,0.997013,0.00015499366,0.000107783606,0.00045708747,0.00018376572],"about_ca_topic_score_codex":0.000006213031,"about_ca_topic_score_gemma":0.00038658894,"teacher_disagreement_score":0.8807973,"about_ca_system_score_codex":0.000030443975,"about_ca_system_score_gemma":0.000020427296,"threshold_uncertainty_score":0.563612},"labels":[],"label_agreement":null},{"id":"W2140021397","doi":"10.1109/milcom.1998.726930","title":"A framework of flow control in high-speed ATM wide area networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Asynchronous Transfer Mode; Flow control (data); Queueing theory; ATM adaptation layer; Scheduling (production processes); Queuing delay; Statistical time division multiplexing; Multiplexing; Real-time computing; Distributed computing; Engineering; Telecommunications","score_opus":0.011103188202630303,"score_gpt":0.19790589604387576,"score_spread":0.18680270784124545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140021397","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005029588,0.0006087552,0.98796695,0.0033080638,0.00044725114,0.00021577276,9.582709e-7,0.00017034987,0.0022523315],"genre_scores_gemma":[0.97404015,0.000053366675,0.022974908,0.0023130225,0.00009781427,0.000012927445,6.3104164e-7,0.0000083407585,0.00049881043],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857193,0.0000937575,0.00038133113,0.00034270153,0.00023033615,0.00037995577],"domain_scores_gemma":[0.9985012,0.00068994745,0.00010086245,0.0005353025,0.00006380719,0.00010892071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023173915,0.00016269746,0.00034137454,0.000084861866,0.000041492556,0.000058433387,0.00065005105,0.00015032293,0.00036255587],"category_scores_gemma":[0.00006807248,0.00014136524,0.000085931046,0.00055426435,0.00005106135,0.00020933435,0.00006138832,0.00026408315,0.000052347033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041626678,0.00025755362,0.010451013,0.0000061578185,0.000059125217,0.000053416305,0.00028709034,0.431695,0.0000117809695,0.14636193,0.012119551,0.39865574],"study_design_scores_gemma":[0.0012690675,0.000066633394,0.0021232525,0.000047156358,0.0000069144003,0.0000032502794,0.0000061262735,0.99339396,0.000004802397,0.0020787644,0.000843456,0.00015662743],"about_ca_topic_score_codex":0.000027442864,"about_ca_topic_score_gemma":0.0000382513,"teacher_disagreement_score":0.9690106,"about_ca_system_score_codex":0.00002566427,"about_ca_system_score_gemma":0.000013461577,"threshold_uncertainty_score":0.5764707},"labels":[],"label_agreement":null},{"id":"W2140121233","doi":"10.1109/ccece.2003.1226202","title":"The effect of reordering and dropping packets on TCP over a slow wireless link","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer network; TCP Westwood plus; Computer science; TCP Friendly Rate Control; TCP acceleration; TCP global synchronization; Zeta-TCP; TCP tuning; Sack; TCP delayed acknowledgment; CUBIC TCP; Network packet; TCP Westwood; Transmission Control Protocol; Wireless network; TCP Vegas; Network congestion; Wireless; Engineering; Telecommunications","score_opus":0.0037045525317172014,"score_gpt":0.20546743367641898,"score_spread":0.20176288114470178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140121233","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7951867,0.00024624472,0.19924581,0.002766783,0.0002603711,0.00018252619,1.4021889e-7,0.00012063964,0.001990802],"genre_scores_gemma":[0.9991966,0.000038574082,0.00037764592,0.00017267944,0.000059429283,0.000008027544,8.1027174e-8,0.000004090971,0.00014287319],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936056,0.000048213904,0.00011787474,0.00017599281,0.00014116945,0.00015618908],"domain_scores_gemma":[0.9992842,0.00035781652,0.000044526576,0.00025115575,0.00001802356,0.000044283093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027656584,0.00008525965,0.00011368543,0.0000226818,0.00012770495,0.00007929044,0.0002369756,0.00003201784,0.0000017768888],"category_scores_gemma":[0.000020844278,0.00005078087,0.00003478247,0.00011802197,0.00004370093,0.00008807222,0.00006778305,0.000089744004,0.0000057171546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020615238,0.000005061395,0.0002458638,0.0000075768476,0.000014364009,0.000004173525,0.00008161996,0.0010662599,0.00029150918,0.08438199,0.00005790675,0.91382307],"study_design_scores_gemma":[0.009116938,0.0028876823,0.012518882,0.0006817677,0.000040864026,0.00004761771,0.000041795658,0.9412529,0.020112295,0.006747122,0.0057641948,0.00078795967],"about_ca_topic_score_codex":0.000008765988,"about_ca_topic_score_gemma":0.000011702252,"teacher_disagreement_score":0.9401866,"about_ca_system_score_codex":0.0000126296,"about_ca_system_score_gemma":0.000017378161,"threshold_uncertainty_score":0.20707838},"labels":[],"label_agreement":null},{"id":"W2140138271","doi":"10.1109/4234.823539","title":"Worst-case performance of a buffer with independent shaped arrival processes","year":2000,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Asynchronous Transfer Mode; Computer network; Quality of service; Byte; Asynchronous communication; Network packet; Internet traffic; Buffer overflow; Bandwidth (computing); Buffer (optical fiber); Distributed computing; The Internet; Telecommunications","score_opus":0.016391208593807258,"score_gpt":0.2234987777729246,"score_spread":0.20710756917911732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140138271","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9083123,0.00026482073,0.082401514,0.0077329655,0.000054583536,0.00024287883,0.0000025783759,0.00015788112,0.00083045283],"genre_scores_gemma":[0.9839026,0.00014683233,0.014398347,0.0013249652,0.000029753617,0.000079400044,0.0000026509974,0.000009180222,0.000106294705],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907386,0.00007711744,0.00024056435,0.00020732904,0.00020659892,0.00019450422],"domain_scores_gemma":[0.99787253,0.00016769792,0.00009900493,0.0016830346,0.00011257651,0.00006513642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015151409,0.00012669127,0.00015016954,0.000073573145,0.00022568539,0.00006645054,0.0016980403,0.00003433885,0.000033328128],"category_scores_gemma":[0.000006357667,0.00010879471,0.000033020915,0.000504978,0.00017761912,0.0003879517,0.000080373684,0.0002027406,0.000040756033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023913821,0.00084263843,0.005742678,0.00015561774,0.0002769036,0.00018223922,0.0049361233,0.022588247,0.0027059785,0.005336476,0.0023025759,0.9546914],"study_design_scores_gemma":[0.0042114635,0.0006107675,0.0050538466,0.00055704144,0.00014991013,0.0025428925,0.0001754072,0.9625369,0.0015176899,0.00014246679,0.021157125,0.0013445346],"about_ca_topic_score_codex":0.000022123373,"about_ca_topic_score_gemma":0.00006893953,"teacher_disagreement_score":0.95334685,"about_ca_system_score_codex":0.000023334644,"about_ca_system_score_gemma":0.00009077828,"threshold_uncertainty_score":0.44365194},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04610366903569576,"score_gpt":0.27204982972925246,"score_spread":0.2259461606935567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140490525","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24834807,0.00018950888,0.74971277,0.0005393955,0.00032316754,0.00017062556,0.0000017859022,0.0003090939,0.0004055655],"genre_scores_gemma":[0.99265385,0.00069670397,0.0052349186,0.00056307885,0.000309274,0.000051933057,0.0000029867633,0.000022447502,0.00046479816],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826276,0.000078167155,0.00034716405,0.00054558093,0.00031671015,0.00044959874],"domain_scores_gemma":[0.99911386,0.00010707763,0.000045010678,0.00050562544,0.00006632223,0.00016211029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027954296,0.00023312707,0.00021902287,0.000115447445,0.00059287355,0.00018947771,0.00047998177,0.000134861,0.000058623984],"category_scores_gemma":[0.0000026393982,0.00023697714,0.0000871055,0.00043875413,0.000022468557,0.0005863941,0.000007765963,0.0003731343,0.000049632516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020884763,0.000026823598,0.000009727057,0.0000037062111,0.000011279786,0.0000012084495,0.00013516059,0.5923687,0.000014844653,0.000045936034,0.000047898735,0.40731382],"study_design_scores_gemma":[0.00051033986,0.000074176955,0.000012891443,0.000055299854,0.000027468655,0.000019986297,0.0000066610237,0.9972359,0.00007588955,0.0007601094,0.00095961074,0.00026166378],"about_ca_topic_score_codex":0.0000041393246,"about_ca_topic_score_gemma":0.000008454645,"teacher_disagreement_score":0.74447787,"about_ca_system_score_codex":0.000053099837,"about_ca_system_score_gemma":0.000066089786,"threshold_uncertainty_score":0.96636474},"labels":[],"label_agreement":null},{"id":"W2140556713","doi":"10.1109/cnsr.2011.18","title":"Characterization of the IntelRate Controller for High-Speed Networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Robustness (evolution); Bottleneck; Computer science; Control theory (sociology); Latency (audio); Bandwidth (computing); Network packet; PID controller; Packet loss; Controller (irrigation); Real-time computing; Control engineering; Computer network; Control (management); Embedded system; Engineering; Telecommunications","score_opus":0.016518895937317396,"score_gpt":0.18917276585034387,"score_spread":0.17265386991302648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140556713","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021896359,0.000011099287,0.9756213,0.00048939564,0.00066636415,0.00035275638,0.0000012057383,0.00006859793,0.00089294754],"genre_scores_gemma":[0.9960485,0.0000045797115,0.0019784635,0.0006774718,0.00008829989,0.000020918398,0.0000014411144,0.0000046123564,0.0011757036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994116,0.000039791958,0.00019051014,0.00014564731,0.00007591029,0.00013656427],"domain_scores_gemma":[0.9994378,0.00005801805,0.00011986886,0.00024419208,0.00011174146,0.000028388959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001630169,0.000072251074,0.00012534409,0.000019085428,0.00005856406,0.000023138891,0.0004940121,0.000043295768,0.000033128606],"category_scores_gemma":[0.000012904418,0.000044142114,0.000063913176,0.00014782342,0.00003183547,0.0001461755,0.00005990864,0.000046126897,0.00000439456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007545746,0.00005702294,0.00032256945,0.0000034524517,0.000042619165,1.9194944e-7,0.00024738873,0.0003510317,0.005019397,0.7399138,0.0004030406,0.25356397],"study_design_scores_gemma":[0.0010052461,0.0000700417,0.012117826,0.000011254352,0.000013562215,0.0000010027292,0.0000054535526,0.9808425,0.0034064124,0.0016576358,0.00077180006,0.00009731675],"about_ca_topic_score_codex":0.00000731519,"about_ca_topic_score_gemma":0.0000048807638,"teacher_disagreement_score":0.9804914,"about_ca_system_score_codex":0.000005776988,"about_ca_system_score_gemma":0.000016578191,"threshold_uncertainty_score":0.18000631},"labels":[],"label_agreement":null},{"id":"W2140603858","doi":"10.1109/lcn.1996.558156","title":"A simulation study of usage-based pricing strategies for packet-switched networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Dynamic pricing; Revenue; Bandwidth (computing); Network packet; Computer network; Pricing strategies; Microeconomics; Economics","score_opus":0.034523229533678375,"score_gpt":0.261083360021032,"score_spread":0.22656013048735363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140603858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08374967,0.000052257154,0.91475654,0.0001362081,0.0001253654,0.0005739527,1.986747e-7,0.00015470502,0.00045111924],"genre_scores_gemma":[0.99277586,7.398337e-7,0.006824168,0.00015525887,0.00007236517,0.00004322802,6.223486e-7,0.000006298298,0.00012147639],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906796,0.000057253743,0.00026211268,0.00024830698,0.0001690684,0.0001953011],"domain_scores_gemma":[0.99876595,0.00065044273,0.0001131413,0.00030855584,0.00011780608,0.000044131444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022309397,0.00010777924,0.00017175695,0.00005946293,0.00013886532,0.00008588192,0.00029654166,0.000044110024,0.000026044887],"category_scores_gemma":[0.000022858514,0.000091342255,0.000052011474,0.000289694,0.000014138563,0.00027855023,0.00003706761,0.000059100206,0.000002235668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010795675,0.00023356956,0.0003598858,0.0000045338575,0.000014987983,7.8952473e-7,0.00056149106,0.88619924,0.000006892467,0.005129313,0.00007250128,0.10740599],"study_design_scores_gemma":[0.0014597677,0.00040758878,0.00046042187,0.000008455703,0.000013513418,1.3681024e-7,0.0002706083,0.99695146,0.0000058978235,0.00021987334,0.000097648975,0.00010461381],"about_ca_topic_score_codex":0.000010668579,"about_ca_topic_score_gemma":0.000040377163,"teacher_disagreement_score":0.9090262,"about_ca_system_score_codex":0.000013236299,"about_ca_system_score_gemma":0.000020049627,"threshold_uncertainty_score":0.37248293},"labels":[],"label_agreement":null},{"id":"W2140630780","doi":"10.1109/jsac.2004.836005","title":"On Designing Self-Tuning Controllers for AQM Routers Supporting TCP Flows Based on Pole Placement","year":2004,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Active queue management; Control theory (sociology); Controller (irrigation); Computer science; Full state feedback; Network packet; Queue; Bar (unit); PID controller; Network congestion; Physics; Computer network; Control engineering; Engineering; Control (management)","score_opus":0.023115070525951815,"score_gpt":0.2809371955891734,"score_spread":0.2578221250632216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140630780","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016906835,0.00007434375,0.9676294,0.012531887,0.0004994197,0.0007822056,0.0000054010065,0.00028761613,0.0012829109],"genre_scores_gemma":[0.91480607,0.000036789497,0.08217266,0.0026791291,0.00010398188,0.00013912005,0.000009217035,0.000025486559,0.00002754563],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975161,0.00045539427,0.0007092029,0.00032937212,0.00042659917,0.0005633343],"domain_scores_gemma":[0.9957473,0.002153559,0.00047763443,0.0010864625,0.0003193054,0.00021573207],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012086175,0.00026270445,0.00032575583,0.00047229225,0.0009394223,0.00031460685,0.0017237889,0.000101532154,0.0000075161847],"category_scores_gemma":[0.00031578814,0.00025194237,0.0001511756,0.00074304844,0.000033922206,0.00024885847,0.00005061513,0.00090865843,0.00001576779],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027123955,0.0007271151,0.00011232849,0.00000445857,0.000088259774,0.000014236273,0.00068407774,0.9563928,0.00046481114,0.014545043,0.0008348082,0.02586082],"study_design_scores_gemma":[0.006528162,0.0008782612,0.00017361119,0.00042412657,0.000028807835,0.000024289964,0.00008946303,0.9888647,0.00028113893,0.0012280729,0.0011724228,0.00030689858],"about_ca_topic_score_codex":0.000008001813,"about_ca_topic_score_gemma":0.00006018543,"teacher_disagreement_score":0.8978992,"about_ca_system_score_codex":0.0006735737,"about_ca_system_score_gemma":0.00062846293,"threshold_uncertainty_score":0.99999326},"labels":[],"label_agreement":null},{"id":"W2140754467","doi":"10.1109/ccece.2005.1557145","title":"Performance of weighted fair queuing systems with long range dependent traffic inputs","year":2006,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Weighted fair queueing; Computer science; Queueing theory; Queue; Bulk queue; Queue management system; Computer network","score_opus":0.00462002690152503,"score_gpt":0.17295626110471748,"score_spread":0.16833623420319246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140754467","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7155684,0.00031248174,0.28010577,0.0001557713,0.00029097602,0.0002246648,5.419554e-7,0.0002679207,0.0030734374],"genre_scores_gemma":[0.9963474,0.00001057027,0.0019116567,0.000042436022,0.00010965475,0.000023108758,0.0000016766603,0.000008711744,0.0015447466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873585,0.00004996302,0.00029507838,0.0002903471,0.0003585723,0.0002701968],"domain_scores_gemma":[0.99929756,0.00005639596,0.00012530401,0.0003411878,0.00012227049,0.00005727912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020743562,0.00014770772,0.00022159131,0.00008805967,0.0000787762,0.000084043386,0.00045172384,0.000054483127,0.000009528772],"category_scores_gemma":[0.0000011620676,0.00010745676,0.000038285314,0.0003224513,0.000037723268,0.00035274494,0.000041487438,0.000095515796,0.000020375395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018480992,0.00041953838,0.05462509,0.00025993114,0.00013450912,0.0001154666,0.00036614842,0.58641624,0.00018746445,0.04325515,0.0016770688,0.31235856],"study_design_scores_gemma":[0.0008999194,0.00014846456,0.004561963,0.000089270245,0.0000122016645,0.000045211767,0.000011780518,0.9936383,0.00018517397,0.0000037236434,0.00022265347,0.0001813653],"about_ca_topic_score_codex":0.000059033824,"about_ca_topic_score_gemma":0.0001437923,"teacher_disagreement_score":0.407222,"about_ca_system_score_codex":0.000031137886,"about_ca_system_score_gemma":0.00006236854,"threshold_uncertainty_score":0.43819594},"labels":[],"label_agreement":null},{"id":"W2140933144","doi":"10.1109/icc.1998.682678","title":"Estimation and prediction of VBR traffic in high-speed networks using LMS filters","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Network traffic control; Computer science; Variable bitrate; Computer network; Statistical time division multiplexing; Bandwidth (computing); Network congestion; Broadband networks; Bandwidth allocation; Real-time computing; Dynamic bandwidth allocation; Multiplexing; Network packet; Integrated Services Digital Network; Broadband; Quality of service; Telecommunications","score_opus":0.018005080425794365,"score_gpt":0.20034545801743656,"score_spread":0.18234037759164218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140933144","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41302827,0.00015640045,0.5861435,0.00019220504,0.00017887521,0.000095792486,4.7623448e-7,0.00007471502,0.00012975317],"genre_scores_gemma":[0.9866602,0.00003309889,0.013126449,0.00006804858,0.000040595005,0.0000021272076,0.0000014012843,0.0000037456366,0.00006436842],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993003,0.00004179295,0.00022170883,0.00019336297,0.00009883956,0.00014399474],"domain_scores_gemma":[0.9996522,0.0000638808,0.00006525205,0.00015125272,0.000024071047,0.00004330834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013942437,0.00007897257,0.00012427848,0.0000893821,0.000038043298,0.000041690786,0.00012856547,0.000057093344,0.000024072808],"category_scores_gemma":[0.000008254094,0.000074453936,0.000019547648,0.00028487528,0.000031975524,0.00032686116,0.000027221577,0.00007402189,0.0000020192274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025880588,0.00002153709,0.00022990679,0.0000026021978,0.000003614016,0.0000011555758,0.00010496372,0.6137634,0.00003303087,0.0023383468,0.00013895213,0.38335988],"study_design_scores_gemma":[0.0005530679,0.000043597185,0.002527831,0.000025120667,0.000005371815,0.0000069459334,0.000009481495,0.9966838,0.0000120034865,0.00005516966,0.00001657525,0.00006105548],"about_ca_topic_score_codex":0.000018716295,"about_ca_topic_score_gemma":0.00001170761,"teacher_disagreement_score":0.5736319,"about_ca_system_score_codex":0.000020370895,"about_ca_system_score_gemma":0.000006493304,"threshold_uncertainty_score":0.30361432},"labels":[],"label_agreement":null},{"id":"W2141003964","doi":"10.1109/ccece.2004.1349688","title":"Distributed QoS constrained multicast algorithms","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Multicast; Computer science; Steiner tree problem; Heuristics; Distributed computing; Computer network; Quality of service; The Internet; Routing (electronic design automation); Distributed algorithm; Protocol Independent Multicast; Mathematical optimization; Mathematics; World Wide Web","score_opus":0.010187071401452056,"score_gpt":0.22356614789921062,"score_spread":0.21337907649775856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141003964","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010305094,0.00003139631,0.989088,0.0049169194,0.0004233312,0.0001241852,0.0000056423505,0.0004996593,0.0038803525],"genre_scores_gemma":[0.918301,0.0000030632486,0.080661036,0.00065255,0.00013880045,0.000012522983,0.0000064501646,0.000003990907,0.00022061147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991459,0.000018115234,0.00015862484,0.00026169792,0.0001577595,0.00025786893],"domain_scores_gemma":[0.9994117,0.000054241547,0.000032010164,0.0002986214,0.000069311696,0.00013410424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009385914,0.000106310894,0.00011475347,0.000029298426,0.00008777353,0.000106114814,0.00042139343,0.000045728655,0.000050210736],"category_scores_gemma":[0.000021188394,0.0000889651,0.00005235999,0.00023317702,0.000064529166,0.00019013211,0.00006415688,0.00008784675,0.00021205872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003435019,0.000090788155,0.000028285187,0.0000015438421,0.000020594258,0.00004907708,0.0000604811,0.0029097085,0.00008710067,0.63654417,0.0008795165,0.3593253],"study_design_scores_gemma":[0.005610413,0.0001798186,0.00090978504,0.00002899585,0.00001684058,0.00014020318,0.00012669267,0.96597284,0.0008157528,0.0067910715,0.018814921,0.00059266307],"about_ca_topic_score_codex":0.000019381685,"about_ca_topic_score_gemma":0.000010233007,"teacher_disagreement_score":0.9630631,"about_ca_system_score_codex":0.00004990039,"about_ca_system_score_gemma":0.00008486305,"threshold_uncertainty_score":0.36278912},"labels":[],"label_agreement":null},{"id":"W2141338028","doi":"10.1109/glocom.2005.1577786","title":"Call level service differentiation for efficient SLA management","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Toronto","funders":"","keywords":"Service-level agreement; Computer science; Bandwidth (computing); Quality of service; Service level; Computer network; Preemption; Shared resource; Differentiated services; Service (business); Distributed computing; Operating system; Business","score_opus":0.034292673773368296,"score_gpt":0.2707770062553197,"score_spread":0.2364843324819514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141338028","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005754035,0.0004377677,0.9503406,0.022687307,0.00091468403,0.0014056724,0.00020334986,0.00064110773,0.01761545],"genre_scores_gemma":[0.86576724,0.00027029705,0.12892044,0.0024868168,0.00019600095,0.0005092162,0.0001598107,0.000020386138,0.0016697646],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968033,0.00022022126,0.00081442215,0.00077254564,0.00047083374,0.00091866584],"domain_scores_gemma":[0.99618834,0.00018713257,0.00034556497,0.002363201,0.0006018859,0.00031387364],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047461546,0.00045651285,0.0004305971,0.00015968185,0.0007182444,0.00048785293,0.0036292446,0.00020045499,0.0000809927],"category_scores_gemma":[0.000021835405,0.0004748891,0.0002165999,0.0008202193,0.00008714304,0.00041258862,0.00050042744,0.00027673077,0.00044133054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003319412,0.0006974737,0.00009720861,0.000034721597,0.00018322104,0.0000019400045,0.00016885101,0.019605936,0.000033538094,0.3052239,0.05030944,0.62361056],"study_design_scores_gemma":[0.0019502223,0.000059024398,0.002971039,0.00006274551,0.000092031296,0.00002351708,0.000051376763,0.793591,0.000049899154,0.0017503265,0.1988231,0.00057567476],"about_ca_topic_score_codex":0.0000923825,"about_ca_topic_score_gemma":0.00186728,"teacher_disagreement_score":0.86001325,"about_ca_system_score_codex":0.0004765392,"about_ca_system_score_gemma":0.0002541883,"threshold_uncertainty_score":0.9997703},"labels":[],"label_agreement":null},{"id":"W2141453769","doi":"10.1109/icc.2005.1495082","title":"A novel flow control scheme for improving TCP fairness and throughput over heterogeneous networks with wired and wireless links","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer network; TCP Westwood plus; Computer science; TCP Friendly Rate Control; TCP global synchronization; TCP acceleration; TCP tuning; Network congestion; Zeta-TCP; CUBIC TCP; Wireless network; Fairness measure; Network packet; Throughput; Flow control (data); Wireless; Telecommunications","score_opus":0.006879557171237527,"score_gpt":0.2006083902313412,"score_spread":0.19372883306010366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141453769","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062413856,0.00059024023,0.93470865,0.0012972282,0.00012323688,0.00057109434,0.0000040949926,0.00022417372,0.0000674345],"genre_scores_gemma":[0.895458,0.000019329553,0.10192759,0.0019447135,0.0003485938,0.000094035655,0.0000019105628,0.000020766787,0.00018508332],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846244,0.000023536579,0.00025425473,0.00062292354,0.0001758289,0.00046103745],"domain_scores_gemma":[0.9990356,0.00022480656,0.00010529392,0.00033611228,0.00011539413,0.00018278106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020676658,0.00026252054,0.00032702676,0.00004196942,0.00021710907,0.00032681125,0.00028783132,0.00019306736,0.0000057542297],"category_scores_gemma":[0.000008138132,0.00020444291,0.000051106603,0.00012734145,0.0000974119,0.0004543531,0.000100608035,0.00017970141,9.388423e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018125626,0.00007781559,0.00041674293,0.000023565277,0.0000942789,0.000006392179,0.00014463993,0.032757398,0.0006310118,0.009337148,0.00018644519,0.9561433],"study_design_scores_gemma":[0.0050402246,0.00019158582,0.0002627527,0.000023570172,0.000029284158,0.00008998925,0.000009265465,0.9927516,0.00006209825,0.00003415779,0.001198237,0.00030723092],"about_ca_topic_score_codex":0.000017382945,"about_ca_topic_score_gemma":0.00020285918,"teacher_disagreement_score":0.9599942,"about_ca_system_score_codex":0.000024104642,"about_ca_system_score_gemma":0.000055765282,"threshold_uncertainty_score":0.833694},"labels":[],"label_agreement":null},{"id":"W2141602083","doi":"10.1109/pimrc.2003.1264273","title":"Rformance analysis of the p2mp metropolitan area broadband wireless access network","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Computer network; Computer science; Digital subscriber line; Wireless broadband; Throughput; Wi-Fi; Wireless network; Reservation; Broadband networks; Wireless distribution system; Channel access method; Stochastic geometry models of wireless networks; Wireless; Access control; Broadband; Telecommunications; Radio resource management","score_opus":0.013696829252926533,"score_gpt":0.24118897823899485,"score_spread":0.22749214898606832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141602083","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13058005,0.0002313074,0.85277414,0.0017613766,0.0003513284,0.00015164279,0.0000023182522,0.00012557789,0.014022274],"genre_scores_gemma":[0.99711955,0.000023291728,0.0014431855,0.0008578168,0.000076086064,0.00000862463,0.0000015132506,0.000004083446,0.000465834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988411,0.000044320856,0.0002671104,0.00025775583,0.00029550417,0.00029421572],"domain_scores_gemma":[0.9989072,0.000074695046,0.00014698275,0.0007157525,0.00008408175,0.00007127645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020605359,0.00012075077,0.0002679517,0.00010094184,0.00012026759,0.0001191582,0.0016312641,0.000046291352,0.000030947704],"category_scores_gemma":[0.0000066634875,0.00007588692,0.00020905393,0.0030184695,0.000083091596,0.00037236523,0.00024988267,0.00010174196,0.0000058292576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009384604,0.00005993483,0.015604728,0.0000045518523,0.00058551284,0.0000014073747,0.00007654572,0.3453354,0.000016046368,0.5815978,0.0021043709,0.054604303],"study_design_scores_gemma":[0.001024742,0.000058984195,0.04589347,0.000047037352,0.00046942363,0.000003136102,0.00005682912,0.94279015,0.00058986107,0.005187946,0.003509266,0.00036916768],"about_ca_topic_score_codex":0.00010401987,"about_ca_topic_score_gemma":0.00027346896,"teacher_disagreement_score":0.8665395,"about_ca_system_score_codex":0.00007365085,"about_ca_system_score_gemma":0.00007849511,"threshold_uncertainty_score":0.30945787},"labels":[],"label_agreement":null},{"id":"W2141749523","doi":"10.1109/icc.1995.525181","title":"A real-time call admission control algorithm in high-speed networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Network calculus; Computer science; Quality of service; Computer network; Scheduling (production processes); Network packet; Admission control; Call Admission Control; End-to-end delay; Node (physics); Network delay; Routing (electronic design automation); Upper and lower bounds; Enhanced Data Rates for GSM Evolution; Real-time computing; Distributed computing; Mathematical optimization; Wireless network; Wireless; Mathematics; Engineering","score_opus":0.007095044948132621,"score_gpt":0.19857678333626558,"score_spread":0.19148173838813295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141749523","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022664068,0.00026347445,0.9821615,0.0039664926,0.00042299635,0.00034141628,0.0000012591328,0.0005849789,0.009991447],"genre_scores_gemma":[0.95965034,0.00016523046,0.026290353,0.0013214969,0.00033838698,0.000020723877,0.0000027262695,0.000016346297,0.012194376],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835825,0.00013768651,0.0003310748,0.00044996527,0.00024737828,0.00047564172],"domain_scores_gemma":[0.9989755,0.00020644322,0.00007254242,0.00045671006,0.000054084543,0.00023471958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027542503,0.00018726471,0.0002894761,0.00009843033,0.0000767661,0.000114300914,0.0005939674,0.00013348277,0.0005749436],"category_scores_gemma":[0.000017437176,0.00015786513,0.00006953432,0.0004317807,0.000027431652,0.00028181894,0.000073270465,0.0002020792,0.00038483372],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012332328,0.00013591199,0.00014520338,0.0000013137729,0.00001638125,0.00009267583,0.00006976978,0.016300121,0.00011813405,0.0073292344,0.022984447,0.9527945],"study_design_scores_gemma":[0.0020937033,0.000079434954,0.0009119797,0.000018324867,0.000005467859,0.000011272319,0.0000019386673,0.994169,0.0000058969667,0.00012701917,0.0023716034,0.00020435313],"about_ca_topic_score_codex":0.00011125853,"about_ca_topic_score_gemma":0.000014915019,"teacher_disagreement_score":0.9778689,"about_ca_system_score_codex":0.0000515884,"about_ca_system_score_gemma":0.000020416315,"threshold_uncertainty_score":0.6437553},"labels":[],"label_agreement":null},{"id":"W2141838214","doi":"10.1109/qshine.2005.17","title":"Delay Satisfaction End-to-End Priority Assignment and Routing in Multi- Class Priority Networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Heuristic; Routing (electronic design automation); End-to-end principle; Quality of service; Computation; Distributed computing; End-to-end delay; Computer network; Mathematical optimization; Priority inheritance; Algorithm; Dynamic priority scheduling; Mathematics","score_opus":0.014653508298688458,"score_gpt":0.2483859066987742,"score_spread":0.23373239840008575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141838214","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11623314,0.00012963146,0.88047546,0.0017606636,0.00029276448,0.0003164609,4.798777e-7,0.00017981806,0.00061155926],"genre_scores_gemma":[0.9498023,0.00003052482,0.04895644,0.00078608724,0.00017998792,0.000021832542,6.7015975e-7,0.0000068086765,0.00021535919],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837464,0.0001297586,0.00033284188,0.00050713524,0.00024168898,0.0004139502],"domain_scores_gemma":[0.9992266,0.00016774572,0.00007731739,0.0003017703,0.000034793735,0.00019171953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006638348,0.00017317908,0.00020273952,0.000078301084,0.00014037988,0.00015536728,0.00021869344,0.00011077224,0.00002990268],"category_scores_gemma":[0.000027072441,0.00016298151,0.00003693748,0.00027605516,0.000026791327,0.00039279673,0.0001756056,0.000292774,0.000020150324],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000079759675,0.000041732445,0.035584632,0.0000015036738,0.000007976589,0.0000052608516,0.0002713378,0.021730527,0.000043867985,0.011563595,0.00009464609,0.93064696],"study_design_scores_gemma":[0.0006860612,0.000036591315,0.16925237,0.000014204684,0.0000044990697,0.000008763819,0.000018093164,0.8277763,0.000017143866,0.000030829826,0.0019837094,0.00017140931],"about_ca_topic_score_codex":0.000165186,"about_ca_topic_score_gemma":0.0033550416,"teacher_disagreement_score":0.93047553,"about_ca_system_score_codex":0.00019659699,"about_ca_system_score_gemma":0.00005635128,"threshold_uncertainty_score":0.66461927},"labels":[],"label_agreement":null},{"id":"W2141840352","doi":"10.1007/s11036-006-0004-y","title":"Queue Analysis and Multiplexing of Heavy-tailed Traffic in Wireless Packet Data Networks","year":2006,"lang":"en","type":"article","venue":"Mobile Networks and Applications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; ATS Automation Tooling Systems (Canada)","funders":"University of Waterloo","keywords":"Computer science; Computer network; Traffic generation model; Wireless network; Queueing theory; Network traffic control; Network packet; Wireless; Real-time computing; Telecommunications","score_opus":0.007786676055336881,"score_gpt":0.22803724305356052,"score_spread":0.22025056699822362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141840352","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.100186944,0.002468627,0.8965258,0.00010415209,0.000030077075,0.00051263283,0.000014709488,0.00007956413,0.00007749344],"genre_scores_gemma":[0.9979858,0.00044666245,0.0007891518,0.000051227693,0.000198859,0.00036963925,0.00012309723,0.000009377749,0.000026222382],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984948,0.000084576895,0.0004149407,0.0005976224,0.00012271252,0.00028534146],"domain_scores_gemma":[0.9986057,0.00025481588,0.00015178662,0.0008407047,0.000062582,0.000084408966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047418964,0.00016118606,0.0003445999,0.00013677668,0.00014437012,0.00010828566,0.0005419775,0.00010760737,0.000003894297],"category_scores_gemma":[0.0000025214733,0.0001565483,0.000047157715,0.0013585965,0.00011105249,0.00020244479,0.00022607498,0.00017155708,5.4638883e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044887247,0.000073928786,0.0061287833,0.0000037813852,0.000034583536,6.565513e-7,0.000008547352,0.71591294,0.00000333067,0.0067300084,0.00012544203,0.2709735],"study_design_scores_gemma":[0.00046128465,0.000015787165,0.010654344,0.000014871992,0.00008843025,0.0000022158454,0.000020038637,0.98723805,0.000001872523,0.0001383042,0.0012098644,0.00015496525],"about_ca_topic_score_codex":0.00010959163,"about_ca_topic_score_gemma":0.0015209552,"teacher_disagreement_score":0.89779884,"about_ca_system_score_codex":0.000014377784,"about_ca_system_score_gemma":0.000024440838,"threshold_uncertainty_score":0.6383854},"labels":[],"label_agreement":null},{"id":"W2141884360","doi":"10.1109/lcn.1993.591211","title":"New contention control mechanisms for FDDI","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Universität Paderborn; University of Alberta","keywords":"Computer network; Computer science; Fiber Distributed Data Interface; Network packet; Packet loss; Network congestion; Backbone network; Local area network","score_opus":0.01713696754696523,"score_gpt":0.19814746074505632,"score_spread":0.1810104931980911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141884360","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022622802,0.00016676118,0.9874179,0.0060753995,0.000580817,0.00033751153,0.0000010594025,0.00033102417,0.005066902],"genre_scores_gemma":[0.8524385,0.000007931569,0.11613292,0.0026851017,0.00019353667,0.000050313156,8.9265586e-7,0.0000070027863,0.028483797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999234,0.000020292324,0.00015366515,0.00024058628,0.0001271727,0.00022423951],"domain_scores_gemma":[0.99941814,0.00010772652,0.000046644524,0.00023970447,0.000071692986,0.0001160772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000120930956,0.000091769165,0.00012573272,0.000034794983,0.00008411699,0.00010632756,0.00034684702,0.000047575017,0.00032223243],"category_scores_gemma":[0.000017022883,0.00007852102,0.00009467743,0.00009730475,0.00000679174,0.00023966658,0.000018265695,0.000041989173,0.00018983499],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036050012,0.000011016618,0.0000021031658,7.6155777e-7,0.0000102199265,6.4062823e-7,0.0000134530355,0.000058334157,0.00012255364,0.51404166,0.024159933,0.4615757],"study_design_scores_gemma":[0.0025735497,0.00013492732,0.000026189682,0.000004790028,0.00001181398,0.00000593065,0.0000060663424,0.94589096,0.00012383933,0.020537326,0.030552562,0.00013206317],"about_ca_topic_score_codex":0.0000068708373,"about_ca_topic_score_gemma":0.00000834289,"teacher_disagreement_score":0.9458326,"about_ca_system_score_codex":0.000012961907,"about_ca_system_score_gemma":0.000013244541,"threshold_uncertainty_score":0.35282192},"labels":[],"label_agreement":null},{"id":"W2141988401","doi":"10.1109/icc.2000.853105","title":"Transmission of real-time multi-layered MPEG-4 video over ATM/ABR service","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Quality of service; Asynchronous Transfer Mode; Computer network; Bandwidth (computing); Real-time computing; Transmission (telecommunications); Telecommunications","score_opus":0.018046892103804186,"score_gpt":0.22438400360299188,"score_spread":0.20633711149918768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141988401","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024247753,0.0003616837,0.95066357,0.0056636124,0.00023700017,0.00033126527,0.0000027814776,0.0006102051,0.017882118],"genre_scores_gemma":[0.93554705,0.0001450975,0.053053804,0.0010205879,0.00007286406,0.000010859934,0.0000016574742,0.000014092978,0.010133994],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872714,0.00007167849,0.00030424082,0.00035303272,0.00027902814,0.0002648528],"domain_scores_gemma":[0.9990483,0.00011599312,0.00008653213,0.0004913306,0.00011019263,0.00014766469],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00014694557,0.00015501097,0.00022722133,0.000054647466,0.00007052043,0.00004444381,0.00061538944,0.00009218623,0.0010757195],"category_scores_gemma":[0.000005773785,0.00012806,0.000090840265,0.00037198508,0.000020965628,0.00030967663,0.00006035344,0.000090611575,0.0003730022],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000337138,0.0004429643,0.00019012333,0.00003912979,0.000060189766,0.000018979166,0.00100984,0.0040442725,0.017944938,0.011439933,0.015876565,0.9488993],"study_design_scores_gemma":[0.0012161011,0.000052573738,0.00064603944,0.000030664618,0.000009297355,0.0000052385044,0.0000066482953,0.989373,0.0006665446,0.00007902276,0.0077485107,0.00016635399],"about_ca_topic_score_codex":0.00009123605,"about_ca_topic_score_gemma":0.000015373967,"teacher_disagreement_score":0.98532873,"about_ca_system_score_codex":0.000016038779,"about_ca_system_score_gemma":0.000021241898,"threshold_uncertainty_score":0.99983746},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04210811825454394,"score_gpt":0.27762871146648754,"score_spread":0.2355205932119436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141992945","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060575875,0.0001447821,0.9918271,0.00042274184,0.00023103094,0.00039407559,8.506555e-7,0.00011118673,0.000810671],"genre_scores_gemma":[0.9879371,0.0000069878392,0.011176278,0.00016930226,0.000103284496,0.000018218547,0.0000013845091,0.000003798646,0.00058362924],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992304,0.000037348284,0.00023213036,0.00022474954,0.00011328797,0.00016211077],"domain_scores_gemma":[0.99916476,0.0002717272,0.000073188174,0.00033205355,0.000105749976,0.000052499956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016018061,0.000075943615,0.00012728451,0.000021892056,0.0000563592,0.000026102052,0.0002857563,0.000051790925,0.00007996494],"category_scores_gemma":[0.00002973676,0.00006654951,0.000093563125,0.00015157799,0.00002079748,0.00018603307,0.00003740401,0.000039157134,0.000010232308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012660241,0.000056896493,0.0008618254,0.0000036994973,0.000008985613,2.1081551e-7,0.000040600986,0.77880853,0.000015257767,0.017611803,0.0016889813,0.20089056],"study_design_scores_gemma":[0.0008433463,0.00006959391,0.0006616856,0.000005068301,0.0000057340353,4.162177e-7,0.0000022935787,0.99707586,0.000013306953,0.0004488764,0.00080048235,0.000073313146],"about_ca_topic_score_codex":0.0000016198965,"about_ca_topic_score_gemma":0.0000057676834,"teacher_disagreement_score":0.98187953,"about_ca_system_score_codex":0.000018032766,"about_ca_system_score_gemma":0.0000074549052,"threshold_uncertainty_score":0.27138102},"labels":[],"label_agreement":null},{"id":"W2142026433","doi":"10.1109/lcn.2000.891068","title":"A new paradigm for multipoint-to-multipoint communication using XTP","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Multicast; Network packet; Protocol (science); Reliability (semiconductor); Computer network; Distributed computing; Service (business); Layer (electronics); Computer architecture; Embedded system","score_opus":0.046954340798697765,"score_gpt":0.2592100173306856,"score_spread":0.21225567653198785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142026433","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007745367,0.00029731967,0.9884364,0.008482541,0.00017765764,0.00064213766,0.0000010781908,0.00026942705,0.000918895],"genre_scores_gemma":[0.426696,0.000014338183,0.5700086,0.0015104278,0.00010577843,0.000048711165,0.0000014009534,0.000009436647,0.0016052993],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990087,0.000047001737,0.00023698437,0.00029762462,0.00013532084,0.00027435215],"domain_scores_gemma":[0.99867254,0.00022270807,0.00006461188,0.0007843942,0.000058024103,0.00019773195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018027193,0.00012472288,0.00014874755,0.00006749198,0.00017683583,0.00016388347,0.0008096077,0.000049098417,0.0000842739],"category_scores_gemma":[0.00003928403,0.00011518159,0.000076134915,0.00023333776,0.000014334226,0.00032426673,0.00013251741,0.00007786077,0.00015262673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000102747845,0.00005078691,0.0000380753,0.0000034409743,0.000017383301,8.486169e-7,0.0005260484,0.0072917547,0.00013392753,0.10200007,0.019942097,0.8699853],"study_design_scores_gemma":[0.00084991055,0.000045831523,0.000065792134,0.000018920011,0.0000068681975,0.000007635442,0.000010834802,0.9565786,0.00009809205,0.0012299408,0.040928237,0.00015932976],"about_ca_topic_score_codex":0.00008304995,"about_ca_topic_score_gemma":0.000059820588,"teacher_disagreement_score":0.9492869,"about_ca_system_score_codex":0.000043942942,"about_ca_system_score_gemma":0.0000281486,"threshold_uncertainty_score":0.46969688},"labels":[],"label_agreement":null},{"id":"W2142151151","doi":"10.1109/ipdps.2009.5161170","title":"Design and analysis of an active predictive algorithm in wireless multicast networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Multicast; Computer network; Computer science; Source-specific multicast; Pragmatic General Multicast; Xcast; Wireless network; Protocol Independent Multicast; Node (physics); Distributed computing; Network congestion; Reliable multicast; Wireless; Real-time computing; Network packet; Engineering; Telecommunications","score_opus":0.008555992925470128,"score_gpt":0.23053833960955755,"score_spread":0.22198234668408742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142151151","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028054086,0.000037480597,0.9713962,0.00011482511,0.000030099372,0.00015754234,0.0000010904059,0.000057945894,0.00015073566],"genre_scores_gemma":[0.91803867,0.00001807291,0.08176058,0.00013634544,0.000018255534,0.00000633829,0.0000024053213,0.0000019901697,0.000017322991],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907655,0.00013862469,0.00018232453,0.00029965286,0.00012533223,0.00017750806],"domain_scores_gemma":[0.99939066,0.00017858596,0.00006256791,0.00022222688,0.000060421535,0.00008554237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022880225,0.00009716271,0.00025263443,0.00020053388,0.00003143297,0.00003610634,0.0002433998,0.000060341248,0.0000052516416],"category_scores_gemma":[0.000004721023,0.000084776846,0.00003651056,0.00096814014,0.00003807969,0.00033789384,0.000027955957,0.00009544601,3.331564e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025808196,0.000084023246,0.00011830181,2.0272607e-7,0.00008492285,0.0000063518123,0.00027824988,0.14198224,0.000015353806,0.0016678933,0.0000045378115,0.85573214],"study_design_scores_gemma":[0.00040955178,0.0002156655,0.037138842,0.0000049911523,0.000071644165,0.0000013122283,0.000040456158,0.9617926,0.00008058727,0.00015751265,0.0000012269505,0.00008560297],"about_ca_topic_score_codex":0.000013329914,"about_ca_topic_score_gemma":0.000017134988,"teacher_disagreement_score":0.8899846,"about_ca_system_score_codex":0.000017563269,"about_ca_system_score_gemma":0.000019565634,"threshold_uncertainty_score":0.34570995},"labels":[],"label_agreement":null},{"id":"W2142393783","doi":"10.1109/icc.2002.997059","title":"Multicasting of adaptively-encoded MPEG4 over QoS-aware IP networks","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Computer network; Multicast; Network packet; Quality of service; Network congestion; Explicit Congestion Notification; Priority queue; Unicast; Differentiated services; Bandwidth (computing); Packet loss; Queue","score_opus":0.011564914053798284,"score_gpt":0.21650471365298501,"score_spread":0.20493979959918673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142393783","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00686945,0.0001761639,0.98286974,0.000118308686,0.00052147964,0.0001376843,5.699693e-7,0.00018098127,0.009125643],"genre_scores_gemma":[0.97142,0.000007742528,0.02724152,0.00029084497,0.000097987315,0.000009469475,5.2683606e-7,0.000008394809,0.0009235245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870884,0.00011617179,0.0002937384,0.00032984858,0.00022206243,0.0003293183],"domain_scores_gemma":[0.99899876,0.0002892503,0.00011438221,0.0003715624,0.00011433149,0.00011173805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003084908,0.00014716905,0.0002106564,0.000049631857,0.00009056125,0.000052533665,0.00042124183,0.00007928744,0.00013411671],"category_scores_gemma":[0.000067774316,0.00012750695,0.00008464703,0.00035560847,0.000048681242,0.00024722892,0.00007214835,0.0001540542,0.000019639085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022383047,0.00017146552,0.0021464878,0.000011831509,0.00007838027,0.000024485636,0.00032233,0.091102585,0.00014426417,0.547134,0.0038963305,0.35494548],"study_design_scores_gemma":[0.0006344538,0.000053490206,0.0009554082,0.000026090145,0.000008737772,0.00001050536,0.00004714929,0.9959958,0.00015912134,0.00021193956,0.0017263343,0.00017095688],"about_ca_topic_score_codex":0.000012994391,"about_ca_topic_score_gemma":0.000013382591,"teacher_disagreement_score":0.96455055,"about_ca_system_score_codex":0.000018861232,"about_ca_system_score_gemma":0.000052898602,"threshold_uncertainty_score":0.51995826},"labels":[],"label_agreement":null},{"id":"W2142442558","doi":"10.1109/drcn.2003.1275362","title":"On the resilience of sack and newreno tcp","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Sack; Zeta-TCP; Computer science; TCP global synchronization; Resilience (materials science); TCP hole punching; Computer network; TCP Friendly Rate Control; De facto; Engineering; Transmission Control Protocol; Physics","score_opus":0.00657146240310861,"score_gpt":0.1916347679147714,"score_spread":0.1850633055116628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142442558","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14075927,0.00016558601,0.81571937,0.017996024,0.0001440749,0.00013249542,2.547854e-7,0.00008814365,0.0249948],"genre_scores_gemma":[0.99573874,0.000012402554,0.0025208725,0.0012173885,0.000014606856,0.0000023272808,2.6731449e-8,0.0000011256918,0.0004925251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995984,0.000016897666,0.000074010575,0.00012091693,0.00010720721,0.00008255761],"domain_scores_gemma":[0.99955636,0.00013772755,0.00002451171,0.00023127896,0.000021036669,0.000029094677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010985832,0.00004180404,0.00005107899,0.000014009834,0.00004763653,0.00002747485,0.00029221745,0.000014659976,0.000018518576],"category_scores_gemma":[0.000019725885,0.000023826562,0.000014383386,0.00011393419,0.000055107812,0.0000656812,0.000042382915,0.0000439622,0.000021287613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023987407,0.00001044897,0.000022991819,5.695873e-7,0.0000018302012,7.8851593e-7,0.000075272364,0.0015191075,0.000043096617,0.9076126,0.00072348106,0.08998739],"study_design_scores_gemma":[0.005076097,0.0017266731,0.021761823,0.00024967236,0.000026615055,0.000068384914,0.00034253407,0.3870786,0.009522918,0.55659735,0.016619226,0.0009300819],"about_ca_topic_score_codex":0.000012842369,"about_ca_topic_score_gemma":0.00001068123,"teacher_disagreement_score":0.85497946,"about_ca_system_score_codex":0.0000045119677,"about_ca_system_score_gemma":0.00002761298,"threshold_uncertainty_score":0.097161904},"labels":[],"label_agreement":null},{"id":"W2142559290","doi":"10.1002/nem.426","title":"A self‐regulating TCP acknowledgment (ACK) pacing scheme","year":2002,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Computer science; Scheme (mathematics); TCP delayed acknowledgment; TCP acceleration; TCP Westwood plus; H-TCP; TCP global synchronization; TCP Friendly Rate Control; Computer network; TCP tuning; Network congestion","score_opus":0.011873683307134926,"score_gpt":0.22245400069878754,"score_spread":0.21058031739165262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142559290","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004197044,0.0021190457,0.9415908,0.0073039755,0.006901727,0.00023689738,4.983772e-7,0.0001722854,0.037477735],"genre_scores_gemma":[0.84478456,0.00040344737,0.15018246,0.0009314268,0.002287023,0.0000075647163,5.932069e-7,0.000012232261,0.0013907074],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980693,0.000067673696,0.00058581395,0.00020987028,0.0007804588,0.00028686822],"domain_scores_gemma":[0.9987422,0.00008587201,0.0004557021,0.00023133335,0.00037043,0.00011444223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054587255,0.00015282308,0.00018970517,0.00016730843,0.000092465896,0.00027418692,0.0013221883,0.00003585718,0.00016471223],"category_scores_gemma":[0.000013684665,0.00013937605,0.00016244627,0.00025131073,0.000018091036,0.00047030754,0.00032624358,0.00019213898,0.00010032267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021301066,0.00021219821,0.000559165,0.000012929796,0.0008879838,0.00031793138,0.00037952114,0.037240777,0.000006851447,0.11296668,0.05063718,0.79675746],"study_design_scores_gemma":[0.0015240551,0.00009655194,0.0004501246,0.00027263258,0.000040207084,0.00014013868,0.000048280013,0.7779017,0.000010111944,0.0024730891,0.21682028,0.00022284087],"about_ca_topic_score_codex":3.43629e-7,"about_ca_topic_score_gemma":0.0000010569287,"teacher_disagreement_score":0.8405875,"about_ca_system_score_codex":0.00016234891,"about_ca_system_score_gemma":0.000012136102,"threshold_uncertainty_score":0.568359},"labels":[],"label_agreement":null},{"id":"W2142707567","doi":"10.1109/wimob.2007.4390828","title":"Transport Layer Fairness and Congestion Control in Multihop Wireless Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; A-T Children's Project","keywords":"Computer network; Computer science; Network congestion; Fairness measure; Transmission Control Protocol; Wireless ad hoc network; Transport layer; TCP Westwood plus; TCP tuning; TCP Friendly Rate Control; Throughput; Explicit Congestion Notification; Ad hoc wireless distribution service; Datagram; Packet loss; Wireless network; Distributed computing; Optimized Link State Routing Protocol; Wireless; Network packet; Routing protocol; Layer (electronics); Telecommunications","score_opus":0.006803181550250635,"score_gpt":0.21391576432039544,"score_spread":0.2071125827701448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142707567","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1350614,0.0002110944,0.86226016,0.00070520525,0.0002876051,0.0002357878,4.1394014e-7,0.00018219971,0.0010561666],"genre_scores_gemma":[0.9974182,0.000033618006,0.0012167535,0.0009664944,0.00010456823,0.00001535992,0.0000016032291,0.000008224586,0.00023514101],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986959,0.00004740525,0.00031466616,0.00037675214,0.00016816515,0.00039711816],"domain_scores_gemma":[0.9992697,0.0002458109,0.000054842236,0.00023034772,0.000056686633,0.00014258664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007726186,0.00015653133,0.00022457754,0.00009816219,0.0000632221,0.0000495439,0.00027207573,0.00013041448,0.000013373436],"category_scores_gemma":[0.0000060131733,0.0001403283,0.000037440357,0.00029366344,0.000056740286,0.00031820522,0.000020868652,0.00019559362,0.0000066916664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094084906,0.000085011896,0.056782205,0.0000061225446,0.000017857104,0.00010420096,0.00021365551,0.013098901,0.000113460694,0.08680237,0.000094411575,0.8425877],"study_design_scores_gemma":[0.0023879157,0.00003867879,0.13123529,0.000020873284,0.0000071847717,0.000016330543,0.000032303393,0.86519885,0.00002192711,0.00015381629,0.00068237615,0.00020443716],"about_ca_topic_score_codex":0.00006434859,"about_ca_topic_score_gemma":0.0013234386,"teacher_disagreement_score":0.86235684,"about_ca_system_score_codex":0.000024868785,"about_ca_system_score_gemma":0.000021994176,"threshold_uncertainty_score":0.5722422},"labels":[],"label_agreement":null},{"id":"W2143016553","doi":"10.1109/aina.2007.121","title":"Reliable Strict Quality-of-Service with Unreserved Backup Paths","year":2007,"lang":"en","type":"article","venue":"Proceedings","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Backup; Computer science; Reservation; Path (computing); Computer network; Quality of service; Service quality; Service (business); Distributed computing; Database","score_opus":0.02384536567560397,"score_gpt":0.25593293055422667,"score_spread":0.2320875648786227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143016553","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64551836,0.00040359682,0.30495942,0.005216576,0.0003392766,0.00051010825,0.0000018794375,0.0006469133,0.042403884],"genre_scores_gemma":[0.9691912,0.000010549132,0.029259132,0.0009502607,0.000103710896,0.000011063089,9.2058394e-7,0.000011515465,0.00046167691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849224,0.000008926988,0.00035104176,0.00034738547,0.00042630621,0.0003741089],"domain_scores_gemma":[0.99868923,0.00015105004,0.00021753955,0.00020380443,0.0006043233,0.00013406275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014306799,0.00014314183,0.00021964265,0.0000909262,0.000090577465,0.000090881476,0.00076893845,0.00009753059,0.000015084068],"category_scores_gemma":[0.0000646985,0.000116743424,0.000040716113,0.0010885823,0.000030710497,0.00052110833,0.00011593756,0.00021830064,0.000028244118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073254463,0.0003899998,0.06042702,0.00042337363,0.00012657649,0.000018722258,0.00295244,0.00024852794,0.0048693065,0.67561305,0.008099123,0.24609931],"study_design_scores_gemma":[0.023476733,0.0042449967,0.33962435,0.0017283726,0.0002474753,0.00019355956,0.0046635726,0.3614356,0.029849606,0.026905173,0.20195547,0.005675102],"about_ca_topic_score_codex":0.000085122134,"about_ca_topic_score_gemma":0.000039952083,"teacher_disagreement_score":0.64870787,"about_ca_system_score_codex":0.000026811085,"about_ca_system_score_gemma":0.00006470023,"threshold_uncertainty_score":0.47606587},"labels":[],"label_agreement":null},{"id":"W2143114469","doi":"10.1007/3-540-44763-6_24","title":"Selecting the QoS Parameters for Multicast Applications Based on User Profile and Device Capability","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Multicast; Bandwidth (computing); Quality of service; Computer network; Partition (number theory); Real-time computing; Distributed computing","score_opus":0.01877266087804563,"score_gpt":0.2497167665430904,"score_spread":0.23094410566504478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143114469","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001140402,0.00009829988,0.9942365,0.00247481,0.00045191322,0.0018062121,0.0000069005782,0.00013480068,0.0006764779],"genre_scores_gemma":[0.45196953,0.000008773363,0.541306,0.0053645745,0.000620004,0.0004930993,0.000006369143,0.000036460875,0.00019519318],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973359,0.00005143494,0.00035472366,0.0012811685,0.00046949077,0.0005072955],"domain_scores_gemma":[0.99548125,0.0028556376,0.00020185886,0.0010740208,0.0002589308,0.00012830803],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009806665,0.000367402,0.00032366355,0.00020909656,0.0005608761,0.0004528207,0.0015991253,0.00018278653,0.000005499687],"category_scores_gemma":[0.00012669328,0.00027158135,0.000096192714,0.00046177843,0.0005466558,0.00018733765,0.00023458619,0.0005494784,0.000008882329],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000104461715,0.00002787079,0.00006776703,0.00002357894,0.000006857792,0.0000022683955,0.000121802776,0.08271208,0.0000078591465,0.010753565,0.000026132353,0.90623975],"study_design_scores_gemma":[0.00032218976,0.00012829353,0.00007198255,0.00009958802,0.000013043177,0.000012783058,2.4971482e-7,0.9848083,0.00007868972,0.0075761224,0.0065678386,0.00032088338],"about_ca_topic_score_codex":0.000012526479,"about_ca_topic_score_gemma":0.00007675692,"teacher_disagreement_score":0.9059189,"about_ca_system_score_codex":0.00014435098,"about_ca_system_score_gemma":0.0003218003,"threshold_uncertainty_score":0.99997365},"labels":[],"label_agreement":null},{"id":"W2143238724","doi":"","title":"Enabling architectures for QoS provisioning","year":2008,"lang":"en","type":"dissertation","venue":"Spectrum Research Repository (Concordia University)","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Quality of service; Computer science; Mobile QoS; Scalability; Computer network; Distributed computing; Router; Provisioning; Service (business); Service provider; Operating system","score_opus":0.022400081094388024,"score_gpt":0.2679747747383359,"score_spread":0.2455746936439479,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143238724","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78682774,0.00217726,0.048093908,0.0013800255,0.0075529427,0.004265809,0.000018056333,0.0013493396,0.14833494],"genre_scores_gemma":[0.89783823,0.00014640395,0.0006798589,0.000018506747,0.0014659021,0.000030800406,0.000050107014,0.000054533375,0.09971566],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99602556,0.00044093578,0.0003305461,0.0012020117,0.000932309,0.001068609],"domain_scores_gemma":[0.9971022,0.0008388716,0.00024434863,0.0009176126,0.00053380174,0.00036317122],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00053371664,0.00037789828,0.0004735362,0.0014663218,0.0018518645,0.000369447,0.002253721,0.0003951643,0.000008538535],"category_scores_gemma":[0.00014314447,0.00041117833,0.00036859862,0.0012682204,0.00016056237,0.00021553594,0.00021671125,0.0013046215,0.000021902522],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0052967006,0.0008970199,0.006050812,0.0015272697,0.0018744592,0.008291823,0.009689482,0.00636751,0.01020947,0.16851565,0.039417814,0.741862],"study_design_scores_gemma":[0.0082901055,0.0038629088,0.01612193,0.0016871709,0.00028970273,0.00043171007,0.004756599,0.112884626,0.04553911,0.006459287,0.79513353,0.0045433175],"about_ca_topic_score_codex":0.0010285745,"about_ca_topic_score_gemma":0.00238585,"teacher_disagreement_score":0.7557157,"about_ca_system_score_codex":0.00042157577,"about_ca_system_score_gemma":0.0019886615,"threshold_uncertainty_score":0.999834},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.017921072385934725,"score_gpt":0.20285710472634705,"score_spread":0.18493603234041234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143506299","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023500672,0.000107582666,0.8621645,0.006301856,0.00026908884,0.00018820602,4.9622025e-7,0.00044641583,0.1070212],"genre_scores_gemma":[0.9793314,0.0000143884035,0.012253927,0.00044307183,0.000059778537,0.000015643083,4.868995e-7,0.00000408734,0.007877271],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928254,0.000033451262,0.0001281394,0.00023324064,0.00014337369,0.00017923221],"domain_scores_gemma":[0.99958634,0.000039254508,0.000032087966,0.00025197476,0.000039115854,0.00005119593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008345453,0.000078303245,0.0000839486,0.00008571395,0.00007643976,0.00008969617,0.00020565857,0.00003463082,0.00009130785],"category_scores_gemma":[0.0000054477073,0.00006170337,0.000020260703,0.0005611872,0.000015571864,0.0003756908,0.000025217834,0.00009047792,0.00012563737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009725845,0.000097439006,0.010502272,0.0000021616202,0.000016591559,0.000021530392,0.0005079666,0.018851917,0.00004108,0.16231632,0.004459308,0.80317366],"study_design_scores_gemma":[0.00062969077,0.000067108114,0.011577382,0.000011542664,0.0000033180854,0.00001999894,0.000012338134,0.96872884,0.000013042017,0.0004727205,0.018313741,0.00015030417],"about_ca_topic_score_codex":0.000042990072,"about_ca_topic_score_gemma":0.00066889246,"teacher_disagreement_score":0.9558307,"about_ca_system_score_codex":0.000047752143,"about_ca_system_score_gemma":0.000016793674,"threshold_uncertainty_score":0.25161904},"labels":[],"label_agreement":null},{"id":"W2143512409","doi":"10.1109/icon.2000.875803","title":"Deficits for bursty latency-critical flows: DRR++","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Latency (audio); Timer; Queueing theory; Computer network; Network packet; Weighted fair queueing; Bandwidth (computing); Real-time computing; Operating system; Telecommunications; Wireless","score_opus":0.024503394710436197,"score_gpt":0.23621474707100215,"score_spread":0.21171135236056596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143512409","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012294782,0.00042857724,0.97338253,0.008410028,0.00058426324,0.00016860153,0.0000014709095,0.00037842008,0.015416658],"genre_scores_gemma":[0.9303864,0.00001765728,0.06432941,0.0013062503,0.00020327957,0.00004795874,6.4779846e-7,0.00000702706,0.0037013271],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990614,0.000021622509,0.00015916507,0.00029440416,0.00014327458,0.00032013052],"domain_scores_gemma":[0.9991699,0.00030991546,0.000015490039,0.00029733835,0.00009515427,0.00011220303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011956833,0.000100779944,0.000120621255,0.000033708486,0.000121123914,0.00010890694,0.00043122075,0.00005906911,0.00022609407],"category_scores_gemma":[0.0000741225,0.00008427482,0.000076199154,0.00014623841,0.000026389713,0.0002257077,0.000047069352,0.00007033491,0.00032999364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023730122,0.00005233606,0.000022012953,0.0000043988484,0.000006527097,0.0000042634474,0.000059772607,0.00015943941,0.00001840804,0.576275,0.016228117,0.40716738],"study_design_scores_gemma":[0.000364775,0.00007981504,0.00004112291,0.000006902967,0.0000065004156,0.000010259634,0.0000059072913,0.9633668,0.000025093446,0.0045294114,0.031423993,0.00013939213],"about_ca_topic_score_codex":0.0000020923092,"about_ca_topic_score_gemma":0.0000064078313,"teacher_disagreement_score":0.96320736,"about_ca_system_score_codex":0.00001209002,"about_ca_system_score_gemma":0.000011978521,"threshold_uncertainty_score":0.42415106},"labels":[],"label_agreement":null},{"id":"W2143583144","doi":"10.1002/dac.497","title":"The distributed robust traffic controller for ATM networks","year":2001,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Ottawa","funders":"","keywords":"Computer science; Bottleneck; Controller (irrigation); Computer network; Service (business); Simple (philosophy); Distributed computing; Real-time computing; Embedded system","score_opus":0.01999383123973367,"score_gpt":0.2597530269638197,"score_spread":0.23975919572408602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143583144","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013509883,0.0074323867,0.97755724,0.01100714,0.0021280472,0.00025014652,0.0000043319433,0.0000401651,0.00022956781],"genre_scores_gemma":[0.9959735,0.0018002072,0.0011645785,0.00017492202,0.0005890471,0.000041265885,0.000008638841,0.000007688011,0.00024011306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826676,0.00026551777,0.00075199525,0.000101349484,0.00044392588,0.00017043011],"domain_scores_gemma":[0.9956123,0.0014099074,0.00081378146,0.00042660485,0.0016598119,0.000077561934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014684376,0.00010604471,0.0002029078,0.00006924657,0.00026842262,0.0006040929,0.0029988445,0.000060341332,0.0000019907407],"category_scores_gemma":[0.00013865196,0.00007294079,0.00017506562,0.0001586534,0.000057986286,0.0003807415,0.000092148985,0.00020490789,0.0000047781077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014856,0.000047844864,0.00009240078,3.5714e-7,0.00021382212,0.0000035885057,0.000066503184,0.7764613,0.000002561683,0.0639475,0.0087744575,0.1502411],"study_design_scores_gemma":[0.001247055,0.000041593237,0.00017650066,0.000047146634,0.000010963453,0.00013278589,0.00007349695,0.76797247,4.9358806e-7,0.0002255179,0.2300093,0.00006269534],"about_ca_topic_score_codex":0.000003899867,"about_ca_topic_score_gemma":0.000009500854,"teacher_disagreement_score":0.9946225,"about_ca_system_score_codex":0.0001005591,"about_ca_system_score_gemma":0.00007771941,"threshold_uncertainty_score":0.5825282},"labels":[],"label_agreement":null},{"id":"W2143584606","doi":"10.1109/ccece.2008.4564501","title":"Analyzing the accuracy of CHOKe hits, CHOKe misses and CHOKe-RED drops","year":2008,"lang":"en","type":"article","venue":"Conference proceedings - Canadian Conference on Electrical and Computer Engineering","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Choke; Computer science; Flow (mathematics); Active queue management; Computer security; Engineering; Physics; Electrical engineering; Mechanics; Network congestion","score_opus":0.014529510915502733,"score_gpt":0.18973295322114056,"score_spread":0.17520344230563784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143584606","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50193393,0.0020636013,0.48097727,0.010662655,0.0005466789,0.0010428936,0.000011367479,0.00052692357,0.0022346913],"genre_scores_gemma":[0.99654025,0.00073220464,0.0020607049,0.00035110404,0.0001761461,0.00003644099,0.0000018958355,0.000017418832,0.000083845596],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791396,0.000020034611,0.00040887741,0.00065754616,0.00026824643,0.00073131593],"domain_scores_gemma":[0.9983676,0.00022886108,0.00015291106,0.0002456413,0.00038820982,0.0006167479],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019696505,0.00038453634,0.00046881574,0.0003448876,0.00034439814,0.00038346977,0.00087656255,0.0001453535,0.000016738813],"category_scores_gemma":[0.00011449161,0.00031380262,0.00006960471,0.00071819086,0.0001378701,0.00042988668,0.00012326112,0.0005222105,0.0000042542606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030715855,0.000067931294,0.0065682884,0.000101940765,0.00015932815,0.0000534668,0.0016937567,0.0005782092,0.0013375899,0.3669119,0.0012760053,0.6212209],"study_design_scores_gemma":[0.0004505264,0.00024188991,0.014631126,0.00014500838,0.000020078407,0.00012946792,0.000017145689,0.98102075,0.00025202273,0.0005305924,0.00213019,0.00043119173],"about_ca_topic_score_codex":0.0007721655,"about_ca_topic_score_gemma":0.00021445364,"teacher_disagreement_score":0.9804425,"about_ca_system_score_codex":0.000066079825,"about_ca_system_score_gemma":0.0004812118,"threshold_uncertainty_score":0.9999314},"labels":[],"label_agreement":null},{"id":"W2143674264","doi":"10.1109/icc.1995.525165","title":"Virtual call admission control-a strategy for dynamic routing over ATM networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Instituto de Telecomunicações","keywords":"Computer science; Computer network; Routing (electronic design automation); Static routing; Policy-based routing; Dynamic Source Routing; Distributed computing; Hierarchical routing; Call Admission Control; Destination-Sequenced Distance Vector routing; Link-state routing protocol; Routing protocol; Telecommunications; Wireless network","score_opus":0.013575937384644117,"score_gpt":0.2356141166486999,"score_spread":0.2220381792640558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143674264","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022541194,0.00036385003,0.9930295,0.0009687245,0.00048909796,0.00033963588,0.0000019589272,0.00036666007,0.002186487],"genre_scores_gemma":[0.98962283,0.000024368996,0.0022814828,0.0013436158,0.00023171482,0.000035856177,0.0000029186422,0.00001406002,0.006443151],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985245,0.00006045305,0.0002989627,0.00043746212,0.00018973877,0.00048891094],"domain_scores_gemma":[0.998953,0.00033074952,0.000096074444,0.0003511364,0.00006874722,0.00020033031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023672078,0.00019012704,0.00022295862,0.00003820097,0.00020353754,0.00019866944,0.000512658,0.00012572741,0.00018735818],"category_scores_gemma":[0.000029827654,0.0001584633,0.0001240828,0.00016986828,0.000025823052,0.00032740273,0.000057449462,0.00015790518,0.00003843492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024147916,0.00006119592,0.00007848011,0.0000020294044,0.000030672505,0.000008942296,0.000042192303,0.12534828,0.000027592823,0.07104161,0.009951425,0.7933834],"study_design_scores_gemma":[0.0018434848,0.00022211493,0.0002861042,0.000014936307,0.000012911783,0.000008657614,0.000008877251,0.99380356,0.0000020375144,0.00015767718,0.0034267136,0.00021291914],"about_ca_topic_score_codex":0.000007803978,"about_ca_topic_score_gemma":0.000025230685,"teacher_disagreement_score":0.990748,"about_ca_system_score_codex":0.000043377728,"about_ca_system_score_gemma":0.000024729448,"threshold_uncertainty_score":0.6461946},"labels":[],"label_agreement":null},{"id":"W2143678636","doi":"10.1109/infcom.1996.497918","title":"A simulation study of delay and delay variation in ATM networks .I. CBR traffic","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Variation (astronomy); End-to-end delay; Constant bitrate; Real-time computing; Correlation; Network delay; Elmore delay; Connection (principal bundle); Control theory (sociology); Topology (electrical circuits); Computer network; Bit rate; Mathematics; Propagation delay; Artificial intelligence; Delay calculation; Physics; Variable bitrate; Network packet","score_opus":0.015219631833823497,"score_gpt":0.22364842998369125,"score_spread":0.20842879814986776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143678636","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5125925,0.00013231345,0.48667172,0.00008134464,0.00007840031,0.00022120569,7.1263244e-8,0.000057370304,0.00016504973],"genre_scores_gemma":[0.99832284,0.0000130226945,0.0014344224,0.000075684286,0.000041504594,0.000013254143,3.025762e-7,0.0000043951163,0.0000945527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903613,0.00010727056,0.00028789346,0.0002600764,0.00015575421,0.00015289275],"domain_scores_gemma":[0.9993274,0.00027843282,0.00008125963,0.00021317496,0.00005446226,0.000045232922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024135545,0.000094075345,0.0001505087,0.00008744879,0.00004577346,0.00004793209,0.00017487512,0.00005824255,0.000026752283],"category_scores_gemma":[0.00001788681,0.00008530154,0.000019268586,0.00040062587,0.000012031584,0.000275929,0.000040107177,0.000087248176,0.000004188664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005380664,0.00022194396,0.0010135685,0.0000010206408,0.0000083267405,0.0000040094646,0.0011559976,0.80648166,0.000001008478,0.001185543,0.000021500135,0.18990003],"study_design_scores_gemma":[0.0011702477,0.00019780078,0.014442781,0.0000058772216,0.0000081352555,0.000002010987,0.000043327003,0.9839686,1.4137865e-7,0.00003231444,0.00004087186,0.000087887216],"about_ca_topic_score_codex":0.000026848043,"about_ca_topic_score_gemma":0.00021970068,"teacher_disagreement_score":0.48573035,"about_ca_system_score_codex":0.000016384107,"about_ca_system_score_gemma":0.0000062984377,"threshold_uncertainty_score":0.34784955},"labels":[],"label_agreement":null},{"id":"W2143849473","doi":"10.1002/cpe.759","title":"On the scalability of many‐to‐many reliable multicast sessions","year":2004,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"SAIT Polytechnic","funders":"Fonds National de la Recherche Luxembourg","keywords":"Multicast; Computer science; Reliable multicast; Protocol Independent Multicast; Computer network; Scalability; Session (web analytics); Pragmatic General Multicast; Protocol (science); IP multicast; Distance Vector Multicast Routing Protocol; Tree (set theory); Network packet; Source-specific multicast; Distributed computing; Throughput; Xcast; Wireless; Medicine; World Wide Web; Telecommunications","score_opus":0.0203997158021895,"score_gpt":0.30834407848617246,"score_spread":0.28794436268398294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143849473","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34615934,0.00028846736,0.6437912,0.008503998,0.0002551133,0.00022677291,0.000001281229,0.000047556572,0.00072626426],"genre_scores_gemma":[0.99202657,0.00007059436,0.0062828846,0.001538076,0.000020793728,0.000040012685,5.7856613e-7,0.0000029127586,0.000017607514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989793,0.000089093955,0.00023584593,0.0003374055,0.00020195715,0.00015645236],"domain_scores_gemma":[0.9984373,0.0009282992,0.00012358151,0.00023347842,0.00016672784,0.00011061599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031559172,0.00011030277,0.00012697045,0.000038036083,0.00030277736,0.0001141663,0.00023455328,0.000036360943,0.000007910856],"category_scores_gemma":[0.00047061936,0.000079626334,0.000022150665,0.00029091764,0.0001524499,0.0005939379,0.00010997733,0.00014248853,0.00001379571],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045443085,0.00019381692,0.00012587222,0.0000130503495,0.000010853638,0.000005087031,0.012430233,0.0051945024,0.00014268547,0.69653296,0.00024129092,0.2850642],"study_design_scores_gemma":[0.0041678105,0.0019728553,0.011218782,0.0006953807,0.00008377817,0.00019355514,0.014307383,0.8829436,0.0019088896,0.06248296,0.018849123,0.0011758807],"about_ca_topic_score_codex":0.000022735778,"about_ca_topic_score_gemma":0.0000010248211,"teacher_disagreement_score":0.8777491,"about_ca_system_score_codex":0.000012501993,"about_ca_system_score_gemma":0.00006632386,"threshold_uncertainty_score":0.32470676},"labels":[],"label_agreement":null},{"id":"W2143896882","doi":"10.1109/atm.1998.675166","title":"Effect of ATM networks on the leaky bucket based characterization of IS-IP guaranteed service flows in an IP-ATM internetwork","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Subnet; Computer network; ATM adaptation layer; Leaky bucket; Asynchronous Transfer Mode; Computer science; Token bucket; Network packet; Overhead (engineering); Packet switching; Service (business); Characterization (materials science); Operating system","score_opus":0.01168589680503195,"score_gpt":0.2123910723399615,"score_spread":0.20070517553492953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143896882","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78352463,0.000050187205,0.2133726,0.0015897808,0.00038162546,0.00051642634,0.000002673143,0.00010137777,0.0004606692],"genre_scores_gemma":[0.99632514,0.0000123271875,0.00019008244,0.0031717266,0.00013668436,0.00003515782,0.000008785786,0.000013882821,0.00010622587],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998061,0.0005273069,0.00046162936,0.0003754327,0.00027949372,0.00029512396],"domain_scores_gemma":[0.9983351,0.000569175,0.00021926734,0.00071039784,0.000105440056,0.00006057898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007482239,0.00022294809,0.0003574487,0.000087159526,0.000051644634,0.00006042845,0.00091797084,0.00011977347,0.00024364547],"category_scores_gemma":[0.000017385064,0.00015118919,0.00009449535,0.0008258792,0.00003145983,0.00022920288,0.000070508315,0.00021554503,0.00002709316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067809934,0.00062813255,0.00655936,0.000110239045,0.00008836302,0.000016884409,0.0015403754,0.15437087,0.0022658429,0.012409492,0.0010965872,0.8202357],"study_design_scores_gemma":[0.0009867857,0.0005875364,0.0027398663,0.00015870619,0.000012794291,0.0000015488786,0.0000054435454,0.9941856,0.000915606,0.000015681295,0.0002460934,0.00014433164],"about_ca_topic_score_codex":0.000033239496,"about_ca_topic_score_gemma":0.0001258126,"teacher_disagreement_score":0.8398147,"about_ca_system_score_codex":0.000022331731,"about_ca_system_score_gemma":0.000015287873,"threshold_uncertainty_score":0.6165316},"labels":[],"label_agreement":null},{"id":"W2144300439","doi":"10.1109/icc.2005.1494349","title":"Dynamics of load-sensitive adaptive routing","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Carleton University","funders":"","keywords":"Computer science; Computer network; Private Network-to-Network Interface; Link-state routing protocol; Routing protocol; Static routing; Open Shortest Path First; Routing domain; Equal-cost multi-path routing; Dynamic Source Routing; Distributed computing; Routing Information Protocol; Adaptive routing; Path vector protocol; Policy-based routing; Network packet","score_opus":0.008627552453077175,"score_gpt":0.20861659905937013,"score_spread":0.19998904660629296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144300439","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042081135,0.000025387306,0.9556007,0.002593581,0.000080822145,0.000062125175,8.3586974e-7,0.00011344974,0.037315015],"genre_scores_gemma":[0.95104355,0.0000025861018,0.047374018,0.00034663593,0.00007694244,0.0000015781842,4.092598e-7,0.000002865251,0.0011514262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993338,0.00002918753,0.00014974325,0.00016873775,0.00016888065,0.00014962301],"domain_scores_gemma":[0.99944276,0.000102896505,0.00006480328,0.00018818265,0.00015797344,0.00004340697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016175563,0.0000690353,0.00010949004,0.000023611,0.000037349782,0.000019552239,0.00023322215,0.00003148323,0.000014020315],"category_scores_gemma":[0.00001446917,0.00006097291,0.000043859392,0.00015015253,0.000029674633,0.00019406302,0.00007104835,0.0000666853,0.00004389588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004346907,0.0000151995555,0.000027854952,3.4395802e-7,0.000009373734,0.0000015819795,0.00017502622,0.0025441854,0.00001387081,0.5291767,0.0001354962,0.467896],"study_design_scores_gemma":[0.00021409977,0.000037381735,0.00021273426,0.000007860828,0.0000034266634,0.0000051425873,0.00008330037,0.99838316,0.0002966366,0.00048081198,0.00020066043,0.00007479666],"about_ca_topic_score_codex":0.000019051788,"about_ca_topic_score_gemma":0.00015778371,"teacher_disagreement_score":0.99583894,"about_ca_system_score_codex":0.00007340639,"about_ca_system_score_gemma":0.000074690244,"threshold_uncertainty_score":0.24864031},"labels":[],"label_agreement":null},{"id":"W2144383277","doi":"10.1109/e-science.2005.53","title":"Improving GridFTP Performance with Split TCP Connections","year":2006,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Western Economic Diversification Canada; Natural Sciences and Engineering Research Council of Canada; University of Calgary","keywords":"Computer science; Computer network; Zeta-TCP; TCP hole punching; Throughput; TCP tuning; Distributed computing; TCP acceleration; Bandwidth (computing); Grid; Heterogeneous network; Transmission Control Protocol; Operating system; Wireless network; Wireless; Network packet","score_opus":0.003646429267973206,"score_gpt":0.16008566311304073,"score_spread":0.15643923384506753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144383277","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.093252115,0.00004211046,0.88235813,0.001346743,0.00021173734,0.00010135171,2.9461341e-7,0.0004556318,0.022231873],"genre_scores_gemma":[0.97506154,0.0000024164426,0.019277973,0.00026410856,0.00017598453,0.000018968682,9.350225e-7,0.0000049454784,0.0051931124],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999285,0.000012489158,0.00011822467,0.00023468005,0.00013469465,0.00021491709],"domain_scores_gemma":[0.9995336,0.000041298594,0.000042180684,0.00027314512,0.00006437062,0.00004538628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008453922,0.00009025552,0.00008181467,0.000041497395,0.00017426492,0.00012148843,0.0002707034,0.000026936541,0.000042331045],"category_scores_gemma":[0.0000022263937,0.000067019035,0.00002408927,0.00024341156,0.000028620289,0.00036201446,0.000038770613,0.000082149876,0.000090274756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009619532,0.000050235463,0.0023533057,0.0000068128593,0.000009939076,0.0000071267673,0.000020423582,0.005543328,0.00012161298,0.48452562,0.003108153,0.50424385],"study_design_scores_gemma":[0.0005547394,0.00012426892,0.0075431736,0.000010170668,0.000007475407,0.000049547525,0.000010707626,0.973586,0.00023302519,0.00018560508,0.017487904,0.00020738297],"about_ca_topic_score_codex":0.00007177212,"about_ca_topic_score_gemma":0.000104695144,"teacher_disagreement_score":0.9680427,"about_ca_system_score_codex":0.000017846514,"about_ca_system_score_gemma":0.00004888371,"threshold_uncertainty_score":0.2732957},"labels":[],"label_agreement":null},{"id":"W2144388665","doi":"10.1109/mnet.2004.1301019","title":"A classification of reliable multicast protocols","year":2004,"lang":"en","type":"article","venue":"IEEE Network","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Multicast; Computer science; Protocol Independent Multicast; Computer network; Pragmatic General Multicast; IP multicast; Internet Group Management Protocol; Inter-domain; Source-specific multicast; Protocol (science); Reliable multicast; Distributed computing; Xcast","score_opus":0.02646089415217164,"score_gpt":0.2716460928994367,"score_spread":0.24518519874726505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144388665","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008229397,0.00011289247,0.97650325,0.001668343,0.0021070503,0.005922182,0.0000012838967,0.0003802151,0.005075388],"genre_scores_gemma":[0.9692098,0.0000048076313,0.02714728,0.00023069144,0.0013083487,0.0019006899,0.0000011803929,0.000009588867,0.00018759338],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989909,0.000030814077,0.0002659638,0.00025222832,0.00019977041,0.00026033912],"domain_scores_gemma":[0.9991431,0.00005289651,0.00013725933,0.0004902234,0.00010346957,0.00007300548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023738809,0.0000979213,0.0001557881,0.000027431031,0.00007843622,0.00004570719,0.00048490276,0.00006647837,0.00000383891],"category_scores_gemma":[0.000010543273,0.00009060218,0.000056044766,0.00041326953,0.000044919678,0.00017681289,0.00002954031,0.000106841806,0.000090515954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000101039885,0.0003397876,0.0010075262,0.00003728142,0.000045097557,0.000009479433,0.00030596752,0.5511209,0.0019984117,0.2906718,0.03129753,0.12306522],"study_design_scores_gemma":[0.008820836,0.0010396442,0.01843987,0.0012325431,0.000046263583,0.00004035983,0.000035850713,0.65033746,0.0029506695,0.06743093,0.24837923,0.001246313],"about_ca_topic_score_codex":0.0000072857915,"about_ca_topic_score_gemma":0.0000063347175,"teacher_disagreement_score":0.9609804,"about_ca_system_score_codex":0.00003276176,"about_ca_system_score_gemma":0.00010065705,"threshold_uncertainty_score":0.369465},"labels":[],"label_agreement":null},{"id":"W2144515215","doi":"10.1109/infcom.1990.91232","title":"End-to-end delay of multiple packet messages in window flow controlled packet switching networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université de Sherbrooke","funders":"","keywords":"Computer science; End-to-end delay; Network packet; Processing delay; Computer network; Window (computing); Queuing delay; Queueing theory; Heuristic; Packet switching; Flow control (data); Algorithm; Real-time computing; Transmission delay; Artificial intelligence; Operating system","score_opus":0.01252445212800762,"score_gpt":0.21137077899405549,"score_spread":0.19884632686604786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144515215","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031530213,0.0007729331,0.959488,0.0027369766,0.0005100518,0.00072825653,0.0000030358453,0.00023345981,0.003997125],"genre_scores_gemma":[0.9818684,0.00006639808,0.015902888,0.0010362929,0.00016402078,0.000077109165,0.0000021866115,0.000017319133,0.000865376],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974999,0.0002508233,0.0006781914,0.00055520295,0.00040341113,0.0006125063],"domain_scores_gemma":[0.99800545,0.0008537399,0.00017329278,0.0006458083,0.00009729577,0.00022441128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077452697,0.00028904394,0.0006971329,0.00021671748,0.00010272246,0.00013319682,0.0008636193,0.00014062528,0.00036198317],"category_scores_gemma":[0.00013817158,0.00023955088,0.00017582922,0.0006702077,0.00003823997,0.00038738368,0.00017351548,0.00030874708,0.00005689976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017519458,0.00025566018,0.0065137628,0.0000081666385,0.00010331693,0.0000562144,0.0008515907,0.14222765,0.00020912335,0.010515562,0.0041155503,0.8349682],"study_design_scores_gemma":[0.0064417585,0.00010180358,0.0019791054,0.000048543407,0.000014872277,0.000010092188,0.000041792668,0.9898575,0.00006490715,0.00016155279,0.0010009119,0.00027715595],"about_ca_topic_score_codex":0.000053006872,"about_ca_topic_score_gemma":0.00039556826,"teacher_disagreement_score":0.9503382,"about_ca_system_score_codex":0.00004053349,"about_ca_system_score_gemma":0.000026214755,"threshold_uncertainty_score":0.9768601},"labels":[],"label_agreement":null},{"id":"W2144551715","doi":"10.1155/mpe.2005.617","title":"Modelling and optimization of computer network traffic controllers","year":2005,"lang":"en","type":"article","venue":"Mathematical Problems in Engineering","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Traffic network; Control engineering; Engineering; Transport engineering","score_opus":0.009403635083881813,"score_gpt":0.18393983621034846,"score_spread":0.17453620112646664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144551715","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019963766,0.00030107543,0.99705225,0.00019905821,0.000056512155,0.00018637918,1.3285306e-7,0.00010970639,0.00009847932],"genre_scores_gemma":[0.6029722,0.000014290606,0.3969115,0.000018379564,0.000060013546,0.000011243446,2.2915593e-7,0.000006205376,0.000005910657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914664,0.000015561249,0.00033749038,0.00017001416,0.00011545339,0.00021481127],"domain_scores_gemma":[0.9995556,0.00017806089,0.000047709535,0.00014290457,0.000022282677,0.000053480486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003101327,0.00010730808,0.00023067842,0.0000640208,0.000019262308,0.000036426012,0.0001700401,0.000052799125,0.000005148288],"category_scores_gemma":[0.000008820125,0.00010082395,0.00003007979,0.00018158829,0.000016750932,0.00017598501,0.000046231416,0.00010899524,0.0000020316606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011856852,0.000024691448,0.0000025743452,0.00005586815,0.000007925834,5.4215866e-7,0.00018644561,0.952426,0.0000019138272,0.02705568,0.000013152561,0.020223983],"study_design_scores_gemma":[0.00047129783,0.000019864576,9.908724e-7,0.00015400621,0.0000039320485,0.000005127598,0.0000015148964,0.9984868,0.0000016677232,0.0007065862,0.00004891123,0.00009929608],"about_ca_topic_score_codex":3.4716743e-7,"about_ca_topic_score_gemma":3.5450404e-7,"teacher_disagreement_score":0.6009759,"about_ca_system_score_codex":0.00001744108,"about_ca_system_score_gemma":0.000008098458,"threshold_uncertainty_score":0.41114813},"labels":[],"label_agreement":null},{"id":"W2144555227","doi":"10.1109/tvt.2007.895469","title":"Transfer Delay Analysis of WAP 2.0 for Short-Lived Flows","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Markov chain; Network packet; File transfer; Transfer (computing); Computer science; Markov process; Wireless Application Protocol; Wireless; Algorithm; Protocol (science); Computer network; Real-time computing; Wireless network; Mathematics; Statistics; Telecommunications; Parallel computing","score_opus":0.013963696782614297,"score_gpt":0.24943327677758526,"score_spread":0.23546957999497095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144555227","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1879766,0.00009775924,0.8103186,0.0006401963,0.00025944875,0.00029674798,0.000010775373,0.000365235,0.000034624496],"genre_scores_gemma":[0.985227,0.0000268869,0.014399468,0.00016345351,0.00001611689,0.00009262076,0.0000027152066,0.00001299885,0.00005876309],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984896,0.000022014376,0.00043558888,0.00045731207,0.00020693762,0.00038853308],"domain_scores_gemma":[0.99885124,0.0001831094,0.000036851634,0.0006640605,0.00018961084,0.00007511952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038320562,0.00018614499,0.00041930366,0.0012847485,0.00014651584,0.0000147314895,0.00064340944,0.00033847953,0.000020662637],"category_scores_gemma":[0.0000042144175,0.0001801616,0.0004279183,0.0023960215,0.00010234133,0.0001264305,0.0000017218914,0.0002633144,0.000006917055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084122265,0.00030123885,0.000024986617,0.00000947078,0.0014726347,0.000020994436,0.000111341615,0.1832203,0.014125775,0.01967063,0.000017280647,0.78094125],"study_design_scores_gemma":[0.0008706316,0.00041623792,0.00006371749,0.000015062421,0.0010688396,0.0000168706,0.00006667833,0.89429355,0.10002529,0.00059961475,0.0022524616,0.000311027],"about_ca_topic_score_codex":0.000006317791,"about_ca_topic_score_gemma":0.00019623521,"teacher_disagreement_score":0.7972504,"about_ca_system_score_codex":0.00004315955,"about_ca_system_score_gemma":0.00004000144,"threshold_uncertainty_score":0.73467773},"labels":[],"label_agreement":null},{"id":"W2144708315","doi":"10.1109/tmm.2005.846778","title":"A real-time video multicast architecture for assured forwarding services","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Multimedia","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Multicast; Computer network; Unicast; Differentiated services; Xcast; Source-specific multicast; Distributed computing; IP multicast; Quality of service; Pragmatic General Multicast; Network packet","score_opus":0.008436776112164125,"score_gpt":0.23653639051733497,"score_spread":0.22809961440517085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144708315","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035214305,0.00003152352,0.9917689,0.0023740232,0.0006572895,0.0006264491,0.00003978976,0.0006301287,0.00035046198],"genre_scores_gemma":[0.7377255,0.000023243283,0.2602731,0.00041740297,0.00036792047,0.00025013133,0.000005213428,0.000029890476,0.0009076201],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982979,0.00007056836,0.00031990782,0.00054537086,0.00029288564,0.00047332232],"domain_scores_gemma":[0.9983809,0.00067639764,0.00009091919,0.00051396847,0.000117914475,0.00021989536],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002400383,0.00026624702,0.00028577403,0.00018433001,0.00030068422,0.0001351584,0.0005997551,0.00014813083,0.00006392188],"category_scores_gemma":[0.000006152725,0.00024756225,0.00024127471,0.0002745049,0.000044483448,0.0003658306,0.0000028446143,0.00025287367,0.000297141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007685139,0.00014813498,0.0000012622295,0.000016901655,0.0000762519,0.0000025241422,0.0008605389,0.123300925,0.00519843,0.000058916823,0.00029922603,0.86996],"study_design_scores_gemma":[0.0017615882,0.0001123144,0.0000249538,0.0000454475,0.000053458636,0.000011255208,0.000020044237,0.98202443,0.0047754645,0.000051963187,0.010837975,0.00028108465],"about_ca_topic_score_codex":0.000022224069,"about_ca_topic_score_gemma":0.000099245335,"teacher_disagreement_score":0.869679,"about_ca_system_score_codex":0.00006285108,"about_ca_system_score_gemma":0.000051170082,"threshold_uncertainty_score":0.9999977},"labels":[],"label_agreement":null},{"id":"W2144741748","doi":"10.1109/pacrim.2001.953671","title":"Experimental evaluation of MPEG-2 video over differentiated services IP networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Differentiated services; Quality of service; Interoperability; The Internet; Computer network; Packet loss; Throughput; Mobile QoS; Multimedia; Network packet; Service (business); IP Multimedia Subsystem; MPEG-4; Integrated services; Service provider; Telecommunications; World Wide Web; Wireless","score_opus":0.0217738201118723,"score_gpt":0.24500477908627744,"score_spread":0.22323095897440515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144741748","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6811716,0.0032402312,0.3053177,0.00029555164,0.0008045169,0.00038059783,7.1939496e-7,0.00029397133,0.0084951185],"genre_scores_gemma":[0.998803,0.000010114494,0.0004879774,0.00026674836,0.00008523263,0.000024440213,0.0000028081506,0.0000054005345,0.00031424465],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987468,0.000116796546,0.00022236443,0.00025095962,0.00048137407,0.00018170569],"domain_scores_gemma":[0.99936205,0.0000468248,0.000094751216,0.00032895544,0.00010635971,0.00006108432],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00023701323,0.0001119496,0.00013694471,0.0000460034,0.00005749783,0.000068550515,0.00039712666,0.000058071088,0.0014624537],"category_scores_gemma":[0.0000027855756,0.000094909396,0.000059310772,0.00019619413,0.000020683621,0.00031098357,0.00008375106,0.000060926293,0.00003525207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002441891,0.0007444,0.002345867,0.00001521379,0.00016135663,0.000003192926,0.001263923,0.07663621,0.0016939696,0.034062438,0.00518016,0.87786883],"study_design_scores_gemma":[0.00092322275,0.00004498788,0.003933636,0.000014817799,0.000019629817,0.0000014828615,0.000026628202,0.99380404,0.000862373,0.00009229543,0.0001702171,0.00010668173],"about_ca_topic_score_codex":0.00001983155,"about_ca_topic_score_gemma":0.000012105054,"teacher_disagreement_score":0.91716784,"about_ca_system_score_codex":0.000026548303,"about_ca_system_score_gemma":0.000007504538,"threshold_uncertainty_score":0.9994503},"labels":[],"label_agreement":null},{"id":"W2144748009","doi":"10.1109/bsc.2010.5472999","title":"Performance analysis of modern TCP variants: A comparison of Cubic, Compound and New Reno","year":2010,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Goodput; Computer science; Zeta-TCP; Computer network; TCP acceleration; TCP Westwood plus; TCP Friendly Rate Control; TCP Vegas; TCP tuning; TCP global synchronization; Transmission Control Protocol; TCP Westwood; Compound TCP; CUBIC TCP; H-TCP; HSTCP; Distributed computing; Wireless; Throughput; Network packet; Telecommunications","score_opus":0.018516403251259125,"score_gpt":0.2526611603128313,"score_spread":0.23414475706157217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144748009","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50778794,0.00011777303,0.48861456,0.00023859896,0.000110670546,0.000054949403,0.0000010702726,0.000037826565,0.0030366029],"genre_scores_gemma":[0.9795345,0.0000145682225,0.019997379,0.000054426684,0.000024887113,0.0000012992484,0.000001430078,0.0000026950668,0.00036878302],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913067,0.000022127204,0.0003138283,0.00021524796,0.00018727305,0.0001308511],"domain_scores_gemma":[0.99914706,0.00010411644,0.00015602034,0.00040896796,0.00009169742,0.00009214787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016884992,0.000088854904,0.00036331994,0.00015467418,0.00004142561,0.000032084346,0.00039588797,0.00005257221,0.00006234681],"category_scores_gemma":[0.00000943645,0.0000750579,0.000062731524,0.0005649705,0.00006473002,0.00020255064,0.000085954525,0.00011492576,0.0000025054283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002966837,0.0001593924,0.053104877,0.000016595686,0.0004865102,8.070046e-7,0.0010703554,0.009611687,0.0046453974,0.053464983,0.00092467974,0.87648505],"study_design_scores_gemma":[0.00033246915,0.00005630551,0.03130277,0.0000057662387,0.00012999993,0.0000015918631,0.000009013197,0.9672378,0.00030695944,0.00018001924,0.00035753305,0.00007981035],"about_ca_topic_score_codex":0.00006996547,"about_ca_topic_score_gemma":0.00020213565,"teacher_disagreement_score":0.9576261,"about_ca_system_score_codex":0.0000024101348,"about_ca_system_score_gemma":0.000055729004,"threshold_uncertainty_score":0.30607724},"labels":[],"label_agreement":null},{"id":"W2145087223","doi":"10.1109/tbc.2004.842517","title":"Application-Aware Buffer Management: New Metrics and Techniques","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Broadcasting","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Packet loss; Computer science; Video quality; Computer network; Quality of service; Buffer (optical fiber); Data loss; Transmission loss; Transmission (telecommunications); Network packet; Real-time computing; Telecommunications; Engineering","score_opus":0.011091529052085937,"score_gpt":0.22897291418492688,"score_spread":0.21788138513284094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145087223","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035609285,0.00014013155,0.9955177,0.0012108824,0.00013188187,0.0002497339,0.0000014831909,0.00059423165,0.0017979164],"genre_scores_gemma":[0.89215,0.00009824605,0.10561992,0.0005237778,0.00014396114,0.000059754602,4.3785636e-7,0.000012514796,0.001391431],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897724,0.000025037361,0.00020360315,0.00037432567,0.00019655112,0.00022323454],"domain_scores_gemma":[0.99933225,0.000120260636,0.00005841035,0.00032258857,0.000042598836,0.0001239072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013771876,0.00014490845,0.00011967168,0.00022164272,0.00024728183,0.0001280438,0.0003050973,0.00006134948,0.000015321337],"category_scores_gemma":[0.0000019078839,0.00014829644,0.00004824859,0.00060308696,0.000022750193,0.00033561897,0.0000041874755,0.00018070322,0.000049861097],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038111236,0.000035924906,0.0000063989282,0.0000064469086,0.000017798073,0.0000015203154,0.00006565676,0.004324609,0.000071539536,0.0019637926,0.00029625255,0.99320626],"study_design_scores_gemma":[0.00066496443,0.000079710015,0.0000791626,0.00006699128,0.000053062653,0.000045868626,0.00003626512,0.9385416,0.0042103822,0.00039988218,0.05542435,0.00039779543],"about_ca_topic_score_codex":0.000013269725,"about_ca_topic_score_gemma":0.000009402858,"teacher_disagreement_score":0.99280846,"about_ca_system_score_codex":0.000043112166,"about_ca_system_score_gemma":0.00002064819,"threshold_uncertainty_score":0.6047354},"labels":[],"label_agreement":null},{"id":"W2145091127","doi":"10.1109/icc.2005.1494606","title":"A distributed bandwidth-guaranteed routing algorithm for point-to-multipoint VPLS virtual connections","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Queen's University","funders":"","keywords":"Multiprotocol Label Switching; Computer science; Computer network; Label Distribution Protocol; Label switching; Distributed computing; Algorithm; Distributed algorithm; Routing protocol; Blocking (statistics); Quality of service; Routing (electronic design automation)","score_opus":0.010004420759199283,"score_gpt":0.23580181660397623,"score_spread":0.22579739584477695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145091127","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010849456,0.000027999238,0.98687243,0.009629225,0.0005073394,0.0006960391,0.000046005523,0.0006766757,0.00045930955],"genre_scores_gemma":[0.7487087,0.0000019252793,0.24641833,0.0029206574,0.00054803945,0.00020219744,0.000013877506,0.0000148906865,0.0011713926],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834144,0.0000501009,0.0003880467,0.0005117584,0.00019925274,0.00050940714],"domain_scores_gemma":[0.9986808,0.0004369853,0.00007948207,0.00039231285,0.0001889642,0.00022145822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039136122,0.0002024044,0.00024742732,0.000095605435,0.00033202072,0.00022275213,0.0005408128,0.00007733987,0.000054259937],"category_scores_gemma":[0.00011385203,0.00018265416,0.0001542756,0.0004096176,0.000028046115,0.00034324784,0.000115833915,0.00012807925,0.00016026212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013773491,0.00008024417,0.00001749946,9.768327e-7,0.000033532007,0.0000018797007,0.00020510172,0.00420098,0.0000859629,0.06793938,0.006208356,0.9212123],"study_design_scores_gemma":[0.001612983,0.00018573196,0.000099986966,0.000016624654,0.000013078136,0.000024190791,0.000098607314,0.95961356,0.0003769041,0.00020343506,0.037494414,0.00026047893],"about_ca_topic_score_codex":0.000020375277,"about_ca_topic_score_gemma":0.00006524916,"teacher_disagreement_score":0.95541257,"about_ca_system_score_codex":0.00008188615,"about_ca_system_score_gemma":0.00007273094,"threshold_uncertainty_score":0.74484205},"labels":[],"label_agreement":null},{"id":"W2145206052","doi":"10.1109/infcom.1990.91338","title":"Perspectives on FDDI and DQDB MAN technologies","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Fiber Distributed Data Interface; Distributed-queue dual-bus; Computer network; Computer science; Queue; Local area network","score_opus":0.010403205255151681,"score_gpt":0.18725540237474905,"score_spread":0.17685219711959738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145206052","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06499631,0.008937593,0.50687134,0.11350857,0.00045286916,0.00046156926,0.0000010099119,0.006977315,0.29779345],"genre_scores_gemma":[0.99133104,0.00021319986,0.0053608627,0.0002684523,0.000020844596,0.0000068769073,2.9381807e-8,0.0000021609187,0.0027965289],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995121,0.00001032038,0.000051889914,0.00022502236,0.0000784758,0.00012223236],"domain_scores_gemma":[0.99966705,0.000048648766,0.000014357125,0.00023036367,0.000017780318,0.000021777665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003766147,0.00006485377,0.00006307781,0.000049381226,0.000070114955,0.00007528429,0.00024553805,0.00003569809,0.00004534855],"category_scores_gemma":[0.000014369229,0.0000493453,0.000016303416,0.000117975804,0.00005461743,0.00011479289,0.00006470611,0.00007110744,0.00009152171],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.614713e-7,0.000018982162,0.000046499183,4.5845587e-7,0.0000039698475,0.000003653061,0.00026963552,0.00001098205,0.000007253718,0.4068797,0.0032898223,0.5894684],"study_design_scores_gemma":[0.0012391058,0.0006288736,0.0019720593,0.000032309188,0.000009830375,0.00006016842,0.00521728,0.91094553,0.000355321,0.012236024,0.066689394,0.0006140778],"about_ca_topic_score_codex":0.0000011519952,"about_ca_topic_score_gemma":0.0000017029267,"teacher_disagreement_score":0.92633474,"about_ca_system_score_codex":0.00000870825,"about_ca_system_score_gemma":0.0000019927556,"threshold_uncertainty_score":0.2012243},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014448503699051563,"score_gpt":0.19920925923742605,"score_spread":0.18476075553837448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145208701","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009625901,0.0009822177,0.9797477,0.0036892411,0.0004836839,0.00031821383,0.0000049316304,0.00020228147,0.004945825],"genre_scores_gemma":[0.9808932,0.000050736937,0.014970963,0.00040141534,0.00018057402,0.000025418116,0.0000011423092,0.0000061460687,0.0034703845],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923486,0.000024670473,0.00019245742,0.00018732408,0.00016976998,0.00019091927],"domain_scores_gemma":[0.9984295,0.0009958787,0.00006846777,0.00034788979,0.00010789587,0.00005040543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017290244,0.00008782748,0.00012504046,0.000032145013,0.00009498687,0.00003777588,0.00060389144,0.000037842994,0.00031329584],"category_scores_gemma":[0.000042748903,0.000056842404,0.000081346974,0.00016607891,0.000055022992,0.00014813482,0.00006602859,0.00005387106,0.000072107454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075149337,0.000043858745,0.000018483277,0.0000037365335,0.00003150497,0.0000013293032,0.0003063772,0.00101727,0.00011072938,0.02452561,0.029019393,0.9449142],"study_design_scores_gemma":[0.00047266012,0.000060214563,0.00009162562,0.000008315172,0.000014164502,0.0000022559877,0.0000442796,0.98736244,0.00014766578,0.00012688154,0.011588039,0.000081446226],"about_ca_topic_score_codex":0.000008357854,"about_ca_topic_score_gemma":0.000019122775,"teacher_disagreement_score":0.9863452,"about_ca_system_score_codex":0.000008162644,"about_ca_system_score_gemma":0.000018527042,"threshold_uncertainty_score":0.34303698},"labels":[],"label_agreement":null},{"id":"W2145338914","doi":"10.1109/iwisa.2010.5473743","title":"Research on Low-Rate Denial-of-Service Attacks against XCP","year":2010,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Windsor","keywords":"Denial-of-service attack; Computer network; Header; Computer science; Communication source; Network congestion; Throughput; Network packet; Computer security; Protocol (science); Transmission Control Protocol; Service (business); Telecommunications; Business; The Internet; Operating system","score_opus":0.03576820584613642,"score_gpt":0.32396302832559404,"score_spread":0.2881948224794576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145338914","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79440814,0.00003483196,0.08728389,0.017486524,0.0019779748,0.00039836974,0.0000019705221,0.0003930655,0.098015204],"genre_scores_gemma":[0.99274904,0.000006858645,0.0028680025,0.0024296707,0.00024273261,0.00001594177,0.0000010710655,0.000007903118,0.0016787988],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851483,0.00014878997,0.00020606276,0.00035568862,0.00040990373,0.0003647372],"domain_scores_gemma":[0.9981239,0.00050792855,0.00004712831,0.00076396717,0.00041543352,0.00014166119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011438011,0.000105205974,0.00013920627,0.00013407055,0.00013941912,0.00011309198,0.0011568888,0.000101021105,0.00010117162],"category_scores_gemma":[0.000044384687,0.00008618173,0.00004656434,0.0007301791,0.00007055857,0.00018075727,0.00018802185,0.00051940477,0.000723055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004778165,0.00020451553,0.00013623055,0.000019830768,0.000023733372,0.000025692414,0.00028136192,0.002467086,0.008918306,0.4537059,0.012943661,0.5212259],"study_design_scores_gemma":[0.0016767714,0.00030186147,0.003894058,0.00008601205,0.00000590628,0.0000065168115,0.00010090537,0.9368297,0.010692577,0.0034443338,0.04247231,0.00048904715],"about_ca_topic_score_codex":0.000033929722,"about_ca_topic_score_gemma":0.00029093228,"teacher_disagreement_score":0.9343626,"about_ca_system_score_codex":0.000011279197,"about_ca_system_score_gemma":0.00013535918,"threshold_uncertainty_score":0.92936504},"labels":[],"label_agreement":null},{"id":"W2145566973","doi":"10.1109/icc.2006.254795","title":"Performance of Wireless Profiled TCP in Heterogeneous Wireless Networks","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Throughput; Wireless; TCP acceleration; Transmission (telecommunications); TCP global synchronization; Computer network; Wireless network; Zeta-TCP; CUBIC TCP; TCP tuning; Heterogeneous network; TCP Friendly Rate Control; H-TCP; Telecommunications","score_opus":0.03547833174263766,"score_gpt":0.2772262848521024,"score_spread":0.24174795310946473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145566973","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8160972,0.00021696583,0.119372584,0.0059192674,0.0011763487,0.00065361155,0.000036440837,0.00026694557,0.056260623],"genre_scores_gemma":[0.9969611,0.00033004704,0.0017390711,0.0001611291,0.00008383446,0.00012467192,0.000044102675,0.000010940165,0.00054508896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984311,0.00014357945,0.0005499284,0.00029540865,0.00033495206,0.00024505987],"domain_scores_gemma":[0.9979291,0.00018736008,0.00026103423,0.0012086055,0.00036570392,0.00004820492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024044955,0.000175378,0.00022708392,0.00020391779,0.000111426474,0.00009203985,0.0029123828,0.00009499395,0.00004410334],"category_scores_gemma":[0.000006971208,0.00018113288,0.00007352741,0.00034486398,0.00015325079,0.00026880775,0.00020714934,0.00030942823,0.000035547055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008458961,0.0009309692,0.013000748,0.000012005219,0.000057056997,0.000007792096,0.00013261824,0.09091375,0.0011678358,0.6926398,0.0010424026,0.2000104],"study_design_scores_gemma":[0.0005121664,0.00006346776,0.0034095093,0.00011145503,0.000004046336,0.000007758376,0.0000088138595,0.9942772,0.00042448117,0.0005078365,0.0004974374,0.00017584715],"about_ca_topic_score_codex":0.00015088063,"about_ca_topic_score_gemma":0.0004577677,"teacher_disagreement_score":0.9033634,"about_ca_system_score_codex":0.00008202696,"about_ca_system_score_gemma":0.00012178451,"threshold_uncertainty_score":0.73863846},"labels":[],"label_agreement":null},{"id":"W2145601264","doi":"10.5539/cis.v4n4p64","title":"Investigation of QoS Multicast Routing Based on Intelligent Multiple Constrained","year":2011,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Multicast; Computer network; Protocol Independent Multicast; Distance Vector Multicast Routing Protocol; Xcast; Distributed computing; Pragmatic General Multicast; Source-specific multicast; Quality of service; Packet loss; Inter-domain; Network packet","score_opus":0.03183967508221781,"score_gpt":0.2174133411191931,"score_spread":0.1855736660369753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145601264","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0392514,0.0000023447142,0.9581839,0.00011706495,0.00037312286,0.0001504441,0.0000011751325,0.00007434958,0.0018462054],"genre_scores_gemma":[0.92546594,0.0000015370064,0.0735671,0.000931894,0.00002511054,0.000004684235,0.0000013751162,0.0000011577388,0.0000012299593],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901086,0.000025800202,0.00033165695,0.0001621758,0.00030096123,0.00016853014],"domain_scores_gemma":[0.9991008,0.00012436656,0.00016372629,0.00023964244,0.00025231854,0.00011916025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005958669,0.0000894187,0.00010103131,0.00023442184,0.00015475103,0.00012954992,0.00044743269,0.00002696656,0.000005646718],"category_scores_gemma":[0.000066699904,0.000076542645,0.000024429428,0.00051793945,0.000344114,0.0027939829,0.000102634534,0.000068324254,0.000016243868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016985108,0.000022100097,0.004991851,0.000017529688,0.0000037512953,5.918503e-7,0.0052487687,0.0036899708,0.00016281017,0.17426766,0.000058306363,0.8115197],"study_design_scores_gemma":[0.00034712115,0.00011740996,0.014001867,0.000034845165,0.0000014852162,0.0000029906282,0.000033322453,0.9826256,0.0025181882,0.00008622482,0.00014386328,0.00008708356],"about_ca_topic_score_codex":0.000008166315,"about_ca_topic_score_gemma":4.0183005e-7,"teacher_disagreement_score":0.9789356,"about_ca_system_score_codex":0.000017354241,"about_ca_system_score_gemma":0.00012921753,"threshold_uncertainty_score":0.31213185},"labels":[],"label_agreement":null},{"id":"W2145757237","doi":"10.1109/ccece.1996.548312","title":"Performance evaluation of bursty traffic using neural networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Burstiness; Computer science; Traffic intensity; Traffic generation model; Traffic shaping; Queue; Real-time computing; Network packet; Traffic policing; Artificial neural network; Queueing theory; Computer network; Network traffic control; Packet loss; Hurst exponent; Artificial intelligence; Statistics","score_opus":0.049768893396802814,"score_gpt":0.25031686062939373,"score_spread":0.2005479672325909,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145757237","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81703,0.00043215012,0.17987396,0.00016493013,0.00037733224,0.00014441017,9.034904e-8,0.00010199328,0.0018751376],"genre_scores_gemma":[0.997317,0.000017396447,0.0023513897,0.000100746016,0.00010410063,0.0000053558756,3.5924947e-7,0.0000040063314,0.00009961616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989616,0.00008702562,0.00019913653,0.0001895591,0.00037574003,0.00018688648],"domain_scores_gemma":[0.999407,0.000040043666,0.00007922276,0.00027600513,0.00015025013,0.00004748462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004636597,0.000084974854,0.000111988404,0.00004628168,0.00007377964,0.000034112356,0.00031111707,0.00004270157,0.00015634757],"category_scores_gemma":[0.000009281546,0.00007385074,0.000045475037,0.00029943942,0.000029025483,0.0003349831,0.00003388699,0.00007624634,0.0000083590485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.005047e-7,0.000013280484,0.00012864104,7.3614495e-7,0.0000032043827,1.5695491e-7,0.000033151562,0.52165043,0.0000035469172,0.00028070543,0.00008924484,0.47779608],"study_design_scores_gemma":[0.00040761443,0.000039983828,0.00089630217,0.000007601382,0.000018838384,0.000007833477,0.000005028988,0.99847096,0.000009074812,0.0000055487267,0.000045792207,0.000085433865],"about_ca_topic_score_codex":0.000001891127,"about_ca_topic_score_gemma":0.0000021469339,"teacher_disagreement_score":0.47771066,"about_ca_system_score_codex":0.000026897453,"about_ca_system_score_gemma":0.000013351901,"threshold_uncertainty_score":0.30115455},"labels":[],"label_agreement":null},{"id":"W2145806741","doi":"10.1109/icc.1998.683075","title":"An admission control scheme for the real-time VBR traffic in the ATM network: deterministic bandwidth allocation","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Admission control; Quality of service; Computer network; Variable bitrate; Bandwidth allocation; Bandwidth (computing); Dynamic bandwidth allocation; Call Admission Control; Scheduling (production processes); Spare part; Network traffic control; Real-time computing; Traffic policing; Traffic shaping; Bandwidth management; Distributed computing; Mathematical optimization; Network packet; Telecommunications; Engineering","score_opus":0.01752982804099579,"score_gpt":0.2438096299707881,"score_spread":0.2262798019297923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145806741","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016897596,0.00053047965,0.9623724,0.015238739,0.000453477,0.0018701572,0.0000023805965,0.00038804807,0.0022467023],"genre_scores_gemma":[0.99192154,0.000065664026,0.004603044,0.0019909567,0.0004275261,0.00022541302,0.0000036692281,0.00001125231,0.0007509275],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842125,0.000236347,0.00031574737,0.0003747639,0.00022127568,0.0004306327],"domain_scores_gemma":[0.9977701,0.0012413738,0.00009796205,0.0007216389,0.000071494265,0.000097487544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009879239,0.00017543638,0.00018478405,0.000032988835,0.00035413314,0.00025196094,0.0011781458,0.00008204005,0.00011166731],"category_scores_gemma":[0.00005130056,0.00009645123,0.00008531713,0.00031704034,0.00004824454,0.00026830807,0.000023094392,0.00013728837,0.000056608053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058231424,0.00019619738,0.00009301167,0.0000055234486,0.000023889806,0.000006739582,0.00061669445,0.07003734,0.00010807685,0.027083363,0.01657287,0.88519806],"study_design_scores_gemma":[0.0012136602,0.0002036703,0.00081328483,0.000013908331,0.000020278983,0.0000092057035,0.00002991059,0.9909307,0.0000021162396,0.00026354252,0.006355496,0.00014425114],"about_ca_topic_score_codex":0.00000726062,"about_ca_topic_score_gemma":0.00005230212,"teacher_disagreement_score":0.9750239,"about_ca_system_score_codex":0.000024047335,"about_ca_system_score_gemma":0.00004235116,"threshold_uncertainty_score":0.39331672},"labels":[],"label_agreement":null},{"id":"W2145873975","doi":"10.1109/tnet.2006.876191","title":"Deterministic packet marking for time-varying congestion price estimation","year":2006,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Explicit Congestion Notification; Header; Network packet; Network congestion; Probabilistic logic; Path (computing); Computer network; Router; Real-time computing","score_opus":0.014281859668981167,"score_gpt":0.23712905641764304,"score_spread":0.22284719674866188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145873975","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023191636,0.00014438348,0.9924755,0.00065654423,0.0022347546,0.0006245628,0.000006939964,0.00066703715,0.00087112235],"genre_scores_gemma":[0.9274666,0.000018205132,0.07058152,0.00024353748,0.00083455135,0.00022417266,0.000016430618,0.00003800575,0.0005770025],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978416,0.00011743799,0.00049771776,0.00062861,0.00032419836,0.0005904515],"domain_scores_gemma":[0.9977672,0.0011143092,0.00022644395,0.00066255545,0.00012310916,0.00010639636],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047729947,0.0003072355,0.00029073155,0.00020144954,0.00074153015,0.0003462101,0.0006324551,0.00016162597,0.00002066389],"category_scores_gemma":[0.000020867692,0.00033518422,0.00017918958,0.0005355419,0.00005009493,0.00045481723,0.000008805581,0.00027164488,0.000064570755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043780416,0.00006661269,0.00001168618,0.00001478993,0.000023451958,0.0000061019796,0.00003869095,0.39066917,0.00016811007,0.0007502408,0.00042351073,0.60778385],"study_design_scores_gemma":[0.0008870767,0.00012985892,0.000114748625,0.0001795478,0.00006396508,0.00003520107,0.0000032888333,0.9888073,0.00023921648,0.004419818,0.0047442247,0.00037575685],"about_ca_topic_score_codex":0.000010591619,"about_ca_topic_score_gemma":0.000014752327,"teacher_disagreement_score":0.9251474,"about_ca_system_score_codex":0.00013881162,"about_ca_system_score_gemma":0.00007944882,"threshold_uncertainty_score":0.99991},"labels":[],"label_agreement":null},{"id":"W2146132454","doi":"10.1109/ccece.2007.127","title":"Efficient Delivery of Voice Services over MPLS Internet Infrastructure","year":2007,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Multiprotocol Label Switching; Computer network; Computer science; Testbed; Network packet; Label switching; Voice over IP; Scalability; The Internet; Packet switching; Private network; Quality of service; Operating system","score_opus":0.0035789367331831297,"score_gpt":0.20462347303088466,"score_spread":0.20104453629770153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146132454","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5521074,0.00011335173,0.44282055,0.00006981613,0.00030779417,0.00006404752,5.488152e-7,0.00009159815,0.0044248924],"genre_scores_gemma":[0.9913996,0.000002450372,0.0073463116,0.00081559224,0.00007540693,0.0000010652276,7.9161293e-7,0.000003945209,0.0003548346],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907786,0.000018932,0.00023412438,0.00022275597,0.0002300644,0.00021625667],"domain_scores_gemma":[0.99933237,0.00011142535,0.00008982813,0.00029000413,0.00009812532,0.000078247635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023686989,0.00010310057,0.00012765553,0.00007347707,0.000024512934,0.00005185073,0.0006053414,0.0000596993,0.00009804343],"category_scores_gemma":[0.0000029628538,0.0000823906,0.000053749438,0.00024154084,0.000028998018,0.000111686844,0.00015947795,0.000089098925,0.00003848225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007692829,0.00013555016,0.008976299,0.000060778246,0.00008796832,0.00002866619,0.0017559356,0.032341365,0.0012875348,0.1203534,0.0038750481,0.83102053],"study_design_scores_gemma":[0.0006322934,0.000077304096,0.056846015,0.000040097362,0.000010747831,0.000012227973,0.00010284605,0.9325108,0.001272539,0.00034314778,0.007951542,0.00020047408],"about_ca_topic_score_codex":0.000051371433,"about_ca_topic_score_gemma":0.0000726885,"teacher_disagreement_score":0.9001694,"about_ca_system_score_codex":0.00001848205,"about_ca_system_score_gemma":0.000025578996,"threshold_uncertainty_score":0.3359791},"labels":[],"label_agreement":null},{"id":"W2146369683","doi":"","title":"An Ecient Mechanism for Dierentiated Quality of Internet Service","year":2003,"lang":"en","type":"preprint","venue":"RePEc: Research Papers in Economics","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Network packet; Computer network; Provisioning; Quality of service; The Internet; Revenue; Computer science; Service (business); Equivalence (formal languages); Business; Mathematics; Marketing; Finance; World Wide Web","score_opus":0.05559499752014699,"score_gpt":0.34103547631367415,"score_spread":0.2854404787935272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146369683","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81825536,0.00021146274,0.1519986,0.0017784534,0.0038908874,0.004338677,0.00021165253,0.00029734097,0.01901757],"genre_scores_gemma":[0.98946196,0.00043918914,0.008764703,0.0002736682,0.0000893825,0.00035679163,0.000054203323,0.000029782228,0.00053032703],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99644345,0.000623615,0.00088809215,0.0011035405,0.00029555114,0.00064576184],"domain_scores_gemma":[0.99675536,0.0005153477,0.0003638258,0.0015819722,0.0005709498,0.00021253925],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0031737138,0.00026719653,0.00060033624,0.00029353358,0.00007503696,0.00020207033,0.0021857745,0.0003561053,0.000027643062],"category_scores_gemma":[0.00018931941,0.00028973795,0.00018260587,0.00019159826,0.0000881158,0.00016299204,0.0008325432,0.00076126406,0.0000043263126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002113521,0.0007083365,0.00046848803,0.00052030885,0.00023365229,0.000005858721,0.0010381594,0.027878694,0.0004804434,0.33521926,0.00012070114,0.63311476],"study_design_scores_gemma":[0.0012848801,0.00021619238,0.000768372,0.00016452503,0.000008116867,0.0000021969297,0.00015866425,0.9694562,0.0006205097,0.02507332,0.0017802498,0.00046680606],"about_ca_topic_score_codex":0.00011978502,"about_ca_topic_score_gemma":0.00066842797,"teacher_disagreement_score":0.9415775,"about_ca_system_score_codex":0.00033281287,"about_ca_system_score_gemma":0.00056589535,"threshold_uncertainty_score":0.9999555},"labels":[],"label_agreement":null},{"id":"W2146438427","doi":"10.1109/wimob.2007.4390799","title":"Performance Evaluation of the PRRA MAC Protocol for GEO Satellite Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Computer network; Quality of service; Reservation; Geosynchronous orbit; Videoconferencing; Communications satellite; Bandwidth allocation; Throughput; Bandwidth (computing); Access control; Resource allocation; Time division multiple access; Satellite; Telecommunications; Wireless; Engineering","score_opus":0.034219143546526005,"score_gpt":0.306400926160018,"score_spread":0.272181782613492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146438427","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002744595,0.000018096991,0.8919161,0.0003474057,0.0002575256,0.095802605,1.7265512e-7,0.00007047556,0.008843056],"genre_scores_gemma":[0.92599696,0.0000012541002,0.006199557,0.00031424427,0.00018483022,0.066618346,4.8470764e-7,0.0000057412726,0.00067856006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896246,0.000050833445,0.00024236545,0.00017110443,0.0003598877,0.00021335237],"domain_scores_gemma":[0.99909323,0.00011099153,0.00012132546,0.00035983426,0.00028071515,0.00003392523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022035895,0.000077326644,0.00008218414,0.000023713437,0.00009820581,0.000029575156,0.00047472454,0.000047357706,0.000021875603],"category_scores_gemma":[0.000019722647,0.000048167207,0.000059636244,0.00024198447,0.00003054364,0.00015754845,0.000054248972,0.000063411935,0.0000036111694],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027224452,0.000022236643,0.0013257616,0.00000772665,0.0000061030705,3.213374e-8,0.000037597463,0.016073074,0.0000134933625,0.010159215,0.00040155597,0.971926],"study_design_scores_gemma":[0.0009319226,0.000057584657,0.020101825,0.000023049173,0.000008576721,0.0000012892948,0.0000041181156,0.9657647,0.00036210593,0.0002081876,0.012470238,0.00006640159],"about_ca_topic_score_codex":0.0000015446976,"about_ca_topic_score_gemma":0.000014792595,"teacher_disagreement_score":0.9718596,"about_ca_system_score_codex":0.000026844345,"about_ca_system_score_gemma":0.000072891075,"threshold_uncertainty_score":0.19642018},"labels":[],"label_agreement":null},{"id":"W2146443097","doi":"10.1109/icc.1995.525208","title":"Fast simulation for self-similar traffic in ATM networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Instituto de Telecomunicações","keywords":"Queueing theory; Computer science; Transient (computer programming); Queue; Gaussian; Steady state (chemistry); Large deviations theory; Fractal; Real-time computing; Simulation; Statistical physics; Computer network; Mathematics; Physics","score_opus":0.015632989719329447,"score_gpt":0.22151159646743426,"score_spread":0.20587860674810482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146443097","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050436216,0.00022576503,0.9909007,0.0011644488,0.00029702912,0.00040816166,3.3188704e-7,0.0004201365,0.0015397859],"genre_scores_gemma":[0.9805061,0.000021696182,0.017935216,0.00063926086,0.00017654848,0.000050058217,0.0000014245751,0.000007777367,0.0006618807],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905807,0.000037438607,0.00022305877,0.00029501988,0.00009573844,0.00029066994],"domain_scores_gemma":[0.9993168,0.00028392646,0.000045040884,0.00024703165,0.000041685882,0.00006550392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001775539,0.0001134024,0.00013353094,0.000060804035,0.000072991235,0.00008697523,0.00032359868,0.00007922952,0.000056745957],"category_scores_gemma":[0.00001172276,0.00010498216,0.00006532927,0.00030628897,0.000009957243,0.00026884335,0.000027651666,0.000086298365,0.000031812633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034135553,0.00004351834,0.00004054304,0.0000013999478,0.000004222732,0.0000013262639,0.00010449258,0.6481278,2.1439e-7,0.005278359,0.0011652514,0.34522948],"study_design_scores_gemma":[0.0012373494,0.000054536908,0.00016706291,0.0000059020776,0.0000041195876,0.0000012484442,0.0000071290483,0.9910765,6.5376975e-7,0.00010484457,0.0072097,0.00013094195],"about_ca_topic_score_codex":8.7883404e-7,"about_ca_topic_score_gemma":0.000027628335,"teacher_disagreement_score":0.9754625,"about_ca_system_score_codex":0.00003137431,"about_ca_system_score_gemma":0.0000075995117,"threshold_uncertainty_score":0.42810482},"labels":[],"label_agreement":null},{"id":"W2146888913","doi":"10.1109/mmcs.1999.778452","title":"A fuzzy-based traffic controller for high-speed ATM networks using realistic traffic models","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Asynchronous Transfer Mode; Quality of service; Multiplexing; Controller (irrigation); Fuzzy logic; Statistical time division multiplexing; Computer network; Leaky bucket; Data stream mining; Real-time computing; Data mining; Telecommunications","score_opus":0.029531992587586143,"score_gpt":0.23982595077129573,"score_spread":0.21029395818370958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146888913","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011060072,0.00040967323,0.98438746,0.00057149015,0.00078315183,0.0010343326,0.0000060754237,0.00065580924,0.0010919531],"genre_scores_gemma":[0.9389679,0.000007854374,0.058830533,0.001425975,0.00022249806,0.000077396115,0.00000998109,0.000038897782,0.0004189735],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972025,0.00022169313,0.00058122043,0.0008002908,0.00034137798,0.0008529076],"domain_scores_gemma":[0.9979904,0.00067758845,0.0001859727,0.0006118001,0.00025294477,0.00028123803],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006897121,0.00039556343,0.0005703211,0.00013801479,0.0003491099,0.00029595528,0.00067396864,0.00021595137,0.000023346687],"category_scores_gemma":[0.000057517093,0.0003519635,0.0002640002,0.0005393612,0.000079122954,0.0003712822,0.000025506295,0.00020431858,0.000011155533],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060777256,0.00008486473,8.0343784e-7,0.0000061710266,0.00003707436,0.0000052177356,0.00002867577,0.71788883,0.0000097738475,0.23181196,0.0009551866,0.049110644],"study_design_scores_gemma":[0.0051087076,0.00015306234,0.0000037625045,0.00002717891,0.00007168718,0.000012285096,0.000014584373,0.99010885,0.000007723627,0.003401895,0.00064569875,0.0004445387],"about_ca_topic_score_codex":0.000012167481,"about_ca_topic_score_gemma":0.00003130686,"teacher_disagreement_score":0.9279078,"about_ca_system_score_codex":0.00010261599,"about_ca_system_score_gemma":0.000279396,"threshold_uncertainty_score":0.99989325},"labels":[],"label_agreement":null},{"id":"W2146908812","doi":"10.1109/lcomm.2004.823370","title":"Characterization of Jitter and Admission Control in Multiservice Networks","year":2004,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Jitter; Computer science; Computer network; Bandwidth (computing); Probabilistic logic; Network packet; Admission control; Quality of service; Telecommunications","score_opus":0.011030276273553812,"score_gpt":0.2257467526964682,"score_spread":0.2147164764229144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146908812","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2862542,0.00013953357,0.685287,0.027953431,0.00010014562,0.0001876497,0.000001457749,0.00004893403,0.000027665828],"genre_scores_gemma":[0.9873275,0.00016581723,0.0065520094,0.0058724675,0.000026409374,0.000036575395,0.000008148185,0.0000062173476,0.0000048600873],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992185,0.00012223524,0.00026198087,0.0001655999,0.00008930861,0.00014234467],"domain_scores_gemma":[0.99872494,0.00011412146,0.00012064488,0.0009384011,0.000047339436,0.00005454987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017867638,0.00009098166,0.00014230915,0.00009719462,0.000083047526,0.000040123734,0.0008367449,0.000049314247,0.0000016245333],"category_scores_gemma":[0.000007887504,0.00009249262,0.000026801396,0.00028453665,0.00007127881,0.0003071116,0.00009846048,0.00015682254,0.0000036251843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007464662,0.00057099067,0.011780291,0.00004320518,0.00007767688,0.000012169014,0.003168445,0.0816524,0.53914076,0.023705544,0.00022881782,0.33954504],"study_design_scores_gemma":[0.0033997952,0.000036759677,0.048515473,0.00017893482,0.000016186292,0.000010588414,0.00001583889,0.9450857,0.00068064075,0.00016893668,0.0016317571,0.00025941356],"about_ca_topic_score_codex":0.00003604052,"about_ca_topic_score_gemma":0.000046597503,"teacher_disagreement_score":0.8634333,"about_ca_system_score_codex":0.000029923982,"about_ca_system_score_gemma":0.000024086294,"threshold_uncertainty_score":0.37717396},"labels":[],"label_agreement":null},{"id":"W2146997771","doi":"","title":"Real-Time Streaming of Multichannel Audio Data over Internet","year":2000,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"McGill University","funders":"","keywords":"Retransmission; The Internet; Computer science; Multimedia; Audio over Ethernet; Quality (philosophy); Event (particle physics); Sound quality; World Wide Web; Audio signal; Telecommunications; Digital audio; Speech recognition","score_opus":0.016210460332135655,"score_gpt":0.2402111636745431,"score_spread":0.22400070334240743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146997771","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38711837,0.0001783766,0.48720548,0.0011099008,0.00049440213,0.0004038551,0.00003111535,0.00087845017,0.12258005],"genre_scores_gemma":[0.96242976,0.00004126203,0.016826406,0.00012763042,0.00008303788,0.0000023968876,0.000012063969,0.0000059040417,0.020471534],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999117,0.000034775996,0.00019746937,0.00032210533,0.00015617319,0.00017246942],"domain_scores_gemma":[0.9988732,0.000099399185,0.000045523222,0.0008923651,0.00002820556,0.00006130802],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00016267905,0.0000892226,0.00014039707,0.00003126902,0.00002094189,0.000043146803,0.0012067509,0.000036164245,0.0014870445],"category_scores_gemma":[0.000009659602,0.00007581874,0.0000282479,0.0001301197,0.000028278128,0.00037527175,0.00022045722,0.000052920754,0.00026022445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012650201,0.00006612998,0.000122059224,0.0000037596485,0.00003199381,0.000007234465,0.00019395446,0.0006410986,0.00028587476,0.006325968,0.017267108,0.97504216],"study_design_scores_gemma":[0.00036207124,0.00003284051,0.00084235374,0.000018493543,0.0000066975867,0.000003419513,0.000005105663,0.9942925,0.00011586093,0.0000752857,0.0041491427,0.00009620705],"about_ca_topic_score_codex":0.00020633789,"about_ca_topic_score_gemma":0.000022855604,"teacher_disagreement_score":0.99365145,"about_ca_system_score_codex":0.000008939164,"about_ca_system_score_gemma":0.000029119432,"threshold_uncertainty_score":0.9994257},"labels":[],"label_agreement":null},{"id":"W2147021610","doi":"10.1016/j.peva.2007.10.004","title":"Buffer overflow asymptotics for multiplexed regulated traffic","year":2007,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Queue; Poisson distribution; Workload; FIFO (computing and electronics); Computer science; Network packet; Multiplexing; Queueing theory; Constant (computer programming); Upper and lower bounds; Computer network; Superposition principle; Buffer overflow; Topology (electrical circuits); Real-time computing; Mathematics; Telecommunications; Statistics; Combinatorics; Mathematical analysis","score_opus":0.02483083695767474,"score_gpt":0.2763144868650109,"score_spread":0.2514836499073362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147021610","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61385405,0.00010878359,0.38386163,0.0003038878,0.0007441969,0.00065328553,8.405794e-7,0.0001932254,0.00028006503],"genre_scores_gemma":[0.9814643,0.000013690803,0.01767732,0.00019314053,0.0003063149,0.000069696005,0.000024469784,0.000011495514,0.00023954402],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841005,0.00004338466,0.00032531918,0.00032021696,0.0005344072,0.00036662217],"domain_scores_gemma":[0.9987864,0.00019591983,0.00012251172,0.00036541128,0.00044945127,0.0000802892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025754282,0.00014234995,0.00013870912,0.00010953281,0.0002053886,0.00007781665,0.0003351424,0.00009456136,0.000025655854],"category_scores_gemma":[0.000101569014,0.00013557276,0.00006607849,0.00033192625,0.000026261372,0.00052145455,0.000027693948,0.00009277298,0.000048377686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056190474,0.00003970998,0.00032608028,0.000008323561,0.000014529005,2.1875609e-7,0.00022256532,0.09941466,0.0005470574,0.00102148,0.00055291294,0.8977963],"study_design_scores_gemma":[0.0017270113,0.00013396693,0.01894095,0.00001986311,0.000027202073,0.0000035944697,0.000009214377,0.9756124,0.0013226691,0.00008529836,0.001942338,0.00017551632],"about_ca_topic_score_codex":6.49186e-7,"about_ca_topic_score_gemma":0.000009508203,"teacher_disagreement_score":0.89762074,"about_ca_system_score_codex":0.000116319454,"about_ca_system_score_gemma":0.00011414793,"threshold_uncertainty_score":0.55284965},"labels":[],"label_agreement":null},{"id":"W2147253446","doi":"10.22215/etd/2009-06484","title":"Policy-enabled traffic engineering in maritime tactical networks","year":2009,"lang":"en","type":"dissertation","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Library and Archives Canada","funders":"","keywords":"Political science; Operations research; Telecommunications; Computer science; Engineering","score_opus":0.004235887847854236,"score_gpt":0.2183274853074745,"score_spread":0.21409159745962028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147253446","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03168434,0.0025072922,0.8063199,0.005430133,0.0047297548,0.0021205074,0.000002219289,0.0040435144,0.14316234],"genre_scores_gemma":[0.97768843,0.00012807477,0.003935417,0.00060186104,0.0007954713,0.000056491866,0.00009386767,0.000035776593,0.016664604],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807185,0.000052442752,0.00043227183,0.0005574406,0.00027788113,0.00060813566],"domain_scores_gemma":[0.9990882,0.00017195,0.000086817585,0.00042989332,0.000056622117,0.000166513],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022287943,0.00034589414,0.00043031605,0.00041309663,0.000052215622,0.00025271694,0.00077904906,0.0004552678,0.000039114937],"category_scores_gemma":[0.000057613935,0.0003527892,0.00012990789,0.00084067753,0.000007150037,0.00027445523,0.00002776722,0.00073273014,0.00004444873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026221076,0.00007233079,0.0000059347844,0.000016510226,0.000021237105,0.000069144655,0.000073404415,0.218242,0.0000021225144,0.0806442,0.0010942068,0.6997327],"study_design_scores_gemma":[0.00060987275,0.000060579914,0.0022755186,0.00010225476,0.000010899614,0.000010978565,0.000010938923,0.99517876,0.0000029127912,0.00019786193,0.0011512131,0.00038820814],"about_ca_topic_score_codex":0.00002404337,"about_ca_topic_score_gemma":0.00041121722,"teacher_disagreement_score":0.9460041,"about_ca_system_score_codex":0.00010895468,"about_ca_system_score_gemma":0.00022457243,"threshold_uncertainty_score":0.9998924},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04785401598280571,"score_gpt":0.24962028992540716,"score_spread":0.20176627394260144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147282464","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024882287,0.0019702862,0.97201633,0.00029188418,0.0000797692,0.00031440184,2.8587777e-7,0.00012683851,0.0003178912],"genre_scores_gemma":[0.86524785,0.00016924313,0.13416342,0.0001279096,0.000080905615,0.000014772802,4.1116135e-7,0.000009257449,0.00018625266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889207,0.000040303683,0.0002565756,0.00036583675,0.00010524846,0.00033997526],"domain_scores_gemma":[0.9993795,0.0002823035,0.00004494159,0.00015624247,0.000033199824,0.00010376737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002218215,0.00014153666,0.0002067628,0.00007051634,0.00012469545,0.00019364277,0.00020241573,0.00010607201,0.000017042961],"category_scores_gemma":[0.0000060081707,0.00012783534,0.000049359474,0.00021882525,0.000021907283,0.0003838153,0.000025448071,0.000138215,0.0000010149615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009578698,0.000018712435,0.00005720927,0.000007256306,0.00000510417,0.0000030042545,0.00012983958,0.679893,0.00007114128,0.008479012,0.000027678878,0.31129843],"study_design_scores_gemma":[0.0010045008,0.000041169522,0.000009064665,0.00008778227,0.000008656636,0.000008204895,0.00001890526,0.99666494,0.000016829457,0.0016783602,0.00029558508,0.00016598873],"about_ca_topic_score_codex":0.00003116396,"about_ca_topic_score_gemma":0.0000062489858,"teacher_disagreement_score":0.8403655,"about_ca_system_score_codex":0.000022979428,"about_ca_system_score_gemma":0.000014219209,"threshold_uncertainty_score":0.5212974},"labels":[],"label_agreement":null},{"id":"W2147550938","doi":"10.1109/iscas.2009.5118101","title":"Analysis of Internet topologies: A historical view","year":2009,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Internet topology; Network topology; The Internet; Computer science; Spectral clustering; Variety (cybernetics); Topology (electrical circuits); Cluster analysis; Laplacian matrix; Complex network; Computer network; Distributed computing; Theoretical computer science; Artificial intelligence; World Wide Web; Graph; Mathematics","score_opus":0.015967428565903552,"score_gpt":0.24142503640613838,"score_spread":0.22545760784023483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147550938","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022723519,0.0005115945,0.9844095,0.003677692,0.00013178727,0.000033471944,1.1575801e-7,0.00013191627,0.00883156],"genre_scores_gemma":[0.9904667,0.000023349874,0.005994784,0.0008941653,0.000016619808,0.0000014537561,3.851946e-7,6.425423e-7,0.0026019083],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944097,0.000026836664,0.00016989457,0.00015791856,0.00010425845,0.00010012965],"domain_scores_gemma":[0.9995502,0.00005982897,0.00004711711,0.00026596215,0.000039589635,0.000037275546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010212917,0.00005269403,0.00020296115,0.00011677535,0.000010390619,0.00001651332,0.00043695758,0.000028013426,0.00009208394],"category_scores_gemma":[0.000015499336,0.00004035638,0.00011559673,0.0007100709,0.000010432398,0.00007720948,0.000031851345,0.000039414343,0.00000989106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028113423,0.000046106514,0.00037285496,8.084108e-7,0.00010235814,0.0000027654667,0.00009590038,0.0003590949,0.000008087701,0.19305089,0.005711253,0.8002471],"study_design_scores_gemma":[0.00023787718,0.00026269216,0.0077145705,0.000006783318,0.00018159398,0.000002071662,0.0000112917405,0.94853526,0.00004564766,0.0015968668,0.041245937,0.00015941409],"about_ca_topic_score_codex":0.000027523602,"about_ca_topic_score_gemma":0.000013884628,"teacher_disagreement_score":0.98819435,"about_ca_system_score_codex":0.000048920057,"about_ca_system_score_gemma":0.0000147978,"threshold_uncertainty_score":0.16456853},"labels":[],"label_agreement":null},{"id":"W2147761933","doi":"10.1109/aina.2007.61","title":"Dynamic Bandwidth Allocation in SIP based MPLS","year":2007,"lang":"en","type":"article","venue":"Proceedings","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Multiprotocol Label Switching; Computer network; Quality of service; Computer science; Reservation; Bandwidth (computing); Bandwidth allocation; Dynamic bandwidth allocation; Admission control; Resource Reservation Protocol; Signaling protocol; Resource allocation; Prioritization; Call Admission Control; Resource management (computing); Internet protocol suite; The Internet; Telecommunications; Wireless","score_opus":0.006575262934370047,"score_gpt":0.2266371848107604,"score_spread":0.22006192187639034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147761933","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14080115,0.00012776225,0.8463675,0.0032163162,0.0002434216,0.00022309895,1.9614312e-7,0.00030426684,0.008716328],"genre_scores_gemma":[0.98657113,0.0000038231706,0.012486577,0.00072521565,0.000037458605,0.000014206945,8.901434e-7,0.000005824513,0.00015488939],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912316,0.0000034926989,0.00018040747,0.00025401032,0.00017562686,0.00026332692],"domain_scores_gemma":[0.99964696,0.00005104755,0.000056867626,0.00008532177,0.000091950555,0.000067837296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000596635,0.000085981075,0.000088303954,0.00013379923,0.000045797548,0.000084927575,0.00035222596,0.00005283445,0.000009059216],"category_scores_gemma":[0.000036021363,0.00008652173,0.000026067122,0.00047735774,0.000017999806,0.00031473115,0.000030148787,0.000107284635,0.000033329103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003428806,0.00009728779,0.00874133,0.000025975221,0.000005964289,0.000008612501,0.0005649905,0.0003377706,0.0020094542,0.07047853,0.00087719405,0.9168186],"study_design_scores_gemma":[0.00082335493,0.00005930154,0.023423731,0.000044620858,0.0000036097226,0.00000573903,0.000037095226,0.9681707,0.00069304445,0.0022152758,0.004323177,0.00020032475],"about_ca_topic_score_codex":0.00000597185,"about_ca_topic_score_gemma":0.000022858176,"teacher_disagreement_score":0.967833,"about_ca_system_score_codex":0.000058723206,"about_ca_system_score_gemma":0.000038312624,"threshold_uncertainty_score":0.35282537},"labels":[],"label_agreement":null},{"id":"W2147825263","doi":"10.1109/iwqos.2010.5542752","title":"Providing fairness between TCP NewReno and TCP Vegas with RD network services","year":2010,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"TCP Vegas; TCP global synchronization; TCP Friendly Rate Control; Computer network; Zeta-TCP; Compound TCP; Computer science; TCP acceleration; TCP Westwood plus; TCP Westwood; CUBIC TCP; H-TCP; TCP tuning; Network congestion; Network packet","score_opus":0.0032763090242269193,"score_gpt":0.17962104862498834,"score_spread":0.1763447396007614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147825263","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40224206,0.000223908,0.57971567,0.0058672633,0.00083612726,0.000485491,0.0000011928463,0.000925395,0.0097029],"genre_scores_gemma":[0.97613424,0.000005511741,0.021750672,0.0005735673,0.0007358661,0.000018649878,0.0000019518707,0.000011609331,0.00076795864],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987358,0.000037929305,0.0001797224,0.00044009573,0.00021997177,0.00038652265],"domain_scores_gemma":[0.9990781,0.00015186545,0.00008454679,0.0004127137,0.000077610326,0.00019518155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025688714,0.0001802435,0.00021217452,0.000039464572,0.00023125333,0.0003925107,0.0006058909,0.000088812325,0.000026659101],"category_scores_gemma":[0.0000032013038,0.00013157957,0.00002630889,0.00030631069,0.000059692717,0.0005354337,0.00017671216,0.00025676368,0.000027033317],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018505396,0.000023625513,0.08096308,0.00003209934,0.00005876707,0.000015473694,0.00038935346,0.00055753527,0.00006469381,0.091661915,0.0013273438,0.8248876],"study_design_scores_gemma":[0.005525421,0.0009029994,0.15321596,0.00033469367,0.00019421605,0.0001764086,0.0003072644,0.59278464,0.00048697475,0.011577464,0.23202573,0.0024682004],"about_ca_topic_score_codex":0.00005567212,"about_ca_topic_score_gemma":0.00042973162,"teacher_disagreement_score":0.8224194,"about_ca_system_score_codex":0.0000058542673,"about_ca_system_score_gemma":0.000056174144,"threshold_uncertainty_score":0.5365659},"labels":[],"label_agreement":null},{"id":"W2147949471","doi":"10.1109/lcn.1993.591251","title":"Error control in the Xpress transfer protocol","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Handshake; Computer science; Synchronizing; Network packet; Transfer (computing); Ethernet; Protocol (science); Computer network; FIFO (computing and electronics); Control (management); Real-time computing; Embedded system; Operating system; Telecommunications","score_opus":0.024264370009500255,"score_gpt":0.24065652137992666,"score_spread":0.2163921513704264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147949471","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031483418,0.00002000327,0.90815866,0.0125942435,0.00009253329,0.04164267,6.9350654e-7,0.00018769041,0.036988687],"genre_scores_gemma":[0.93730384,4.3439107e-7,0.00038568425,0.0049229832,0.000065317334,0.056404177,8.344883e-8,0.0000033586646,0.000914135],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990855,0.00014479605,0.00016197334,0.00019604027,0.00019434853,0.00021732638],"domain_scores_gemma":[0.9994524,0.00013784852,0.000010906552,0.00034351912,0.000019884523,0.000035448247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026357593,0.00008780705,0.00009803983,0.000031314397,0.000056369874,0.0001045847,0.0007983123,0.000041564945,0.0002948372],"category_scores_gemma":[0.0000053356157,0.00005113754,0.000040607676,0.00019851861,0.000024722469,0.00019415328,0.000011177647,0.00014254422,0.00012997272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031008356,0.00041261385,0.0004075965,0.000010858775,0.000017305554,0.00005504503,0.0023503003,0.0017757416,0.00006360793,0.2770941,0.031243019,0.6865388],"study_design_scores_gemma":[0.002502089,0.00006999828,0.00039428487,0.000006518515,0.0000025354489,0.000010606132,0.000029618033,0.88510275,0.000010696624,0.00030508311,0.11144856,0.0001172396],"about_ca_topic_score_codex":0.0000071360732,"about_ca_topic_score_gemma":0.000031268817,"teacher_disagreement_score":0.936989,"about_ca_system_score_codex":0.000006786253,"about_ca_system_score_gemma":0.000008036673,"threshold_uncertainty_score":0.32282606},"labels":[],"label_agreement":null},{"id":"W2147962236","doi":"10.1109/icns.2008.53","title":"Corouting: An IP Hybrid Routing Approach","year":2008,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Jitter; Computer network; Scalability; Robustness (evolution); Network packet; Link-state routing protocol; Equal-cost multi-path routing; Open Shortest Path First; Shortest path problem; Distributed computing; Routing protocol; Routing (electronic design automation); Bandwidth (computing); Theoretical computer science; Telecommunications","score_opus":0.028171184241763656,"score_gpt":0.21733013189502978,"score_spread":0.18915894765326613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147962236","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039919086,0.000034366552,0.9197879,0.00019415388,0.0001625983,0.00008613364,1.9298254e-7,0.0006103971,0.03920521],"genre_scores_gemma":[0.9397875,0.0000030650842,0.05768885,0.0007168835,0.0001848664,0.000007475064,0.0000016567038,0.0000064886253,0.001603181],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989149,0.000058027952,0.00017061991,0.00036181297,0.00019882177,0.00029580973],"domain_scores_gemma":[0.9992872,0.000037083195,0.000050391216,0.00044055612,0.000052060437,0.00013275047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021695081,0.000109622844,0.00012530304,0.000033894685,0.00026036747,0.00007808649,0.0006326424,0.000027703109,0.000019251473],"category_scores_gemma":[0.000014258519,0.00009512785,0.0000462555,0.00016514618,0.000038762286,0.00041082446,0.0000909138,0.00011386678,0.00006840627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008146893,0.00022334029,0.0022813259,0.0000031570003,0.0000226566,0.00007975333,0.000763711,0.003098154,0.000045301298,0.399063,0.005648611,0.5887628],"study_design_scores_gemma":[0.0002958559,0.000041417505,0.0012979743,0.0000021210315,0.0000022491936,0.00015233498,0.000026127964,0.99687964,0.000064483494,0.00013269184,0.00095177215,0.00015335387],"about_ca_topic_score_codex":0.000013879456,"about_ca_topic_score_gemma":9.234754e-7,"teacher_disagreement_score":0.99378145,"about_ca_system_score_codex":0.00001511472,"about_ca_system_score_gemma":0.000056049772,"threshold_uncertainty_score":0.3879201},"labels":[],"label_agreement":null},{"id":"W2148537365","doi":"10.1109/cnsr.2005.7","title":"A Framework for Quality of Service in Wireless Networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Testbed; Computer science; Quality of service; Computer network; Wireless; Wireless network; Wireless site survey; Wireless WAN; Wi-Fi array; Multimedia; Telecommunications","score_opus":0.03025509073147876,"score_gpt":0.3008770285001189,"score_spread":0.27062193776864013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148537365","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021462427,0.00009019417,0.9708589,0.006644635,0.00012786394,0.00017718878,5.3845486e-7,0.0000768072,0.00056144595],"genre_scores_gemma":[0.8756893,0.000006139071,0.121248506,0.0028081823,0.00013601941,0.00003013173,6.3145666e-7,0.0000034832217,0.00007760002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914986,0.000048811697,0.00029535708,0.0002005169,0.00010602494,0.00019940788],"domain_scores_gemma":[0.99898833,0.0005010813,0.00008171444,0.00030623042,0.00007740942,0.000045212044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004354273,0.00007410719,0.00017751002,0.00003275516,0.000023969107,0.000023940473,0.00046228286,0.00008441452,0.000014976215],"category_scores_gemma":[0.000020467878,0.000067152214,0.000047438072,0.00035060177,0.000011920482,0.00015505262,0.000053071883,0.00009784305,0.0000055840283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014505242,0.00004129064,0.0004599129,0.0000067354013,0.0000041912667,1.169819e-7,0.00008617258,0.014244558,0.0000060245666,0.65421015,0.00013975783,0.3307866],"study_design_scores_gemma":[0.00046926807,0.000018757964,0.0025967208,0.000024401474,0.0000014954069,3.836121e-7,0.000015056365,0.9889557,0.000033078424,0.0070230803,0.00076864753,0.00009342406],"about_ca_topic_score_codex":0.000040058043,"about_ca_topic_score_gemma":0.0005689688,"teacher_disagreement_score":0.9747111,"about_ca_system_score_codex":0.000015716425,"about_ca_system_score_gemma":0.00002843214,"threshold_uncertainty_score":0.2738388},"labels":[],"label_agreement":null},{"id":"W2148578433","doi":"10.1109/ccece.1999.807213","title":"Performance analysis of three multicast resource allocation algorithms","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Multicast; Computer science; Computer network; Xcast; The Internet; Multicast address; Bandwidth (computing); Dynamic bandwidth allocation; Resource allocation; Source-specific multicast; Quality of service; Bandwidth allocation; IP multicast; Distributed computing; Algorithm; World Wide Web","score_opus":0.015064226787988149,"score_gpt":0.2208201607528104,"score_spread":0.20575593396482225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148578433","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053235684,0.00005149168,0.93533885,0.00022612361,0.000057539357,0.00006723968,3.3320038e-7,0.000076818855,0.010945942],"genre_scores_gemma":[0.96490645,0.0000065397594,0.034479257,0.00012216653,0.000012291871,0.0000064115593,0.0000015489509,0.0000024520484,0.00046287928],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992446,0.00003871328,0.00018947679,0.00020227447,0.0001861248,0.00013882939],"domain_scores_gemma":[0.99932754,0.00007609943,0.00006528775,0.00039339424,0.00008832312,0.00004936644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027379012,0.00007032174,0.00014844992,0.00013943094,0.00005141128,0.00002546647,0.00030363942,0.00003225975,0.000052738254],"category_scores_gemma":[0.000019274434,0.000059649272,0.00007137571,0.0010673017,0.00002832997,0.00014952458,0.000024385568,0.000047542388,0.000017236658],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004195632,0.00007267601,0.009384575,0.0000038854578,0.0002888835,8.942106e-7,0.00015886275,0.05435242,0.00006813693,0.11137236,0.00020192328,0.8240912],"study_design_scores_gemma":[0.0001775485,0.000027548296,0.012213621,0.000002710119,0.00008413589,0.0000010006173,0.000012277693,0.98490894,0.00019647433,0.000031480853,0.0022712399,0.00007302376],"about_ca_topic_score_codex":0.0000070650967,"about_ca_topic_score_gemma":0.000024568411,"teacher_disagreement_score":0.93055654,"about_ca_system_score_codex":0.000011534581,"about_ca_system_score_gemma":0.000025909332,"threshold_uncertainty_score":0.24324267},"labels":[],"label_agreement":null},{"id":"W2148809756","doi":"10.1109/iscas.2007.378570","title":"Stability Analysis of RED Gateway with Multiple TCP Reno Connections","year":2007,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Random early detection; Bottleneck; Computer science; Computer network; Boundary (topology); Flow (mathematics); Stability (learning theory); Default gateway; Network congestion; Mathematics; Active queue management; Mechanics; Physics; Mathematical analysis; Embedded system; Machine learning","score_opus":0.013727640693449382,"score_gpt":0.223460943763169,"score_spread":0.2097333030697196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148809756","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12422579,0.000018201752,0.8697561,0.00044470225,0.00006820509,0.00009691803,0.0000017582626,0.00015070346,0.0052376143],"genre_scores_gemma":[0.9833085,0.00000187781,0.0162988,0.000091351336,0.000017060198,0.0000044977687,0.0000025716713,0.0000026904643,0.00027264052],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905264,0.00004273811,0.0002508983,0.00027492622,0.00018988791,0.00018887922],"domain_scores_gemma":[0.9987223,0.0003898981,0.000088443856,0.00051381165,0.00019664642,0.000088860696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051396666,0.00008147135,0.00020939492,0.00015197025,0.00007388574,0.000024793706,0.00027109974,0.000036804377,0.00015054713],"category_scores_gemma":[0.000040430205,0.000060949133,0.00008863624,0.0016462606,0.00005910579,0.00013594277,0.000035481444,0.00006502275,0.000004622319],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046730952,0.0010999165,0.31936198,0.000022128626,0.0034461163,0.000030681764,0.001758458,0.04233923,0.0048340606,0.2273545,0.0019215733,0.39736402],"study_design_scores_gemma":[0.0009775915,0.00018381923,0.13504851,0.000006229272,0.0002792693,0.0000030100666,0.000205719,0.85769653,0.003121984,0.00015570744,0.0020976376,0.00022400542],"about_ca_topic_score_codex":0.000106475716,"about_ca_topic_score_gemma":0.002751054,"teacher_disagreement_score":0.8590827,"about_ca_system_score_codex":0.000022362236,"about_ca_system_score_gemma":0.000038783655,"threshold_uncertainty_score":0.24854335},"labels":[],"label_agreement":null},{"id":"W2148908878","doi":"10.1109/tsmcb.2003.808178","title":"Learning-based resource optimization in asynchronous transfer mode (ATM) networks","year":2003,"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":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Intelligent Mechatronic Systems (Canada); University of Waterloo","funders":"","keywords":"Asynchronous Transfer Mode; Computer science; Dynamic bandwidth allocation; Bandwidth (computing); Bandwidth allocation; Distributed computing; Artificial neural network; Nonlinear system; Computational complexity theory; Mathematical optimization; Artificial intelligence; Computer network; Algorithm; Mathematics","score_opus":0.009300234053721032,"score_gpt":0.20545281323621106,"score_spread":0.19615257918249002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148908878","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007164768,0.0006815725,0.98730075,0.00019687788,0.00086716795,0.00067545654,0.000005882225,0.00029140688,0.0028161097],"genre_scores_gemma":[0.9953476,0.00032603723,0.0014415281,0.00025684768,0.00009487853,0.00016214093,0.00000685488,0.00005965972,0.0023044166],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99655807,0.00066825136,0.00074414787,0.000860728,0.00047474343,0.00069405336],"domain_scores_gemma":[0.9985136,0.000303013,0.00011694277,0.00063873135,0.000111944864,0.00031581594],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053206587,0.00047077768,0.00050471316,0.00027756265,0.0002967443,0.000362486,0.0004262891,0.000341753,0.000046211382],"category_scores_gemma":[0.000008332993,0.0004973972,0.00014308344,0.000598102,0.00013834487,0.00016870713,0.0000033931979,0.0007102878,0.000033405002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037341306,0.00022213228,0.00007393275,0.000024862231,0.00003732147,0.000018092376,0.00033991554,0.9777918,0.000006946645,0.0050708028,0.00013069274,0.016246201],"study_design_scores_gemma":[0.0019071457,0.00039289758,0.000035883193,0.00016668833,0.000050664756,0.000033516568,0.00009290587,0.98461324,0.00014284045,0.000031949272,0.012004155,0.0005281435],"about_ca_topic_score_codex":0.00007858446,"about_ca_topic_score_gemma":0.00014997563,"teacher_disagreement_score":0.98818284,"about_ca_system_score_codex":0.00011986261,"about_ca_system_score_gemma":0.00010871634,"threshold_uncertainty_score":0.99974775},"labels":[],"label_agreement":null},{"id":"W2149070523","doi":"10.1109/aiccsa.2009.5069368","title":"An adaptive learning-like solution of random early detection for congestion avoidance in computer networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Random early detection; Learning automata; Computer science; Benchmark (surveying); Queue; Network congestion; Active queue management; Automaton; Artificial intelligence; Computer network; Real-time computing; Network packet","score_opus":0.007996455623415676,"score_gpt":0.21574686917683292,"score_spread":0.20775041355341725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149070523","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04206083,0.000094566174,0.956635,0.00018444461,0.00037341708,0.00041307972,2.6951756e-7,0.00017742986,0.000060980674],"genre_scores_gemma":[0.9783141,0.000012795185,0.021225367,0.0001726068,0.00018227218,0.000028617193,0.0000026264483,0.0000051439674,0.000056489444],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880517,0.00017639468,0.00029224687,0.00033635928,0.00013615111,0.00025366864],"domain_scores_gemma":[0.9992709,0.00017875466,0.00014418393,0.00020076714,0.00014246702,0.00006293234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004991968,0.00012687196,0.0002182702,0.00010071958,0.000096373355,0.00005691105,0.0002526479,0.000109841145,0.0000020668344],"category_scores_gemma":[0.0000123665195,0.00012323576,0.000067349356,0.00027560795,0.000030043835,0.00052712654,0.000014851459,0.00018004443,0.000002307689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030922462,0.000055051303,0.00014437886,0.0000012527867,0.000004987855,6.414106e-7,0.000100322926,0.3222208,0.0002222225,0.0042610997,0.00002570992,0.67265433],"study_design_scores_gemma":[0.002458762,0.0016048172,0.01540421,0.000024232295,0.000006373127,0.0000027759118,0.0000062976587,0.97951007,0.000121769684,0.00063887757,0.00008523344,0.00013655223],"about_ca_topic_score_codex":0.000032638494,"about_ca_topic_score_gemma":0.000110981135,"teacher_disagreement_score":0.93625325,"about_ca_system_score_codex":0.000039528386,"about_ca_system_score_gemma":0.000021988739,"threshold_uncertainty_score":0.5025409},"labels":[],"label_agreement":null},{"id":"W2149112294","doi":"10.1109/icccn.1998.998773","title":"A rate-controller for the ATM network","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Queueing theory; Computer science; Controller (irrigation); Asynchronous Transfer Mode; Scheme (mathematics); Function (biology); Control theory (sociology); Real-time computing; Computer network; Control (management); Mathematics","score_opus":0.02007761739684031,"score_gpt":0.20201651140978108,"score_spread":0.18193889401294078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149112294","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004349833,0.0012921039,0.9737172,0.017715747,0.0005829175,0.00037973662,3.8067074e-7,0.00020590505,0.0060625165],"genre_scores_gemma":[0.9511141,0.00007616503,0.013309115,0.009161178,0.0010470987,0.00023772137,3.1588596e-7,0.000008788727,0.02504551],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992312,0.000042058688,0.00013514067,0.00020558343,0.000088706256,0.0002972907],"domain_scores_gemma":[0.99870855,0.00083396264,0.000037429192,0.00031367753,0.000054289107,0.00005210162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033093835,0.000090612695,0.00011018356,0.0000101250625,0.00025325752,0.00014881967,0.00060398236,0.000034202734,0.00017677393],"category_scores_gemma":[0.000023165388,0.000051773306,0.00009665088,0.00017806211,0.000023751678,0.00012458843,0.000046035464,0.00006439997,0.0002561151],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006845204,0.000012275199,0.000016317637,5.301499e-7,0.000026295158,4.3891825e-7,0.000035335266,0.0069868583,0.0000025056581,0.25516367,0.24213052,0.49561843],"study_design_scores_gemma":[0.0006202917,0.000026952379,0.00006268052,0.0000017753944,0.0000063030284,0.0000013937324,0.0000030124859,0.74940634,0.0000014357514,0.0015079813,0.24829893,0.00006288584],"about_ca_topic_score_codex":0.000002464527,"about_ca_topic_score_gemma":0.000007308795,"teacher_disagreement_score":0.9604081,"about_ca_system_score_codex":0.0000077663235,"about_ca_system_score_gemma":0.0000077782615,"threshold_uncertainty_score":0.32919267},"labels":[],"label_agreement":null},{"id":"W2149158592","doi":"10.1109/iwqos.2004.1309372","title":"Backward connection preemption in multi-class QoS-aware networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Preemption; Computer science; Multiprotocol Label Switching; Distributed computing; Quality of service; Computer network; Reservation; Set (abstract data type); Constraint (computer-aided design); Engineering","score_opus":0.018193811886855496,"score_gpt":0.23607557103806306,"score_spread":0.21788175915120755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149158592","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012423114,0.00009973605,0.98354065,0.0015542252,0.0009724268,0.00022681523,2.5988896e-7,0.00036354578,0.0008192198],"genre_scores_gemma":[0.99191207,0.000033929755,0.0068140035,0.000621289,0.00017636394,0.000034541587,0.0000035704945,0.00000732097,0.00039691656],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891853,0.000056289864,0.00022575908,0.00036332422,0.00014690614,0.00028919688],"domain_scores_gemma":[0.99946153,0.000050483963,0.000054802553,0.00029842486,0.000052093274,0.000082668346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002132038,0.0001294979,0.00013829948,0.000086033026,0.00007293935,0.00010137855,0.0003333352,0.00011171579,0.000029432525],"category_scores_gemma":[0.000011652451,0.00012114933,0.000052972788,0.00038684392,0.000023417111,0.00043596773,0.000063849366,0.00018000475,0.00010707946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017164295,0.00015708743,0.0010954639,0.0000042138295,0.000011122503,0.000017630811,0.00015298206,0.7663978,0.00002960025,0.050993342,0.0006538753,0.18046972],"study_design_scores_gemma":[0.0018722871,0.000062386905,0.0056092055,0.000029027336,0.0000028717777,0.000011445253,0.00003040552,0.9906793,0.000035903056,0.00038023555,0.0011147233,0.00017219716],"about_ca_topic_score_codex":0.00007865583,"about_ca_topic_score_gemma":0.00071123824,"teacher_disagreement_score":0.97948897,"about_ca_system_score_codex":0.00010973829,"about_ca_system_score_gemma":0.000044622157,"threshold_uncertainty_score":0.49403262},"labels":[],"label_agreement":null},{"id":"W2149426977","doi":"10.1109/imtc.2006.328470","title":"A Per-Flow Measurement and Estimation Method for DiffServ Implementations","year":2006,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Differentiated services; Quality of service; Computer network; Integrated services; Implementation; Voice over IP; Service provider; Network packet; Videoconferencing; Service (business); The Internet; Telecommunications; Software engineering; World Wide Web","score_opus":0.02077535025054135,"score_gpt":0.2808451787363708,"score_spread":0.2600698284858295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149426977","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032117253,0.00009746429,0.99467856,0.003887647,0.00008980564,0.00030220742,0.0000021994076,0.00012134973,0.0004996205],"genre_scores_gemma":[0.24979621,0.000001985534,0.74956614,0.00026819413,0.00005093684,0.00011533776,0.0000050704075,0.0000030114281,0.00019312387],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999326,0.00003201421,0.00014959543,0.0001913516,0.00016615026,0.0001348843],"domain_scores_gemma":[0.999593,0.00009051519,0.000037376012,0.00013086529,0.00011317989,0.00003505786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003769251,0.00006855858,0.00007376621,0.000035657587,0.00012338476,0.000112018075,0.00011453299,0.000018631468,0.000016580521],"category_scores_gemma":[0.00001070889,0.000059256097,0.000030279642,0.00007367591,0.000007604282,0.00018096622,0.000025343932,0.000022268256,0.000004647927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029489288,0.00002590011,0.00005600089,0.0000047925587,0.00000818793,1.4207828e-7,0.0000497319,0.0061182096,0.00018992585,0.21060131,0.0057146926,0.7772282],"study_design_scores_gemma":[0.00059685606,0.00003647874,0.0014675112,0.0000031254472,0.0000118391745,0.0000029510393,0.000011925097,0.98482686,0.00010031258,0.007366763,0.0054983115,0.00007707974],"about_ca_topic_score_codex":0.000045078992,"about_ca_topic_score_gemma":0.00015295333,"teacher_disagreement_score":0.9787086,"about_ca_system_score_codex":0.000025545416,"about_ca_system_score_gemma":0.000029809145,"threshold_uncertainty_score":0.24163936},"labels":[],"label_agreement":null},{"id":"W2149467419","doi":"10.1109/iccs.2008.4737187","title":"Adaptive congestion avoidance for assured QoS","year":2008,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Quality of service; Computer science; Network congestion; Computer network; Router; Implementation; Random early detection; Service (business); Distributed computing; Active queue management","score_opus":0.029721632059874343,"score_gpt":0.22032228058095957,"score_spread":0.19060064852108521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149467419","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015106435,0.00016342133,0.99048537,0.001568925,0.00061747734,0.0002943558,0.0000015545321,0.0003349333,0.0050233365],"genre_scores_gemma":[0.93118197,0.000017071652,0.06320796,0.00070869544,0.0002552659,0.00009253013,0.0000014699333,0.0000056010704,0.0045294617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999202,0.000034434102,0.00013732194,0.00027608586,0.00014073185,0.00020940074],"domain_scores_gemma":[0.9992854,0.000196881,0.000051269133,0.00024760634,0.00014632913,0.000072531984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013910221,0.00009573744,0.00012274619,0.00003254199,0.00017670401,0.00002912886,0.000332154,0.000050973886,0.000014658605],"category_scores_gemma":[0.000032038457,0.000084922845,0.00006002608,0.00014087291,0.000041090825,0.00027068486,0.000030010968,0.00006604181,0.00006730338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006223841,0.00007733479,0.00023164833,0.0000038917133,0.000039415234,0.000014594306,0.00026628975,0.0031513975,0.00013787793,0.51196945,0.056750637,0.42729524],"study_design_scores_gemma":[0.001319283,0.0002404686,0.0021910332,0.00001091556,0.000008051491,0.0000426519,0.000014421148,0.94166595,0.00031893,0.0017512683,0.052177895,0.00025913052],"about_ca_topic_score_codex":0.000004809692,"about_ca_topic_score_gemma":0.000007660895,"teacher_disagreement_score":0.93851453,"about_ca_system_score_codex":0.00001947094,"about_ca_system_score_gemma":0.000063555264,"threshold_uncertainty_score":0.3463053},"labels":[],"label_agreement":null},{"id":"W2149528364","doi":"10.1145/2072298.2072362","title":"Celerity","year":2011,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer network; Network topology; Testbed; Bandwidth (computing); Server; The Internet; Network congestion; Distributed computing; Network architecture; Session (web analytics); Network packet","score_opus":0.03230071689167081,"score_gpt":0.18196925787029775,"score_spread":0.14966854097862695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149528364","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020251002,0.000020301257,0.7812358,0.0001938389,0.00016810569,0.00002249337,2.8981766e-8,0.00023249195,0.21610184],"genre_scores_gemma":[0.95776916,0.0000019896952,0.04019044,0.00054028234,0.000025451354,0.0000031067832,4.179776e-8,0.000001030301,0.0014685221],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997097,0.00001041738,0.000046483958,0.0000979274,0.00004785882,0.000087607084],"domain_scores_gemma":[0.9997393,0.000008631472,0.000009544471,0.0001857569,0.0000171397,0.000039652357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000053956228,0.00003061597,0.000033542394,0.0000112558955,0.000025656507,0.0000157835,0.00029385556,0.000013912031,0.00023218548],"category_scores_gemma":[0.0000020818588,0.000024468323,0.000017413533,0.00007030009,0.000009137631,0.00012710801,0.000039013823,0.000028269742,0.0002687106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.1687396e-7,0.000013699322,0.00022871913,2.1256267e-7,0.0000018542481,0.00000270225,0.00009261365,7.284531e-7,0.000006281768,0.5786506,0.001912066,0.4190898],"study_design_scores_gemma":[0.0016567934,0.00033536524,0.059925005,0.000011722141,0.00001298822,0.000058563903,0.000071741866,0.67028546,0.0035465194,0.09475156,0.16839667,0.0009476049],"about_ca_topic_score_codex":0.000009425446,"about_ca_topic_score_gemma":0.0000044303165,"teacher_disagreement_score":0.955744,"about_ca_system_score_codex":0.0000024541112,"about_ca_system_score_gemma":0.000010752544,"threshold_uncertainty_score":0.34538206},"labels":[],"label_agreement":null},{"id":"W2150082046","doi":"10.1109/cnsr.2006.34","title":"Loan-Grant Based Round Robin Scheduling","year":2006,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Scheduling (production processes); Frame (networking); Network packet; Bandwidth (computing); Real-time computing; Loan; Finance","score_opus":0.009311470719769793,"score_gpt":0.20243557587527464,"score_spread":0.19312410515550485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150082046","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071055936,0.00015983611,0.9776659,0.0023934783,0.00028853738,0.000081654165,2.5384526e-7,0.00039813502,0.011906623],"genre_scores_gemma":[0.92163295,8.652224e-7,0.075347364,0.00091612013,0.0001652012,0.000008627315,0.0000016294534,0.000004979399,0.0019222567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913406,0.000032520573,0.00016177453,0.00026005096,0.00017216936,0.00023940754],"domain_scores_gemma":[0.9994638,0.000081780054,0.000036424113,0.00031427917,0.000050258233,0.00005347516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016912473,0.00009879236,0.00010216543,0.000049729457,0.000098974284,0.00019252197,0.00040526353,0.000040583513,0.00006432619],"category_scores_gemma":[0.0000055303963,0.00008392959,0.000058644597,0.00022685093,0.000020292784,0.00021455527,0.000036381978,0.000078958685,0.00015203183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007112645,0.00011018253,0.00053869706,0.0000044839644,0.000008891631,0.000026103591,0.000012379352,0.13141602,0.00050907186,0.66429126,0.004506345,0.19856945],"study_design_scores_gemma":[0.00048927154,0.000021537528,0.00046539732,0.000008060295,0.0000034797558,0.0000036626702,0.0000027044657,0.98787606,0.0003364298,0.0015288455,0.0091295615,0.00013501196],"about_ca_topic_score_codex":0.000079634534,"about_ca_topic_score_gemma":0.00005783066,"teacher_disagreement_score":0.91452736,"about_ca_system_score_codex":0.00002140809,"about_ca_system_score_gemma":0.00006454459,"threshold_uncertainty_score":0.34225494},"labels":[],"label_agreement":null},{"id":"W2150238355","doi":"10.1007/s11036-008-0040-x","title":"Towards an FBM Model Based Network Calculus Framework with Service Differentiation","year":2007,"lang":"en","type":"article","venue":"Mobile Networks and Applications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Network calculus; Computer science; Fractional Brownian motion; Queueing theory; Multiplexing; Computer network; Quality of service; Distributed computing; Brownian motion; Telecommunications; Mathematics","score_opus":0.006721434690104711,"score_gpt":0.23207531528325015,"score_spread":0.22535388059314543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150238355","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004663591,0.00039351403,0.9929485,0.00039672296,0.0000762005,0.00073371566,0.0000026217583,0.0003297922,0.0004553738],"genre_scores_gemma":[0.95773447,0.000037690144,0.038663372,0.0020373915,0.0006763848,0.00075036386,0.000037865546,0.00002098749,0.000041505857],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846613,0.00003773167,0.0002675985,0.0005375475,0.00022203008,0.00046893628],"domain_scores_gemma":[0.9986181,0.00014665496,0.000122488,0.0006775539,0.00016363419,0.0002715344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003458277,0.000213954,0.00019737023,0.000044394917,0.00043408992,0.00020328701,0.0004715431,0.00016517722,0.000009167783],"category_scores_gemma":[0.0000018036436,0.00018304841,0.000038535858,0.00077494315,0.000049185976,0.00024326018,0.000074032265,0.00026502024,0.000005154976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014549914,0.000067850626,0.00021894478,0.000003894669,0.000009190043,6.8830366e-7,0.000026205464,0.6813326,0.0000021486742,0.086944625,0.0000846848,0.23129463],"study_design_scores_gemma":[0.00036312162,0.00007920557,0.0016283215,0.000025513104,0.000027307622,0.000003605391,0.000016462913,0.99131113,0.000004713367,0.0029859159,0.003313365,0.00024131528],"about_ca_topic_score_codex":0.00001538733,"about_ca_topic_score_gemma":0.00016108964,"teacher_disagreement_score":0.9542851,"about_ca_system_score_codex":0.000029322991,"about_ca_system_score_gemma":0.000066585286,"threshold_uncertainty_score":0.7464497},"labels":[],"label_agreement":null},{"id":"W2150307577","doi":"10.1109/ccece.2003.1226062","title":"On the use of probabilistic envelope processes in resource allocation","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Probabilistic logic; Queueing theory; Computer science; Context (archaeology); Envelope (radar); Resource allocation; Quality of service; Resource (disambiguation); Range (aeronautics); Stochastic process; Resource management (computing); Distributed computing; Artificial intelligence; Mathematics; Engineering; Computer network; Statistics","score_opus":0.03296759149795431,"score_gpt":0.2172068795366146,"score_spread":0.1842392880386603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150307577","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16561703,0.00006337885,0.802308,0.028060967,0.00007603935,0.00066511444,4.7580937e-7,0.0001606639,0.0030483245],"genre_scores_gemma":[0.99511755,0.0000040122395,0.0035363417,0.0010807384,0.000010126252,0.000026512762,3.9334392e-7,0.0000022460968,0.0002220908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946195,0.000034906312,0.00013489265,0.00014377273,0.00013211921,0.000092354414],"domain_scores_gemma":[0.9992552,0.0003801417,0.00004151607,0.00024041858,0.00006497241,0.000017758315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014461284,0.00005271732,0.00006040709,0.00003366198,0.000028775945,0.000042822434,0.00030286954,0.000020615465,0.0000065054633],"category_scores_gemma":[0.00028341316,0.00003220231,0.000011275427,0.00038653883,0.00003164751,0.00013565437,0.000028801633,0.000055881846,0.0000126757795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009445532,0.00008370701,0.000046032284,0.000010917506,0.0000027991773,0.0000011683132,0.00039056642,0.1641853,0.0000125895385,0.7910947,0.0004888873,0.04367385],"study_design_scores_gemma":[0.0047523556,0.001106794,0.014143106,0.0010714077,0.000027314283,0.000026014273,0.0002560784,0.71147233,0.004163982,0.17508295,0.0867381,0.0011595777],"about_ca_topic_score_codex":0.000018223556,"about_ca_topic_score_gemma":0.00009949683,"teacher_disagreement_score":0.8295005,"about_ca_system_score_codex":0.00002161068,"about_ca_system_score_gemma":0.00012334764,"threshold_uncertainty_score":0.13131721},"labels":[],"label_agreement":null},{"id":"W2150795384","doi":"10.1109/twc.2007.05833","title":"Wireless Profiled TCP Performance over Integrated Wireless LANs and Cellular Networks","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Handover; TCP Westwood plus; TCP global synchronization; Transmission Control Protocol; TCP acceleration; TCP tuning; Wireless network; Packet loss; TCP Friendly Rate Control; Network packet; Zeta-TCP; Wireless; Real-time computing; Vertical handover; Transmission (telecommunications); Heterogeneous network; Telecommunications","score_opus":0.014124157477154429,"score_gpt":0.23390279226886823,"score_spread":0.2197786347917138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150795384","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22401506,0.00023665259,0.7730288,0.00074892316,0.00045656852,0.00043427307,0.000011842804,0.0005014368,0.0005664823],"genre_scores_gemma":[0.9938912,0.0011611418,0.0036666712,0.00040631084,0.00006261511,0.00016483167,0.000020233365,0.000042189047,0.0005848379],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975912,0.0002425097,0.00062444084,0.0005680636,0.0003556704,0.00061809353],"domain_scores_gemma":[0.99629,0.0006319123,0.00020064459,0.0023536254,0.00023931035,0.00028445726],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006719383,0.00038678988,0.0003946377,0.00028637526,0.0010820682,0.00021891498,0.0019733848,0.00026060856,0.00003205121],"category_scores_gemma":[0.000002625296,0.0003828767,0.00013622329,0.0011159563,0.00036928031,0.00058704085,0.000032582837,0.0010502214,0.000040584684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008553637,0.0005689937,0.00036934757,0.000023536328,0.00012890596,0.00000832945,0.0006548552,0.008147836,0.0016443812,0.013414488,0.00019936994,0.9747544],"study_design_scores_gemma":[0.0010602608,0.00012377866,0.0008052756,0.00014251647,0.000052433934,0.000020726517,0.00011885773,0.9912713,0.0038674222,0.000035620993,0.0020126232,0.0004891848],"about_ca_topic_score_codex":0.000079028694,"about_ca_topic_score_gemma":0.00044855772,"teacher_disagreement_score":0.9831235,"about_ca_system_score_codex":0.00012227434,"about_ca_system_score_gemma":0.00012635619,"threshold_uncertainty_score":0.9998623},"labels":[],"label_agreement":null},{"id":"W2151170908","doi":"10.1109/icon.2004.1409073","title":"TCP congestion avoidance model with congestive loss","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"TCP global synchronization; TCP Westwood plus; TCP Friendly Rate Control; Packet loss; Computer network; TCP tuning; CUBIC TCP; Computer science; TCP acceleration; H-TCP; Network congestion; HSTCP; TCP Vegas; Network packet; Real-time computing","score_opus":0.006539985438866048,"score_gpt":0.19835940252776443,"score_spread":0.19181941708889838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151170908","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016120346,0.00013903546,0.9591603,0.0097005665,0.00008957067,0.00018073672,0.0000012649999,0.00051553716,0.014092594],"genre_scores_gemma":[0.9123534,0.00002074321,0.07963206,0.0016902996,0.00013852632,0.00003521255,0.0000012710291,0.00000928511,0.006119203],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987671,0.000039636594,0.00017591326,0.00042364048,0.00028089187,0.00031286283],"domain_scores_gemma":[0.9990837,0.000094126706,0.00007367752,0.00042892902,0.0001761262,0.00014344491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016811563,0.00017341724,0.00016582859,0.000050546954,0.00011921083,0.00011681133,0.00049975386,0.000063976695,0.00003471707],"category_scores_gemma":[0.000012438543,0.00013384476,0.00003566772,0.00022179107,0.00009456121,0.0006902161,0.000060467235,0.00016510783,0.00022017832],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000339307,0.000057719008,0.0003157867,0.0000023120006,0.000021007472,0.00001192277,0.00014900746,0.27725595,0.000029018654,0.3487036,0.0021538625,0.3712659],"study_design_scores_gemma":[0.0008172974,0.00007760346,0.0005535464,0.00001780157,0.000008457326,0.00003657503,0.000009455765,0.9932884,0.00012494384,0.000619699,0.00421862,0.0002276156],"about_ca_topic_score_codex":0.0000045346114,"about_ca_topic_score_gemma":0.00006363614,"teacher_disagreement_score":0.8962331,"about_ca_system_score_codex":0.000047609698,"about_ca_system_score_gemma":0.00011741095,"threshold_uncertainty_score":0.54580307},"labels":[],"label_agreement":null},{"id":"W2151415565","doi":"10.1109/ccece.1997.608329","title":"Performance of ABR service over ATM networks with mixed switch types","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Asynchronous Transfer Mode; Computer science; Computer network; Interoperability; Service (business); ATM adaptation layer; Network congestion; Operating system","score_opus":0.008313008810481652,"score_gpt":0.17490976415464976,"score_spread":0.1665967553441681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151415565","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64996356,0.0005432484,0.32330045,0.0015864003,0.00040451437,0.00020374802,4.2816046e-7,0.00031540936,0.023682225],"genre_scores_gemma":[0.99217546,0.00005466708,0.0050582844,0.0008213861,0.00008277257,0.0000070930723,4.5705414e-7,0.0000064332494,0.0017934414],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921894,0.000020569214,0.00015058002,0.00021220456,0.0001846966,0.0002130146],"domain_scores_gemma":[0.99934024,0.00005524883,0.00006736399,0.00036537857,0.000109140805,0.00006262409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008504879,0.00010858136,0.0001433927,0.00002775153,0.000056041386,0.000035444027,0.00043627952,0.000047373484,0.00022951596],"category_scores_gemma":[0.0000015936106,0.00007801495,0.000025495656,0.000431443,0.000021276737,0.0002601018,0.00005877496,0.00008952634,0.00006816945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006566769,0.000175354,0.018130435,0.00003845815,0.000103115264,0.000009910636,0.00037584547,0.17795771,0.000039995277,0.01836775,0.011511948,0.7732238],"study_design_scores_gemma":[0.00044176035,0.00010950525,0.0064348085,0.000022970407,0.000008368257,0.000007559229,0.000004546207,0.990428,0.00003785529,0.0000071142417,0.0023797168,0.00011784287],"about_ca_topic_score_codex":0.000015783138,"about_ca_topic_score_gemma":0.000059279217,"teacher_disagreement_score":0.81247026,"about_ca_system_score_codex":0.0000084645635,"about_ca_system_score_gemma":0.000013588913,"threshold_uncertainty_score":0.3181357},"labels":[],"label_agreement":null},{"id":"W2151439630","doi":"10.5539/nct.v2n1p1","title":"A New Survey on Improving TCP Performances over Geostationary Satellite Link","year":2013,"lang":"en","type":"article","venue":"Network and Communication Technologies","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Vedecká Grantová Agentúra MŠVVaŠ SR a SAV","keywords":"TCP tuning; Computer science; TCP hole punching; Zeta-TCP; TCP Friendly Rate Control; Computer network; TCP acceleration; TCP global synchronization; HSTCP; Compound TCP; Distributed computing; Transmission Control Protocol; Network packet","score_opus":0.011250173557321653,"score_gpt":0.21618048806625548,"score_spread":0.20493031450893381,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151439630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17519972,0.10745458,0.61924416,0.07258745,0.0011085431,0.0025521629,0.0000082569195,0.011172641,0.010672465],"genre_scores_gemma":[0.95786333,0.0076548867,0.033428323,0.00047109326,0.00005447622,0.000066478846,0.000017287966,0.000008104881,0.0004360251],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99897313,0.000108477514,0.00023980284,0.0002660819,0.00014966121,0.00026284484],"domain_scores_gemma":[0.99822307,0.00048706515,0.00014455417,0.0010077755,0.0000925224,0.000045039305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031952464,0.00015095856,0.00015596946,0.000079208134,0.0003448567,0.00026589606,0.0011134895,0.00013963264,0.000017298673],"category_scores_gemma":[0.00005178201,0.00012913303,0.000025072439,0.0004121375,0.000100945115,0.0005023837,0.00044936675,0.00030672995,0.00006183227],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057928687,0.000008026471,0.0039470084,0.000002275086,0.000009299021,1.7464203e-7,0.000054329765,0.00032403023,0.00000442262,0.030926008,0.006346823,0.9583718],"study_design_scores_gemma":[0.0008966761,0.00037180897,0.52211446,0.0001339025,0.00001186859,0.000006803385,0.000206999,0.3619578,0.00006533596,0.06605634,0.047544762,0.0006332565],"about_ca_topic_score_codex":0.00021314547,"about_ca_topic_score_gemma":0.00008498288,"teacher_disagreement_score":0.9577386,"about_ca_system_score_codex":0.000020640775,"about_ca_system_score_gemma":0.000044067976,"threshold_uncertainty_score":0.52658916},"labels":[],"label_agreement":null},{"id":"W2151524846","doi":"10.1109/icc.2006.254792","title":"TCP NewReno: Slow-but-Steady or Impatient?","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Burstiness; Computer science; Throughput; H-TCP; CUBIC TCP; TCP global synchronization; Network packet; TCP Friendly Rate Control; TCP acceleration; Computer network; Real-time computing; Transmission Control Protocol; Telecommunications","score_opus":0.07612764646207502,"score_gpt":0.3189690561084509,"score_spread":0.24284140964637585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151524846","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017283816,0.00029099698,0.42744812,0.054878883,0.0038125284,0.00084305817,0.00020422302,0.0011557507,0.49408263],"genre_scores_gemma":[0.97134876,0.00015951262,0.009275828,0.0010234163,0.00024282439,0.00013134506,0.00010252616,0.000015094216,0.017700681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981368,0.00016184153,0.00050180196,0.00039588095,0.0004961468,0.00030751046],"domain_scores_gemma":[0.99695975,0.00032454592,0.00023613354,0.0018446413,0.0005289377,0.00010599113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002054133,0.00023007333,0.00019931889,0.00020151831,0.00032487654,0.00039359598,0.004153989,0.00009611713,0.0003133122],"category_scores_gemma":[0.000040390503,0.00020522918,0.000105878695,0.00032034342,0.00014933386,0.00046901955,0.0003143682,0.00034638058,0.00064364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003581836,0.00042210624,0.00024255672,0.0000018984674,0.00004146528,0.0000060923453,0.00008833796,0.0010051711,0.00040514072,0.8782079,0.02732758,0.09221593],"study_design_scores_gemma":[0.0015202435,0.00022260497,0.0023337088,0.00010977563,0.000020952204,0.00003381196,0.00009565126,0.85930544,0.00027870413,0.013249122,0.122231394,0.00059859164],"about_ca_topic_score_codex":0.00031107324,"about_ca_topic_score_gemma":0.0005414405,"teacher_disagreement_score":0.95406497,"about_ca_system_score_codex":0.00012245837,"about_ca_system_score_gemma":0.00025207404,"threshold_uncertainty_score":0.8369003},"labels":[],"label_agreement":null},{"id":"W2151651568","doi":"10.1109/aina.2007.120","title":"Relaxed Failure Recovery Process for Reliable Quality-of-Service using Unreserved Backup Paths","year":2007,"lang":"en","type":"article","venue":"Proceedings","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Backup; Computer science; Path (computing); Quality of service; Computer network; Service quality; Distributed computing; Service (business); Database","score_opus":0.05226579151932607,"score_gpt":0.31146212776098947,"score_spread":0.2591963362416634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151651568","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5434634,0.00023443259,0.45055553,0.0021609776,0.00048101108,0.0007875432,0.000003934174,0.0003524747,0.001960711],"genre_scores_gemma":[0.92231745,0.000007073553,0.07630076,0.00078759616,0.00024574902,0.0000422569,0.0000031687257,0.000025897076,0.00027002735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797994,0.000009219408,0.0006045842,0.0005104655,0.00037655904,0.00051925355],"domain_scores_gemma":[0.9978366,0.00022656555,0.00040888568,0.00021953741,0.0011688333,0.00013958718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018362664,0.00019965274,0.00033307687,0.00012601363,0.00018416427,0.00011981716,0.0008635636,0.00015898247,0.000008210913],"category_scores_gemma":[0.00025669104,0.00019513235,0.00011079862,0.00097236346,0.000031189848,0.0009853571,0.000112726026,0.00017896132,0.0000078893545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030648815,0.0011752016,0.028830344,0.0058836997,0.00051890954,0.000015543099,0.013796368,0.006255519,0.09173389,0.5331782,0.016308239,0.2992392],"study_design_scores_gemma":[0.009553355,0.001014471,0.0033915178,0.0013651117,0.00016645638,0.00006149422,0.0035317722,0.8570106,0.026840728,0.06742092,0.027157662,0.002485934],"about_ca_topic_score_codex":0.00003540105,"about_ca_topic_score_gemma":0.000035627854,"teacher_disagreement_score":0.85075504,"about_ca_system_score_codex":0.00005781434,"about_ca_system_score_gemma":0.00013292834,"threshold_uncertainty_score":0.7957266},"labels":[],"label_agreement":null},{"id":"W2151670173","doi":"10.1109/glocom.2003.1258801","title":"Quality-of-service provisioning to assured service in the wireless Internet","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer network; Quality of service; Computer science; The Internet; Provisioning; Mobile QoS; Wireless; Network packet; Service (business); Scheme (mathematics); Resource allocation; Packet loss; Service provider; Telecommunications; World Wide Web","score_opus":0.02637057712723582,"score_gpt":0.2784465232067656,"score_spread":0.25207594607952977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151670173","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31117326,0.000032685795,0.63913375,0.04441208,0.000192738,0.00034936826,4.8485026e-7,0.00011117785,0.0045944825],"genre_scores_gemma":[0.9742777,7.1693216e-7,0.008239499,0.017301405,0.000037326376,0.000027354796,8.1159425e-7,0.0000042756005,0.00011093471],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987721,0.00013662594,0.00032005418,0.00026335852,0.00030392339,0.00020397342],"domain_scores_gemma":[0.9990716,0.00020434413,0.000073395895,0.0004557049,0.00014115345,0.000053774067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008281022,0.00010164089,0.00016435515,0.000062481675,0.000034467088,0.00009476878,0.0013322546,0.000043101867,0.000014161321],"category_scores_gemma":[0.000022339562,0.00006921389,0.000031983465,0.000984189,0.000007715412,0.00020239905,0.00016251557,0.00012876221,0.0000762269],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044662356,0.00021307876,0.00081098033,0.000045271358,0.00001999789,0.000010478014,0.013561432,0.02322287,0.0005577894,0.75469774,0.00059010205,0.2062256],"study_design_scores_gemma":[0.008878256,0.00065171113,0.082331985,0.0008039642,0.000022463952,0.000048498958,0.0042394856,0.86228645,0.00244064,0.018806389,0.017872104,0.001618048],"about_ca_topic_score_codex":0.0013618708,"about_ca_topic_score_gemma":0.0044776467,"teacher_disagreement_score":0.8390636,"about_ca_system_score_codex":0.000023624963,"about_ca_system_score_gemma":0.000082195525,"threshold_uncertainty_score":0.28224605},"labels":[],"label_agreement":null},{"id":"W2151861861","doi":"10.1109/glocom.1994.513318","title":"ATM switching node design based on a versatile traffic descriptor","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Burstiness; Computer science; Computer network; Quality of service; Asynchronous Transfer Mode; Traffic shaping; Bandwidth (computing); Scheduling (production processes); Network traffic control; ATM adaptation layer; Integrated Services Digital Network; Traffic policing; Distributed computing; Network packet; Engineering","score_opus":0.03209241465559871,"score_gpt":0.2004102035049041,"score_spread":0.1683177888493054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151861861","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029311518,0.000061072235,0.9868713,0.0025222113,0.00039350602,0.00018383781,2.8195043e-7,0.0005750061,0.006461648],"genre_scores_gemma":[0.92585677,0.0000028327515,0.069890946,0.003227088,0.00009057527,0.00002310567,3.163007e-7,0.000009828824,0.00089854235],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987614,0.00010709006,0.00016919598,0.00036884056,0.00027470494,0.0003187243],"domain_scores_gemma":[0.99905884,0.00028175273,0.000044690256,0.00045050087,0.00003475551,0.00012945007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021666705,0.00015519066,0.00014018174,0.00007829074,0.00015261701,0.00017016329,0.0005500685,0.00005622092,0.00041961047],"category_scores_gemma":[0.000026926105,0.00013244222,0.00007541829,0.00026156037,0.0000140982565,0.00023112608,0.000025563917,0.0001389509,0.0005929429],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001671464,0.00014508018,0.000019112236,0.0000026668392,0.000011231149,0.000016465388,0.0002693137,0.27451065,0.00009329895,0.0053316127,0.023578692,0.69600517],"study_design_scores_gemma":[0.0007458019,0.0001310689,0.000033654276,0.000016757409,0.0000055633955,0.000002715132,0.00000898294,0.9953384,0.00007700941,0.00003874775,0.003432319,0.00016900458],"about_ca_topic_score_codex":0.0000032781948,"about_ca_topic_score_gemma":0.000002777259,"teacher_disagreement_score":0.9229256,"about_ca_system_score_codex":0.000046455745,"about_ca_system_score_gemma":0.000029657182,"threshold_uncertainty_score":0.7621279},"labels":[],"label_agreement":null},{"id":"W2152182657","doi":"10.1109/icc.2005.1494320","title":"Proactive resource allocation schemes","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Resource allocation; Resource management (computing); Distributed computing; Computer network","score_opus":0.00827467584988387,"score_gpt":0.21287980966718953,"score_spread":0.20460513381730566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152182657","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024409897,0.00009413819,0.9309428,0.013398345,0.000043062235,0.00010209136,6.515854e-8,0.000325895,0.05265265],"genre_scores_gemma":[0.94676363,0.000002820395,0.046051346,0.0014276598,0.00017556154,0.000017213735,6.6117536e-7,0.0000026811342,0.005558442],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949354,0.000021869566,0.00008037764,0.00017245747,0.000113402384,0.000118332064],"domain_scores_gemma":[0.9996449,0.00003304478,0.000023647104,0.00021546039,0.000038803413,0.000044191445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000098638586,0.000053000887,0.000047933092,0.000026045756,0.00005537543,0.00005825403,0.00027929424,0.000024939143,0.00003516287],"category_scores_gemma":[0.00000855092,0.00004463309,0.000021067917,0.00012756512,0.000013145349,0.000304663,0.000039367973,0.00005290071,0.00019606749],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017760179,0.000017038426,0.000013335465,2.7164668e-7,0.0000055900477,2.3250558e-7,0.00007590727,0.00032360098,0.000034704142,0.23131318,0.003951231,0.76426315],"study_design_scores_gemma":[0.00022607553,0.000019584628,0.00022575005,0.0000024688097,0.0000023834702,0.0000036922322,0.000018265613,0.521643,0.0013073613,0.00028672552,0.47617403,0.000090690584],"about_ca_topic_score_codex":0.0000012591611,"about_ca_topic_score_gemma":0.0000042408997,"teacher_disagreement_score":0.94432265,"about_ca_system_score_codex":0.000019984,"about_ca_system_score_gemma":0.000027319313,"threshold_uncertainty_score":0.25201163},"labels":[],"label_agreement":null},{"id":"W2152283194","doi":"10.1007/978-3-540-72990-7_14","title":"A Robust Routing Plan to Optimize Throughput in Core Networks","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Quality of service; Benchmark (surveying); Distributed computing; Routing (electronic design automation); Criticality; Static routing; Path (computing); Shortest path problem; Equal-cost multi-path routing; Computer network; Traffic engineering; Throughput; Core (optical fiber); Graph; Routing protocol; Theoretical computer science","score_opus":0.04606247519529978,"score_gpt":0.2517556950536331,"score_spread":0.20569321985833333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152283194","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000063073196,0.0004217118,0.9919589,0.00085273257,0.0025694189,0.0006615536,0.000002032129,0.0002530461,0.0032175225],"genre_scores_gemma":[0.33408618,0.000045790162,0.65751183,0.0064176484,0.0014848682,0.000023301322,0.000007199965,0.000065204826,0.0003580005],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948536,0.000038875616,0.00082491024,0.0020171078,0.00096259586,0.0013029182],"domain_scores_gemma":[0.9969398,0.0008821605,0.00028564144,0.0013514891,0.00020016792,0.00034077914],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017568077,0.00068389776,0.00077037193,0.0009507045,0.00024699347,0.00057466945,0.0037777745,0.0005161494,0.00002264206],"category_scores_gemma":[0.000088988316,0.0006580004,0.00014419657,0.0013608711,0.00035090075,0.00045193985,0.0013419226,0.0014543636,0.000047223282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000102088225,0.0000120975155,0.000057262285,0.000004611085,0.000004245486,0.00014166917,0.0002631515,0.5594041,9.159805e-7,0.014091027,0.000031687527,0.42597908],"study_design_scores_gemma":[0.00047575706,0.00013710158,0.00012719349,0.0006417985,0.000005604303,0.00006817761,3.11139e-7,0.98906547,0.0000062035283,0.007966088,0.0007766814,0.0007296305],"about_ca_topic_score_codex":0.000047255067,"about_ca_topic_score_gemma":0.00045637818,"teacher_disagreement_score":0.4296614,"about_ca_system_score_codex":0.0004474542,"about_ca_system_score_gemma":0.00044730236,"threshold_uncertainty_score":0.9995871},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Fractal; Buffer (optical fiber); Self-similarity; Computer network; Mathematics; Telecommunications","score_opus":0.008847057121624844,"score_gpt":0.19809194912735367,"score_spread":0.18924489200572883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152536325","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75565815,0.00017937519,0.23551966,0.0010199391,0.00008899108,0.00017148607,0.0000020899013,0.0006185217,0.0067417687],"genre_scores_gemma":[0.98157156,0.000018934335,0.017258571,0.00049376953,0.000038598002,0.000008397841,0.0000025756535,0.0000072622606,0.0006003088],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987416,0.00007241941,0.00023572688,0.00038622308,0.00031965104,0.00024436045],"domain_scores_gemma":[0.9989185,0.000083816645,0.000094905336,0.0006520898,0.00010956571,0.00014117056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015281404,0.0001514572,0.0003151695,0.00021716431,0.00006624212,0.00007569885,0.00059246825,0.00006139729,0.0003940277],"category_scores_gemma":[0.00000426948,0.0001118091,0.00011510427,0.0015263051,0.000037022884,0.00043263205,0.00003788703,0.00009597662,0.00003265778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022342063,0.0008136426,0.001493131,0.000008119095,0.0016491612,0.000038426322,0.0014770413,0.1353497,0.000032522294,0.009931992,0.0014121714,0.84777176],"study_design_scores_gemma":[0.0004263115,0.00020513253,0.0018644008,0.0000034342347,0.00029546968,0.0000058282167,0.000020451009,0.9950613,0.000040614144,0.000008324832,0.0019033739,0.00016537317],"about_ca_topic_score_codex":0.000008455126,"about_ca_topic_score_gemma":0.000089364905,"teacher_disagreement_score":0.8597116,"about_ca_system_score_codex":0.000017050772,"about_ca_system_score_gemma":0.000020734635,"threshold_uncertainty_score":0.45594427},"labels":[],"label_agreement":null},{"id":"W2152683668","doi":"10.1109/lcomm.2002.808378","title":"A rate adaptation algorithm for multicast sources in priority-based IP networks","year":2003,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Multicast; Computer science; Computer network; Xcast; IP multicast; Quality of service; Source-specific multicast; Distributed computing; Protocol Independent Multicast; Pragmatic General Multicast; Multicast address; Adaptation (eye); Distance Vector Multicast Routing Protocol; Inter-domain; Algorithm","score_opus":0.028575925008132833,"score_gpt":0.2583156522136632,"score_spread":0.22973972720553038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152683668","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029718478,0.00032605758,0.986065,0.009650448,0.00028796954,0.0004947991,0.0000027396018,0.00013669582,0.00006449125],"genre_scores_gemma":[0.6445995,0.000028672206,0.3516724,0.003334229,0.000038248945,0.00028588623,0.000011030585,0.0000107542755,0.000019271441],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985339,0.00048091673,0.0003109029,0.00027012546,0.00010585526,0.00029829622],"domain_scores_gemma":[0.99742156,0.0009619586,0.00012247018,0.0013345518,0.00009133186,0.000068152156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071081525,0.00014145559,0.00016291972,0.00013552295,0.00027099965,0.0001409203,0.0012177809,0.00006360418,0.0000018810125],"category_scores_gemma":[0.000053776148,0.0001533171,0.00007880062,0.0004585579,0.000103466,0.00024191388,0.00004295997,0.0002310359,0.000009766709],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008157671,0.00018458709,0.00021850206,0.0000054216603,0.000024578056,0.0000024371432,0.0005873723,0.29401287,0.00020279695,0.013443299,0.0007724976,0.69053745],"study_design_scores_gemma":[0.0010783047,0.00002125578,0.00029568572,0.000024445519,0.000009607674,0.0000016443169,0.000037326114,0.986376,0.000044877987,0.00012786014,0.01181317,0.00016981359],"about_ca_topic_score_codex":0.000020664213,"about_ca_topic_score_gemma":0.00009769362,"teacher_disagreement_score":0.69236314,"about_ca_system_score_codex":0.00006381183,"about_ca_system_score_gemma":0.00008169629,"threshold_uncertainty_score":0.62520903},"labels":[],"label_agreement":null},{"id":"W2152691250","doi":"10.1109/cdc.1992.371024","title":"Computational methods for the local control of loss-sensitive sources in integrated services networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Maximization; Computer science; Linear programming; Mathematical optimization; Piecewise linear function; Function (biology); Dual (grammatical number); Point (geometry); Line (geometry); Control (management); Algorithm; Mathematics; Artificial intelligence","score_opus":0.008153038567637591,"score_gpt":0.2747977960089444,"score_spread":0.2666447574413068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152691250","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012111352,0.00057192735,0.9946025,0.0029840763,0.00012814217,0.00032708386,0.0000024146466,0.00006419047,0.00010852557],"genre_scores_gemma":[0.8504137,0.0000070563256,0.14767961,0.0017153127,0.00009496566,0.000028898412,0.0000032230566,0.000004477446,0.000052763906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894434,0.00019642108,0.0003107579,0.00022404271,0.00011409463,0.00021034936],"domain_scores_gemma":[0.9969699,0.0025125141,0.00010817944,0.00016685826,0.00020122324,0.000041324292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008037955,0.000116517345,0.00021544585,0.000054903594,0.000074139156,0.000055671146,0.00045255353,0.00006303433,0.000011224338],"category_scores_gemma":[0.0000129148575,0.00007466016,0.000077811565,0.0002916733,0.000110697336,0.00017081675,0.000041724306,0.00012248987,0.000003014179],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038413396,0.000018314648,0.00013636632,0.0000018197509,0.000024101664,3.246121e-7,0.0001461646,0.5323503,0.0000018532953,0.027972687,0.0000338536,0.43927577],"study_design_scores_gemma":[0.0011438131,0.000043284395,0.0013166434,0.000015600664,0.000011933555,0.00000482248,0.00018074407,0.9939292,0.000040279916,0.0007043301,0.0025220397,0.000087273256],"about_ca_topic_score_codex":0.00005521099,"about_ca_topic_score_gemma":0.00018879246,"teacher_disagreement_score":0.8492026,"about_ca_system_score_codex":0.000023411034,"about_ca_system_score_gemma":0.000046804358,"threshold_uncertainty_score":0.30445528},"labels":[],"label_agreement":null},{"id":"W2152904887","doi":"10.1109/icc.1997.610034","title":"Characterization of effective bandwidth as a metric of quality of service for wired and wireless ATM networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Bandwidth (computing); Computer network; Quality of service; Dynamic bandwidth allocation; Asynchronous Transfer Mode; Bandwidth management; Network congestion; Bandwidth allocation; Channel allocation schemes; Channel (broadcasting); Wireless; Telecommunications; Network packet","score_opus":0.01482677935537575,"score_gpt":0.23781874387664856,"score_spread":0.22299196452127282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152904887","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46081153,0.00008968691,0.5383377,0.00020711185,0.000060121885,0.00031856066,0.000003161168,0.000017929939,0.00015417121],"genre_scores_gemma":[0.99827886,0.00004681268,0.0013339614,0.0001850982,0.000025735393,0.000028153427,0.0000033482952,0.000004216335,0.00009382254],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990994,0.00010838529,0.0003410337,0.00019281295,0.00014379504,0.000114589224],"domain_scores_gemma":[0.9986483,0.00051610864,0.00030494973,0.0002118704,0.00027647804,0.000042320262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003525959,0.000087141125,0.0003186644,0.00007528859,0.000026627638,0.0000113585775,0.00020297406,0.0000618205,0.000013461998],"category_scores_gemma":[0.000033705273,0.00007566171,0.00005268273,0.0006593075,0.000031989362,0.00016740189,0.000046950205,0.000031564425,4.889269e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013176467,0.00021680864,0.0019066832,0.00021752395,0.0001072978,2.4523706e-7,0.0006049934,0.00089098135,0.017765414,0.052311126,0.00004790659,0.92579925],"study_design_scores_gemma":[0.0012185745,0.00022512466,0.0296074,0.000037236423,0.000020843745,0.0000010167661,0.000010665641,0.9641156,0.0044380017,0.00019247203,0.000039459068,0.000093585295],"about_ca_topic_score_codex":0.000050623687,"about_ca_topic_score_gemma":0.000022542396,"teacher_disagreement_score":0.96322465,"about_ca_system_score_codex":0.000007321413,"about_ca_system_score_gemma":0.000010254675,"threshold_uncertainty_score":0.3085395},"labels":[],"label_agreement":null},{"id":"W2153225702","doi":"10.1109/glocom.1997.638436","title":"Hierarchical scheduling for integrated ABR/VBR services in ATM networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Variable bitrate; Computer network; Scheduling (production processes); Queueing theory; Asynchronous Transfer Mode; Throughput; Distributed computing; Real-time computing; Quality of service; Telecommunications; Engineering","score_opus":0.012986076020459758,"score_gpt":0.22128358839173085,"score_spread":0.2082975123712711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153225702","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013968206,0.00052788394,0.9800635,0.0026950156,0.00034838283,0.00024171823,5.307189e-7,0.00027587113,0.0018788693],"genre_scores_gemma":[0.93765485,0.000040239953,0.059723802,0.0015082196,0.00018234095,0.00005225712,0.0000031303964,0.0000082051965,0.0008269428],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998856,0.000049797512,0.00024909596,0.0003521966,0.00012210924,0.00037079476],"domain_scores_gemma":[0.9993068,0.00022540563,0.00004200524,0.00026869352,0.00005562613,0.00010144955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023005946,0.0001332431,0.00017401009,0.00007909421,0.000081585444,0.00015223875,0.00060435466,0.0000989358,0.00007880109],"category_scores_gemma":[0.000011580832,0.00011024785,0.00006316152,0.00046103346,0.00002401879,0.00026317054,0.00007090169,0.00021554559,0.000037251066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015975696,0.00008518444,0.00079026504,0.000009289828,0.000014834723,0.000008395434,0.00022239078,0.06372626,0.000008532406,0.09413602,0.0006934804,0.84028935],"study_design_scores_gemma":[0.00069332484,0.00004641004,0.00027347155,0.000032483593,0.0000028343393,0.0000038555218,0.00002338128,0.9919939,0.000005214224,0.0008541703,0.0059341528,0.00013682168],"about_ca_topic_score_codex":0.000019315481,"about_ca_topic_score_gemma":0.00015531677,"teacher_disagreement_score":0.9282676,"about_ca_system_score_codex":0.000023404315,"about_ca_system_score_gemma":0.000012957662,"threshold_uncertainty_score":0.4495777},"labels":[],"label_agreement":null},{"id":"W2153277211","doi":"10.1109/icc.1992.268078","title":"An integrated system for video, voice and data communications","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Bandwidth (computing); Class (philosophy); Computer network; Real-time computing; Multimedia; Artificial intelligence","score_opus":0.04623900838494248,"score_gpt":0.2962518702087088,"score_spread":0.2500128618237663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153277211","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028982235,0.00029277158,0.99599874,0.00063426193,0.00010927675,0.00023962294,0.000009821834,0.00024900262,0.002176697],"genre_scores_gemma":[0.8284644,0.0000078806825,0.17098132,0.00030880052,0.000014920948,0.00004172597,0.000021531536,0.000003667969,0.00015573124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936765,0.0001055439,0.000118815675,0.00024702604,0.00005171333,0.00010924406],"domain_scores_gemma":[0.9975778,0.00018909993,0.000033533153,0.0020506664,0.0000784262,0.000070491216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037920798,0.000061049584,0.00008055698,0.000023253531,0.00015120057,0.0001522361,0.0015039537,0.000023102557,0.0000020514613],"category_scores_gemma":[0.00002885984,0.000049929764,0.000009308198,0.00013051463,0.000031112297,0.00043081903,0.00012525552,0.000050176128,0.000009091503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024795372,0.000035627214,0.000086954584,0.000007372755,0.000011576928,3.8236965e-7,0.000049144193,0.000029167059,0.000026114321,0.8055609,0.0033035455,0.19088674],"study_design_scores_gemma":[0.0002888746,0.000030457395,0.000033165587,0.000010085572,0.0000062866025,0.000012514537,0.00013522658,0.8306531,0.0000130111575,0.00015656791,0.16859113,0.000069582755],"about_ca_topic_score_codex":0.000015858715,"about_ca_topic_score_gemma":0.000089939436,"teacher_disagreement_score":0.8306239,"about_ca_system_score_codex":0.000010116366,"about_ca_system_score_gemma":0.00005209725,"threshold_uncertainty_score":0.27947453},"labels":[],"label_agreement":null},{"id":"W2153330573","doi":"","title":"Price-Sensitive Application Adaptation in Deadline-Based Networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Network packet; Computer network; Real-time computing; Scheduling (production processes)","score_opus":0.005317286273928192,"score_gpt":0.18994361940171833,"score_spread":0.18462633312779014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153330573","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031386719,0.000047875437,0.99159276,0.0009465187,0.00007975236,0.00021389185,1.7133526e-7,0.00019874066,0.00378161],"genre_scores_gemma":[0.97299844,0.0000015518721,0.02608125,0.0005786956,0.00012666851,0.000043743617,0.000010620295,0.0000043012283,0.00015474735],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992418,0.00004734441,0.00018338046,0.0002481349,0.00010230512,0.0001770241],"domain_scores_gemma":[0.99954057,0.000115614734,0.000059917515,0.00020084597,0.000053236472,0.000029815958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017268927,0.00008185742,0.00008553014,0.00006839283,0.000040268445,0.000048737686,0.00017222675,0.000053715423,0.0000035423177],"category_scores_gemma":[0.000004503624,0.00007806024,0.000027120468,0.0004148216,0.0000133943495,0.00015484885,0.00001623943,0.0000786863,0.000027305283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068093946,0.000039465926,0.00039599484,7.6386834e-7,0.0000011259549,0.000002276,0.000016728456,0.6607825,0.000022767008,0.09904785,0.00026653925,0.23941718],"study_design_scores_gemma":[0.00043032115,0.000015265994,0.0074640345,0.0000049419896,0.0000015809618,0.0000010379922,0.0000084194435,0.99034065,0.000048828584,0.0006994961,0.00089103176,0.00009436188],"about_ca_topic_score_codex":0.00012958529,"about_ca_topic_score_gemma":0.0005324788,"teacher_disagreement_score":0.9698598,"about_ca_system_score_codex":0.00004079528,"about_ca_system_score_gemma":0.000037427195,"threshold_uncertainty_score":0.31832042},"labels":[],"label_agreement":null},{"id":"W2153451374","doi":"10.1109/icn.2009.26","title":"Achieving a QoS Target in NGN Networks via an Efficient Admission Control Strategy","year":2009,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Quality of service; Next-generation network; Computer science; Computer network; Jitter; Scalability; Multiprotocol Label Switching; Throughput; Admission control; The Internet; Telecommunications; Wireless","score_opus":0.006906348512901797,"score_gpt":0.22712817075377634,"score_spread":0.22022182224087455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153451374","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026816081,0.0003772206,0.96823967,0.0014137466,0.00032518196,0.00032270304,3.1268291e-7,0.00033466207,0.0021704175],"genre_scores_gemma":[0.99173236,0.0000068370255,0.0058803833,0.0019354081,0.00027800907,0.000012038149,0.000002472569,0.0000071619306,0.00014533472],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981508,0.00018944671,0.00035906467,0.00051510683,0.00025509292,0.0005304462],"domain_scores_gemma":[0.9989998,0.000093691815,0.00008373186,0.00047535572,0.000057558053,0.00028988594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005166499,0.00020831845,0.0002629711,0.000110926274,0.000121379046,0.00018954284,0.00067683274,0.00011782458,0.00006915885],"category_scores_gemma":[0.000015112516,0.00017332258,0.000068129855,0.00042397302,0.000018789418,0.00032336343,0.000036708996,0.00027429537,0.00002186119],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029809973,0.0001655118,0.00021098542,8.002453e-7,0.000003595003,0.000032555356,0.000049178514,0.6110534,0.00011578103,0.014475117,0.00023238512,0.37363088],"study_design_scores_gemma":[0.0012718346,0.00032318264,0.0065466464,0.000021894462,0.0000038882567,0.000014183448,0.000013114227,0.9908562,0.000009827171,0.00030907878,0.00040807793,0.00022207662],"about_ca_topic_score_codex":0.0000141218225,"about_ca_topic_score_gemma":0.000017126462,"teacher_disagreement_score":0.9649163,"about_ca_system_score_codex":0.000044103264,"about_ca_system_score_gemma":0.00007982867,"threshold_uncertainty_score":0.70678896},"labels":[],"label_agreement":null},{"id":"W2153499615","doi":"10.1109/infcom.1994.337657","title":"Performance of burst-level bandwidth reservation in ATM LANs","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Reservation; Bandwidth (computing); Computer science; Computer network; Throughput; Real-time computing; Blocking (statistics); Telecommunications; Wireless","score_opus":0.04091042874885879,"score_gpt":0.21301783809543348,"score_spread":0.1721074093465747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153499615","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8529086,0.0001280265,0.11813346,0.0030811937,0.00020246582,0.00014142276,0.0000010410643,0.00010785335,0.025295915],"genre_scores_gemma":[0.9912651,0.000049635033,0.005305208,0.00019178345,0.000029134915,0.0000064450483,5.8034897e-7,0.0000022001987,0.0031498848],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940914,0.000022692138,0.00016207024,0.00013539416,0.00014000147,0.00013067808],"domain_scores_gemma":[0.9996185,0.00004795508,0.000038542843,0.00022341494,0.00004503073,0.000026563031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015154622,0.000053268785,0.00008755511,0.000055049666,0.00002358669,0.00001567309,0.00030644998,0.00003121592,0.00008381844],"category_scores_gemma":[0.00001052243,0.00004574335,0.000018965733,0.0003117269,0.000015255178,0.00028694264,0.000034144992,0.0000583202,0.000041713687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000133073345,0.0001322661,0.126211,0.000018066552,0.000008956367,0.000004238838,0.0005245449,0.006118288,0.00009150504,0.053912804,0.004832631,0.8081324],"study_design_scores_gemma":[0.00035439906,0.000053475014,0.068941556,0.000015622869,9.316924e-7,0.0000013244908,0.0000055545174,0.9289911,0.000062358224,0.00006955701,0.0014450515,0.000059079903],"about_ca_topic_score_codex":0.000024568233,"about_ca_topic_score_gemma":0.00005555069,"teacher_disagreement_score":0.9228728,"about_ca_system_score_codex":0.000014637491,"about_ca_system_score_gemma":0.000009760414,"threshold_uncertainty_score":0.18653595},"labels":[],"label_agreement":null},{"id":"W2153626693","doi":"10.1109/lcomm.2007.061618","title":"A New Routing-Based Admission Control for MPLS Networks","year":2007,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Multiprotocol Label Switching; Computer science; Computer network; Blocking (statistics); Routing (electronic design automation); Admission control; Quality of service","score_opus":0.0209120449120827,"score_gpt":0.2711381835548053,"score_spread":0.2502261386427226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153626693","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042380698,0.00034535272,0.95018345,0.047513865,0.00048731477,0.0005020091,0.000001957374,0.00032765666,0.00021455991],"genre_scores_gemma":[0.84839594,0.000009413238,0.1353626,0.015806705,0.00025108882,0.000056329798,0.000009778948,0.000014879017,0.00009325886],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986266,0.00011624593,0.00037527928,0.00028442102,0.00016560362,0.0004318859],"domain_scores_gemma":[0.99595433,0.0014466817,0.00017466812,0.0020878082,0.00010532704,0.00023118962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008335873,0.00016495933,0.00018974266,0.00010561313,0.00042791115,0.00014199219,0.002385003,0.00008480104,0.000005946094],"category_scores_gemma":[0.000058640806,0.00016463058,0.00014497264,0.00035709958,0.00006341525,0.0001971637,0.00008063579,0.000242812,0.000017243072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096735566,0.00012051424,0.00047119512,0.000005556477,0.00006706397,0.000003836285,0.0001780896,0.0705723,0.0021246944,0.043283276,0.07098507,0.81209165],"study_design_scores_gemma":[0.0018732013,0.000044532826,0.00041114795,0.000036454934,0.000024116534,0.0000033899446,0.0000060592047,0.94648486,0.000102566875,0.00013609024,0.050663732,0.00021384053],"about_ca_topic_score_codex":0.000022511531,"about_ca_topic_score_gemma":0.00005090943,"teacher_disagreement_score":0.87591255,"about_ca_system_score_codex":0.00006930789,"about_ca_system_score_gemma":0.00012631241,"threshold_uncertainty_score":0.671344},"labels":[],"label_agreement":null},{"id":"W2153821353","doi":"10.1109/icc.1998.685203","title":"Implementation and performance evaluation of ISAC: integrated services Internet with RSVP over ATM shortcuts","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Signaling protocol; Software portability; Integrated services; Computer network; Asynchronous Transfer Mode; The Internet; Multicast; Distributed computing; Quality of service; Operating system","score_opus":0.01696471325906425,"score_gpt":0.24772084676697295,"score_spread":0.2307561335079087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153821353","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9485992,0.00014804547,0.049069818,0.00014975964,0.00005713618,0.00019274637,6.8833504e-7,0.00005426309,0.0017282966],"genre_scores_gemma":[0.99771154,0.000028681668,0.0018275182,0.00016598337,0.00001607386,0.000017187622,0.0000042077327,0.0000032937805,0.00022549556],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920076,0.000047644593,0.00015786974,0.0001852822,0.00030245574,0.00010599181],"domain_scores_gemma":[0.9995366,0.000020488294,0.000076521465,0.00014889996,0.00018350738,0.000034021832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025857714,0.00008270585,0.00008884317,0.00004526086,0.000027371952,0.00005663843,0.00016094458,0.00002292339,0.00045726704],"category_scores_gemma":[9.823104e-7,0.000059482652,0.000011470324,0.00017616201,0.000021236632,0.00048662003,0.00003336769,0.000042487478,0.000008077109],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010695541,0.000020677717,0.022937143,0.000008678809,0.000024085077,2.7726938e-7,0.00067979936,0.0003155245,0.000023466568,0.0017273179,0.0003444885,0.9739078],"study_design_scores_gemma":[0.000776976,0.00017550531,0.030670509,0.000025814843,0.000024240457,0.000004286756,0.00012868438,0.9673325,0.00039250153,0.000021687434,0.00036836683,0.0000789456],"about_ca_topic_score_codex":0.00008205042,"about_ca_topic_score_gemma":0.0003729459,"teacher_disagreement_score":0.9738289,"about_ca_system_score_codex":0.000020253134,"about_ca_system_score_gemma":0.00001705847,"threshold_uncertainty_score":0.5006753},"labels":[],"label_agreement":null},{"id":"W2153876525","doi":"10.1109/tnet.2004.833125","title":"Design and Stability Analysis of a Rate Control Algorithm Using the Routh–Hurwitz Stability Criterion","year":2004,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Routh–Hurwitz stability criterion; Stability (learning theory); Computer science; Control theory (sociology); Stability criterion; Transfer function; Flow control (data); Control system; Algorithm; Feedback control; Control (management); Mathematics; Control engineering; Artificial intelligence; Telecommunications; Engineering","score_opus":0.042524042390701296,"score_gpt":0.25735752594914296,"score_spread":0.21483348355844167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153876525","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050054062,0.00029180854,0.9477659,0.0005913133,0.00060681516,0.0005381665,0.000012459537,0.00013311522,0.0000063605044],"genre_scores_gemma":[0.9480463,0.00005302435,0.05150319,0.0002441139,0.00009752463,0.000039281953,0.0000012256158,0.000013053757,0.000002286302],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973555,0.000715847,0.00055613596,0.000624379,0.0003251237,0.0004230206],"domain_scores_gemma":[0.9973078,0.0010896592,0.00021896012,0.0010782718,0.00018173596,0.00012357881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017803618,0.00026539477,0.00050022145,0.00018545265,0.00053408026,0.00017764687,0.0006161439,0.00011266862,0.00002194265],"category_scores_gemma":[0.00001547044,0.00021301005,0.00024903144,0.001620564,0.0002019008,0.00030996455,0.000012429807,0.00034694446,0.0000014961894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008202267,0.00013117574,0.0001075719,0.0000067394462,0.0004630639,0.0000035617234,0.00088228885,0.7610548,0.0007619917,0.00010442328,9.643201e-7,0.2364014],"study_design_scores_gemma":[0.0010580496,0.00011863173,0.0003824443,0.0000422783,0.00068804657,0.0000057393736,0.000087044915,0.9955454,0.00091519917,0.0009121353,0.00003079046,0.00021422339],"about_ca_topic_score_codex":0.00012804935,"about_ca_topic_score_gemma":0.00010975607,"teacher_disagreement_score":0.89799225,"about_ca_system_score_codex":0.00016100562,"about_ca_system_score_gemma":0.00013584737,"threshold_uncertainty_score":0.86862975},"labels":[],"label_agreement":null},{"id":"W2153932557","doi":"10.1109/mcom.2004.1284930","title":"Storage area network extension solutions and their performance assessment","year":2004,"lang":"en","type":"article","venue":"IEEE Communications Magazine","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Computer science; Fibre Channel; iSCSI; Computer network; Storage area network; SCSI; Synchronous optical networking; Throughput; Internet Protocol; The Internet; Computer data storage; Telecommunications; Operating system; Wireless","score_opus":0.03523945449878565,"score_gpt":0.2569821451333365,"score_spread":0.22174269063455085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153932557","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019950991,0.0026210337,0.9601512,0.011810648,0.00047950709,0.00027988094,0.0000034094567,0.00035430273,0.0043490054],"genre_scores_gemma":[0.9417163,0.001675105,0.055715226,0.00051929656,0.00009819922,0.00006739187,0.000010837203,0.000009558866,0.00018808227],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894845,0.00011025201,0.00024386897,0.00026739668,0.000121377,0.00030864394],"domain_scores_gemma":[0.99731463,0.00016744953,0.00010193856,0.0021627727,0.00014578587,0.0001074199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000439513,0.0001571274,0.00016966109,0.000062859865,0.00080722215,0.00012230552,0.0012236774,0.00005507108,0.000005714963],"category_scores_gemma":[0.000010700275,0.00013749214,0.000045675242,0.00041470028,0.00016241115,0.00040726087,0.0004827267,0.00028789835,0.00005247739],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010688871,0.0004846894,0.0005509949,0.000014447512,0.00007339338,0.000004387795,0.0005934468,0.1665006,0.0010948173,0.26267654,0.010175538,0.55782044],"study_design_scores_gemma":[0.00080198864,0.0001058706,0.01675713,0.000092808325,0.000014802313,0.000051032843,0.000020584168,0.93959725,0.000011908655,0.0043527293,0.037929077,0.00026484882],"about_ca_topic_score_codex":0.0000049567557,"about_ca_topic_score_gemma":0.000056421388,"teacher_disagreement_score":0.9217653,"about_ca_system_score_codex":0.000080302685,"about_ca_system_score_gemma":0.00012620473,"threshold_uncertainty_score":0.6208582},"labels":[],"label_agreement":null},{"id":"W2153962286","doi":"10.1109/isie.2007.4375075","title":"A Robust Congestion Control Strategy for Delay Dependent Differentiated-Services Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Network congestion; Robustness (evolution); Computer science; Queueing theory; Differentiated services; Probabilistic logic; Scalability; Flow control (data); Markov process; Control theory (sociology); Active queue management; Robust control; Distributed computing; Computer network; Quality of service; Control system; Control (management); Engineering; Mathematics; Network packet","score_opus":0.0185843555762449,"score_gpt":0.2307829852071181,"score_spread":0.2121986296308732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153962286","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009167521,0.000450032,0.9870046,0.00034392174,0.0007582172,0.0006186555,0.0000039619476,0.0004921063,0.0011609786],"genre_scores_gemma":[0.9930621,0.000020895119,0.004929894,0.0009343289,0.0003500117,0.0000639209,0.000016797674,0.00001537417,0.00060671003],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814516,0.000055273216,0.00041655352,0.00050228677,0.00025366544,0.0006270286],"domain_scores_gemma":[0.9986328,0.0004089129,0.00014962598,0.00039201838,0.00020064082,0.00021602145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006870691,0.00023665107,0.00026089762,0.00008852182,0.00020466474,0.00029211194,0.00069334416,0.00017258796,0.00003590706],"category_scores_gemma":[0.000007832744,0.0002002548,0.00011746694,0.00019576344,0.000030243562,0.0003651945,0.00005554915,0.00016418904,0.000020307889],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018271027,0.00014359623,0.0011486534,0.000018612045,0.00012381512,0.000029799146,0.000052752406,0.31023014,0.000047803678,0.14534052,0.0005871451,0.54209447],"study_design_scores_gemma":[0.0024653652,0.0001786,0.004065977,0.000018639974,0.00004089199,0.000025018378,0.000038426235,0.99162406,0.000027626109,0.00062701985,0.00062215806,0.00026624772],"about_ca_topic_score_codex":0.000044200202,"about_ca_topic_score_gemma":0.0007570804,"teacher_disagreement_score":0.9838945,"about_ca_system_score_codex":0.000041013383,"about_ca_system_score_gemma":0.00003467629,"threshold_uncertainty_score":0.8166154},"labels":[],"label_agreement":null},{"id":"W2154513820","doi":"","title":"TCP with Adaptive Delay and Loss Response for Heterogeneous Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"TCP global synchronization; TCP Friendly Rate Control; TCP acceleration; TCP Westwood plus; Zeta-TCP; Computer science; Computer network; CUBIC TCP; Compound TCP; TCP tuning; TCP Westwood; H-TCP; Transmission Control Protocol","score_opus":0.007842523088776934,"score_gpt":0.20887301750800114,"score_spread":0.20103049441922421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154513820","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02897456,0.00031501395,0.96793574,0.0020864643,0.00006181977,0.00024181341,6.080626e-7,0.00015871774,0.00022525294],"genre_scores_gemma":[0.9656511,0.000011460362,0.03167722,0.0019812621,0.000069808324,0.000019271227,4.197653e-7,0.000004678096,0.00058478815],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992063,0.000055715846,0.00010748453,0.00029416275,0.00009255095,0.00024380037],"domain_scores_gemma":[0.9993211,0.0002432408,0.000037558446,0.00022747953,0.00006337124,0.00010723271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021167567,0.000113917384,0.00012353223,0.0000311258,0.000106060856,0.00009215228,0.00022099719,0.00004779817,0.0000037389716],"category_scores_gemma":[0.0000070996666,0.00008330792,0.000030028805,0.00011684844,0.000035158602,0.00014059935,0.00002360049,0.000059988713,0.0000026870434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030865665,0.000059361333,0.00010256768,0.0000011667976,0.00004453178,0.0001010487,0.00015750712,0.06472121,0.000013263915,0.07000378,0.0017373023,0.8599717],"study_design_scores_gemma":[0.0010038319,0.001323386,0.0006630385,0.000009701665,0.000008925042,0.00015471359,0.0000065657528,0.9928011,0.00002456989,0.0006676946,0.0031689222,0.00016755944],"about_ca_topic_score_codex":0.0000015145756,"about_ca_topic_score_gemma":0.000012533407,"teacher_disagreement_score":0.93667656,"about_ca_system_score_codex":0.000011924565,"about_ca_system_score_gemma":0.000029606615,"threshold_uncertainty_score":0.33971983},"labels":[],"label_agreement":null},{"id":"W2154556387","doi":"10.1109/ccece.2002.1012980","title":"Inter-domain adaptive traffic engineering for IP differentiated services MPLS-based networks","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Multiprotocol Label Switching; Computer science; Computer network; Differentiated services; Traffic engineering; Network packet; The Internet; Broadband; Internet traffic engineering; Service provider; Broadband networks; Quality of service; Telecommunications; Service (business); Network traffic control; World Wide Web","score_opus":0.007904430332872987,"score_gpt":0.19246008562997785,"score_spread":0.18455565529710485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154556387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015228575,0.0001752253,0.98266196,0.00021900082,0.0006103981,0.0003538479,0.0000014948074,0.0005229549,0.0002265412],"genre_scores_gemma":[0.9553838,0.0000023515322,0.043773416,0.00047968572,0.000079584956,0.000102056925,0.000006193042,0.000017183787,0.00015575357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873734,0.00006167673,0.00024399154,0.00039883784,0.00012771957,0.00043042284],"domain_scores_gemma":[0.99914515,0.00025017382,0.00006714693,0.00033076122,0.00007546591,0.0001313316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020992482,0.00021854542,0.0002209551,0.000085928186,0.00009967159,0.00015191278,0.00049972837,0.000091424634,0.000028029179],"category_scores_gemma":[0.000007736048,0.00019260617,0.0001255625,0.00029707878,0.000015126052,0.0001866689,0.000029569313,0.00012567204,0.0000105302715],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004790195,0.00012594622,0.0000630486,0.00002659191,0.00009359354,0.00000608604,0.00014575323,0.7028044,0.000038861162,0.17890108,0.00043835613,0.117308415],"study_design_scores_gemma":[0.0011548194,0.0001253166,0.00011991848,0.000039317903,0.000012840779,0.0000026181642,0.000030172154,0.9948427,0.000062969986,0.00023604829,0.0031338788,0.00023937706],"about_ca_topic_score_codex":0.000002310256,"about_ca_topic_score_gemma":0.000029887686,"teacher_disagreement_score":0.9401552,"about_ca_system_score_codex":0.000031417814,"about_ca_system_score_gemma":0.000032049513,"threshold_uncertainty_score":0.7854251},"labels":[],"label_agreement":null},{"id":"W2154651039","doi":"10.1109/iscc.2008.4625713","title":"Efficient traffic policing for videoconference traffic over wireless cellular networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Videoconferencing; Computer science; Computer network; Wireless; Token bucket; Bandwidth (computing); Teleconference; Traffic shaping; Quality of service; Traffic policing; Traffic generation model; Wireless network; Multimedia; Telecommunications; Network packet; Network traffic control","score_opus":0.01488406946076674,"score_gpt":0.21771621032591557,"score_spread":0.20283214086514884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154651039","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41026482,0.00014584095,0.58754927,0.00035990868,0.00047124355,0.00040257588,0.0000010377607,0.00044829492,0.00035700886],"genre_scores_gemma":[0.9931785,0.000026660704,0.0045734644,0.00080781087,0.00043416093,0.00010220031,0.000004446109,0.000024837916,0.0008479547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976697,0.00007469746,0.00043671599,0.00070257083,0.00033918046,0.0007771408],"domain_scores_gemma":[0.99851155,0.00036239106,0.0001280004,0.00062038994,0.00012503196,0.00025264025],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030736753,0.00031300157,0.0003723158,0.0001253711,0.00045768515,0.00012653535,0.0009324498,0.00015203445,0.000040870375],"category_scores_gemma":[0.000015036372,0.0002803754,0.0002225919,0.0004778646,0.00010994107,0.00014200428,0.000094453724,0.00021321807,0.000033441287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017728124,0.000102682505,0.000029774877,0.000007681129,0.000021603484,0.000015496946,0.0003291123,0.7841817,0.00007904563,0.023028262,0.0019904394,0.19019647],"study_design_scores_gemma":[0.0011437665,0.0001084098,0.00028065458,0.000025085086,0.000013580249,0.000029180637,0.000017808617,0.9963596,0.00008078555,0.000020528376,0.0015507555,0.0003698637],"about_ca_topic_score_codex":0.000015464391,"about_ca_topic_score_gemma":0.00002707301,"teacher_disagreement_score":0.5829758,"about_ca_system_score_codex":0.000058719597,"about_ca_system_score_gemma":0.00014947908,"threshold_uncertainty_score":0.99996483},"labels":[],"label_agreement":null},{"id":"W2154813964","doi":"10.1109/glocom.2002.1189090","title":"Effective bandwidth of multiclass Markovian traffic sources and admission control with dynamic buffer partitioning","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Markov process; Computer science; Quality of service; Buffer overflow; Bandwidth (computing); Admission control; Multiplexing; Statistical time division multiplexing; Packet loss; Markov chain; Computer network; Network packet; Mathematics; Telecommunications; Statistics","score_opus":0.0022610178087719107,"score_gpt":0.18518886336736345,"score_spread":0.18292784555859154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154813964","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46025717,0.00026429538,0.53778756,0.0003265963,0.00006444725,0.00034310002,8.745101e-7,0.000109836015,0.00084613095],"genre_scores_gemma":[0.9925524,0.000009091082,0.006981312,0.00015296935,0.000010508442,0.000034885023,5.6684786e-7,0.0000075577937,0.00025073104],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895674,0.00018033142,0.00016969803,0.00030299358,0.0001697101,0.00022050593],"domain_scores_gemma":[0.99917483,0.00033346584,0.00008286799,0.00019819656,0.000075183176,0.00013543757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025870002,0.00014177283,0.00021793036,0.00005792492,0.0001158051,0.00006644589,0.00013813104,0.000051209212,0.000031231957],"category_scores_gemma":[0.000038033817,0.00009962539,0.000036397632,0.0001676364,0.000080135665,0.0002011418,0.00001505626,0.00009368614,0.0000035803364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028814256,0.00027782243,0.010934253,0.00006246405,0.00019986478,0.000026542997,0.0010885487,0.026489643,0.00095911144,0.037299607,0.00015222399,0.9222218],"study_design_scores_gemma":[0.004001352,0.00046027088,0.012666896,0.000085532454,0.000040017814,0.000034333716,0.00009834149,0.9810627,0.00048342056,0.00015861145,0.00067294715,0.00023556828],"about_ca_topic_score_codex":0.0000044891476,"about_ca_topic_score_gemma":0.000033549528,"teacher_disagreement_score":0.95457304,"about_ca_system_score_codex":0.000016974174,"about_ca_system_score_gemma":0.000044237677,"threshold_uncertainty_score":0.40626055},"labels":[],"label_agreement":null},{"id":"W2154853575","doi":"10.1109/host.1999.778728","title":"Bandwidth allocation bounds for α-stable self-similar Internet traffic models","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Quality of service; Bandwidth (computing); Computer science; Bandwidth allocation; Computer network; The Internet; Internet traffic; Mathematical optimization; Mathematics","score_opus":0.015394683602547893,"score_gpt":0.21367146511915763,"score_spread":0.19827678151660974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154853575","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026847266,0.00021702478,0.98291403,0.00085773296,0.00042929998,0.00034073484,8.465777e-7,0.00051302195,0.012042596],"genre_scores_gemma":[0.8993646,0.000019964977,0.09394773,0.000864367,0.000055240318,0.00009842894,0.000004083275,0.000011164313,0.0056344015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884856,0.000056100675,0.00022137842,0.00038030918,0.00016523781,0.00032840724],"domain_scores_gemma":[0.99925154,0.00010889098,0.00005468544,0.00035512648,0.0001258162,0.00010391135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039235718,0.0001450949,0.00015469691,0.000058713587,0.00010159201,0.00022075369,0.00044084823,0.00007199202,0.000042421798],"category_scores_gemma":[0.000015227047,0.00013044711,0.0000800583,0.0002018852,0.000015890782,0.000572452,0.000024549614,0.00007140167,0.000029453126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008087506,0.00010193516,0.000007785731,0.000009020657,0.00003557794,9.40404e-7,0.0003505049,0.058015775,0.000010774727,0.85053337,0.019665044,0.07126121],"study_design_scores_gemma":[0.00066181197,0.00007556615,0.0000030217514,0.0000057956154,0.000011472701,0.000005922343,0.000016443537,0.9189429,0.00015355098,0.0063481857,0.07361229,0.0001630236],"about_ca_topic_score_codex":0.0000033484198,"about_ca_topic_score_gemma":0.000020105348,"teacher_disagreement_score":0.8966799,"about_ca_system_score_codex":0.00004781685,"about_ca_system_score_gemma":0.00012248388,"threshold_uncertainty_score":0.53194785},"labels":[],"label_agreement":null},{"id":"W2154904432","doi":"10.1109/icc.2005.1495023","title":"Effect of channel variation in IP/CDMA2000 interconnection performance","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Computer network; Bandwidth (computing); Queueing theory; Queue; Router; Network packet; Bandwidth allocation; Channel allocation schemes; Wireless; Distributed computing; Telecommunications","score_opus":0.00372749315815321,"score_gpt":0.20295308472122772,"score_spread":0.1992255915630745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154904432","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59928757,0.000045138768,0.39581713,0.00061016105,0.00026788766,0.00014516868,1.0398499e-7,0.00009612426,0.0037307413],"genre_scores_gemma":[0.9983345,0.000015526892,0.0010724865,0.00010210302,0.00009245355,0.000017114153,3.5713828e-7,0.0000026097916,0.00036282052],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937516,0.00007438148,0.0001731435,0.00015626852,0.00009835059,0.0001226803],"domain_scores_gemma":[0.99963415,0.0001041256,0.000049981936,0.00016163934,0.000026224148,0.00002389115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045939465,0.00006932093,0.000110453206,0.00009822085,0.000021978642,0.000018340908,0.00020085773,0.000039855553,0.000028943281],"category_scores_gemma":[0.000014089217,0.00005750763,0.000027723285,0.00024257181,0.000008812194,0.0004443691,0.000028992064,0.0000682762,0.00004451715],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027411563,0.000025208425,0.00022266769,0.000009395928,0.0000039561423,2.793721e-7,0.0002663592,0.012288168,0.00012149059,0.004732271,0.00006365285,0.9822391],"study_design_scores_gemma":[0.0006108392,0.00027912066,0.004064862,0.000021649725,0.0000024603194,0.0000032600792,0.0000020421935,0.9919486,0.0025702612,0.000035960715,0.00039614472,0.000064769505],"about_ca_topic_score_codex":0.000021403173,"about_ca_topic_score_gemma":0.00003767478,"teacher_disagreement_score":0.9821744,"about_ca_system_score_codex":0.00003461835,"about_ca_system_score_gemma":0.000014091361,"threshold_uncertainty_score":0.23450932},"labels":[],"label_agreement":null},{"id":"W2154960721","doi":"10.1109/iscc.2009.5202237","title":"Discrete-time analysis of packet data discarding in high speed multimedia networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Goodput; Computer science; Network packet; Computer network; Queueing theory; Real-time computing; Queue; Wireless; Throughput; Telecommunications","score_opus":0.013353429196062453,"score_gpt":0.24935769855921636,"score_spread":0.2360042693631539,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154960721","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059725724,0.0002367875,0.93490654,0.0019532945,0.00021487275,0.00020463824,0.000018280538,0.00019187602,0.0025480043],"genre_scores_gemma":[0.9907271,0.000018400573,0.0086694425,0.00019363481,0.00008691675,9.781268e-7,0.00008014625,0.000003787002,0.00021956481],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840146,0.0001225331,0.00036827667,0.00049143645,0.00031687377,0.00029942748],"domain_scores_gemma":[0.99826854,0.00020382414,0.00010678777,0.0012814348,0.000045108547,0.00009427913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070399675,0.00013981338,0.00044825475,0.0002525141,0.00003348078,0.00007619146,0.0014063469,0.0000653632,0.00007026828],"category_scores_gemma":[0.000040426912,0.000113800714,0.000101756465,0.0018077624,0.0000327611,0.0004871033,0.00024255001,0.00012089975,0.000012913395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017631197,0.000096665295,0.00607996,0.0000010332824,0.0003723701,0.000013580514,0.00011406101,0.3487661,0.0000514188,0.007994692,0.0018129016,0.6346796],"study_design_scores_gemma":[0.00045680106,0.0000223401,0.049217008,0.000009563693,0.00019471493,4.948568e-7,0.000009296552,0.9497376,0.0000060078128,0.00016102752,0.00005017824,0.00013495513],"about_ca_topic_score_codex":0.000057086385,"about_ca_topic_score_gemma":0.00008503501,"teacher_disagreement_score":0.9310014,"about_ca_system_score_codex":0.00002057734,"about_ca_system_score_gemma":0.000023867535,"threshold_uncertainty_score":0.46406582},"labels":[],"label_agreement":null},{"id":"W2154988825","doi":"10.1109/cnsr.2005.60","title":"Third-Party Flow Control","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Flow control (data); Acknowledgement; Reliability (semiconductor); The Internet; Traffic shaping; Bandwidth (computing); Network traffic control; Control (management); Traffic flow (computer networking); Computer security; Network packet","score_opus":0.006375380946661813,"score_gpt":0.20173861337726207,"score_spread":0.19536323243060025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154988825","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005241424,0.00017730524,0.94384784,0.013956803,0.00026442556,0.00009870995,5.440637e-7,0.0005103827,0.04061986],"genre_scores_gemma":[0.9417841,0.0000064976375,0.045764755,0.0068588722,0.00037982897,0.000014452309,3.7775797e-7,0.00000386265,0.0051872963],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991906,0.00003580673,0.00014632178,0.00022823227,0.00016171765,0.00023726569],"domain_scores_gemma":[0.9993894,0.00008097432,0.000028519727,0.00035057619,0.000048391663,0.00010213997],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00017466245,0.00009043642,0.00011459008,0.000029004446,0.000077756136,0.000099739205,0.00048409577,0.000040935814,0.00018102657],"category_scores_gemma":[0.000010271694,0.00007099751,0.000058497557,0.00012245978,0.000019176974,0.0003376612,0.00003766474,0.000085886,0.0010938095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004217185,0.000029151795,0.000077484474,4.9430724e-7,0.000011509498,0.000002859578,0.000044587076,0.0063168267,0.000024682748,0.13221511,0.037324585,0.8239485],"study_design_scores_gemma":[0.0006891901,0.000020267646,0.00018837344,0.0000017475501,0.0000032568882,0.0000065931836,0.00000205432,0.83711445,0.000043680062,0.0003834981,0.16145281,0.00009407535],"about_ca_topic_score_codex":0.0000021410326,"about_ca_topic_score_gemma":0.000017931376,"teacher_disagreement_score":0.9412599,"about_ca_system_score_codex":0.000015872018,"about_ca_system_score_gemma":0.00003730629,"threshold_uncertainty_score":0.999684},"labels":[],"label_agreement":null},{"id":"W2155026375","doi":"10.1109/hspr.2008.4734414","title":"Internal congestion control in a cluster-based router","year":2008,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Router; Computer science; Computer network; Network congestion; Active queue management; Queue; One-armed router; Core router; Explicit Congestion Notification; Scheduling (production processes); Network traffic control; Slow-start; Engineering; Network packet","score_opus":0.009922500057732344,"score_gpt":0.20403113722821006,"score_spread":0.19410863717047772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155026375","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040084116,0.00004786484,0.95166785,0.0041581867,0.00033134996,0.00017746589,5.286925e-7,0.0002055095,0.00332714],"genre_scores_gemma":[0.98827,0.0000034425427,0.0054816036,0.0054195714,0.00008359746,0.000033461398,8.436319e-7,0.000005204227,0.00070230436],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895424,0.0000988001,0.00023613815,0.00028150695,0.00018370755,0.00024563045],"domain_scores_gemma":[0.99937916,0.00016172612,0.00005010477,0.0002705479,0.000055423454,0.00008303217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019729653,0.00011633516,0.00015927257,0.00011154827,0.000053034466,0.000049731814,0.00042588505,0.000059394526,0.00004969507],"category_scores_gemma":[0.000018348754,0.00010039731,0.000057817233,0.00018955523,0.000043706717,0.00027191013,0.000034079814,0.00014223657,0.00011397849],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005051529,0.0007327061,0.0950768,0.0000158696,0.00006965658,0.0006989039,0.00090894534,0.082169585,0.00028161207,0.0987419,0.020992486,0.6998064],"study_design_scores_gemma":[0.0034691072,0.000081852515,0.013657847,0.000017778837,0.0000023122238,0.000043924683,0.0000030802328,0.98008466,0.00002633794,0.00014334686,0.00232989,0.00013985744],"about_ca_topic_score_codex":0.000050753988,"about_ca_topic_score_gemma":0.000075221426,"teacher_disagreement_score":0.94818586,"about_ca_system_score_codex":0.000042015035,"about_ca_system_score_gemma":0.00008046302,"threshold_uncertainty_score":0.40940836},"labels":[],"label_agreement":null},{"id":"W2155225845","doi":"10.1109/icc.1997.609936","title":"Performance evaluation of rate-based congestion control schemes for ABR service over broadband satellite networks interworking with ATM/B-ISDNs","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer network; Network congestion; Computer science; Asynchronous Transfer Mode; Broadband Integrated Services Digital Network; Broadband; Broadband networks; Integrated Services Digital Network; Scheme (mathematics); Default gateway; Quality of service; Real-time computing; Telecommunications","score_opus":0.026152617338113783,"score_gpt":0.23408377985634155,"score_spread":0.20793116251822777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155225845","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12327321,0.0009546188,0.87238187,0.0009426172,0.00027900885,0.0009495556,0.0000017509898,0.00016249571,0.0010548817],"genre_scores_gemma":[0.993105,0.00004680087,0.0051680864,0.0012192723,0.00014379714,0.00016390432,0.0000083955265,0.00001623999,0.00012852496],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982575,0.00016879635,0.00037729973,0.00041951,0.00042976165,0.00034710934],"domain_scores_gemma":[0.9979837,0.00039941334,0.00025838616,0.00042380323,0.0008463156,0.00008838002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011159341,0.00022348503,0.0002886049,0.000085527856,0.00013547663,0.00011770526,0.00039253285,0.000107097825,0.00011947258],"category_scores_gemma":[0.000026936836,0.00018016754,0.000070729104,0.00044956393,0.00005180042,0.0004776379,0.000024395731,0.00012890152,0.0000074050663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017577954,0.000080939266,0.0030012208,0.000026561389,0.00006802466,4.257477e-7,0.00008534168,0.30552655,0.000042570497,0.0015380915,0.00016875812,0.68928576],"study_design_scores_gemma":[0.006381289,0.0002561874,0.0048424685,0.00014745726,0.00012416898,0.0000024790431,0.0000081874305,0.9860941,0.00016350584,0.000017914574,0.0017305361,0.00023167914],"about_ca_topic_score_codex":0.000008566761,"about_ca_topic_score_gemma":0.00006884983,"teacher_disagreement_score":0.8698318,"about_ca_system_score_codex":0.000060943872,"about_ca_system_score_gemma":0.00007158654,"threshold_uncertainty_score":0.73470193},"labels":[],"label_agreement":null},{"id":"W2155291040","doi":"10.1109/iscas.2005.1465023","title":"Stroboscopic Model and Bifurcations in TCP/RED","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Transmission Control Protocol; TCP global synchronization; Computer science; CHAOS (operating system); Random early detection; Stroboscope; Network packet; TCP tuning; Transmission (telecommunications); TCP Friendly Rate Control; TCP acceleration; Computer network; Control theory (sociology); Topology (electrical circuits); Network congestion; Mathematics; Control (management); Telecommunications; Engineering; Artificial intelligence; Computer security; Electrical engineering","score_opus":0.011117314964246831,"score_gpt":0.2230171049982119,"score_spread":0.21189979003396506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155291040","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03985572,0.00013959127,0.9400719,0.011782977,0.000038231676,0.00008367322,2.2618929e-7,0.00011608768,0.00791163],"genre_scores_gemma":[0.9365982,0.000012191372,0.060915057,0.00062560797,0.00002870047,0.000011574962,3.0428998e-7,0.0000017910808,0.0018065913],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995675,0.000011968643,0.00009578716,0.00015121434,0.000058002654,0.000115541545],"domain_scores_gemma":[0.999742,0.000025258088,0.000013299132,0.00016007267,0.00001527725,0.00004410658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006054732,0.00004762588,0.000057427387,0.000051505496,0.000032433378,0.000044501314,0.00016671208,0.00002247895,0.00001369178],"category_scores_gemma":[0.0000039709066,0.000043102948,0.000009556153,0.00012615052,0.000012056263,0.00023024085,0.00003895515,0.00004879197,0.000018506444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011995478,0.000039153198,0.00090046576,0.0000011521998,0.0000028558247,6.348022e-7,0.00017960576,0.13671161,0.000058664788,0.30172348,0.0017484662,0.55863273],"study_design_scores_gemma":[0.00028290966,0.0000073728093,0.0019715703,0.0000032022306,8.959169e-7,0.0000011734604,0.000004399793,0.9953141,0.000009252664,0.0012883907,0.001066731,0.000049988037],"about_ca_topic_score_codex":0.000004745135,"about_ca_topic_score_gemma":0.00015262389,"teacher_disagreement_score":0.89674246,"about_ca_system_score_codex":0.000012495088,"about_ca_system_score_gemma":0.000032360567,"threshold_uncertainty_score":0.17576872},"labels":[],"label_agreement":null},{"id":"W2155326824","doi":"10.1109/icc.1994.368763","title":"A comparative study of some leaky bucket network access schemes","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Computer network; Leaky bucket; Network congestion; Access control; Distributed computing","score_opus":0.061984530679999615,"score_gpt":0.29388352626479153,"score_spread":0.2318989955847919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155326824","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6891199,0.001785723,0.2771165,0.001552005,0.0010319153,0.0012053786,0.0000010671031,0.00067820435,0.027509347],"genre_scores_gemma":[0.99702716,0.0000137351335,0.0014198394,0.0003398666,0.0001759072,0.000027443099,2.439405e-7,0.0000038288886,0.0009919736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988532,0.00009400591,0.0002605095,0.0002968118,0.0002478286,0.00024763713],"domain_scores_gemma":[0.99917096,0.00013763628,0.00010544893,0.0004242308,0.00008849766,0.00007324947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013881878,0.0001265583,0.00029094043,0.00004638684,0.00009834745,0.00011904899,0.0010042189,0.000032860575,0.00031270296],"category_scores_gemma":[0.0000051842853,0.00010340782,0.00004513693,0.00044910552,0.00003805136,0.00062121963,0.00023438802,0.00010716263,0.00006660904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039701055,0.002743908,0.010272744,0.000013060288,0.00037808705,0.000029246381,0.0054427707,0.036227986,0.000019520166,0.5364532,0.13169895,0.27668083],"study_design_scores_gemma":[0.0019821916,0.0005821548,0.0035606765,0.00001986135,0.000023400922,0.000004126025,0.00034543718,0.98526245,0.00007089882,0.002610111,0.0052251155,0.0003135953],"about_ca_topic_score_codex":0.000013389938,"about_ca_topic_score_gemma":0.000038655486,"teacher_disagreement_score":0.94903445,"about_ca_system_score_codex":0.000009588474,"about_ca_system_score_gemma":0.00001277427,"threshold_uncertainty_score":0.42168486},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010041685996219275,"score_gpt":0.20040574636972733,"score_spread":0.19036406037350806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155348805","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000922444,0.0010765527,0.9796194,0.00052834174,0.00017318815,0.00022260495,6.293106e-8,0.00017831077,0.017279107],"genre_scores_gemma":[0.9298088,0.00004009563,0.068340555,0.0010866872,0.000029571433,0.0000638831,0.0000024205679,0.0000060458606,0.0006219634],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988911,0.00013073407,0.0001951232,0.00033769617,0.00016217638,0.00028317934],"domain_scores_gemma":[0.9993751,0.00009101293,0.000048037862,0.00036047265,0.00004565857,0.00007968714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043655752,0.000114702074,0.00012726913,0.00008131818,0.00005119783,0.00009433422,0.00035164843,0.00006703337,0.000027893122],"category_scores_gemma":[0.000022659933,0.00010058157,0.000039750772,0.0006080367,0.000018990964,0.00020145088,0.000018096795,0.00011995046,0.000022895714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014825738,0.00024815157,0.00079761853,0.00000674444,0.0000096785525,0.0000052948194,0.00011448354,0.28441343,0.0000068586696,0.24069755,0.0017573466,0.471928],"study_design_scores_gemma":[0.0008241393,0.00003575856,0.00057032093,0.000008073169,0.000002183367,0.0000028685179,0.000012609723,0.9845114,0.000012357071,0.0003172962,0.013562617,0.00014039833],"about_ca_topic_score_codex":0.0000020489258,"about_ca_topic_score_gemma":0.00001621668,"teacher_disagreement_score":0.92888635,"about_ca_system_score_codex":0.00004150195,"about_ca_system_score_gemma":0.00011223879,"threshold_uncertainty_score":0.41015974},"labels":[],"label_agreement":null},{"id":"W2155607080","doi":"10.1109/icc.1995.525211","title":"A doubly stochastic Poisson model for self-similar traffic","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Burstiness; Self-similarity; Computer science; Stochastic process; Range (aeronautics); Poisson distribution; Data modeling; Stochastic modelling; Traffic generation model; Network packet; Statistical physics; Algorithm; Applied mathematics; Mathematics; Statistics; Real-time computing; Engineering; Computer network; Physics","score_opus":0.024837727458291298,"score_gpt":0.21908245675668034,"score_spread":0.19424472929838904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155607080","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015423563,0.00019943023,0.99022996,0.005335173,0.00021903022,0.00038290827,0.0000018321684,0.0008688833,0.0012204029],"genre_scores_gemma":[0.9150964,0.0000071744826,0.07855469,0.0011345914,0.00011563203,0.00009729553,8.615303e-7,0.000011839373,0.004981526],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988518,0.000017500268,0.00019379528,0.00038281627,0.00018786447,0.00036623457],"domain_scores_gemma":[0.9992369,0.000121048295,0.000047002322,0.0003770345,0.00008177238,0.00013624853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001408336,0.00015337493,0.00016510271,0.00006231876,0.00013653979,0.00012062033,0.0005727324,0.0000694413,0.000044754623],"category_scores_gemma":[0.000012078325,0.00013457879,0.00010578482,0.00018278253,0.000015232249,0.00026833385,0.000042436743,0.00008400149,0.000097122196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007664797,0.0001260374,3.9058108e-7,0.0000057357306,0.000023704499,0.0000018380806,0.00061421155,0.7056677,0.000005858519,0.06691144,0.02293353,0.2037019],"study_design_scores_gemma":[0.00096260867,0.000061922496,0.000001448172,0.0000053760177,0.000014776943,0.0000072246153,0.000005495353,0.99606115,0.0000022997508,0.0007739554,0.0019218732,0.00018185099],"about_ca_topic_score_codex":4.9619206e-7,"about_ca_topic_score_gemma":0.000008001565,"teacher_disagreement_score":0.913554,"about_ca_system_score_codex":0.000028339839,"about_ca_system_score_gemma":0.000028136405,"threshold_uncertainty_score":0.5487964},"labels":[],"label_agreement":null},{"id":"W2155964905","doi":"10.1109/glocom.2007.394","title":"Admission Control for Multimedia Delivery Over Deadline-Based Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Computer network; Network packet; Quality of service; Scheduling (production processes); Network congestion; Admission control; Packet loss; Queueing theory; Real-time computing","score_opus":0.008843900753363686,"score_gpt":0.2370481011642971,"score_spread":0.2282042004109334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155964905","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025658428,0.0002736468,0.9942832,0.00082789664,0.00073587405,0.00046432545,0.0000016526742,0.0003715464,0.000475993],"genre_scores_gemma":[0.9209302,0.0000040552973,0.073110536,0.004924352,0.00049016054,0.000030244108,0.0000059429176,0.000011883288,0.0004925957],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998612,0.00003320466,0.00029716382,0.00036569222,0.00020663235,0.00048531962],"domain_scores_gemma":[0.9980797,0.0010707204,0.00008553179,0.00035078122,0.00014117797,0.0002720828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006657332,0.0001668892,0.00018955437,0.00007797759,0.00013294903,0.0000792637,0.00046743228,0.00013061758,0.00006588722],"category_scores_gemma":[0.000054703898,0.00013716573,0.000137095,0.00019428904,0.00002774098,0.00018931495,0.000030877694,0.000119443444,0.000019976596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002374749,0.00008942109,0.0010058209,0.000004633147,0.000023799284,0.000012971662,0.000015590214,0.029412774,0.00013242723,0.00928022,0.010099426,0.94968545],"study_design_scores_gemma":[0.003622142,0.000102257785,0.0016054128,0.000013437075,0.000013887233,0.0000016526014,0.0000028518693,0.9784239,0.0001443232,0.00009925752,0.015782462,0.00018844941],"about_ca_topic_score_codex":0.000009173339,"about_ca_topic_score_gemma":0.000034495693,"teacher_disagreement_score":0.949497,"about_ca_system_score_codex":0.000034767734,"about_ca_system_score_gemma":0.000082322535,"threshold_uncertainty_score":0.5593456},"labels":[],"label_agreement":null},{"id":"W2155994160","doi":"10.1002/sat.701","title":"Buffer management and rate guarantees for TCP over satellite‐ATM networks","year":2001,"lang":"en","type":"article","venue":"International Journal of Satellite Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lockheed Martin (Canada)","funders":"National Aeronautics and Space Administration","keywords":"Computer network; Computer science; TCP Friendly Rate Control; TCP global synchronization; TCP tuning; TCP acceleration; CUBIC TCP; Zeta-TCP; Asynchronous Transfer Mode; Network congestion; Network packet","score_opus":0.02139064702330967,"score_gpt":0.28624608269772345,"score_spread":0.2648554356744138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155994160","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005361217,0.054246504,0.9120532,0.021234859,0.0015631953,0.0004137565,0.000007024069,0.00008229563,0.0050379224],"genre_scores_gemma":[0.80138373,0.15203117,0.044064764,0.0014013335,0.00029843996,0.000023836656,0.00001206893,0.000013846591,0.00077078526],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986852,0.00012322211,0.00056924415,0.00016740685,0.0002658123,0.00018910802],"domain_scores_gemma":[0.99775565,0.00057552604,0.00035847913,0.0006340405,0.0005784885,0.00009782504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006425728,0.00013990585,0.00018923571,0.0001968791,0.00014613925,0.00029746143,0.0023293232,0.000055041364,0.000015654648],"category_scores_gemma":[0.000029442592,0.0001262209,0.0001358736,0.00018432706,0.000102245074,0.00053041737,0.00034976922,0.000201851,0.0000069638145],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008439785,0.00011201624,0.001588392,0.0000034388468,0.0002873396,0.000019094801,0.00019374563,0.00041060083,0.00003223446,0.15843691,0.0003578704,0.838474],"study_design_scores_gemma":[0.0016903736,0.000090444046,0.022286274,0.0001431207,0.000058789876,0.00022567633,0.00007142509,0.092568524,0.000011986468,0.009992714,0.87264526,0.00021539806],"about_ca_topic_score_codex":0.0000032776122,"about_ca_topic_score_gemma":0.000014732781,"teacher_disagreement_score":0.8722874,"about_ca_system_score_codex":0.00005675939,"about_ca_system_score_gemma":0.000030103705,"threshold_uncertainty_score":0.5147139},"labels":[],"label_agreement":null},{"id":"W2156001917","doi":"10.1109/glocom.2007.1012","title":"Performance Analysis of IPTV Traffic in Home Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"IPTV; Computer science; Burstiness; Computer network; Bottleneck; Wireless network; Quality of service; Wireless; Telecommunications; Embedded system","score_opus":0.006747220780636502,"score_gpt":0.21071845616972187,"score_spread":0.20397123538908538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156001917","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5466391,0.00010064443,0.4512367,0.00006667682,0.000105497624,0.00004194765,9.1135064e-8,0.000057423604,0.0017519348],"genre_scores_gemma":[0.9970704,0.000035639983,0.0024775523,0.0001484035,0.000034178724,0.0000023196571,0.0000012606091,0.0000026882096,0.00022758415],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905014,0.000021818169,0.00031036776,0.0002122245,0.00013644023,0.00026902065],"domain_scores_gemma":[0.99939907,0.00012803146,0.00006671736,0.00030668647,0.000038814964,0.00006069586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000639726,0.000083114275,0.0002311164,0.00039141998,0.000025543046,0.00001970334,0.00043855692,0.000055174278,0.00003743839],"category_scores_gemma":[0.0000037990083,0.00007262877,0.00008939433,0.0025820083,0.000027918126,0.00017967526,0.00004118421,0.00009664109,0.000005792448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000083927225,0.00003268819,0.017123748,0.0000013011942,0.000055710894,0.0000034818063,0.00007731754,0.47341275,0.0000026275984,0.0049051745,0.00004675629,0.50433004],"study_design_scores_gemma":[0.0002053448,0.00002843489,0.15706047,0.000004346055,0.000029757526,7.074416e-7,0.000010628171,0.8424687,0.000006272541,0.0000056527942,0.00010317337,0.000076529825],"about_ca_topic_score_codex":0.000008629347,"about_ca_topic_score_gemma":0.00029523755,"teacher_disagreement_score":0.5042535,"about_ca_system_score_codex":0.000020166706,"about_ca_system_score_gemma":0.000016783742,"threshold_uncertainty_score":0.29617152},"labels":[],"label_agreement":null},{"id":"W2156117305","doi":"","title":"Approximation of Generalized Processor Sharing with Interleaved Stratified Timer Wheels - Extended Version","year":2009,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Generalized processor sharing; Processor sharing; Timer; Scheduling (production processes); Queue; Network packet; Distributed computing; Real-time computing; Computer network; Dynamic priority scheduling; Round-robin scheduling; Quality of service; Mathematical optimization; Embedded system","score_opus":0.010337815802241813,"score_gpt":0.223308536017671,"score_spread":0.2129707202154292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156117305","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09162801,0.00004132227,0.8999964,0.0008455926,0.000054869684,0.00025049222,3.3084513e-7,0.0002024015,0.0069805556],"genre_scores_gemma":[0.9559221,0.0000027482379,0.042727612,0.00020707272,0.00002757295,0.000008026683,0.0000034611564,0.000003514378,0.0010978375],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991187,0.000023483288,0.00021378565,0.0002787,0.0002124917,0.0001528658],"domain_scores_gemma":[0.9994128,0.000017892557,0.00011329883,0.0002834539,0.000120879675,0.000051725594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014747122,0.00010635054,0.00015308049,0.00006111706,0.00004880016,0.00007751334,0.00039502516,0.00004033196,0.0000517585],"category_scores_gemma":[0.000005906021,0.00007809031,0.000033953012,0.00022810882,0.000018354205,0.00045362327,0.000028462615,0.000064342756,0.000012817978],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032143283,0.0002911093,0.00011294003,0.000031328138,0.000057363075,0.0000069190364,0.00093129004,0.0038091764,0.016018543,0.21008064,0.0008951229,0.76744413],"study_design_scores_gemma":[0.0017573371,0.00037535472,0.0010943451,0.000058848076,0.000015591877,0.0000067162096,0.000036370227,0.9811763,0.011919481,0.0032362442,0.0001356244,0.00018777009],"about_ca_topic_score_codex":0.0000052050414,"about_ca_topic_score_gemma":0.0000050730837,"teacher_disagreement_score":0.97736716,"about_ca_system_score_codex":0.000013976728,"about_ca_system_score_gemma":0.000039302897,"threshold_uncertainty_score":0.31844303},"labels":[],"label_agreement":null},{"id":"W2156170381","doi":"10.1109/glocom.1990.116816","title":"A heuristic approach for performance analysis of ATM systems","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Asynchronous Transfer Mode; Heuristic; Queue; Buffer overflow; Computer science; Asynchronous communication; Buffer (optical fiber); Network packet; Queueing theory; Range (aeronautics); Mathematical optimization; Mode (computer interface); Algorithm; Computer network; Mathematics; Artificial intelligence; Engineering","score_opus":0.022881057419568057,"score_gpt":0.20071792116081213,"score_spread":0.17783686374124408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156170381","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052528637,0.00037455707,0.9867707,0.00005415905,0.000095694624,0.00016971603,0.0000017450153,0.000080536505,0.007200033],"genre_scores_gemma":[0.9798446,0.000018700113,0.017528858,0.000046052395,0.000034814657,0.00005156926,0.0000021760873,0.0000026205425,0.0024705692],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999311,0.000020277665,0.00019454537,0.00019729229,0.00013102658,0.00014588129],"domain_scores_gemma":[0.99939764,0.00009061123,0.00007030471,0.00031607426,0.00008286163,0.0000424916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015286838,0.00006772913,0.00021506369,0.00011369829,0.000047464473,0.000040095783,0.00035246965,0.000028372075,0.000016885866],"category_scores_gemma":[0.000008467825,0.000054081716,0.00010232687,0.0007100893,0.000017488792,0.00010527844,0.000023858269,0.000028927625,0.0000062531262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011637255,0.00024147617,0.002940994,0.00011718813,0.0009988763,8.617536e-7,0.00032555935,0.49964836,0.000015083852,0.17591502,0.0057258084,0.31405914],"study_design_scores_gemma":[0.00019031785,0.000046294947,0.00038992858,0.0000028360175,0.0001299092,0.0000011693455,0.000009435159,0.9983651,0.0000036310123,0.0000048444667,0.00078932324,0.00006719509],"about_ca_topic_score_codex":0.0000052205355,"about_ca_topic_score_gemma":7.304554e-7,"teacher_disagreement_score":0.9745918,"about_ca_system_score_codex":0.000009211913,"about_ca_system_score_gemma":0.000006135126,"threshold_uncertainty_score":0.22053884},"labels":[],"label_agreement":null},{"id":"W2156176312","doi":"10.1109/cnsr.2006.19","title":"Bandwidth Provisioning and Capacity Planning Tools","year":2006,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Moncton","funders":"Natural Sciences and Engineering Research Council of Canada; Atlantic Canada Opportunities Agency","keywords":"Provisioning; Bandwidth (computing); Computer science; Quality of service; Computer network; The Internet; Bandwidth allocation; Voice over IP; Telecommunications; World Wide Web","score_opus":0.017112448964998413,"score_gpt":0.20741734749990481,"score_spread":0.1903048985349064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156176312","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11910832,0.00018210815,0.8583931,0.0006516504,0.00011537362,0.00008214037,2.67685e-7,0.00025231624,0.021214765],"genre_scores_gemma":[0.9721446,0.0000011290655,0.02665219,0.00025920555,0.00009464944,0.000005347421,5.542156e-7,0.000002496159,0.00083980034],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941915,0.000020091085,0.00010376009,0.00019857984,0.000102360886,0.00015607584],"domain_scores_gemma":[0.99967235,0.00009544089,0.000026987676,0.00014020212,0.000023732808,0.000041287807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013101852,0.00006780043,0.0000778469,0.000027621376,0.000117159674,0.00024298567,0.0001584954,0.000028377677,0.00000904564],"category_scores_gemma":[0.000009779999,0.000054601434,0.000016336075,0.000090937116,0.00002133417,0.0003588357,0.00005436688,0.00006514943,0.0000098513465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003114542,0.00001839808,0.005121005,0.0000036876613,0.000004901388,0.000010817841,0.00010925471,0.0020118381,0.00016453864,0.38251922,0.0035922413,0.60644096],"study_design_scores_gemma":[0.00090623734,0.00008299024,0.03870915,0.00004556077,0.0000066110733,0.000048834598,0.000024707915,0.92736363,0.0003674213,0.009354855,0.022735968,0.0003540061],"about_ca_topic_score_codex":0.000027431022,"about_ca_topic_score_gemma":0.0000058653354,"teacher_disagreement_score":0.9253518,"about_ca_system_score_codex":0.000007045138,"about_ca_system_score_gemma":0.000015122111,"threshold_uncertainty_score":0.23431164},"labels":[],"label_agreement":null},{"id":"W2156265443","doi":"10.1109/infcom.1995.515951","title":"Estimation of aggregate effective bandwidth for traffic admission in ATM networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Computer science; Kalman filter; Bandwidth (computing); Dynamic bandwidth allocation; Covariance matrix; Bandwidth allocation; Bandwidth management; Algorithm; Computer network; Artificial intelligence","score_opus":0.00865552682607274,"score_gpt":0.2219199059502781,"score_spread":0.21326437912420537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156265443","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041096218,0.000505323,0.95651263,0.0004851241,0.00020720273,0.0005703723,4.1484827e-7,0.00010748004,0.00051523134],"genre_scores_gemma":[0.9869681,0.00003068652,0.012445542,0.000103410304,0.000043068707,0.00007894285,0.0000015737505,0.000005519124,0.00032313654],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991726,0.00005847855,0.00022474311,0.00023740927,0.00010823061,0.00019849067],"domain_scores_gemma":[0.99927133,0.00033878602,0.00008856314,0.00019810992,0.000037969156,0.00006522845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022821233,0.00010149966,0.00017586675,0.000073176896,0.000043305256,0.00002895117,0.00023775072,0.00006860454,0.000029870085],"category_scores_gemma":[0.00004429824,0.00008491684,0.00006392671,0.00030291374,0.000019051347,0.0002178874,0.000025118463,0.0000726027,0.000007106381],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011542306,0.000040838455,0.000025063857,0.0000055206765,0.000004038767,8.339965e-7,0.000078724326,0.3415985,0.000004589497,0.0030806682,0.00056239613,0.65458727],"study_design_scores_gemma":[0.0011022298,0.00016310225,0.00044625177,0.000057988895,0.000005217795,0.0000023215352,0.0000035386456,0.9974565,0.00011146781,0.00024698974,0.0003082174,0.000096171345],"about_ca_topic_score_codex":0.0000026910516,"about_ca_topic_score_gemma":0.000010772677,"teacher_disagreement_score":0.9458719,"about_ca_system_score_codex":0.000024796685,"about_ca_system_score_gemma":0.0000094248635,"threshold_uncertainty_score":0.34628084},"labels":[],"label_agreement":null},{"id":"W2156297043","doi":"10.1109/mic.2005.88","title":"Switching between Fixed and Call-Adaptive Playout: A Per-Call Playout Algorithm","year":2005,"lang":"en","type":"article","venue":"IEEE Internet Computing","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Concordia University; Catholic University of Korea","keywords":"Voice over IP; Computer science; Communication source; Network packet; Computer network; Network delay; Real-time computing; Algorithm; The Internet; Operating system","score_opus":0.014775507604844747,"score_gpt":0.2374776919616838,"score_spread":0.22270218435683906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156297043","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16517206,0.00023212163,0.8321233,0.0005814874,0.0005786267,0.00018005095,0.0000031729005,0.00039451537,0.000734673],"genre_scores_gemma":[0.90395993,0.0000037049426,0.09348152,0.0006904316,0.0014397072,0.0000050927692,0.0000023366802,0.000022265434,0.00039502364],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99765587,0.00013495433,0.00052392227,0.00074133935,0.00034308425,0.0006008275],"domain_scores_gemma":[0.9985746,0.00051823,0.00020957047,0.00035243324,0.00010053454,0.0002446451],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048765112,0.00033055028,0.00041428802,0.00013215518,0.00018114089,0.00038396893,0.0008971076,0.00013672841,0.000008508247],"category_scores_gemma":[0.000021938846,0.00032143833,0.00010861796,0.00016759138,0.00005743002,0.00040173132,0.00037093015,0.00053884444,0.00011897191],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008170644,0.000026518388,0.00073507696,0.0000045195866,0.00007668433,0.000023343886,0.0025682244,0.002835859,0.000047050864,0.000983853,0.0010189018,0.9916718],"study_design_scores_gemma":[0.0007899046,0.00012200514,0.0013906884,0.00012495226,0.000023168308,0.000064827975,0.000035269266,0.9936876,0.00014775046,0.000074613046,0.003164432,0.00037474293],"about_ca_topic_score_codex":0.00011113712,"about_ca_topic_score_gemma":0.00004145274,"teacher_disagreement_score":0.99129707,"about_ca_system_score_codex":0.000097943106,"about_ca_system_score_gemma":0.000057160778,"threshold_uncertainty_score":0.99992377},"labels":[],"label_agreement":null},{"id":"W2156339229","doi":"","title":"On the importance of local connectivity for Internet topology models","year":2009,"lang":"en","type":"article","venue":"TNO Repository","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Topology (electrical circuits); Network topology; Internet topology; Computer science; Hierarchy; Toolbox; Hierarchical network model; Logical topology; The Internet; Graph; Theoretical computer science; Focus (optics); Distributed computing; Mathematics; Computer network","score_opus":0.013810381571253562,"score_gpt":0.22684091000816836,"score_spread":0.2130305284369148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156339229","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09736887,0.00014182265,0.8947024,0.0018067608,0.0003413078,0.00016120668,4.1861267e-7,0.00006023156,0.005417018],"genre_scores_gemma":[0.99766546,0.0000012132284,0.0005579069,0.001216267,0.000076987926,0.000017137621,2.426227e-7,0.000002505634,0.00046224977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934936,0.000059191814,0.00016114894,0.00020133583,0.000095403135,0.00013358629],"domain_scores_gemma":[0.9991061,0.00037020215,0.00009501942,0.00034088115,0.000057483285,0.000030323545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018947345,0.00007252737,0.00012513131,0.000017851613,0.000055151453,0.000017862576,0.000395757,0.000046340316,0.000002614628],"category_scores_gemma":[0.000013326543,0.00005081198,0.000065299726,0.00005447925,0.000069481495,0.00008870712,0.000024661906,0.000079962185,0.0000017129086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034790588,0.000044138942,0.000040468567,0.0000016264579,0.000010142178,0.000004109224,0.00009875427,0.0027479723,0.00011826316,0.94957685,0.0027564939,0.044566415],"study_design_scores_gemma":[0.00033682527,0.00048853364,0.00066613045,0.00001596864,0.000007729786,0.00002249845,0.000020488456,0.9222719,0.0040290575,0.07161736,0.00042278672,0.0001006957],"about_ca_topic_score_codex":0.000006024299,"about_ca_topic_score_gemma":0.0000046472114,"teacher_disagreement_score":0.91952395,"about_ca_system_score_codex":0.000022716182,"about_ca_system_score_gemma":0.000038744653,"threshold_uncertainty_score":0.20720525},"labels":[],"label_agreement":null},{"id":"W2156442470","doi":"10.1109/icc.2005.1494351","title":"The role of traffic forecasting in QoS routing - a case study of time-dependent routing","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Static routing; Computer network; Policy-based routing; Dynamic Source Routing; Routing (electronic design automation); Equal-cost multi-path routing; Link-state routing protocol; Multipath routing; Destination-Sequenced Distance Vector routing; Distributed computing; Routing protocol","score_opus":0.013045418884000648,"score_gpt":0.22340841705649803,"score_spread":0.21036299817249737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156442470","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9890174,0.0001292765,0.009010829,0.00010620943,0.00006934692,0.00035000715,2.3746317e-7,0.00007188958,0.0012447672],"genre_scores_gemma":[0.99830025,0.0000014961229,0.0014324695,0.000017800909,0.000088797795,0.0000144494115,8.4417294e-8,0.0000069116413,0.00013776327],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984688,0.00014613682,0.0005781456,0.00025181475,0.00026398868,0.00029112064],"domain_scores_gemma":[0.9987727,0.0005379699,0.00023090451,0.0003386102,0.00007578881,0.000044035332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001088992,0.00011548513,0.00020927413,0.00006578498,0.00015274237,0.000056320183,0.00048293834,0.000034899622,0.000007402812],"category_scores_gemma":[0.000062113766,0.00008399707,0.000050674418,0.00032176677,0.000024017558,0.00018944804,0.00015772239,0.00014416753,0.0000049740747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008651243,0.00021982392,0.0013425162,0.0000014867477,0.00001813795,0.000065311804,0.004509653,0.1387019,0.000051875293,0.00088223256,0.000006456235,0.85419196],"study_design_scores_gemma":[0.0007939983,0.00013241504,0.00006383198,0.00002063124,0.000008383695,0.00017803434,0.007087157,0.9914795,0.000109518674,0.000012803575,0.000026660082,0.00008703428],"about_ca_topic_score_codex":0.00021259593,"about_ca_topic_score_gemma":0.002007113,"teacher_disagreement_score":0.85410494,"about_ca_system_score_codex":0.000031867614,"about_ca_system_score_gemma":0.00005034922,"threshold_uncertainty_score":0.3425301},"labels":[],"label_agreement":null},{"id":"W2156478987","doi":"10.1109/noms.2004.1317640","title":"Using application feedback in differentiated services and policies","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Quality of service; Differentiated services; Computer science; Mobile QoS; Computer network; Network packet; Bandwidth (computing); Differentiated service; Service (business); Class (philosophy); Integrated services; Resource (disambiguation); Distributed computing; Service provider; Service design","score_opus":0.013662880689289393,"score_gpt":0.23744749793297282,"score_spread":0.22378461724368343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156478987","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5796196,0.00007456894,0.4192549,0.0005966898,0.000026279693,0.0000641394,1.0423549e-7,0.00007044932,0.0002932988],"genre_scores_gemma":[0.9945812,0.000010624384,0.0050156163,0.00034175452,0.000020934573,0.0000046704035,6.2053164e-7,0.0000021154335,0.000022421447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958664,0.000010207393,0.00008812625,0.00014614276,0.000059479396,0.00010940558],"domain_scores_gemma":[0.99979466,0.000010706884,0.000023897495,0.00012318467,0.000016140397,0.0000314108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000038928363,0.000054413165,0.00006386645,0.000046611178,0.000037822425,0.00007459328,0.00015455179,0.000026011252,0.0000017835863],"category_scores_gemma":[5.829022e-7,0.000046845355,0.000008694514,0.00018807461,0.00001332429,0.00017302479,0.00005204248,0.00003412537,0.000006815213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010032733,0.00013522606,0.016490621,0.000032523618,0.00001695429,0.0000033567112,0.0016618358,0.026922466,0.004972485,0.5605432,0.000008372949,0.38920298],"study_design_scores_gemma":[0.000850382,0.000013636188,0.0521378,0.000024151004,0.0000032520966,0.0000071253467,0.000063563384,0.9388194,0.00027036795,0.0075715454,0.0001148879,0.00012386056],"about_ca_topic_score_codex":0.00040023774,"about_ca_topic_score_gemma":0.0003606453,"teacher_disagreement_score":0.91189694,"about_ca_system_score_codex":0.000016923164,"about_ca_system_score_gemma":0.000012610718,"threshold_uncertainty_score":0.1910298},"labels":[],"label_agreement":null},{"id":"W2156630404","doi":"10.1109/bss.1997.658906","title":"A hybrid VBR/ABR service for scalable MPEG2 video networking: a simulation-based analysis","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Computer Research Institute of Montréal","funders":"","keywords":"Computer science; Jitter; Variable bitrate; Computer network; Scalability; Asynchronous Transfer Mode; Real-time computing; Constant bitrate; Quality of service; Telecommunications","score_opus":0.024811255380036715,"score_gpt":0.23753555735553736,"score_spread":0.21272430197550063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156630404","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016407612,0.00022016029,0.99083024,0.004502024,0.00026261568,0.00032943985,0.0000029921764,0.00044061997,0.0017711277],"genre_scores_gemma":[0.97032523,0.000003835629,0.021272862,0.006213375,0.00029414473,0.000078766,0.000010114247,0.000011828389,0.0017898313],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983866,0.000059068057,0.00032564733,0.00053092005,0.000263388,0.00043435092],"domain_scores_gemma":[0.9977541,0.0010554299,0.000115458424,0.0006368453,0.00028111413,0.00015706175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028130147,0.00018514637,0.00029612318,0.00018760141,0.00023654621,0.0002676524,0.0006433736,0.00005502446,0.00031958666],"category_scores_gemma":[0.00003330561,0.00017183163,0.00023587083,0.0015908085,0.000016566524,0.0002774344,0.000053033767,0.00008218689,0.0001225581],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009013937,0.000058236445,0.0003909101,0.0000059178287,0.00013473029,0.000002277262,0.000032359483,0.88859695,0.0000020367154,0.002419794,0.0032946372,0.10505311],"study_design_scores_gemma":[0.00078998785,0.000038401588,0.00008711123,0.000007894452,0.00014986549,5.2239216e-7,0.0000026804573,0.9580831,0.000014416787,0.00034605103,0.04026361,0.00021638178],"about_ca_topic_score_codex":0.000027462145,"about_ca_topic_score_gemma":0.00009137068,"teacher_disagreement_score":0.9695574,"about_ca_system_score_codex":0.000035871664,"about_ca_system_score_gemma":0.000035038593,"threshold_uncertainty_score":0.70070904},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.00876255915241955,"score_gpt":0.220807138057594,"score_spread":0.21204457890517445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156806957","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016496419,0.0014058187,0.99433583,0.0017583646,0.0005549934,0.00039799727,0.000005489414,0.00030176635,0.0010747466],"genre_scores_gemma":[0.97859514,0.00005385472,0.017505137,0.0017194828,0.000093777024,0.00009134307,0.00001076272,0.000009602471,0.0019208849],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884325,0.000078766156,0.00021595365,0.00033984007,0.00013443585,0.00038774748],"domain_scores_gemma":[0.9989639,0.00029011912,0.00006286669,0.00035914467,0.000104409184,0.00021958585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002985548,0.00014373075,0.00018571914,0.000026296677,0.0001518263,0.000109609,0.00038957418,0.00009460152,0.00004650848],"category_scores_gemma":[0.00009043285,0.0001150077,0.00010395979,0.00019221498,0.000019714025,0.00016421698,0.000021841697,0.00009827817,0.000019212708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006629931,0.000095480864,0.00016462244,0.000004865579,0.000043385095,0.0000072094135,0.000022521459,0.016248904,0.000029613006,0.27406615,0.06489256,0.6443584],"study_design_scores_gemma":[0.0018048814,0.00010219863,0.000109901346,0.0000072138714,0.000010799801,0.00000603707,0.0000036848608,0.7142594,0.00002051325,0.00083813776,0.28268415,0.0001531421],"about_ca_topic_score_codex":5.6139777e-7,"about_ca_topic_score_gemma":0.000005963733,"teacher_disagreement_score":0.9784302,"about_ca_system_score_codex":0.000026934535,"about_ca_system_score_gemma":0.00006632886,"threshold_uncertainty_score":0.4689878},"labels":[],"label_agreement":null},{"id":"W2156812041","doi":"10.1109/ccece.1999.807192","title":"Efficient estimation techniques and a new description of variable-bit-rate video traffic parameters","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Variable bitrate; Computer science; Real-time computing; Asynchronous Transfer Mode; Computer network; Constant bitrate; Variable (mathematics); Traffic shaping; Set (abstract data type); Visual communication; Bit rate; Network traffic control; Multimedia","score_opus":0.018105005266301447,"score_gpt":0.2165543660145923,"score_spread":0.19844936074829084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156812041","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08140738,0.00014715032,0.91593885,0.00021859957,0.00012164645,0.00022166678,2.6790218e-7,0.00023670727,0.0017077137],"genre_scores_gemma":[0.67134666,0.0000107877995,0.32825086,0.0001019723,0.000008713389,0.000011099315,4.7849306e-7,0.0000037701463,0.00026563587],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990878,0.00010401397,0.00023988077,0.000265647,0.00013478832,0.00016786576],"domain_scores_gemma":[0.99941576,0.00010179181,0.00009197143,0.00023814049,0.00005782557,0.000094502524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045698142,0.00011217053,0.00014842737,0.00009204261,0.000054837376,0.00008991929,0.00015777814,0.000059275644,0.000012084947],"category_scores_gemma":[0.000047291473,0.00009843331,0.00003058631,0.00033153017,0.000036632944,0.00015827663,0.000021157459,0.00006527657,0.0000049120054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001221802,0.000051990428,0.000024335939,0.0000109724915,0.00001271847,0.0000015929314,0.00015062705,0.1570276,0.0006029501,0.18688814,0.0006054051,0.65461147],"study_design_scores_gemma":[0.0004125368,0.00009819068,0.00005361504,0.00003260491,0.000013409415,0.000024859191,0.000010993361,0.99449456,0.0015303469,0.0022400196,0.0009647069,0.0001241486],"about_ca_topic_score_codex":0.000020493064,"about_ca_topic_score_gemma":0.0000027742474,"teacher_disagreement_score":0.83746696,"about_ca_system_score_codex":0.000021727847,"about_ca_system_score_gemma":0.00008734747,"threshold_uncertainty_score":0.40139937},"labels":[],"label_agreement":null},{"id":"W2156865683","doi":"10.1504/ijipt.2005.007555","title":"Traffic driven multiple constraint-optimisation for QoS routing","year":2005,"lang":"en","type":"article","venue":"International Journal of Internet Protocol Technology","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Quality of service; Routing (electronic design automation); Constraint (computer-aided design); Mathematical optimization; Path (computing); Distributed computing; Computer network; Mathematics","score_opus":0.014104661129653723,"score_gpt":0.2885978633375276,"score_spread":0.2744932022078739,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156865683","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007856717,0.000011058343,0.9566986,0.012448513,0.0008779846,0.021642439,0.0000033184806,0.00020450699,0.0002568609],"genre_scores_gemma":[0.8744423,0.0000012799132,0.10534306,0.00033606164,0.00080562255,0.018889667,0.0000013278304,0.000011872816,0.00016884838],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983738,0.000037356436,0.0007826963,0.00023838402,0.00032871094,0.00023903661],"domain_scores_gemma":[0.9978792,0.00019396828,0.0007301313,0.00018639368,0.0009442623,0.000066024644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000393424,0.00015834661,0.00023556796,0.0004808852,0.000038174097,0.00014155488,0.0015335046,0.00016459648,0.000046191926],"category_scores_gemma":[0.00032155288,0.00014202886,0.00017008284,0.0001510327,0.00010466389,0.00050426775,0.00013517309,0.00031071762,0.000019600302],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018066296,0.00017922954,0.0004170397,0.000005799435,0.0001690305,0.00003126431,0.00020092819,0.012101097,0.0006606602,0.052349523,0.0027517332,0.930953],"study_design_scores_gemma":[0.0052317497,0.00058605697,0.000045665984,0.00017614014,0.000010656244,0.0008644256,0.00007256497,0.83963346,0.00469083,0.0011442627,0.14733127,0.00021291511],"about_ca_topic_score_codex":9.937731e-7,"about_ca_topic_score_gemma":0.000012196736,"teacher_disagreement_score":0.9307401,"about_ca_system_score_codex":0.0001832876,"about_ca_system_score_gemma":0.00015124254,"threshold_uncertainty_score":0.5791769},"labels":[],"label_agreement":null},{"id":"W2156995323","doi":"10.1109/comst.2008.4564480","title":"Transport control protocol in optical burst switched networks: issues, solutions, and challenges","year":2008,"lang":"en","type":"article","venue":"IEEE Communications Surveys & Tutorials","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Optical burst switching; Computer network; Reservation; Transmission (telecommunications); Transmission Control Protocol; Blocking (statistics); TCP tuning; Burst switching; TCP global synchronization; Telecommunications; Transmission delay; Optical performance monitoring; Wavelength-division multiplexing; Network packet","score_opus":0.08748674240849909,"score_gpt":0.29658222977150134,"score_spread":0.20909548736300226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156995323","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018364339,0.015241676,0.90364665,0.028874137,0.0022936312,0.045165796,0.000026173386,0.0009562791,0.001959217],"genre_scores_gemma":[0.9586154,0.0054050777,0.006055709,0.00012698521,0.00052952766,0.029111993,0.000015499414,0.000023621682,0.00011618507],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9956274,0.0022431333,0.00078813155,0.0005026693,0.00031202813,0.00052660686],"domain_scores_gemma":[0.99568534,0.001436069,0.00018335046,0.0022687658,0.00024102246,0.00018546922],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0048553855,0.00027264032,0.00055376685,0.00014282316,0.0005054129,0.00007059259,0.0018714018,0.00021515765,0.000009860816],"category_scores_gemma":[0.00014741629,0.00027315726,0.00008734219,0.00045457957,0.00042509186,0.0004914069,0.00015571155,0.00040552026,0.000034670495],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024013064,0.003012213,0.01370925,0.000107258405,0.00036896797,0.000113969065,0.0043556495,0.017440667,0.00031516806,0.399469,0.0052221334,0.5556456],"study_design_scores_gemma":[0.01496208,0.000490667,0.16178465,0.00030559936,0.00008740965,0.00018669317,0.00017401406,0.40779787,0.00004368527,0.0029303576,0.40931368,0.0019233047],"about_ca_topic_score_codex":0.00016096985,"about_ca_topic_score_gemma":0.0005680799,"teacher_disagreement_score":0.95677894,"about_ca_system_score_codex":0.00007445591,"about_ca_system_score_gemma":0.00022447149,"threshold_uncertainty_score":0.99997205},"labels":[],"label_agreement":null},{"id":"W2157128293","doi":"10.1109/icc.2005.1495060","title":"Modeling SCTP throughput in integrated WLAN/cellular networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Stream Control Transmission Protocol; Computer network; Computer science; Handover; Throughput; Network congestion; Wireless network; Wireless; Cellular network; Heterogeneous network; Distributed computing; Network packet; Telecommunications","score_opus":0.01149772588621422,"score_gpt":0.21200291850552105,"score_spread":0.20050519261930683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157128293","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0153893875,0.0006463709,0.9779279,0.0017609212,0.00025232224,0.00012087489,1.2895318e-7,0.00032800811,0.0035740575],"genre_scores_gemma":[0.9694101,0.000032765387,0.028363854,0.0011581155,0.00025190067,0.000013347857,0.0000026486055,0.000008036161,0.0007592388],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877745,0.000060321265,0.00028823872,0.00035753535,0.00015685316,0.00035958286],"domain_scores_gemma":[0.99942756,0.000043801294,0.000027886477,0.0003708696,0.000049097438,0.0000807989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029234253,0.00014428482,0.0001723519,0.00007745547,0.00005995981,0.00012361111,0.00058619643,0.00009176233,0.000048076767],"category_scores_gemma":[0.000008719166,0.00012151498,0.000052956137,0.00045260644,0.000016776756,0.00042209984,0.000090133675,0.00024508985,0.00005344151],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000372893,0.000028526223,0.000091302965,6.042195e-7,0.00000494487,0.0000071908307,0.00007102083,0.7265723,0.000019915646,0.035000358,0.00033858643,0.23786156],"study_design_scores_gemma":[0.0004220668,0.000015586535,0.000008327368,0.000018799265,0.0000022440652,0.0000037012574,0.000020666985,0.9967576,0.00001987421,0.00024505722,0.0023299449,0.0001560959],"about_ca_topic_score_codex":0.0000696053,"about_ca_topic_score_gemma":0.00032069389,"teacher_disagreement_score":0.9540207,"about_ca_system_score_codex":0.000056271056,"about_ca_system_score_gemma":0.00004577963,"threshold_uncertainty_score":0.49552372},"labels":[],"label_agreement":null},{"id":"W2157359591","doi":"10.1109/infcom.2001.916629","title":"Aggregate flow control: improving assurances for differentiated services network","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Differentiated services; Computer network; Computer science; Network packet; Aggregate (composite); Quality of service; Flow control (data)","score_opus":0.008628771416159541,"score_gpt":0.18652036763493463,"score_spread":0.1778915962187751,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157359591","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039890725,0.0016303245,0.9889672,0.0020198997,0.001058685,0.0004149973,0.0000052967785,0.0006432114,0.0012713174],"genre_scores_gemma":[0.9734217,0.000040032854,0.02303013,0.0014950999,0.0005090388,0.00008961604,0.0000042001056,0.000012684102,0.0013974803],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856704,0.0000574289,0.0002683482,0.00041541806,0.0001826027,0.0005091378],"domain_scores_gemma":[0.9990329,0.00024144992,0.0001328523,0.00036240273,0.00011531508,0.000115051786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019381735,0.0001897936,0.0002571167,0.000034635563,0.0002490809,0.00030976054,0.00070628827,0.000074797426,0.00010054662],"category_scores_gemma":[0.0000080920045,0.00015182284,0.00012160169,0.00022703875,0.000022437627,0.00041943282,0.00005279302,0.000089290705,0.0000821129],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002271428,0.000051210638,0.00049973646,0.000031102078,0.00008327372,0.0000029134878,0.00008357186,0.015890723,0.00007503421,0.012762884,0.004737688,0.96575916],"study_design_scores_gemma":[0.0016034633,0.00007095551,0.0002843925,0.000026945068,0.00001937095,0.0000024742844,0.0000047934795,0.9896696,0.000024015295,0.0006220878,0.0074658813,0.00020597629],"about_ca_topic_score_codex":0.000010323759,"about_ca_topic_score_gemma":0.000058766014,"teacher_disagreement_score":0.9737789,"about_ca_system_score_codex":0.000012009851,"about_ca_system_score_gemma":0.000009261277,"threshold_uncertainty_score":0.6191156},"labels":[],"label_agreement":null},{"id":"W2157875362","doi":"10.1109/ecumn.2002.1002091","title":"Comparison of the use of different ECN techniques for IP multicast congestion control","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Multicast; Computer network; Computer science; Xcast; Network congestion; Explicit Congestion Notification; Slow-start","score_opus":0.053857464737658144,"score_gpt":0.29018752908744455,"score_spread":0.2363300643497864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157875362","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01940456,0.000043853823,0.9788277,0.0005814467,0.0002092218,0.0006782882,0.0000047331314,0.00008033602,0.00016987271],"genre_scores_gemma":[0.9769174,0.000003008348,0.022661371,0.00015872394,0.000015432439,0.000054920598,4.910136e-7,0.0000048513975,0.00018382819],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990378,0.00012754393,0.00034419194,0.00017306632,0.00016693394,0.00015043643],"domain_scores_gemma":[0.9986062,0.0005675052,0.00019436896,0.00039369258,0.00019892253,0.000039299437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015446778,0.000105864805,0.00027396413,0.000034170873,0.00005546738,0.00002978538,0.000333453,0.000059717622,0.0000069436387],"category_scores_gemma":[0.00013880858,0.00006455801,0.000114039474,0.000108234,0.000080302765,0.00011791089,0.000028798673,0.00006881958,6.575503e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049568993,0.00041659691,0.01442646,0.000026652591,0.000056854093,1.446279e-7,0.00015011878,0.0018044561,0.0028360926,0.70977026,0.0016330284,0.2688298],"study_design_scores_gemma":[0.0017160856,0.0003209602,0.008545164,0.00006810279,0.000059791946,0.0000025349962,0.000027112597,0.92663723,0.051595055,0.0014846516,0.009352845,0.00019046407],"about_ca_topic_score_codex":0.000006379515,"about_ca_topic_score_gemma":0.00001729133,"teacher_disagreement_score":0.9575128,"about_ca_system_score_codex":0.000013804363,"about_ca_system_score_gemma":0.000030312302,"threshold_uncertainty_score":0.26325992},"labels":[],"label_agreement":null},{"id":"W2157909282","doi":"10.1109/pacrim.1991.160771","title":"A hierarchical bandwidth management architecture for solving bandwidth congestion in the ATM/B-ISDN user-network interface","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer network; Network congestion; Computer science; Integrated Services Digital Network; Network traffic control; Asynchronous Transfer Mode; Bandwidth management; Network architecture; Distributed computing; Bandwidth (computing)","score_opus":0.013451135964117721,"score_gpt":0.22586773187951023,"score_spread":0.2124165959153925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157909282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031660884,0.00060093665,0.97344756,0.014782111,0.0004726716,0.0009893007,0.0000013279046,0.00021903889,0.0063209627],"genre_scores_gemma":[0.9488492,0.000081681756,0.04551611,0.0026050326,0.0003387008,0.00024706047,0.0000026962202,0.000015000366,0.0023445422],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980084,0.00017096101,0.00034802765,0.00054476224,0.0003191803,0.0006086884],"domain_scores_gemma":[0.99855036,0.0006518756,0.00007689146,0.00058830046,0.000040931085,0.00009164073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007465729,0.00023855029,0.00023670777,0.0000929126,0.0002310771,0.00029403754,0.0011740867,0.00009278828,0.000072525254],"category_scores_gemma":[0.00002839097,0.00016280114,0.00011911319,0.00048354513,0.00006490953,0.00019570795,0.00016746909,0.00034859698,0.0000384264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004812824,0.00012702613,0.00025870395,0.00002472239,0.00004785204,0.000023265455,0.00100136,0.042249687,0.0000049758073,0.18701051,0.033034366,0.7361694],"study_design_scores_gemma":[0.0020325724,0.00024525746,0.0018356092,0.00011970363,0.00003005055,0.000040124323,0.000077839075,0.8653688,0.000008537744,0.01087788,0.11898352,0.0003801388],"about_ca_topic_score_codex":0.0000060599655,"about_ca_topic_score_gemma":0.00012564387,"teacher_disagreement_score":0.94568306,"about_ca_system_score_codex":0.000041985015,"about_ca_system_score_gemma":0.00001165852,"threshold_uncertainty_score":0.66388375},"labels":[],"label_agreement":null},{"id":"W2158466853","doi":"10.1109/mascot.1998.693677","title":"A new scheme for TCP congestion control: smooth-start and dynamic recovery","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Zeta-TCP; TCP global synchronization; TCP Friendly Rate Control; TCP acceleration; TCP Westwood; TCP Westwood plus; Compound TCP; Computer network; Sack; H-TCP; CUBIC TCP; TCP tuning; TCP Vegas; Algorithm; Network congestion; Network packet; Engineering","score_opus":0.011780929905951231,"score_gpt":0.20651014737817,"score_spread":0.19472921747221877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158466853","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020129625,0.0009669063,0.98511577,0.0090269465,0.00038827697,0.00037467293,0.0000027405947,0.00029940275,0.001812335],"genre_scores_gemma":[0.88348484,0.00014091097,0.10015401,0.0018863933,0.0001557106,0.000055266573,0.0000025165532,0.000013936224,0.014106439],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900275,0.000030471285,0.00019685821,0.0003678445,0.00012832735,0.00027375357],"domain_scores_gemma":[0.9991781,0.0002527168,0.00006298382,0.00027547686,0.00006875696,0.00016197996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015948438,0.00014031182,0.00018501145,0.00006000068,0.000102877166,0.0001687192,0.0002499994,0.00007837567,0.0001212528],"category_scores_gemma":[0.00004219305,0.00012779514,0.000064665364,0.00012536251,0.000025763846,0.0003875002,0.000034193556,0.000080933525,0.000056411216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002790608,0.000022666363,0.00011675916,0.000005668852,0.000027617107,0.0000024044884,0.000033009546,0.00021218263,0.00012448379,0.05595311,0.019572219,0.923902],"study_design_scores_gemma":[0.0024333654,0.00018824267,0.00059566344,0.000014014686,0.000014083839,0.000012000833,0.0000055502737,0.9641199,0.0000060523366,0.0031064474,0.029311039,0.00019360452],"about_ca_topic_score_codex":0.000010959332,"about_ca_topic_score_gemma":0.000040642346,"teacher_disagreement_score":0.9639078,"about_ca_system_score_codex":0.000025359996,"about_ca_system_score_gemma":0.000030066909,"threshold_uncertainty_score":0.5211334},"labels":[],"label_agreement":null},{"id":"W2158467743","doi":"10.1109/infcom.2005.1498478","title":"A QoS-aware AIMD protocol for time-sensitive applications in wired/wireless networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Tennessee Department of Education","keywords":"Computer network; Computer science; Quality of service; Transport layer; Wireless network; Throughput; Internet layer; Resource Reservation Protocol; Distributed computing; Application layer; Protocol (science); Wireless; Internet protocol suite; The Internet; Layer (electronics); Telecommunications","score_opus":0.01029093051302042,"score_gpt":0.26384113655495367,"score_spread":0.25355020604193323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158467743","genre_codex":"methods","genre_gemma":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000053277057,0.0000032096098,0.9159165,0.0016555971,0.000031448977,0.07983325,0.0000016945195,0.00025929438,0.002245747],"genre_scores_gemma":[0.22645834,9.0948816e-7,0.028359152,0.0016112905,0.0009111618,0.73859096,0.0000105295085,0.000023366605,0.0040343273],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882436,0.000043417127,0.00026479983,0.00040482744,0.00012597286,0.00033660047],"domain_scores_gemma":[0.9991276,0.00022749508,0.00007366388,0.00036807518,0.000108490036,0.00009465495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019865744,0.00015026199,0.0001829128,0.00006639261,0.00011551352,0.000092590104,0.00043843433,0.00008922924,0.000026584034],"category_scores_gemma":[0.0000045546485,0.00013150348,0.00006974784,0.0003615197,0.00003193218,0.00025094056,0.000072930525,0.0001002596,0.00006286779],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039987164,0.00019885413,0.000087747154,0.000009234844,0.000014706266,0.000001910133,0.00013159271,0.02869403,0.000019602972,0.059675217,0.015520884,0.8956062],"study_design_scores_gemma":[0.0010737337,0.00004009278,0.00013821106,0.000018854413,0.0000025930779,0.0000027160618,0.000015419275,0.9320348,0.000064801825,0.00015152378,0.066293105,0.00016417098],"about_ca_topic_score_codex":0.000005029574,"about_ca_topic_score_gemma":0.00009651568,"teacher_disagreement_score":0.90334076,"about_ca_system_score_codex":0.000054829048,"about_ca_system_score_gemma":0.00006347695,"threshold_uncertainty_score":0.5362556},"labels":[],"label_agreement":null},{"id":"W2158742238","doi":"10.1007/978-3-540-72990-7_12","title":"Adaptive Congestion Control Under Dynamic Weather Condition for Wireless and Satellite Networks","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Eion (Canada)","funders":"","keywords":"Network congestion; Computer science; Computer network; Quality of service; Random early detection; Communications satellite; Satellite; Real-time computing; Active queue management; Engineering; Network packet","score_opus":0.012652753148347748,"score_gpt":0.24077163891073664,"score_spread":0.2281188857623889,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158742238","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007340729,0.002045644,0.99387723,0.00075175206,0.0015586338,0.0010748532,0.000011779063,0.0001951402,0.0004115718],"genre_scores_gemma":[0.9401205,0.00021847896,0.05634455,0.0024148377,0.00054138136,0.000042348787,0.000016998512,0.000047903588,0.00025295446],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99669546,0.00005059766,0.00052664505,0.0014455138,0.00054068025,0.0007411142],"domain_scores_gemma":[0.9970436,0.0013605679,0.0003522591,0.0006583668,0.00037190257,0.00021326456],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010930023,0.0005666195,0.00061314146,0.00048559997,0.00030859563,0.00041498378,0.0010596699,0.00052672543,0.0000076024817],"category_scores_gemma":[0.000021572785,0.0005351748,0.00013139717,0.0003064869,0.00080727955,0.00047274976,0.00021133383,0.00065963395,0.000008474052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043417273,0.000013456267,0.000009715806,0.00001030047,0.000025121242,0.000014633678,0.00007211038,0.124367215,0.000010625819,0.09277844,0.0000050969124,0.7826499],"study_design_scores_gemma":[0.0011037259,0.00027514886,0.00025931935,0.00026444768,0.000031140895,0.000047953672,3.3328226e-7,0.9278884,0.000007756817,0.06898035,0.0005836615,0.00055777706],"about_ca_topic_score_codex":0.0000067257934,"about_ca_topic_score_gemma":0.00016247094,"teacher_disagreement_score":0.94004714,"about_ca_system_score_codex":0.00027896962,"about_ca_system_score_gemma":0.00024291637,"threshold_uncertainty_score":0.99970996},"labels":[],"label_agreement":null},{"id":"W2158911093","doi":"10.1109/glocom.1997.638492","title":"Cell discarding policies supporting multiple delay and loss requirements in ATM networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Indian Institute of Science","keywords":"FIFO and LIFO accounting; Quality of service; Computer science; Computer network; Asynchronous Transfer Mode; Scheduling (production processes); Network calculus; Distributed computing; FIFO (computing and electronics); Mathematical optimization; Mathematics","score_opus":0.017734510126359584,"score_gpt":0.23121821247971994,"score_spread":0.21348370235336034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158911093","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34524485,0.00088893546,0.6427807,0.0012505568,0.00031450935,0.00022125196,4.946811e-7,0.00021486613,0.009083782],"genre_scores_gemma":[0.995432,0.000081972605,0.0030133168,0.00040723674,0.00009389638,0.000010976261,5.947449e-7,0.0000069172147,0.0009530702],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988214,0.000048758477,0.00027224512,0.00030024393,0.00014181565,0.00041553346],"domain_scores_gemma":[0.99945843,0.00012665811,0.000073827745,0.00022655158,0.000019327295,0.00009518575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025018273,0.00012291534,0.00015515991,0.000059669426,0.00010810985,0.00014680381,0.00027938612,0.000050418876,0.000027752081],"category_scores_gemma":[0.000016089027,0.00010844015,0.000037411868,0.00024025816,0.00003393421,0.00038081434,0.00016871316,0.00011236216,0.000014547047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008406702,0.00014384616,0.48313755,0.000016138069,0.000026593996,0.00011581875,0.0019375943,0.039380934,0.00007043684,0.01281279,0.0051375125,0.45721236],"study_design_scores_gemma":[0.0006143262,0.000022172613,0.004906154,0.0000148096415,0.0000031838674,0.000010232587,0.00005498946,0.9933657,0.000017911854,0.000070625014,0.00077478745,0.00014507708],"about_ca_topic_score_codex":0.00006521785,"about_ca_topic_score_gemma":0.0000702335,"teacher_disagreement_score":0.9539848,"about_ca_system_score_codex":0.000023989212,"about_ca_system_score_gemma":0.0000049667833,"threshold_uncertainty_score":0.4422061},"labels":[],"label_agreement":null},{"id":"W2158968228","doi":"10.1109/ngi.2005.1431673","title":"A square root formula for the rate of non-persistent TCP flows","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Square root; Infinity; Queue; Idle; Mean value; Root mean square; Computer science; Statistics; Mathematical analysis; Physics; Geometry; Computer network","score_opus":0.011769116233648857,"score_gpt":0.22979772368155973,"score_spread":0.2180286074479109,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158968228","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006999668,0.0002342933,0.9811471,0.009031198,0.00021916268,0.00038597485,0.000001553344,0.000064710395,0.0019163092],"genre_scores_gemma":[0.98289424,0.0000062977,0.01381063,0.00086901156,0.000159338,0.000064337204,6.490112e-7,0.000004358496,0.0021911317],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993568,0.000017255961,0.00017585159,0.00016724948,0.000096465505,0.00018638877],"domain_scores_gemma":[0.9992097,0.00024165417,0.0000528189,0.0003526559,0.00009722298,0.0000459533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026934638,0.000081815284,0.00011117762,0.000023755241,0.00010167174,0.000046590078,0.00053842034,0.000029061144,0.000035808964],"category_scores_gemma":[0.0000118285425,0.000049225837,0.00017100445,0.0001189366,0.00001663809,0.00014952826,0.000053146832,0.000045469653,0.000024945253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023594615,0.00004719104,0.00002996719,0.000007908018,0.000049873008,3.5235297e-7,0.00029363148,0.037233464,0.00010736019,0.039294563,0.01089347,0.9120186],"study_design_scores_gemma":[0.0006006477,0.00008774192,0.00017345035,0.000007468728,0.000014102383,0.0000019003489,0.000033535027,0.9459148,0.00022515735,0.00010932972,0.052762166,0.00006971928],"about_ca_topic_score_codex":0.0000069101593,"about_ca_topic_score_gemma":0.00012306184,"teacher_disagreement_score":0.9758946,"about_ca_system_score_codex":0.000014152196,"about_ca_system_score_gemma":0.000039646682,"threshold_uncertainty_score":0.20073715},"labels":[],"label_agreement":null},{"id":"W2158977885","doi":"10.1109/pacrim.1997.620318","title":"A distributed protocol to schedule and monitor ATM real-time traffic","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Computer network; Protocol (science); Schedule; Real-time computing; Operating system","score_opus":0.011497660832771527,"score_gpt":0.23262099307063994,"score_spread":0.2211233322378684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158977885","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11284878,0.00005193078,0.7228778,0.021854663,0.00039800265,0.12098415,0.000020211226,0.0038784547,0.017085996],"genre_scores_gemma":[0.8796854,0.000004613359,0.054206144,0.000676883,0.00031660436,0.056022044,0.0000027537142,0.000021557295,0.009063985],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897575,0.000043641303,0.0001736969,0.00035721264,0.0001694387,0.0002802279],"domain_scores_gemma":[0.9992783,0.00005995194,0.000033582448,0.00033720917,0.00005604858,0.00023492139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010579527,0.00013207288,0.00014710733,0.000042649575,0.000107762135,0.00018017844,0.00035191138,0.000051971867,0.00020593972],"category_scores_gemma":[0.00001630282,0.000110026755,0.00003349525,0.0003260679,0.000024781037,0.00020281557,0.00009476145,0.000070311435,0.0005470205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022150134,0.00019675566,0.000088309425,0.000011260403,0.000022761882,0.00002175561,0.00019719385,0.001880961,0.00040365735,0.00922898,0.04455739,0.94336885],"study_design_scores_gemma":[0.0009622176,0.00020604343,0.0005210668,0.000017098057,0.0000043435975,0.000014262754,0.000007875489,0.969501,0.00010903843,0.00003867564,0.028394142,0.00022423829],"about_ca_topic_score_codex":0.0000038677304,"about_ca_topic_score_gemma":0.0000028901802,"teacher_disagreement_score":0.96762,"about_ca_system_score_codex":0.00002098326,"about_ca_system_score_gemma":0.000012306401,"threshold_uncertainty_score":0.7031024},"labels":[],"label_agreement":null},{"id":"W2159049494","doi":"10.4304/jcm.1.2.48-56","title":"Round-trip Time Variation in SmoothTCP in the Face of Spurious Errors","year":2006,"lang":"en","type":"article","venue":"Journal of Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Spurious relationship; Variation (astronomy); Computer science; Face (sociological concept); Statistics; Geodesy; Mathematics; Geology; Machine learning; Physics","score_opus":0.013109954193308288,"score_gpt":0.24643153402519163,"score_spread":0.23332157983188334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159049494","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32894817,0.0063781533,0.5589679,0.090285614,0.00035713342,0.0006039407,0.0000037914938,0.00004525118,0.01441009],"genre_scores_gemma":[0.9919743,0.00009466645,0.0076696174,0.00013829707,0.000030757557,0.0000039521983,8.215959e-7,0.0000025662398,0.00008503068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987206,0.00037955714,0.00053781917,0.00005404396,0.00021268438,0.000095327516],"domain_scores_gemma":[0.99821967,0.00050405413,0.00040788692,0.00073064264,0.000121299796,0.000016430287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010773474,0.000055977598,0.000148116,0.0001734002,0.000055317116,0.00004629694,0.0019047097,0.000037725342,0.000004658302],"category_scores_gemma":[0.00004929724,0.00004288657,0.000059391466,0.000571102,0.000043875556,0.0002859673,0.00007849703,0.0002715843,0.0000062855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008667328,0.0034352702,0.01237742,0.000017676552,0.00009434998,0.00003571417,0.017904997,0.17634411,0.002322956,0.5768834,0.008825846,0.20167157],"study_design_scores_gemma":[0.0027402008,0.0002226291,0.345706,0.00017100236,0.000041384148,0.00013451578,0.00041285777,0.5963804,0.000034406105,0.031751685,0.022154573,0.00025034897],"about_ca_topic_score_codex":0.00009592876,"about_ca_topic_score_gemma":0.0002618154,"teacher_disagreement_score":0.66302615,"about_ca_system_score_codex":0.000046111392,"about_ca_system_score_gemma":0.00010838553,"threshold_uncertainty_score":0.35394564},"labels":[],"label_agreement":null},{"id":"W2159324217","doi":"10.1109/ccece.2006.277636","title":"A Minimum-Cost Resilient Tree-Based VPLS for Digital TV Broadcast Services","year":2006,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; IPTV; Internet Group Management Protocol; Steiner tree problem; Multicast; Distributed computing; Multicast address; Source-specific multicast","score_opus":0.006992233838524745,"score_gpt":0.21027883201210906,"score_spread":0.20328659817358433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159324217","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01774604,0.00017082084,0.96365064,0.0025228327,0.00031279176,0.00059373,0.00001904673,0.00043695435,0.014547151],"genre_scores_gemma":[0.9847085,7.777657e-7,0.009174154,0.0009566458,0.00024652976,0.000104246035,0.000026758888,0.000010335005,0.0047720782],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876744,0.00001662402,0.00024786653,0.00040505474,0.00021392267,0.00034906936],"domain_scores_gemma":[0.99913764,0.00019973423,0.00007209334,0.00039561617,0.00010254247,0.000092374576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000101815625,0.00015811896,0.00015680265,0.00006665838,0.00011449043,0.00046885913,0.0005931881,0.00005667514,0.000023071518],"category_scores_gemma":[0.000004954568,0.00013304582,0.00011568879,0.00021694343,0.000028733246,0.00039192176,0.000050592935,0.00004944317,0.00008270243],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007539607,0.00024455346,0.0008548622,0.000028386563,0.000015270614,0.000009681507,0.000047499176,0.0051728166,0.000107226195,0.038302187,0.018906707,0.9362354],"study_design_scores_gemma":[0.0018368353,0.00013931273,0.00087594567,0.000026211883,0.000009045505,0.0000033044887,0.000021687014,0.87042886,0.0003261016,0.00092607195,0.12514532,0.00026129818],"about_ca_topic_score_codex":0.00004007305,"about_ca_topic_score_gemma":0.00013892382,"teacher_disagreement_score":0.96696246,"about_ca_system_score_codex":0.000024894081,"about_ca_system_score_gemma":0.00006573302,"threshold_uncertainty_score":0.5425451},"labels":[],"label_agreement":null},{"id":"W2159329951","doi":"10.1002/dac.678","title":"Effects of control loop delay on the stability of a rate control algorithm","year":2004,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Stability (learning theory); Control theory (sociology); Loop (graph theory); Computer science; Upper and lower bounds; Control (management); Control system; Domain (mathematical analysis); Process (computing); Mathematics; Mathematical analysis; Engineering","score_opus":0.0106927413827747,"score_gpt":0.24106763613643384,"score_spread":0.23037489475365913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159329951","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060807075,0.002559818,0.9294461,0.0055901012,0.00094275206,0.0004090617,0.000010903988,0.000016857859,0.00021732398],"genre_scores_gemma":[0.99838597,0.00015033668,0.0010222344,0.00030767499,0.000099920064,0.0000188183,7.260811e-7,0.00000581989,0.000008532215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972835,0.0008874084,0.00094348204,0.00010379147,0.00067424163,0.00010756399],"domain_scores_gemma":[0.99367195,0.00261213,0.0014728948,0.0005876733,0.0015977552,0.000057606114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021560849,0.00011513474,0.00035184127,0.0001279423,0.00005485589,0.0000750242,0.0023622988,0.00005415092,0.0000044712333],"category_scores_gemma":[0.00025819842,0.00007811327,0.00018188056,0.00013855737,0.00011947878,0.00026956294,0.00006570794,0.00024940984,0.0000056024023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084099313,0.0015461175,0.0008744344,0.000043662658,0.0022395707,0.000042015017,0.0023652408,0.17090021,0.0073772203,0.6863623,0.000382336,0.12702587],"study_design_scores_gemma":[0.042477373,0.002236743,0.009696526,0.0034355824,0.00033255553,0.00040680662,0.0008180842,0.89984185,0.020379813,0.013028976,0.006617766,0.0007279183],"about_ca_topic_score_codex":0.000040135263,"about_ca_topic_score_gemma":0.0000032748771,"teacher_disagreement_score":0.93757886,"about_ca_system_score_codex":0.00011672009,"about_ca_system_score_gemma":0.00019423955,"threshold_uncertainty_score":0.4389778},"labels":[],"label_agreement":null},{"id":"W2159708013","doi":"10.1109/cnsr.2006.37","title":"MPLS-based Multicast Shared Trees","year":2006,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Multicast; Protocol Independent Multicast; Xcast; Computer science; Source-specific multicast; Pragmatic General Multicast; Computer network; Distance Vector Multicast Routing Protocol; IP multicast; Inter-domain; Distributed computing; Multicast address; Multiprotocol Label Switching; Quality of service","score_opus":0.008296714476236998,"score_gpt":0.2063732921557507,"score_spread":0.1980765776795137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159708013","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003075492,0.00006716698,0.97483075,0.0031772186,0.00017381797,0.000088869856,0.0000011928132,0.0005059826,0.018079508],"genre_scores_gemma":[0.9597874,3.377656e-7,0.03679617,0.0006600449,0.00012136107,0.0000128678785,0.0000031436098,0.0000041604508,0.0026145105],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992788,0.00002450521,0.00013012408,0.00022573443,0.00014385268,0.00019698191],"domain_scores_gemma":[0.99949044,0.00009108307,0.000026791839,0.00029607865,0.00004453237,0.000051081028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007027917,0.00008496624,0.00008638579,0.000040531,0.000066826935,0.00013420338,0.00038741177,0.00003213661,0.0001480463],"category_scores_gemma":[0.0000062097315,0.00007005979,0.00005080066,0.00016970879,0.000021763746,0.000157671,0.00003160195,0.000047328234,0.00021688282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012817834,0.00021681881,0.0015233327,0.0000035037956,0.0000107683145,0.00003446107,0.00002726738,0.028772207,0.00040167492,0.35035494,0.047436275,0.5712059],"study_design_scores_gemma":[0.0005988731,0.000025301113,0.0048377067,0.0000045887637,0.000002667766,0.0000019116671,0.00000203321,0.9780453,0.00016819604,0.000488135,0.015709575,0.00011572772],"about_ca_topic_score_codex":0.0000595932,"about_ca_topic_score_gemma":0.00010554244,"teacher_disagreement_score":0.9567119,"about_ca_system_score_codex":0.000012385883,"about_ca_system_score_gemma":0.000033864002,"threshold_uncertainty_score":0.28569552},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.021668590843779242,"score_gpt":0.2531395800328795,"score_spread":0.23147098918910025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159743267","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002290294,0.00010496603,0.99164367,0.0009727375,0.003962386,0.0004507182,0.000008984761,0.00046252672,0.00010369271],"genre_scores_gemma":[0.97691065,0.000024877372,0.021458298,0.00048406897,0.00081285974,0.00010022864,0.0000155286,0.000022367267,0.00017109256],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830246,0.000065017266,0.0003999658,0.0004704398,0.00020411785,0.00055797957],"domain_scores_gemma":[0.9979225,0.0010504697,0.000114911185,0.0006156269,0.00014021233,0.0001563042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007974697,0.00022039193,0.00020465712,0.00014133772,0.00046131384,0.00014356588,0.0006579819,0.00012507124,0.0000095889545],"category_scores_gemma":[0.000021043703,0.0002252445,0.00014946105,0.0006808635,0.000029988527,0.00026284537,0.000005574946,0.0002525399,0.000031954565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007820316,0.00007547703,0.000009020078,0.0000067857286,0.000043556367,0.0000045981715,0.00006956494,0.2723538,0.00019237648,0.0014911238,0.00031276292,0.7253627],"study_design_scores_gemma":[0.0011004125,0.00019056458,0.00018790753,0.00007599926,0.000049342576,0.000011311382,0.000017123732,0.97025126,0.00050418277,0.0017943264,0.025489345,0.00032825145],"about_ca_topic_score_codex":0.0000051176385,"about_ca_topic_score_gemma":0.00011237021,"teacher_disagreement_score":0.9746204,"about_ca_system_score_codex":0.000102216225,"about_ca_system_score_gemma":0.00006502528,"threshold_uncertainty_score":0.9185204},"labels":[],"label_agreement":null},{"id":"W2160192036","doi":"10.1109/jsac.2008.080512","title":"A novel Hα control strategy for design of a robust dynamic routing algorithm in traffic networks","year":2008,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Robustness (evolution); Scalability; Queueing theory; Routing (electronic design automation); Mathematical optimization; Robust control; Distributed computing; Algorithm; Computer network; Control system; Mathematics; Engineering","score_opus":0.05476329905381612,"score_gpt":0.27783920908673765,"score_spread":0.22307591003292154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160192036","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007383276,0.0006820127,0.9902995,0.0007946172,0.00016549409,0.00056557613,0.0000069894554,0.00006651426,0.000036004312],"genre_scores_gemma":[0.86598825,0.0005409085,0.13315573,0.00012940471,0.000056797664,0.000089063404,0.0000047965414,0.00001663716,0.000018413697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977244,0.00050395215,0.0008468965,0.0002471196,0.00023217428,0.00044542388],"domain_scores_gemma":[0.99619055,0.001983266,0.0004403953,0.00081535924,0.00045745814,0.000112963244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009554362,0.0002020877,0.00040738154,0.00037225513,0.00050188985,0.00006411576,0.0018261219,0.00013888377,0.000002095001],"category_scores_gemma":[0.00013857697,0.00020103618,0.00010205881,0.0013463093,0.00010416246,0.0002835599,0.000056174766,0.0009231047,0.0000010624424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005244552,0.00046480753,0.00005116566,0.0000014731395,0.00003549,0.000008810885,0.0002902711,0.8742643,0.0000856747,0.0007578021,0.00006899868,0.12391875],"study_design_scores_gemma":[0.0033279245,0.00023439057,0.0019458028,0.00015037476,0.000013775087,0.00033437705,0.000033602548,0.9936235,0.000003921709,0.000107879474,0.000039244835,0.00018522756],"about_ca_topic_score_codex":0.000013291239,"about_ca_topic_score_gemma":0.0001718738,"teacher_disagreement_score":0.85860497,"about_ca_system_score_codex":0.00020430608,"about_ca_system_score_gemma":0.00052699255,"threshold_uncertainty_score":0.81980175},"labels":[],"label_agreement":null},{"id":"W2161120220","doi":"10.1109/glocom.1988.26008","title":"Performance analysis of the medium access control protocol of the FDDI token ring network","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Fiber Distributed Data Interface; Token ring; Computer science; Network packet; Computer network; Bounded function; Protocol (science); Clipping (morphology); Security token; Token bus network; Access control; Local area network; Mathematics","score_opus":0.011600002434099697,"score_gpt":0.24566724602891066,"score_spread":0.23406724359481096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161120220","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.110143386,0.00009257103,0.72267175,0.0049005924,0.0019982709,0.09641479,0.0000070518317,0.00025923885,0.06351237],"genre_scores_gemma":[0.99369144,0.0000013020997,0.00046869463,0.0004379838,0.000049879964,0.0049594683,8.736113e-8,0.0000038082903,0.00038731028],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998609,0.00020629706,0.000368398,0.00020155174,0.00037397927,0.0002407704],"domain_scores_gemma":[0.9985462,0.00016621214,0.00029169617,0.0008142483,0.00014171477,0.00003991734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005941773,0.00011188186,0.00027261768,0.000045583372,0.00014912781,0.000050029077,0.0017846723,0.000044539447,0.00007418151],"category_scores_gemma":[0.000037577905,0.000055910117,0.00021880644,0.0018088788,0.0000889147,0.00022489787,0.0001818837,0.00012077085,0.0000017471499],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033777833,0.0000809569,0.32693017,0.00003154539,0.0006550714,2.4643077e-7,0.00016043264,0.5849912,0.000083819476,0.050005343,0.0015320986,0.035495322],"study_design_scores_gemma":[0.00083513965,0.000026085314,0.12298307,0.000032866767,0.00017248004,7.8664334e-7,0.0000064533706,0.87087685,0.0009206849,0.00009464292,0.003949472,0.00010144434],"about_ca_topic_score_codex":0.000012791107,"about_ca_topic_score_gemma":0.000046964735,"teacher_disagreement_score":0.8835481,"about_ca_system_score_codex":0.000014708442,"about_ca_system_score_gemma":0.0001226662,"threshold_uncertainty_score":0.33163947},"labels":[],"label_agreement":null},{"id":"W2161150670","doi":"10.1109/icccn.1997.623319","title":"Efficient admission control for EDF scheduler with statistical QoS guarantee","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Quality of service; Computer science; Admission control; Gaussian; Bandwidth (computing); Computer network; Scheduling (production processes); Mathematical optimization; Mathematics","score_opus":0.01169454036782195,"score_gpt":0.21813089477796807,"score_spread":0.20643635441014613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161150670","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002045104,0.00014657156,0.99138665,0.003477202,0.00028292902,0.0004895031,0.000006326296,0.00023104735,0.0019346548],"genre_scores_gemma":[0.9146402,0.0000030219392,0.08220852,0.0012882019,0.00016849657,0.000081160135,0.000001242205,0.00000975062,0.0015994059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874276,0.000042589116,0.00019563844,0.00038679584,0.00026934393,0.00036288376],"domain_scores_gemma":[0.99900645,0.00034285567,0.000049571663,0.00033080133,0.00012377439,0.00014657527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016443903,0.00015110074,0.00019019756,0.000045433273,0.00014504227,0.00010634789,0.0003520338,0.00005295907,0.00034454366],"category_scores_gemma":[0.00004219794,0.00010101736,0.000047775546,0.00014351468,0.000047294696,0.000066168024,0.000026183498,0.000094532494,0.00014816242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001250206,0.00026902,0.000058290098,0.000010042258,0.00004408423,0.000019237947,0.00008697891,0.022680193,0.000051174327,0.55564034,0.02278966,0.398226],"study_design_scores_gemma":[0.0028550792,0.00030968682,0.00009814701,0.000016619053,0.000016774165,0.000015014227,0.000008383554,0.9848763,0.00002562172,0.00025899278,0.011347866,0.00017155403],"about_ca_topic_score_codex":0.0000017825826,"about_ca_topic_score_gemma":0.0000026458292,"teacher_disagreement_score":0.96219605,"about_ca_system_score_codex":0.000019788617,"about_ca_system_score_gemma":0.000035535275,"threshold_uncertainty_score":0.41193682},"labels":[],"label_agreement":null},{"id":"W2161403702","doi":"10.1145/1577222.1577235","title":"Analysis of traffic data from a hybrid satellite-terrestrial network","year":2007,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer network; Computer science; Broadband; Upload; The Internet; Port (circuit theory); Traffic analysis; Communications satellite; Satellite; Telecommunications; World Wide Web; Engineering","score_opus":0.0331065577311697,"score_gpt":0.26778809743797516,"score_spread":0.23468153970680544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161403702","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13688236,0.0007037794,0.8600386,0.0002157081,0.00067356706,0.0001036726,0.00002340945,0.00018114765,0.0011778068],"genre_scores_gemma":[0.9805355,0.00004846574,0.018319096,0.0002441874,0.0005449043,0.0000011632222,0.00018104586,0.0000051276556,0.00012048272],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982939,0.00006666325,0.0004673724,0.0005281986,0.00030583874,0.0003380472],"domain_scores_gemma":[0.9975339,0.0006293957,0.00014718331,0.0015289584,0.000035697678,0.00012485163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000853186,0.00013070529,0.0003598327,0.00014664672,0.000052780855,0.00007756287,0.0018541927,0.000048075464,0.00013513416],"category_scores_gemma":[0.000026808606,0.00011411548,0.00013308023,0.0012845789,0.000042525895,0.0002841799,0.00028721915,0.00009924862,0.000041546315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006922064,0.00007118681,0.0013497116,7.005266e-7,0.00083514885,0.000019881829,0.00004939502,0.052022442,0.000014294954,0.0026317914,0.0044123526,0.9385239],"study_design_scores_gemma":[0.00046815284,0.000027172866,0.0045769913,0.000005464512,0.00031066115,6.944766e-7,0.000008407995,0.9805938,0.000017622297,0.00008029189,0.013767917,0.00014284677],"about_ca_topic_score_codex":0.00006630827,"about_ca_topic_score_gemma":0.00048753936,"teacher_disagreement_score":0.938381,"about_ca_system_score_codex":0.000011808742,"about_ca_system_score_gemma":0.000052225983,"threshold_uncertainty_score":0.4653494},"labels":[],"label_agreement":null},{"id":"W2161641124","doi":"10.1109/icc.2007.58","title":"DiffServ Model with Backpressure for CDMA2000","year":2007,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer network; Computer science; Differentiated services; Network packet; Quality of service; Differentiated service; CDMA2000; Network traffic control; Distributed computing; Service (business)","score_opus":0.008712995863480174,"score_gpt":0.21706258081690205,"score_spread":0.20834958495342187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161641124","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016151132,0.000058893605,0.982803,0.0010144156,0.00007478365,0.00018267591,7.1368675e-7,0.00020773087,0.014042684],"genre_scores_gemma":[0.8187375,0.0000019389424,0.16935886,0.0010323498,0.00008204353,0.000016632846,8.492315e-7,0.000005835129,0.010764009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930966,0.000004911997,0.000102683334,0.00022054547,0.00012168409,0.00024051552],"domain_scores_gemma":[0.9994569,0.00008660793,0.000026398782,0.00027153298,0.000074393305,0.000084157895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019932246,0.000081501596,0.00008566299,0.00002573382,0.00007364564,0.000051909126,0.00034907236,0.000038014874,0.000009395818],"category_scores_gemma":[0.0000028467527,0.000056915786,0.00003278421,0.00010754718,0.000015623065,0.0001737142,0.000028117256,0.000046686033,0.000013812239],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004908601,0.00003714008,0.000052556265,0.0000039476745,0.000015743806,0.0000029961695,0.00008669756,0.047251895,0.000015892458,0.5102568,0.005107497,0.43711972],"study_design_scores_gemma":[0.0005800187,0.000060160055,0.00006901375,0.0000046147966,0.0000055766936,0.0000036273782,0.000007585059,0.98518175,0.000080583384,0.0026021008,0.011300599,0.00010438237],"about_ca_topic_score_codex":0.000003820699,"about_ca_topic_score_gemma":0.00005827756,"teacher_disagreement_score":0.93792987,"about_ca_system_score_codex":0.000008147381,"about_ca_system_score_gemma":0.000039402188,"threshold_uncertainty_score":0.23209584},"labels":[],"label_agreement":null},{"id":"W2161717634","doi":"10.1109/ccece.2005.1557242","title":"Mobile-IPv6 MPLS OAM requirements","year":2006,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Multiprotocol Label Switching; Computer network; Computer science; Quality of service; Mobile IP; Mobility management; Network packet","score_opus":0.009948008998559518,"score_gpt":0.22963806945351606,"score_spread":0.21969006045495654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161717634","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062284446,0.00023542279,0.8832318,0.00045312283,0.00048450287,0.00017913796,4.0205398e-7,0.00048282684,0.10870432],"genre_scores_gemma":[0.9716077,0.0000063168454,0.011855136,0.00067125406,0.00020443668,0.000038334038,0.0000015816391,0.0000046141995,0.015610615],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99912244,0.00002552012,0.0001689973,0.0002514341,0.00019740274,0.00023420328],"domain_scores_gemma":[0.9994814,0.00002813983,0.000037984304,0.00035496635,0.000045621662,0.0000519138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012343463,0.000088934794,0.0000906509,0.00003590603,0.00007542608,0.0001083177,0.00047159856,0.00003370006,0.00011152028],"category_scores_gemma":[0.0000026300872,0.00007536569,0.000044438053,0.00018125512,0.000019526664,0.0002640297,0.00007758944,0.00005100057,0.00040537547],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029179903,0.00008544462,0.0007229014,0.0000020838932,0.000009651731,0.00001301215,0.000027370124,0.0012253736,0.00021320723,0.39186123,0.053468436,0.55236834],"study_design_scores_gemma":[0.0020049543,0.00032604704,0.0035274026,0.000024346813,0.000015494372,0.000025954607,0.000021958076,0.44780162,0.0010528855,0.022686407,0.5218393,0.00067361206],"about_ca_topic_score_codex":0.0000311525,"about_ca_topic_score_gemma":0.0000135610535,"teacher_disagreement_score":0.96537924,"about_ca_system_score_codex":0.000019299936,"about_ca_system_score_gemma":0.000027468112,"threshold_uncertainty_score":0.5210417},"labels":[],"label_agreement":null},{"id":"W2161870652","doi":"10.1109/pccc.2003.1203712","title":"On the advantages of lifetime and RTT classification schemes for TCP flows","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Task (project management); Queue; Conjunction (astronomy); Computer network; Engineering","score_opus":0.01623705187279803,"score_gpt":0.238412517179912,"score_spread":0.22217546530711396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161870652","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023305055,0.00017995716,0.9665106,0.004222173,0.000111206755,0.00024951508,8.465748e-7,0.000053229458,0.005367431],"genre_scores_gemma":[0.9788418,0.000022316048,0.01968774,0.0005114058,0.000017568116,0.000031122658,3.5537207e-7,0.0000026219775,0.0008850698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995579,0.000036700283,0.00010151649,0.00013997822,0.00007947874,0.00008438707],"domain_scores_gemma":[0.9992518,0.00042286428,0.00004190747,0.00021116747,0.000046633842,0.000025656647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002180683,0.000052954427,0.000067197194,0.00001940222,0.00006268272,0.000029842207,0.0001632505,0.000023246348,0.000022451746],"category_scores_gemma":[0.00007636558,0.00003234822,0.000025036057,0.000073817224,0.000024797899,0.00007355599,0.000011543451,0.00003266883,0.000006714759],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039904157,0.000014813584,0.000047596695,0.0000021169599,0.0000053671265,4.890811e-8,0.000029572406,0.000021579459,0.00021425943,0.8731578,0.0017658387,0.124736995],"study_design_scores_gemma":[0.0008678547,0.00021511568,0.0010183098,0.000022474707,0.000012758947,0.0000034323366,0.000085239204,0.8359914,0.0032901075,0.018504728,0.13981242,0.00017619526],"about_ca_topic_score_codex":4.3303447e-7,"about_ca_topic_score_gemma":0.0000014815009,"teacher_disagreement_score":0.9555367,"about_ca_system_score_codex":0.0000034449847,"about_ca_system_score_gemma":0.00002062186,"threshold_uncertainty_score":0.13191222},"labels":[],"label_agreement":null},{"id":"W2162165723","doi":"10.1109/wcnc.2002.993351","title":"Fair and efficient resource management scheme to support transient data recovery for migrating users in wireless multicast networks","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multicast; Computer network; Computer science; Source-specific multicast; Pragmatic General Multicast; Handover; Xcast; IP multicast; Reliable multicast; Distributed computing; Protocol Independent Multicast; Wireless network; Wireless; Telecommunications","score_opus":0.02242848661506958,"score_gpt":0.2482856778658119,"score_spread":0.22585719125074233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162165723","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042659838,0.000052001884,0.9540108,0.000748528,0.00017700372,0.0007995325,0.0000043068776,0.00008875034,0.0014592463],"genre_scores_gemma":[0.88952017,0.000011820064,0.10889378,0.0010401073,0.000029842487,0.00007669352,0.000011816775,0.000011633546,0.00040415855],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998277,0.00006580888,0.00031880403,0.00071423437,0.00018320528,0.00044091025],"domain_scores_gemma":[0.998882,0.00018110778,0.000045110897,0.00070572423,0.000026469754,0.00015961472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082214945,0.0001626195,0.00018850116,0.000102466176,0.00010323528,0.00015220365,0.0006304746,0.000051243027,0.000006915156],"category_scores_gemma":[0.000021297496,0.00015232651,0.000033784796,0.00035055156,0.000023135468,0.00015364938,0.00019001521,0.00009692418,0.0000042606844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007726327,0.00019425884,0.00053108716,0.000044453016,0.00004749475,0.000031731368,0.00046845802,0.18205677,0.000028803535,0.052859686,0.008472073,0.7551879],"study_design_scores_gemma":[0.0010591976,0.000104648585,0.00034797183,0.000042329724,0.0000090817175,0.0000053127915,0.0002582578,0.9743311,0.000015198876,0.000011615157,0.023608431,0.00020689171],"about_ca_topic_score_codex":0.000007475992,"about_ca_topic_score_gemma":0.00010322992,"teacher_disagreement_score":0.8468603,"about_ca_system_score_codex":0.000035111392,"about_ca_system_score_gemma":0.000022007769,"threshold_uncertainty_score":0.62116945},"labels":[],"label_agreement":null},{"id":"W2162255206","doi":"10.1109/tridnt.2006.1649196","title":"Delivering reliable real-time multicast services over virtual private LAN service","year":2006,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Multicast; Computer network; Computer science; Testbed; IP multicast; Pragmatic General Multicast; Xcast; Multiprotocol Label Switching; Source-specific multicast; Protocol Independent Multicast; Service provider; Quality of service; Reliable multicast; Inter-domain; Service (business); Business","score_opus":0.004122145416717592,"score_gpt":0.19150684007856594,"score_spread":0.18738469466184834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162255206","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85449547,0.00006390049,0.11487447,0.0011069695,0.0003052517,0.00022996617,0.0000026317512,0.0012614494,0.027659902],"genre_scores_gemma":[0.97244334,0.000019492478,0.022616934,0.0013286148,0.0002664271,0.000013513387,0.0000071518602,0.000017097887,0.0032874022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986792,0.000030948897,0.00025390758,0.0004057556,0.00025534717,0.00037482526],"domain_scores_gemma":[0.9991729,0.00007474238,0.00007495098,0.00048339902,0.00009897457,0.00009499643],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00015350289,0.00017248612,0.00017724671,0.00005483112,0.000139594,0.00021603024,0.0007172673,0.00007183441,0.00016043374],"category_scores_gemma":[0.0000016300421,0.00015444335,0.000047518788,0.00034423423,0.0000143174775,0.0005408839,0.00023716784,0.00009414255,0.0008165346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013036399,0.00066024065,0.0133018475,0.00015563026,0.00016776889,0.00020527237,0.0011636154,0.16707087,0.03382709,0.56865805,0.008405757,0.20625353],"study_design_scores_gemma":[0.0006509448,0.000038815826,0.008303215,0.000039308667,0.000008964997,0.000007752706,0.0000095795,0.9828916,0.0002505986,0.00029857035,0.007256644,0.00024398997],"about_ca_topic_score_codex":0.0022582,"about_ca_topic_score_gemma":0.00042492032,"teacher_disagreement_score":0.81582075,"about_ca_system_score_codex":0.00002964537,"about_ca_system_score_gemma":0.000026707354,"threshold_uncertainty_score":0.99996144},"labels":[],"label_agreement":null},{"id":"W2162498183","doi":"10.1109/icc.2005.1494376","title":"Mini round robin: an enhanced frame-based scheduling algorithm for multimedia networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Latency (audio); Quality of service; Scheduling (production processes); Network packet; Computer network; The Internet; Voice over IP; Weighted round robin; Round-robin scheduling; Frame (networking); Real-time computing; Distributed computing; Multimedia; Dynamic priority scheduling; Telecommunications","score_opus":0.012048499751606342,"score_gpt":0.24763093048692256,"score_spread":0.2355824307353162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162498183","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015365513,0.00022194837,0.99492264,0.001410096,0.00067065307,0.00042988232,0.0000016776091,0.0005256045,0.00028093136],"genre_scores_gemma":[0.37259766,0.0000041486232,0.6240798,0.0019210329,0.00088318693,0.00008891118,0.000010799302,0.000012868125,0.00040153964],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983685,0.00005309561,0.00030583233,0.00055536744,0.00020120041,0.000516003],"domain_scores_gemma":[0.9986484,0.00034813044,0.000095325464,0.0005283644,0.00014369976,0.0002360738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033383843,0.00021289435,0.00022849682,0.00006656554,0.00019014873,0.00026722552,0.00072586426,0.00015739666,0.00005518118],"category_scores_gemma":[0.000022080168,0.00019743147,0.00011292771,0.0002324367,0.00004147987,0.00060506474,0.00004641286,0.00017614555,0.000041658972],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007879167,0.00007959709,0.0000036202448,0.0000012551541,0.0000113301585,8.133528e-7,0.000050102073,0.19586916,0.000062578125,0.001790466,0.0002677584,0.80185544],"study_design_scores_gemma":[0.0015406085,0.00014238963,0.000022115593,0.0000142268755,0.000010508543,0.0000014863995,0.000016504344,0.9917671,0.0007967322,0.000091738824,0.0053206966,0.0002759078],"about_ca_topic_score_codex":0.000007110324,"about_ca_topic_score_gemma":0.000037621034,"teacher_disagreement_score":0.80157954,"about_ca_system_score_codex":0.00004779978,"about_ca_system_score_gemma":0.000095526455,"threshold_uncertainty_score":0.80510217},"labels":[],"label_agreement":null},{"id":"W2162532623","doi":"10.1109/wcnc.2003.1200635","title":"Applying active queue management to link layer buffers for real-time traffic over third generation wireless networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer network; Computer science; Retransmission; Network packet; Wireless network; Queueing theory; Link layer; Active queue management; Queue; Queuing delay; Queue management system; Wireless; Transmission delay; Real-time computing; Network congestion; Telecommunications","score_opus":0.013918135431228286,"score_gpt":0.23915467378029837,"score_spread":0.2252365383490701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162532623","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02140807,0.00001970849,0.9709287,0.0025079555,0.0004902559,0.001733343,0.000001396704,0.00043095087,0.0024796138],"genre_scores_gemma":[0.93687254,0.000050380582,0.05608259,0.002557338,0.0008745541,0.0012587503,0.000015947631,0.00002463751,0.0022632538],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848074,0.0000375455,0.00025494178,0.00056644995,0.00023606513,0.00042427715],"domain_scores_gemma":[0.99922895,0.000072675706,0.00007077753,0.00039309353,0.000076670956,0.00015785208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023955911,0.00020830319,0.00020886908,0.000093136514,0.00021877227,0.00021175909,0.0004672579,0.00010459705,0.000016599008],"category_scores_gemma":[0.000003324627,0.00019235555,0.000101253456,0.00032335432,0.000015684931,0.0003208242,0.00009468497,0.00010485225,0.000062443396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024747313,0.00002796647,0.0000010256772,0.0000036641436,0.000039087245,0.0000036695726,0.00013143734,0.4709643,0.0002225339,0.05221818,0.00314263,0.47322074],"study_design_scores_gemma":[0.0011782334,0.00010742444,0.0000889988,0.000025807321,0.000023145198,0.0000020346426,0.000028826988,0.9933727,0.00023574791,0.00021099269,0.0044440944,0.00028200904],"about_ca_topic_score_codex":0.000020515276,"about_ca_topic_score_gemma":0.00007163777,"teacher_disagreement_score":0.91546446,"about_ca_system_score_codex":0.00014643847,"about_ca_system_score_gemma":0.000039733302,"threshold_uncertainty_score":0.7844032},"labels":[],"label_agreement":null},{"id":"W2162677972","doi":"10.1109/ccnc.2006.1593047","title":"The variation in RTT of smooth TCP","year":2006,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"TCP global synchronization; TCP Westwood; Zeta-TCP; TCP Vegas; TCP acceleration; Computer science; TCP tuning; TCP Friendly Rate Control; CUBIC TCP; Computer network; HSTCP; H-TCP; Compound TCP; TCP Westwood plus; Variation (astronomy); Network packet; Transmission Control Protocol; Physics","score_opus":0.0037220009630956593,"score_gpt":0.1826902764983349,"score_spread":0.17896827553523925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162677972","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0136167165,0.00012894781,0.95708907,0.0030437473,0.0002022901,0.0000779469,1.074212e-7,0.000054596454,0.025786586],"genre_scores_gemma":[0.9963503,0.0000044517674,0.0023811928,0.00008446434,0.000036255376,0.000004271446,1.2699347e-7,9.979351e-7,0.0011379546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996086,0.000028450262,0.000120782315,0.0000763142,0.000086099186,0.00007976886],"domain_scores_gemma":[0.9996652,0.00011340614,0.00003444726,0.00015397485,0.000024897363,0.000008077233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019058022,0.000028763374,0.000040830342,0.000018743458,0.000030076775,0.000029512681,0.00022829155,0.000015705717,0.0000066209964],"category_scores_gemma":[0.0000062195686,0.000018394576,0.0000150023,0.00016269715,0.000012227776,0.00007574438,0.000020928364,0.000029136887,0.000008974763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016844614,0.000015324309,0.00044771997,3.962391e-7,0.0000010089202,4.1995972e-7,0.000026978872,0.0018330265,0.00006421079,0.8195213,0.0010576166,0.1770303],"study_design_scores_gemma":[0.00046617794,0.00002516722,0.12756087,0.0000050929516,0.0000015800784,8.2795185e-7,0.0000074128725,0.83429044,0.00009360803,0.022882232,0.014595031,0.0000715493],"about_ca_topic_score_codex":0.00012182421,"about_ca_topic_score_gemma":0.00023764126,"teacher_disagreement_score":0.98273355,"about_ca_system_score_codex":0.0000072463204,"about_ca_system_score_gemma":0.000020840987,"threshold_uncertainty_score":0.0750109},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.020646405727576714,"score_gpt":0.24991975956255086,"score_spread":0.22927335383497416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162932658","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005752668,0.00042567198,0.99188775,0.0028000947,0.0025458126,0.0004151366,0.0000027519009,0.00054962456,0.0007978985],"genre_scores_gemma":[0.8734871,0.00008544732,0.122619495,0.0011947716,0.0016827394,0.00018668198,0.0000012427018,0.000027857219,0.0007146511],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804133,0.000054268992,0.0003705835,0.00055342074,0.00033548084,0.000644942],"domain_scores_gemma":[0.9983834,0.00052500283,0.00011038834,0.00071653334,0.00010981486,0.00015486336],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047849043,0.00025217683,0.00027044734,0.00010771891,0.0006014961,0.00020848219,0.0008428274,0.00012271576,0.000017850796],"category_scores_gemma":[0.000010518162,0.00025915087,0.00025734218,0.0003845891,0.000028504594,0.0004487232,0.000008377041,0.00029472422,0.00006059827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025960699,0.000037272548,0.0000093875615,0.0000045484244,0.00003772972,0.0000016985487,0.00013138594,0.33777717,0.000030871077,0.0009908938,0.00088024,0.66007286],"study_design_scores_gemma":[0.0011485079,0.000090409565,0.000016820513,0.0000925164,0.000036536887,0.000017877705,0.000017674607,0.8733096,0.00016085361,0.001117404,0.123659566,0.00033221644],"about_ca_topic_score_codex":0.000005468301,"about_ca_topic_score_gemma":0.00007550932,"teacher_disagreement_score":0.8729119,"about_ca_system_score_codex":0.00020064351,"about_ca_system_score_gemma":0.00010754402,"threshold_uncertainty_score":0.99998605},"labels":[],"label_agreement":null},{"id":"W2162952094","doi":"10.1109/infcom.1993.253381","title":"The effect of multiplexing, switching and other factors on the performance of broadband networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Broadband; Multiplexing; Broadband networks; Computer science; Telecommunications; Computer network","score_opus":0.010350831975042255,"score_gpt":0.19842002944930442,"score_spread":0.18806919747426218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162952094","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9682733,0.00043866603,0.029171493,0.00026177068,0.00013007394,0.00016210298,1.9575388e-7,0.000030933024,0.0015315008],"genre_scores_gemma":[0.9995285,0.000049807717,0.000056394816,0.00010733782,0.000030853887,0.000004863094,3.0149817e-8,0.0000038677545,0.00021834653],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937546,0.00009397108,0.0001427,0.00011904435,0.00013084941,0.00013797892],"domain_scores_gemma":[0.9982998,0.0012987154,0.000087605156,0.00027587416,0.000013448686,0.000024578181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036049023,0.00008849317,0.00011293812,0.000015144025,0.00016614185,0.00004099836,0.00035047083,0.000028714663,0.00001505603],"category_scores_gemma":[0.000022463746,0.000036894875,0.000039091265,0.000101454774,0.000060188733,0.00006448617,0.000046577858,0.000105702195,0.0000017551811],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047406378,0.000024544628,0.122749075,0.000015357618,0.000070211194,3.4584164e-7,0.000915558,0.027439442,0.00013120781,0.020665996,0.0009513273,0.82698953],"study_design_scores_gemma":[0.00027397412,0.0002533338,0.0033092634,0.00002626464,0.000003934614,0.0000011310275,0.000010728788,0.99451214,0.00077308377,0.000007206085,0.00078027433,0.000048687572],"about_ca_topic_score_codex":0.000011845807,"about_ca_topic_score_gemma":0.0000076445385,"teacher_disagreement_score":0.96707267,"about_ca_system_score_codex":0.0000034751283,"about_ca_system_score_gemma":0.0000018472973,"threshold_uncertainty_score":0.15045293},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.08824674015699609,"score_gpt":0.3651896240061283,"score_spread":0.27694288384913224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162968606","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009750681,0.0100491075,0.97485614,0.0006368794,0.0020657575,0.0009840496,0.000033537595,0.00030412,0.0013197418],"genre_scores_gemma":[0.9804416,0.0024375129,0.015915755,0.0001778726,0.0005260357,0.00014774509,0.000038316175,0.000017776621,0.00029738707],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99650717,0.0020288136,0.000644764,0.00031921582,0.00019862334,0.00030142957],"domain_scores_gemma":[0.9942635,0.001986139,0.000252711,0.003031153,0.00035157052,0.00011490441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037812367,0.00017480622,0.00042025087,0.000058834547,0.00032915705,0.00013042477,0.002827381,0.00012002707,0.000052863277],"category_scores_gemma":[0.000080761274,0.00017594999,0.0001279928,0.00047847748,0.00017600587,0.00049161026,0.00008224952,0.00014714335,0.0000144030455],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001581533,0.00021216221,0.00019861468,0.000012813544,0.00005598053,2.7072014e-7,0.0004573137,0.01712978,0.00024969215,0.040220894,0.0016681348,0.9397785],"study_design_scores_gemma":[0.0026976308,0.0003928017,0.0058337734,0.00021198696,0.000095663,0.000007373929,0.00004389377,0.82299083,0.00040507488,0.0030817282,0.16349748,0.00074177503],"about_ca_topic_score_codex":0.00011548308,"about_ca_topic_score_gemma":0.00012001949,"teacher_disagreement_score":0.9706909,"about_ca_system_score_codex":0.00003667308,"about_ca_system_score_gemma":0.00013999715,"threshold_uncertainty_score":0.7175032},"labels":[],"label_agreement":null},{"id":"W2163021481","doi":"10.1109/iscc.2005.47","title":"Deploying Multicast Communication over MPLS Networks Using Tree Numbering","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Multicast; Computer science; Computer network; Tree (set theory); Concatenation (mathematics); Protocol Independent Multicast; Xcast; Session (web analytics); Distance Vector Multicast Routing Protocol; Distributed computing; Mathematics","score_opus":0.01804920710534243,"score_gpt":0.2561520379091667,"score_spread":0.23810283080382424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163021481","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03616988,0.00037593875,0.9580493,0.00059756136,0.00012785025,0.00010687112,9.661483e-8,0.00037303419,0.0041994816],"genre_scores_gemma":[0.8606336,0.000024895087,0.13831684,0.0006329448,0.00018208497,0.000006332251,6.9308516e-7,0.000009918961,0.0001926974],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904394,0.00007003536,0.00022554406,0.00023437642,0.00014528004,0.00028083017],"domain_scores_gemma":[0.99904484,0.00014481525,0.00006926787,0.00060489756,0.000047912865,0.000088261564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022041831,0.000118099524,0.00012451112,0.000040353723,0.00021421665,0.00019509795,0.0006144827,0.000058873877,0.000049243623],"category_scores_gemma":[0.000011143449,0.00011352701,0.000054769716,0.000214689,0.000028349996,0.0006288898,0.0002051409,0.00015553448,0.000037268182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027761482,0.000027076598,0.0005887433,9.819959e-7,0.000012052844,0.0000012941196,0.000102354104,0.29266432,0.000076610995,0.021177491,0.00029920458,0.6850471],"study_design_scores_gemma":[0.0003794326,0.00000560399,0.0006611253,0.00002131742,0.000006800682,0.000012470073,0.00001320713,0.9960512,0.00002844784,0.00005386587,0.0026227313,0.0001437957],"about_ca_topic_score_codex":0.000043473246,"about_ca_topic_score_gemma":0.00017089564,"teacher_disagreement_score":0.8244637,"about_ca_system_score_codex":0.000057683133,"about_ca_system_score_gemma":0.000020856838,"threshold_uncertainty_score":0.4629497},"labels":[],"label_agreement":null},{"id":"W2163193980","doi":"10.1109/tns.2009.2037622","title":"Receiver-Assisted Congestion Control to Achieve High Throughput in Lossy Wireless Networks","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Nuclear Science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Network congestion; Computer science; Computer network; Lossy compression; Packet loss; Wireless network; Timeout; Throughput; Bandwidth (computing); Real-time computing; Wireless; Network packet; Telecommunications","score_opus":0.006130692222795203,"score_gpt":0.2168857200105535,"score_spread":0.21075502778775831,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163193980","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.343801,0.0000037749448,0.64879906,0.0036221386,0.002912516,0.00036355192,0.0000042538522,0.0002947022,0.00019903119],"genre_scores_gemma":[0.9913436,0.000011704393,0.0066809123,0.0016876885,0.000097441174,0.00004068819,1.2428934e-7,0.00002012497,0.000117704665],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973776,0.00010393757,0.00035331224,0.0009046763,0.0005951807,0.00066534546],"domain_scores_gemma":[0.9982854,0.00021257332,0.000096303076,0.0008422644,0.00020509327,0.00035832394],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008232462,0.00025049027,0.00027826277,0.00037985083,0.000604887,0.00040634922,0.0015825738,0.0001640261,0.00007741983],"category_scores_gemma":[0.00001811485,0.00024650907,0.00008449423,0.0021848418,0.00041851058,0.0009973878,0.000009877852,0.00083456456,0.0002393964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001533555,0.00028240815,0.000023983906,0.0000025735205,0.000012516515,0.000020988131,0.00028050237,0.3180625,0.007331005,0.008616988,0.00013296603,0.6650802],"study_design_scores_gemma":[0.0012538446,0.00036641734,0.0055796704,0.0000431869,0.000013372716,0.000034157656,0.00002002668,0.9911037,0.00021842316,0.00009640841,0.000907978,0.00036281347],"about_ca_topic_score_codex":0.00012334823,"about_ca_topic_score_gemma":0.00037193284,"teacher_disagreement_score":0.67304116,"about_ca_system_score_codex":0.00012865025,"about_ca_system_score_gemma":0.00018150157,"threshold_uncertainty_score":0.9999987},"labels":[],"label_agreement":null},{"id":"W2163278739","doi":"10.1109/dnsr.2004.1344723","title":"Petri net approach to improving SACK TCP resilience","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Sack; Zeta-TCP; TCP global synchronization; TCP acceleration; TCP Friendly Rate Control; Computer science; Compound TCP; Computer network; TCP tuning; TCP hole punching; CUBIC TCP; TCP Westwood plus; TCP delayed acknowledgment; Transmission Control Protocol; Distributed computing; Engineering","score_opus":0.008350592749066946,"score_gpt":0.2034146880664009,"score_spread":0.19506409531733396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163278739","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003996651,0.00006938881,0.9551857,0.0018871565,0.00024910818,0.00018967844,2.6135822e-7,0.00035341844,0.038068652],"genre_scores_gemma":[0.830344,0.0000023127527,0.16548136,0.0020163627,0.0001142461,0.000020401745,4.2442116e-7,0.000005268351,0.002015599],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872744,0.000023500506,0.00017410723,0.00046892467,0.00025816634,0.00034784744],"domain_scores_gemma":[0.99915326,0.000039561135,0.000036089834,0.00051337737,0.00005890488,0.00019878532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021615521,0.000120150806,0.00012308559,0.00007607557,0.00011760408,0.0001857387,0.0009210741,0.00004361798,0.0000111452155],"category_scores_gemma":[0.000035120236,0.000102404825,0.00004450581,0.0005632908,0.000024641418,0.00031230206,0.00017688007,0.00011166404,0.0002745578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006959494,0.000086773216,0.000052120013,0.0000051900197,0.0000055894006,0.0000067240294,0.0002940955,0.05775435,0.00024916284,0.38994637,0.0027467264,0.54884595],"study_design_scores_gemma":[0.0026613884,0.0004610429,0.003196457,0.000040758827,0.000014645308,0.00010058551,0.00021159739,0.95850384,0.001231799,0.005372044,0.027086392,0.0011194773],"about_ca_topic_score_codex":0.000053762433,"about_ca_topic_score_gemma":0.000012960705,"teacher_disagreement_score":0.90074944,"about_ca_system_score_codex":0.000047991878,"about_ca_system_score_gemma":0.00011229967,"threshold_uncertainty_score":0.41759476},"labels":[],"label_agreement":null},{"id":"W2163785351","doi":"10.1109/cnsr.2005.37","title":"Investigating TCP Performance Issues in Satellite Networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University; Dalhousie University","funders":"","keywords":"Computer network; Computer science; TCP acceleration; TCP global synchronization; TCP Friendly Rate Control; TCP tuning; Zeta-TCP; Propagation delay; Satellite constellation; Network delay; Satellite; Real-time computing; Transmission Control Protocol; Engineering; Network packet","score_opus":0.01033170890203001,"score_gpt":0.2244848709270237,"score_spread":0.2141531620249937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163785351","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3780221,0.0065010646,0.5462192,0.022304518,0.00068516715,0.0003868897,1.4805823e-7,0.0011149568,0.044765912],"genre_scores_gemma":[0.9585337,0.00033305274,0.0368313,0.0021390838,0.00030116306,0.00001104295,5.7907926e-7,0.000005041034,0.0018450072],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904764,0.000041750798,0.00022941797,0.0002483578,0.00013620003,0.00029665246],"domain_scores_gemma":[0.99952084,0.0000640597,0.000042717787,0.00026538022,0.000024722867,0.000082259714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028907193,0.00010435798,0.00012089101,0.000056793542,0.00006241388,0.00010537929,0.0004412467,0.000051097213,0.0000319683],"category_scores_gemma":[0.000010867495,0.00009266961,0.000024843537,0.00035420634,0.000031131523,0.0005468241,0.00007910568,0.00015954483,0.00012066268],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.092167e-7,0.000011171322,0.009370477,0.0000016621916,0.0000020085024,0.0000010493976,0.00016306216,0.071797736,0.0000056594045,0.019148711,0.0005757592,0.89892197],"study_design_scores_gemma":[0.00021797554,0.00001827307,0.009930994,0.000024626119,8.106542e-7,0.0000036398517,0.000008366043,0.95877665,0.000046176112,0.00010568249,0.030743388,0.00012340148],"about_ca_topic_score_codex":0.0000107606875,"about_ca_topic_score_gemma":0.00007152456,"teacher_disagreement_score":0.8987986,"about_ca_system_score_codex":0.000024510908,"about_ca_system_score_gemma":0.000021188083,"threshold_uncertainty_score":0.37789568},"labels":[],"label_agreement":null},{"id":"W2163844343","doi":"10.1109/glocom.1997.638496","title":"Evaluation of statistical multiplexing performance for real-time ATM traffic employing a frame-based management strategy","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Statistical time division multiplexing; Multiplexing; Queueing theory; Computer science; Frame (networking); Computer network; Asynchronous Transfer Mode; Real-time computing; Telecommunications","score_opus":0.04852737614439475,"score_gpt":0.2791895986418621,"score_spread":0.23066222249746735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163844343","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08576958,0.00006959233,0.90959203,0.00015366622,0.000092109425,0.0007431511,0.0000048878364,0.0001950296,0.0033799352],"genre_scores_gemma":[0.8896228,0.000017938351,0.109891005,0.000055598644,0.000033181048,0.00012530394,0.0000061455125,0.000008460719,0.0002395412],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983599,0.000108748514,0.00031673486,0.0003241799,0.0006188626,0.00027156662],"domain_scores_gemma":[0.99899316,0.00027205423,0.00009667297,0.00030221487,0.00026757928,0.00006831363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010428841,0.00012796301,0.00017102122,0.00007871899,0.00010776367,0.00006718677,0.0003076345,0.00004768113,0.00024193579],"category_scores_gemma":[0.000029901474,0.00011840253,0.0000545812,0.00019314793,0.000034772984,0.00019484703,0.00002574051,0.000057226018,0.000039610397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009665294,0.00007159114,0.000016156033,0.00002340559,0.000023675273,6.581164e-7,0.000045704255,0.28714523,0.00003282955,0.0090645645,0.0003967114,0.7031698],"study_design_scores_gemma":[0.0017110787,0.00019271854,0.0006447072,0.00004167311,0.00005809271,8.0820644e-7,0.000014605211,0.99686074,0.00004997632,0.00017786578,0.000110565554,0.00013716803],"about_ca_topic_score_codex":0.0000033134409,"about_ca_topic_score_gemma":0.0000037003213,"teacher_disagreement_score":0.8038533,"about_ca_system_score_codex":0.00005933025,"about_ca_system_score_gemma":0.000044748234,"threshold_uncertainty_score":0.4828315},"labels":[],"label_agreement":null},{"id":"W2164040056","doi":"10.1109/icc.2005.1494602","title":"Self-tuning PI rate controller for AQM router supporting best-effort traffic","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Active queue management; Router; Phase margin; Robustness (evolution); Control theory (sociology); Computer science; Network congestion; Queue; PID controller; Queueing theory; Explicit Congestion Notification; Controller (irrigation); Real-time computing; Computer network; Engineering; Control engineering; Bandwidth (computing); Amplifier; Control (management); Network packet","score_opus":0.01361177366779665,"score_gpt":0.25042687113340684,"score_spread":0.2368150974656102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164040056","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014697462,0.0001544729,0.9729191,0.0057886345,0.00040671477,0.0008012901,0.0000015145442,0.00088492327,0.004345883],"genre_scores_gemma":[0.88519335,0.0000105332565,0.10568208,0.0028853144,0.00063872215,0.00015815167,0.0000031286827,0.000020247795,0.005408476],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980598,0.000049139748,0.0005041545,0.00052088726,0.00019799164,0.000668019],"domain_scores_gemma":[0.99887085,0.0002864205,0.00016811563,0.00034639667,0.00014564082,0.00018255274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082767796,0.00023461094,0.00032223202,0.000086956796,0.00025391526,0.000279215,0.000630574,0.00009756297,0.00006317555],"category_scores_gemma":[0.000028618924,0.00020006957,0.00019351736,0.00018977086,0.000021878113,0.0006420341,0.00007770484,0.00014437787,0.00016281531],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030877698,0.00011390465,0.00007451353,0.000010406488,0.00007654152,0.000005332123,0.00037386987,0.014470098,0.000052381078,0.034632493,0.004957317,0.9452023],"study_design_scores_gemma":[0.002166468,0.000112828835,0.000036675207,0.000010323346,0.000029017969,0.000011736385,0.00003230862,0.8901013,0.000058582526,0.00012007851,0.107069045,0.00025163055],"about_ca_topic_score_codex":0.0000019984286,"about_ca_topic_score_gemma":0.000022905699,"teacher_disagreement_score":0.94495064,"about_ca_system_score_codex":0.000051752715,"about_ca_system_score_gemma":0.00009897456,"threshold_uncertainty_score":0.81586003},"labels":[],"label_agreement":null},{"id":"W2164222867","doi":"10.1109/icdcs.2010.73","title":"Reliability Calculus: A Theoretical Framework to Analyze Communication Reliability","year":2010,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Reliability (semiconductor); Computer science; Backup; Aerospace; Automotive industry; Domain (mathematical analysis); Telecommunications network; Complex system; Distributed computing; Communications system; Actuator; Cyber-physical system; Reliability engineering; Computer network; Engineering","score_opus":0.004656640237882618,"score_gpt":0.2494757146018399,"score_spread":0.24481907436395728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164222867","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09856162,0.000013843434,0.8712966,0.021930628,0.0003801284,0.00029472722,0.000001041882,0.00043118183,0.007090263],"genre_scores_gemma":[0.78067404,0.0000034873037,0.21718374,0.0018975721,0.00007197152,0.00004154192,0.0000010904505,0.0000054451602,0.00012111297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982783,0.00023784222,0.0003339294,0.00053802214,0.0002961988,0.00031565825],"domain_scores_gemma":[0.99567443,0.0009825581,0.000049741295,0.0027265847,0.0002679006,0.00029876357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015148853,0.00014852101,0.00020054642,0.000046997196,0.00018766818,0.00017110555,0.0015720457,0.00018214481,0.00044560485],"category_scores_gemma":[0.0013269687,0.0001178809,0.000101371705,0.00054973725,0.00027255033,0.00024622728,0.0004006094,0.0006666911,0.00028303437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011765091,0.000087216766,0.00059268554,0.0000019420538,0.0000038142612,6.071735e-7,0.00017169202,0.00029072212,0.000062078085,0.9209626,0.0011619403,0.07665295],"study_design_scores_gemma":[0.00029759164,0.00010654444,0.012728252,0.00002147142,0.00001522496,0.0000068720233,0.000033003922,0.60686684,0.00017983824,0.35848802,0.020857247,0.00039908895],"about_ca_topic_score_codex":0.00003315478,"about_ca_topic_score_gemma":0.00004718991,"teacher_disagreement_score":0.6821124,"about_ca_system_score_codex":0.000031889227,"about_ca_system_score_gemma":0.00007837956,"threshold_uncertainty_score":0.48790607},"labels":[],"label_agreement":null},{"id":"W2164392948","doi":"10.1109/snpd.2007.541","title":"QoS Performance Analysis in Deployment of DiffServ-aware MPLS Traffic Engineering","year":2007,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Multiprotocol Label Switching; Computer network; Quality of service; Computer science; Differentiated services; Voice over IP; Traffic engineering; Network packet; Mobile QoS; Integrated services; Service provider; The Internet; Service (business)","score_opus":0.006043042559777604,"score_gpt":0.19944941589583634,"score_spread":0.19340637333605873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164392948","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5277111,0.00004919927,0.47182253,0.00007216855,0.00008578084,0.000054948752,1.5132888e-7,0.00007830821,0.0001257992],"genre_scores_gemma":[0.995406,0.000015480307,0.0043644714,0.00006422906,0.000037131325,0.000005645832,8.6389235e-7,0.0000040701193,0.000102129874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903154,0.000011150675,0.00030638778,0.00020607095,0.0001961613,0.00024868667],"domain_scores_gemma":[0.99948364,0.00008581908,0.00005109918,0.0002751246,0.000038389197,0.00006589966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036458168,0.00009626776,0.00019597873,0.00030909234,0.000020602369,0.000019012223,0.0003641007,0.00003984133,0.000021013928],"category_scores_gemma":[0.0000047570516,0.00008579762,0.000081803446,0.0012498584,0.000009639799,0.00016152243,0.000046222394,0.000081248225,0.0000065185686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008884138,0.00007989618,0.017301835,0.000013369583,0.00008752812,0.000008469857,0.00020799218,0.6469083,0.00009804027,0.0029477412,0.000041368985,0.3322966],"study_design_scores_gemma":[0.0002607349,0.00003009375,0.08834783,0.000011388276,0.000020002419,0.0000011435858,0.000014654441,0.91074055,0.00031312992,0.0000010807331,0.00016474369,0.00009467096],"about_ca_topic_score_codex":0.0000099289,"about_ca_topic_score_gemma":0.000117896634,"teacher_disagreement_score":0.46769488,"about_ca_system_score_codex":0.000033496555,"about_ca_system_score_gemma":0.000018207696,"threshold_uncertainty_score":0.34987253},"labels":[],"label_agreement":null},{"id":"W2164447161","doi":"10.1109/icc.1997.610055","title":"Fuzzy logic in estimation of traffic burstiness for admission control in broadband networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Burstiness; Computer science; Queue; Queueing theory; Fuzzy logic; Broadband networks; Computer network; Real-time computing; Set (abstract data type); Fuzzy set; Broadband; Artificial intelligence; Telecommunications; Network packet","score_opus":0.015858989487603527,"score_gpt":0.23411339156718644,"score_spread":0.2182544020795829,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164447161","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03607258,0.00062425865,0.96013725,0.0016404511,0.0001990913,0.0005307837,7.079959e-7,0.000083455176,0.0007114292],"genre_scores_gemma":[0.99219704,0.000022411858,0.007168476,0.00029013658,0.000045190376,0.000064102394,0.0000019342199,0.0000055962737,0.00020509357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887866,0.00006266606,0.0003925431,0.00027524657,0.00012646659,0.00026442378],"domain_scores_gemma":[0.99927104,0.00030530832,0.00010059412,0.00021089741,0.000048075522,0.00006407964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033043724,0.00012149806,0.00025523448,0.00014100966,0.000030335006,0.000033362634,0.00031511043,0.00009721196,0.000024582188],"category_scores_gemma":[0.00006256943,0.00010378184,0.000051943996,0.00044280372,0.000023661496,0.00022271577,0.000018882549,0.00009851389,0.0000038127773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002334277,0.000080572805,0.0001626279,0.000007014639,0.000002093625,0.0000021024873,0.00005178171,0.5918949,0.000006641939,0.0073768888,0.00028574144,0.40010628],"study_design_scores_gemma":[0.0030268768,0.00010190478,0.0013091299,0.000051873998,0.000004159639,0.0000030179526,0.000007750338,0.9945061,0.0000041962894,0.00075721944,0.00011043705,0.000117333715],"about_ca_topic_score_codex":0.0000064904343,"about_ca_topic_score_gemma":0.00004295202,"teacher_disagreement_score":0.9561245,"about_ca_system_score_codex":0.000027471906,"about_ca_system_score_gemma":0.000016768081,"threshold_uncertainty_score":0.42321005},"labels":[],"label_agreement":null},{"id":"W2164780830","doi":"10.1109/imtc.2007.379337","title":"A Measurement-Oriented Approach to Modeling Packet Loss in IP Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Quality of service; Implementation; Integrated services; Computer network; Network packet; Service provider; Consistency (knowledge bases); Service (business); Packet loss; Next-generation network; Telecommunications network; Differentiated services; Distributed computing; The Internet; Software engineering","score_opus":0.025973110661141253,"score_gpt":0.23013432522184674,"score_spread":0.2041612145607055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164780830","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073367674,0.0001599808,0.9811265,0.00040406926,0.00029135778,0.00027024793,8.579254e-8,0.00022052665,0.010190479],"genre_scores_gemma":[0.96466553,0.0000036521503,0.033956666,0.0011020319,0.00014360539,0.000021024414,7.0998215e-7,0.000007892304,0.00009891289],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982242,0.000046718873,0.00031631335,0.0004358581,0.00044220287,0.00053471874],"domain_scores_gemma":[0.99921834,0.000026808328,0.000031229512,0.00038919869,0.0001344927,0.0001999377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016789517,0.00014318805,0.000164645,0.00013917082,0.000064250555,0.00007014403,0.0005064451,0.00007337695,0.0000036717656],"category_scores_gemma":[0.000026469444,0.00012901601,0.00004667148,0.0008191809,0.000011513638,0.00019918545,0.000111257665,0.0001749303,0.000021845512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003456473,0.0001359759,0.00086397,0.0000029429136,0.000012131146,0.00001226338,0.00025999988,0.6549635,0.000007515909,0.08263963,0.0005053422,0.26056218],"study_design_scores_gemma":[0.00051097374,0.000024656949,0.00041487068,0.000020080946,0.0000023607483,0.000005006585,0.00004607959,0.9980629,0.0000059894173,0.00016111435,0.0005800921,0.00016584623],"about_ca_topic_score_codex":0.000032472646,"about_ca_topic_score_gemma":0.00013410185,"teacher_disagreement_score":0.95732874,"about_ca_system_score_codex":0.00009151682,"about_ca_system_score_gemma":0.000037718717,"threshold_uncertainty_score":0.5261121},"labels":[],"label_agreement":null},{"id":"W2165379223","doi":"10.1109/ccece.1998.685574","title":"Supporting isochronous ATM traffic over IEEE 802.14 based HFC access networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer network; Asynchronous Transfer Mode; Computer science; Quality of service; Wireless Multimedia Extensions; ATM adaptation layer; Asynchronous communication; IEEE 802.1X; Throughput; IEEE 802.11; Telecommunications; Wireless network; Wireless; Wi-Fi array","score_opus":0.01938480043301729,"score_gpt":0.26189132564539913,"score_spread":0.24250652521238183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165379223","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018673705,0.00039789508,0.97000897,0.0018133348,0.0013270893,0.00028453124,8.4351757e-7,0.0009394704,0.0065541794],"genre_scores_gemma":[0.9885221,0.000023109968,0.0037002515,0.0042378004,0.00054760376,0.000033137458,0.0000024401202,0.000021973121,0.002911575],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997636,0.000097660544,0.0004613948,0.00064522715,0.00036354692,0.00079617347],"domain_scores_gemma":[0.9985518,0.0002597114,0.00018392708,0.0006818413,0.00008143062,0.00024133224],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00033781232,0.00027469845,0.00029384778,0.00008856199,0.0002487969,0.0005590129,0.001395939,0.00014786533,0.0015855021],"category_scores_gemma":[0.000019949064,0.0002482716,0.00017105995,0.0005594129,0.00005643622,0.00075070263,0.00011234996,0.0002828347,0.00020393533],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057484845,0.000116217154,0.0003218822,0.000005898323,0.00002273936,0.00004473626,0.00007048873,0.34070387,0.000004823942,0.00132301,0.057161428,0.60021913],"study_design_scores_gemma":[0.00090657134,0.00007374415,0.0004140474,0.000016937389,0.0000137954885,0.000011151347,0.0000043466807,0.9908506,0.000019882264,0.000026895674,0.0073340954,0.00032791932],"about_ca_topic_score_codex":0.000010322108,"about_ca_topic_score_gemma":0.000039864393,"teacher_disagreement_score":0.9698484,"about_ca_system_score_codex":0.00005942054,"about_ca_system_score_gemma":0.00004892129,"threshold_uncertainty_score":0.99999696},"labels":[],"label_agreement":null},{"id":"W2165481977","doi":"10.1109/atm.1998.675139","title":"Interoperability among explicit rate congestion control algorithms for ABR service in ATM networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Network congestion; Asynchronous Transfer Mode; Computer network; Interoperability; Vendor; Transient (computer programming); Distributed computing; Flow control (data); Operating system","score_opus":0.023407272589866024,"score_gpt":0.22650132168682227,"score_spread":0.20309404909695625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165481977","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045385174,0.00021675469,0.9475235,0.0043997103,0.0006269555,0.000896807,0.0000024634182,0.00032466883,0.00062399847],"genre_scores_gemma":[0.9919774,0.000028034894,0.0035691631,0.0032288295,0.00021743304,0.00033675984,0.000003569298,0.000014528094,0.00062429765],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807435,0.00020073194,0.00046136827,0.0006204409,0.00014335799,0.0004997624],"domain_scores_gemma":[0.99860555,0.00039302962,0.00010386574,0.00053901254,0.0002079097,0.00015061286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007357449,0.00023316733,0.00033586464,0.0000733882,0.00011050522,0.00019017616,0.0006777195,0.00014374792,0.00010683509],"category_scores_gemma":[0.00004843037,0.00020553145,0.00009415522,0.00044851864,0.00003783512,0.0006207653,0.00007545234,0.00022466476,0.00005011852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009842128,0.00032936732,0.009194487,0.000025561056,0.00006336308,0.0000150720025,0.00068279315,0.120268844,0.00004412429,0.023210645,0.0033710317,0.8426963],"study_design_scores_gemma":[0.0025978535,0.00009845965,0.0111435605,0.000029809959,0.000009875253,0.0000032783369,0.000027696216,0.98440295,0.000008498383,0.0002599683,0.0011769071,0.00024112848],"about_ca_topic_score_codex":0.000103668455,"about_ca_topic_score_gemma":0.00060334866,"teacher_disagreement_score":0.9465922,"about_ca_system_score_codex":0.00007475171,"about_ca_system_score_gemma":0.0000137675825,"threshold_uncertainty_score":0.8381329},"labels":[],"label_agreement":null},{"id":"W2165518311","doi":"10.1109/pccc.2007.358877","title":"TCP Vegas Performance with Streaming Media","year":2007,"lang":"en","type":"article","venue":"IEEE International Performance, Computing, and Communications Conference","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Vedecká Grantová Agentúra MŠVVaŠ SR a SAV","keywords":"TCP Vegas; Zeta-TCP; Computer science; TCP global synchronization; Compound TCP; Computer network; TCP acceleration; TCP Friendly Rate Control; TCP Westwood; TCP Westwood plus; Transmission Control Protocol; Network packet","score_opus":0.026852465069707558,"score_gpt":0.2651253376259799,"score_spread":0.23827287255627233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165518311","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60152817,0.00018207933,0.36826503,0.000902995,0.00058486435,0.0001431245,0.0000022330203,0.00023892705,0.0281526],"genre_scores_gemma":[0.97619295,0.0007751483,0.022227382,0.00031793347,0.00017459135,0.000011305602,0.000016114449,0.000011391623,0.00027319917],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983959,0.00004370153,0.00041813776,0.00036975337,0.000411349,0.00036111686],"domain_scores_gemma":[0.99776053,0.00036797125,0.00023557054,0.0010177911,0.0004722139,0.00014592087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005701238,0.0002236052,0.00019546805,0.00021526762,0.0005149895,0.00028336598,0.0024091122,0.00007237245,0.000016454072],"category_scores_gemma":[0.00001702967,0.00020164732,0.00003602098,0.0003311087,0.00028557488,0.00071948813,0.0004157832,0.00038568367,0.000035664245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003908387,0.00010101231,0.019443527,0.000012661461,0.000057689336,0.0000035923345,0.0010734296,0.0006339877,0.00005846251,0.07160728,0.0001526864,0.9068166],"study_design_scores_gemma":[0.0007519614,0.00012476112,0.050538242,0.00018543628,0.000012968298,0.00009495547,0.00016449996,0.9342421,0.00022811306,0.00011730089,0.013208086,0.00033156402],"about_ca_topic_score_codex":0.00002354507,"about_ca_topic_score_gemma":0.00010449221,"teacher_disagreement_score":0.9336081,"about_ca_system_score_codex":0.00007097168,"about_ca_system_score_gemma":0.00013389517,"threshold_uncertainty_score":0.8222939},"labels":[],"label_agreement":null},{"id":"W2165808548","doi":"10.1109/glocom.2004.1378267","title":"Performance analysis of equation based TFRC over wireless links with link level ARQ","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Markov chain; Automatic repeat request; Network packet; Throughput; Markov process; Link level; Quality of service; Wireless; The Internet; Wireless network; Real-time computing; Mathematics; Telecommunications","score_opus":0.022486202927387015,"score_gpt":0.22232286077866104,"score_spread":0.19983665785127402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165808548","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18886274,0.000016964192,0.8080148,0.0012767133,0.000034149005,0.000070065216,0.000001248369,0.00008161736,0.0016416999],"genre_scores_gemma":[0.96740884,0.000006365131,0.03095427,0.00074275024,0.00008183714,0.000009321645,0.0000058790756,0.000004380487,0.00078633305],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990161,0.000031740456,0.00022830468,0.00024798315,0.00030695734,0.00016891908],"domain_scores_gemma":[0.99918735,0.00010233573,0.00011911558,0.00038922616,0.00014349892,0.000058468482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022489353,0.00010556891,0.00020610678,0.00019648057,0.000055982087,0.00004152921,0.00034513962,0.00008216319,0.00013626124],"category_scores_gemma":[0.0000041422536,0.000080047554,0.00007552741,0.0010357207,0.000031857493,0.00032814138,0.000026001115,0.00012650953,0.000016353077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001858737,0.000042180676,0.008568787,0.0000047280264,0.00013497756,4.974091e-7,0.00006830406,0.27268353,0.000048954334,0.0060459217,0.000091952425,0.7122916],"study_design_scores_gemma":[0.00049064157,0.000070266215,0.038520593,0.000012068704,0.000113169495,2.9775376e-7,0.000002659224,0.95978487,0.00038971598,0.0000037539394,0.0004976921,0.00011425682],"about_ca_topic_score_codex":0.00001564234,"about_ca_topic_score_gemma":0.000118859214,"teacher_disagreement_score":0.77854615,"about_ca_system_score_codex":0.000025680507,"about_ca_system_score_gemma":0.00008909837,"threshold_uncertainty_score":0.32642445},"labels":[],"label_agreement":null},{"id":"W2166076019","doi":"10.1109/glocom.1996.594350","title":"Global congestion control in hybrid ATM/TDMA networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Concordia University; Sonaca (Canada)","funders":"","keywords":"Computer network; Computer science; Network congestion; Quality of service; Asynchronous Transfer Mode; Network traffic control; Flow control (data); Bandwidth (computing); Real-time computing","score_opus":0.008016705478326587,"score_gpt":0.19256272010715597,"score_spread":0.18454601462882939,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166076019","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037250405,0.00082438765,0.97694826,0.0038340853,0.0006637737,0.0002374835,0.0000016359907,0.00037523833,0.0133901015],"genre_scores_gemma":[0.99488884,0.000053203963,0.0015041137,0.0026565995,0.00018553574,0.000029162691,0.0000012467972,0.0000052689725,0.00067600165],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857265,0.00011211494,0.00028680786,0.00040479712,0.00019291461,0.00043072045],"domain_scores_gemma":[0.9992372,0.00012189735,0.00006359444,0.00038853413,0.000052481453,0.00013629418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002296779,0.00016587999,0.00021589184,0.00004524037,0.000068156936,0.0001431252,0.00054923596,0.000072251765,0.00019399726],"category_scores_gemma":[0.000022429598,0.00015310553,0.000067517314,0.00042095897,0.000041227526,0.0003588179,0.000056155957,0.00013346544,0.00018880008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014029253,0.000104264,0.008967626,0.0000015666647,0.00001735527,0.00008651269,0.000018720631,0.08074485,0.000001106724,0.11127507,0.018436994,0.7803319],"study_design_scores_gemma":[0.0016430608,0.000055375775,0.0060596326,0.000011324515,0.0000053289205,0.000041698793,0.0000028820925,0.9871316,6.1479165e-7,0.00069531094,0.004172328,0.00018086891],"about_ca_topic_score_codex":0.00003147968,"about_ca_topic_score_gemma":0.00010125374,"teacher_disagreement_score":0.99116385,"about_ca_system_score_codex":0.00008490131,"about_ca_system_score_gemma":0.000013862709,"threshold_uncertainty_score":0.62434626},"labels":[],"label_agreement":null},{"id":"W2166354667","doi":"10.1109/iscc.2007.4381476","title":"Delivering Multicast Services over MPLS Infrastructure","year":2007,"lang":"en","type":"article","venue":"Proceedings - IEEE Symposium on Computers and Communications/IEEE Symposium on Computers and Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Multiprotocol Label Switching; Multicast; Computer network; Computer science; IP multicast; Testbed; Xcast; Source-specific multicast; Pragmatic General Multicast; Service provider; Service (business); Quality of service; Business","score_opus":0.012337445407240088,"score_gpt":0.2486222798393965,"score_spread":0.23628483443215642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166354667","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30523178,0.0042134523,0.60774064,0.049863894,0.004524589,0.004059438,0.000087831344,0.0030804176,0.02119795],"genre_scores_gemma":[0.9277852,0.005496255,0.06108891,0.005056158,0.000288456,0.00012260661,0.00003377428,0.00007296934,0.000055635843],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99574035,0.00019022197,0.0011638853,0.001281627,0.0006601012,0.0009637919],"domain_scores_gemma":[0.9928223,0.0014164773,0.00065489276,0.0038913316,0.00056029006,0.00065469625],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010139835,0.0008762628,0.0007646807,0.00064372557,0.0023136847,0.0014382743,0.0066302232,0.00035132543,0.0000034014],"category_scores_gemma":[0.000010496464,0.00088554935,0.00022924687,0.00096447975,0.0007109672,0.0010713977,0.0024023957,0.0012578842,0.000026868609],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042125885,0.0024222615,0.0063686674,0.00040406178,0.00096724974,0.000022850067,0.017422259,0.009769288,0.01168931,0.43167546,0.0064800126,0.51235735],"study_design_scores_gemma":[0.0023854577,0.0007452333,0.00413042,0.00086099503,0.00011963027,0.00015572677,0.0003261348,0.9647235,0.0004090745,0.0010023715,0.023777146,0.0013642984],"about_ca_topic_score_codex":0.000116030744,"about_ca_topic_score_gemma":0.000061561244,"teacher_disagreement_score":0.9549542,"about_ca_system_score_codex":0.00019995018,"about_ca_system_score_gemma":0.00008984674,"threshold_uncertainty_score":0.9995983},"labels":[],"label_agreement":null},{"id":"W2166898899","doi":"10.1109/glocomw.2013.6855677","title":"Towards TCP optimization in wireless networks by a frame based cross layer routing metric","year":2013,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; TCP global synchronization; TCP acceleration; Zeta-TCP; TCP Friendly Rate Control; Transmission Control Protocol; Frame (networking); TCP tuning; TCP Westwood plus; Routing protocol; Distributed computing; Routing (electronic design automation); Network packet","score_opus":0.008919615983210121,"score_gpt":0.22992787919548327,"score_spread":0.22100826321227315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166898899","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009298546,0.000113815884,0.98629934,0.0012194498,0.00027539462,0.00026553805,4.1180408e-7,0.00027014106,0.0022573408],"genre_scores_gemma":[0.96409017,0.000009293909,0.0333735,0.0018394408,0.000072661445,0.00006819889,0.000005415063,0.000011094461,0.00053025375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854165,0.00009909801,0.00031861282,0.00039127658,0.00023852264,0.0004108254],"domain_scores_gemma":[0.9991581,0.00017064586,0.00009049005,0.00032803853,0.00013684965,0.00011591874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034056028,0.0001565598,0.00019033797,0.00013519869,0.00009126075,0.0005202306,0.0005728448,0.00013734889,0.00023001226],"category_scores_gemma":[0.000037682545,0.00013859138,0.000054092736,0.0012304476,0.000027516353,0.0005952975,0.000092006056,0.00020500556,0.000046118814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002636116,0.00004298686,0.0020214282,0.0000016285979,0.000004973239,0.0000016655868,0.00002326286,0.7923055,0.0000069456523,0.0033055746,0.0022615087,0.20002183],"study_design_scores_gemma":[0.0006704758,0.000024637207,0.00151241,0.0000128478605,0.0000021895344,9.417254e-7,0.0000067116625,0.997337,0.0000374417,0.000045848654,0.00016896689,0.00018053543],"about_ca_topic_score_codex":0.0002682257,"about_ca_topic_score_gemma":0.000010002226,"teacher_disagreement_score":0.9547916,"about_ca_system_score_codex":0.000055611188,"about_ca_system_score_gemma":0.000074805816,"threshold_uncertainty_score":0.56515926},"labels":[],"label_agreement":null},{"id":"W2167013383","doi":"10.1109/icc.1996.541373","title":"Parameter dimensioning of access control in LAN/MAN network interconnection","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Dimensioning; Computer science; Interconnection; Frame (networking); Flow control (data); Computer network; Network congestion; Markov process; Distributed computing; Engineering","score_opus":0.026996779842683397,"score_gpt":0.23402244318401177,"score_spread":0.20702566334132838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167013383","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057724524,0.00028134292,0.9338512,0.0014524616,0.00055997045,0.00020001466,2.31553e-7,0.00015386878,0.0057764333],"genre_scores_gemma":[0.99562484,0.00001188706,0.0025622565,0.0013112406,0.00008305911,0.000015643485,2.8721246e-7,0.0000047181225,0.00038608935],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990017,0.00009386509,0.00027409065,0.00023855602,0.00012501515,0.00026680974],"domain_scores_gemma":[0.999235,0.00032119558,0.00008368683,0.00026784235,0.000044241024,0.000048055947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024928243,0.00009579498,0.00019468795,0.00007874468,0.00004290572,0.00007651237,0.0004311697,0.000052447616,0.00011770441],"category_scores_gemma":[0.000030178724,0.00008154199,0.00005301647,0.0003543821,0.000022798738,0.0005490448,0.00009309049,0.00011557067,0.000031911317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046544374,0.00019020942,0.023604495,0.00001158188,0.00006006304,0.000024350227,0.000372633,0.07981492,0.00013434558,0.0780088,0.018138072,0.799594],"study_design_scores_gemma":[0.0008761348,0.000060666538,0.0024589787,0.0000369076,0.0000046420423,0.0000051930624,0.0000054790066,0.9943008,0.000030099498,0.0009910098,0.0011265796,0.00010355546],"about_ca_topic_score_codex":0.00003872667,"about_ca_topic_score_gemma":0.00009035186,"teacher_disagreement_score":0.9379003,"about_ca_system_score_codex":0.000017767932,"about_ca_system_score_gemma":0.0000062062495,"threshold_uncertainty_score":0.33251858},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.03939706469711466,"score_gpt":0.2974680440759093,"score_spread":0.25807097937879464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167027757","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08719252,0.000035548637,0.907381,0.0026220586,0.00016737463,0.000119402124,4.810273e-7,0.00013827442,0.0023433322],"genre_scores_gemma":[0.97091496,0.0000027528365,0.027818369,0.00072717515,0.000067812725,0.000005882773,2.8186153e-7,0.0000028187467,0.00045993555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991796,0.00005723192,0.0001932775,0.000210424,0.0001885135,0.00017097066],"domain_scores_gemma":[0.99952567,0.000037438196,0.00003889925,0.0003262377,0.000036469282,0.000035274614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048010965,0.00007037644,0.00008017356,0.000034261826,0.00008440475,0.000063119696,0.000360346,0.0000402077,0.000007575185],"category_scores_gemma":[0.000011942212,0.000047952104,0.00003477075,0.00025255827,0.000027158034,0.00025329072,0.000059214122,0.00011602921,0.000015012483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008840525,0.00008033379,0.00021243635,0.0000024877174,0.000006295312,0.0000051642937,0.00046430115,0.4397594,0.0004039253,0.36933815,0.00007634154,0.18964233],"study_design_scores_gemma":[0.00046672698,0.000011200345,0.0017291232,0.0000071818604,0.0000020321877,0.000008436706,0.00003090683,0.97470886,0.0000849539,0.022827009,0.000061555824,0.000062034705],"about_ca_topic_score_codex":0.00024117714,"about_ca_topic_score_gemma":0.00023697803,"teacher_disagreement_score":0.8837224,"about_ca_system_score_codex":0.00006761416,"about_ca_system_score_gemma":0.000105213876,"threshold_uncertainty_score":0.195543},"labels":[],"label_agreement":null},{"id":"W2167255513","doi":"10.1109/ccece.2002.1012993","title":"Performance analysis of multimedia applications in Differentiated Services networks","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Multimedia; Differentiated services; Computer network; Quality of service","score_opus":0.005120471821587452,"score_gpt":0.20183123831347885,"score_spread":0.1967107664918914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167255513","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29071096,0.00011535448,0.707155,0.000023238214,0.000044559394,0.000118991906,4.353865e-7,0.00006220495,0.0017693012],"genre_scores_gemma":[0.99574816,0.00003813593,0.003994607,0.00005445368,0.000006655278,0.00003316404,0.0000078768135,0.0000021829203,0.00011473295],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931157,0.00004141919,0.00021140292,0.00018876934,0.00009974014,0.00014710013],"domain_scores_gemma":[0.99945444,0.000084249004,0.00006752165,0.00030715406,0.000043936547,0.00004271079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000116871604,0.00007416437,0.00017856369,0.00019036648,0.00003216893,0.000021118785,0.00033512525,0.000040438415,0.00004705655],"category_scores_gemma":[0.0000017692884,0.000061399995,0.000054863896,0.0018309107,0.000015987915,0.00012468701,0.000025406596,0.00005848098,0.0000043480086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036511824,0.00018813368,0.5296504,0.000012277185,0.00027325356,4.5971385e-7,0.00027174014,0.27698135,0.000029045683,0.029197268,0.000015409516,0.16337705],"study_design_scores_gemma":[0.000160772,0.0000063002426,0.15231182,0.0000033083606,0.000047669088,9.68153e-8,0.000014778736,0.8472306,0.000026380876,0.000015592352,0.0001261019,0.000056582914],"about_ca_topic_score_codex":0.000018673902,"about_ca_topic_score_gemma":0.00017593421,"teacher_disagreement_score":0.70503724,"about_ca_system_score_codex":0.000008450107,"about_ca_system_score_gemma":0.000010929803,"threshold_uncertainty_score":0.25038192},"labels":[],"label_agreement":null},{"id":"W2167258973","doi":"10.1109/jsac.2007.070614","title":"Load-Balancing Data Traffic Among Inter-Domain Links","year":2007,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Regina","funders":"","keywords":"Computer science; Computer network; The Internet; Internet transit; Internet backbone; Network congestion; Internet traffic engineering; Service (business); Bandwidth (computing); Internet traffic; Network traffic control; Inter-domain; Internet exchange point; World Wide Web; Multicast","score_opus":0.034040660144077355,"score_gpt":0.29568975948427173,"score_spread":0.26164909934019437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167258973","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27967447,0.0010927974,0.706015,0.0068136295,0.0011672301,0.00035178568,0.00000794602,0.0003801136,0.0044970135],"genre_scores_gemma":[0.9767923,0.0003060351,0.02187695,0.0006354286,0.00025943422,0.000007704635,0.000015097873,0.000017712875,0.000089349385],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99751365,0.00044237296,0.00074597175,0.0003543786,0.00043964453,0.0005039764],"domain_scores_gemma":[0.9946157,0.0011396852,0.00033114373,0.0032641871,0.0004117746,0.0002375603],"candidate_categories":["open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.002638411,0.00020369094,0.0002612009,0.000349677,0.00047048202,0.00030646854,0.0064231185,0.00019192504,0.0000120861705],"category_scores_gemma":[0.0002589362,0.00019527797,0.00006369685,0.0014740493,0.00012164141,0.0006909009,0.000405849,0.0023594226,0.000039877803],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009525669,0.0010875969,0.008228793,0.000006677538,0.0001566848,0.00015713132,0.002368115,0.009105613,0.00038917435,0.0095770955,0.013269299,0.95555854],"study_design_scores_gemma":[0.0031057098,0.00032088798,0.042208597,0.0007454372,0.000041926756,0.00071142643,0.0003338661,0.8956483,0.000094428826,0.0017329854,0.054192938,0.0008634971],"about_ca_topic_score_codex":0.000015463573,"about_ca_topic_score_gemma":0.0017437211,"teacher_disagreement_score":0.95469505,"about_ca_system_score_codex":0.0003415589,"about_ca_system_score_gemma":0.00042679434,"threshold_uncertainty_score":0.9999422},"labels":[],"label_agreement":null},{"id":"W2167277557","doi":"10.1109/mascot.2002.1167058","title":"Network traffic behaviour in switched Ethernet systems","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; University of Toronto; Imperial College London","keywords":"Computer science; Server; Computer network; Queueing theory; Pareto distribution; File server; Mathematics","score_opus":0.012863593899115256,"score_gpt":0.21644272210513366,"score_spread":0.2035791282060184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167277557","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.268583,0.0032170832,0.69776803,0.0011428187,0.0030994143,0.00080266147,5.7006395e-7,0.00096168614,0.024424702],"genre_scores_gemma":[0.9947496,0.000008366801,0.002550952,0.00036698088,0.00009836683,0.000041196512,5.840401e-7,0.0000087732005,0.0021751833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986676,0.00013484091,0.00027181563,0.00033354634,0.00018633707,0.00040587227],"domain_scores_gemma":[0.9993289,0.000105578554,0.000054079388,0.00037936083,0.00003491958,0.00009712367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005901745,0.00013619551,0.00019418888,0.00005066096,0.000050562274,0.00013523526,0.00043631392,0.000091520385,0.000037194422],"category_scores_gemma":[0.000013472266,0.000119302924,0.0000427924,0.00046944123,0.000015660316,0.00016082339,0.000025574658,0.00016366027,0.00011019333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060731218,0.00011185398,0.0058233985,0.0000049269765,0.000012262132,0.000050020055,0.0002562063,0.38054848,0.0000079184965,0.55186194,0.0085899765,0.05272695],"study_design_scores_gemma":[0.0015221809,0.0000915786,0.0031979932,0.00004687856,0.000009779209,0.000053640204,0.00012596068,0.97991145,0.000009142292,0.00095939264,0.0135974875,0.00047452765],"about_ca_topic_score_codex":0.000025682446,"about_ca_topic_score_gemma":0.00009470311,"teacher_disagreement_score":0.7261666,"about_ca_system_score_codex":0.00003379862,"about_ca_system_score_gemma":0.00007187637,"threshold_uncertainty_score":0.4865032},"labels":[],"label_agreement":null},{"id":"W2167391141","doi":"10.1109/have.2002.1106910","title":"QoS support of collaborative virtual environments applications in multiservice wireless networks through pricing","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Quality of service; Computer science; Computer network; Mobile QoS; Wireless network; Wireless; Distributed computing; Service (business); Service provider; Telecommunications","score_opus":0.006667383749251097,"score_gpt":0.2202958327591303,"score_spread":0.2136284490098792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167391141","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008402877,0.00008121084,0.9858788,0.00012439721,0.00012416102,0.0004437378,0.0000014313748,0.000043306423,0.0049000657],"genre_scores_gemma":[0.9861878,0.000057047677,0.012553018,0.0004238541,0.000028354556,0.000111484784,0.0000039926394,0.0000070463807,0.00062736165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988741,0.000098548626,0.00030784853,0.00031246676,0.00017736251,0.00022963445],"domain_scores_gemma":[0.9992827,0.00015737675,0.00011865745,0.0003502287,0.000038063263,0.000052965417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017522379,0.00012507867,0.00019236344,0.000038229933,0.00006552797,0.00002601508,0.0003827954,0.00006628072,0.000036693677],"category_scores_gemma":[0.0000057337866,0.000116539784,0.000029139559,0.0006608707,0.00004473773,0.0003066809,0.0000589838,0.000107355685,0.000016470305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010380519,0.00037787,0.0047233454,0.0000065025424,0.000036598118,0.0000054062357,0.0017826805,0.104315825,0.00028483817,0.8150674,0.0005481979,0.07284092],"study_design_scores_gemma":[0.0036808702,0.0002999641,0.0056810244,0.00004222972,0.000024413099,0.0000075183493,0.001792902,0.89222586,0.0034317167,0.0009996201,0.09104067,0.00077319745],"about_ca_topic_score_codex":0.000015993157,"about_ca_topic_score_gemma":0.000058511214,"teacher_disagreement_score":0.977785,"about_ca_system_score_codex":0.00003776761,"about_ca_system_score_gemma":0.00006911437,"threshold_uncertainty_score":0.47523543},"labels":[],"label_agreement":null},{"id":"W2167432975","doi":"10.1109/tce.2005.1405699","title":"Performance assessment of IP traffic over ATSC interactive datacasting systems","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Consumer Electronics","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Digital television; Testbed; Computer science; Broadcasting (networking); Channel (broadcasting); Digital Video Broadcasting; Data transmission; Computer network; Transmission (telecommunications); Telecommunications","score_opus":0.01183851423527596,"score_gpt":0.2589387263907209,"score_spread":0.24710021215544495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167432975","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1378813,0.00065782503,0.85960895,0.00019897697,0.0007173792,0.0003047314,0.000012762403,0.00020109108,0.00041696447],"genre_scores_gemma":[0.996106,0.00051035854,0.0028194934,0.000106798885,0.00006556205,0.00006983233,0.0000024561386,0.000019462905,0.00030001855],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980802,0.0001185379,0.000471609,0.00045299155,0.00038688423,0.00048980233],"domain_scores_gemma":[0.9986634,0.00030762437,0.00020921716,0.0005727705,0.00014286232,0.00010407098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030723613,0.0002440137,0.000310144,0.00018078476,0.00021156656,0.00009835442,0.0005822109,0.00009633547,0.000039805913],"category_scores_gemma":[0.000002814595,0.00024227296,0.00011725051,0.00041330562,0.000076639066,0.00074842805,0.000004037612,0.00059934147,0.000034892488],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025726187,0.00019651208,0.000022905602,0.000017543329,0.00012262017,0.000001360995,0.00009623843,0.37947854,0.00023985175,0.0011700104,0.000118018404,0.61851066],"study_design_scores_gemma":[0.00078157056,0.00024713587,0.00011038079,0.00007803483,0.000058727765,0.000033333472,0.000018236946,0.9890834,0.0011097554,0.0000022199222,0.008238564,0.00023863318],"about_ca_topic_score_codex":0.0000063662924,"about_ca_topic_score_gemma":0.000035946985,"teacher_disagreement_score":0.85822475,"about_ca_system_score_codex":0.00026016333,"about_ca_system_score_gemma":0.0003900948,"threshold_uncertainty_score":0.98796046},"labels":[],"label_agreement":null},{"id":"W2167467046","doi":"10.1109/ccece.2004.1347741","title":"End-to-end rate control for networks with random access links","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Random access; Computer science; Computer network; Point-to-point; Point (geometry); Network congestion; Control (management); Access control; Scheme (mathematics); Point process; Mathematics; Artificial intelligence; Statistics","score_opus":0.010710462941127775,"score_gpt":0.23749522033114462,"score_spread":0.22678475739001686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167467046","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009207969,0.000109708584,0.9883071,0.007071157,0.00066002394,0.0010496351,0.0000024645726,0.00034928787,0.0015298196],"genre_scores_gemma":[0.97043777,0.000008787435,0.018295327,0.009609346,0.00063378713,0.00029292447,0.0000031228606,0.000016186306,0.00070275227],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998527,0.000057580295,0.00025159327,0.00048866146,0.00018204264,0.00049310876],"domain_scores_gemma":[0.99846643,0.00049165735,0.00008152311,0.0004448836,0.00027780505,0.00023767627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047605787,0.0002073079,0.00031244993,0.000070552094,0.00018449829,0.00046275294,0.0009839333,0.0001249288,0.000038550465],"category_scores_gemma":[0.000043691132,0.00014775002,0.000093851435,0.00035712981,0.000041063,0.00046335495,0.00007622613,0.00021242115,0.00002963631],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063654396,0.000055621433,0.000103496066,0.0000041850344,0.000084515246,0.000012124443,0.000051475192,0.7276945,0.000009978519,0.091600075,0.003491812,0.17625567],"study_design_scores_gemma":[0.028153887,0.0005011051,0.0006334577,0.00004841915,0.000054762226,0.000011016037,0.00000866453,0.9457674,0.00011917507,0.0022347388,0.021978593,0.0004887906],"about_ca_topic_score_codex":0.000026037558,"about_ca_topic_score_gemma":0.00013945502,"teacher_disagreement_score":0.9700118,"about_ca_system_score_codex":0.000038454527,"about_ca_system_score_gemma":0.00014585334,"threshold_uncertainty_score":0.60250705},"labels":[],"label_agreement":null},{"id":"W2167604529","doi":"10.1109/glocom.1990.116731","title":"Traffic experimentation in ATM testbed","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Testbed; Computer science; Asynchronous Transfer Mode; Asynchronous communication; Generator (circuit theory); Range (aeronautics); Sample (material); Computer network; Engineering","score_opus":0.018317709557858226,"score_gpt":0.21629642222834475,"score_spread":0.19797871267048653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167604529","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44587448,0.0012702998,0.48866564,0.007969083,0.0008122991,0.00046772437,2.660132e-7,0.0010637268,0.05387647],"genre_scores_gemma":[0.9911925,0.000011733508,0.0066711972,0.0005396147,0.00003643055,0.000020951957,2.997973e-7,0.0000026508092,0.001524606],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994324,0.000028517132,0.00012256492,0.0001750869,0.000100660516,0.00014078667],"domain_scores_gemma":[0.99971765,0.00004645941,0.000019284655,0.00016426729,0.000013285529,0.000039066796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006296179,0.000059095524,0.0000647805,0.000048985894,0.00002737135,0.000054063847,0.00022193058,0.00002480861,0.00026073807],"category_scores_gemma":[0.0000054374373,0.000053601623,0.000020666563,0.00024342012,0.000010452229,0.00023661528,0.000018339884,0.000045557546,0.00024966543],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012324296,0.00008322658,0.00014114068,6.769612e-7,0.00000225411,0.000009006556,0.0006579234,0.0033629069,0.00010486113,0.022643765,0.0036904719,0.96930254],"study_design_scores_gemma":[0.0005411462,0.00003182821,0.0005132074,0.00000359483,6.5432744e-7,0.000003834018,0.000039781575,0.9966213,0.00011097076,0.00007005009,0.0019786553,0.000084967935],"about_ca_topic_score_codex":0.0000035516857,"about_ca_topic_score_gemma":0.000013729746,"teacher_disagreement_score":0.9932584,"about_ca_system_score_codex":0.000020156633,"about_ca_system_score_gemma":0.0000054299257,"threshold_uncertainty_score":0.32090273},"labels":[],"label_agreement":null},{"id":"W2167612183","doi":"10.1109/cnsr.2006.24","title":"Combining Petri Nets and ns-2: A Hybrid Method for Analysis and Simulation","year":2006,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Petri net; Computer science; Correctness; Sack; Distributed computing; Protocol (science); Synchronization (alternating current); Communications protocol; Process architecture; Stochastic Petri net; Petri dish; Computer network; Programming language; Engineering","score_opus":0.012090409448871277,"score_gpt":0.27446059990889954,"score_spread":0.26237019046002824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167612183","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016602889,0.00016726571,0.98185426,0.000626546,0.000040690822,0.00011570614,9.3200833e-7,0.000089276495,0.0005024418],"genre_scores_gemma":[0.8222206,0.0000025719482,0.17718221,0.00021433123,0.000031664058,0.000007682786,0.000003095556,0.00000235279,0.00033544045],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993783,0.000038398855,0.00013286786,0.00024630397,0.000078696474,0.00012541751],"domain_scores_gemma":[0.9991779,0.000556907,0.000046742614,0.00012547128,0.000051272382,0.000041758107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002720094,0.00007079047,0.0001446199,0.00011451253,0.00010035489,0.00014154306,0.00008422592,0.000020001611,0.0000039740576],"category_scores_gemma":[0.000015525164,0.00006276432,0.000041263724,0.00028763703,0.000012551428,0.00015919261,0.000036173846,0.000029868088,6.511917e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010122046,0.00001923382,0.002894475,0.0000038896324,0.000086230175,0.0000017553662,0.000042528365,0.16704899,0.000030998355,0.055225134,0.00030305632,0.7743336],"study_design_scores_gemma":[0.00049327227,0.00003217655,0.0048626284,0.000001654311,0.00008074956,0.0000023798113,0.000003960621,0.98995584,0.00003272614,0.002957576,0.0014951128,0.00008194206],"about_ca_topic_score_codex":0.00004971088,"about_ca_topic_score_gemma":0.000041470325,"teacher_disagreement_score":0.82290685,"about_ca_system_score_codex":0.000005372825,"about_ca_system_score_gemma":0.000008822193,"threshold_uncertainty_score":0.25594547},"labels":[],"label_agreement":null},{"id":"W2167718892","doi":"10.1145/1180639.1180715","title":"Scalable streaming for heterogeneous clients","year":2006,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; University of Calgary","funders":"","keywords":"Computer science; Scalability; Bandwidth (computing); Protocol (science); Computer network; Atomic broadcast; Quality of service; Distributed computing; Population; Broadcasting (networking); Database","score_opus":0.008603009662880717,"score_gpt":0.2157076407197563,"score_spread":0.20710463105687557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167718892","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017721375,0.0000945882,0.9745357,0.00031359764,0.0002708983,0.00015277432,9.949351e-7,0.00023336643,0.006676725],"genre_scores_gemma":[0.96330637,0.0000012818236,0.031136861,0.00028511012,0.00014487958,0.000029127694,0.0000024520218,0.000004555502,0.0050893733],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993533,0.0000098056225,0.00011978766,0.00020909113,0.00009143982,0.00021656869],"domain_scores_gemma":[0.9996293,0.00006108685,0.000027852573,0.00020086694,0.00004347047,0.000037390357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007278082,0.00006756761,0.00007487198,0.000025303063,0.00009119531,0.00009502533,0.00027832662,0.000028063801,0.000015168336],"category_scores_gemma":[0.0000035816317,0.000058881873,0.000049357335,0.00008669961,0.00001012452,0.00012229,0.00003694951,0.000023209563,0.000040280964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006754036,0.00008624618,0.00071751827,0.0000045401653,0.000010822432,0.0000048373304,0.000010581058,0.0129445875,0.00013493649,0.21345083,0.010711837,0.7619165],"study_design_scores_gemma":[0.00065038685,0.00006222018,0.00028806424,0.0000052877335,0.0000046411706,0.000008682756,0.0000021763724,0.95746154,0.0008362137,0.004539976,0.03599643,0.00014438892],"about_ca_topic_score_codex":0.00001927632,"about_ca_topic_score_gemma":0.000026024978,"teacher_disagreement_score":0.94558495,"about_ca_system_score_codex":0.000012977172,"about_ca_system_score_gemma":0.000016066268,"threshold_uncertainty_score":0.24011332},"labels":[],"label_agreement":null},{"id":"W2167808311","doi":"10.1109/tim.2009.2031383","title":"Online Packet Loss Measurement and Estimation for VPN-Based Services","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Instrumentation and Measurement","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Packet loss; Computer science; Estimator; Quality of service; Jitter; Network packet; Computer network; Bandwidth (computing); Processing delay; Transmission delay; Real-time computing; Private network; End-to-end delay; Control theory (sociology); Control (management); Telecommunications; Mathematics","score_opus":0.02957310333232471,"score_gpt":0.2517531762714898,"score_spread":0.22218007293916509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167808311","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02527636,0.00009577127,0.9692381,0.0042769606,0.00033937232,0.00059571024,0.000013331485,0.00013447992,0.00002991283],"genre_scores_gemma":[0.97740155,0.00004522114,0.020581583,0.0018325312,0.000027999735,0.000087102286,0.0000058220658,0.0000065336276,0.000011635684],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985315,0.000049752955,0.00027253566,0.00034314508,0.00061180786,0.00019124692],"domain_scores_gemma":[0.9993135,0.000024112356,0.00009431967,0.00018033976,0.00026078036,0.00012694749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004572897,0.00017519669,0.00014638048,0.0001222386,0.00028365685,0.00014699392,0.00011790451,0.00005246482,0.0000054797774],"category_scores_gemma":[0.0000031356933,0.0001680636,0.000049959348,0.00013481488,0.00002650207,0.0003036057,6.9943366e-7,0.00008206907,0.0000024184685],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008193797,0.00030155334,0.000010322311,0.00003819292,0.000030743417,4.7400803e-7,0.00020281952,0.009128127,0.0010319107,0.00086943596,0.000035157318,0.9882693],"study_design_scores_gemma":[0.005665017,0.0010233674,0.00243437,0.0002234077,0.00011068938,0.000008428957,0.00015227952,0.9737771,0.013929872,0.0011821605,0.0011080571,0.0003852546],"about_ca_topic_score_codex":0.000008358103,"about_ca_topic_score_gemma":0.000091811606,"teacher_disagreement_score":0.98788404,"about_ca_system_score_codex":0.00013156733,"about_ca_system_score_gemma":0.000078376615,"threshold_uncertainty_score":0.6853435},"labels":[],"label_agreement":null},{"id":"W2168041989","doi":"10.1109/ccece.2002.1012965","title":"Agent-based routing algorithms on a LAN","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Routing (electronic design automation); Reinforcement; Algorithm; Reinforcement learning; Computer network; Link-state routing protocol; Interior gateway protocol; Routing protocol; Distributed computing; Artificial intelligence; Engineering","score_opus":0.016586952745523263,"score_gpt":0.2276864988345727,"score_spread":0.21109954608904943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168041989","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001373263,0.000022361452,0.95494473,0.0009425155,0.00033485147,0.00007069303,1.8424163e-7,0.00028164327,0.042029742],"genre_scores_gemma":[0.9622036,6.30519e-7,0.03300549,0.002881606,0.00004835684,0.000008355704,4.4405803e-7,0.000004172103,0.001847305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923533,0.00006124287,0.00010006245,0.00021965413,0.0001513132,0.00023241114],"domain_scores_gemma":[0.99951124,0.00009139789,0.000027493074,0.00027211895,0.000025388837,0.000072342285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002235719,0.00007906583,0.00007485483,0.00003368809,0.00009155022,0.00008280985,0.00024828818,0.000028588489,0.00006789608],"category_scores_gemma":[0.000023929968,0.00006473749,0.00004218619,0.00016712563,0.000009723979,0.00006521815,0.00001409019,0.00007200641,0.00023455969],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001919049,0.000047967613,0.00016886693,8.499409e-7,0.0000061139876,0.000014467072,0.000031764263,0.0027762025,0.00001321024,0.5665527,0.0018675397,0.4285184],"study_design_scores_gemma":[0.0006799177,0.00008344394,0.00018228676,0.00001031907,0.0000027318308,0.000003817489,0.000013349481,0.972656,0.000447472,0.0004542283,0.025311366,0.00015504184],"about_ca_topic_score_codex":0.0000038690923,"about_ca_topic_score_gemma":0.0000033991994,"teacher_disagreement_score":0.9698798,"about_ca_system_score_codex":0.00001699777,"about_ca_system_score_gemma":0.000047537866,"threshold_uncertainty_score":0.30148685},"labels":[],"label_agreement":null},{"id":"W2168327177","doi":"10.1109/ccece.2004.1347585","title":"An approach to solving a multicasting scalability issue in MPLS networks using state encoding","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Multicast; Computer science; Computer network; Router; Protocol Independent Multicast; Source-specific multicast; Xcast; Pragmatic General Multicast; Distance Vector Multicast Routing Protocol; IP multicast; Distributed computing; Tree (set theory)","score_opus":0.02326791408146282,"score_gpt":0.2678657886016286,"score_spread":0.24459787452016576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168327177","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19873367,0.000027335982,0.7994521,0.00017791035,0.00016229512,0.00026600325,2.0091676e-7,0.00021041415,0.0009700621],"genre_scores_gemma":[0.71068746,9.645006e-7,0.28881755,0.00035378474,0.00010553807,0.000011994708,4.2261163e-7,0.000007936343,0.000014340623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981035,0.000112273054,0.0003702868,0.00063398964,0.00020500565,0.0005749681],"domain_scores_gemma":[0.9990356,0.000112661044,0.00005836368,0.0004818459,0.000073305935,0.0002382401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087173574,0.00017483214,0.00022637831,0.00011763463,0.0001653471,0.00028692684,0.0006049603,0.00006113012,0.0000057409857],"category_scores_gemma":[0.00006328117,0.00016746162,0.00004122397,0.0007155992,0.000030812877,0.00065788213,0.0001634102,0.00021801512,0.000009956783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053970584,0.00010554978,0.0012364578,0.000004407843,0.0000030989042,0.0000056745675,0.00090916257,0.8555978,0.00023681736,0.0031015538,0.0000026243033,0.13879146],"study_design_scores_gemma":[0.00048323945,0.000033103268,0.0015424354,0.000043828437,0.0000024958124,0.000009655426,0.000105588166,0.9971358,0.00005399126,0.00035438215,0.000019892163,0.00021555486],"about_ca_topic_score_codex":0.00027541802,"about_ca_topic_score_gemma":0.00008889749,"teacher_disagreement_score":0.5119538,"about_ca_system_score_codex":0.00016519392,"about_ca_system_score_gemma":0.00008406983,"threshold_uncertainty_score":0.6828887},"labels":[],"label_agreement":null},{"id":"W2168491483","doi":"10.1109/mascot.2001.948877","title":"Service guarantees in deflection networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Computer network; Network packet; Quality of service; Scalability; Bandwidth (computing); Admission control; Distributed computing; Operating system","score_opus":0.015303308167995381,"score_gpt":0.19566494805863222,"score_spread":0.18036163989063683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168491483","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008700635,0.000525497,0.968099,0.0041579786,0.0003850517,0.00008984349,3.2671963e-8,0.0002973282,0.017744632],"genre_scores_gemma":[0.9939473,0.00005390831,0.002579016,0.0025732964,0.00009041291,0.000011204952,1.7186713e-7,0.0000031524617,0.0007415164],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937284,0.000035433677,0.00012438365,0.0001909398,0.000087262335,0.00018913415],"domain_scores_gemma":[0.9996682,0.000048218437,0.000021604534,0.00019991353,0.000027748552,0.00003431282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009449223,0.000068185785,0.00007645366,0.00005413312,0.00004270258,0.00006706381,0.00029470536,0.000044647586,0.00013381727],"category_scores_gemma":[0.0000034372597,0.00006153131,0.000021497737,0.0005881773,0.0000059482595,0.00024836155,0.000036303612,0.00009602167,0.00016013057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028431066,0.00005426757,0.0009807352,0.0000017474295,0.0000047126127,0.000009434639,0.00017621074,0.0453973,0.000010133227,0.035129737,0.005266175,0.9129667],"study_design_scores_gemma":[0.0002742251,0.000015809686,0.0011356125,0.000006613631,9.753405e-7,0.000009007719,0.000008769935,0.99508274,0.000004460002,0.0002967936,0.0030862128,0.00007875388],"about_ca_topic_score_codex":0.00006380628,"about_ca_topic_score_gemma":0.0008018392,"teacher_disagreement_score":0.98524666,"about_ca_system_score_codex":0.000016586959,"about_ca_system_score_gemma":0.0000036688295,"threshold_uncertainty_score":0.2509174},"labels":[],"label_agreement":null},{"id":"W2168597056","doi":"10.1155/2010/253495","title":"On the QoS of IPTV and Its Effects on Home Networks","year":2010,"lang":"en","type":"article","venue":"International Journal of Digital Multimedia Broadcasting","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"IPTV; Computer science; Quality of service; Computer network; Internet Protocol; The Internet; Queueing theory; World Wide Web","score_opus":0.007883063703055882,"score_gpt":0.22474076540476684,"score_spread":0.21685770170171095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168597056","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9601923,0.00013929496,0.03133607,0.002220247,0.005164258,0.000121918856,0.0000040006817,0.000024829991,0.00079706963],"genre_scores_gemma":[0.99776477,0.000009154199,0.0007800423,0.00026765635,0.0011357056,0.0000021243582,6.302144e-7,0.000007364402,0.00003256933],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988057,0.00003158155,0.00034633392,0.0001351279,0.0005369632,0.00014429177],"domain_scores_gemma":[0.9963045,0.002698241,0.00039923997,0.00011560666,0.00038496082,0.0000974302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029354513,0.000119308264,0.000158572,0.00012015673,0.00004462289,0.00023055685,0.0007700246,0.000051409672,0.00000740052],"category_scores_gemma":[0.0009973553,0.000079070946,0.00008813103,0.000096122254,0.000044152723,0.00045854843,0.000104425446,0.00044369904,0.000008450647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008544671,0.00009210559,0.0008780365,0.0000037314433,0.00010501901,0.000071772716,0.00016597414,0.003270913,0.00077544403,0.01632836,0.00028270102,0.9779405],"study_design_scores_gemma":[0.001671176,0.0004880744,0.004995389,0.00038356084,0.000013731211,0.00027989864,0.000016582113,0.9887151,0.0012459059,0.0014759639,0.0005297403,0.00018485318],"about_ca_topic_score_codex":4.8349483e-7,"about_ca_topic_score_gemma":5.1235673e-7,"teacher_disagreement_score":0.9854442,"about_ca_system_score_codex":0.000014580582,"about_ca_system_score_gemma":0.000038037142,"threshold_uncertainty_score":0.32244194},"labels":[],"label_agreement":null},{"id":"W2168606625","doi":"10.1109/icc.1997.595075","title":"Moments of the first passage time to overload for a buffered statistical multiplexer","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Multiplexer; Information overload; Moment (physics); Computer science; Eigenvalues and eigenvectors; Ordinary differential equation; Set (abstract data type); Multiplexing; Broadband; Algorithm; Mathematics; Telecommunications; Differential equation; Physics; Mathematical analysis","score_opus":0.011647133215805213,"score_gpt":0.20241715503861768,"score_spread":0.19077002182281247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168606625","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018218303,0.000025763033,0.98373234,0.008860962,0.00020879369,0.0006819286,0.000029438419,0.00009094867,0.0045479746],"genre_scores_gemma":[0.9584652,0.0000011267358,0.0207331,0.0016878081,0.00004771784,0.00007743819,7.276797e-7,0.000006256975,0.018980587],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992535,0.000020578294,0.00016052042,0.00019588065,0.00018008659,0.00018941573],"domain_scores_gemma":[0.9992594,0.00025256872,0.000036371177,0.00033110363,0.000051066887,0.00006946965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008150671,0.00007971236,0.00011996806,0.000019842506,0.00007564335,0.000036558115,0.000491902,0.000029368393,0.0005398444],"category_scores_gemma":[0.00005222199,0.000052091244,0.000052861,0.00013621603,0.000022943757,0.000065408305,0.00010364199,0.00003756791,0.00025289942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040400817,0.00031177083,0.0004009838,0.000018226516,0.00006143623,0.000002318768,0.0005153836,0.0012643925,0.00028199083,0.08794028,0.44770145,0.46146137],"study_design_scores_gemma":[0.000830413,0.00009432381,0.001860748,0.000013077809,0.0000072244816,0.000001076895,0.0000029669416,0.9360573,0.00009709669,0.00039227758,0.060541436,0.00010202502],"about_ca_topic_score_codex":0.0000053740214,"about_ca_topic_score_gemma":0.0000094372945,"teacher_disagreement_score":0.9629993,"about_ca_system_score_codex":0.000016286787,"about_ca_system_score_gemma":0.000008249373,"threshold_uncertainty_score":0.59109175},"labels":[],"label_agreement":null},{"id":"W2168620680","doi":"10.1109/tbc.2009.2019430","title":"Reactive Estimation of Packet Loss Probability for IP-Based Video Services","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Broadcasting","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Packet loss; Computer network; Network packet; Quality of service; Estimator; Processing delay; Real-time computing; Transmission delay","score_opus":0.015719129232559522,"score_gpt":0.24776385943928278,"score_spread":0.23204473020672325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168620680","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043251637,0.000018945935,0.9548495,0.0008015531,0.00025294826,0.0004993366,0.000014559889,0.00022280637,0.00008872842],"genre_scores_gemma":[0.91830796,9.876028e-7,0.081349686,0.00021603417,0.000035093206,0.00005948427,0.0000023577425,0.000007092504,0.000021289787],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987356,0.00006770314,0.00034504017,0.00038398406,0.00022318757,0.00024445928],"domain_scores_gemma":[0.99868286,0.00048193286,0.00018830097,0.0003700004,0.00020282072,0.000074066054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003321434,0.00016271796,0.00021318998,0.00010533098,0.00020827046,0.000059663333,0.0003081162,0.000079120204,0.0000046485757],"category_scores_gemma":[0.000012180756,0.00016092484,0.00013339508,0.00034883528,0.00003872302,0.0004186972,8.3891024e-7,0.00014642318,0.000005204318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007728767,0.00016419265,0.0000056453177,0.000037345784,0.000011305195,7.4117133e-7,0.00016762744,0.37135488,0.00038651974,0.00071557146,0.0000046326795,0.62707424],"study_design_scores_gemma":[0.0008265881,0.0003495622,0.00021080773,0.00013156323,0.000028534796,0.0000046639543,0.000018230287,0.98065776,0.013961714,0.003610787,0.000043873817,0.0001558921],"about_ca_topic_score_codex":0.000011715631,"about_ca_topic_score_gemma":0.000011531021,"teacher_disagreement_score":0.8750563,"about_ca_system_score_codex":0.000059260597,"about_ca_system_score_gemma":0.000085382766,"threshold_uncertainty_score":0.6562324},"labels":[],"label_agreement":null},{"id":"W2168735472","doi":"10.1109/vtcf.2006.508","title":"HPMRSVP-TE: A Hierarchical Proxy Mobile Resource reSerVation Protocol for Traffic Engineering","year":2006,"lang":"en","type":"article","venue":"IEEE Vehicular Technology Conference","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Computer network; Resource Reservation Protocol; Multiprotocol Label Switching; Scalability; Reservation; Label Distribution Protocol; IPv6; Protocol (science); Distributed computing; Internet Protocol; Quality of service; Label switching; The Internet; Operating system","score_opus":0.01198218401611914,"score_gpt":0.243818674324343,"score_spread":0.23183649030822387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168735472","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05741767,0.00003745915,0.8755315,0.003817925,0.00013352846,0.060852714,0.0000035981823,0.0020742237,0.00013140452],"genre_scores_gemma":[0.70643145,5.50085e-7,0.019905496,0.00010288343,0.00015221235,0.2731454,0.000006175922,0.00002191767,0.00023390003],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980114,0.00005051695,0.00042368757,0.00068826205,0.0002694602,0.00055663614],"domain_scores_gemma":[0.9986558,0.00012776408,0.00014474057,0.0007485188,0.0002534091,0.00006976732],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032629084,0.00026506212,0.0002933898,0.00032812334,0.00018405335,0.00014167611,0.0011831167,0.0004009642,0.0000064730966],"category_scores_gemma":[0.00006347977,0.0002548326,0.00009953847,0.00079947815,0.00014110687,0.00022660801,0.00010176228,0.00044224114,0.000018114784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000114561444,0.00037672574,0.00030243126,0.000141722,0.000051121493,0.000058429658,0.00008838645,0.090291925,0.009052492,0.40779242,0.004581434,0.48714837],"study_design_scores_gemma":[0.0013386748,0.0003454816,0.00006653591,0.00008805702,0.000008331385,0.00002846747,0.000010214461,0.84690124,0.004265194,0.0027695685,0.14387296,0.0003052545],"about_ca_topic_score_codex":0.000004553233,"about_ca_topic_score_gemma":0.000013240346,"teacher_disagreement_score":0.855626,"about_ca_system_score_codex":0.000055014934,"about_ca_system_score_gemma":0.00017299892,"threshold_uncertainty_score":0.9999904},"labels":[],"label_agreement":null},{"id":"W2168808556","doi":"10.1109/pacrim.1995.519418","title":"A new protocol for flow control in ATM networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Computer network; Network congestion; Flow control (data); Asynchronous Transfer Mode; Throughput; Protocol (science); Propagation delay; Transmission (telecommunications); Data transmission; Distributed computing; Telecommunications; Network packet; Wireless","score_opus":0.019984169179387275,"score_gpt":0.24628407816925882,"score_spread":0.22629990898987154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168808556","genre_codex":"methods","genre_gemma":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000013531047,0.000018232195,0.92242444,0.0028291033,0.00011967092,0.07120458,2.518602e-7,0.00018742816,0.0032149542],"genre_scores_gemma":[0.10517672,0.000002008933,0.21759214,0.0071551427,0.0011322636,0.6526317,8.0123135e-7,0.00002732661,0.016281905],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896824,0.0000376244,0.00023130252,0.00029948007,0.00011445963,0.00034891465],"domain_scores_gemma":[0.9993297,0.00016907587,0.000045561537,0.0002976744,0.00003445322,0.0001235506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016646559,0.00012238185,0.00017001163,0.00004494132,0.00005036486,0.000111751346,0.00046500072,0.00007120157,0.000266463],"category_scores_gemma":[0.000014294937,0.00010160413,0.000071418304,0.00023954343,0.000010026087,0.00021874138,0.000029533581,0.00009725828,0.000052171912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027157887,0.000045478766,0.00015463177,0.0000031280613,0.000007101458,0.0000038975277,0.000037898397,0.030667525,0.0000011353311,0.023439126,0.08663109,0.85898185],"study_design_scores_gemma":[0.0049611744,0.0000949009,0.00007695177,0.000013519526,0.0000017783829,0.000003006266,0.0000011575546,0.90511066,0.0000013520722,0.00059183285,0.08902321,0.00012044487],"about_ca_topic_score_codex":0.000009638423,"about_ca_topic_score_gemma":0.000057704765,"teacher_disagreement_score":0.8744432,"about_ca_system_score_codex":0.000022768063,"about_ca_system_score_gemma":0.000025502091,"threshold_uncertainty_score":0.41432962},"labels":[],"label_agreement":null},{"id":"W2168861763","doi":"10.1109/glocom.2005.1577804","title":"Recursive parameter estimation for the dynamic packet loss system","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Quality of service; Packet loss; Multiprotocol Label Switching; Network packet; Provisioning; Computer network; Key (lock); Real-time computing","score_opus":0.01887969627661919,"score_gpt":0.27474235134851516,"score_spread":0.255862655071896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168861763","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001747241,0.001195607,0.96624637,0.024164269,0.0010216027,0.0013959646,0.00017258133,0.0006198422,0.0034365016],"genre_scores_gemma":[0.85456914,0.00035899522,0.14282766,0.0009225657,0.00013757174,0.00060883997,0.00008099741,0.000017205704,0.00047702598],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970617,0.00034252042,0.0007793552,0.00062714604,0.00037850344,0.000810761],"domain_scores_gemma":[0.99495876,0.0010348201,0.00043744707,0.0027943628,0.00054453226,0.00023010233],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007118179,0.0004167457,0.00043103722,0.00009480316,0.0010120821,0.00061677705,0.0039535826,0.00022033261,0.000038496462],"category_scores_gemma":[0.00012024296,0.00034762826,0.00026027145,0.00063345785,0.00026286152,0.000720991,0.00027390354,0.00036616836,0.00037126685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027366641,0.00014780341,0.000041086427,0.000016257105,0.0001320487,0.0000017679048,0.00015195152,0.012389827,0.0000038203602,0.29571724,0.028632402,0.66273844],"study_design_scores_gemma":[0.0009245798,0.00007759825,0.0003845928,0.00007778959,0.00009090108,0.000109243876,0.00014531135,0.91939884,0.000015431136,0.00486115,0.07351489,0.00039966044],"about_ca_topic_score_codex":0.000057687354,"about_ca_topic_score_gemma":0.0008582247,"teacher_disagreement_score":0.907009,"about_ca_system_score_codex":0.00064224354,"about_ca_system_score_gemma":0.00044786042,"threshold_uncertainty_score":0.9998976},"labels":[],"label_agreement":null},{"id":"W2169552482","doi":"10.1109/infcom.1996.493360","title":"HOL-EDD: a flexible service scheduling scheme for ATM networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"HOL; Computer science; Scheduling (production processes); Scheme (mathematics); Distributed computing; Computer network; Mathematical optimization; Mathematics; Programming language","score_opus":0.03202787413447117,"score_gpt":0.23029430596919684,"score_spread":0.19826643183472567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169552482","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013783877,0.0008143759,0.9836706,0.0067636785,0.0004923407,0.00029378387,5.7200486e-7,0.00070349145,0.0058827843],"genre_scores_gemma":[0.6626661,0.00004629374,0.3219164,0.008493419,0.0006517003,0.00011886552,0.0000028464449,0.000020327783,0.00608406],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869955,0.000025053367,0.000226139,0.00042212423,0.00016550244,0.0004616589],"domain_scores_gemma":[0.99899507,0.00016644415,0.000064795844,0.00048277597,0.00014431268,0.0001466213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002163607,0.00016270403,0.00017823464,0.00004762707,0.00020499375,0.00021904566,0.000730829,0.00009874897,0.0001549464],"category_scores_gemma":[0.00001714887,0.00014871558,0.00009121687,0.000508387,0.000015884565,0.00039666085,0.000115390954,0.00013711571,0.00020835057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019631116,0.00014277865,0.00017838448,0.00002556554,0.00007350034,0.000006617929,0.00021013172,0.11285131,0.00009153671,0.23331997,0.026644621,0.62643594],"study_design_scores_gemma":[0.000738731,0.000044430046,0.00002571558,0.000017429167,0.0000069292205,0.0000073344886,0.00001217891,0.97331417,0.00003692314,0.00049511186,0.02510227,0.00019880755],"about_ca_topic_score_codex":0.0000072713374,"about_ca_topic_score_gemma":0.000015513502,"teacher_disagreement_score":0.86046284,"about_ca_system_score_codex":0.000021203567,"about_ca_system_score_gemma":0.000017530765,"threshold_uncertainty_score":0.60644454},"labels":[],"label_agreement":null},{"id":"W2169801072","doi":"10.1007/3-540-45551-5_29","title":"Indirect RSVP for Virtual Cluster Cellular Mobile IP 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":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer network; Datagram; Computer science; User Datagram Protocol; Resource Reservation Protocol; Network packet; Cellular network; Internet protocol suite; Operating system; The Internet","score_opus":0.00867380918393256,"score_gpt":0.21161498421916058,"score_spread":0.20294117503522802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169801072","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008304273,0.0012177962,0.9916189,0.0003816741,0.0035640597,0.0012421068,0.000008255174,0.00033238382,0.0015517895],"genre_scores_gemma":[0.7789682,0.00025995562,0.20343603,0.008174736,0.005608351,0.0003540243,0.000048374008,0.00017665609,0.002973663],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953522,0.00006074333,0.000692158,0.0019822998,0.0008275528,0.0010850467],"domain_scores_gemma":[0.99669033,0.0010419806,0.000297425,0.0014720503,0.00021991407,0.00027828946],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009879767,0.0007334939,0.0007881098,0.00059662736,0.00041063759,0.0007079492,0.003664171,0.0005993782,0.0000675672],"category_scores_gemma":[0.000028513328,0.0006834377,0.00030513966,0.00056241703,0.0005715456,0.0005275134,0.0006505921,0.00094221975,0.00006529767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016661597,0.000021414822,0.0000020547816,0.000006243344,0.000013236544,0.0000200565,0.00012741525,0.35562706,0.0000035059686,0.006621891,0.00013773718,0.6374027],"study_design_scores_gemma":[0.00065917236,0.0005005865,0.0000049955793,0.00020201609,0.000019668896,0.00002746749,8.8771195e-8,0.94483185,0.00009168491,0.027956234,0.024916165,0.0007900832],"about_ca_topic_score_codex":0.0000054510083,"about_ca_topic_score_gemma":0.000033893033,"teacher_disagreement_score":0.78818285,"about_ca_system_score_codex":0.00022188509,"about_ca_system_score_gemma":0.0004933982,"threshold_uncertainty_score":0.99956167},"labels":[],"label_agreement":null},{"id":"W2169868632","doi":"10.1109/ccece.2000.849548","title":"Performance testing methodologies for ATM traffic management mechanisms","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Asynchronous Transfer Mode; Quality of service; Computer network; Scheduling (production processes); Asynchronous communication; Distributed computing; Credibility; Engineering","score_opus":0.10037136826754321,"score_gpt":0.26094246674822047,"score_spread":0.16057109848067724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169868632","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003068856,0.00008444071,0.98058826,0.0008963927,0.00035263982,0.00031960823,2.9367956e-7,0.0006972456,0.013992293],"genre_scores_gemma":[0.39235863,0.000020681466,0.6042793,0.00034512585,0.00003768598,0.00008337069,2.2907909e-7,0.000004783283,0.0028702233],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901944,0.000040063074,0.00017262934,0.00032040683,0.00013836572,0.0003090864],"domain_scores_gemma":[0.9991196,0.00041848986,0.00005089855,0.00030596493,0.000055182776,0.000049878243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000416127,0.00012043456,0.00013274701,0.000053112646,0.00017328012,0.000090360365,0.0005735888,0.00003768032,0.000037725702],"category_scores_gemma":[0.000035038007,0.00009972316,0.00005289847,0.00025604162,0.000016957749,0.0002309102,0.00009307527,0.00005403624,0.000069156384],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019764839,0.000014666108,0.0000040437576,0.00001316057,0.000014329526,0.0000019938702,0.000039800594,0.009795477,0.000025200223,0.07732065,0.0016611208,0.9111076],"study_design_scores_gemma":[0.00038289587,0.00013104279,0.000072090734,0.000011674929,0.000011046218,0.000007035659,0.000027360202,0.9948051,0.00012666968,0.0017914949,0.0024880518,0.00014554487],"about_ca_topic_score_codex":3.181905e-7,"about_ca_topic_score_gemma":6.4645803e-7,"teacher_disagreement_score":0.9850096,"about_ca_system_score_codex":0.000017196253,"about_ca_system_score_gemma":0.0000043216346,"threshold_uncertainty_score":0.40665925},"labels":[],"label_agreement":null},{"id":"W2169934285","doi":"10.1109/ccece.2005.1557307","title":"Rate-based congestion control for tree-based reliable multicast","year":2006,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Multicast; Source-specific multicast; Protocol Independent Multicast; Computer science; Computer network; Xcast; Pragmatic General Multicast; Reliable multicast; Distance Vector Multicast Routing Protocol; IP multicast; Distributed computing; Network congestion; Inter-domain; Retransmission; Tree (set theory); Network packet; Mathematics","score_opus":0.008426225393122246,"score_gpt":0.21124405962633688,"score_spread":0.20281783423321464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169934285","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012732481,0.00007054534,0.9876327,0.006745906,0.000407798,0.0006937975,0.0000074149652,0.00058326975,0.0025853065],"genre_scores_gemma":[0.9454107,4.0665424e-7,0.049985204,0.0026390897,0.00020317706,0.00023592159,0.000020058833,0.000014763786,0.0014906449],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985445,0.000078953686,0.0003186186,0.00045534698,0.00018322185,0.00041935997],"domain_scores_gemma":[0.99835634,0.0007401094,0.00010409493,0.00044231716,0.0002541216,0.00010302975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004654939,0.00019686278,0.00023927199,0.000091641596,0.00017507185,0.00019231548,0.00041875127,0.00010184768,0.000052447882],"category_scores_gemma":[0.00005002548,0.0001722537,0.0001345329,0.00023108881,0.00005421889,0.0002036985,0.00001193605,0.00008763907,0.00006868543],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004138124,0.0004929458,0.0012880095,0.000031283653,0.000030248928,0.000014791374,0.000007128831,0.43497464,0.0013939008,0.2914648,0.02839721,0.24149121],"study_design_scores_gemma":[0.006832543,0.00017119962,0.001564713,0.000012353336,0.000022875134,6.897464e-7,0.0000016396092,0.9734644,0.0010717256,0.00077645475,0.015851073,0.00023030267],"about_ca_topic_score_codex":0.00006275661,"about_ca_topic_score_gemma":0.00009969737,"teacher_disagreement_score":0.9441375,"about_ca_system_score_codex":0.000048942096,"about_ca_system_score_gemma":0.00017672734,"threshold_uncertainty_score":0.7024302},"labels":[],"label_agreement":null},{"id":"W2170014687","doi":"10.1109/aina.2003.1192929","title":"A packet scheduling scheme for satisfying intra and inter-stream loss requirements in video communication","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Packet loss; Computer network; Scheduling (production processes); Router; Quality of service; Network packet; Real-time computing; Engineering","score_opus":0.024885233550186747,"score_gpt":0.27228791025149585,"score_spread":0.2474026767013091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170014687","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12223809,0.00045281881,0.87421554,0.0013711774,0.00009383489,0.00030896429,5.6193034e-7,0.00009017251,0.0012288115],"genre_scores_gemma":[0.79386365,0.00005530129,0.20561138,0.00033587852,0.000011527533,0.00005032581,0.0000016745316,0.000004788168,0.000065499975],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991215,0.00008450643,0.00024401833,0.00025121,0.000086853855,0.00021193088],"domain_scores_gemma":[0.99926436,0.00019352658,0.00006493299,0.00036299622,0.000055913344,0.000058301022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005420807,0.000099724624,0.0001294236,0.00006793699,0.00009451793,0.00013714559,0.00029573063,0.000048152204,0.0000101146825],"category_scores_gemma":[0.00010262931,0.00009628352,0.000024701114,0.0001758054,0.000037257134,0.00041417836,0.00008137189,0.000099557925,0.0000045788347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015866934,0.00006787854,0.01572655,0.000020789405,0.000022447726,0.0000021784479,0.0005232148,0.00014844732,0.00025553975,0.41290584,0.00022671257,0.5700845],"study_design_scores_gemma":[0.004045912,0.0001447174,0.001906837,0.00030159618,0.000011629224,0.000021619611,0.00034504323,0.9634632,0.00085862103,0.022535581,0.005902062,0.0004631775],"about_ca_topic_score_codex":0.000013550258,"about_ca_topic_score_gemma":0.00009816408,"teacher_disagreement_score":0.9633148,"about_ca_system_score_codex":0.000036273417,"about_ca_system_score_gemma":0.000036335703,"threshold_uncertainty_score":0.3926328},"labels":[],"label_agreement":null},{"id":"W2170392617","doi":"10.1109/ccece.1997.608302","title":"Design and analysis of an ABR flow control protocol","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Flow control (data); Asynchronous Transfer Mode; Protocol (science); Bandwidth (computing); Distributed computing","score_opus":0.01786018377391012,"score_gpt":0.23688044033663427,"score_spread":0.21902025656272414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170392617","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003019745,0.00001301806,0.98842925,0.00026082643,0.000016407887,0.010110278,5.9209265e-7,0.000094512805,0.0007731477],"genre_scores_gemma":[0.8164554,0.0000016591727,0.1689703,0.00057372206,0.00003288896,0.013389677,5.092493e-7,0.0000050844583,0.0005707079],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999194,0.00011603947,0.0001799963,0.00023044397,0.00014313654,0.00013636476],"domain_scores_gemma":[0.9993526,0.000118139054,0.000059472455,0.000317998,0.000063839914,0.00008795127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024195961,0.00008035053,0.00020945597,0.00012504736,0.000043949894,0.00006118613,0.00027640336,0.0000351499,0.00021074984],"category_scores_gemma":[0.000007540316,0.00006292202,0.00004874507,0.0005189169,0.00003104033,0.00023677047,0.000020268708,0.000040631654,0.000007679957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019938068,0.000110371075,0.00027172852,0.000003322529,0.00025735382,0.000004806298,0.00016384902,0.056350388,0.00006948332,0.006609377,0.00045568647,0.93568367],"study_design_scores_gemma":[0.0009091668,0.00013321929,0.00069364294,0.0000017908264,0.0000843967,0.0000015494916,0.0000024242165,0.99740595,0.000042159576,0.0001008174,0.0005471712,0.000077695],"about_ca_topic_score_codex":0.0000038284516,"about_ca_topic_score_gemma":0.0000048166803,"teacher_disagreement_score":0.9410556,"about_ca_system_score_codex":0.0000047774893,"about_ca_system_score_gemma":0.000008715252,"threshold_uncertainty_score":0.25658855},"labels":[],"label_agreement":null},{"id":"W2170740812","doi":"10.1002/dac.536","title":"DRED: a random early detection algorithm for TCP/IP networks","year":2002,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Computer science; Random early detection; Queue; Computer network; Router; Network packet; TCP Friendly Rate Control; Active queue management; TCP global synchronization; Network congestion","score_opus":0.016738966176609523,"score_gpt":0.24251978321629125,"score_spread":0.22578081703968172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170740812","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011837331,0.004984741,0.988881,0.0014377431,0.0027888138,0.0002418732,0.0000026028545,0.000053225274,0.00042624606],"genre_scores_gemma":[0.9877086,0.0006795787,0.010301617,0.00014452242,0.0007875619,0.000043789387,0.0000022414522,0.000010416083,0.00032165728],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982448,0.00026141212,0.0007294791,0.00012573581,0.0004910918,0.00014743302],"domain_scores_gemma":[0.9967715,0.00056016614,0.00080789404,0.00042230522,0.0013508846,0.00008722559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009415476,0.00011482181,0.00023489035,0.00020065143,0.00012965912,0.0004233879,0.0019322296,0.00008224709,0.000009086376],"category_scores_gemma":[0.00006378302,0.00010490074,0.00018517078,0.00016572216,0.00003367279,0.0006944305,0.00008640442,0.00022978015,0.000014400625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000466424,0.00007731977,0.000046246572,8.681627e-7,0.00020403709,0.0000046061564,0.00032136307,0.027522182,0.000020419595,0.0054865703,0.0017173307,0.9645524],"study_design_scores_gemma":[0.0024728407,0.00009762456,0.00013822303,0.0000843504,0.0000157572,0.00015846374,0.000037521924,0.9587254,0.000019896699,0.00025071748,0.037897892,0.00010129811],"about_ca_topic_score_codex":0.000014329196,"about_ca_topic_score_gemma":0.0000039675606,"teacher_disagreement_score":0.9865249,"about_ca_system_score_codex":0.000102195205,"about_ca_system_score_gemma":0.000024311259,"threshold_uncertainty_score":0.42777282},"labels":[],"label_agreement":null},{"id":"W2170758903","doi":"10.1109/mascot.1997.567614","title":"Performance comparison of control schemes for ABR service in ATM LANs","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Asynchronous Transfer Mode; Computer science; Computer network; Variable bitrate; Service (business); Bandwidth (computing); Quality of service; Constant bitrate; ATM adaptation layer; Network congestion; Real-time computing","score_opus":0.027291183061186285,"score_gpt":0.24877036062425384,"score_spread":0.22147917756306756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170758903","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2742948,0.00048815712,0.7142777,0.0043765604,0.0002349451,0.00047048196,0.0000029073174,0.00015649581,0.0056979563],"genre_scores_gemma":[0.9915096,0.000011142245,0.007323884,0.00066921767,0.000039974144,0.000036845904,6.4136515e-7,0.000003819466,0.0004048888],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992401,0.000018862624,0.00024975956,0.0001762276,0.00011771329,0.00019730702],"domain_scores_gemma":[0.99942166,0.00014707468,0.00006920134,0.00022933888,0.000092952556,0.000039753046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013075572,0.000083541825,0.00021071454,0.000046067224,0.000036679874,0.000021512862,0.00040998473,0.00004313985,0.000047155703],"category_scores_gemma":[0.0000085956335,0.000072768635,0.000036987058,0.00024213627,0.000014410775,0.00019290272,0.00002476505,0.00006431028,0.00003251161],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003976987,0.00026098557,0.056366146,0.00006263114,0.000026240508,7.162547e-7,0.0007759242,0.008357445,0.00014085404,0.037777208,0.0035976546,0.8925944],"study_design_scores_gemma":[0.0016100241,0.00007919056,0.002116398,0.000017653829,0.0000041727794,7.8095746e-7,0.00002259971,0.9865016,0.0001489285,0.000030325487,0.00938093,0.00008744207],"about_ca_topic_score_codex":0.00001021106,"about_ca_topic_score_gemma":0.000075188516,"teacher_disagreement_score":0.9781441,"about_ca_system_score_codex":0.00001110039,"about_ca_system_score_gemma":0.000012299861,"threshold_uncertainty_score":0.29674187},"labels":[],"label_agreement":null},{"id":"W2171009722","doi":"10.1109/icc.2000.853677","title":"Overall design of reliable IP networks with performance guarantees","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; École de Technologie Supérieure","funders":"","keywords":"Computer science; Computer network; Distributed computing; Network planning and design; IP forwarding; Routing protocol; Tabu search; Static routing; Routing (electronic design automation); Algorithm","score_opus":0.014594153242031156,"score_gpt":0.17257519829474122,"score_spread":0.15798104505271007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171009722","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00564848,0.00047015314,0.98686326,0.00030024291,0.00010418063,0.00013223596,7.435152e-8,0.00015136437,0.0063300356],"genre_scores_gemma":[0.94843227,0.00021695178,0.04724896,0.0003664884,0.00005096907,0.000011077704,1.6519732e-7,0.000005765101,0.0036673415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991919,0.000025790583,0.00016228955,0.00020814741,0.00017661008,0.00023527621],"domain_scores_gemma":[0.9993964,0.00007056642,0.00006609683,0.000348718,0.00007128738,0.000046939043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014268386,0.00010408027,0.00014583489,0.00003413206,0.0000640786,0.00004316739,0.0004333118,0.000040210034,0.00013379601],"category_scores_gemma":[0.000002563167,0.00007411938,0.000025312525,0.00021962434,0.000037710965,0.00033019355,0.000035624314,0.00008798856,0.000033926975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028908156,0.00005920863,0.0006850799,0.000006323109,0.000022306504,0.0000052343976,0.00008756658,0.7954639,0.000010262284,0.01654491,0.010892848,0.17619345],"study_design_scores_gemma":[0.00046831515,0.00024818518,0.00038844533,0.00003126913,0.0000051459992,0.0000116880165,0.0000024293197,0.99742657,0.000059199832,0.00004213941,0.001204265,0.00011234931],"about_ca_topic_score_codex":0.000005522152,"about_ca_topic_score_gemma":0.0000012598344,"teacher_disagreement_score":0.9427838,"about_ca_system_score_codex":0.000008673392,"about_ca_system_score_gemma":0.000014153663,"threshold_uncertainty_score":0.30225006},"labels":[],"label_agreement":null},{"id":"W2171219261","doi":"10.1109/infcom.2004.1354483","title":"Deterministic packet marking for congestion price estimation","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Network packet; Estimation; Network congestion; Computer network; Economics","score_opus":0.011376834649187408,"score_gpt":0.23973374814609597,"score_spread":0.22835691349690856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171219261","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004404828,0.000032374668,0.99091345,0.0018725806,0.00038646985,0.00029931753,8.3040214e-7,0.0003139982,0.0017761512],"genre_scores_gemma":[0.8291743,0.0000029332368,0.17009296,0.00036426308,0.0000768484,0.00006175041,0.0000036181186,0.0000052483665,0.00021809379],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924546,0.000017345603,0.00016609917,0.00024525865,0.00012351135,0.00020233278],"domain_scores_gemma":[0.9993949,0.00017115677,0.00006645244,0.00022196314,0.00007898612,0.00006655967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002071293,0.0000941394,0.00009683035,0.000047216134,0.00012512598,0.00013726042,0.00026334252,0.00004688903,0.0000082668275],"category_scores_gemma":[0.00007843389,0.000086794724,0.00004280572,0.00014043055,0.000019431443,0.00029980048,0.000030806244,0.00004758892,0.00004304561],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008616943,0.000023082222,0.0000148037525,0.000008045034,0.000006092202,0.0000025871343,0.000062773375,0.0131263025,0.000042679156,0.31692728,0.00022241325,0.6695553],"study_design_scores_gemma":[0.0010512621,0.00012116028,0.00075534784,0.000029069428,0.000010856283,0.000022120643,0.0000071500417,0.96692675,0.0001411988,0.028009446,0.0027593384,0.00016629214],"about_ca_topic_score_codex":0.0000029601913,"about_ca_topic_score_gemma":0.000006324046,"teacher_disagreement_score":0.95380044,"about_ca_system_score_codex":0.00004995019,"about_ca_system_score_gemma":0.000076882476,"threshold_uncertainty_score":0.3539386},"labels":[],"label_agreement":null},{"id":"W2171364732","doi":"10.1109/icc.1992.268051","title":"Discrete time analysis of leaky-bucket congestion control","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Leaky bucket; Burstiness; Token bucket; Computer science; Queueing theory; Controller (irrigation); Smoothing; Security token; Real-time computing; Network packet; Variance (accounting); Algorithm; Control theory (sociology); Computer network; Control (management); Artificial intelligence","score_opus":0.0052405862597718475,"score_gpt":0.20811525181741883,"score_spread":0.202874665557647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171364732","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009350434,0.00013187797,0.97138244,0.00059250416,0.00012649478,0.00013618954,0.000004737995,0.00015845684,0.018116852],"genre_scores_gemma":[0.99419963,0.000006446423,0.002899637,0.0003609899,0.000016969028,0.000009892674,0.0000038344547,0.000004292593,0.002498325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998821,0.00016629485,0.0002832433,0.00028851395,0.00022928671,0.00021163255],"domain_scores_gemma":[0.99899554,0.00022017496,0.00011767147,0.00045021035,0.00012421029,0.00009221108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039820708,0.0001187263,0.00034122218,0.00019645979,0.000052737392,0.00005142015,0.00034396834,0.000058028752,0.00039366848],"category_scores_gemma":[0.00005898568,0.00009850458,0.00017900157,0.0010028675,0.000050409002,0.00021136279,0.000019520228,0.00006911867,0.000093947194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024307938,0.00008781645,0.0034494682,0.000003950747,0.001326432,0.0000066335065,0.00011113466,0.0387123,0.0006478216,0.8745629,0.0019929165,0.07907431],"study_design_scores_gemma":[0.00092615973,0.00007536633,0.003928403,0.0000050141957,0.0004679658,0.0000027295805,0.000009395485,0.98970455,0.00017490104,0.000773287,0.0037464865,0.00018575278],"about_ca_topic_score_codex":0.000009390835,"about_ca_topic_score_gemma":0.000013316859,"teacher_disagreement_score":0.98484915,"about_ca_system_score_codex":0.000015223296,"about_ca_system_score_gemma":0.000046805322,"threshold_uncertainty_score":0.43103936},"labels":[],"label_agreement":null},{"id":"W2171414878","doi":"10.1109/ccece.2003.1226055","title":"Design and testbed implementation of adaptive MPLS-DiffServ enabled virtual private networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Testbed; Quality of service; Multiprotocol Label Switching; Computer science; Computer network; Queueing theory; Private network; Resource allocation; Distributed computing","score_opus":0.013611431848749304,"score_gpt":0.23112008318937582,"score_spread":0.21750865134062652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171414878","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031300593,0.000097026714,0.96755,0.0004367811,0.000098149845,0.00031433892,3.2382871e-7,0.00011089355,0.0000919196],"genre_scores_gemma":[0.9166726,0.00003518129,0.082909726,0.00026612805,0.000041062875,0.00002142667,0.000001245627,0.000005275873,0.000047367415],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908,0.00006999594,0.00023683815,0.00025249593,0.00014763771,0.0002130537],"domain_scores_gemma":[0.9994244,0.00013432902,0.00010315718,0.00019708852,0.00006554958,0.00007548217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025682815,0.000113165785,0.0001477345,0.00004893508,0.000076792516,0.000051454233,0.00024465946,0.000045635836,0.000017009761],"category_scores_gemma":[0.0000051581246,0.00009774688,0.00002669568,0.00023160937,0.00003865003,0.00030916499,0.00008586346,0.00006979703,0.0000045005304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003853974,0.00004496354,0.00032772607,0.0000018867071,0.00004132267,0.000005165462,0.0003529532,0.1716512,0.0003463395,0.38786948,0.00016578734,0.43915462],"study_design_scores_gemma":[0.0036047217,0.0008607149,0.0058123176,0.000026113392,0.000023956762,0.00001274093,0.00020325782,0.97927374,0.0021396189,0.007630116,0.00014195184,0.0002707643],"about_ca_topic_score_codex":0.00003984414,"about_ca_topic_score_gemma":0.00001381047,"teacher_disagreement_score":0.885372,"about_ca_system_score_codex":0.00002545845,"about_ca_system_score_gemma":0.000062206316,"threshold_uncertainty_score":0.39860022},"labels":[],"label_agreement":null},{"id":"W2171471331","doi":"10.1109/rttas.2004.1317284","title":"Incorporating cost of control into the design of a load balancing controller","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"","keywords":"Computer science; Linear-quadratic regulator; Bottleneck; Load balancing (electrical power); Controller (irrigation); Distributed computing; Resource (disambiguation); Control (management); Real-time computing; Computer network; Embedded system","score_opus":0.010687404049813803,"score_gpt":0.21445254252247312,"score_spread":0.2037651384726593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171471331","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020099117,0.00028399445,0.9943792,0.0017961565,0.00011516505,0.00051069394,4.7595935e-7,0.00006359775,0.00084080326],"genre_scores_gemma":[0.9694494,0.000005004255,0.029731657,0.00067813596,0.00004541316,0.00003499879,1.2976085e-7,0.0000049408254,0.000050318155],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875915,0.00013107384,0.00041389564,0.00019375826,0.0003232089,0.00017892757],"domain_scores_gemma":[0.9985083,0.00055366306,0.00027772112,0.0003246797,0.00028361948,0.00005202917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097138947,0.00011589671,0.00029233255,0.000037262227,0.000087346365,0.000035370907,0.00062369835,0.0000465585,0.0000072877947],"category_scores_gemma":[0.00011678655,0.00007267223,0.00007684002,0.00028319322,0.00010684599,0.00016802373,0.000056600897,0.00010293222,0.000009021929],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010877699,0.0000884677,0.00040863306,0.000011090778,0.00009696043,0.000004768494,0.0013378722,0.4027166,0.005672711,0.34740838,0.0001806928,0.24196504],"study_design_scores_gemma":[0.006734817,0.00023539874,0.000326138,0.000073288385,0.00002950531,0.000007831964,0.00014794899,0.97684807,0.0017180931,0.013567324,0.00014283802,0.00016876911],"about_ca_topic_score_codex":0.00014778132,"about_ca_topic_score_gemma":0.00003961085,"teacher_disagreement_score":0.9674395,"about_ca_system_score_codex":0.00004920091,"about_ca_system_score_gemma":0.00031624446,"threshold_uncertainty_score":0.29634875},"labels":[],"label_agreement":null},{"id":"W2171701662","doi":"10.1109/icc.1995.524528","title":"Buffer design for wide-area ATM networks using virtual finishing times","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Queueing theory; Asynchronous Transfer Mode; Bandwidth (computing); Computer network; Class (philosophy); Distributed computing","score_opus":0.05396669451512269,"score_gpt":0.22857050043513719,"score_spread":0.1746038059200145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171701662","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000774714,0.00033803747,0.9952429,0.0010266532,0.00053734076,0.00029672275,4.907753e-7,0.0003061843,0.0014769543],"genre_scores_gemma":[0.87294656,0.0000125345005,0.12199895,0.0016115449,0.00018575709,0.00002633456,8.7728444e-7,0.000013709831,0.0032037112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874747,0.00007235942,0.00022898879,0.00037396554,0.00016435582,0.00041287404],"domain_scores_gemma":[0.998521,0.0008832894,0.00006776024,0.0003360517,0.0000793975,0.00011250131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030924458,0.00016675168,0.00018560492,0.00004188433,0.00024319161,0.00030459347,0.0005508635,0.000096091724,0.00022472089],"category_scores_gemma":[0.000054345852,0.000146279,0.000095554016,0.00020709386,0.00003061911,0.00050054264,0.00008435013,0.000112900416,0.000037394868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014137435,0.00004919389,0.00008079448,0.0000019851866,0.0000320486,0.000007719861,0.00014518255,0.5097665,0.000015400396,0.042064276,0.05831856,0.3895042],"study_design_scores_gemma":[0.00049583305,0.00010791185,0.000017383745,0.000014272437,0.000012985107,0.000008555984,0.00001012314,0.9948619,0.000027067224,0.0005170657,0.0037239827,0.00020291883],"about_ca_topic_score_codex":0.000004837129,"about_ca_topic_score_gemma":0.0000021237863,"teacher_disagreement_score":0.8732439,"about_ca_system_score_codex":0.000029851646,"about_ca_system_score_gemma":0.000020613383,"threshold_uncertainty_score":0.5965084},"labels":[],"label_agreement":null},{"id":"W2171967797","doi":"10.1109/icc.2006.254858","title":"Multi-Scale Queuing Analysis of Long-Range Dependent Traffic and Variable Service Rates","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Queue; Queueing theory; Variable (mathematics); Computer science; Range (aeronautics); Scale (ratio); Service (business); Real-time computing; Mathematics; Computer network; Engineering; Physics","score_opus":0.051232693595476636,"score_gpt":0.307988660002505,"score_spread":0.25675596640702836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171967797","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.121190466,0.00054486305,0.85305434,0.009985465,0.00044112027,0.00035561214,0.0001480986,0.00023480231,0.014045202],"genre_scores_gemma":[0.96929383,0.0001561082,0.029442653,0.00029842847,0.00003283077,0.00004712485,0.00007846061,0.0000068630297,0.0006436981],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870723,0.00013390122,0.00040156138,0.00029907867,0.00029195176,0.00016628175],"domain_scores_gemma":[0.9978775,0.00028565255,0.00021740333,0.0009793278,0.0005825547,0.000057594047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027434705,0.000148141,0.00023926071,0.00032189037,0.00016154227,0.00017608512,0.0017811888,0.00006961356,0.000069897265],"category_scores_gemma":[0.000014035113,0.00015120268,0.00007233875,0.00073121337,0.00008663935,0.00028062976,0.00018451881,0.00018436294,0.000019449913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006795244,0.0023010238,0.028507005,0.000030706065,0.001648989,0.000008040475,0.0011625659,0.30061924,0.0049488572,0.5695506,0.0009300291,0.090224996],"study_design_scores_gemma":[0.00042852995,0.000019137766,0.016933464,0.000037136426,0.00011090969,0.0000032539187,0.00004330461,0.98160666,0.000068541354,0.00028672232,0.00031394,0.0001484175],"about_ca_topic_score_codex":0.00063890265,"about_ca_topic_score_gemma":0.006702358,"teacher_disagreement_score":0.84810334,"about_ca_system_score_codex":0.000046146397,"about_ca_system_score_gemma":0.000086496104,"threshold_uncertainty_score":0.6165866},"labels":[],"label_agreement":null},{"id":"W2171994744","doi":"10.1109/ccece.2005.1556931","title":"An accurate model for fair rate calculation in resilient packet rings","year":2006,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Network packet; Computer network; Fairness measure; Node (physics); Network congestion; Reuse; Bandwidth (computing); Propagation delay; Packet switching; Real-time computing; Throughput; Wireless","score_opus":0.014211741003173614,"score_gpt":0.2555811753409914,"score_spread":0.24136943433781777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171994744","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08703649,0.00001451789,0.91091394,0.0009024835,0.00007251776,0.00023191611,0.000001228236,0.00014900914,0.00067790167],"genre_scores_gemma":[0.9788485,9.869697e-7,0.019344982,0.00032230886,0.000059030892,0.000048510934,0.0000071887953,0.0000051636584,0.0013633249],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991714,0.000037420188,0.0001975516,0.00028714392,0.00009131827,0.00021518185],"domain_scores_gemma":[0.9995419,0.00005542182,0.00004641882,0.00025203422,0.00006002225,0.000044203276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029225182,0.0000866151,0.00009448759,0.00006001729,0.00005773218,0.00010216837,0.00026088287,0.000043260654,0.0000027247802],"category_scores_gemma":[0.0000066597386,0.000076720884,0.0000328688,0.00015834578,0.000011405349,0.00047399275,0.000023003706,0.000046014855,0.000008271938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001626575,0.00004337716,0.00032113836,0.0000021804678,0.0000013336308,0.0000012229677,0.00006967256,0.783085,0.00027247026,0.17836319,0.0015785837,0.036245592],"study_design_scores_gemma":[0.00056491396,0.000027707123,0.0038516012,0.000004427922,0.0000016492488,5.0247894e-7,0.0000041467683,0.98599756,0.00013446264,0.009046817,0.00026010053,0.000106122825],"about_ca_topic_score_codex":0.00004889995,"about_ca_topic_score_gemma":0.00033844294,"teacher_disagreement_score":0.891812,"about_ca_system_score_codex":0.000030069501,"about_ca_system_score_gemma":0.000040633102,"threshold_uncertainty_score":0.31285867},"labels":[],"label_agreement":null},{"id":"W2182332970","doi":"10.1109/pimrc.2015.7343582","title":"Joint traffic engineering optimization for QoS and best effort traffic","year":2015,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Quality of service; Traffic engineering; Computer science; Joint (building); Computer network; Traffic classification; Network traffic control; Traffic generation model; Resource allocation; Traffic optimization; Resource (disambiguation); Internet traffic engineering; Traffic shaping; Optimization problem; Floating car data; Engineering; Transport engineering; Traffic congestion","score_opus":0.022843359649063946,"score_gpt":0.21277500369706004,"score_spread":0.1899316440479961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2182332970","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036620572,0.00022889927,0.9609717,0.0007745481,0.0005356462,0.00031143925,6.754093e-7,0.0003442228,0.00021227586],"genre_scores_gemma":[0.8378739,0.000013799099,0.16132276,0.00013469797,0.00022356737,0.000059568592,0.0000037193502,0.000011656063,0.0003563667],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920976,0.000008520364,0.00017569803,0.00026117492,0.00012911514,0.00021574994],"domain_scores_gemma":[0.9994766,0.00004673592,0.000034514323,0.00017848116,0.00008962144,0.00017404169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022471866,0.000119429926,0.0001429273,0.000067407935,0.000052201412,0.00013171835,0.00017755998,0.000054943168,0.0000053376693],"category_scores_gemma":[0.000026719314,0.00010759337,0.00003965209,0.0001421431,0.000013850967,0.0002700226,0.000034578123,0.000054174485,0.000008592841],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004064641,0.000024285677,0.0000021151925,0.000005963945,0.0000075631597,0.0000010252297,0.000107279906,0.84289575,0.0000030145193,0.0048038145,0.001195733,0.15094942],"study_design_scores_gemma":[0.0008371,0.00016094794,0.000008582911,0.0000111881845,0.000009613867,0.000014156715,0.000025084477,0.9951199,0.000014474454,0.00000990281,0.003646064,0.00014296826],"about_ca_topic_score_codex":8.9095744e-7,"about_ca_topic_score_gemma":0.0000028542265,"teacher_disagreement_score":0.8012533,"about_ca_system_score_codex":0.000023834174,"about_ca_system_score_gemma":0.000053087333,"threshold_uncertainty_score":0.438753},"labels":[],"label_agreement":null},{"id":"W2182973640","doi":"10.22215/etd/2010-09191","title":"Simulation platform for the planning and design of networks carrying VoIP traffic","year":2010,"lang":"en","type":"dissertation","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Canadian Heritage; Library and Archives Canada","funders":"","keywords":"Voice over IP; Computer science; Telecommunications; Engineering; World Wide Web; The Internet","score_opus":0.02966870948792254,"score_gpt":0.2761743981869601,"score_spread":0.24650568869903755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2182973640","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046013566,0.0015969233,0.99170685,0.000046801615,0.0010371087,0.0007670985,9.694497e-7,0.00009818256,0.0001446922],"genre_scores_gemma":[0.9880456,0.000025164694,0.010765594,0.00005489489,0.0002446192,0.00007608843,0.00003405308,0.000017371405,0.0007366658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989977,0.000021180484,0.0003041255,0.0002962247,0.00016915487,0.00021162427],"domain_scores_gemma":[0.996696,0.0025834916,0.00025140366,0.0002717219,0.00015171227,0.000045682933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000425926,0.00019036475,0.00024008867,0.00007043015,0.00023977572,0.00013224779,0.0004269566,0.00028927528,0.00000464371],"category_scores_gemma":[0.000057893743,0.00013485689,0.00007488596,0.0001304009,0.00002323749,0.00018580505,0.000018058185,0.00029773428,5.7130273e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041711784,0.000004273449,0.0000028565994,0.000014375656,0.000025218878,2.6501573e-7,0.00046271228,0.67891926,0.0000076082197,0.0018680926,0.00008253062,0.31857106],"study_design_scores_gemma":[0.00034724356,0.000058531554,0.00016182837,0.0000615571,0.00005353179,9.4467856e-7,0.00015941542,0.9984897,0.000014548655,0.0001610858,0.00033674296,0.00015491091],"about_ca_topic_score_codex":0.0000039597912,"about_ca_topic_score_gemma":0.000033465578,"teacher_disagreement_score":0.9834442,"about_ca_system_score_codex":0.000009008576,"about_ca_system_score_gemma":0.000075127675,"threshold_uncertainty_score":0.5499304},"labels":[],"label_agreement":null},{"id":"W2185644450","doi":"","title":"Achieving Quality of Service through SCalable Aggregate Reservations","year":2015,"lang":"en","type":"article","venue":"Americanae (AECID Library)","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Scalability; Quality of service; Computer science; Flexibility (engineering); Aggregate (composite); Distributed computing; The Internet; Service (business); Quality (philosophy); Computer network; Computer security; World Wide Web; Database; Business","score_opus":0.059280865699004016,"score_gpt":0.2787478448104723,"score_spread":0.2194669791114683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2185644450","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5841289,0.0011332222,0.32599103,0.06374981,0.0006309884,0.0003522531,0.000015606716,0.00085107505,0.023147084],"genre_scores_gemma":[0.9132861,0.000056097353,0.0770447,0.007893269,0.00014483952,0.000026391686,0.000013745362,0.000022113883,0.0015127364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99820715,0.00025076608,0.00044956143,0.00037982315,0.00039134247,0.00032136362],"domain_scores_gemma":[0.9982069,0.00024808737,0.00033436358,0.0008558171,0.00015628824,0.00019853716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002703627,0.00015969005,0.00033355065,0.00006773457,0.00009443031,0.000060033388,0.0012047226,0.00004970813,0.00005981124],"category_scores_gemma":[0.00009639974,0.0001518213,0.00007770611,0.0017306322,0.000105186984,0.0025924484,0.00035033288,0.00014809513,0.00007335234],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009972762,0.00032338698,0.18232562,0.000057598572,0.00017153402,0.000020702282,0.002260923,0.0061306604,0.00038729675,0.46851435,0.10981774,0.22989045],"study_design_scores_gemma":[0.0060332036,0.0010681961,0.5315874,0.00038596627,0.000098699384,0.00002280671,0.0016194987,0.24368419,0.0026212956,0.036732722,0.17356116,0.0025848688],"about_ca_topic_score_codex":0.008794187,"about_ca_topic_score_gemma":0.00005647614,"teacher_disagreement_score":0.43178165,"about_ca_system_score_codex":0.000019876228,"about_ca_system_score_gemma":0.0003158392,"threshold_uncertainty_score":0.9978063},"labels":[],"label_agreement":null},{"id":"W21858210","doi":"10.1371/journal.pone.0023702","title":"SABUL: A high performance data transfer protocol","year":2003,"lang":"en","type":"article","venue":"PLoS ONE","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Computer network; Network congestion; Data transmission; Transfer (computing); Transmission Control Protocol; Reliability (semiconductor); Network packet; Bandwidth (computing); Protocol (science); Fairness measure; Port Control Protocol; Protocol data unit; Transmission delay; Real-time computing; Throughput; Internet protocol suite; The Internet; User Datagram Protocol; Telecommunications; Wireless","score_opus":0.06037994930103376,"score_gpt":0.23209086111577532,"score_spread":0.17171091181474155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W21858210","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12104622,0.00010527937,0.7251673,0.0034880685,0.0003147607,0.13113189,0.000023298506,0.0016076906,0.017115498],"genre_scores_gemma":[0.9283482,0.000008530438,0.029044898,0.00053519884,0.0001225572,0.040906984,0.000005138452,0.000013325023,0.0010152026],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988147,0.00006349452,0.00017021252,0.00037971218,0.00032040876,0.0002514756],"domain_scores_gemma":[0.9987348,0.00004166796,0.000020605834,0.0010644734,0.000056264642,0.00008223238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002476364,0.000109744695,0.00015231551,0.000031212792,0.000094332325,0.00008302688,0.0010560806,0.000043670374,0.00011110907],"category_scores_gemma":[0.00002226737,0.000098389006,0.00001569476,0.00021539844,0.000026429265,0.0005067264,0.00006941583,0.0001357825,0.00019410012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001340767,0.0061054407,0.0037036538,0.00041906125,0.0005063578,0.00003942603,0.0003879685,0.0004436279,0.0039425897,0.2663697,0.005379839,0.7125682],"study_design_scores_gemma":[0.0059669036,0.00071502756,0.0020336902,0.0004167038,0.00012215221,0.000018790593,0.000009643931,0.8911255,0.022238191,0.00090165215,0.07542793,0.0010237966],"about_ca_topic_score_codex":0.000002019624,"about_ca_topic_score_gemma":0.0000030176209,"teacher_disagreement_score":0.89068186,"about_ca_system_score_codex":0.000012697353,"about_ca_system_score_gemma":0.00008150371,"threshold_uncertainty_score":0.4012187},"labels":[],"label_agreement":null},{"id":"W2188144189","doi":"","title":"ENSC 427: Communication Networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science","score_opus":0.009126560301590167,"score_gpt":0.21135253069725646,"score_spread":0.20222597039566628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188144189","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010655166,0.0014434527,0.96290857,0.0015267562,0.00034419112,0.00006587184,4.647717e-8,0.00028560447,0.032359995],"genre_scores_gemma":[0.9793968,0.000054863012,0.01784072,0.0012237099,0.00016526623,0.000011393217,0.0000013138824,0.000003250796,0.0013026372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994226,0.0000676291,0.00010308192,0.00008964079,0.00008817403,0.00022887164],"domain_scores_gemma":[0.9992107,0.000103220395,0.000032408905,0.000532035,0.000027629276,0.00009398217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028115345,0.00006005675,0.00006476347,0.000019368148,0.000095614356,0.000059593687,0.0005263912,0.000030121266,0.00006433088],"category_scores_gemma":[0.000006616776,0.000050935338,0.000029633295,0.0001440401,0.000018873556,0.00043669785,0.00011553315,0.00008981666,0.00017413983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001058715,0.0000322995,0.0014668923,3.856249e-7,0.000006414388,2.0247514e-7,0.000088977424,0.0008976888,0.000002617091,0.5313551,0.010789174,0.45535922],"study_design_scores_gemma":[0.00024832718,0.000014442054,0.004799087,0.000005677552,0.0000050571953,0.000012105005,0.000017685055,0.9093175,0.00001681856,0.0006041365,0.08480777,0.00015141253],"about_ca_topic_score_codex":0.000005523654,"about_ca_topic_score_gemma":0.0000039645383,"teacher_disagreement_score":0.9783313,"about_ca_system_score_codex":0.0000116428655,"about_ca_system_score_gemma":0.0000075170415,"threshold_uncertainty_score":0.22382733},"labels":[],"label_agreement":null},{"id":"W2203688075","doi":"10.1145/1508865.1508880","title":"GINI","year":2009,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; The Internet; Virtual machine; Network topology; Set (abstract data type); Operating system; Computer network; Distributed computing; Human–computer interaction; Programming language","score_opus":0.004959376068410198,"score_gpt":0.20040397669835455,"score_spread":0.19544460062994434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2203688075","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006176547,0.00004936289,0.88622797,0.0097738365,0.00011907485,0.000023702387,1.7813678e-8,0.00029504573,0.102893315],"genre_scores_gemma":[0.9753656,0.0000027062663,0.017107867,0.00447419,0.000058409776,7.578579e-7,7.665738e-8,5.4998844e-7,0.00298987],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999702,0.000007098617,0.000045858484,0.00009469068,0.00006083676,0.00008955967],"domain_scores_gemma":[0.9997634,0.0000132328705,0.000008058816,0.00016492451,0.000013755142,0.0000365697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004500913,0.000030672247,0.000034563112,0.000013910297,0.000025717147,0.00004334312,0.00024999495,0.000012369059,0.00003735399],"category_scores_gemma":[0.000002617716,0.000024305644,0.000017331851,0.000090708905,0.0000036966853,0.00011775074,0.000010113654,0.00002706691,0.00019047697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.3318276e-7,0.000005094339,0.0000059270956,3.1618015e-8,4.3972253e-7,0.0000013768426,0.0000079458005,0.000027862368,0.000009693736,0.41172606,0.0049193357,0.583296],"study_design_scores_gemma":[0.0005939932,0.00017979152,0.0058375355,0.000004558154,0.0000025045572,0.000020558682,0.0000060622783,0.7620035,0.00019923081,0.041533824,0.18937786,0.00024061132],"about_ca_topic_score_codex":4.4274765e-7,"about_ca_topic_score_gemma":4.1433626e-7,"teacher_disagreement_score":0.9747479,"about_ca_system_score_codex":0.0000030394765,"about_ca_system_score_gemma":0.000010602343,"threshold_uncertainty_score":0.24482596},"labels":[],"label_agreement":null},{"id":"W2220877553","doi":"","title":"Enhancing TCP performance in wide-area cellular wireless networks: transport level approaches","year":2004,"lang":"en","type":"book","venue":"Plenum Press eBooks","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer network; Zeta-TCP; TCP acceleration; Computer science; TCP Friendly Rate Control; TCP global synchronization; TCP Westwood plus; TCP tuning; Compound TCP; CUBIC TCP; Transmission Control Protocol; TCP Westwood; Network packet","score_opus":0.04983578899579583,"score_gpt":0.19299993635788854,"score_spread":0.1431641473620927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2220877553","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044450417,0.0023691994,0.74279326,0.000044560868,0.0009394988,0.000938214,0.000020782672,0.00045878536,0.25199118],"genre_scores_gemma":[0.53370476,0.0001770415,0.00163903,0.00022813561,0.0005330498,0.00036240873,0.00009159837,0.00011841819,0.46314558],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961555,0.000093005496,0.00092209294,0.001229947,0.00065288966,0.0009465798],"domain_scores_gemma":[0.9979248,0.0002098244,0.00040374722,0.0011555337,0.000078276,0.00022784287],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005413592,0.0007634709,0.00092250365,0.00019979407,0.00017908079,0.00015635908,0.0019663838,0.00066491036,0.0000101012665],"category_scores_gemma":[0.0000059494473,0.00079289847,0.00025912546,0.000064610766,0.00016490584,0.00029766507,0.00021330181,0.0012489527,0.000012011428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019066052,0.00027353482,0.00024434016,0.0013970044,0.00044657046,0.0007032898,0.0070158495,0.22015168,0.000038639926,0.1377608,0.0019527691,0.6298249],"study_design_scores_gemma":[0.0032581298,0.00021549188,0.00028245125,0.004015748,0.00019452561,0.000045753328,0.00002057139,0.76295555,0.0011518901,0.0018136876,0.22299632,0.0030498959],"about_ca_topic_score_codex":0.000047449037,"about_ca_topic_score_gemma":0.0002470953,"teacher_disagreement_score":0.74115425,"about_ca_system_score_codex":0.00041985558,"about_ca_system_score_gemma":0.001280291,"threshold_uncertainty_score":0.9994522},"labels":[],"label_agreement":null},{"id":"W2223308970","doi":"10.1007/0-306-48642-3_9","title":"Enhancing TCP Performance In Wide-Area Cellular Wireless Networks","year":2006,"lang":"en","type":"book-chapter","venue":"Kluwer Academic Publishers eBooks","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer network; Zeta-TCP; TCP acceleration; Computer science; TCP Friendly Rate Control; TCP global synchronization; TCP Westwood plus; TCP tuning; Compound TCP; CUBIC TCP; TCP Westwood; Transmission Control Protocol; Network packet","score_opus":0.010410166331704137,"score_gpt":0.18754466714768653,"score_spread":0.1771345008159824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2223308970","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00062929746,0.00202254,0.2215921,0.00051118905,0.0023776032,0.0007571838,0.0000038693343,0.0006929762,0.77141327],"genre_scores_gemma":[0.39380026,0.000094776566,0.00045177515,0.0018632406,0.0009523917,0.000109952205,0.000055370125,0.00015057005,0.60252166],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99479717,0.00008411481,0.0013942722,0.0015109538,0.00094048365,0.0012730255],"domain_scores_gemma":[0.9972105,0.000336552,0.0006864508,0.0012067095,0.00020756526,0.00035219826],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["research_integrity"],"category_scores_codex":[0.0011557543,0.00094531255,0.0010069602,0.0006343256,0.00021398046,0.0007297473,0.0031502238,0.0020310322,0.00008057169],"category_scores_gemma":[0.000026397298,0.0009932619,0.00030389603,0.00015739852,0.00023237623,0.0016060822,0.0006092042,0.004455607,0.0000784916],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000737663,0.000037277216,0.0008264075,0.00015710287,0.00021419696,0.0003316643,0.0005693252,0.012742756,0.00007923965,0.13040519,0.2290735,0.6254896],"study_design_scores_gemma":[0.0015498034,0.00009221681,0.000113114205,0.0013529403,0.00008132264,0.00004102282,0.000013161954,0.30310744,0.00010655066,0.0054187905,0.6859735,0.0021501328],"about_ca_topic_score_codex":0.000025489033,"about_ca_topic_score_gemma":0.00004804384,"teacher_disagreement_score":0.6233395,"about_ca_system_score_codex":0.00040078064,"about_ca_system_score_gemma":0.00046294578,"threshold_uncertainty_score":0.99926454},"labels":[],"label_agreement":null},{"id":"W2246565182","doi":"","title":"Stable Routing and Unique-Max Coloring on Trees","year":2013,"lang":"en","type":"article","venue":"DSpace@MIT (Massachusetts Institute of Technology)","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bounded function; Combinatorics; Mathematics; Connection (principal bundle); Shortest path problem; Tree (set theory); Routing (electronic design automation); Path (computing); Discrete mathematics; Integer (computer science); Computer science; Computer network; Graph","score_opus":0.010071247330848994,"score_gpt":0.21279491267889303,"score_spread":0.20272366534804404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2246565182","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8243137,0.00094509264,0.12608239,0.034139212,0.0012394243,0.0010940788,0.00000990398,0.0022255392,0.009950639],"genre_scores_gemma":[0.9715756,0.00008162124,0.02733732,0.00023730409,0.000048777394,0.00009037424,0.0000015119628,0.000015447189,0.00061201426],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982532,0.00003161399,0.0003650126,0.00057170226,0.00026352,0.00051490014],"domain_scores_gemma":[0.9986216,0.00007392149,0.00023413508,0.00080426066,0.00015182345,0.000114270995],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022395108,0.00027633016,0.00039964126,0.00045310063,0.00023819151,0.00012330103,0.00093572313,0.0003023084,0.000016100494],"category_scores_gemma":[0.00014910728,0.00025587893,0.000064886095,0.0008020359,0.00034472265,0.00078049017,0.00036495534,0.00041316403,0.000047442194],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012077234,0.00011641297,0.0073268698,0.000022413227,0.00011150278,0.000032838896,0.00016368587,0.0010503295,0.0028145944,0.41787645,0.0028130037,0.5676598],"study_design_scores_gemma":[0.007722807,0.0024446838,0.022946343,0.0014149685,0.00018951451,0.00021085143,0.0008231791,0.34200972,0.031970646,0.03311974,0.5538191,0.003328449],"about_ca_topic_score_codex":0.000064598826,"about_ca_topic_score_gemma":0.000057103658,"teacher_disagreement_score":0.56433135,"about_ca_system_score_codex":0.0000695926,"about_ca_system_score_gemma":0.00009095006,"threshold_uncertainty_score":0.99998933},"labels":[],"label_agreement":null},{"id":"W2263788477","doi":"","title":"Relative loss rate differentiation: performance of short-lived TCP flows: Research Articles","year":2005,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Random early detection; Active queue management; Computer science; TCP global synchronization; Quality of service; Queue; Computer network; FIFO (computing and electronics); Network congestion; TCP Friendly Rate Control; Packet loss; Service (business); Network packet; Business","score_opus":0.06447415236854175,"score_gpt":0.3341904322481575,"score_spread":0.2697162798796157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2263788477","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85342187,0.002585085,0.13635626,0.00559603,0.0007032236,0.00016374646,0.000002097525,0.0000271495,0.0011445339],"genre_scores_gemma":[0.9955506,0.0009096831,0.0029816472,0.000041562587,0.00029960135,0.000010782384,0.000002605671,0.0000063566745,0.00019715868],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99711716,0.0007933121,0.00089386996,0.00011691444,0.0009345728,0.00014418692],"domain_scores_gemma":[0.9951352,0.00070406677,0.000551788,0.0005057124,0.003028196,0.000075054224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025623115,0.000091757065,0.0002141404,0.00032158374,0.00011453901,0.00017441725,0.0021842585,0.00005712018,0.00001668335],"category_scores_gemma":[0.00012444048,0.00007929471,0.00009219797,0.00028428293,0.00009562433,0.0011941356,0.00020770243,0.00036105808,0.000028495519],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005498562,0.00080786075,0.016475145,0.0000223226,0.0010759542,0.000017939554,0.008868724,0.19313894,0.0045915493,0.25065073,0.0024342826,0.5213667],"study_design_scores_gemma":[0.0010261666,0.00016143784,0.011010363,0.00045490148,0.0000147222245,0.00008574631,0.00029790506,0.97293675,0.0012153137,0.0006124199,0.0120514,0.00013288633],"about_ca_topic_score_codex":0.000008717321,"about_ca_topic_score_gemma":0.0000072561593,"teacher_disagreement_score":0.7797978,"about_ca_system_score_codex":0.0001406606,"about_ca_system_score_gemma":0.00012185398,"threshold_uncertainty_score":0.40589324},"labels":[],"label_agreement":null},{"id":"W2267992438","doi":"10.6138/jit.2012.13.1.01","title":"Multipath Transmission for Wireless Internet Access--From an End-to-End Transport Layer Perspective","year":2012,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer network; Computer science; Multipath TCP; Transport layer; Transmission Control Protocol; Internet access; Network congestion; Internet layer; The Internet; Internet Protocol; Multipath propagation; Layer (electronics); Network packet; Channel (broadcasting)","score_opus":0.03141032016903626,"score_gpt":0.3053438137383184,"score_spread":0.27393349356928215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2267992438","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09254394,0.00012558314,0.90270174,0.001844758,0.0005135077,0.00045101828,0.000014105934,0.00027512613,0.0015302324],"genre_scores_gemma":[0.9729268,0.000007708303,0.024223123,0.0012513169,0.00039058042,0.00009976953,0.000014692429,0.000018059483,0.0010679329],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850553,0.000054823315,0.0002319423,0.0005104606,0.00023994508,0.0004572854],"domain_scores_gemma":[0.9988757,0.00013169418,0.000049115257,0.00037739362,0.00013070942,0.00043540564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002512454,0.00020578994,0.00022946573,0.000077590135,0.00008628766,0.0001197888,0.0009892056,0.000092141876,0.00029238057],"category_scores_gemma":[0.0000049538135,0.00016694036,0.000117936004,0.00018594766,0.000026252219,0.001367252,0.00004134839,0.00012170285,0.000032257547],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015653686,0.00037901293,0.0030556673,0.0000059009826,0.000061000446,0.000004258238,0.009851702,0.0003006295,0.00093257806,0.071798,0.0014006189,0.9120541],"study_design_scores_gemma":[0.0034261635,0.0005205263,0.038994417,0.00007585406,0.00009403036,0.0000098306045,0.00083218556,0.87385815,0.009327707,0.0017912643,0.06996694,0.0011029481],"about_ca_topic_score_codex":0.0004330528,"about_ca_topic_score_gemma":0.00016430723,"teacher_disagreement_score":0.91095114,"about_ca_system_score_codex":0.000056309153,"about_ca_system_score_gemma":0.000055505658,"threshold_uncertainty_score":0.680763},"labels":[],"label_agreement":null},{"id":"W2268343697","doi":"10.5755/j01.eee.95.7.10051","title":"Modelling the On-line Traffic Estimator in OPNET","year":2009,"lang":"pl","type":"article","venue":"Elektronika ir Elektrotechnika","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Transport Canada","funders":"","keywords":"Computer science; Estimator; Statistical time division multiplexing; Dependency (UML); Resource allocation; Multiplexing; Bandwidth (computing); Real-time computing; Context (archaeology); Distributed computing; Computer network; Artificial intelligence; Telecommunications; Statistics; Mathematics","score_opus":0.02503609909285554,"score_gpt":0.2526503666755997,"score_spread":0.22761426758274417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2268343697","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059837423,0.008546875,0.8804281,0.042297073,0.001758795,0.0032338349,0.000028616829,0.0015170685,0.002352232],"genre_scores_gemma":[0.98459697,0.0006460128,0.008757266,0.002985185,0.0011698216,0.000176347,0.000015180435,0.00008292089,0.0015702861],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99234545,0.000557416,0.0015328501,0.0018687238,0.0013563433,0.002339235],"domain_scores_gemma":[0.9957725,0.0006057214,0.0005179865,0.0024774603,0.00019439164,0.00043193053],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0019477312,0.0011617952,0.0011186958,0.000553621,0.0008057221,0.00071034115,0.0036316602,0.0006711484,0.00009971416],"category_scores_gemma":[0.000095212636,0.0009505662,0.0004837307,0.0021162976,0.0002958253,0.00063863647,0.00020525134,0.0028073152,0.0007683468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000132982,0.00043150096,0.0000045091724,0.000010901707,0.00003097169,0.00008679488,0.0002750113,0.64010096,0.000028381435,0.05040803,0.0020871523,0.30640277],"study_design_scores_gemma":[0.0022017206,0.00155487,0.00006197439,0.00038443145,0.000060531638,0.00006671894,0.000062933024,0.97106916,0.0000998805,0.0030597402,0.020389443,0.0009885825],"about_ca_topic_score_codex":0.000050860395,"about_ca_topic_score_gemma":0.000030065361,"teacher_disagreement_score":0.92475957,"about_ca_system_score_codex":0.0004873303,"about_ca_system_score_gemma":0.0005920802,"threshold_uncertainty_score":0.99949324},"labels":[],"label_agreement":null},{"id":"W2296004027","doi":"","title":"PERFORMANCE ANALYSIS OF MPLS OVER IP NETWORKS USING CISCO IP SLAs","year":2015,"lang":"en","type":"article","venue":"Summit (Simon Fraser University)","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Acknowledgement; Table (database); Computer science; Multiprotocol Label Switching; Computer network; World Wide Web; Database; Quality of service","score_opus":0.02101564621199877,"score_gpt":0.2140600731884664,"score_spread":0.19304442697646762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296004027","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6772679,0.00011827458,0.3194929,0.000061686806,0.000304872,0.00009122928,0.0000033323224,0.00009968936,0.0025600744],"genre_scores_gemma":[0.9976296,0.000037366546,0.0013995303,0.000105771345,0.000072132316,2.6214778e-7,0.00000584045,0.000007494764,0.000742039],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986486,0.00010496899,0.00020299699,0.00038848215,0.00032230178,0.000332675],"domain_scores_gemma":[0.99875134,0.00007724796,0.00017831747,0.0005658874,0.00020880841,0.00021840094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023705975,0.00017420657,0.00034792945,0.00061131024,0.00012069193,0.000051886833,0.0008850288,0.00011550917,0.00003682109],"category_scores_gemma":[0.00001075078,0.00018835462,0.00018628186,0.0032926453,0.00006958334,0.0007244581,0.00022533494,0.00016654596,0.000010799205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006156953,0.000057872847,0.46353543,0.000005058597,0.0004554935,0.0000462785,0.000036421116,0.5000378,0.0000015208391,0.00379812,0.002591131,0.029373325],"study_design_scores_gemma":[0.0007549708,0.000061200924,0.005260013,0.000018715746,0.00042040175,9.488046e-9,0.00040234486,0.98013246,0.000028668397,0.00001657135,0.012687811,0.00021686037],"about_ca_topic_score_codex":0.00009119327,"about_ca_topic_score_gemma":0.0020879752,"teacher_disagreement_score":0.48009464,"about_ca_system_score_codex":0.00011797819,"about_ca_system_score_gemma":0.0001347315,"threshold_uncertainty_score":0.76808786},"labels":[],"label_agreement":null},{"id":"W2325965131","doi":"10.2514/6.2006-6129","title":"Guaranteed Multimedia Services over Satellite Networks","year":2006,"lang":"en","type":"article","venue":"AIAA Modeling and Simulation Technologies Conference and Exhibit","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada; Canadian Space Agency; Eion (Canada)","funders":"Canadian Space Agency","keywords":"Computer science; Multimedia; Satellite; Computer network; Communications satellite; Satellite broadcasting; Telecommunications; Engineering","score_opus":0.011154030702061642,"score_gpt":0.22017416659940037,"score_spread":0.20902013589733873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2325965131","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2875661,0.002784301,0.7078681,0.00045961433,0.00007415322,0.00012299385,9.840077e-7,0.00091641984,0.00020735462],"genre_scores_gemma":[0.9948277,0.00071839034,0.004189118,0.00014342579,0.000046037192,0.000011251784,0.0000072175203,0.000007078739,0.000049783303],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885595,0.000022061564,0.00027365403,0.0004340205,0.00013854049,0.00027579657],"domain_scores_gemma":[0.999376,0.00011389649,0.00007976008,0.00029727403,0.000100186175,0.00003287768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014067975,0.00018657674,0.00020589246,0.00010979103,0.00020268917,0.00028443773,0.00027332702,0.00021094483,0.0000026265332],"category_scores_gemma":[0.000010724535,0.00016409977,0.000031619533,0.00018156742,0.00008239346,0.000380275,0.00015777734,0.0001758922,0.0000035588737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008827916,0.000010390921,0.0016181044,0.0000088792385,0.0000061082083,0.0000022380848,0.00008815972,0.48770425,0.000042681502,0.016666278,0.0000046416403,0.49383944],"study_design_scores_gemma":[0.00043851617,0.000030252904,0.00031495653,0.000051066145,0.000009717054,0.0000027943086,0.00013990594,0.98621374,0.00002487673,0.012187835,0.00038313575,0.0002031953],"about_ca_topic_score_codex":0.00007639673,"about_ca_topic_score_gemma":0.000035247976,"teacher_disagreement_score":0.7072616,"about_ca_system_score_codex":0.000008049013,"about_ca_system_score_gemma":0.000014830868,"threshold_uncertainty_score":0.66917944},"labels":[],"label_agreement":null},{"id":"W2339295289","doi":"10.1007/978-3-642-30376-0_5","title":"Traffic Dynamics Online Estimation Based on Measured Autocorrelation","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Exponential smoothing; Autocorrelation; Computer science; Smoothing; Exponential distribution; Mathematical optimization; Statistics; Mathematics","score_opus":0.019855978671324048,"score_gpt":0.2278672545562034,"score_spread":0.20801127588487936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2339295289","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007644884,0.00020086677,0.9961981,0.001493552,0.00066509517,0.0005877445,0.000048914295,0.0001241078,0.00060513045],"genre_scores_gemma":[0.10040019,0.000025383355,0.8989665,0.00025192174,0.00015308624,0.000025803827,0.00012193481,0.000015665368,0.000039519604],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875695,0.00001590669,0.00054104725,0.0001476396,0.00032416367,0.00021428632],"domain_scores_gemma":[0.99837506,0.0003815657,0.00047039197,0.0005610383,0.00015808115,0.000053856635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003900282,0.00026660206,0.0003003962,0.00021099849,0.0006595907,0.00016274075,0.0013290724,0.0002292001,8.238202e-7],"category_scores_gemma":[0.000051138217,0.00022015838,0.00017639762,0.00021149244,0.00020364363,0.0003491507,0.00020308829,0.00040449892,9.541895e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012497152,0.000014601475,6.561713e-7,0.00003640371,0.000018035855,1.515757e-8,0.00017963344,0.7048084,2.000218e-7,0.047801167,0.000016851982,0.2471228],"study_design_scores_gemma":[0.00023663584,0.00006110293,0.00003824266,0.00018118897,0.00004326462,0.0000030347016,9.0365353e-7,0.99498296,0.0000022610207,0.00033946664,0.0038839865,0.00022696267],"about_ca_topic_score_codex":0.0000039431566,"about_ca_topic_score_gemma":0.000049406,"teacher_disagreement_score":0.29017457,"about_ca_system_score_codex":0.00011936964,"about_ca_system_score_gemma":0.00018086126,"threshold_uncertainty_score":0.8977798},"labels":[],"label_agreement":null},{"id":"W2353503386","doi":"","title":"Improvement on the TCP Congestion Control Slow Start Based on the Bandwidth Measurement","year":2009,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"HSTCP; Computer science; Network congestion; Bandwidth (computing); H-TCP; CUBIC TCP; TCP Westwood plus; TCP Friendly Rate Control; TCP tuning; Network packet; Real-time computing; Computer network; Bandwidth management; Algorithm","score_opus":0.014309516797735622,"score_gpt":0.20028381529077885,"score_spread":0.18597429849304323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2353503386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005335817,0.00005561957,0.89134467,0.10487828,0.00006166175,0.0019374816,0.0000063745347,0.00022033416,0.00096200634],"genre_scores_gemma":[0.9515828,0.0000054418456,0.0060555665,0.0408971,0.00027522614,0.00106396,0.000004794987,0.000010072589,0.00010506492],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981135,0.00015605344,0.0003125657,0.0005238964,0.00054847513,0.00034548496],"domain_scores_gemma":[0.99807584,0.00040927943,0.00014310284,0.0010451489,0.00022953001,0.00009707247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008329855,0.00024806996,0.000169404,0.000064777334,0.0005863909,0.0003054171,0.0012167888,0.000058970087,0.000025586914],"category_scores_gemma":[0.0000037771233,0.00014690614,0.00012617686,0.00032266456,0.000055120403,0.000075795935,0.00003869737,0.00027740235,0.00020884347],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022794136,0.00025627099,0.000010030973,0.0000022283168,0.000030946947,7.9055405e-7,0.00004864434,0.010868849,0.0018857301,0.18734443,0.02663164,0.77289766],"study_design_scores_gemma":[0.0016354659,0.00056463294,0.0022252467,0.000060124832,0.00003599137,0.0000027393196,0.000009422041,0.6203034,0.0013712829,0.0037178665,0.369701,0.00037284577],"about_ca_topic_score_codex":0.0000041517337,"about_ca_topic_score_gemma":0.000004622213,"teacher_disagreement_score":0.9510492,"about_ca_system_score_codex":0.00016528633,"about_ca_system_score_gemma":0.000118627475,"threshold_uncertainty_score":0.5990659},"labels":[],"label_agreement":null},{"id":"W2354076212","doi":"","title":"A method of the QoS based route queue management","year":2004,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Quality of service; Active queue management; Queue; Computer network; Network congestion; Queue management system; The Internet; Queueing theory; Distributed computing; Operating system; Network packet","score_opus":0.004787157197328058,"score_gpt":0.22411931287597564,"score_spread":0.21933215567864758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2354076212","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011510319,0.000052383257,0.9938505,0.0040222416,0.000043571345,0.0007394024,0.0000034714874,0.00012768264,0.0010456012],"genre_scores_gemma":[0.06734461,0.0000028288484,0.93035674,0.0016302845,0.00009245076,0.00039582304,0.0000022007914,0.0000070849756,0.00016796861],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990937,0.000046355595,0.00022595811,0.00031478648,0.00014859877,0.00017056988],"domain_scores_gemma":[0.99904597,0.000048819034,0.00010316456,0.0006876588,0.00006675269,0.00004762724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015148854,0.000110575944,0.000118922115,0.000055821394,0.00014035258,0.000054775788,0.0012657834,0.000036304886,0.0000036100794],"category_scores_gemma":[1.3163036e-7,0.00008569325,0.00011277372,0.0005398338,0.000036605503,0.00007370716,0.00022259001,0.00008985403,0.00003538315],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011399856,0.000097990414,0.000025063795,0.000012079673,0.000024034445,5.685095e-7,0.0000736806,0.020701535,0.00035711075,0.30049676,0.00058155897,0.67762846],"study_design_scores_gemma":[0.0020818436,0.000032586195,0.0031375787,0.000074647876,0.00005935282,0.000025230544,0.000013364458,0.118726015,0.0070895483,0.016391398,0.8520035,0.00036488724],"about_ca_topic_score_codex":0.0000126195155,"about_ca_topic_score_gemma":0.0000067163683,"teacher_disagreement_score":0.851422,"about_ca_system_score_codex":0.000046559937,"about_ca_system_score_gemma":0.00006933818,"threshold_uncertainty_score":0.34944695},"labels":[],"label_agreement":null},{"id":"W2356193800","doi":"","title":"Study of A New Admission Control","year":2006,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Quality of service; Flow (mathematics); The Internet; Limit (mathematics); Control (management); Network congestion; Computer network; Flow control (data); Mechanics; World Wide Web; Artificial intelligence; Mathematics; Physics","score_opus":0.007876592755573732,"score_gpt":0.227672076999086,"score_spread":0.21979548424351228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2356193800","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01523231,0.00015019983,0.9823974,0.0005917115,0.000021314549,0.0009001431,0.0000013634691,0.00019471206,0.00051084923],"genre_scores_gemma":[0.9073299,0.0000010970731,0.09148132,0.00018964606,0.0002648081,0.00016269063,0.0000027596368,0.0000071191325,0.00056061405],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99900925,0.00003576824,0.00031164874,0.00033071887,0.00014520755,0.0001674025],"domain_scores_gemma":[0.99919593,0.00006177679,0.00011901173,0.00045458102,0.00008320595,0.00008548444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008189777,0.000115866875,0.0001725469,0.00007966989,0.000097660646,0.000059961643,0.0006919443,0.000038135124,0.000007927816],"category_scores_gemma":[2.0613547e-7,0.00010845141,0.000055278608,0.00037138502,0.000014433779,0.00011113746,0.000085791915,0.00007495257,0.000046032834],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006307319,0.0009427852,0.0011454156,0.00000411545,0.000027376089,0.0000023340303,0.00029496162,0.0030585462,0.001322737,0.031756714,0.016592873,0.94484586],"study_design_scores_gemma":[0.009901542,0.0005252242,0.026162967,0.000030218109,0.000090541456,0.000048117246,0.00009062946,0.10297212,0.0010349511,0.010581785,0.84785706,0.0007048313],"about_ca_topic_score_codex":0.000075456366,"about_ca_topic_score_gemma":0.000020929028,"teacher_disagreement_score":0.94414103,"about_ca_system_score_codex":0.00001529414,"about_ca_system_score_gemma":0.00007368588,"threshold_uncertainty_score":0.442252},"labels":[],"label_agreement":null},{"id":"W2362158377","doi":"","title":"The Analyses and Extending of Unicast Dynamic Routhing in NS2","year":2006,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Unicast; Protocol (science); Routing protocol; Computer network; Routing (electronic design automation); Extension (predicate logic); Network simulation; Distributed computing; Adaptive routing; Zone Routing Protocol; Enhanced Interior Gateway Routing Protocol; Wireless Routing Protocol; Link-state routing protocol; Multicast","score_opus":0.008228380433995593,"score_gpt":0.2731246532217323,"score_spread":0.2648962727877367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2362158377","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013105846,0.0014283085,0.98409146,0.0008473262,0.000011666956,0.00021577317,0.0000011792066,0.000053093252,0.00024532282],"genre_scores_gemma":[0.9071432,0.000047818892,0.092563815,0.000055009543,0.000034690907,0.00007163204,0.0000023255666,0.0000042525935,0.00007727867],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992532,0.00003680938,0.00025403648,0.0002283446,0.00007366624,0.00015390082],"domain_scores_gemma":[0.99935913,0.0001984518,0.000087685185,0.0002928067,0.000038473358,0.000023453029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017058599,0.00007886123,0.000108184395,0.00007534068,0.00016548493,0.000110800305,0.000487644,0.00002782804,4.5822608e-7],"category_scores_gemma":[3.9662035e-7,0.0000624838,0.000033048127,0.000392262,0.000061905565,0.00010760898,0.00014122008,0.000085112064,0.0000036384604],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001183816,0.00003757986,0.00041877563,0.0000043925197,0.000008494594,7.680193e-7,0.000085606465,0.0024968563,0.003308848,0.08775499,0.00009408619,0.9057884],"study_design_scores_gemma":[0.00061318965,0.000019291885,0.02704891,0.00003881919,0.000017230652,0.0000293779,0.000048698956,0.89814323,0.00044116078,0.0118042715,0.0615454,0.00025042446],"about_ca_topic_score_codex":0.000041396546,"about_ca_topic_score_gemma":0.00009547017,"teacher_disagreement_score":0.905538,"about_ca_system_score_codex":0.000020645843,"about_ca_system_score_gemma":0.000020121375,"threshold_uncertainty_score":0.25480154},"labels":[],"label_agreement":null},{"id":"W2363089413","doi":"","title":"Study of the Dual Velocity Leaky Bucket Algorithm for Integrated Services in GPRS Networks","year":2005,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; General Packet Radio Service; Dual (grammatical number); Leaky bucket; Algorithm; Token bucket; Integrated services; Real-time computing; Computer network; Telecommunications; Quality of service","score_opus":0.00798652931978524,"score_gpt":0.23140628410383157,"score_spread":0.22341975478404633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2363089413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026775394,0.00010962899,0.9705465,0.00067492505,0.000049232298,0.0017088964,0.000007580227,0.00009479302,0.00003308739],"genre_scores_gemma":[0.7438952,0.0000059041736,0.25387013,0.00067566766,0.0003179643,0.0011112203,0.000011376818,0.0000127284075,0.00009986169],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988122,0.000068372414,0.00037412278,0.00038572532,0.000121899815,0.00023770207],"domain_scores_gemma":[0.9990627,0.000119848664,0.00014194658,0.00048985344,0.00014042786,0.00004519637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021546103,0.00014794635,0.0001944699,0.00006864227,0.0001599683,0.00007671908,0.0010665379,0.00006706992,0.0000019179697],"category_scores_gemma":[2.5901699e-7,0.00011655355,0.00007052673,0.00068820524,0.00003557325,0.00014700262,0.0002271884,0.00017295482,0.000006121386],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024723674,0.00042542396,0.000268022,0.000003867125,0.000021305192,2.1584977e-7,0.0007215281,0.01570553,0.000019218909,0.0015535702,0.0004763608,0.9808025],"study_design_scores_gemma":[0.0011001762,0.00004926607,0.0039269645,0.000015407848,0.000012994311,0.0000052903547,0.00012917457,0.9331122,0.00006564912,0.00018344278,0.061261885,0.0001375199],"about_ca_topic_score_codex":0.000043148022,"about_ca_topic_score_gemma":0.00044312942,"teacher_disagreement_score":0.98066497,"about_ca_system_score_codex":0.000045185985,"about_ca_system_score_gemma":0.00004956562,"threshold_uncertainty_score":0.47529158},"labels":[],"label_agreement":null},{"id":"W2363769538","doi":"","title":"A Simplified Algorithm of Network Loss Ratio Base on Packet Pair","year":2007,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Network tomography; Computer science; Unicast; Algorithm; Measure (data warehouse); Network packet; End-to-end principle; Base (topology); Packet loss; End-to-end delay; Network performance; Network delay; Base station; Computer network; Network topology; Data mining; Mathematics","score_opus":0.007896122172059485,"score_gpt":0.22896117675532435,"score_spread":0.22106505458326486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2363769538","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007632117,0.00011005244,0.9963914,0.0010584095,0.00007114841,0.0006523011,0.000008746279,0.000270307,0.0006743818],"genre_scores_gemma":[0.26995122,0.000009398134,0.7263031,0.0023201841,0.0009208509,0.00019720757,0.00002859221,0.000020215588,0.0002492289],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984059,0.000048083588,0.00044777093,0.0004837873,0.00020580077,0.00040867616],"domain_scores_gemma":[0.9984865,0.0003334634,0.00017532033,0.00069555844,0.00015739704,0.00015173349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047998902,0.00019117568,0.00022965074,0.000099329394,0.00020853287,0.000070977614,0.00082832266,0.00008923591,0.000011713537],"category_scores_gemma":[7.311994e-7,0.00018794001,0.00011339971,0.000693373,0.00006885273,0.00012168811,0.00013978592,0.00017027289,0.00011898665],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006811883,0.00014728458,0.00009760604,0.00000573365,0.00002490286,0.0000046008186,0.0000861761,0.002277796,0.00017951582,0.08466248,0.009061868,0.90344524],"study_design_scores_gemma":[0.0015754695,0.00020583444,0.0025450268,0.00005538792,0.000030393434,0.00004770443,0.000017360282,0.2984711,0.003658839,0.010490951,0.68226343,0.0006384912],"about_ca_topic_score_codex":0.0000042892125,"about_ca_topic_score_gemma":0.0000053854046,"teacher_disagreement_score":0.9028067,"about_ca_system_score_codex":0.000036728696,"about_ca_system_score_gemma":0.000062616404,"threshold_uncertainty_score":0.76639706},"labels":[],"label_agreement":null},{"id":"W2369323743","doi":"","title":"Performance Analysis and Improvement of TFRC in Cognitive Radio Environment","year":2011,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Cognitive radio; Interference (communication); Channel (broadcasting); Interval (graph theory); Handover; Real-time computing; Computer network; Telecommunications; Wireless","score_opus":0.01006789694774011,"score_gpt":0.19529772875371948,"score_spread":0.18522983180597938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2369323743","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15764229,0.00009881715,0.8415873,0.00004185976,0.0000041945605,0.00031938162,0.0000024144983,0.00002286587,0.0002808635],"genre_scores_gemma":[0.9021738,0.0000732622,0.09739891,0.00007870064,0.000014076112,0.00022100873,0.0000035017683,0.0000027831197,0.00003394663],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.999272,0.000013372317,0.00022026923,0.000289509,0.00007254693,0.0001322861],"domain_scores_gemma":[0.99960345,0.00003369414,0.000080655765,0.00021179588,0.00002418581,0.00004624774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010716821,0.000086406195,0.00014984362,0.00015778035,0.0000422399,0.0000141916025,0.00026785687,0.000028138946,0.000014346203],"category_scores_gemma":[9.659492e-8,0.00008578652,0.000041870633,0.00039228037,0.000051444433,0.00010092449,0.00012053899,0.000057922414,0.000009716081],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036572435,0.00012881967,0.01289672,0.0000061165465,0.00008663553,4.148883e-7,0.0006477668,0.00011150948,0.00059081917,0.0013069633,0.000009961421,0.9842106],"study_design_scores_gemma":[0.0019411886,0.00028457964,0.5558841,0.00003632721,0.0003146433,0.000009197885,0.0000772487,0.42135265,0.012030989,0.00069258845,0.006827872,0.00054856174],"about_ca_topic_score_codex":0.000018144747,"about_ca_topic_score_gemma":0.000006516128,"teacher_disagreement_score":0.98366207,"about_ca_system_score_codex":0.000017569373,"about_ca_system_score_gemma":0.000013494776,"threshold_uncertainty_score":0.3498273},"labels":[],"label_agreement":null},{"id":"W2379570291","doi":"","title":"FORWARD ERROR CONTROL SCHEMES AND UTILITY IN REAL-TIME NETWORKED MULTIMEDIA APPLICATIONS ON THE INTERNET","year":2001,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"CAE (Canada)","funders":"","keywords":"Computer science; The Internet; Multimedia; Packet loss; Network packet; Real-time computing; Control (management); Computer network; World Wide Web; Artificial intelligence","score_opus":0.015786758670199158,"score_gpt":0.24305776944398896,"score_spread":0.2272710107737898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2379570291","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04709591,0.00015742308,0.91882765,0.011049767,0.000113020775,0.0012065008,0.0000022167362,0.0003682763,0.021179244],"genre_scores_gemma":[0.99397314,0.00004476003,0.002481075,0.0011521067,0.00008905821,0.00022168408,0.0000017523759,0.0000054026304,0.002031015],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989346,0.00010732271,0.00021793826,0.00034382136,0.00013854199,0.00025776325],"domain_scores_gemma":[0.99875766,0.00061236805,0.000055196975,0.00044411633,0.000042236083,0.00008839709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042879928,0.0001284679,0.00016406157,0.000042998887,0.000070188085,0.00008605897,0.00048375057,0.000057956076,0.00013112293],"category_scores_gemma":[0.00002164739,0.00008502404,0.00004016757,0.0002577577,0.00008108461,0.00012190833,0.00007216383,0.0001463405,0.00012070719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008285344,0.00014077396,0.005576013,0.0000024393,0.000034113342,0.0000060192756,0.00021153844,0.00046093602,0.000039467075,0.07560978,0.008362835,0.90947324],"study_design_scores_gemma":[0.0007609392,0.000032986965,0.0042752638,0.0000095142605,0.0000049219857,0.0000035991918,0.0000171147,0.96914667,0.000008101906,0.00078269443,0.024857497,0.00010072527],"about_ca_topic_score_codex":0.000056037996,"about_ca_topic_score_gemma":0.00009944783,"teacher_disagreement_score":0.9686857,"about_ca_system_score_codex":0.000017565568,"about_ca_system_score_gemma":0.000025964235,"threshold_uncertainty_score":0.34671798},"labels":[],"label_agreement":null},{"id":"W2381647394","doi":"","title":"Unfairness Study among TCP Flows over Mobile Ad hoc Network","year":2005,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Computer network; TCP global synchronization; TCP delayed acknowledgment; TCP acceleration; TCP Friendly Rate Control; Mobile ad hoc network; Zeta-TCP; TCP tuning; Wireless ad hoc network; Network packet; Transmission Control Protocol; Wireless; Telecommunications","score_opus":0.004745837610334717,"score_gpt":0.22521278001945197,"score_spread":0.22046694240911724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2381647394","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060454883,0.0015977593,0.9342533,0.0003942235,0.00009690007,0.002106188,0.000003182861,0.0006780963,0.00041547837],"genre_scores_gemma":[0.7601631,0.00006396602,0.23237704,0.0011310608,0.0015957989,0.0036841827,0.000015127325,0.000035864843,0.00093381165],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99793017,0.00008954863,0.0004398255,0.0007892685,0.0002461791,0.00050498056],"domain_scores_gemma":[0.99846274,0.000113236754,0.00013573143,0.000981617,0.00011836928,0.0001883383],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025602462,0.00027410625,0.0002758098,0.00008686217,0.00039305165,0.00030700146,0.0014591251,0.00009088118,0.000055254535],"category_scores_gemma":[2.5525284e-7,0.00027370368,0.00012248338,0.00075836194,0.000050156752,0.00042583107,0.00039175013,0.0002428118,0.0004657621],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034610475,0.000447983,0.0009334819,0.0000030150647,0.000045694436,0.0000023606306,0.00047376176,0.027743071,0.000033028253,0.0022001204,0.011899886,0.95621413],"study_design_scores_gemma":[0.0008360032,0.000078277655,0.0067090285,0.000011691691,0.00002335826,0.00000818392,0.000028579772,0.18790404,0.000015031876,0.00027084528,0.80376583,0.00034911884],"about_ca_topic_score_codex":0.000004563336,"about_ca_topic_score_gemma":0.000108520944,"teacher_disagreement_score":0.955865,"about_ca_system_score_codex":0.00007107755,"about_ca_system_score_gemma":0.000059083446,"threshold_uncertainty_score":0.9999715},"labels":[],"label_agreement":null},{"id":"W2383090727","doi":"","title":"Research on High Speed Network Performance Measurements","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"CAE (Canada)","funders":"","keywords":"Computer science; Software deployment; Network architecture; Network performance; Key (lock); The Internet; Performance measurement; Network simulation; Network traffic control; Computer network; Computer security; Software engineering; World Wide Web; Network packet","score_opus":0.096995047612702,"score_gpt":0.31001599611934877,"score_spread":0.21302094850664677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2383090727","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5109248,0.00016840408,0.31262994,0.012441974,0.002516918,0.0007074111,3.6314557e-7,0.000953696,0.15965648],"genre_scores_gemma":[0.99058753,0.0000150791075,0.006464822,0.0008954384,0.00040970408,0.000009131906,5.6889644e-7,0.000006335755,0.0016113854],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814343,0.00008474103,0.00014986016,0.00033501795,0.00077559066,0.0005113785],"domain_scores_gemma":[0.99912906,0.00007064202,0.000024635423,0.0004905304,0.000169365,0.000115791016],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011054116,0.00009993766,0.00010515633,0.000074536416,0.0002838068,0.00012923706,0.000761527,0.000042490996,0.00003798871],"category_scores_gemma":[0.000010795216,0.00008145087,0.00003108617,0.000648654,0.000041642925,0.00022161574,0.000104862826,0.0002511393,0.00102862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033924636,0.00010485623,0.00042822355,0.0000036540728,0.000020962494,0.000008709122,0.00004369312,0.366252,0.00002852472,0.2725287,0.0098219635,0.3507248],"study_design_scores_gemma":[0.015785644,0.0050031943,0.13121228,0.0007995095,0.000028707249,0.00005446742,0.000081792095,0.7326839,0.0066506686,0.053299017,0.052034434,0.0023664131],"about_ca_topic_score_codex":0.000023515604,"about_ca_topic_score_gemma":0.000013182635,"teacher_disagreement_score":0.47966272,"about_ca_system_score_codex":0.000093977935,"about_ca_system_score_gemma":0.00010523644,"threshold_uncertainty_score":0.9997492},"labels":[],"label_agreement":null},{"id":"W2383278861","doi":"","title":"Sampling Measurement Research for Traffic of Campus Network Export Based on Mask Matching","year":2006,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Sampling (signal processing); Protocol (science); Matching (statistics); Identification (biology); Campus network; Real-time computing; Computer network; Field (mathematics); Point (geometry); Data mining; Telecommunications; Statistics","score_opus":0.050879536259946866,"score_gpt":0.30101178474098317,"score_spread":0.2501322484810363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2383278861","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021308623,0.00020002495,0.99460787,0.0010028416,0.00005987314,0.0014410589,0.0000059361923,0.000189773,0.000361767],"genre_scores_gemma":[0.56292045,0.00000170138,0.43533334,0.00020921072,0.0005213592,0.0009438746,0.000015173572,0.000015492908,0.000039401744],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979143,0.00008657946,0.0004512887,0.00055479095,0.0005050522,0.00048795986],"domain_scores_gemma":[0.99830085,0.00042627836,0.00014255587,0.0006076241,0.00044636894,0.00007630916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001415964,0.00016656594,0.0002214875,0.00016240294,0.00040541508,0.00012390123,0.00086090085,0.00007641591,0.0000031226627],"category_scores_gemma":[0.0000012697975,0.00016841495,0.00013020824,0.0006087445,0.000054802753,0.000079643345,0.00008288581,0.0001913881,0.000018146597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013592564,0.00022999907,0.00003522028,0.000029367491,0.000014676563,4.6868595e-7,0.000059931488,0.48056698,0.00082187983,0.047958657,0.006656852,0.46361238],"study_design_scores_gemma":[0.0012095186,0.00014440618,0.0008246953,0.0001225361,0.000018661667,0.0000047267367,0.000015944437,0.7399061,0.00053680665,0.011961733,0.24489895,0.0003559505],"about_ca_topic_score_codex":0.000011222199,"about_ca_topic_score_gemma":0.000016337191,"teacher_disagreement_score":0.5607896,"about_ca_system_score_codex":0.00010666048,"about_ca_system_score_gemma":0.00016719819,"threshold_uncertainty_score":0.68677616},"labels":[],"label_agreement":null},{"id":"W2388646937","doi":"","title":"A Framework and Critical Algorithm of Interdomain Egress Selection Optimization Based on Link States","year":2007,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"CAE (Canada)","funders":"","keywords":"Border Gateway Protocol; Computer science; Default-free zone; Computer network; Distributed computing; Interior gateway protocol; Router; Routing protocol; Routing (electronic design automation); IP forwarding; Selection (genetic algorithm); Path vector protocol; Link (geometry); The Internet; State (computer science); Protocol (science); Link-state routing protocol; Algorithm","score_opus":0.006779714762944549,"score_gpt":0.26024390089424493,"score_spread":0.2534641861313004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2388646937","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032510463,0.000032425807,0.99715716,0.00166055,0.00021432579,0.00007752089,7.0403763e-7,0.000110227855,0.0004219842],"genre_scores_gemma":[0.5160349,0.0000040550613,0.48335245,0.0005163284,0.000062421,0.0000024584642,9.927319e-7,0.0000032235962,0.000023132638],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992487,0.00004664145,0.00017792395,0.00020568704,0.0001600874,0.00016097381],"domain_scores_gemma":[0.9988831,0.0007652784,0.00003653193,0.00012689138,0.000114724804,0.000073472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003672108,0.000079781006,0.000101753125,0.00009199868,0.000055980836,0.000055728797,0.00012558079,0.00007680311,0.000030197476],"category_scores_gemma":[0.00008334977,0.00006917007,0.00002326719,0.0002495559,0.000051711173,0.00012205252,0.000025028157,0.00012001502,0.000001981021],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000346359,0.00007168289,0.0001442612,0.000007928256,0.000006983465,0.000004237124,0.00012824926,0.13397703,0.0000057926613,0.062040858,0.00016905184,0.8034093],"study_design_scores_gemma":[0.0002332135,0.00022011645,0.00013528754,0.00004489706,0.0000042537968,0.0000030307015,0.000019687937,0.99705166,0.00021979518,0.0019032011,0.00008921378,0.00007566666],"about_ca_topic_score_codex":0.000004661602,"about_ca_topic_score_gemma":0.0000030262154,"teacher_disagreement_score":0.8630746,"about_ca_system_score_codex":0.00001618109,"about_ca_system_score_gemma":0.000021607286,"threshold_uncertainty_score":0.28206736},"labels":[],"label_agreement":null},{"id":"W2389913849","doi":"","title":"Solve the Key Problems in Multi-party Video Conferencing by Using the ALM-technology","year":2007,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Multicast; Router; Bandwidth (computing); Computer network; Key (lock); Tree (set theory); The Internet; Distributed computing; Videoconferencing; Algorithm; Teleconference; Computer security; Telecommunications; World Wide Web","score_opus":0.02137876552436133,"score_gpt":0.25696405918006227,"score_spread":0.23558529365570094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2389913849","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00632657,0.0006320997,0.9878411,0.0038235444,0.000041772095,0.0010280696,0.0000024285762,0.00020415414,0.00010025095],"genre_scores_gemma":[0.83495295,0.000018410503,0.16294293,0.0015015187,0.00011552605,0.00036525773,0.0000055145947,0.000014750287,0.000083122475],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985997,0.0000438313,0.00037173645,0.00043277387,0.00012494097,0.0004269976],"domain_scores_gemma":[0.9988537,0.0002098851,0.0001314446,0.0006509075,0.000101559825,0.000052514362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005910171,0.00016596026,0.00015220509,0.000109453096,0.00040219753,0.0001627697,0.0014977874,0.00010652778,0.0000027221308],"category_scores_gemma":[0.0000012037323,0.00010994352,0.000054360553,0.00086651486,0.0001456893,0.00012970166,0.00029614795,0.0003522984,0.00003423974],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002538307,0.00021803884,0.0015470368,0.00000886707,0.00004064618,0.00000226113,0.0019831355,0.0046233735,0.015273656,0.07084965,0.002133738,0.90331703],"study_design_scores_gemma":[0.0008324239,0.000020724263,0.0008732572,0.000028380753,0.000015545671,0.000058382724,0.00014946885,0.65134805,0.0021597897,0.002203797,0.3419929,0.00031724805],"about_ca_topic_score_codex":0.000046805042,"about_ca_topic_score_gemma":0.00015733176,"teacher_disagreement_score":0.9029998,"about_ca_system_score_codex":0.00006627619,"about_ca_system_score_gemma":0.00007268131,"threshold_uncertainty_score":0.44833663},"labels":[],"label_agreement":null},{"id":"W2393764988","doi":"","title":"The Reason Analysis of Influencing Network Data Current Capacity","year":2009,"lang":"en","type":"article","venue":"China Printing and Packaging Study","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Character (mathematics); Flow (mathematics); Similarity (geometry); Set (abstract data type); Network analysis; Flow network; Computer science; Data mining; Artificial intelligence; Mathematics; Engineering","score_opus":0.02904258786118149,"score_gpt":0.2811429341444533,"score_spread":0.2521003462832718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2393764988","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92886573,0.0012506073,0.068751864,0.00044191483,0.00021483886,0.00016900268,0.0000010552811,0.00009950721,0.00020550043],"genre_scores_gemma":[0.99911326,0.00006120691,0.00067548436,0.000033197393,0.00010199413,0.0000022772456,0.0000014846137,0.0000026250075,0.000008470518],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9986654,0.00016612258,0.0003048198,0.00039701813,0.00021090411,0.00025575372],"domain_scores_gemma":[0.9984416,0.00021416724,0.00019769461,0.0010450706,0.000048770176,0.00005271843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018069429,0.00011880182,0.00024157112,0.000061405866,0.0004953295,0.00020025163,0.0009092866,0.000016826763,3.8310992e-7],"category_scores_gemma":[0.000106904496,0.00008356175,0.00004593237,0.0008287454,0.000036279882,0.00017349806,0.00033745694,0.0002034891,5.5819913e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027552724,0.00005756296,0.18264298,0.0000023400332,0.0001626404,8.204953e-7,0.0016089032,0.0027487427,0.0000024823576,0.004070558,0.00005380453,0.80864644],"study_design_scores_gemma":[0.00015386572,0.000038693008,0.6969836,0.000024622293,0.00018927452,8.391052e-7,0.00009298815,0.30167747,0.000001186179,0.00044223585,0.00030816378,0.00008707948],"about_ca_topic_score_codex":0.00003624816,"about_ca_topic_score_gemma":0.000045422552,"teacher_disagreement_score":0.80855936,"about_ca_system_score_codex":0.000009080612,"about_ca_system_score_gemma":0.000020713427,"threshold_uncertainty_score":0.3809724},"labels":[],"label_agreement":null},{"id":"W2394052413","doi":"","title":"APAIMD Mechanism And APTCP Based On This Mechanism","year":2004,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Computer network; Multicast; Transmission Control Protocol; Network congestion; Network packet; Bandwidth (computing); Mechanism (biology); The Internet; Transmission (telecommunications); TCP Friendly Rate Control; Telecommunications; Operating system","score_opus":0.005684536307730628,"score_gpt":0.19835800317779773,"score_spread":0.1926734668700671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394052413","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045894153,0.000053040738,0.99231964,0.0049101277,0.000050651128,0.00063706166,0.0000043029395,0.00047208575,0.0010941175],"genre_scores_gemma":[0.44959125,0.000012387653,0.54309285,0.006451143,0.00018338177,0.00044215398,0.000007921763,0.000018248687,0.00020069178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869436,0.000031894655,0.00021397033,0.000595505,0.00018268812,0.0002816067],"domain_scores_gemma":[0.99906045,0.0000811237,0.00007475484,0.0005614226,0.00006903709,0.00015318587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015318255,0.00020042105,0.00016663928,0.00012797808,0.0002876496,0.00018796891,0.0006685775,0.00009036202,0.000018018425],"category_scores_gemma":[4.6152775e-7,0.00019670898,0.00006816698,0.0003163858,0.000036164914,0.00013731226,0.000134556,0.00016798245,0.00028505563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022247725,0.000104342165,0.0000012968856,0.0000053155727,0.000009511256,0.000002560443,0.00009088037,0.0010423413,0.0009751638,0.8006634,0.00045051408,0.19665244],"study_design_scores_gemma":[0.0027465813,0.00023098876,0.00008121506,0.000059920985,0.000030335084,0.000056666962,0.000009950429,0.44491613,0.0065346216,0.37591964,0.16866815,0.00074579543],"about_ca_topic_score_codex":0.000005591429,"about_ca_topic_score_gemma":0.0000029321034,"teacher_disagreement_score":0.44922686,"about_ca_system_score_codex":0.000052603595,"about_ca_system_score_gemma":0.00007624641,"threshold_uncertainty_score":0.8021559},"labels":[],"label_agreement":null},{"id":"W2399933443","doi":"","title":"ALTERNATIVES IN NETWORK TRANSPORT PROTOCOLS FOR AUDIO STREAMING APPLICATIONS","year":2013,"lang":"en","type":"article","venue":"The Journal of the Abraham Lincoln Association","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Computer science; Computer network","score_opus":0.008422987459329491,"score_gpt":0.24740744062978867,"score_spread":0.2389844531704592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399933443","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04991911,0.0002000452,0.9059574,0.024357894,0.00066143,0.0182605,0.0000038771364,0.00005310902,0.0005866422],"genre_scores_gemma":[0.9900352,0.000022101169,0.004928289,0.00048974616,0.00093150797,0.00272397,4.99331e-7,0.00000926832,0.0008594615],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99864274,0.0002358797,0.00047968572,0.000089871326,0.0003315143,0.00022032068],"domain_scores_gemma":[0.99763995,0.00074046996,0.0010331953,0.00024505964,0.0003031139,0.000038225964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019693312,0.000090887916,0.00018012799,0.00003933394,0.0002178949,0.000074873096,0.0010667284,0.000057750287,0.000004947306],"category_scores_gemma":[0.00008686574,0.000053337106,0.00013067799,0.00034246471,0.000017716322,0.0004175075,0.000038372087,0.00024210053,0.0000060868265],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011995086,0.00044293425,0.0972433,0.000035551417,0.00037827555,0.0000010975633,0.0039252155,0.22288994,0.0006105242,0.022933478,0.01662887,0.63479084],"study_design_scores_gemma":[0.0051719267,0.00041983448,0.5267306,0.0004962971,0.00016381108,0.000023587721,0.00029537556,0.3245135,0.00036220546,0.093338124,0.047999397,0.00048536426],"about_ca_topic_score_codex":0.00001556326,"about_ca_topic_score_gemma":0.000064808395,"teacher_disagreement_score":0.94011605,"about_ca_system_score_codex":0.00022181732,"about_ca_system_score_gemma":0.00012132345,"threshold_uncertainty_score":0.21750242},"labels":[],"label_agreement":null},{"id":"W2405662919","doi":"10.1007/s11768-016-5034-9","title":"Convergence, stability and robustness analysis of the OFEX controller for high-speed networks","year":2016,"lang":"en","type":"article","venue":"Control Theory and Technology","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Robustness (evolution); Control theory (sociology); Computer science; Bottleneck; Queue; Network congestion; Bandwidth (computing); Network packet; Real-time computing; Computer network","score_opus":0.005550594860321666,"score_gpt":0.19696709041633495,"score_spread":0.19141649555601328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405662919","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19969633,0.00089069124,0.79494476,0.0037193445,0.00019261069,0.00042026007,0.000015691368,0.00009938492,0.000020935218],"genre_scores_gemma":[0.99936825,0.000059918173,0.0001949881,0.00017615451,0.000029456314,0.00006326306,4.09443e-7,0.000005537261,0.00010204165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866194,0.00024972152,0.00031363012,0.00041140427,0.00008551404,0.00027777895],"domain_scores_gemma":[0.9973348,0.001666804,0.00019786051,0.0005416034,0.00020691221,0.000052043284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011077166,0.00015438226,0.0005300151,0.0001809555,0.00015929945,0.000021189666,0.0005553346,0.00020303011,0.000021244628],"category_scores_gemma":[0.0002722727,0.00008410653,0.00010622272,0.00073456904,0.0007198909,0.000110502566,0.00013480008,0.00009863602,3.077608e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022253284,0.000025179594,0.0049063717,0.0000040041214,0.00051445427,4.1000527e-7,0.000014340658,0.00041375522,0.0011280723,0.8424038,0.000018484938,0.15034856],"study_design_scores_gemma":[0.008983091,0.00023937708,0.011281648,0.000031171992,0.001111403,0.000006230616,0.000060118906,0.8465926,0.00076576066,0.1301547,0.0004555683,0.00031833517],"about_ca_topic_score_codex":0.0000015098194,"about_ca_topic_score_gemma":0.000012324057,"teacher_disagreement_score":0.8461788,"about_ca_system_score_codex":0.000011394854,"about_ca_system_score_gemma":0.000029094841,"threshold_uncertainty_score":0.34297645},"labels":[],"label_agreement":null},{"id":"W2414194445","doi":"10.22215/etd/2009-06496","title":"Topology abstraction service for IP virtual private networks","year":2009,"lang":"en","type":"dissertation","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Abstraction; Computer science; Service (business); Topology (electrical circuits); Mathematics; Combinatorics; Business; Philosophy","score_opus":0.009025198202334701,"score_gpt":0.25047540682176167,"score_spread":0.24145020861942698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2414194445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002483423,0.0002290736,0.98323625,0.0021825614,0.004388895,0.00063431874,0.0000024446763,0.0005066268,0.0063363905],"genre_scores_gemma":[0.8883091,0.00027128178,0.02762347,0.011419625,0.0054515013,0.00054519676,0.0022746837,0.000098064236,0.064007044],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842906,0.0000401331,0.00038152834,0.0005738094,0.00018017276,0.00039531649],"domain_scores_gemma":[0.99879885,0.00018481245,0.0002620188,0.00043637148,0.00021807366,0.00009990439],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019142265,0.00028802824,0.00032442168,0.00010066658,0.0001751751,0.00015800691,0.0007625277,0.0005108602,0.000035297668],"category_scores_gemma":[0.00001163835,0.0002795607,0.00013613063,0.00024367194,0.000008456649,0.0002770858,0.000020602403,0.00032291925,0.00005288003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000777993,0.000038726623,0.0000014542519,0.000013073855,0.00003669094,0.0000025966751,0.00006491557,0.0083066225,0.000012332755,0.16977862,0.0052317013,0.81643546],"study_design_scores_gemma":[0.0010488639,0.0003920025,0.0025609366,0.00006726684,0.00007770774,0.000013232021,0.000099302306,0.9224715,0.00009450881,0.007818912,0.06466841,0.0006873453],"about_ca_topic_score_codex":0.000030249053,"about_ca_topic_score_gemma":0.0007445619,"teacher_disagreement_score":0.9556128,"about_ca_system_score_codex":0.000042597778,"about_ca_system_score_gemma":0.000092805814,"threshold_uncertainty_score":0.99996567},"labels":[],"label_agreement":null},{"id":"W2419331463","doi":"10.1145/2896377.2901487","title":"Network Calculus Analysis of a Feedback System with Random Service","year":2016,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Network calculus; Computer science; Service (business); Extension (predicate logic); Feedback control; Distributed computing; Theoretical computer science; Calculus (dental); Computer network; Control engineering; Quality of service","score_opus":0.006842343339515037,"score_gpt":0.18622027370093597,"score_spread":0.17937793036142094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2419331463","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060861427,0.000087626766,0.98815405,0.001275047,0.00014050484,0.00012450444,0.0000013372863,0.00020122623,0.003929558],"genre_scores_gemma":[0.99455893,0.0000028770473,0.0042059394,0.00042501252,0.00009602153,0.000015649443,5.5946674e-7,0.000004514183,0.0006904932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989405,0.00008307431,0.00023436204,0.00027313078,0.0002316629,0.0002372166],"domain_scores_gemma":[0.9987063,0.0002444729,0.00011741506,0.00050980336,0.00033357384,0.00008842675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002685013,0.00010958499,0.00035632058,0.00008428152,0.00004988092,0.000033329077,0.00048191674,0.000039284583,0.000036342983],"category_scores_gemma":[0.0000066745097,0.000055285072,0.00009000944,0.0018270046,0.000023919714,0.00015470515,0.0000621091,0.000030100236,0.000038937273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005510808,0.00008438599,0.006866445,0.000050935378,0.003459583,0.00002638778,0.00023882545,0.13882096,0.000076833305,0.5511127,0.0055975653,0.29311427],"study_design_scores_gemma":[0.00306273,0.000067220455,0.0027055633,0.000099800935,0.00044306737,0.0000043893297,0.000031359446,0.9922412,0.00002285,0.000029282086,0.0011127151,0.00017979331],"about_ca_topic_score_codex":0.000067391644,"about_ca_topic_score_gemma":0.00035402254,"teacher_disagreement_score":0.9884728,"about_ca_system_score_codex":0.000024516741,"about_ca_system_score_gemma":0.00004905819,"threshold_uncertainty_score":0.22544599},"labels":[],"label_agreement":null},{"id":"W2419378655","doi":"10.1145/2903150.2911718","title":"Large transfers for data analytics on shared wide-area networks","year":2016,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"CERN","keywords":"Computer science; Analytics; Data analysis; Data science; Data mining","score_opus":0.05051395477223361,"score_gpt":0.2574285074605315,"score_spread":0.20691455268829786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2419378655","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015291055,0.000039972376,0.9886524,0.008786378,0.00036836433,0.00024583325,0.000060211332,0.00024324487,0.0014506665],"genre_scores_gemma":[0.987218,0.000040515235,0.0071130176,0.0029784248,0.0001272478,0.000024375035,0.000032446464,0.00001151313,0.0024544103],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998717,0.000027921376,0.00019451886,0.000506586,0.00016412832,0.0003898564],"domain_scores_gemma":[0.99804944,0.0006041529,0.00003244423,0.0011344169,0.000057220394,0.00012234075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034446167,0.00013360863,0.00015738992,0.000043566473,0.00010125327,0.00010218496,0.0014887941,0.00006865141,0.00010191622],"category_scores_gemma":[0.000052398478,0.00008322936,0.00006507147,0.00016758517,0.00002072241,0.00041376625,0.000112332054,0.000057854926,0.000038312985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054865115,0.000083408086,0.0003131968,0.000003192352,0.00006418522,0.0000048343345,0.00003253339,0.0014159586,0.000008075928,0.17938568,0.16760723,0.65102684],"study_design_scores_gemma":[0.0012475743,0.00012812627,0.00013582711,0.000025661573,0.000014343662,9.685998e-7,0.0000044178537,0.92980593,0.000008792521,0.00055833196,0.067915104,0.00015490982],"about_ca_topic_score_codex":0.0000013986668,"about_ca_topic_score_gemma":0.000047550206,"teacher_disagreement_score":0.98706514,"about_ca_system_score_codex":0.00001942278,"about_ca_system_score_gemma":0.000039184633,"threshold_uncertainty_score":0.33939946},"labels":[],"label_agreement":null},{"id":"W2461422753","doi":"10.1007/978-1-4615-4559-0_5","title":"The Flow Control Problem for ABR Traffic","year":2000,"lang":"en","type":"book-chapter","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Flow control (data); Computer science; Exploit; Computer network; Revenue; Control (management); Bandwidth (computing); Service (business); Operations research; Computer security; Engineering; Business; Artificial intelligence","score_opus":0.00822015352050055,"score_gpt":0.19338445452402916,"score_spread":0.18516430100352863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2461422753","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.664361e-7,0.00161275,0.44974238,0.0046687094,0.0005670169,0.0013228718,0.000016917342,0.00045869697,0.5416104],"genre_scores_gemma":[0.0027865747,0.0004519846,0.010562111,0.0017411814,0.0008611924,0.00027245644,0.000011094645,0.000053460102,0.9832599],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981947,0.00002234896,0.0004330624,0.0005844068,0.00031161314,0.00045390075],"domain_scores_gemma":[0.9981493,0.00065633777,0.0001540816,0.00077272725,0.00013772651,0.00012985234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003432526,0.0003758464,0.00038289026,0.000053724336,0.0004067112,0.00036604222,0.0013583417,0.00027018524,0.00020071522],"category_scores_gemma":[0.0000055164505,0.00024385104,0.00034839637,0.00003074699,0.00009384283,0.00011855093,0.000039692986,0.0002913603,0.00033699407],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020562045,0.000004553836,1.3570698e-8,0.0000029743483,0.000052600826,0.0000020182986,0.00001400482,0.0025775176,6.894487e-8,0.4324597,0.022248503,0.5426175],"study_design_scores_gemma":[0.00071717036,0.00008115052,1.8889399e-7,0.000024569837,0.000031566007,0.0000074591626,6.416292e-7,0.3405264,1.5827979e-7,0.026125979,0.6322611,0.00022364341],"about_ca_topic_score_codex":7.040145e-7,"about_ca_topic_score_gemma":0.000038228307,"teacher_disagreement_score":0.6100126,"about_ca_system_score_codex":0.00003734904,"about_ca_system_score_gemma":0.00018773912,"threshold_uncertainty_score":0.9943957},"labels":[],"label_agreement":null},{"id":"W2467115166","doi":"","title":"ATM network performance (2nd ed.)","year":2000,"lang":"en","type":"book","venue":"Kluwer Academic Publishers eBooks","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network","score_opus":0.008574771715606746,"score_gpt":0.19914248217052122,"score_spread":0.19056771045491447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2467115166","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004555472,0.0038564112,0.0071257134,0.0008355112,0.0038371668,0.00073513034,0.00000842347,0.0012709079,0.9822852],"genre_scores_gemma":[0.0018087025,0.0002884612,0.0012881518,0.005072174,0.0057128356,0.00014947825,0.00006340263,0.00012909269,0.9854877],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.994422,0.00015526531,0.0010689503,0.0015839337,0.0011673684,0.0016024627],"domain_scores_gemma":[0.9967025,0.00028003522,0.0005439828,0.0016827771,0.00019483779,0.0005958497],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["research_integrity"],"category_scores_codex":[0.0010318946,0.00095658103,0.00095910963,0.00028554403,0.00042015073,0.0011658313,0.0051449956,0.0020436933,0.00051656674],"category_scores_gemma":[0.00002742015,0.0009521862,0.0003905492,0.00021595346,0.0002996381,0.0019664285,0.00060590456,0.00439991,0.00080898765],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016199427,0.0000043987275,0.000013968706,0.000019811398,0.000076722885,0.00001561816,0.000080697115,0.00049353443,2.276825e-7,0.009448864,0.61750066,0.3723293],"study_design_scores_gemma":[0.00065710134,0.00007721298,0.000025516676,0.00035456687,0.00007549998,0.0000654661,0.0000023262382,0.018897796,0.0000012975112,0.008056089,0.97077817,0.0010089825],"about_ca_topic_score_codex":0.0000045366082,"about_ca_topic_score_gemma":0.0000018784259,"teacher_disagreement_score":0.3713203,"about_ca_system_score_codex":0.00040464257,"about_ca_system_score_gemma":0.0017355414,"threshold_uncertainty_score":0.999969},"labels":[],"label_agreement":null},{"id":"W2473226904","doi":"10.4018/ijmdem.2016070102","title":"A Dynamic Approach to Estimate Receiving Bandwidth for WebRTC","year":2016,"lang":"en","type":"article","venue":"International Journal of Multimedia Data Engineering and Management","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"WebRTC; Computer science; The Internet; Network congestion; Bandwidth (computing); Packet loss; Computer network; Network packet; Web browser; World Wide Web","score_opus":0.012677617634826945,"score_gpt":0.26476675772442576,"score_spread":0.2520891400895988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2473226904","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00078818906,0.000116307034,0.9951692,0.0026015267,0.0010800399,0.00013072483,0.000018231556,0.000033902765,0.00006186633],"genre_scores_gemma":[0.27515405,0.00022183213,0.72417116,0.000104334424,0.00015961137,0.000016467591,0.000008192156,0.000008585031,0.0001557365],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922866,0.000007172603,0.00021973276,0.00018521013,0.0002315971,0.00012765588],"domain_scores_gemma":[0.9993703,0.00013029363,0.00008064017,0.00022464604,0.000100016725,0.00009411746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039389924,0.00008391454,0.000105653184,0.00016686252,0.000018211938,0.00009378925,0.0011250539,0.00001682268,0.0000012810525],"category_scores_gemma":[0.00009107456,0.00005958984,0.000027166368,0.000050631585,0.0000070491797,0.0003853393,0.0003303014,0.00004008828,0.0000028149932],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002401111,0.000036720226,0.00002126362,0.000016210155,0.000186185,0.000012691524,0.000059610484,0.0109046595,0.00016096895,0.0040559326,0.0025186269,0.9820031],"study_design_scores_gemma":[0.0010354713,0.00003194378,0.00078442565,0.00015365158,0.000016708429,0.0000335528,0.000005109978,0.9523941,0.000009568232,0.00005776538,0.045387916,0.00008977497],"about_ca_topic_score_codex":6.059725e-7,"about_ca_topic_score_gemma":7.19496e-7,"teacher_disagreement_score":0.9819133,"about_ca_system_score_codex":0.000038499395,"about_ca_system_score_gemma":0.000010838684,"threshold_uncertainty_score":0.2430003},"labels":[],"label_agreement":null},{"id":"W2480493506","doi":"10.4018/978-1-61520-791-6.ch007","title":"Multiple Optimization of Network Carrier and Traffic Flow Goals Using a Heuristic Routing Decision System","year":2010,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Saint Mary's University","funders":"","keywords":"Heuristic; Mathematical optimization; Computer science; Network topology; Path (computing); Routing (electronic design automation); Consistent heuristic; Algorithm; Mathematics; Incremental heuristic search; Search algorithm; Beam search","score_opus":0.01152774713212188,"score_gpt":0.21599241318134166,"score_spread":0.20446466604921978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2480493506","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010431628,0.0007494949,0.95019674,0.000009041408,0.0016075427,0.0005595127,0.00006599033,0.0002656873,0.04550283],"genre_scores_gemma":[0.8671604,0.000005151291,0.13144161,0.00005395644,0.00056090084,0.000007489373,0.0000040332575,0.000037985115,0.0007285153],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977933,0.000048660575,0.00068500557,0.00065817527,0.00043148,0.00038335848],"domain_scores_gemma":[0.99817425,0.00024969294,0.000522199,0.00061262335,0.00024341443,0.00019780044],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032677685,0.00041562933,0.0006605426,0.00006324991,0.00025894144,0.00018019305,0.000516114,0.00051856815,0.0000038826433],"category_scores_gemma":[0.000045373654,0.00041074114,0.00016457701,0.00005188074,0.00010121714,0.00009057254,0.00023342103,0.00033065403,0.000005378647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003764194,0.0000044817352,0.000018037568,0.00004481032,0.000058628837,0.000031779902,0.00005284863,0.61590064,0.0000045092975,0.26608342,0.000054945194,0.117708266],"study_design_scores_gemma":[0.00061123713,0.00004833822,0.0000057484635,0.00090477604,0.000104172956,0.000101640006,0.000005520926,0.9952083,0.0000014974828,0.0022188711,0.00043481775,0.00035505116],"about_ca_topic_score_codex":0.000015632648,"about_ca_topic_score_gemma":0.000051259645,"teacher_disagreement_score":0.8661172,"about_ca_system_score_codex":0.00013464311,"about_ca_system_score_gemma":0.00021266851,"threshold_uncertainty_score":0.9998344},"labels":[],"label_agreement":null},{"id":"W2485710950","doi":"10.4018/978-1-4666-2175-6.ch011","title":"Symbolic Function Network","year":2012,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Quality of service; Network packet; Artificial neural network; Function (biology); Packet loss; Control (management); Real-time computing; Computer network; Artificial intelligence","score_opus":0.012790477844012214,"score_gpt":0.2068763753398914,"score_spread":0.19408589749587918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2485710950","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000034031596,0.0037147128,0.1132896,0.00011593602,0.0031838554,0.00026082137,0.0000075171324,0.0005758513,0.8788483],"genre_scores_gemma":[0.5155164,0.000053551634,0.0035960611,0.005584404,0.012264647,0.000074884214,0.000010038022,0.000106262305,0.46279377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99801147,0.000030097846,0.0003596926,0.00056293374,0.0004187367,0.00061706296],"domain_scores_gemma":[0.9984707,0.00004573293,0.00023608246,0.00085769384,0.000108133965,0.0002816156],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00018589295,0.0004447605,0.00043244936,0.00003825684,0.00017008216,0.00017067854,0.0008028737,0.00046140584,0.00006620264],"category_scores_gemma":[0.0000033906058,0.00043974983,0.00025367388,0.000033909982,0.00006031368,0.00012508107,0.00024936598,0.00036046992,0.001367102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009605452,0.0000032976607,0.000006157756,0.0000040075,0.0000610756,0.000008634175,0.0000074607915,0.00006525052,2.0464455e-7,0.6620372,0.012580277,0.32521683],"study_design_scores_gemma":[0.00029409607,0.0000768716,0.000059355207,0.000100321384,0.00010794602,0.000047837184,5.576065e-7,0.0016142509,3.279439e-7,0.4817067,0.51548064,0.0005110681],"about_ca_topic_score_codex":0.0000068341587,"about_ca_topic_score_gemma":0.000021343001,"teacher_disagreement_score":0.515513,"about_ca_system_score_codex":0.00014345243,"about_ca_system_score_gemma":0.00016125312,"threshold_uncertainty_score":0.99980545},"labels":[],"label_agreement":null},{"id":"W2486734307","doi":"10.1007/10973509_11","title":"Modeling TCP/RED: a Dynamical Approach","year":2006,"lang":"en","type":"book-chapter","venue":"Understanding complex systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Active queue management; Network congestion; Computer network; Computer science; Random early detection; Transmission Control Protocol; The Internet; TCP tuning; Explicit Congestion Notification; TCP Friendly Rate Control; World Wide Web; Network packet","score_opus":0.09353659918390825,"score_gpt":0.2314849398063634,"score_spread":0.13794834062245515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2486734307","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[7.7598315e-7,0.000562938,0.5817955,0.00011989796,0.00076875644,0.00040930122,0.000012043072,0.00050516805,0.41582564],"genre_scores_gemma":[0.79967237,0.000017706372,0.0053989952,0.00010402232,0.0011635415,0.00003759828,0.00015737017,0.00013015582,0.19331822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99645895,0.00007961291,0.00084840466,0.0011066776,0.0008661837,0.00064019754],"domain_scores_gemma":[0.9981973,0.00013613238,0.00030900803,0.0010281056,0.00011405332,0.00021535649],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042269315,0.00065657037,0.0009164091,0.00037030585,0.00039380303,0.0007109498,0.0012987237,0.00050778076,0.000023703391],"category_scores_gemma":[0.0000052311766,0.0006553139,0.00032275563,0.00011129534,0.000104262595,0.00020939644,0.00025237462,0.00062095834,0.00007225631],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063502716,0.000016520424,9.803349e-7,0.000076119075,0.00009254888,0.000024541438,0.00003964137,0.17219354,0.0000016045418,0.81350857,0.0135779055,0.00046168102],"study_design_scores_gemma":[0.000502857,0.00004092193,2.4298646e-7,0.00028479806,0.00004916901,0.000104932675,0.00004545772,0.95135164,1.2802472e-8,0.027974425,0.018974263,0.00067126245],"about_ca_topic_score_codex":0.00006027457,"about_ca_topic_score_gemma":0.000015637477,"teacher_disagreement_score":0.7996716,"about_ca_system_score_codex":0.0011223579,"about_ca_system_score_gemma":0.00014340431,"threshold_uncertainty_score":0.9995898},"labels":[],"label_agreement":null},{"id":"W2491366482","doi":"10.4018/978-1-61520-791-6.ch014","title":"Scalable Intra and Inter Domain IPv6 QoS Management and Pricing Scheme","year":2010,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University; Dalhousie University","funders":"","keywords":"Quality of service; Computer network; Computer science; Scalability; Network packet; Mobile QoS; Differentiated services; Traffic classification; IPv6; Inter-domain; Distributed computing; The Internet; Service (business); Service delivery framework; Multicast; Operating system","score_opus":0.007095084279027059,"score_gpt":0.20194603361449898,"score_spread":0.19485094933547192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2491366482","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00054759387,0.00068585854,0.086567275,0.00036363569,0.00082394434,0.0004798327,0.000007325245,0.00022358164,0.91030097],"genre_scores_gemma":[0.37207615,0.00017229308,0.24742582,0.005615826,0.0023502945,0.00014173657,0.0000057915527,0.0001500964,0.372062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836993,0.000015676787,0.00030010034,0.00070013705,0.00026086924,0.00035331206],"domain_scores_gemma":[0.99903095,0.000032737153,0.00013933238,0.00053439813,0.000056614255,0.00020599204],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018509783,0.00037139072,0.0003565008,0.00007136977,0.00014683724,0.000345228,0.0004944713,0.00029890033,0.000015728741],"category_scores_gemma":[0.0000028849138,0.0003496309,0.0000683484,0.000020945594,0.0001628479,0.00010373167,0.0006338134,0.00040922454,0.000048128735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009365464,0.0000037202647,0.000017424907,0.000026367314,0.00006592105,0.00005980756,0.000035524266,4.924456e-7,0.000008958046,0.7860275,0.0008220021,0.21292295],"study_design_scores_gemma":[0.0018519765,0.00017366551,0.0001490351,0.0006849559,0.00011895553,0.0002571044,0.000018064424,0.0040451237,0.000021666443,0.58540654,0.40608925,0.0011837023],"about_ca_topic_score_codex":0.000008440997,"about_ca_topic_score_gemma":0.000034542027,"teacher_disagreement_score":0.53823894,"about_ca_system_score_codex":0.000061611914,"about_ca_system_score_gemma":0.00004165668,"threshold_uncertainty_score":0.9998956},"labels":[],"label_agreement":null},{"id":"W2496548352","doi":"","title":"Smooth congestion control algorithms","year":2007,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Network congestion; Timeout; Computer science; Computer network; Network packet; TCP Westwood plus; Packet loss; Explicit Congestion Notification; TCP Friendly Rate Control; Real-time computing; Algorithm","score_opus":0.008620562787947941,"score_gpt":0.22817676492064962,"score_spread":0.21955620213270166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2496548352","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013140464,0.00014221782,0.97670984,0.0019967228,0.00065713085,0.00014378516,4.57186e-7,0.0005166992,0.0185191],"genre_scores_gemma":[0.9731886,0.0000059101826,0.0230147,0.0020840499,0.00024066381,0.000006719181,8.497565e-7,0.000005587583,0.0014529475],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893844,0.000031182153,0.0002067592,0.00027272492,0.00022035174,0.00033053922],"domain_scores_gemma":[0.9991852,0.00020610499,0.000052181815,0.00031525362,0.00009756455,0.00014369833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065567077,0.000109258064,0.0001248602,0.00006865998,0.00008915453,0.00009103312,0.0004198731,0.00006568482,0.000057836485],"category_scores_gemma":[0.00002184869,0.00009305867,0.000052786985,0.00022985956,0.000033960547,0.00026687753,0.000032604345,0.000106664666,0.00020415976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007850521,0.000022902977,0.00023779442,6.584456e-7,0.000007909637,0.000016160038,0.000024665624,0.00018323981,0.000058935628,0.17813186,0.0012411023,0.8200669],"study_design_scores_gemma":[0.003540265,0.00021072493,0.021433229,0.000014430301,0.000019367984,0.00004872424,0.000036055222,0.8503362,0.00032153574,0.0039072656,0.11962166,0.0005105643],"about_ca_topic_score_codex":0.00001211115,"about_ca_topic_score_gemma":0.000021058546,"teacher_disagreement_score":0.97187454,"about_ca_system_score_codex":0.000026436266,"about_ca_system_score_gemma":0.000034926998,"threshold_uncertainty_score":0.37948224},"labels":[],"label_agreement":null},{"id":"W2503127264","doi":"10.1002/9781119183587.ch13","title":"Multicast Routing Protocols","year":2015,"lang":"en","type":"other","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Multicast; Protocol Independent Multicast; Computer network; Internet Group Management Protocol; Xcast; Distance Vector Multicast Routing Protocol; IP multicast; Source-specific multicast; Computer science; Pragmatic General Multicast; Inter-domain; Distributed computing","score_opus":0.027560943815357834,"score_gpt":0.284031324836768,"score_spread":0.2564703810214102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2503127264","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.0997824e-8,0.00003824318,0.2925184,0.00017162108,0.00016804137,0.0036773381,0.0000013663705,0.000899827,0.70252514],"genre_scores_gemma":[0.000096210875,8.893949e-7,0.028623125,0.00026770178,0.00052440027,0.00204394,0.0000026072912,0.000098215096,0.9683429],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990719,0.000037993315,0.00013117498,0.00031937967,0.00022361371,0.00021597071],"domain_scores_gemma":[0.99920875,0.00002120745,0.00009437425,0.00051735307,0.00004477936,0.00011350779],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00015502505,0.00015983444,0.00019377752,0.00006603746,0.000021048138,0.000114844406,0.00070317235,0.00014160926,0.00061998196],"category_scores_gemma":[0.000018537932,0.00012762928,0.00003677851,0.00013580522,0.000019383473,0.000050078164,0.00013297235,0.00012610255,0.0011096209],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.692358e-7,0.000013267915,0.0000033038746,0.0000043256346,0.000010009042,0.0000059908584,0.000014583577,0.0000036644096,2.1381966e-7,0.021060538,0.82054234,0.15834123],"study_design_scores_gemma":[0.00031098688,0.000019869884,9.809985e-7,0.000089694106,0.0000026686773,0.0000038414955,0.0000025561253,0.06482071,5.738116e-7,0.00006827088,0.93451655,0.00016327525],"about_ca_topic_score_codex":0.000023869201,"about_ca_topic_score_gemma":0.00004431452,"teacher_disagreement_score":0.26581776,"about_ca_system_score_codex":0.000017078306,"about_ca_system_score_gemma":0.0001232296,"threshold_uncertainty_score":0.9996681},"labels":[],"label_agreement":null},{"id":"W2505795549","doi":"10.1504/ijcnds.2016.077939","title":"Comparative performance analysis of TCP-based congestion control algorithms","year":2016,"lang":"en","type":"article","venue":"International Journal of Communication Networks and Distributed Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Centre for Applied Research in Cancer Control","keywords":"Computer science; TCP Friendly Rate Control; TCP global synchronization; TCP Westwood plus; TCP tuning; TCP acceleration; CUBIC TCP; H-TCP; Zeta-TCP; Computer network; Algorithm; Network congestion; Goodput; Throughput; Network packet; Wireless; Telecommunications","score_opus":0.014760107641194021,"score_gpt":0.25890281349794253,"score_spread":0.24414270585674852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2505795549","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030846287,0.002205701,0.96464276,0.0016002302,0.00046457277,0.00010403726,0.000051342442,0.000020639518,0.000064409316],"genre_scores_gemma":[0.9986036,0.00055143255,0.0006273661,0.00006520284,0.00009501438,0.000008875928,0.00003105556,0.0000033632473,0.000014101101],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981942,0.00031906547,0.0007999344,0.00012908268,0.0004330326,0.00012467353],"domain_scores_gemma":[0.9959182,0.0008677379,0.0011435513,0.00035710927,0.001618373,0.00009499814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008348249,0.000121784185,0.00045939922,0.00026941256,0.00007127188,0.00011605811,0.0010288776,0.00007302225,0.0000072249154],"category_scores_gemma":[0.000043153654,0.00008417953,0.00014146262,0.00041464932,0.0001162914,0.00043428142,0.000060368242,0.0001266338,9.1067955e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018918868,0.00011721546,0.013903877,0.0000038207045,0.0017771743,0.0000034368727,0.00007328177,0.9088197,0.0000645453,0.014678485,0.00058415293,0.059785157],"study_design_scores_gemma":[0.0017149625,0.00009879508,0.02496701,0.00019752042,0.00019233904,0.000017954373,0.00003207088,0.97099245,0.000014224218,0.000036887963,0.0016391001,0.000096666736],"about_ca_topic_score_codex":0.0000115309795,"about_ca_topic_score_gemma":0.0000054425186,"teacher_disagreement_score":0.9677573,"about_ca_system_score_codex":0.00007374523,"about_ca_system_score_gemma":0.0000774366,"threshold_uncertainty_score":0.34327418},"labels":[],"label_agreement":null},{"id":"W2518617243","doi":"10.5325/jinfopoli.4.2014.0028","title":"End User Privacy and Policy-Based Networking","year":2014,"lang":"en","type":"article","venue":"Journal of Information Policy","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario College of Art and Design","funders":"","keywords":"Internet privacy; Privacy policy; Business; Information privacy; Computer science; Computer security","score_opus":0.005879436312157326,"score_gpt":0.22997362704812666,"score_spread":0.22409419073596934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2518617243","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007417139,0.00006422452,0.97208244,0.016581044,0.0002943039,0.00006160056,5.4399356e-7,0.00004049132,0.003458236],"genre_scores_gemma":[0.979957,0.000037340837,0.010665204,0.007888775,0.0014102566,0.000001213949,6.624756e-7,0.0000031285467,0.00003645957],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99898565,0.000055534696,0.00047062768,0.000045932044,0.0002553406,0.00018694422],"domain_scores_gemma":[0.99886584,0.00012802739,0.00050612097,0.00016855693,0.00018426779,0.00014720936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005512752,0.0000892435,0.00014611799,0.0004459773,0.000093596216,0.00025000246,0.0003775278,0.00004748406,0.0000041469702],"category_scores_gemma":[0.00018949385,0.000072899544,0.000058713653,0.0003758588,0.000028655326,0.0017807216,0.000055122408,0.00014424835,0.00001551995],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012004639,0.00000820552,0.0004145667,0.000010255382,0.000011481637,5.419467e-7,0.00049003906,0.005503187,0.0000041153417,0.17451137,0.0021802112,0.816854],"study_design_scores_gemma":[0.0015746675,0.00016638699,0.0064544966,0.00006246372,0.000008089457,0.000113154485,0.0000148026575,0.43798408,0.00003801937,0.0038333375,0.5496031,0.00014737925],"about_ca_topic_score_codex":0.000018769952,"about_ca_topic_score_gemma":8.457069e-7,"teacher_disagreement_score":0.97253984,"about_ca_system_score_codex":0.00005197798,"about_ca_system_score_gemma":0.00034465553,"threshold_uncertainty_score":0.2972757},"labels":[],"label_agreement":null},{"id":"W2525450965","doi":"10.1117/12.2249385","title":"Modeling and performance analysis of QoS data","year":2016,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Queueing theory; Quality of service; Petri net; Distributed computing; Stochastic Petri net; Data transmission; Data modeling; Transmission (telecommunications); Computer network; Real-time computing; Database; Telecommunications","score_opus":0.016279921010666352,"score_gpt":0.22526821925142482,"score_spread":0.20898829824075846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2525450965","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98637867,0.000116882766,0.010605184,0.0021322262,0.00013851297,0.00019559913,0.000034730823,0.00005842426,0.00033977593],"genre_scores_gemma":[0.9124986,0.00022375141,0.08695218,0.000048783975,0.00016334865,0.000027190452,0.0000031364907,0.00001480863,0.000068234185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982391,1.2091393e-8,0.0005537875,0.0004264936,0.0005187092,0.0002619191],"domain_scores_gemma":[0.9983049,0.00015062852,0.00025723706,0.00013346113,0.0010639172,0.00008984184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006847185,0.00019195177,0.00039001554,0.0001400185,0.000055490767,0.00007322835,0.0018564495,0.000099112134,0.000003987944],"category_scores_gemma":[0.00023454898,0.00013203255,0.0002885409,0.000522695,0.00014124994,0.0010113511,0.00044906503,0.00012049834,4.2640787e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007861485,0.00009316924,0.0017843035,0.00023556102,0.0019993451,5.1070383e-8,0.0001828909,0.0030662073,0.10826585,0.8576554,0.0007152647,0.025923347],"study_design_scores_gemma":[0.00053365075,0.000113254755,0.00067062344,0.00015159638,0.00030963842,0.0000030669005,0.00008981293,0.99370867,0.0036881943,0.0002545979,0.00031402698,0.0001628414],"about_ca_topic_score_codex":0.0000045517304,"about_ca_topic_score_gemma":1.8330844e-7,"teacher_disagreement_score":0.9906425,"about_ca_system_score_codex":0.00004239151,"about_ca_system_score_gemma":0.000028483948,"threshold_uncertainty_score":0.5384131},"labels":[],"label_agreement":null},{"id":"W2535434409","doi":"10.1109/cns.1988.4973","title":"Performance analysis of integrated voice/data services on a burst-switched network","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Set (abstract data type); Computer science; Boundary (topology); Differential (mechanical device); Differential equation; Numerical analysis; Mathematical optimization; Algorithm; Mathematics; Engineering; Mathematical analysis; Programming language","score_opus":0.016599476062438882,"score_gpt":0.23222831042179506,"score_spread":0.21562883435935618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2535434409","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3788593,0.0003773255,0.60316193,0.000611985,0.0005397668,0.00025479752,0.000016356767,0.00038400557,0.015794517],"genre_scores_gemma":[0.9886249,0.000042710224,0.010036341,0.0006708976,0.000037298865,0.0000059290005,0.000040720548,0.0000050956346,0.00053616427],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865687,0.00009088406,0.00029111296,0.00043548938,0.00025418773,0.00027144217],"domain_scores_gemma":[0.9982475,0.00013251045,0.00013415076,0.0012832674,0.0001233887,0.00007917511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050386024,0.00014702891,0.00030915294,0.00014547314,0.000079410645,0.00006348325,0.0013512776,0.000060781633,0.00010812666],"category_scores_gemma":[0.000012922076,0.000112272755,0.000075033255,0.0024110721,0.000025742187,0.00032804647,0.000110659894,0.000116031646,0.00006413902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091563714,0.00033265378,0.06603324,0.000041122923,0.002463302,0.0000068073464,0.0003819206,0.33041397,0.00006209009,0.12098254,0.0038536475,0.47533715],"study_design_scores_gemma":[0.000246051,0.00006665912,0.005110136,0.000021647036,0.00016282627,6.9172233e-7,0.000033296055,0.98493445,0.00003279392,0.000044026106,0.009213891,0.00013353648],"about_ca_topic_score_codex":0.00004224504,"about_ca_topic_score_gemma":0.0001315711,"teacher_disagreement_score":0.65452045,"about_ca_system_score_codex":0.00001673575,"about_ca_system_score_gemma":0.000069648544,"threshold_uncertainty_score":0.45783502},"labels":[],"label_agreement":null},{"id":"W2537017436","doi":"10.1109/apcc.2004.1391782","title":"A new practical packet loss estimator for MPLS VPN services","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Estimator; Packet loss; Computer science; Quality of service; Network packet; Computer network; Mathematics; Statistics","score_opus":0.013210341808154157,"score_gpt":0.27867749692941585,"score_spread":0.2654671551212617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2537017436","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014766698,0.00005403346,0.9692613,0.027040515,0.00030873614,0.00024034221,0.0000011505556,0.00032822296,0.0012890327],"genre_scores_gemma":[0.40699136,0.0000042027496,0.5892214,0.0024808715,0.0002686923,0.000029677216,0.0000018477659,0.000007932251,0.0009940283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990636,0.000014109865,0.00016151057,0.00030698578,0.00017019936,0.00028360487],"domain_scores_gemma":[0.999179,0.00017198587,0.00005276918,0.00032045748,0.00007235425,0.00020343033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013422425,0.000116155454,0.00013563533,0.000028022565,0.00009938646,0.00021045111,0.00040604794,0.000059530223,0.00004066309],"category_scores_gemma":[0.000021600228,0.00009444176,0.00006526177,0.00014847227,0.000016126945,0.0005060829,0.00006906917,0.00007298398,0.00019466752],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001981028,0.000048852307,0.00003701767,0.000012154573,0.000019324123,0.000016438637,0.00010833577,0.0008392482,0.000017129641,0.8681553,0.0056601404,0.12506627],"study_design_scores_gemma":[0.006748164,0.00052779424,0.00053251104,0.000096578566,0.00005965838,0.0002863617,0.00009401138,0.69514143,0.00070770306,0.1626045,0.13239835,0.00080293545],"about_ca_topic_score_codex":0.000034495748,"about_ca_topic_score_gemma":0.000055597375,"teacher_disagreement_score":0.7055508,"about_ca_system_score_codex":0.00002372048,"about_ca_system_score_gemma":0.00027578036,"threshold_uncertainty_score":0.38512233},"labels":[],"label_agreement":null},{"id":"W2540860276","doi":"10.1109/itre.2003.1270609","title":"A robust method for fitting the (/spl sigma//spl I.oarr/, /spl rho//spl I.oarr/) model to a traffic source","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Sigma; Envelope (radar); Traffic generation model; Quality of service; Real-time computing; Computer network; Telecommunications","score_opus":0.03776355966147694,"score_gpt":0.26329420214672034,"score_spread":0.2255306424852434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2540860276","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033733395,0.0003353614,0.98440444,0.0047339294,0.0006297293,0.0015351527,0.0000070249325,0.0007989747,0.0041820146],"genre_scores_gemma":[0.22556803,0.000013114673,0.7473134,0.0080651445,0.00038095616,0.00055007986,0.0000037560862,0.000074767064,0.018030774],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953468,0.0004829099,0.00081093673,0.0013706674,0.0006622824,0.0013263989],"domain_scores_gemma":[0.9966487,0.00083266845,0.00024845588,0.0014558815,0.00032616555,0.00048812895],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0027205981,0.0005949626,0.0006294036,0.00018987001,0.0008637705,0.00062851893,0.002066009,0.00024235276,0.00008259459],"category_scores_gemma":[0.00041036317,0.00044353792,0.00044617057,0.001046377,0.000084410865,0.00046837784,0.00024815963,0.00048128617,0.00011562096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002963099,0.00008280165,0.0000072789117,0.00001453144,0.00005562394,0.0000036459794,0.001054233,0.6754041,0.000047613932,0.124551594,0.009415964,0.18933302],"study_design_scores_gemma":[0.001283139,0.00017057447,0.0000062814993,0.000043856937,0.00006754855,0.00004249188,0.0003306599,0.950911,0.00015575897,0.0007490169,0.045635648,0.00060404197],"about_ca_topic_score_codex":0.000025123045,"about_ca_topic_score_gemma":0.00010899344,"teacher_disagreement_score":0.2755069,"about_ca_system_score_codex":0.000112845184,"about_ca_system_score_gemma":0.00036608614,"threshold_uncertainty_score":0.99980164},"labels":[],"label_agreement":null},{"id":"W2547343645","doi":"10.1109/its.2006.4433284","title":"Web services for the new internet: discussion and evaluation of the provisioning of interdomain services","year":2006,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Canarie","keywords":"Computer science; Internetworking; The Internet; World Wide Web; Web service; Voice over IP; Service-oriented architecture; Provisioning; Architecture; Context (archaeology); Services computing; Service (business); Domain Name System; Computer security; Computer network; Business","score_opus":0.008074847455027866,"score_gpt":0.23903315647773543,"score_spread":0.23095830902270756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2547343645","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49384075,0.0014068238,0.48559743,0.015855467,0.0005501181,0.001412757,0.0000024423503,0.000062659485,0.0012715288],"genre_scores_gemma":[0.9973891,0.0000031327434,0.0017938939,0.00011843738,0.000058092683,0.00001549159,7.1493116e-7,0.0000028853458,0.0006182693],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925196,0.00007032968,0.00019844194,0.00014318968,0.00025621822,0.00007985727],"domain_scores_gemma":[0.99932504,0.00014487602,0.00015490646,0.00024111613,0.00011874125,0.000015307121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059100665,0.00006522387,0.000085465996,0.000020874113,0.00005936673,0.000054076085,0.00051084784,0.000025003073,0.000009462295],"category_scores_gemma":[0.000004561655,0.000024986284,0.000044360633,0.00011650181,0.000027753145,0.00016970246,0.00016961763,0.000033946366,4.4627043e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024918236,0.00003132891,0.0017823107,0.00006703499,0.000022976636,2.7974288e-8,0.0013934649,0.003477558,0.0012961237,0.036738716,0.00065894215,0.9545066],"study_design_scores_gemma":[0.00059117534,0.000035392095,0.0042197974,0.00012093381,0.000031960724,8.7433153e-7,0.00023501927,0.98845696,0.00079278054,0.0043441914,0.001131271,0.000039656265],"about_ca_topic_score_codex":0.0001880029,"about_ca_topic_score_gemma":0.0009801312,"teacher_disagreement_score":0.9849794,"about_ca_system_score_codex":0.000007740819,"about_ca_system_score_gemma":0.00005265139,"threshold_uncertainty_score":0.10189111},"labels":[],"label_agreement":null},{"id":"W2548706059","doi":"10.1109/ccece.2016.7726610","title":"Adaptive distributed compression technique utilizing intermediate network nodes","year":2016,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Computer network; Network traffic control; Network packet; Quality of service; Network congestion; Packet loss; Network performance; Latency (audio); Network delay; Real-time computing; Queueing theory; Network simulation; Distributed computing","score_opus":0.015092425941105023,"score_gpt":0.22738974990933195,"score_spread":0.21229732396822693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2548706059","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00058605184,0.00009652311,0.99450064,0.0010493345,0.00037512326,0.00020702384,0.000004036746,0.0006498889,0.0025313578],"genre_scores_gemma":[0.9751598,0.000026183947,0.023942562,0.00027379883,0.00018946316,0.00006642561,0.0000019129682,0.0000072811977,0.00033255955],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882644,0.00009830717,0.00021191064,0.0003417619,0.00016367789,0.00035789033],"domain_scores_gemma":[0.9990584,0.00027569194,0.00008256734,0.0003876482,0.00008006024,0.00011561571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023258552,0.00014483929,0.00016449828,0.000034126824,0.00012079236,0.000060756112,0.00064713845,0.00007450134,0.000056787118],"category_scores_gemma":[0.000021099313,0.00008528477,0.000062348176,0.00022203817,0.00006712646,0.0003403095,0.00027109127,0.00009552366,0.000077571596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003156249,0.00003080024,0.00059635536,0.0000019254005,0.0000197456,0.000014079691,0.000024209778,0.00027188956,0.0010520081,0.13636887,0.011303964,0.8502846],"study_design_scores_gemma":[0.0033490534,0.0004648823,0.011416588,0.0013320509,0.0000325968,0.0000632065,0.000068791276,0.8864922,0.0077095893,0.03958969,0.048054308,0.0014270568],"about_ca_topic_score_codex":0.0000037610307,"about_ca_topic_score_gemma":0.0000052253467,"teacher_disagreement_score":0.97457373,"about_ca_system_score_codex":0.00003763828,"about_ca_system_score_gemma":0.00003508642,"threshold_uncertainty_score":0.3477812},"labels":[],"label_agreement":null},{"id":"W2551278857","doi":"10.5267/j.ijiec.2016.11.001","title":"An adaptive large neighborhood search heuristic for solving the reliable multiple allocation hub location problem under hub disruptions","year":2016,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematical optimization; Heuristic; Computer science; Location-allocation; Operations research; Mathematics","score_opus":0.030409962314109914,"score_gpt":0.27314246992123786,"score_spread":0.24273250760712795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2551278857","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004534056,0.0000582918,0.9860659,0.0072542904,0.0016565543,0.00031775664,0.000019750947,0.000075184005,0.000018170307],"genre_scores_gemma":[0.97957164,0.000011411795,0.018968605,0.00009318183,0.001245578,0.000037282243,0.000011729715,0.000016465594,0.00004410638],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984842,0.00005771044,0.00054263574,0.00020069725,0.00047154372,0.00024322573],"domain_scores_gemma":[0.9967741,0.0010818864,0.00027868518,0.00019203774,0.0015579066,0.00011539184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007244593,0.00014068204,0.0001514059,0.00023276806,0.00019932185,0.00024764222,0.00091042643,0.00008543331,0.0000068467257],"category_scores_gemma":[0.00032054857,0.00009866935,0.00010108373,0.0003106503,0.000029066954,0.0008747018,0.00005939623,0.00024530725,0.000006697303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045057754,0.00011226221,0.00013698296,0.0000017961108,0.00012303963,0.000002150418,0.00022437843,0.8158987,0.0003491929,0.13813984,0.00036113703,0.04460544],"study_design_scores_gemma":[0.0021110189,0.00022676798,0.0006477833,0.00018553702,0.000027381484,0.000038577728,0.00010678368,0.99351513,0.000097903816,0.0020726463,0.0008341481,0.00013632818],"about_ca_topic_score_codex":0.00001000052,"about_ca_topic_score_gemma":0.000008754042,"teacher_disagreement_score":0.9750376,"about_ca_system_score_codex":0.00021985323,"about_ca_system_score_gemma":0.0003624213,"threshold_uncertainty_score":0.40236193},"labels":[],"label_agreement":null},{"id":"W2555043760","doi":"10.1016/j.adhoc.2016.11.005","title":"A smart fairness mechanism for Concurrent multipath transfer in SCTP over wireless multi-hop networks","year":2016,"lang":"en","type":"article","venue":"Ad Hoc Networks","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer network; Computer science; Multipath propagation; Hop (telecommunications); Stream Control Transmission Protocol; Wireless; Mechanism (biology); Telecommunications; Channel (broadcasting); Network packet","score_opus":0.015654137134173553,"score_gpt":0.23825957091763145,"score_spread":0.2226054337834579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2555043760","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014857959,0.0019175182,0.977867,0.00077949563,0.0030597087,0.0011349292,0.000010442834,0.00034255435,0.000030363422],"genre_scores_gemma":[0.99381,0.00095998443,0.0027468305,0.00092762674,0.00046801197,0.00059978315,0.000009771021,0.000054383392,0.00042361906],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966946,0.00019272909,0.00065147766,0.001007762,0.0003104601,0.0011429263],"domain_scores_gemma":[0.9980183,0.0006882207,0.00011362965,0.0007024542,0.00018563782,0.000291753],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060870784,0.00047037876,0.0005768863,0.00012345341,0.00018793994,0.00015025759,0.0010712657,0.00036543203,0.000028230648],"category_scores_gemma":[0.000025441474,0.00036143875,0.00026418213,0.00046925474,0.00010466786,0.0005357455,0.00014484642,0.00035810441,0.000018135026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010029463,0.00019214694,0.00045036417,0.000012262996,0.000052475458,0.000024068351,0.00018975286,0.010145367,0.000058569476,0.091645606,0.00076984824,0.89635926],"study_design_scores_gemma":[0.0068612313,0.0001635784,0.0008202158,0.00026587074,0.00002601743,0.000007180313,0.00001536166,0.98646647,0.000035953326,0.00050510577,0.004252713,0.00058027875],"about_ca_topic_score_codex":0.000010924536,"about_ca_topic_score_gemma":0.0006243808,"teacher_disagreement_score":0.97895205,"about_ca_system_score_codex":0.00012561781,"about_ca_system_score_gemma":0.000082313556,"threshold_uncertainty_score":0.9998838},"labels":[],"label_agreement":null},{"id":"W2560016987","doi":"10.1186/s13638-016-0773-3","title":"How network monitoring and reinforcement learning can improve tcp fairness in wireless multi-hop networks","year":2016,"lang":"en","type":"article","venue":"EURASIP Journal on Wireless Communications and Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Computer network; Reinforcement learning; Zeta-TCP; Wireless mesh network; TCP acceleration; Testbed; Distributed computing; Wireless network; Transmission Control Protocol; TCP Friendly Rate Control; TCP delayed acknowledgment; TCP tuning; Network packet; Wireless; Telecommunications","score_opus":0.02515552832805429,"score_gpt":0.2495814148901344,"score_spread":0.22442588656208012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2560016987","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08498033,0.009092746,0.8939412,0.009546668,0.0016435107,0.00040668843,5.4962385e-7,0.00019268304,0.00019558983],"genre_scores_gemma":[0.9683601,0.027779065,0.0024218226,0.00014463406,0.0009337358,0.000043707973,0.0000014053094,0.000032205655,0.0002832967],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99740213,0.00056558277,0.0005736242,0.00043972782,0.00028571862,0.0007332229],"domain_scores_gemma":[0.99727553,0.00093648897,0.0004869627,0.00085956,0.00014481875,0.00029665828],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011788544,0.00033721238,0.00042047724,0.00016348038,0.0011759752,0.00082958525,0.0011831903,0.0001467836,0.0000012298874],"category_scores_gemma":[0.00002115151,0.0002623865,0.00008005967,0.00048069336,0.00017115672,0.0005783379,0.00065694493,0.0010903981,9.89963e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028364286,0.000038270082,0.022064742,0.000005101602,0.000044301843,0.000019537874,0.000289404,0.013088568,0.00012343338,0.007085711,0.000029464094,0.9571831],"study_design_scores_gemma":[0.0022029302,0.00020582949,0.0042914203,0.0013553853,0.000021051384,0.000094894946,0.00016875139,0.9841713,0.000020130474,0.00022410165,0.006735003,0.0005092576],"about_ca_topic_score_codex":0.0000124242,"about_ca_topic_score_gemma":0.0000689439,"teacher_disagreement_score":0.9710827,"about_ca_system_score_codex":0.00013304576,"about_ca_system_score_gemma":0.000058818867,"threshold_uncertainty_score":0.99998283},"labels":[],"label_agreement":null},{"id":"W2564717021","doi":"10.1109/iri.2016.21","title":"Predicting Students' Behavioral Patterns in University Networks for Efficient Bandwidth Allocation: A Hybrid Data Mining Method (Application Paper)","year":2016,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; University of Calgary","funders":"Alberta Innovates - Technology Futures; University of Calgary","keywords":"Computer science; Bandwidth (computing); The Internet; Dynamic bandwidth allocation; Cluster analysis; Bandwidth allocation; Network traffic control; Bandwidth management; Computer network; Data mining; Machine learning; World Wide Web","score_opus":0.024093780726503866,"score_gpt":0.2918058502030061,"score_spread":0.2677120694765022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2564717021","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07503245,0.000021159261,0.9228153,0.00130594,0.00017218744,0.00045469127,0.000015124811,0.00014826597,0.000034834953],"genre_scores_gemma":[0.9562869,0.000009628703,0.043215837,0.00014149476,0.00010248715,0.00002575556,0.000024985631,0.000007136055,0.00018579263],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985519,0.00010773104,0.00022607786,0.0006184434,0.00021844712,0.0002773902],"domain_scores_gemma":[0.9985724,0.00037768725,0.00010397854,0.000788087,0.000075535216,0.000082304774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086955406,0.00011880807,0.00014387471,0.00006623054,0.00012424155,0.00007284572,0.0015191649,0.000045267596,0.000010796975],"category_scores_gemma":[0.00001673834,0.000096258256,0.00003398674,0.00019512777,0.000016776536,0.00040268505,0.00046307867,0.000061416424,0.0000025465288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028878987,0.000155334,0.053139817,0.000003632558,0.000014416589,0.0000048076954,0.00012356939,0.0073241186,0.000039261973,0.00405562,0.00027426393,0.93483627],"study_design_scores_gemma":[0.0014256954,0.00005192186,0.010226485,0.000035599052,0.000020072215,0.0000040472632,0.00008575323,0.9862158,0.000015039036,0.000014866949,0.0017612461,0.000143493],"about_ca_topic_score_codex":0.00005566105,"about_ca_topic_score_gemma":0.0002492339,"teacher_disagreement_score":0.9788917,"about_ca_system_score_codex":0.00007897012,"about_ca_system_score_gemma":0.00004891365,"threshold_uncertainty_score":0.39252976},"labels":[],"label_agreement":null},{"id":"W2567882795","doi":"10.1016/j.comcom.2016.12.018","title":"Modelling and performance analysis of TCP variants for data collection in smart power grids","year":2017,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Vedecká Grantová Agentúra MŠVVaŠ SR a SAV","keywords":"Computer science; Zeta-TCP; TCP tuning; TCP acceleration; TCP Vegas; TCP Friendly Rate Control; Computer network; TCP global synchronization; Compound TCP; Transmission Control Protocol; HSTCP; Network packet","score_opus":0.0882163159250546,"score_gpt":0.30133368782097564,"score_spread":0.21311737189592103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2567882795","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024719661,0.00021275469,0.97314817,0.0012589289,0.00014051374,0.00017589505,0.000007235209,0.00002931226,0.00030753083],"genre_scores_gemma":[0.7855959,0.00023291817,0.21403709,0.00004545002,0.000010741987,0.000019429044,0.000025585463,0.0000030685756,0.000029823845],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992315,0.000059702805,0.0002536097,0.00025490276,0.00007866664,0.00012160182],"domain_scores_gemma":[0.9952543,0.0002411545,0.00017735428,0.004176234,0.00011415614,0.000036809273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044679554,0.00007607092,0.00020530222,0.00019560906,0.00048624762,0.00016768843,0.0032874001,0.000039611947,0.000001258735],"category_scores_gemma":[0.000015551588,0.000079610814,0.00003782058,0.00032371873,0.00008848126,0.0005885236,0.0013574286,0.00009349358,8.024335e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004610444,0.0004155248,0.048206232,0.0000308348,0.00079378847,7.637035e-7,0.0018223496,0.17831776,0.000011221195,0.072685644,0.0014220634,0.6962477],"study_design_scores_gemma":[0.0003357111,0.00003369576,0.034006596,0.000021213587,0.00006436972,9.1914757e-7,0.0000030952106,0.96428543,0.0000010271683,0.00018979007,0.0009803324,0.00007783363],"about_ca_topic_score_codex":0.00007403059,"about_ca_topic_score_gemma":0.00012579684,"teacher_disagreement_score":0.78596765,"about_ca_system_score_codex":0.000014123381,"about_ca_system_score_gemma":0.000047816025,"threshold_uncertainty_score":0.61088616},"labels":[],"label_agreement":null},{"id":"W2581590199","doi":"10.1109/hpcc-smartcity-dss.2016.0075","title":"Directional Core Selection Approach for Delay and Delay Variation Multicast Routing","year":2016,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Multicast; Computer science; Elmore delay; Network delay; Node (physics); Routing (electronic design automation); Variation (astronomy); Tree (set theory); End-to-end delay; Computer network; Transmission delay; Distributed computing; Algorithm; Propagation delay; Mathematics; Delay calculation; Engineering","score_opus":0.01910268530697649,"score_gpt":0.23154659970765784,"score_spread":0.21244391440068136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2581590199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005267553,0.000016876966,0.99271536,0.0004928243,0.00018029967,0.00020801721,0.0000013271266,0.0002095804,0.0009081429],"genre_scores_gemma":[0.8083529,0.0000031850184,0.19044302,0.00010739311,0.00016581906,0.00005314606,0.0000014207285,0.0000045312513,0.00086860434],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926996,0.00002522423,0.00013667406,0.00029430597,0.00010525362,0.00016857122],"domain_scores_gemma":[0.9994376,0.00024290707,0.000052990716,0.000090208894,0.00011938213,0.00005691142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025981243,0.00008192523,0.0000804648,0.000040232633,0.00017949464,0.000067754125,0.00010448412,0.000053632913,0.000009331687],"category_scores_gemma":[0.00004751816,0.000055260738,0.000029771,0.00012003218,0.000017463834,0.00029735014,0.000029591507,0.00003624902,0.0000042933134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028314,0.000052344112,0.0020667836,0.000004075344,0.00003249863,3.079202e-7,0.00012159892,0.0007712171,0.0015618351,0.262641,0.0005256943,0.7321943],"study_design_scores_gemma":[0.0007211182,0.000051294257,0.0032258185,0.0000052329365,0.000008476019,0.000032672986,0.000004666409,0.99437284,0.00006991517,0.0005874134,0.0008187895,0.00010178043],"about_ca_topic_score_codex":0.0000123112295,"about_ca_topic_score_gemma":0.000010458608,"teacher_disagreement_score":0.9936016,"about_ca_system_score_codex":0.000034336517,"about_ca_system_score_gemma":0.000029579485,"threshold_uncertainty_score":0.22534676},"labels":[],"label_agreement":null},{"id":"W2583075527","doi":"10.3934/dcdsb.2017058","title":"The Filippov equilibrium and sliding motion in an internet congestion control model","year":2017,"lang":"en","type":"article","venue":"Discrete and Continuous Dynamical Systems - B","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Control theory (sociology); Boundary (topology); Mathematics; Simple (philosophy); Routing (electronic design automation); Motion (physics); Network congestion; Topology (electrical circuits); Computer science; Control (management); Mathematical optimization; Mathematical analysis; Computer network; Artificial intelligence; Combinatorics","score_opus":0.010519102658071431,"score_gpt":0.23857846266740418,"score_spread":0.22805936000933275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2583075527","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6344574,0.0007697214,0.3617189,0.0014961091,0.00045908807,0.0004692369,0.000007856801,0.00010401649,0.0005176856],"genre_scores_gemma":[0.99916005,0.000026406296,0.00008546442,0.00006266615,0.00009887865,0.000063735984,0.000004574183,0.000011015779,0.00048717845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843013,0.00019737614,0.00034929207,0.00047421354,0.00018947166,0.0003595046],"domain_scores_gemma":[0.998833,0.00015987377,0.00020467851,0.00057258457,0.00007029883,0.00015954184],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00065102807,0.00019019516,0.00030767792,0.000038844966,0.00031365282,0.0016394968,0.0006328258,0.00012308547,4.5624924e-7],"category_scores_gemma":[0.00007595346,0.00013781677,0.000041753126,0.000036961206,0.00014170096,0.00079745083,0.00017879928,0.0002002792,0.0000015916416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022371233,0.000059191243,0.021194592,0.00004376174,0.00006284554,0.000037266567,0.0006853927,0.008005603,0.00055788364,0.5404255,0.00009170195,0.4286126],"study_design_scores_gemma":[0.0010638232,0.000114154755,0.008452632,0.000073357594,0.000013675322,0.000019008707,0.000075958604,0.9889378,0.0000014869809,0.0009833736,0.00008556651,0.00017913811],"about_ca_topic_score_codex":0.00020765582,"about_ca_topic_score_gemma":0.0002700915,"teacher_disagreement_score":0.98093224,"about_ca_system_score_codex":0.000030501225,"about_ca_system_score_gemma":0.000018301644,"threshold_uncertainty_score":0.9993969},"labels":[],"label_agreement":null},{"id":"W2588811355","doi":"10.29173/cais741","title":"High Speed Information Network Planning using Stochastic Optimization Method","year":2013,"lang":"en","type":"article","venue":"Proceedings of the Annual Conference of CAIS / Actes du congrès annuel de l ACSI","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Integrated Services Digital Network; Broadband Integrated Services Digital Network; Asynchronous Transfer Mode; Asynchronous communication; Quality of service; Multimedia; Broadband networks; Computer network; Network planning and design; Transmission (telecommunications); Broadband; Telecommunications network; Real-time computing; Telecommunications","score_opus":0.018685448187220007,"score_gpt":0.24201514088362464,"score_spread":0.22332969269640462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2588811355","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23143287,0.00006674234,0.76517284,0.0011945635,0.00038445395,0.000545594,0.000010964568,0.00011354528,0.0010784472],"genre_scores_gemma":[0.91090345,0.0000062558415,0.0885759,0.00028197197,0.00014708763,0.000017392713,0.000003217222,0.000011073169,0.00005367833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982209,0.000039606468,0.00060922274,0.00024907704,0.0004512739,0.00042989248],"domain_scores_gemma":[0.97441226,0.0001963946,0.0009964077,0.00021681083,0.024053637,0.0001244658],"candidate_categories":["scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.000632333,0.0002442343,0.0004062169,0.00014752093,0.00019082309,0.0030815424,0.0016929144,0.00014381303,0.000023834718],"category_scores_gemma":[0.0029828895,0.00019836782,0.00011307618,0.00064720534,0.00012523637,0.019671096,0.0004737939,0.0002392409,0.0000047165336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006237349,0.00005198085,0.0033735733,0.00010482034,0.00010643967,3.4550573e-7,0.011363678,0.86619836,0.00088353746,0.05599447,0.0021966905,0.059663758],"study_design_scores_gemma":[0.00050392625,0.00010384321,0.00362499,0.00024661084,0.0000502482,0.000021875885,0.00038127834,0.9899589,0.00047998928,0.0037152176,0.00067048206,0.00024264787],"about_ca_topic_score_codex":0.00013545096,"about_ca_topic_score_gemma":7.131771e-7,"teacher_disagreement_score":0.67947054,"about_ca_system_score_codex":0.000051918396,"about_ca_system_score_gemma":0.00019457885,"threshold_uncertainty_score":0.99795336},"labels":[],"label_agreement":null},{"id":"W2591642978","doi":"10.1109/ceeict.2016.7873064","title":"Throughput analysis for TCP NewReno","year":2016,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"TCP global synchronization; TCP acceleration; TCP Friendly Rate Control; Zeta-TCP; Computer science; Computer network; TCP Westwood plus; TCP tuning; CUBIC TCP; TCP Westwood; H-TCP; Compound TCP; Real-time computing; Distributed computing; Network congestion; Network packet","score_opus":0.015865735156986093,"score_gpt":0.23544709318155493,"score_spread":0.21958135802456885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2591642978","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048820802,0.00004535286,0.9853698,0.008580682,0.00018019315,0.00009105465,0.0000013708918,0.00021512824,0.0050282246],"genre_scores_gemma":[0.94245404,0.0000103549155,0.043478437,0.00094159896,0.00012804977,0.000030421172,5.603264e-7,0.0000031745744,0.012953385],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993264,0.000016659378,0.000119362194,0.00025331858,0.00009850878,0.00018574865],"domain_scores_gemma":[0.9992731,0.0002094076,0.00003379257,0.00035642993,0.00006560525,0.00006162024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012483641,0.00006797734,0.00012513474,0.000063625055,0.000058276586,0.000053536867,0.0004120999,0.000029330055,0.00012799543],"category_scores_gemma":[0.000015847882,0.00003836909,0.0001417453,0.0003732786,0.00001756951,0.00021186091,0.00004457455,0.00001498299,0.00009236886],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032116486,0.000010875761,0.0005248153,4.6697784e-7,0.00011927234,4.910369e-7,0.000017287606,0.00010623484,0.00004118988,0.3163159,0.0068896604,0.6759706],"study_design_scores_gemma":[0.0024126817,0.00018354658,0.004270282,0.0000108962495,0.00026382596,0.0000032537805,0.000013727115,0.5974834,0.0005201461,0.020467075,0.37386388,0.0005072788],"about_ca_topic_score_codex":0.0000045954826,"about_ca_topic_score_gemma":0.000028482998,"teacher_disagreement_score":0.9419658,"about_ca_system_score_codex":0.000012243813,"about_ca_system_score_gemma":0.000025707948,"threshold_uncertainty_score":0.1564646},"labels":[],"label_agreement":null},{"id":"W2606159080","doi":"10.1109/blackseacom.2016.7901568","title":"Prediction and preemptive control of network congestion in distributed real-time environment","year":2016,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Network congestion; Computer science; Bandwidth throttling; Computer network; Network traffic control; Explicit Congestion Notification; Latency (audio); Packet loss; Throughput; Quality of service; Real-time computing; Distributed computing; Network packet; Slow-start; Engineering; Operating system; Wireless","score_opus":0.005650794717790208,"score_gpt":0.17226875294683916,"score_spread":0.16661795822904896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2606159080","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03931544,0.000096687756,0.9580978,0.0014269829,0.00008564621,0.00030241284,0.000022636064,0.000095175514,0.00055720337],"genre_scores_gemma":[0.99799055,0.00018947409,0.0014663886,0.00003137708,0.000055364457,0.000029584926,0.0000032804849,0.0000035532407,0.00023041139],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990611,0.00010658983,0.0002449232,0.0002594256,0.0001385297,0.00018943753],"domain_scores_gemma":[0.9993437,0.00026662872,0.00009215191,0.00020686792,0.00002573265,0.00006492157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029265258,0.00009521994,0.00016992705,0.000033209817,0.000028464152,0.000013878212,0.00014033463,0.00006244555,0.00004151774],"category_scores_gemma":[0.00001677495,0.00006567706,0.00002356599,0.0000943172,0.000072333576,0.00022377449,0.00004672508,0.00003964757,0.000016526708],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027934738,0.00019170922,0.07519521,0.000009699169,0.00009160245,0.000010322566,0.00015077772,0.017590975,0.0058742664,0.14666346,0.0020074819,0.7519351],"study_design_scores_gemma":[0.005598291,0.000499273,0.37639102,0.0001461098,0.000028724704,0.00000964505,0.0000090645,0.6110138,0.00019476403,0.0048069805,0.0010472623,0.00025504347],"about_ca_topic_score_codex":0.0000121305775,"about_ca_topic_score_gemma":0.000005368361,"teacher_disagreement_score":0.95867515,"about_ca_system_score_codex":0.000043599044,"about_ca_system_score_gemma":0.000018996561,"threshold_uncertainty_score":0.26782328},"labels":[],"label_agreement":null},{"id":"W263665049","doi":"10.34626/cns3-h576","title":"Estudo para uma rede metropolitana comunitária","year":2006,"lang":"pt","type":"dissertation","venue":"Portuguese National Funding Agency for Science, Research and Technology (RCAAP Project by FCT)","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Humanities; Political science; Art","score_opus":0.06268609966126434,"score_gpt":0.38100677322565635,"score_spread":0.318320673564392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W263665049","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5383397,0.10468284,0.13375644,0.027194662,0.014061479,0.033626813,0.0033946587,0.0053212442,0.13962215],"genre_scores_gemma":[0.94262487,0.0018240433,0.0055899066,0.000080925514,0.00041841948,0.0019422132,0.0011313988,0.0000922854,0.046295963],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9871826,0.0003324509,0.0014701287,0.0030159475,0.004833621,0.0031652183],"domain_scores_gemma":[0.9889001,0.0015606335,0.00077919074,0.0011053176,0.007124306,0.00053041824],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":["sts"],"category_scores_codex":[0.011657259,0.00090571004,0.0010144104,0.009045768,0.005289195,0.0010698613,0.004691608,0.0011583283,0.00003484515],"category_scores_gemma":[0.0038107478,0.000888328,0.00024982315,0.014962664,0.0042191315,0.0013949921,0.00083536725,0.0022932577,0.000058727615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021067187,0.0008967226,0.0013465247,0.0002662966,0.000250626,0.000054928518,0.00053901237,0.000015059488,0.00399257,0.45029676,0.0489174,0.49321342],"study_design_scores_gemma":[0.009694308,0.011067913,0.0076805516,0.002077262,0.0003899077,0.00048621526,0.008836735,0.4928752,0.010500523,0.35908407,0.0905859,0.00672145],"about_ca_topic_score_codex":0.0005533587,"about_ca_topic_score_gemma":0.00020885793,"teacher_disagreement_score":0.4928601,"about_ca_system_score_codex":0.0011813871,"about_ca_system_score_gemma":0.007802114,"threshold_uncertainty_score":0.9999671},"labels":[],"label_agreement":null},{"id":"W2728076348","doi":"10.1109/iwqos.2017.7969116","title":"Copula-based parameter estimation for Markov-modulated Poisson Process","year":2017,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Copula (linguistics); Poisson distribution; Computer science; Markovian arrival process; Poisson process; Markov process; Count data; Marginal distribution; Estimation theory; Matching (statistics); Algorithm; Stochastic process; Markov chain; Statistics; Mathematical optimization; Random variable; Mathematics; Econometrics; Machine learning","score_opus":0.017799257089620005,"score_gpt":0.2923334045407073,"score_spread":0.2745341474510873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2728076348","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018324152,0.000012946366,0.9757736,0.0041270107,0.00032002473,0.00038824786,0.000002209151,0.0002492826,0.00080254],"genre_scores_gemma":[0.90257525,3.3294495e-7,0.09601827,0.00052213296,0.00004692343,0.000080583486,0.000009608054,0.000006712441,0.0007402049],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991679,0.000018344766,0.00015697835,0.00029497675,0.00014597295,0.0002158128],"domain_scores_gemma":[0.9988903,0.00011964929,0.00013529895,0.0006342135,0.00014928625,0.00007128855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002009433,0.00010909621,0.00012926047,0.000035535697,0.0003667832,0.00042865486,0.00073484675,0.00006215705,0.000019067264],"category_scores_gemma":[0.00015451542,0.00009183041,0.00005186958,0.000054645145,0.0000326922,0.0004598279,0.000030951185,0.000050803133,0.000023029783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052443145,0.000066105255,0.00041460685,0.000027129116,0.000018520213,0.0000028245004,0.0000433204,0.012388803,0.000037580692,0.011051687,0.0038036837,0.9720933],"study_design_scores_gemma":[0.0008847083,0.00006553071,0.0016664668,0.000018342509,0.000008548453,0.0000012829422,0.0000014111873,0.9921509,0.0004201814,0.003914112,0.00073339976,0.00013510187],"about_ca_topic_score_codex":0.000008457471,"about_ca_topic_score_gemma":0.000011994142,"teacher_disagreement_score":0.97976214,"about_ca_system_score_codex":0.00001498516,"about_ca_system_score_gemma":0.00006609475,"threshold_uncertainty_score":0.41335288},"labels":[],"label_agreement":null},{"id":"W2761211730","doi":"10.17760/d20256664","title":"Rigorous evaluation of performance and policy impacts of transport protocols and in-network devices","year":2017,"lang":"en","type":"dissertation","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Science North","funders":"","keywords":"Computer science; Network performance; Reliability (semiconductor); Distributed computing; Popularity; The Internet; Computer network; Risk analysis (engineering); World Wide Web","score_opus":0.02162005847316153,"score_gpt":0.3255823196856288,"score_spread":0.3039622612124673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2761211730","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9753013,0.00084762444,0.0008481904,0.00007608834,0.00012159262,0.008563134,0.0000027824226,0.00002922074,0.014210052],"genre_scores_gemma":[0.99787015,0.00013191132,0.0006282964,0.000015296482,0.00007297149,0.00097318384,0.0000148835425,0.0000069518937,0.00028634132],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9987122,0.000059014787,0.00038651418,0.000268639,0.00039780134,0.000175839],"domain_scores_gemma":[0.99883497,0.000046379424,0.00047311382,0.0003221583,0.00026831843,0.00005508366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093213795,0.00016091297,0.0003588173,0.00013935634,0.00006292617,0.00003627594,0.00032509625,0.00014677196,0.0000069601297],"category_scores_gemma":[0.000027693834,0.00013865456,0.000030933476,0.00014600076,0.00004265203,0.00034076817,0.000012199603,0.000109578854,3.6777368e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010454261,0.00003572417,0.025067374,0.00043884592,0.000029252835,6.9942445e-7,0.0007245865,0.00085977506,0.000024372674,0.0033184495,0.000021044705,0.9693753],"study_design_scores_gemma":[0.001744993,0.00023249896,0.85761935,0.0016435155,0.00007301252,0.000004506287,0.000046150948,0.13707821,0.000260694,0.0007434891,0.00028526463,0.00026830513],"about_ca_topic_score_codex":0.00014216421,"about_ca_topic_score_gemma":0.002581622,"teacher_disagreement_score":0.96910703,"about_ca_system_score_codex":0.000018492476,"about_ca_system_score_gemma":0.00051758514,"threshold_uncertainty_score":0.56541693},"labels":[],"label_agreement":null},{"id":"W2761527662","doi":"","title":"Multicast Receiver Access Control in the Automatic Multicast Tunneling (AMT) Environment","year":2015,"lang":"en","type":"article","venue":"International Conference on Networks","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Multicast; Source-specific multicast; Pragmatic General Multicast; Protocol Independent Multicast; Xcast; Computer network; Computer science; IP multicast","score_opus":0.07427502077366123,"score_gpt":0.3025141917393296,"score_spread":0.22823917096566837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2761527662","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010270829,0.00009603011,0.9632815,0.014552087,0.0015819145,0.00056296116,0.0000050701265,0.00014939574,0.009500182],"genre_scores_gemma":[0.9950297,0.000046726378,0.0013177589,0.0029907634,0.0003499193,0.00011652083,0.000007990885,0.000010095355,0.00013052746],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978618,0.00027111283,0.00040045712,0.00044529638,0.0006669701,0.00035438273],"domain_scores_gemma":[0.99867594,0.0004371759,0.00015147799,0.00046771942,0.00012814364,0.00013956346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000784781,0.00021858743,0.00020361318,0.00011066997,0.000078638855,0.0005700896,0.0022472485,0.00009694177,0.00013413018],"category_scores_gemma":[0.00008686436,0.0001634398,0.00006959551,0.00015978266,0.00008298104,0.00047468496,0.00016375502,0.00041969484,0.00017147488],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100470956,0.00036397282,0.0021667017,0.0000028251272,0.00007882272,0.00012063682,0.0010894672,0.42054412,0.000010229421,0.13984072,0.0028225076,0.4328595],"study_design_scores_gemma":[0.001694322,0.000070198206,0.0029294458,0.00006586897,0.000008214582,0.000015723874,0.000114810384,0.99174446,0.0000012234833,0.0012967176,0.0018727483,0.00018628842],"about_ca_topic_score_codex":0.000026931883,"about_ca_topic_score_gemma":0.000028527329,"teacher_disagreement_score":0.98475885,"about_ca_system_score_codex":0.0001332262,"about_ca_system_score_gemma":0.00007044545,"threshold_uncertainty_score":0.66648823},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.026777492784961682,"score_gpt":0.2346270701720457,"score_spread":0.207849577387084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765444119","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071258307,0.00006657575,0.98910326,0.0015635167,0.0005310942,0.00056032115,0.000011430247,0.00020625962,0.0008317168],"genre_scores_gemma":[0.98826194,0.000011953401,0.0103251,0.00014935082,0.00011730569,0.00022810335,0.0000016540507,0.000014130631,0.0008904757],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989491,0.00003408483,0.0001907805,0.0003622094,0.00016123007,0.00030259113],"domain_scores_gemma":[0.9988981,0.00015565017,0.00015642766,0.00049526495,0.00019999621,0.00009455415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018565258,0.00016608843,0.000195898,0.00005520048,0.0007064284,0.0004147397,0.0006437734,0.00007078117,0.000019222085],"category_scores_gemma":[0.000013155616,0.0001468396,0.000085100095,0.000056583212,0.00010585884,0.0013114909,0.0000068606046,0.00017961406,0.000015369227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035527008,0.000088356814,0.00035927587,0.00002247841,0.00018161055,0.0000048058655,0.0007827243,0.022474566,0.00013610208,0.011247801,0.00017650965,0.9641705],"study_design_scores_gemma":[0.003172942,0.00039575045,0.005924059,0.00013704856,0.00008441909,0.000024855577,0.000039221468,0.98568636,0.0004097958,0.000092085764,0.003769471,0.00026397075],"about_ca_topic_score_codex":0.000027937778,"about_ca_topic_score_gemma":0.00014277229,"teacher_disagreement_score":0.9811361,"about_ca_system_score_codex":0.00004085365,"about_ca_system_score_gemma":0.00007204319,"threshold_uncertainty_score":0.59879446},"labels":[],"label_agreement":null},{"id":"W2770845104","doi":"10.1002/net.21792","title":"Open shortest path first routing under random early detection","year":2017,"lang":"en","type":"article","venue":"Networks","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Open Shortest Path First; Path vector protocol; Shortest path problem; Equal-cost multi-path routing; Static routing; Private Network-to-Network Interface; Routing (electronic design automation); Constrained Shortest Path First; Link-state routing protocol; Computer network; Routing Information Protocol; Routing protocol; Mathematical optimization; Distributed computing; K shortest path routing; Mathematics; Theoretical computer science; Graph","score_opus":0.01773501321753399,"score_gpt":0.24342181495283888,"score_spread":0.2256868017353049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2770845104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007899494,0.0001374723,0.98186314,0.0012894646,0.0015079037,0.00034553895,3.5028344e-7,0.00018725122,0.006769357],"genre_scores_gemma":[0.9971926,0.000032420885,0.00096273713,0.00044638253,0.00076645886,0.000048477923,0.0000010733525,0.0000137585985,0.0005360736],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987112,0.0000641513,0.00022155793,0.00044098182,0.0001764286,0.00038568044],"domain_scores_gemma":[0.99839497,0.00016665025,0.00021191756,0.0010392986,0.0000621135,0.00012506395],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005527363,0.00015879853,0.00021849584,0.000023612802,0.0014126188,0.0023078506,0.0024496666,0.00012370863,0.000017595929],"category_scores_gemma":[0.000041614432,0.00014596917,0.00007611388,0.00009324776,0.000054387365,0.0009785054,0.0007154838,0.00026827664,0.000044474793],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006199195,0.000035660003,0.00444249,0.0000011331707,0.000039701987,0.000018792187,0.00010840172,0.06702939,0.000005255578,0.012543119,0.0013558882,0.9143582],"study_design_scores_gemma":[0.0017251208,0.000058169804,0.03200101,0.00004566734,0.000013555487,0.000008997582,0.000006007004,0.96213096,0.0000060482917,0.00066714274,0.003132229,0.00020508858],"about_ca_topic_score_codex":0.00018435808,"about_ca_topic_score_gemma":0.0005464315,"teacher_disagreement_score":0.9892931,"about_ca_system_score_codex":0.00003606352,"about_ca_system_score_gemma":0.000030148272,"threshold_uncertainty_score":0.9998874},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Explicit Congestion Notification; Computer science; Computer network; Network congestion; Slow-start","score_opus":0.05427740368329733,"score_gpt":0.2902547687433616,"score_spread":0.23597736506006425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2773740107","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15675624,0.007873655,0.40215275,0.0010497728,0.008003106,0.0050809286,0.0000117817535,0.0008849414,0.41818684],"genre_scores_gemma":[0.99402755,0.0026905206,0.00056459,0.000045857345,0.00036714075,0.00022153309,0.000086205466,0.000018524179,0.0019781014],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99617636,0.00026284956,0.0009148427,0.00064924214,0.0016846586,0.0003120214],"domain_scores_gemma":[0.9973746,0.00014382366,0.0005332626,0.00086724164,0.0010124557,0.00006864702],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0037753494,0.0002807394,0.0004695701,0.00031908066,0.0000554226,0.00006645313,0.00069376646,0.0004267113,0.00022449992],"category_scores_gemma":[0.00008550782,0.0002715799,0.00010266035,0.0006477203,0.0000353481,0.00041961597,0.00005624203,0.00039304156,0.000039740822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011563264,0.00005259311,0.00069557637,0.000020024694,0.000016358861,7.505525e-7,0.00005311676,0.1335217,0.000001671564,0.0008981349,0.0016683098,0.8630602],"study_design_scores_gemma":[0.0005348829,0.000057116016,0.0284184,0.0002582009,0.000060628285,0.000010815229,0.000006856762,0.96637464,0.000013413627,0.00005246516,0.0039474647,0.0002651099],"about_ca_topic_score_codex":0.00011474289,"about_ca_topic_score_gemma":0.00011752876,"teacher_disagreement_score":0.8627951,"about_ca_system_score_codex":0.00040267268,"about_ca_system_score_gemma":0.0012635365,"threshold_uncertainty_score":0.99997365},"labels":[],"label_agreement":null},{"id":"W2777927072","doi":"10.1002/dac.3489","title":"Directional core selection approach and dynamic tree reorganization for delay and delay variation multicast routing","year":2017,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Multicast; Computer science; Distance Vector Multicast Routing Protocol; Protocol Independent Multicast; Computer network; Variation (astronomy); Xcast; Source-specific multicast; Tree (set theory); Distributed computing; Session (web analytics); Routing (electronic design automation); Algorithm; Mathematics","score_opus":0.021355099317867086,"score_gpt":0.2843390137482789,"score_spread":0.2629839144304118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2777927072","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03472558,0.00062947674,0.96186334,0.0014371733,0.0007742599,0.00021696271,0.000004065208,0.000032277472,0.00031684144],"genre_scores_gemma":[0.9653174,0.00027246503,0.034030117,0.000037436035,0.00020827852,0.00001739682,0.000010616796,0.000009680333,0.00009656309],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988007,0.00012076416,0.00049591664,0.00016219274,0.00032404816,0.000096394266],"domain_scores_gemma":[0.9969102,0.00029799403,0.0010931176,0.00029333943,0.0013418562,0.00006349717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010178246,0.00010417559,0.00017354405,0.00014652341,0.0004949032,0.0007665121,0.0008513663,0.000076080076,8.752827e-7],"category_scores_gemma":[0.00030685266,0.00009867439,0.00004335413,0.000062063766,0.000056781075,0.0010225136,0.00013714889,0.00015005868,7.09243e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003669307,0.0003728286,0.028137514,0.000032829153,0.000950752,0.000006026461,0.003953449,0.028960437,0.0031725487,0.44838542,0.00051931676,0.48514196],"study_design_scores_gemma":[0.0011296776,0.000052763018,0.027214423,0.00008119717,0.000025868556,0.00043856396,0.00007358567,0.96904683,0.000011639012,0.00065313873,0.0011729621,0.00009936093],"about_ca_topic_score_codex":0.000041831052,"about_ca_topic_score_gemma":0.000025253545,"teacher_disagreement_score":0.94008636,"about_ca_system_score_codex":0.00010974637,"about_ca_system_score_gemma":0.000067716406,"threshold_uncertainty_score":0.73914945},"labels":[],"label_agreement":null},{"id":"W2778003214","doi":"10.1016/j.jnca.2017.12.016","title":"Zero-queue ethernet congestion control protocol based on available bandwidth estimation","year":2017,"lang":"en","type":"article","venue":"Journal of Network and Computer Applications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); Research Canada; Université du Québec à Montréal; École de Technologie Supérieure","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Ethernet flow control; HOL; Network interface controller; Packet loss; Network packet; Ethernet; Router; Network congestion; Embedded system","score_opus":0.012501517739704591,"score_gpt":0.25789552673840205,"score_spread":0.24539400899869745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2778003214","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011092488,0.000044245346,0.9896322,0.0022944717,0.00021545043,0.006826853,0.0000015337567,0.000056564342,0.0008177443],"genre_scores_gemma":[0.8833943,0.000013940113,0.104602434,0.0016190404,0.001741865,0.008387407,0.000002690071,0.000020822818,0.00021746743],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860126,0.00011370165,0.00046552435,0.00027590644,0.00030201755,0.00024160878],"domain_scores_gemma":[0.99776995,0.0002760354,0.00083568174,0.0006821966,0.0002596162,0.00017648883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071984687,0.00017978353,0.00029714665,0.00007526951,0.0006353769,0.0006116916,0.00084256654,0.0000951844,0.000015126044],"category_scores_gemma":[0.00001312024,0.00015018012,0.00009602145,0.00010689148,0.00008450701,0.00043363628,0.000063725325,0.0002793523,0.00003375533],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009223497,0.00015740396,0.0010844283,0.000017268329,0.000046352045,0.000007630393,0.000033145625,0.27173072,0.0000058193496,0.0407748,0.019264422,0.6667858],"study_design_scores_gemma":[0.0022246307,0.00033896972,0.003205432,0.00010075944,0.00002612168,0.000034407432,5.428365e-7,0.93686265,0.000004364399,0.00488861,0.05216472,0.00014881398],"about_ca_topic_score_codex":0.0000029249195,"about_ca_topic_score_gemma":0.0000022783915,"teacher_disagreement_score":0.8850298,"about_ca_system_score_codex":0.000033988257,"about_ca_system_score_gemma":0.00012682372,"threshold_uncertainty_score":0.6124167},"labels":[],"label_agreement":null},{"id":"W2781967658","doi":"10.1109/ism.2017.14","title":"Priced-Based Fair Bandwidth Allocation for Networked Multimedia","year":2017,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Bandwidth (computing); Computer network; Bandwidth allocation; Throughput; Quality of service; The Internet; Exploit; Multipath propagation; Dynamic bandwidth allocation; Network topology; Multimedia; Telecommunications; Computer security; Wireless; Channel (broadcasting)","score_opus":0.018261103948328403,"score_gpt":0.25977793132409244,"score_spread":0.24151682737576402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2781967658","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00062930014,0.000038022015,0.98859924,0.0051314505,0.0007567957,0.00040554075,7.888165e-7,0.00026432457,0.0041745547],"genre_scores_gemma":[0.8828648,0.0000024544884,0.11431278,0.00083494995,0.00031157723,0.00011267026,0.000005382784,0.000006967518,0.001548435],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912935,0.000021704256,0.00015239356,0.0003042665,0.00013941614,0.00025286822],"domain_scores_gemma":[0.99866104,0.0001950297,0.00013446486,0.0007918153,0.00011961217,0.00009802598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002796316,0.000109052904,0.0001232565,0.000029620389,0.0004237825,0.00031084928,0.0010090873,0.000061026836,0.000014827904],"category_scores_gemma":[0.000059440405,0.00009213096,0.00007211322,0.000046183137,0.000041453168,0.00036133503,0.000058915735,0.00005580022,0.00003534554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020061101,0.00003749352,0.00046831009,0.00000496058,0.0000130547,9.975563e-7,0.00002878318,0.004138725,0.000039939267,0.019805312,0.010791322,0.96465105],"study_design_scores_gemma":[0.0012135907,0.000050114606,0.0017609304,0.000009637895,0.000007084813,4.6119064e-7,0.0000018255163,0.97570324,0.00017815517,0.00042082072,0.020522095,0.00013201566],"about_ca_topic_score_codex":0.000014598426,"about_ca_topic_score_gemma":0.000057672067,"teacher_disagreement_score":0.97156453,"about_ca_system_score_codex":0.000018132881,"about_ca_system_score_gemma":0.000087260276,"threshold_uncertainty_score":0.37569916},"labels":[],"label_agreement":null},{"id":"W2782837013","doi":"10.23919/ifipnetworking.2017.8264883","title":"Implementation of PI<sup>2</sup> queuing discipline for classic TCP traffic in ns-3","year":2017,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trinity College","funders":"","keywords":"Correctness; Computer science; Queueing theory; Pi; Algorithm; Mathematics; Computer network","score_opus":0.021090244472217936,"score_gpt":0.30700994161195583,"score_spread":0.2859196971397379,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2782837013","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42496505,0.000044385404,0.5693008,0.004129883,0.00021493806,0.00060516805,0.000004566453,0.00008874579,0.00064647547],"genre_scores_gemma":[0.9912083,0.0000068698505,0.008065475,0.00009427579,0.00010306167,0.00010158419,0.000004007544,0.0000065890727,0.00040983557],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898356,0.000029296585,0.0003279254,0.00028189502,0.00012874558,0.00024857145],"domain_scores_gemma":[0.9991027,0.0001141333,0.00017821933,0.00048492462,0.00006576785,0.000054244858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035825526,0.00010599626,0.0001856445,0.000078207595,0.00017905046,0.00014556109,0.0006982362,0.000043078817,0.000032393655],"category_scores_gemma":[0.000021386888,0.00009259642,0.00007247359,0.00008374777,0.000043206892,0.0004877608,0.00010860756,0.00006473906,0.000006190504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014104391,0.000045480723,0.0017621383,0.000013512591,0.000012455035,0.0000013957255,0.0005678456,0.015330332,0.0000543697,0.052797966,0.0008586786,0.9285417],"study_design_scores_gemma":[0.001870312,0.000098770266,0.007023469,0.00002370792,0.000007839487,0.0000012974173,0.00034808152,0.9882933,0.00017911207,0.00084211986,0.0011776751,0.00013435069],"about_ca_topic_score_codex":0.00004591685,"about_ca_topic_score_gemma":0.00081053464,"teacher_disagreement_score":0.9729629,"about_ca_system_score_codex":0.000028544633,"about_ca_system_score_gemma":0.00007571362,"threshold_uncertainty_score":0.37759724},"labels":[],"label_agreement":null},{"id":"W2785996293","doi":"10.1109/hpcc-smartcity-dss.2017.20","title":"A Multi-core Multicast Approach for Delay and Delay Variation Multicast Routing","year":2017,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Multicast; Computer science; Xcast; Protocol Independent Multicast; Computer network; Source-specific multicast; Distance Vector Multicast Routing Protocol; Distributed computing; Pragmatic General Multicast; Inter-domain; Routing (electronic design automation); End-to-end delay","score_opus":0.04745818930391654,"score_gpt":0.2821028537992597,"score_spread":0.23464466449534316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2785996293","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00973428,0.00003545222,0.98796946,0.000489686,0.00022421019,0.00053098926,0.0000033760834,0.00017602164,0.0008365401],"genre_scores_gemma":[0.5802339,0.0000025386773,0.41908804,0.00012011507,0.00009333196,0.000056487428,0.0000022306006,0.0000074599666,0.0003959153],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872094,0.000028996748,0.00024102179,0.00052338105,0.00014292619,0.0003427305],"domain_scores_gemma":[0.99869037,0.00018681536,0.00017219005,0.000662691,0.00014787813,0.00014003251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045160175,0.00017032208,0.00019212616,0.000042370702,0.00079698185,0.00059780764,0.0006005612,0.00009873146,0.000003650473],"category_scores_gemma":[0.00022202321,0.0001441654,0.00006404774,0.00004568492,0.00007009322,0.0005613472,0.00021943706,0.000110825364,0.000008334048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051288123,0.00031347355,0.0038400465,0.000031383155,0.00009555018,0.000011399607,0.0016955853,0.0026165268,0.00063826883,0.12032025,0.00016402219,0.8702222],"study_design_scores_gemma":[0.002043318,0.000042417123,0.010672331,0.000009877731,0.0000201362,0.00002232947,0.000034103516,0.9866252,0.000012628662,0.000078110745,0.00024540594,0.0001941685],"about_ca_topic_score_codex":0.00005321881,"about_ca_topic_score_gemma":0.000036787158,"teacher_disagreement_score":0.98400867,"about_ca_system_score_codex":0.00002082965,"about_ca_system_score_gemma":0.00003431885,"threshold_uncertainty_score":0.61298203},"labels":[],"label_agreement":null},{"id":"W2789818168","doi":"10.1142/s0218127418500050","title":"Model of a Frame of Dynamic Routing and Its Equilibrium","year":2018,"lang":"en","type":"article","venue":"International Journal of Bifurcation and Chaos","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"National Natural Science Foundation of China","keywords":"Computer science; Router; Queue; Frame (networking); Stability (learning theory); Routing (electronic design automation); Static routing; Mathematical optimization; Equal-cost multi-path routing; Control theory (sociology); Mathematics; Computer network; Routing protocol; Artificial intelligence","score_opus":0.016083927039865047,"score_gpt":0.26650350477551576,"score_spread":0.2504195777356507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789818168","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6936018,0.00032687042,0.30355135,0.0020022928,0.0002928317,0.000035212848,0.000002678356,0.000006383317,0.00018057959],"genre_scores_gemma":[0.9964345,0.00008402015,0.0032007357,0.000115665345,0.00009301077,5.563023e-7,3.939428e-7,0.0000025939753,0.0000684973],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926937,0.000019693678,0.00032501598,0.000080222264,0.00024790852,0.000057798523],"domain_scores_gemma":[0.99873817,0.000050020746,0.00039627354,0.000061139275,0.00071157736,0.000042827192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022304065,0.000051508756,0.00011178506,0.0001198843,0.000015664915,0.000027268537,0.0002772338,0.000031523305,0.0000057853554],"category_scores_gemma":[0.00004443363,0.0000452961,0.00003307178,0.0000628384,0.000049527778,0.0002757193,0.00006255665,0.00006176287,7.6095324e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002624195,0.00026033935,0.0018895442,0.00005106391,0.00035650967,0.000005863346,0.006121159,0.003905238,0.12048553,0.22516084,0.0002105134,0.64129096],"study_design_scores_gemma":[0.0004815943,0.00010484808,0.0011821716,0.000078225385,0.000007930006,0.00004279154,0.000038892646,0.993943,0.0020026676,0.0020347126,0.00003990659,0.000043291762],"about_ca_topic_score_codex":0.0000015113322,"about_ca_topic_score_gemma":0.0000015535834,"teacher_disagreement_score":0.99003774,"about_ca_system_score_codex":0.000012541168,"about_ca_system_score_gemma":0.000061999795,"threshold_uncertainty_score":0.18471213},"labels":[],"label_agreement":null},{"id":"W2799193842","doi":"10.1109/itc30.2018.10058","title":"A General Per-Flow Service Curve for GPS","year":2018,"lang":"en","type":"preprint","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Global Positioning System; Generalized processor sharing; Affine transformation; Scheduling (production processes); Computer science; Processor sharing; Constant (computer programming); Network packet; Service (business); Variable (mathematics); Computer network; Real-time computing; Algorithm; Mathematics; Mathematical optimization; Quality of service; Queue; Telecommunications; Dynamic priority scheduling; Round-robin scheduling; Geometry; Mathematical analysis","score_opus":0.023239566561561162,"score_gpt":0.25632493910803134,"score_spread":0.23308537254647016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2799193842","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018372339,0.00020338429,0.98153454,0.0075997924,0.0030827788,0.0006569069,0.00001925215,0.00054655946,0.004519581],"genre_scores_gemma":[0.09188741,0.000031920415,0.8758588,0.01188969,0.0052931397,0.0007402277,0.000087786146,0.000050058916,0.014160979],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815303,0.00006543441,0.0002932791,0.0008436332,0.00023970068,0.00040490614],"domain_scores_gemma":[0.99804693,0.00011107544,0.00013477402,0.0010659744,0.0004951578,0.00014606406],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003363314,0.00029460483,0.0003254838,0.00006799568,0.00012742612,0.00036019398,0.001778102,0.00027677088,0.00014189642],"category_scores_gemma":[0.000015213934,0.0002605979,0.00019937864,0.00012250926,0.00002835709,0.0001313541,0.0010466228,0.00026701475,0.00027127934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048187205,0.00012808439,0.000063095475,0.00017511025,0.00021362181,0.000006403416,0.00075004325,0.017423136,0.000015313843,0.10139344,0.18708624,0.6926973],"study_design_scores_gemma":[0.00040806513,0.000050507617,0.000051591785,0.000030881936,0.000020156886,0.0000052837045,0.0000044474496,0.93796784,0.000018547717,0.005851199,0.05526114,0.00033032807],"about_ca_topic_score_codex":0.000055205655,"about_ca_topic_score_gemma":0.00014991531,"teacher_disagreement_score":0.92054474,"about_ca_system_score_codex":0.000044002045,"about_ca_system_score_gemma":0.00029782395,"threshold_uncertainty_score":0.9999846},"labels":[],"label_agreement":null},{"id":"W2800662104","doi":"10.20381/ruor-5526","title":"Investigation into Layer 3 Multicast Virtual Private Network Schemes","year":2012,"lang":"en","type":"dissertation","venue":"Library and Archives Canada (Government of Canada)","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Multicast; Computer network; Private network; Computer science; Layer (electronics); Materials science; Nanotechnology","score_opus":0.004621208721244492,"score_gpt":0.15427636482773996,"score_spread":0.14965515610649546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2800662104","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6827386,0.009451204,0.0378468,0.015276222,0.01171527,0.0021319485,0.0001595938,0.00035994686,0.24032038],"genre_scores_gemma":[0.97805095,0.00010372504,0.006107943,0.0010003127,0.0003474977,0.00002279155,0.0000627308,0.000026394924,0.014277646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.997338,0.00008861757,0.00038219595,0.00036749622,0.0014233876,0.00040032555],"domain_scores_gemma":[0.9987609,0.00024531697,0.0003108403,0.0003179554,0.0000014780451,0.00036353973],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000020229732,0.00029621716,0.00032520536,0.000025650135,0.00023433915,0.00006381686,0.00054553023,0.0000790879,0.000019211873],"category_scores_gemma":[0.0000041844287,0.0002935669,0.00003923671,0.00013400556,0.000048708833,0.00066513487,0.00013230357,0.00026064593,1.43225085e-8],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000202071,0.000016297956,0.0047196336,0.00016010144,0.0001437848,0.00002489829,0.00038475925,0.0004223907,0.0036157498,0.69965345,0.0017993863,0.2888575],"study_design_scores_gemma":[0.0033006922,0.0004994498,0.18304923,0.0024233945,0.00036502548,0.000024045214,0.0044962475,0.29414463,0.11160055,0.022206284,0.3735685,0.004321932],"about_ca_topic_score_codex":0.00067751645,"about_ca_topic_score_gemma":0.024128404,"teacher_disagreement_score":0.67744714,"about_ca_system_score_codex":0.000008572048,"about_ca_system_score_gemma":0.0016305888,"threshold_uncertainty_score":0.99995166},"labels":[],"label_agreement":null},{"id":"W2804422877","doi":"10.22215/etd/2006-07633","title":"Bandwidth oscillations control and quality of service in CDMA-2000 interconnections","year":2006,"lang":"en","type":"dissertation","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Canadian Heritage","funders":"","keywords":"Telecommunications; Computer science; Bandwidth (computing); Electrical engineering; Engineering","score_opus":0.013702519485898557,"score_gpt":0.261006308555115,"score_spread":0.2473037890692164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2804422877","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5435679,0.0024529463,0.33250636,0.0046708365,0.0027398407,0.0017741733,0.000087327426,0.0005963455,0.11160427],"genre_scores_gemma":[0.99230736,0.0000217464,0.0012573639,0.00034673105,0.000065138236,0.00004742702,0.00008160486,0.00001081981,0.005861817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9983761,0.00014615293,0.000649913,0.00041479876,0.00021428676,0.00019880672],"domain_scores_gemma":[0.9986753,0.00038723066,0.0002638932,0.00035743337,0.000255716,0.00006044638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034117248,0.00020633863,0.00044138555,0.0002555692,0.00007591358,0.00007508855,0.00033737303,0.0002076119,0.000037211503],"category_scores_gemma":[0.00003712675,0.00020039047,0.00007794952,0.0005521707,0.000020320142,0.00023405146,0.000022691569,0.00022401991,0.000008965656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002829939,0.0005972968,0.010763862,0.00056452636,0.00026446828,0.000007238373,0.0047723884,0.0091088135,0.0012977708,0.6220058,0.002487303,0.34784752],"study_design_scores_gemma":[0.008377066,0.00020953672,0.4960817,0.00061410374,0.00015342543,0.000010333463,0.001214596,0.47677368,0.00020537521,0.009348317,0.0053665615,0.0016452867],"about_ca_topic_score_codex":0.0025188134,"about_ca_topic_score_gemma":0.061381493,"teacher_disagreement_score":0.6126575,"about_ca_system_score_codex":0.000049311933,"about_ca_system_score_gemma":0.00022495317,"threshold_uncertainty_score":0.9557459},"labels":[],"label_agreement":null},{"id":"W2806147088","doi":"10.1109/ispa/iucc.2017.00201","title":"Internet Performance Analysis of South Asian Countries Using End-to-End Internet Performance Measurements","year":2017,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"The Internet; Key (lock); Internet access; Computer science; Business; Telecommunications; World Wide Web; Computer security","score_opus":0.05165248157678073,"score_gpt":0.2588852976026394,"score_spread":0.20723281602585866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806147088","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.751993,0.00002578814,0.24226049,0.00020953547,0.00039167394,0.00012940723,0.0000034220127,0.000070896196,0.0049157906],"genre_scores_gemma":[0.9934824,0.000008228647,0.0045468076,0.00025349742,0.000065377186,0.000008637014,0.0000025353593,0.000008985101,0.0016235058],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981301,0.00004388459,0.0004225495,0.0004534806,0.00057944795,0.00037053638],"domain_scores_gemma":[0.9981796,0.000024155128,0.00035687536,0.0010428925,0.00025281296,0.00014362614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060015655,0.00021461125,0.00041525238,0.0003224985,0.00021016394,0.00041417198,0.0018365459,0.000057508656,0.00019777555],"category_scores_gemma":[0.000029608647,0.00018585358,0.0001360311,0.00034945627,0.00012680996,0.00085626624,0.00040144662,0.00012625464,0.00006772174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010109148,0.000072555114,0.598565,0.00004535037,0.0013391564,0.0000043383407,0.0037309518,0.013245962,0.00009653871,0.002643499,0.0004279213,0.37972766],"study_design_scores_gemma":[0.00032417753,0.00009714756,0.15032065,0.00006866545,0.0001961566,0.000002255227,0.000028502276,0.8469558,0.0010970135,0.0000023742296,0.00069824356,0.0002090226],"about_ca_topic_score_codex":0.00013277777,"about_ca_topic_score_gemma":0.00016972142,"teacher_disagreement_score":0.83370984,"about_ca_system_score_codex":0.00006961798,"about_ca_system_score_gemma":0.000086391,"threshold_uncertainty_score":0.7578889},"labels":[],"label_agreement":null},{"id":"W2806326276","doi":"10.1109/pdp2018.2018.00037","title":"A Dynamic Multi-Core Multicast Approach for Delay and Delay Variation Multicast Routing","year":2018,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Multicast; Xcast; Protocol Independent Multicast; Distance Vector Multicast Routing Protocol; Computer science; Source-specific multicast; Computer network; Pragmatic General Multicast; Distributed computing; Routing (electronic design automation); Steiner tree problem; Mathematical optimization; Mathematics","score_opus":0.025169219525691372,"score_gpt":0.26630452119231707,"score_spread":0.2411353016666257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806326276","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016011477,0.0000392563,0.98214036,0.00025507816,0.00023781358,0.00056842715,0.0000036955662,0.0002777682,0.00046609773],"genre_scores_gemma":[0.5610621,0.0000017195465,0.43828958,0.00019466568,0.00007501954,0.000049294344,0.0000040549085,0.000008993791,0.00031459014],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985626,0.00004221743,0.00028268466,0.0005732986,0.00014998828,0.00038925867],"domain_scores_gemma":[0.9989696,0.0002173239,0.00009731109,0.00035206374,0.00022724719,0.00013644643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040963353,0.00018574369,0.00018701187,0.00007035752,0.00031308777,0.0001893044,0.0003290776,0.000105255895,0.000007508107],"category_scores_gemma":[0.000095996256,0.00015866564,0.000057717312,0.00019574055,0.000091016445,0.00032678674,0.00013277052,0.00010254656,0.000018710569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008302489,0.00041248405,0.000937596,0.00003326241,0.00011714298,0.0000064411574,0.0034871064,0.0022852602,0.0010364656,0.099374175,0.00015492893,0.89207214],"study_design_scores_gemma":[0.0017248736,0.000113366645,0.0022501913,0.000009559018,0.000021616366,0.000032635948,0.00006096621,0.9952739,0.000011182885,0.00009227278,0.00019800772,0.00021143391],"about_ca_topic_score_codex":0.000024630139,"about_ca_topic_score_gemma":0.00006677309,"teacher_disagreement_score":0.99298865,"about_ca_system_score_codex":0.00003702214,"about_ca_system_score_gemma":0.000039814375,"threshold_uncertainty_score":0.6470197},"labels":[],"label_agreement":null},{"id":"W2807206830","doi":"10.1016/j.orp.2018.05.001","title":"On slowdown variance as a measure of fairness","year":2018,"lang":"en","type":"article","venue":"Operations Research Perspectives","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Slowdown; Measure (data warehouse); Computer science; Variance (accounting); Decoupling (probability); Metric (unit); Suite; Range (aeronautics); Econometrics; Mathematics; Economics; Data mining; Political science; Engineering; Law; Operations management; Accounting","score_opus":0.03851069793096599,"score_gpt":0.36246131448806984,"score_spread":0.32395061655710383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807206830","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040873438,0.00060176814,0.8246852,0.012702224,0.00029177402,0.0007458053,0.000006978432,0.00017648932,0.119916335],"genre_scores_gemma":[0.9915357,0.00002671839,0.0044643222,0.00006574307,0.00023339836,0.00007724692,6.104838e-7,0.0000067245237,0.0035894916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808586,0.00037286762,0.00014411176,0.000418922,0.0006848463,0.0002933686],"domain_scores_gemma":[0.99724495,0.0002336692,0.000014548216,0.0005966197,0.0018123871,0.00009782077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089917035,0.00009135976,0.00012593235,0.00021339834,0.00054197543,0.00021214838,0.0007364579,0.000052792268,0.00024593686],"category_scores_gemma":[0.0006452609,0.00007854375,0.000044386146,0.00093565317,0.00042031074,0.00038792036,0.00010936911,0.0002591309,0.00038746189],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002879249,0.00016740955,0.000005080245,0.0000018190393,0.00002269913,0.0000035559528,0.0047283745,0.0011034098,0.0008550984,0.96782273,0.001626567,0.023634456],"study_design_scores_gemma":[0.0025015492,0.004148713,0.0019934413,0.00026683035,0.000012007173,0.000036399575,0.008596081,0.93122876,0.0059656324,0.03566959,0.008905392,0.0006756056],"about_ca_topic_score_codex":0.0000919706,"about_ca_topic_score_gemma":0.00015251208,"teacher_disagreement_score":0.9506623,"about_ca_system_score_codex":0.00007646476,"about_ca_system_score_gemma":0.00040332862,"threshold_uncertainty_score":0.4980168},"labels":[],"label_agreement":null},{"id":"W2808611696","doi":"10.1109/wcnc.2018.8377215","title":"Capacity planning for 5G packet-based front-haul","year":2018,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Statistical time division multiplexing; Computer science; Computer network; Network packet; Weighted fair queueing; Variable bitrate; Bandwidth allocation; Packet switching; Queueing theory; Latency (audio); Multiplexing; Network traffic control; Scheduling (production processes); Bandwidth (computing); Real-time computing; Telecommunications; Quality of service; Engineering","score_opus":0.0345511353814295,"score_gpt":0.25838905600367695,"score_spread":0.22383792062224744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808611696","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006003484,0.00003526166,0.9804877,0.0019332763,0.00062865287,0.00017460527,0.0000016104932,0.00033519944,0.010400203],"genre_scores_gemma":[0.92304325,1.9825673e-7,0.07317198,0.0023094781,0.00043659075,0.000033153185,0.0000015062059,0.000005749226,0.0009980719],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999159,0.000026865324,0.00013220169,0.00027790823,0.00012707585,0.00027699838],"domain_scores_gemma":[0.9992589,0.00016116425,0.000044420405,0.00032333244,0.000120179735,0.0000920384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022011249,0.00009955604,0.00011561276,0.00003778637,0.00016955585,0.00009787001,0.00042810873,0.000051446026,0.00007207679],"category_scores_gemma":[0.000029519417,0.00008364217,0.00005981812,0.000084823776,0.000058840695,0.00016313787,0.00001648735,0.000057129342,0.00012770949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089597845,0.00010962366,0.001755283,0.000019295821,0.000050738763,0.000006529552,0.0006646569,0.0019854126,0.00029926235,0.14244257,0.14842479,0.7041522],"study_design_scores_gemma":[0.0008210216,0.00019022415,0.00053180347,0.000015643724,0.0000051777806,0.0000018728556,0.000009518024,0.9481597,0.0013676968,0.0016355169,0.04709374,0.00016806922],"about_ca_topic_score_codex":0.000012061279,"about_ca_topic_score_gemma":0.000026003303,"teacher_disagreement_score":0.9461743,"about_ca_system_score_codex":0.000019416231,"about_ca_system_score_gemma":0.000060082257,"threshold_uncertainty_score":0.34108287},"labels":[],"label_agreement":null},{"id":"W2888317063","doi":"10.1364/jocn.10.000773","title":"CURSA-SQ: A Methodology for Service-Centric Traffic Flow Analysis","year":2018,"lang":"en","type":"article","venue":"Journal of Optical Communications and Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Transport Canada","funders":"Institució Catalana de Recerca i Estudis Avançats; Ministerio de Economía y Competitividad; European Commission","keywords":"Computer science; Scalability; Service (business); Computer network; Queue; Network packet; Granularity; Traffic classification; Distributed computing; Operating system","score_opus":0.09431327788294973,"score_gpt":0.3344422596238482,"score_spread":0.24012898174089847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888317063","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056975735,0.0048398483,0.9803156,0.008321355,0.0003378938,0.000119596385,7.818696e-7,0.00002730213,0.000340015],"genre_scores_gemma":[0.6092646,0.0007136539,0.38907647,0.0005100948,0.00041236897,0.0000063451093,0.0000011771662,0.0000045087186,0.00001077537],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986603,0.00028609985,0.0005009323,0.00015430627,0.00014779744,0.00025051064],"domain_scores_gemma":[0.996432,0.0018747323,0.00029944952,0.0006602824,0.00058231706,0.00015121508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015732935,0.000107570675,0.00036731246,0.00022642499,0.00039386385,0.00014389148,0.0012065979,0.0000806981,0.0000067501232],"category_scores_gemma":[0.000055595952,0.0000904383,0.00018104106,0.0012617774,0.00012788347,0.00019529824,0.00023828118,0.0002476945,0.0000019673255],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039590588,0.00007938666,0.00014603733,0.000004021422,0.00039633256,0.0000014242538,0.00032614794,0.0021784944,0.000013869894,0.02007268,0.00024052817,0.97650146],"study_design_scores_gemma":[0.0005546198,0.0002449517,0.00030737196,0.000026464764,0.0004407333,0.000048025697,0.000039279366,0.96696836,0.0000032713388,0.0014400776,0.029823245,0.00010360582],"about_ca_topic_score_codex":0.0000011862613,"about_ca_topic_score_gemma":0.000042904707,"teacher_disagreement_score":0.9763979,"about_ca_system_score_codex":0.000024484874,"about_ca_system_score_gemma":0.00007140715,"threshold_uncertainty_score":0.36879668},"labels":[],"label_agreement":null},{"id":"W2897481171","doi":"10.1109/itc30.2018.10059","title":"Integrating Fractional Brownian Motion Arrivals into the Statistical Network Calculus","year":2018,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Fractional Brownian motion; Network calculus; Probabilistic logic; Computer science; Brownian motion; A priori and a posteriori; Stochastic process; Applied mathematics; Class (philosophy); Calculus (dental); Mathematical optimization; Mathematics; Artificial intelligence; Statistics; Telecommunications","score_opus":0.009623386232669305,"score_gpt":0.24912658429757836,"score_spread":0.23950319806490905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897481171","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007560989,0.000053469637,0.98432153,0.0052698213,0.0010096786,0.00011173597,5.181994e-7,0.00019936121,0.008277777],"genre_scores_gemma":[0.917854,0.0000034777527,0.07753256,0.0022406657,0.0017220149,0.000018084289,0.0000027852395,0.0000057712937,0.00062065996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987924,0.00015109922,0.00021918719,0.00028650108,0.0002729991,0.00027782255],"domain_scores_gemma":[0.9989435,0.00042358486,0.00006402133,0.00032436292,0.00014987681,0.00009462847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004898068,0.00011215608,0.000105193176,0.000021764588,0.00048419577,0.00021756702,0.00049190025,0.00005283483,0.00033734506],"category_scores_gemma":[0.00010082997,0.00006997635,0.000040629027,0.00027118027,0.0001453993,0.00024336953,0.00010354013,0.00019157381,0.00032959552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041343765,0.000010104643,0.00011375049,5.143658e-7,0.000010095085,0.0000015206692,0.0001815284,0.0004875243,0.000009279849,0.5133381,0.014729404,0.47111407],"study_design_scores_gemma":[0.00016981068,0.00007882939,0.0019262279,0.000010020225,0.000006784278,0.000012893478,0.000045197758,0.9437741,0.000021509462,0.019292993,0.03454235,0.000119279124],"about_ca_topic_score_codex":0.00008542382,"about_ca_topic_score_gemma":0.00026164294,"teacher_disagreement_score":0.9432866,"about_ca_system_score_codex":0.00003668227,"about_ca_system_score_gemma":0.00006405567,"threshold_uncertainty_score":0.42363936},"labels":[],"label_agreement":null},{"id":"W2903520730","doi":"10.1016/j.chaos.2018.11.029","title":"Stability and Hopf bifurcation analysis of a TCP/RAQM network with ISMC procedure","year":2018,"lang":"en","type":"article","venue":"Chaos Solitons & Fractals","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Hopf bifurcation; Bifurcation; Bogdanov–Takens bifurcation; Stability (learning theory); Control theory (sociology); Topology (electrical circuits); Mathematical analysis; Applied mathematics; Computer science; Physics; Combinatorics; Nonlinear system; Artificial intelligence","score_opus":0.010542759454891347,"score_gpt":0.2279680226752013,"score_spread":0.21742526322030994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903520730","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77410305,0.00047999583,0.22240256,0.0012732028,0.00016013591,0.0003646029,0.000008806165,0.00015452667,0.0010531258],"genre_scores_gemma":[0.9956125,0.000022635335,0.0036445465,0.00030308677,0.00029426056,0.00004041146,0.000007697303,0.0000088749875,0.00006598543],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998465,0.00009423656,0.00032079738,0.00050612283,0.00026886154,0.000345007],"domain_scores_gemma":[0.9984164,0.0001957347,0.00024149487,0.0006733407,0.00033114938,0.0001418297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043685635,0.00017781647,0.0003979115,0.00014261261,0.00017582126,0.00008662563,0.00037363454,0.00009488466,0.000058921214],"category_scores_gemma":[0.00004930651,0.00014339769,0.00008516977,0.0016049499,0.0002687235,0.00034904628,0.00009737855,0.00011892649,0.000008619018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062844716,0.0012555224,0.29242286,0.00025811314,0.004536942,0.000023688106,0.017427975,0.006400207,0.0031994625,0.100076675,0.006438825,0.56733125],"study_design_scores_gemma":[0.0012209793,0.0008679032,0.16214794,0.0001285634,0.0010918044,0.000020612104,0.0003317841,0.82458526,0.0020805632,0.0024372821,0.004340426,0.0007468639],"about_ca_topic_score_codex":0.000028506189,"about_ca_topic_score_gemma":0.00019581999,"teacher_disagreement_score":0.8181851,"about_ca_system_score_codex":0.000027863953,"about_ca_system_score_gemma":0.00014792584,"threshold_uncertainty_score":0.5847588},"labels":[],"label_agreement":null},{"id":"W2907371624","doi":"10.1016/j.isatra.2018.12.021","title":"Congestion tracking control for uncertain TCP/AQM network based on integral backstepping","year":2019,"lang":"en","type":"article","venue":"ISA Transactions","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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; Computer science; Transmission Control Protocol; Queue; Control theory (sociology); TCP tuning; TCP Friendly Rate Control; Computer network; Control (management); Adaptive control; Network packet; Artificial intelligence","score_opus":0.014754346136666435,"score_gpt":0.23748456906258966,"score_spread":0.22273022292592323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907371624","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015254201,0.00007350949,0.9902546,0.003832887,0.0020001957,0.00091786956,0.000016537866,0.0003899015,0.0009891213],"genre_scores_gemma":[0.9860116,0.000004695799,0.011008459,0.0019110632,0.00028281254,0.00019333269,0.000009476919,0.000022237713,0.0005562752],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828994,0.00012776583,0.00032517538,0.00050783495,0.0002463741,0.0005029365],"domain_scores_gemma":[0.9981736,0.0009792512,0.00010449622,0.0004631675,0.00015050887,0.00012896063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004312676,0.00023488251,0.0002929652,0.00010801692,0.0003029316,0.00018760533,0.0004278564,0.00013839887,0.00012698662],"category_scores_gemma":[0.000019402234,0.00022662432,0.00024517276,0.0003650771,0.00003788008,0.00038184476,0.0000031525444,0.00030703965,0.000102302496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011152051,0.000070945076,0.0001310515,0.000014127648,0.000041970954,0.0000018707705,0.000073246985,0.71925837,0.00008522257,0.013401912,0.00042510766,0.26638466],"study_design_scores_gemma":[0.0028747348,0.00028285928,0.00050115364,0.0001253871,0.00004655135,0.000005213217,0.00003094403,0.98476183,0.00003977077,0.0005691747,0.010490268,0.00027211386],"about_ca_topic_score_codex":0.000014752957,"about_ca_topic_score_gemma":0.00005123501,"teacher_disagreement_score":0.9844862,"about_ca_system_score_codex":0.00009575231,"about_ca_system_score_gemma":0.00013048551,"threshold_uncertainty_score":0.9241472},"labels":[],"label_agreement":null},{"id":"W2926906848","doi":"10.1109/jsyst.2019.2903819","title":"Fair Congestion Control Protocol for Data Center Bridging","year":2019,"lang":"en","type":"article","venue":"IEEE Systems Journal","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; École de Technologie Supérieure","funders":"","keywords":"Computer science; Computer network; Network congestion; Data center; Bridging (networking); Network packet; Distributed computing; Packet loss; Ethernet; Latency (audio); Cloud computing; Active queue management; Scalability; Operating system","score_opus":0.04005570854042687,"score_gpt":0.30009036196385397,"score_spread":0.2600346534234271,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2926906848","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034504497,0.000028760576,0.93814445,0.0010309747,0.0039706593,0.05602943,0.000016310312,0.000121417215,0.0003129665],"genre_scores_gemma":[0.96863735,9.2399085e-7,0.0015073819,0.00039673384,0.002385049,0.0261763,0.000004311946,0.000022263626,0.0008697112],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981402,0.0001745017,0.0005095913,0.00040174776,0.0003696135,0.00040435788],"domain_scores_gemma":[0.99822146,0.00015828192,0.00038924886,0.00078658893,0.00027605577,0.00016838594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012680065,0.00017089563,0.00029611093,0.00008848505,0.0001851193,0.00066432194,0.0014234288,0.000079592755,0.000012556028],"category_scores_gemma":[0.000030302468,0.0001390302,0.00008645287,0.000104304025,0.000017376931,0.0010078222,0.00006144618,0.0002550298,0.000115300005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007528717,0.00045943976,0.012007363,0.0006048954,0.00063115393,0.00012226783,0.0004730588,0.15671939,0.0018724774,0.016616186,0.25185412,0.5578868],"study_design_scores_gemma":[0.005740896,0.00013383874,0.00013348208,0.00024236781,0.000009274528,0.0005634139,0.000006813783,0.83500314,0.000007947443,0.00004079164,0.15794718,0.00017083158],"about_ca_topic_score_codex":0.0000056290437,"about_ca_topic_score_gemma":0.0000015444496,"teacher_disagreement_score":0.9682923,"about_ca_system_score_codex":0.00006438511,"about_ca_system_score_gemma":0.0001620999,"threshold_uncertainty_score":0.6406072},"labels":[],"label_agreement":null},{"id":"W2941888727","doi":"10.23919/ifipnetworking.2018.8696419","title":"A New Dependence Model for Heterogeneous Markov Modulated Poisson Processes","year":2018,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Copula (linguistics); Markov process; Computer science; Poisson distribution; Markovian arrival process; Superposition principle; Markov chain; Statistical physics; Stochastic process; Algorithm; Markov model; Poisson process; Generality; Markov renewal process; Theoretical computer science; Mathematical optimization; Variable-order Markov model; Mathematics; Econometrics; Statistics; Machine learning; Physics","score_opus":0.017131174708850474,"score_gpt":0.24373573741532253,"score_spread":0.22660456270647206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2941888727","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028318563,0.00013581534,0.99428624,0.001020563,0.00018045548,0.00027131935,0.0000018158054,0.00039246157,0.0008794447],"genre_scores_gemma":[0.8182994,0.000006729168,0.17291601,0.00074449496,0.00018030975,0.000025616226,0.0000015409993,0.000008594384,0.007817315],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989584,0.000012091013,0.00016219296,0.0003956195,0.00016536053,0.00030633295],"domain_scores_gemma":[0.9991191,0.00006253526,0.00004921321,0.00033695457,0.00028591938,0.00014628036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000096138225,0.00012909874,0.00012354428,0.000039807597,0.00012444795,0.00013078957,0.00064742734,0.00006244928,0.00003440044],"category_scores_gemma":[0.000037085145,0.00010974963,0.000039477476,0.00026418423,0.000022349876,0.00028719334,0.0000771818,0.000042457046,0.000044665063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100268255,0.0000621178,0.00002190054,0.000027752629,0.000049135186,0.0000061217524,0.000508791,0.050684895,0.00038245425,0.0111817485,0.026696196,0.9102786],"study_design_scores_gemma":[0.0004108938,0.00011936256,0.0000047463514,0.000011171199,0.0000066966313,0.00001788281,0.0000016827448,0.9910489,0.0009642191,0.0061616683,0.0011000183,0.0001527899],"about_ca_topic_score_codex":0.000013706349,"about_ca_topic_score_gemma":0.00018184139,"teacher_disagreement_score":0.94036394,"about_ca_system_score_codex":0.000015593421,"about_ca_system_score_gemma":0.00029403603,"threshold_uncertainty_score":0.44754598},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010873319780305129,"score_gpt":0.2094389208189413,"score_spread":0.19856560103863619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947464159","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008363268,0.000279151,0.9902125,0.0027627395,0.0022919774,0.0009902454,0.000029305229,0.00040997288,0.0021877892],"genre_scores_gemma":[0.98437864,0.000021022424,0.01190906,0.00086057227,0.0003668035,0.00026948337,0.0000054829193,0.000019237968,0.0021697234],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847585,0.00008675357,0.00028117234,0.0004745437,0.00020239178,0.00047931547],"domain_scores_gemma":[0.9985982,0.0005377821,0.000095172,0.00044807492,0.00017582405,0.00014492245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002736305,0.00020497685,0.0002779967,0.00006641706,0.00027683302,0.000109591536,0.0004254344,0.00013507703,0.000110465495],"category_scores_gemma":[0.000007156196,0.00020442456,0.00021339164,0.000316576,0.000044115106,0.00048470366,0.0000058163578,0.00021831579,0.00027585664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021890426,0.00013913403,0.00012843598,0.000015170166,0.00021899752,0.000003088308,0.00024960283,0.39165643,0.00013009751,0.16322303,0.0037684888,0.44024864],"study_design_scores_gemma":[0.004311997,0.00044960316,0.0012780771,0.000050107177,0.00011736063,0.00002115926,0.0000729424,0.9516422,0.000027705062,0.006942506,0.034627408,0.0004589233],"about_ca_topic_score_codex":0.000013918959,"about_ca_topic_score_gemma":0.00005542348,"teacher_disagreement_score":0.98354226,"about_ca_system_score_codex":0.000053662352,"about_ca_system_score_gemma":0.00010536648,"threshold_uncertainty_score":0.8336192},"labels":[],"label_agreement":null},{"id":"W2949517082","doi":"10.48550/arxiv.1001.2604","title":"On the Model Transform in Stochastic Network Calculus","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Network calculus; Computer science; Stochastic calculus; Stochastic modelling; Mathematical optimization; Selection (genetic algorithm); Calculus (dental); Algorithm; Applied mathematics; Mathematics; Artificial intelligence; Quality of service; Statistics; Computer network","score_opus":0.0422464493737871,"score_gpt":0.16942213797748024,"score_spread":0.12717568860369313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949517082","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054162826,0.000035117555,0.9404957,0.0010728701,0.0006787603,0.00044619007,0.000004295859,0.00016132969,0.0029428552],"genre_scores_gemma":[0.99811316,0.000025807873,0.0002856732,0.00051158573,0.00012203237,0.000004883456,0.0000029201753,0.000013972782,0.0009199847],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983348,0.00010493915,0.00018673336,0.0008065769,0.00010870945,0.00045821883],"domain_scores_gemma":[0.9982876,0.00033078855,0.00011522535,0.001076192,0.000063455875,0.0001267297],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038418057,0.00029413713,0.0002815222,0.000112675974,0.00017021448,0.00009701192,0.0020018886,0.00034212074,0.000021627407],"category_scores_gemma":[0.000019786818,0.00025335618,0.00018314515,0.0004632011,0.00010261605,0.00013226803,0.0004269762,0.0015403354,0.000059225193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018335748,0.000025190153,0.000004708344,0.0000023404025,0.000012448872,0.000029941697,0.00006540763,0.56481344,3.5784254e-7,0.43196842,0.000228242,0.0028312025],"study_design_scores_gemma":[0.0003424533,0.00002211168,0.000028839022,0.00005922104,0.000020610514,0.0000012244159,0.000007683374,0.8398157,7.749032e-7,0.15941305,0.00005412195,0.00023419736],"about_ca_topic_score_codex":0.000040370756,"about_ca_topic_score_gemma":0.0003905058,"teacher_disagreement_score":0.9439503,"about_ca_system_score_codex":0.00011056982,"about_ca_system_score_gemma":0.0002478539,"threshold_uncertainty_score":0.9999919},"labels":[],"label_agreement":null},{"id":"W2951880294","doi":"10.48550/arxiv.1008.0050","title":"A Foundation for Stochastic Bandwidth Estimation of Networks with Random Service","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Network packet; Bounding overwatch; Bandwidth (computing); Computer science; Testbed; Random variable; Algorithm; Real-time computing; Mathematics; Computer network; Statistics; Artificial intelligence","score_opus":0.027850363255485545,"score_gpt":0.1754679879480554,"score_spread":0.14761762469256987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951880294","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043059897,0.00002023452,0.95512104,0.00013333489,0.000645823,0.00078781624,0.000004679919,0.00014441555,0.00008278091],"genre_scores_gemma":[0.99021876,0.000007267948,0.009366856,0.00006847391,0.00013303779,0.000009258183,0.00004775385,0.000014335954,0.00013428177],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987967,0.00006473733,0.00020155197,0.00062295364,0.00008623731,0.00022783405],"domain_scores_gemma":[0.99788,0.00035315586,0.0003977323,0.0006760551,0.0005988534,0.000094221345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027796623,0.00023069193,0.0003451729,0.00013065661,0.00012178938,0.000084353545,0.00081473717,0.00025232506,0.000009310882],"category_scores_gemma":[0.000038649756,0.00023184378,0.00011106238,0.00040351012,0.00006140989,0.0002819825,0.00024032094,0.000372569,0.000006129802],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025464295,0.000037991602,0.00002791163,0.000051615883,0.000066060864,0.0000030049732,0.00007115003,0.93955004,0.0000019113872,0.045265608,0.00003215062,0.014637924],"study_design_scores_gemma":[0.0026118394,0.000081815786,0.00008133407,0.00012065217,0.00014781464,0.000001701176,0.000010250675,0.98929554,0.0000052587425,0.0073503987,0.00005113587,0.00024227504],"about_ca_topic_score_codex":0.00004091206,"about_ca_topic_score_gemma":0.00020191364,"teacher_disagreement_score":0.9471588,"about_ca_system_score_codex":0.000050281713,"about_ca_system_score_gemma":0.00023124345,"threshold_uncertainty_score":0.94543153},"labels":[],"label_agreement":null},{"id":"W2952386241","doi":"10.48550/arxiv.0801.0455","title":"A System Theoretic Approach to Bandwidth Estimation","year":2008,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Network calculus; Bandwidth (computing); Network packet; Computer science; Testbed; Robustness (evolution); Algorithm; Mathematics; Applied mathematics; Quality of service; Computer network","score_opus":0.02401419728775125,"score_gpt":0.22647771185243587,"score_spread":0.20246351456468462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952386241","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09875562,0.00024073005,0.8875362,0.00062666624,0.0011831324,0.0007017256,0.0000033191998,0.0007791154,0.010173452],"genre_scores_gemma":[0.97201115,0.000027537737,0.026580421,0.0003183846,0.00034300415,0.0002957684,0.000018529478,0.000024841967,0.00038035793],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977049,0.00017533236,0.00040957346,0.0009216143,0.0003975068,0.0003910207],"domain_scores_gemma":[0.99804187,0.00010190268,0.0001969113,0.0013140906,0.00012868692,0.00021653279],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037311777,0.00034477882,0.00043639625,0.00014681513,0.0001744725,0.00016727208,0.0014884053,0.0002508918,0.0000035773194],"category_scores_gemma":[0.00004163223,0.00031414974,0.00016014613,0.000306546,0.00005784552,0.0001367382,0.00074814406,0.00047389235,0.0004663658],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004120609,0.0003114577,0.00858776,0.00064406346,0.00021248961,0.00008782369,0.0042104856,0.44341373,0.000018150851,0.34095046,0.0059724166,0.19554995],"study_design_scores_gemma":[0.0003126621,0.000040967836,0.0042861546,0.00023231174,0.00003253401,0.000059010585,0.000030651863,0.9933242,0.00002340037,0.0005115206,0.00071325176,0.00043332728],"about_ca_topic_score_codex":0.00001628952,"about_ca_topic_score_gemma":9.750732e-7,"teacher_disagreement_score":0.87325555,"about_ca_system_score_codex":0.00014379025,"about_ca_system_score_gemma":0.0001965836,"threshold_uncertainty_score":0.99993104},"labels":[],"label_agreement":null},{"id":"W2963581585","doi":"10.1109/iwcmc.2019.8766634","title":"Embedding Multiple-Step-Ahead Traffic Prediction in Network Energy Efficiency Problem","year":2019,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Energy consumption; Linear programming; Simulated annealing; Efficient energy use; Traffic flow (computer networking); Mathematical optimization; Traffic generation model; Integer programming; Heuristic; Real-time computing; Algorithm; Computer network; Engineering; Mathematics","score_opus":0.00620120040349916,"score_gpt":0.2031065949608609,"score_spread":0.19690539455736172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963581585","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065875985,0.00023894745,0.9185675,0.00043940224,0.001206262,0.00040787744,8.587855e-7,0.0006960754,0.012567087],"genre_scores_gemma":[0.98098004,0.000011283377,0.014571506,0.00034449098,0.0002286287,0.0000506786,0.000004103043,0.000012942927,0.0037963528],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799895,0.00011064752,0.0004100175,0.0005937689,0.00030519284,0.00058143085],"domain_scores_gemma":[0.9990518,0.00023564254,0.00009096294,0.0004571535,0.000055038454,0.00010940324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042614524,0.00019666912,0.0002404682,0.00012566359,0.00009162575,0.00012207968,0.00061701704,0.000118522694,0.00008198175],"category_scores_gemma":[0.000011578293,0.00017731392,0.000079541634,0.00075554417,0.000022662005,0.00043181493,0.00010791869,0.0001809541,0.00016114117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000123059235,0.00006901582,0.0024189083,0.000005757249,0.0000070129977,0.000004435479,0.000095584066,0.7201376,0.00002138922,0.025627285,0.0027092623,0.24889143],"study_design_scores_gemma":[0.001061587,0.00011827235,0.0007684577,0.000057456647,0.0000032569744,0.000009076028,0.000019775181,0.98556924,0.0000064861156,0.00012892873,0.012063563,0.00019392584],"about_ca_topic_score_codex":0.000029812829,"about_ca_topic_score_gemma":0.00014450972,"teacher_disagreement_score":0.91510403,"about_ca_system_score_codex":0.000068706686,"about_ca_system_score_gemma":0.00007583286,"threshold_uncertainty_score":0.7230652},"labels":[],"label_agreement":null},{"id":"W2968227813","doi":"10.1016/j.neucom.2019.08.024","title":"Study on TCP/AQM network congestion with adaptive neural network and barrier Lyapunov function","year":2019,"lang":"en","type":"article","venue":"Neurocomputing","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"National Natural Science Foundation of China","keywords":"Active queue management; Computer science; Backstepping; Transmission Control Protocol; Network congestion; Control theory (sociology); Lyapunov function; Artificial neural network; Transient (computer programming); Adaptive control; Network packet; Computer network; Control (management); Artificial intelligence; Nonlinear system","score_opus":0.012106731241127138,"score_gpt":0.20739315460356061,"score_spread":0.1952864233624335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2968227813","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86604357,0.00012424626,0.12864415,0.00032453515,0.0017380626,0.0011700359,3.6993097e-7,0.0005238891,0.0014311684],"genre_scores_gemma":[0.99574405,0.00000175999,0.0017026572,0.0013798334,0.0009858446,0.000022957483,0.0000012397192,0.000027999571,0.00013364224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975476,0.00032084476,0.00029717042,0.0008689458,0.00038360097,0.0005818099],"domain_scores_gemma":[0.9985943,0.00047227376,0.00019903404,0.0004772821,0.000102711965,0.00015442303],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044267424,0.00031118942,0.00031964178,0.000061578605,0.0003748444,0.00024752898,0.0003466355,0.0000731405,0.000007144307],"category_scores_gemma":[0.000011387869,0.00026398763,0.00004843574,0.00051930535,0.00003804369,0.00031727517,0.00020076324,0.00044722517,0.00004709217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025672786,0.00007922131,0.05314467,0.0000043521286,0.00005325844,0.00004443671,0.00026088598,0.7170785,0.000010418452,0.008345459,0.0005353518,0.22018668],"study_design_scores_gemma":[0.001746943,0.0030808486,0.18168798,0.00007573266,0.000036478817,0.000045735494,0.000090314206,0.81181175,0.0000014405757,0.00019921568,0.0008818374,0.0003417509],"about_ca_topic_score_codex":0.000005475217,"about_ca_topic_score_gemma":0.000009277932,"teacher_disagreement_score":0.21984494,"about_ca_system_score_codex":0.000025285108,"about_ca_system_score_gemma":0.000040348135,"threshold_uncertainty_score":0.9999812},"labels":[],"label_agreement":null},{"id":"W2970701479","doi":"10.1007/s00521-019-04459-4","title":"Adaptive finite-time congestion controller design of TCP/AQM systems based on neural network and funnel control","year":2019,"lang":"en","type":"article","venue":"Neural Computing and Applications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"National Natural Science Foundation of China","keywords":"Active queue management; Control theory (sociology); Computer science; Controller (irrigation); Funnel; Network congestion; Transmission Control Protocol; Transient (computer programming); Queue; Artificial neural network; Tracking error; Boundary (topology); Adaptive control; Mathematics; Control (management); Engineering; Computer network; Mathematical analysis; Artificial intelligence","score_opus":0.013170769699691463,"score_gpt":0.21266216084850867,"score_spread":0.1994913911488172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970701479","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013915922,0.0004923099,0.98290807,0.00066113245,0.00017552005,0.0014286321,0.000008686376,0.00019629173,0.00021340867],"genre_scores_gemma":[0.99706805,0.0000057609864,0.0019420418,0.00059047324,0.00021513042,0.00008131142,0.0000042076076,0.000012513839,0.000080539015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838966,0.0002710742,0.00035222102,0.0004903211,0.00019831838,0.0002984008],"domain_scores_gemma":[0.99691564,0.0022471836,0.00025124362,0.00032115963,0.00014330384,0.000121487596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000401742,0.00021079462,0.00039043685,0.000069511545,0.0002326517,0.00012678889,0.00027187244,0.00008694353,0.0000027548517],"category_scores_gemma":[0.000020822765,0.00018863134,0.000052761625,0.00026280867,0.00008089835,0.000103088074,0.00005205154,0.00020240441,0.000018869101],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080360885,0.000034004213,0.00046214298,0.000011605662,0.000019187419,6.471248e-7,0.000021972572,0.9172281,0.0001142652,0.013847067,0.00014697862,0.06803364],"study_design_scores_gemma":[0.0019291429,0.00034771583,0.0018282002,0.000053677653,0.000028001217,0.000007029807,0.000010636709,0.9952322,0.0000034598747,0.00017864173,0.00020336242,0.00017788738],"about_ca_topic_score_codex":0.00000837587,"about_ca_topic_score_gemma":2.6022468e-7,"teacher_disagreement_score":0.9831521,"about_ca_system_score_codex":0.000014030661,"about_ca_system_score_gemma":0.000030596915,"threshold_uncertainty_score":0.7692163},"labels":[],"label_agreement":null},{"id":"W2972123927","doi":"10.1109/globecom38437.2019.9013475","title":"Intelligent Active Queue Management Using Explicit Congestion Notification","year":2019,"lang":"en","type":"preprint","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Active queue management; Network congestion; Explicit Congestion Notification; Computer science; Computer network; Random early detection; Queue; Transport layer; Layer (electronics); Slow-start; Network packet","score_opus":0.03821601991228505,"score_gpt":0.2718681435167886,"score_spread":0.23365212360450358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972123927","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006115402,0.00014990402,0.98074365,0.0009257622,0.0026979756,0.0011557447,0.0000037759467,0.00040704,0.0078007253],"genre_scores_gemma":[0.9597745,0.00017544779,0.036855895,0.00038282777,0.00021089606,0.00012909963,0.000034616503,0.000020974292,0.002415763],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99779403,0.000121427904,0.00041047842,0.0009801877,0.00038509973,0.00030876516],"domain_scores_gemma":[0.9980345,0.000082579085,0.00030598545,0.0012767307,0.00020260717,0.00009759518],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002916924,0.00032462552,0.0003158399,0.00020521108,0.0000901402,0.0003255529,0.0011496436,0.00025203492,0.00005673753],"category_scores_gemma":[0.000008461235,0.0003192706,0.00014150233,0.00020011934,0.000022667755,0.00024762985,0.0010542759,0.0004343545,0.00031452693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016217702,0.00007300817,0.000024648449,0.00006485305,0.00012474929,0.000006052715,0.0002468032,0.17928635,0.000043854667,0.19604167,0.00045876604,0.62361306],"study_design_scores_gemma":[0.00021455622,0.00002331286,0.00036097787,0.00017456339,0.000057308855,0.000004318583,0.00010369355,0.9925901,0.00047216855,0.0029306228,0.0026557152,0.00041265992],"about_ca_topic_score_codex":0.00006477157,"about_ca_topic_score_gemma":0.000010862932,"teacher_disagreement_score":0.95365906,"about_ca_system_score_codex":0.0003528548,"about_ca_system_score_gemma":0.00013372781,"threshold_uncertainty_score":0.9999259},"labels":[],"label_agreement":null},{"id":"W2972471454","doi":"10.1109/i2mtc.2019.8826859","title":"Artificial Intelligence-Based Distributed Network Latency Measurement","year":2019,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Latency (audio); Real-time computing; Metric (unit); Artificial intelligence; Distributed computing; Machine learning; Data mining","score_opus":0.029772207722902663,"score_gpt":0.2179195750478527,"score_spread":0.18814736732495002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972471454","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014387436,0.00011197761,0.9909706,0.0027355216,0.0010547087,0.0002603179,0.0000010014517,0.00036702305,0.003060112],"genre_scores_gemma":[0.9899294,0.0000026575003,0.008996575,0.00071234076,0.0001953182,0.000016768563,0.0000045699917,0.000005920748,0.00013649583],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842906,0.0000684009,0.00029325296,0.00036049366,0.0004664633,0.00038233458],"domain_scores_gemma":[0.99907935,0.00007250653,0.00006600107,0.00049479475,0.00017889444,0.0001084358],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000557189,0.0001389309,0.00016118382,0.000033078628,0.000086050226,0.00013543224,0.00061253156,0.00006008466,0.00032096772],"category_scores_gemma":[0.000018108996,0.00011624533,0.000083796745,0.00044681804,0.000020387184,0.00014968558,0.000063840605,0.0001198194,0.001016032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017406588,0.00006781263,0.00069316145,0.0000039313945,0.000018556138,0.000004209724,0.000014573758,0.10165371,0.000037239424,0.35737666,0.0025748897,0.5375378],"study_design_scores_gemma":[0.000092176466,0.00009489169,0.00047566264,0.000022556947,0.000006379547,0.0000011189538,0.000006829524,0.98002684,0.0003093821,0.012500923,0.006256114,0.00020711383],"about_ca_topic_score_codex":0.000007890006,"about_ca_topic_score_gemma":0.00002222815,"teacher_disagreement_score":0.9884906,"about_ca_system_score_codex":0.00005807053,"about_ca_system_score_gemma":0.0001391191,"threshold_uncertainty_score":0.9997618},"labels":[],"label_agreement":null},{"id":"W2979293126","doi":"","title":"A scalable load balancer for forwarding internet traffic","year":2005,"lang":"en","type":"article","venue":"Architectures for Networking and Communications Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Burstiness; Packet forwarding; Computer network; Scheduling (production processes); Load balancing (electrical power); The Internet; Distributed computing; IP forwarding; Network packet; Cache; Scalability; Internet traffic; Virtual routing and forwarding; Routing protocol; Routing table; Operating system","score_opus":0.022373176798099633,"score_gpt":0.25866259034484035,"score_spread":0.2362894135467407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979293126","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006673945,0.016869398,0.9701634,0.0030247977,0.0005943112,0.0011697101,0.000009129509,0.00031819643,0.0011771175],"genre_scores_gemma":[0.9647279,0.00008610762,0.032642227,0.00019795832,0.00070807803,0.0008823666,0.000012303005,0.000018451281,0.0007246566],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875337,0.0000994569,0.00033523742,0.00031722838,0.00012691018,0.00036777882],"domain_scores_gemma":[0.99782157,0.00084145775,0.00014134085,0.000993235,0.00011058879,0.00009179624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060428015,0.00016985006,0.00025131667,0.00007161982,0.0004598776,0.00027891403,0.0012106184,0.00006521097,7.1353514e-7],"category_scores_gemma":[0.000018095874,0.00015430676,0.00011668143,0.00017132777,0.000075259486,0.000064524,0.00021473845,0.0001485041,0.0000029918956],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023483937,0.000035404246,0.00013372597,0.000032345284,0.00008418046,7.329548e-8,0.000875016,0.10659735,0.000006268765,0.042551465,0.003563289,0.8460974],"study_design_scores_gemma":[0.00051269383,0.000045725246,0.000013969052,0.00009371427,0.00001844601,0.000013608361,0.000030476796,0.71325135,0.000002075998,0.00067410944,0.28520772,0.00013614193],"about_ca_topic_score_codex":0.000019125118,"about_ca_topic_score_gemma":0.00008440949,"teacher_disagreement_score":0.9580539,"about_ca_system_score_codex":0.000053335367,"about_ca_system_score_gemma":0.000058789366,"threshold_uncertainty_score":0.62924474},"labels":[],"label_agreement":null},{"id":"W2979502561","doi":"10.1109/ccece.2019.8861574","title":"Performance analysis of TCP CERL in wireless networks with random loss","year":2019,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science; Computer network; H-TCP; TCP tuning; TCP acceleration; TCP Friendly Rate Control; TCP global synchronization; CUBIC TCP; Zeta-TCP; TCP Westwood; TCP Westwood plus; Network congestion; Distributed computing; Network packet","score_opus":0.0031645531964861347,"score_gpt":0.17749876835872389,"score_spread":0.17433421516223774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979502561","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64400834,0.00003343482,0.35270223,0.00008275772,0.00009587087,0.000113355956,1.6838906e-7,0.000040176237,0.002923657],"genre_scores_gemma":[0.99822617,0.000034628505,0.0008719266,0.00013142341,0.000023415876,0.000008700032,0.0000015976101,0.0000037062562,0.00069842115],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909216,0.00004329394,0.00021988124,0.00025202462,0.00018557458,0.00020707528],"domain_scores_gemma":[0.9992495,0.00011975969,0.00008420121,0.00039816234,0.00010411702,0.000044264354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002449167,0.00009763013,0.00034070978,0.0001830003,0.000019157522,0.000028417126,0.00042490964,0.00004362682,0.00007712212],"category_scores_gemma":[0.0000020962877,0.0000698844,0.000067189256,0.0015822868,0.000030339195,0.00022016409,0.000046626516,0.000095975454,0.000014469916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011711329,0.000037355017,0.2858471,0.000005525916,0.00017337225,0.0000028380261,0.00007093509,0.6110401,0.0000035808523,0.0052319565,0.00005177222,0.097418316],"study_design_scores_gemma":[0.0016328132,0.000061965206,0.050808985,0.000017528057,0.00004693837,7.5854314e-7,0.000008955644,0.9472146,0.000013938626,0.0000029159316,0.000091069116,0.000099552875],"about_ca_topic_score_codex":0.000025659358,"about_ca_topic_score_gemma":0.00013736585,"teacher_disagreement_score":0.35421786,"about_ca_system_score_codex":0.000013643194,"about_ca_system_score_gemma":0.00003455482,"threshold_uncertainty_score":0.2849803},"labels":[],"label_agreement":null},{"id":"W2982439384","doi":"10.1109/icnp.2019.8888080","title":"Hierarchical Congestion Control (HCC): Cooperation of Uncorrelated Flows for Better Fairness and Throughput","year":2019,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Throughput; Computer science; Fairness measure; Network congestion; Uncorrelated; Flow control (data); Computer network; Max-min fairness; Distributed computing; Flow (mathematics); Aggregate (composite); Control (management); Resource allocation; Telecommunications; Mathematics; Wireless","score_opus":0.005238150353771386,"score_gpt":0.20462864055990101,"score_spread":0.19939049020612962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982439384","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20554212,0.00007163102,0.7904255,0.0024307398,0.00041118835,0.0005948806,0.0000036299816,0.000095103445,0.0004252407],"genre_scores_gemma":[0.9891453,0.000007686777,0.009432752,0.00084039156,0.00007164413,0.000041582356,0.000008322117,0.0000072633884,0.0004450632],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990125,0.00007217738,0.0002669781,0.00032408925,0.00014065644,0.00018363904],"domain_scores_gemma":[0.9990363,0.00038883302,0.00007407592,0.00025148137,0.00018803192,0.00006128851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026552784,0.00012150281,0.00025044213,0.00004787852,0.000057774716,0.000068248664,0.00020529077,0.000106003485,0.00003547922],"category_scores_gemma":[0.00002964557,0.000098866105,0.00004922339,0.0001319895,0.000041357078,0.00033280335,0.000035823403,0.00010300579,0.000022257094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020489753,0.00009410819,0.005454861,0.00004368931,0.00008932022,0.0000016410846,0.00024077052,0.011220958,0.0029914419,0.45499098,0.0010774664,0.52358985],"study_design_scores_gemma":[0.0030168588,0.00025523006,0.0017192952,0.000021641394,0.000018434666,0.000008081932,0.0000069703274,0.99137676,0.00012719342,0.0015101262,0.0017975637,0.00014185159],"about_ca_topic_score_codex":0.000008218954,"about_ca_topic_score_gemma":0.000014646698,"teacher_disagreement_score":0.98015577,"about_ca_system_score_codex":0.000013640075,"about_ca_system_score_gemma":0.00004827753,"threshold_uncertainty_score":0.4031643},"labels":[],"label_agreement":null},{"id":"W2983320559","doi":"10.1109/ancs.2019.8901887","title":"Perfect is the Enemy of Good: Lloyd-Max Quantization for Rate Allocation in Congestion Control Plane","year":2019,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Quantization (signal processing); Computer science; Mathematical optimization; Decoupling (probability); Mathematics; Algorithm; Engineering","score_opus":0.007863758661103205,"score_gpt":0.21949824246901137,"score_spread":0.21163448380790817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2983320559","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11582167,0.00015415874,0.8752935,0.006038707,0.00043212165,0.0012590124,0.0000051127904,0.000081145605,0.00091460574],"genre_scores_gemma":[0.9974214,0.000021520684,0.0007968496,0.0009503977,0.000046291363,0.00006766936,0.000009563059,0.000006306449,0.0006800402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900067,0.00013930498,0.00028364992,0.00025673056,0.00014504424,0.00017460581],"domain_scores_gemma":[0.99875975,0.00061498093,0.00014209753,0.00031503531,0.00014098514,0.000027165614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007786564,0.0001047013,0.00018074553,0.00006771788,0.000045770263,0.000051621195,0.00034076153,0.00006633438,0.000038522987],"category_scores_gemma":[0.00004305702,0.00007494429,0.00005485767,0.00023081465,0.000023539804,0.0002392178,0.000019511977,0.0000677975,0.000037086418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022656357,0.00013547197,0.015234857,0.00005841121,0.000068480775,6.2149405e-7,0.0007119675,0.049485248,0.006319421,0.6746793,0.0014907771,0.25158888],"study_design_scores_gemma":[0.002178963,0.00022679943,0.010683145,0.00002989687,0.000014439575,0.0000017336993,0.00003910595,0.9827694,0.0010152734,0.000633896,0.0022877413,0.000119564545],"about_ca_topic_score_codex":0.00004480804,"about_ca_topic_score_gemma":0.0000677912,"teacher_disagreement_score":0.9332842,"about_ca_system_score_codex":0.000022839937,"about_ca_system_score_gemma":0.000066660294,"threshold_uncertainty_score":0.30561396},"labels":[],"label_agreement":null},{"id":"W2983993388","doi":"10.1145/3371934.3371952","title":"Reflections on \"analysis and simulation of a fair queueing algorithm\"","year":2019,"lang":"en","type":"article","venue":"ACM SIGCOMM Computer Communication Review","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Queueing theory; Algorithm; Layered queueing network; Weighted fair queueing; G-network; Mean value analysis; Operations research; Computer network; Mathematics","score_opus":0.030577348485298497,"score_gpt":0.3333788959635763,"score_spread":0.3028015474782778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2983993388","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007315809,0.016011704,0.9771519,0.0044730688,0.00009895976,0.0004914557,0.0000014892393,0.00015141556,0.00088846707],"genre_scores_gemma":[0.74475414,0.014645346,0.23703158,0.0033946952,0.00003195999,0.00003633441,0.000020682202,0.000010449749,0.00007484532],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831975,0.0004942094,0.00050178816,0.00031705698,0.00022564818,0.00014155963],"domain_scores_gemma":[0.9955044,0.001162658,0.00033287428,0.0027331738,0.00020285512,0.00006403525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060145813,0.00015624712,0.00047331507,0.00020270457,0.00012721337,0.000069166534,0.0014857197,0.000052946845,0.000027947266],"category_scores_gemma":[0.000045164306,0.00014531628,0.00017069698,0.0012268127,0.000036304475,0.0002923135,0.0006103554,0.00020524742,0.000044295564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001873746,0.00006040838,0.0002354552,0.00011108762,0.00018305492,2.5452988e-7,0.0001315641,0.026870968,0.000004213199,0.013805331,0.00021040384,0.9583854],"study_design_scores_gemma":[0.00024777593,0.000089289824,0.0017282676,0.00075965526,0.00015810541,0.000002509827,0.0000037936884,0.9784696,0.0000046043288,0.0007023794,0.017671881,0.0001621197],"about_ca_topic_score_codex":0.00002332607,"about_ca_topic_score_gemma":0.000011381867,"teacher_disagreement_score":0.9582233,"about_ca_system_score_codex":0.00002834743,"about_ca_system_score_gemma":0.000028156232,"threshold_uncertainty_score":0.5925826},"labels":[],"label_agreement":null},{"id":"W2992661680","doi":"10.1145/380000/378694/p134-richards.pdf?ip=207.207.127.233&amp;amp;id=378694&amp;amp;acc=public&amp;amp;key=b63acef81c6334f5%2ec93d29d796b46b49%2e4d4702b0c3e38b35%2e4d4702b0c3e38b35&amp;amp;cfid=553009799&amp;amp;cftoken=38481402&amp;amp;__acm__=1409766844_1a841315e5c058973c870e885ebc835a","title":"RTP: a transport layer implementation project","year":2001,"lang":"en","type":"article","venue":"Sound Ideas (University of Puget Sound)","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Debugging; Protocol (science); Transport layer; Network packet; Asynchronous communication; Application layer; Window (computing); Software engineering; Sliding window protocol; Layer (electronics); Computer network; Distributed computing; Programming language; Operating system","score_opus":0.02092807607333309,"score_gpt":0.25098383219774284,"score_spread":0.23005575612440976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2992661680","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5311306,0.000057544803,0.46570125,0.0005461204,0.00013591182,0.00018191425,0.0000053147896,0.00013442604,0.0021069031],"genre_scores_gemma":[0.9932675,0.000042950345,0.004997174,0.00012677978,0.00006187892,9.177023e-7,0.000016198486,0.0000067150418,0.0014799202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988606,0.00006209296,0.00014736083,0.00033729165,0.0003021402,0.00029050675],"domain_scores_gemma":[0.99927664,0.000044074113,0.00013112684,0.00033787038,0.000126217,0.00008410337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023521182,0.00013243627,0.00019236584,0.00015016542,0.0002610523,0.00003982135,0.0006099057,0.000068035515,0.00019731467],"category_scores_gemma":[0.0000036407444,0.00015995023,0.00014210145,0.0005021682,0.000085016894,0.0007124743,0.00006130312,0.00010912241,0.000060720606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068253175,0.00008509664,0.016748987,0.000016863407,0.00010789741,0.00008356232,0.003944609,0.00026721254,0.000016953707,0.9581994,0.0026582887,0.017802877],"study_design_scores_gemma":[0.0019934932,0.00016178835,0.012348524,0.000013310827,0.00006454124,0.000035313802,0.003295117,0.008020202,0.0000011254369,0.96184105,0.011907722,0.00031778947],"about_ca_topic_score_codex":0.00041202494,"about_ca_topic_score_gemma":0.0014037595,"teacher_disagreement_score":0.46213686,"about_ca_system_score_codex":0.00006037394,"about_ca_system_score_gemma":0.00013598327,"threshold_uncertainty_score":0.6522581},"labels":[],"label_agreement":null},{"id":"W2997769267","doi":"10.1145/511399.511383","title":"Web server benchmarking using parallel WAN emulation","year":2002,"lang":"en","type":"article","venue":"ACM SIGMETRICS Performance Evaluation Review","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Computer network; Web server; Emulation; Operating system; The Internet; Distributed computing","score_opus":0.1105149098403813,"score_gpt":0.3130178994388545,"score_spread":0.20250298959847318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997769267","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21200316,0.42679685,0.3424636,0.006041608,0.003232378,0.0042139688,0.000002883624,0.00068943034,0.004556105],"genre_scores_gemma":[0.90364575,0.06388285,0.03010146,0.0018897621,0.00026510953,0.00008072673,0.000013033526,0.000014646371,0.00010664602],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971542,0.00026599035,0.0006079748,0.0004567629,0.0011793319,0.00033578498],"domain_scores_gemma":[0.9976999,0.00022499269,0.0003588648,0.001058998,0.0005536663,0.00010356666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028713397,0.00021190569,0.00031738347,0.00030028867,0.00028303347,0.00013814993,0.00093323516,0.00007882325,0.00073896366],"category_scores_gemma":[0.00066502,0.00019748823,0.00011660884,0.0029248844,0.00002145399,0.0012163938,0.00017717488,0.00019087116,0.0002759866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.7040564e-7,0.000028521843,0.0017694955,0.00016232122,0.000013660622,6.5561426e-7,0.000033525717,0.018927958,0.0000051863117,0.00052230083,0.0017960393,0.97673947],"study_design_scores_gemma":[0.0005098893,0.000050816154,0.0024855519,0.00068724505,0.000089705085,0.000010955406,0.0000011417892,0.9854849,0.0000033235383,0.00007990137,0.010353903,0.00024269069],"about_ca_topic_score_codex":0.0000017443731,"about_ca_topic_score_gemma":0.0000012194077,"teacher_disagreement_score":0.97649676,"about_ca_system_score_codex":0.0001762068,"about_ca_system_score_gemma":0.00010035642,"threshold_uncertainty_score":0.8091134},"labels":[],"label_agreement":null},{"id":"W3005385193","doi":"10.48550/arxiv.2002.02522","title":"Link Capacity Distributions and Optimal Capacities for Competent Network Performance","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network","score_opus":0.07632491705904436,"score_gpt":0.16873070622313455,"score_spread":0.09240578916409019,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005385193","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16491416,0.0001240281,0.8323451,0.0009818177,0.00062267156,0.00040122,0.000087863074,0.00026148796,0.00026162853],"genre_scores_gemma":[0.99004513,0.00023343148,0.008779723,0.00016431225,0.00046144152,0.0000074501327,0.000047905152,0.0000116616275,0.00024892067],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983815,0.00007714795,0.00019700197,0.0008554823,0.00006995386,0.00041893037],"domain_scores_gemma":[0.9987089,0.0001766379,0.00017402598,0.0005355499,0.00017176151,0.00023310212],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017514883,0.00029558566,0.00036644732,0.00005053392,0.0004238103,0.00014841139,0.0008851933,0.00021094602,0.0000058793075],"category_scores_gemma":[0.000018785015,0.0003400038,0.00017317504,0.00025307242,0.0002726055,0.0002485504,0.00081991026,0.00052226434,0.000011888423],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046320903,0.000022958304,0.00079822645,0.000098639095,0.00011355607,0.000018558767,0.00018223307,0.50317717,0.0000021553442,0.48760855,0.0011322752,0.006799376],"study_design_scores_gemma":[0.00052010623,0.00009989629,0.0010809939,0.00007730265,0.00008542278,0.0000049145633,0.00003037944,0.98349875,0.000007772412,0.010375862,0.0038507723,0.0003678024],"about_ca_topic_score_codex":0.000016461609,"about_ca_topic_score_gemma":0.000013613294,"teacher_disagreement_score":0.825131,"about_ca_system_score_codex":0.00010323901,"about_ca_system_score_gemma":0.00014792464,"threshold_uncertainty_score":0.99990517},"labels":[],"label_agreement":null},{"id":"W3005950680","doi":"10.1061/(asce)la.1943-4170.0000378","title":"Improving Concurrency Assessment and Resolving Misconceptions about But-For Delay Analysis Technique","year":2020,"lang":"en","type":"article","venue":"Journal of Legal Affairs and Dispute Resolution in Engineering and Construction","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Concurrency; Computer science; Reliability engineering; Programming language; Engineering","score_opus":0.0062392429622512855,"score_gpt":0.2217282029730976,"score_spread":0.2154889600108463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005950680","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041301455,0.0018702132,0.95569664,0.00077673834,0.00016875031,0.000116969924,0.0000037826014,0.000031407013,0.000034023575],"genre_scores_gemma":[0.91139364,0.0003204129,0.088122025,0.000017415037,0.00012636915,0.000012067502,9.57389e-7,0.000004003747,0.0000031078139],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914044,0.00003109295,0.00037133414,0.00019368608,0.00011480733,0.0001486571],"domain_scores_gemma":[0.9994353,0.00008252324,0.00018594375,0.000062974555,0.00009269753,0.00014056257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002888375,0.000111747446,0.00024309396,0.00020753543,0.000098892124,0.00015623448,0.00008208361,0.000063117564,9.406284e-7],"category_scores_gemma":[0.00004068947,0.000104445186,0.00006849071,0.00032256427,0.00005215475,0.00047040443,0.000039959217,0.00021528237,3.2801736e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009028697,0.000045303714,0.007367538,0.00024861665,0.0003447022,0.00003512199,0.000630142,0.0767396,0.0074068266,0.19793496,0.00007226756,0.70908463],"study_design_scores_gemma":[0.00065565744,0.00015003458,0.003554387,0.00007559846,0.00010208928,0.00018525062,0.00024187597,0.9941767,0.000029841187,0.00008664461,0.0006118501,0.00013007146],"about_ca_topic_score_codex":0.00001295828,"about_ca_topic_score_gemma":0.0000037372474,"teacher_disagreement_score":0.9174371,"about_ca_system_score_codex":0.00003632488,"about_ca_system_score_gemma":0.00005983673,"threshold_uncertainty_score":0.4259151},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.10498267471539258,"score_gpt":0.30295721592339336,"score_spread":0.1979745412080008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3012290046","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00899368,0.5096775,0.45165673,0.016827477,0.0048727673,0.0034959791,0.000008714425,0.0005993433,0.0038677987],"genre_scores_gemma":[0.9157757,0.057585128,0.018439705,0.0069398754,0.00056040956,0.00045528502,0.000109241315,0.000026922646,0.00010770443],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99602205,0.00058369763,0.0008774746,0.00066511636,0.0013744001,0.0004772736],"domain_scores_gemma":[0.996077,0.0004283205,0.00054749975,0.0018741367,0.00092067913,0.00015235112],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0043008896,0.00025908064,0.00041736616,0.00022413049,0.0002990834,0.00015015913,0.0017802768,0.00012037416,0.00087674055],"category_scores_gemma":[0.0013990601,0.00024779118,0.00013612707,0.0030316473,0.000046709443,0.0006340234,0.00017436518,0.0002433835,0.0011794434],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002561427,0.000074731855,0.0017912616,0.000074919524,0.000028941764,5.3827125e-7,0.000016033146,0.002529981,0.00000934519,0.00016173653,0.015501195,0.97980875],"study_design_scores_gemma":[0.0010894354,0.000108405206,0.006803147,0.00070740836,0.00023180415,0.0000029724774,0.000001667258,0.9549492,0.00004117612,0.0014749292,0.03421466,0.00037521066],"about_ca_topic_score_codex":0.000005331585,"about_ca_topic_score_gemma":0.0000048033858,"teacher_disagreement_score":0.97943354,"about_ca_system_score_codex":0.00019400204,"about_ca_system_score_gemma":0.00013230454,"threshold_uncertainty_score":0.99999744},"labels":[],"label_agreement":null},{"id":"W3012429921","doi":"10.1109/iscc50000.2020.9219612","title":"Dynamic Routing with Online Traffic Estimation for Video Streaming over Software Defined Networks","year":2020,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Video streaming; Routing (electronic design automation); Computer network; Software; Real-time computing; Software-defined networking; Operating system","score_opus":0.010153881007981449,"score_gpt":0.2241580627786259,"score_spread":0.21400418177064445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3012429921","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029425725,0.00008143068,0.96701145,0.0022504083,0.000108628155,0.0003396469,0.0000040327013,0.0007537706,0.00002487621],"genre_scores_gemma":[0.6919259,0.0000017256133,0.30638567,0.001506428,0.000073083094,0.000021204569,0.000027022446,0.00001333865,0.000045644876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880916,0.000025803007,0.00024492867,0.00043060133,0.00017092502,0.00031857536],"domain_scores_gemma":[0.99914455,0.00032009959,0.00011522982,0.00021540305,0.000070387185,0.00013432358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000101078294,0.00017819041,0.00019943884,0.000030736235,0.00015506077,0.0001577069,0.00036029101,0.000054372955,0.000011366394],"category_scores_gemma":[0.00007448207,0.00014572406,0.00006489993,0.0003274172,0.000020376046,0.00034899113,0.000054963602,0.00012862668,0.0000048557345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002430587,0.000018725566,0.000075574324,0.0000068019076,0.000015270418,0.0000026847704,0.00007081422,0.55264294,0.0000021430428,0.0022031602,0.00019758582,0.44474],"study_design_scores_gemma":[0.0010625097,0.00019754778,0.00051941397,0.00003673181,0.00002276596,0.0000054540074,0.000026759548,0.99768496,0.0000017673165,0.00004194076,0.00019959858,0.00020054165],"about_ca_topic_score_codex":0.0000036268998,"about_ca_topic_score_gemma":0.00007607119,"teacher_disagreement_score":0.66250014,"about_ca_system_score_codex":0.000033573542,"about_ca_system_score_gemma":0.00006326377,"threshold_uncertainty_score":0.59424543},"labels":[],"label_agreement":null},{"id":"W3013446771","doi":"10.5539/mas.v14n4p23","title":"Influencing Performance Measurements through Varying Packet Capacities of Queue Nodes - DRED","year":2020,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Active queue management; Queue; Computer network; Queue management system; Node (physics); Network packet; Random early detection; Network congestion; Throughput; Multilevel queue; Queueing theory; Engineering","score_opus":0.05639231014487046,"score_gpt":0.22935063244566836,"score_spread":0.1729583223007979,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013446771","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34257314,0.000055928518,0.650801,0.00034866476,0.000106685024,0.00016255879,0.0000011173663,0.0001597648,0.005791147],"genre_scores_gemma":[0.9833493,0.000007880049,0.015343857,0.0012021187,0.000054683227,0.00002321486,3.949372e-7,0.000007808503,0.0000107174155],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768573,0.000022943994,0.00032194614,0.0005801806,0.0009388554,0.00045036635],"domain_scores_gemma":[0.99905026,0.00004458728,0.00016305396,0.00042835504,0.00016874858,0.00014500499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005249652,0.00017339241,0.00023782201,0.00006175151,0.00037328288,0.00015109344,0.0015535881,0.000036455986,0.0000054018237],"category_scores_gemma":[0.00003796548,0.00016267394,0.000040524104,0.0008620478,0.0005466463,0.0010287431,0.000264608,0.00015733505,0.000024463357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045798388,0.00004672267,0.0008630274,0.00006766989,0.000022849941,0.0000023097816,0.025392922,0.056406725,0.67214274,0.023321526,0.00008318352,0.22160454],"study_design_scores_gemma":[0.00039987164,0.000038684815,0.0005189118,0.000032614054,0.000005965158,0.000001939068,0.00010404772,0.9517463,0.045841224,0.0010425583,0.00005466744,0.00021322281],"about_ca_topic_score_codex":0.000013565918,"about_ca_topic_score_gemma":0.0000015233411,"teacher_disagreement_score":0.89533955,"about_ca_system_score_codex":0.000058172678,"about_ca_system_score_gemma":0.0002808405,"threshold_uncertainty_score":0.6633651},"labels":[],"label_agreement":null},{"id":"W3014813176","doi":"10.1109/icc42927.2021.9500258","title":"An Early Benchmark of Quality of Experience Between HTTP/2 and HTTP/3 using Lighthouse","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Benchmark (surveying); Computer network; Hypertext Transfer Protocol; Implementation; Metric (unit); Latency (audio); Protocol (science); Throughput; Quality of experience; Operating system; Quality of service; Telecommunications; The Internet; Engineering; Software engineering","score_opus":0.05636416313564693,"score_gpt":0.32720327471841454,"score_spread":0.27083911158276763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014813176","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66271925,0.00031827347,0.33627698,0.00006308987,0.00020420646,0.00014211706,0.0000059964464,0.00006180972,0.00020829416],"genre_scores_gemma":[0.9393872,0.000038573664,0.060350083,0.00004678649,0.0001065206,0.000009651112,0.000005798324,0.0000102202985,0.000045178662],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9973851,0.00034072384,0.0007962613,0.00077810854,0.00044886235,0.00025096026],"domain_scores_gemma":[0.9974927,0.0002312142,0.0005240709,0.0012706193,0.0003110131,0.00017043953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060704787,0.00025276045,0.0007554615,0.00009628563,0.000064810985,0.00017534058,0.0010827093,0.0002548834,0.000022862247],"category_scores_gemma":[0.000042782984,0.00024382006,0.00013768175,0.0002398829,0.00017114916,0.00038341078,0.0009501082,0.00030562593,4.452993e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090537265,0.0007867457,0.32733908,0.001072082,0.0006131663,0.000045082255,0.034593903,0.009368895,0.020015324,0.06734093,0.00009231268,0.5386419],"study_design_scores_gemma":[0.0017483002,0.00050777075,0.5054624,0.001099566,0.0001957931,0.0000111681275,0.001480584,0.4662229,0.01862537,0.0024184273,0.0001095626,0.0021181286],"about_ca_topic_score_codex":0.0008239756,"about_ca_topic_score_gemma":0.000036972117,"teacher_disagreement_score":0.5365238,"about_ca_system_score_codex":0.00002311484,"about_ca_system_score_gemma":0.0002471195,"threshold_uncertainty_score":0.9942694},"labels":[],"label_agreement":null},{"id":"W3019166061","doi":"10.1049/iet-cta.2019.1138","title":"Predictive sliding‐mode congestion control for wireless access networks with singular and non‐singular control gain","year":2020,"lang":"en","type":"article","venue":"IET Control Theory and Applications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Control theory (sociology); Model predictive control; Computer science; Sliding mode control; Network congestion; Wireless; Mode (computer interface); Control (management); Computer network; Telecommunications; Physics; Artificial intelligence; Nonlinear system","score_opus":0.007344826316480573,"score_gpt":0.2336805493117065,"score_spread":0.22633572299522595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3019166061","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034214219,0.0009996531,0.98685884,0.004896124,0.000074649906,0.0031798119,0.00008386304,0.0003218136,0.0001638391],"genre_scores_gemma":[0.9905871,0.00006389891,0.0012544576,0.005219899,0.00059513317,0.0021932616,0.000019086612,0.000035924622,0.00003120472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976624,0.00032739117,0.00041159528,0.0008865231,0.00021321482,0.0004988332],"domain_scores_gemma":[0.99676967,0.0017966761,0.00028901314,0.00043778433,0.0003087078,0.00039817026],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00081863947,0.0003796181,0.00059507426,0.00006524101,0.00054750073,0.0004960599,0.0006204907,0.00018045727,0.0000035427481],"category_scores_gemma":[0.00007727871,0.00033210227,0.00009633273,0.00030162875,0.00026282013,0.00055210484,0.00006132179,0.0002912062,0.0000026361022],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025263745,0.00012478192,0.000790426,0.00005139669,0.00045225816,0.0000074499158,0.00046966173,0.05609908,0.0008779968,0.78238165,0.00020799633,0.15601094],"study_design_scores_gemma":[0.01022845,0.00043279494,0.0004609272,0.000050210823,0.0003519563,0.000016550828,0.00006254891,0.97280455,0.0000333618,0.011437804,0.0037071,0.00041372178],"about_ca_topic_score_codex":0.000004431623,"about_ca_topic_score_gemma":0.000004609934,"teacher_disagreement_score":0.9871657,"about_ca_system_score_codex":0.000026877306,"about_ca_system_score_gemma":0.00009436884,"threshold_uncertainty_score":0.9999131},"labels":[],"label_agreement":null},{"id":"W3019465497","doi":"10.1016/j.comnet.2020.107278","title":"Congestion tracking control for multi-router TCP/AQM network based on integral backstepping","year":2020,"lang":"en","type":"article","venue":"Computer Networks","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Taishan Scholar Project of Shandong Province","keywords":"Active queue management; Computer science; Computer network; Network congestion; Explicit Congestion Notification; TCP Friendly Rate Control; Router; TCP tuning; Packet loss; TCP global synchronization; TCP Vegas; Bottleneck; TCP Westwood plus; CUBIC TCP; Backstepping; Network packet; Control (management); Adaptive control; Embedded system","score_opus":0.03965669460011897,"score_gpt":0.24895093754890907,"score_spread":0.2092942429487901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3019465497","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021195936,0.0003275092,0.98885745,0.0055620586,0.003027055,0.0010726671,0.000005042791,0.0008407305,0.00009552686],"genre_scores_gemma":[0.8103413,0.0000074941727,0.15748253,0.026863035,0.00507594,0.00012792992,0.00002651885,0.000047997702,0.000027242218],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99676156,0.0002804579,0.0006328886,0.0010600726,0.00031632558,0.000948671],"domain_scores_gemma":[0.997548,0.0009346509,0.0002734487,0.0006022478,0.00022422647,0.00041744972],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055447477,0.0004982712,0.0006173981,0.00007543959,0.00035894715,0.00056554796,0.0012105288,0.00026762867,0.000015413578],"category_scores_gemma":[0.000044383945,0.0004734238,0.00035219183,0.00050251186,0.00007132475,0.00040665665,0.00013731541,0.000599398,0.000041698953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012356005,0.0000467552,0.00038119146,0.000011615695,0.000043652817,0.000013222762,0.00006999441,0.63212025,0.000001521315,0.005638309,0.0096430695,0.35190684],"study_design_scores_gemma":[0.0047187274,0.0005441826,0.0012144776,0.00019505153,0.000041338822,0.000005249077,0.000003405315,0.9828445,0.0000025102313,0.000088723056,0.009823861,0.000518],"about_ca_topic_score_codex":0.000002003151,"about_ca_topic_score_gemma":0.000005149688,"teacher_disagreement_score":0.83137494,"about_ca_system_score_codex":0.00007121089,"about_ca_system_score_gemma":0.00007285902,"threshold_uncertainty_score":0.9997718},"labels":[],"label_agreement":null},{"id":"W3027654966","doi":"10.1007/s11277-020-07477-x","title":"Improving Throughput in Lossy Wired/Wireless Networks","year":2020,"lang":"en","type":"article","venue":"Wireless Personal Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"TCP global synchronization; Computer science; TCP acceleration; Zeta-TCP; H-TCP; Computer network; TCP Westwood; TCP Westwood plus; TCP Friendly Rate Control; CUBIC TCP; TCP tuning; HSTCP; Transmission Control Protocol; Network packet","score_opus":0.030837826895865807,"score_gpt":0.24859045307304517,"score_spread":0.21775262617717936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3027654966","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042942323,0.0029736627,0.8973098,0.05242433,0.00025608263,0.0004764669,0.000009097586,0.0006422382,0.0029660221],"genre_scores_gemma":[0.99007964,0.00037770264,0.006149189,0.003016274,0.00017620427,0.00009408505,0.000018828494,0.000021773234,0.0000662902],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981049,0.0002651331,0.0004154606,0.000490812,0.00028233067,0.0004414086],"domain_scores_gemma":[0.9978639,0.00037157876,0.00015781981,0.001271927,0.000115627256,0.00021916108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028480368,0.00022730728,0.0003076945,0.000068680565,0.00038110052,0.00021402024,0.0031608269,0.00012890388,0.00001829096],"category_scores_gemma":[0.000030888667,0.00024276534,0.00012034645,0.0009003187,0.00019423252,0.000526013,0.0009091356,0.00061122753,0.000050745024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025475665,0.00018235683,0.0018397596,0.000019471252,0.000038171787,0.000017810375,0.004295308,0.0021743143,0.00027131295,0.15061413,0.0011890873,0.8393328],"study_design_scores_gemma":[0.00058742636,0.000042695694,0.0007009557,0.000040573916,0.000008768288,0.000008036986,0.00025550064,0.99468446,0.000010388488,0.00012493148,0.0032668852,0.00026936934],"about_ca_topic_score_codex":0.000112324466,"about_ca_topic_score_gemma":0.000291208,"teacher_disagreement_score":0.99251014,"about_ca_system_score_codex":0.00008106206,"about_ca_system_score_gemma":0.00017356442,"threshold_uncertainty_score":0.9899683},"labels":[],"label_agreement":null},{"id":"W3034349872","doi":"10.1109/noms47738.2020.9110387","title":"Perfect is the Enemy of Good: Lloyd-Max Quantization for Rate Allocation in Congestion Control Plane","year":2020,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Quantization (signal processing); Computer science; Mathematical optimization; Bit rate; Algorithm; Mathematics; Real-time computing","score_opus":0.016404905536371483,"score_gpt":0.22742035451425593,"score_spread":0.21101544897788446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034349872","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014581469,0.00014323612,0.9541797,0.029838828,0.00014899598,0.0007081818,0.000005613139,0.00008751806,0.00030646814],"genre_scores_gemma":[0.9948638,0.000025427147,0.0011781213,0.003673305,0.00008693124,0.00006812528,0.0000095460855,0.0000061485125,0.00008860751],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901026,0.00014443796,0.0002921295,0.00025868654,0.0001377332,0.0001567236],"domain_scores_gemma":[0.99901164,0.00049250666,0.00013021038,0.00019214567,0.00012605579,0.000047465855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048648583,0.00010340669,0.00017551349,0.000037991806,0.000059788104,0.00005290692,0.00034593567,0.00005664202,0.000020410453],"category_scores_gemma":[0.00010167071,0.000075839765,0.000054064654,0.00029092046,0.000029308945,0.00020372667,0.000021611959,0.00007254587,0.000013487631],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035755112,0.000120021214,0.004421276,0.000073667776,0.0000861537,0.0000019142046,0.002102739,0.06316834,0.0067313924,0.548716,0.004638906,0.36958203],"study_design_scores_gemma":[0.0016678663,0.0002329125,0.0029585655,0.000015286247,0.000016874163,9.910892e-7,0.000043407177,0.9907617,0.0011251499,0.0003318335,0.0027446223,0.000100809695],"about_ca_topic_score_codex":0.000026696158,"about_ca_topic_score_gemma":0.00004202891,"teacher_disagreement_score":0.9802823,"about_ca_system_score_codex":0.00001504889,"about_ca_system_score_gemma":0.0000657512,"threshold_uncertainty_score":0.3092656},"labels":[],"label_agreement":null},{"id":"W3034825143","doi":"10.1109/noms47738.2020.9110367","title":"Hierarchical Congestion Control (HCC): Cooperation of Uncorrelated Flows for Better Fairness and Throughput","year":2020,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Fairness measure; Computer science; Throughput; Network congestion; Metric (unit); Flow control (data); Computer network; Max-min fairness; Uncorrelated; Flow (mathematics); Aggregate (composite); Resource allocation; Mathematics; Statistics; Wireless; Telecommunications; Engineering","score_opus":0.012274430814077052,"score_gpt":0.213441591121525,"score_spread":0.20116716030744794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034825143","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038452495,0.000094737276,0.9414489,0.019008515,0.00018952265,0.00046329762,0.0000057550465,0.00014681184,0.00018995472],"genre_scores_gemma":[0.9820256,0.000009122421,0.014191493,0.0035257298,0.00014061436,0.00004134376,0.00000819951,0.0000070565957,0.000050794533],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902725,0.00007491233,0.00027511246,0.00032579084,0.00013285354,0.00016410051],"domain_scores_gemma":[0.99919707,0.0003062258,0.00006794564,0.00014916914,0.00016833564,0.00011127696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016191146,0.00011996207,0.00024270272,0.000025827198,0.00007677051,0.00006988364,0.0002091915,0.00009012617,0.000017761085],"category_scores_gemma":[0.00007413958,0.00010000372,0.000048319846,0.00016612343,0.000052598334,0.0002826628,0.00003969854,0.00011024417,0.000007660084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028738636,0.000071335664,0.0012640359,0.00004770352,0.000097520235,0.0000045288907,0.00065721286,0.012357963,0.0027589207,0.31135008,0.0031171544,0.66798615],"study_design_scores_gemma":[0.0024188475,0.00027908632,0.00046619683,0.000011186401,0.000023043602,0.0000047059566,0.0000081448115,0.9934216,0.00015014406,0.0007971032,0.0022942752,0.00012566101],"about_ca_topic_score_codex":0.0000047605754,"about_ca_topic_score_gemma":0.000008713359,"teacher_disagreement_score":0.98106366,"about_ca_system_score_codex":0.000008685862,"about_ca_system_score_gemma":0.0000473958,"threshold_uncertainty_score":0.40780336},"labels":[],"label_agreement":null},{"id":"W3039682304","doi":"10.1109/pimrc48278.2020.9217139","title":"Probabilistic Bounds on the End-to-End Delay of Service Function Chains using Deep MDN","year":2020,"lang":"en","type":"preprint","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Queueing theory; Computer science; Probabilistic logic; End-to-end principle; Service (business); Task (project management); Function (biology); Layered queueing network; Statistical model; Mathematical optimization; Artificial intelligence; Computer network; Mathematics; Engineering","score_opus":0.04185064687958321,"score_gpt":0.24504190931006117,"score_spread":0.20319126243047797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3039682304","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018100314,0.000076476026,0.9589544,0.016861772,0.0011690023,0.00081505027,0.0000047504705,0.00026500897,0.003753253],"genre_scores_gemma":[0.9862689,0.0000043686246,0.0059297257,0.007121763,0.00037720343,0.00007757738,0.000007695163,0.000019041927,0.00019372274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789125,0.000195603,0.00041839023,0.0007570858,0.0004408001,0.00029685197],"domain_scores_gemma":[0.997944,0.0003403778,0.00023826509,0.0010388457,0.00028898942,0.00014951351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044851613,0.0003041733,0.0003490263,0.00009241327,0.00016544996,0.00023248768,0.0013426961,0.00017546427,0.00012495548],"category_scores_gemma":[0.00006964606,0.000218886,0.00014127827,0.00053659786,0.000048376172,0.000084220155,0.0009121296,0.0005379065,0.00006914632],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007472404,0.00009644662,0.000018082452,0.00012441195,0.00015099293,0.000005274293,0.0010141627,0.42062387,0.00013524853,0.45233184,0.00073102297,0.12469392],"study_design_scores_gemma":[0.00016089033,0.00011888264,0.00017197628,0.00010286672,0.000060977873,0.000004764234,0.000038246948,0.99028724,0.000027188453,0.007110647,0.0016751974,0.00024109204],"about_ca_topic_score_codex":0.00016023878,"about_ca_topic_score_gemma":0.00032361623,"teacher_disagreement_score":0.9681686,"about_ca_system_score_codex":0.00010554732,"about_ca_system_score_gemma":0.00033027725,"threshold_uncertainty_score":0.8925912},"labels":[],"label_agreement":null},{"id":"W3041895453","doi":"10.1007/s00521-020-05168-z","title":"Robust finite-time $$H_{\\infty }$$ congestion control for a class of AQM network systems","year":2020,"lang":"en","type":"article","venue":"Neural Computing and Applications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"China Scholarship Council","keywords":"Backstepping; Network congestion; Control theory (sociology); Computer science; Controller (irrigation); Tracking error; Convergence (economics); Active queue management; Queue; Transmission Control Protocol; Robust control; Mathematics; Loop (graph theory); Applied mathematics; Control (management); Mathematical optimization; Control system; Adaptive control; Computer network; Engineering","score_opus":0.023910782828458283,"score_gpt":0.22698533696134007,"score_spread":0.20307455413288178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041895453","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033429966,0.00052807323,0.99106175,0.003554649,0.00012083478,0.000916755,0.000016559057,0.00026961576,0.00018875733],"genre_scores_gemma":[0.9929621,0.000007080943,0.0052923523,0.00084555545,0.0007087865,0.0001251936,0.000012125138,0.000010238718,0.00003652],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987975,0.00007774833,0.00035782554,0.00038882752,0.00012630291,0.00025180914],"domain_scores_gemma":[0.9983057,0.0009244017,0.00022307932,0.0002355965,0.00016547443,0.00014576672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002188202,0.00014344107,0.0002894137,0.000024690213,0.00026426243,0.00011357728,0.00035396026,0.000068833695,0.0000013465057],"category_scores_gemma":[0.000041573297,0.00013853132,0.00007090694,0.0003128497,0.000058236237,0.00009037147,0.000068281115,0.00013037618,0.0000084317935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022176115,0.000024794403,0.00022983835,0.00004792982,0.000027819295,4.2007645e-7,0.00007201817,0.8155226,0.00014207851,0.06970632,0.0020928222,0.11211118],"study_design_scores_gemma":[0.00078546983,0.000113639886,0.00024894773,0.000023582048,0.00002891099,0.0000046558857,0.000010309189,0.9892676,0.000005121557,0.00022864417,0.009151104,0.00013204337],"about_ca_topic_score_codex":0.00000410235,"about_ca_topic_score_gemma":4.989837e-7,"teacher_disagreement_score":0.98961914,"about_ca_system_score_codex":0.0000089884625,"about_ca_system_score_gemma":0.00003266913,"threshold_uncertainty_score":0.56491435},"labels":[],"label_agreement":null},{"id":"W3042805751","doi":"","title":"STRATEGIC IDLING AND DYNAMIC SCHEDULING IN OPEN-SHOP SERVICE NETWORK: CASE STUDY AND ANALYSIS","year":2016,"lang":"en","type":"article","venue":"International Conference on Information Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Scheduling (production processes); Computer science; Operations research; Engineering; Operations management","score_opus":0.0489791343714587,"score_gpt":0.3047264129459491,"score_spread":0.2557472785744904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3042805751","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7675015,0.000036608933,0.22637913,0.0011489969,0.00043921464,0.0005219357,0.000009199939,0.000064607935,0.0038988201],"genre_scores_gemma":[0.9991757,0.000026129532,0.00046699034,0.00017380636,0.000034846275,0.000057096357,0.000006075544,0.0000028574607,0.000056454344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986762,0.00011047114,0.00052187685,0.00024265346,0.00027712967,0.00017169886],"domain_scores_gemma":[0.99897486,0.00014785217,0.00024382569,0.00022368318,0.00033148282,0.00007828762],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00075190165,0.000137793,0.00022036879,0.0003224824,0.00009709341,0.0012623438,0.00052085274,0.000052570063,0.000012048416],"category_scores_gemma":[0.000015883617,0.00010445866,0.000019291754,0.00046974604,0.00001738385,0.0021878397,0.00022229375,0.000098396726,0.000023688333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009206148,0.000114103095,0.028770613,0.000033018863,0.00057800877,0.00020827242,0.005001173,0.0839387,0.000023336228,0.69407713,0.0000143829375,0.18714918],"study_design_scores_gemma":[0.0010964657,0.00005481126,0.0016241852,0.000107335705,0.000017502312,0.00014351122,0.0040084454,0.99237794,2.3420637e-7,0.00036923014,0.00005905766,0.00014129683],"about_ca_topic_score_codex":0.00035904837,"about_ca_topic_score_gemma":0.0007468213,"teacher_disagreement_score":0.9084392,"about_ca_system_score_codex":0.000063243395,"about_ca_system_score_gemma":0.000072508206,"threshold_uncertainty_score":0.99977446},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.015384620539159044,"score_gpt":0.19120593530696933,"score_spread":0.1758213147678103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3047438757","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006505273,0.0009810993,0.9286713,0.059923366,0.000260318,0.000093449235,0.0000016901757,0.00058191986,0.0029816078],"genre_scores_gemma":[0.97986263,0.000019481451,0.0013396882,0.017775448,0.00030565058,0.000021617818,0.0000060161474,0.000008143093,0.00066133426],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882567,0.00018914776,0.0001905325,0.00035568335,0.0002210493,0.00021788802],"domain_scores_gemma":[0.9988759,0.00064394024,0.000078149256,0.00022394152,0.000050215796,0.00012783603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016579777,0.00012563672,0.00015076048,0.000007573987,0.00021829388,0.00021984518,0.0006087819,0.00005669396,0.00017241224],"category_scores_gemma":[0.00012780742,0.00008546065,0.000051948315,0.00013872972,0.00003456543,0.00024064054,0.00007535821,0.0002140218,0.00021744664],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036111767,0.000018316821,0.0020324353,0.000001014068,0.00005463268,0.000009684608,0.0013875965,0.005804662,0.0022158346,0.016689051,0.10248334,0.86926734],"study_design_scores_gemma":[0.0010555654,0.0000898659,0.00046424146,0.000009168048,0.000011392707,0.0000017295646,0.00016077048,0.77952456,0.00008495726,0.00006327065,0.21836558,0.00016888948],"about_ca_topic_score_codex":0.00005213022,"about_ca_topic_score_gemma":0.0000054154434,"teacher_disagreement_score":0.9733573,"about_ca_system_score_codex":0.000011811946,"about_ca_system_score_gemma":0.000031579537,"threshold_uncertainty_score":0.34849843},"labels":[],"label_agreement":null},{"id":"W3049272805","doi":"10.1109/tsp49548.2020.9163512","title":"A Performance Evaluation of TCP BBRv2 Alpha","year":2020,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"","keywords":"Bottleneck; Computer science; Bandwidth (computing); Network congestion; H-TCP; Queueing theory; Computer network; Latency (audio); HSTCP; Bandwidth allocation; TCP Friendly Rate Control; Distributed computing; TCP acceleration; Telecommunications; Network packet; Embedded system","score_opus":0.04093758254238683,"score_gpt":0.24759830796732718,"score_spread":0.20666072542494035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3049272805","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31879488,0.00023105482,0.63048023,0.009266779,0.00026312735,0.00029218188,3.9382644e-7,0.0002504214,0.04042095],"genre_scores_gemma":[0.9952623,0.000008110847,0.0036589685,0.0009101498,0.000058825164,0.000008610609,3.940126e-7,0.0000017906589,0.000090853224],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992781,0.000042091466,0.00012252983,0.00014033054,0.00033397932,0.00008293712],"domain_scores_gemma":[0.9995794,0.000024197421,0.00004267454,0.00014840401,0.00015270106,0.000052585787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002990459,0.000045760615,0.00007303179,0.000015212916,0.000023536453,0.000015994412,0.000288403,0.000017950459,0.0001234235],"category_scores_gemma":[0.00002382941,0.000038669565,0.000025583044,0.00020267231,0.000012369777,0.00019452562,0.00004335077,0.00003645231,0.000077584526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039155316,0.000009915876,0.0003490229,0.0000032237645,0.000006448594,1.8759633e-7,0.00019368784,0.0043924036,0.00011703777,0.010021859,0.0018106527,0.98309165],"study_design_scores_gemma":[0.00039343428,0.00006241508,0.0019337755,0.000003818334,0.000008130105,6.654487e-7,0.000007990528,0.99549204,0.00040718052,0.000054451357,0.0015891667,0.000046902078],"about_ca_topic_score_codex":0.0000012567061,"about_ca_topic_score_gemma":7.1343044e-7,"teacher_disagreement_score":0.99109966,"about_ca_system_score_codex":0.0000072840908,"about_ca_system_score_gemma":0.00007148372,"threshold_uncertainty_score":0.15768991},"labels":[],"label_agreement":null},{"id":"W3083622544","doi":"10.1145/2381996.2381998","title":"Sender-side Buffers and the Case for Multimedia Adaptation","year":2012,"lang":"en","type":"article","venue":"Queue","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of British Columbia","keywords":"Computer science; Adaptation (eye); The Internet; Communication source; Competition (biology); Architecture; World Wide Web; Point (geometry); Web site; Computer network; Ecology","score_opus":0.020973838989267017,"score_gpt":0.2377950167441162,"score_spread":0.2168211777548492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3083622544","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011835201,0.0007441182,0.9825312,0.0035097022,0.00048806958,0.0003130513,0.0000014561911,0.000076797405,0.000500428],"genre_scores_gemma":[0.9818197,0.0000104077235,0.017148282,0.00054635847,0.0002313894,0.00006335071,8.8560154e-7,0.000003491627,0.00017612109],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995495,0.000058138696,0.00008112937,0.00010180638,0.00005102904,0.00015838338],"domain_scores_gemma":[0.9992275,0.00050043705,0.000033635166,0.00014390242,0.000030545947,0.000063976106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003487606,0.000056690977,0.000068586785,0.000014780346,0.000115277166,0.000047513906,0.00010087531,0.000027278662,0.000002071768],"category_scores_gemma":[0.000048298865,0.000037505346,0.000027427814,0.00004986853,0.000045672157,0.00020591698,0.000024320585,0.00004656469,0.000008796521],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019919162,0.000011008412,0.00003736454,0.0000035389971,0.000012099888,0.000008960428,0.0022112387,0.00020854599,0.0000055129335,0.1447567,0.001048631,0.85167646],"study_design_scores_gemma":[0.0011992485,0.0000140062675,0.00011283352,0.0000028518057,0.000011833646,0.00017750853,0.00022413586,0.9927323,0.000020908972,0.001084349,0.0043562856,0.00006373559],"about_ca_topic_score_codex":0.000050450195,"about_ca_topic_score_gemma":0.00005319142,"teacher_disagreement_score":0.9925237,"about_ca_system_score_codex":0.000008246047,"about_ca_system_score_gemma":0.000016178716,"threshold_uncertainty_score":0.15294236},"labels":[],"label_agreement":null},{"id":"W3084675458","doi":"","title":"Channel Expansion for ServiceBC Contact Center at MAXIMUS Canada","year":2020,"lang":"en","type":"article","venue":"UVic’s Research and Learning Repository (University of Victoria)","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Channel (broadcasting); Telecommunications; Computer science","score_opus":0.023550407914029355,"score_gpt":0.22726758797967744,"score_spread":0.2037171800656481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3084675458","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90745336,0.001089114,0.069735035,0.01376251,0.0015106292,0.0010260425,0.000017931286,0.00028419055,0.0051211696],"genre_scores_gemma":[0.9965628,0.000040319374,0.00034384828,0.00008915836,0.00021579688,0.0000011369266,0.0000063199927,0.000007242966,0.0027334192],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984974,0.00021037464,0.000103403014,0.0003896795,0.00045634087,0.0003427753],"domain_scores_gemma":[0.9987246,0.0003160561,0.00007852173,0.00018593618,0.00036507676,0.00032985437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028519594,0.00009982084,0.00018684816,0.000050287086,0.00089627993,0.000060369337,0.00049111864,0.000071280556,0.000020086425],"category_scores_gemma":[0.000043343607,0.000115376584,0.000048754064,0.00022776269,0.000053635766,0.00021249735,0.00030526513,0.000344056,0.000007906729],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0139102,0.0013572843,0.07922025,0.0036764054,0.0020137553,0.0037964832,0.09448015,0.01958814,0.080355726,0.020138096,0.41734838,0.26411512],"study_design_scores_gemma":[0.0043338044,0.0017946971,0.0073420294,0.00012823365,0.000020504232,0.000029258545,0.0036276795,0.41911724,0.0004441934,0.00007942471,0.5626561,0.00042684245],"about_ca_topic_score_codex":0.016497528,"about_ca_topic_score_gemma":0.007772644,"teacher_disagreement_score":0.3995291,"about_ca_system_score_codex":0.00013152481,"about_ca_system_score_gemma":0.00030333985,"threshold_uncertainty_score":0.9900517},"labels":[],"label_agreement":null},{"id":"W3088063260","doi":"10.1145/1012888.1005726","title":"A model of BGP routing for network engineering","year":2004,"lang":"en","type":"article","venue":"ACM SIGMETRICS Performance Evaluation Review","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lockheed Martin (Canada)","funders":"","keywords":"Computer science; Distributed computing; Computer network; Network mapping; Routing protocol; Routing domain; Router; Default-free zone; Static routing; Border Gateway Protocol; Routing (electronic design automation); Routing table; Traffic engineering; IP forwarding; Exploit; The Internet; Computer security","score_opus":0.07282824963096528,"score_gpt":0.2985425160890364,"score_spread":0.22571426645807113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088063260","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004959815,0.04044958,0.95227057,0.0007633694,0.0002972072,0.0010567056,0.0000011773448,0.00008733149,0.00011426977],"genre_scores_gemma":[0.79427123,0.015789472,0.18881014,0.0006900307,0.0001372053,0.00026536448,0.00000765726,0.000012171282,0.000016757738],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831927,0.000033374094,0.00053960446,0.00027059857,0.000553046,0.00028408787],"domain_scores_gemma":[0.9981598,0.00028955046,0.00028798386,0.00065448874,0.00054744,0.00006069768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035415124,0.00014212768,0.00031458907,0.00013089135,0.00009588376,0.000031373074,0.000783806,0.00004983269,0.000006093649],"category_scores_gemma":[0.0016118588,0.00013347626,0.000119095246,0.001691471,0.000010600215,0.00040976357,0.00011121877,0.00010247018,0.000010092546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001142213,0.000009944416,0.00004337281,0.00023937489,0.000008687758,3.127866e-8,0.000016504237,0.57960373,0.0000074597233,0.008509487,0.00016802941,0.41139224],"study_design_scores_gemma":[0.0006029019,0.00006699759,0.00012975397,0.0012276033,0.00007134869,0.0000016675409,6.326427e-7,0.99615985,0.0000395627,0.0008105462,0.00074418756,0.00014497022],"about_ca_topic_score_codex":6.459529e-7,"about_ca_topic_score_gemma":3.4244036e-7,"teacher_disagreement_score":0.7893114,"about_ca_system_score_codex":0.000097338714,"about_ca_system_score_gemma":0.00026839884,"threshold_uncertainty_score":0.54430044},"labels":[],"label_agreement":null},{"id":"W3088296267","doi":"10.1007/s11276-020-02459-0","title":"TCP CERL+: revisiting TCP congestion control in wireless networks with random loss","year":2020,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"TCP global synchronization; TCP Friendly Rate Control; Computer science; TCP Westwood plus; TCP acceleration; CUBIC TCP; H-TCP; Zeta-TCP; TCP tuning; Computer network; Compound TCP; TCP Westwood; HSTCP; Network congestion; Network packet","score_opus":0.00746378198499164,"score_gpt":0.19449204345410662,"score_spread":0.18702826146911497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088296267","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028169084,0.001528673,0.9616,0.005763636,0.00076805573,0.000964827,0.0000031767572,0.0007001114,0.000502428],"genre_scores_gemma":[0.9909798,0.00037001984,0.0007774468,0.0048585404,0.002699826,0.00016444085,0.000021984875,0.00006980755,0.000058114394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954033,0.0006172544,0.00093540445,0.001245655,0.0005849352,0.0012134782],"domain_scores_gemma":[0.99707866,0.0008475255,0.00047929984,0.00071873766,0.00032479173,0.0005510007],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085472775,0.0006229252,0.0010969049,0.00011545279,0.00029837617,0.00045153924,0.0012988005,0.00038833628,0.00003480438],"category_scores_gemma":[0.00005945565,0.0005623992,0.00019191264,0.0014345009,0.00019717494,0.0006728335,0.00018839998,0.0012038162,0.000034459623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079611276,0.00004916287,0.00886365,0.000027054659,0.00008290563,0.00027143306,0.00015889898,0.6499718,0.000008982272,0.009261572,0.0011139173,0.3293945],"study_design_scores_gemma":[0.010497146,0.00018574734,0.0020073978,0.00040376553,0.000052546806,0.00003265687,0.000040464955,0.9843093,0.0000038202215,0.00003038835,0.0017461843,0.00069055386],"about_ca_topic_score_codex":0.000032850654,"about_ca_topic_score_gemma":0.0000675051,"teacher_disagreement_score":0.96281075,"about_ca_system_score_codex":0.00010297874,"about_ca_system_score_gemma":0.00012569089,"threshold_uncertainty_score":0.9996827},"labels":[],"label_agreement":null},{"id":"W3092161114","doi":"10.1109/iwqos49365.2020.9213038","title":"MPTCP+: Enhancing Adaptive HTTP Video Streaming over Multipath","year":2020,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Multipath TCP; Computer science; Throughput; Computer network; Dash; Bandwidth (computing); Linux kernel; Multipath propagation; Path (computing); Network congestion; Quality of experience; Real-time computing; Quality of service; Channel (broadcasting); Network packet; Wireless; Operating system","score_opus":0.016144028284056748,"score_gpt":0.2165388550848763,"score_spread":0.20039482680081955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092161114","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014544953,0.00012161294,0.97707605,0.0023692907,0.00021448481,0.00013011518,8.4835085e-7,0.00047108403,0.0050715557],"genre_scores_gemma":[0.96760994,0.0000058985547,0.02738206,0.0043380023,0.0002639846,0.000010784059,6.2829486e-7,0.000007950567,0.00038074044],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988563,0.00004499605,0.00019520734,0.00041426916,0.00021746445,0.00027172768],"domain_scores_gemma":[0.99930465,0.00015597857,0.00005930876,0.00023708654,0.00005221274,0.00019075394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010154905,0.00013857345,0.0001593622,0.000026063546,0.000095951924,0.000108256376,0.00046260667,0.000046871002,0.00010302984],"category_scores_gemma":[0.000041633386,0.000120873905,0.000068521804,0.00025026806,0.000019240602,0.00039857754,0.00016024758,0.00014368075,0.0002023857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027075059,0.00004141844,0.00035689925,0.000006904039,0.0000464704,0.000049765476,0.0022361958,0.0031253318,0.0017781988,0.09794392,0.004204041,0.8901838],"study_design_scores_gemma":[0.0005116862,0.00009839851,0.00060576305,0.000015719337,0.0000063312914,0.0000021151645,0.00008845623,0.99293596,0.0007842154,0.000115660136,0.0046484047,0.00018729114],"about_ca_topic_score_codex":0.000026553165,"about_ca_topic_score_gemma":0.000033448272,"teacher_disagreement_score":0.98981065,"about_ca_system_score_codex":0.000023152359,"about_ca_system_score_gemma":0.00005786358,"threshold_uncertainty_score":0.49290946},"labels":[],"label_agreement":null},{"id":"W3098019742","doi":"10.1145/511399.511371","title":"Context-aware TCP/IP","year":2002,"lang":"en","type":"article","venue":"ACM SIGMETRICS Performance Evaluation Review","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Computer network; TCP tuning; Internet Protocol; Transmission Control Protocol; Internet protocol suite; TCP global synchronization; TCP acceleration; The Internet; Network packet; Distributed computing; World Wide Web","score_opus":0.08757470719507392,"score_gpt":0.2950560274125267,"score_spread":0.20748132021745275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3098019742","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008102759,0.8059633,0.1488784,0.020672455,0.0024077962,0.003244643,0.000004228653,0.0007623045,0.009964164],"genre_scores_gemma":[0.83416414,0.15477677,0.0022210176,0.0077318703,0.00016504947,0.00023869638,0.000009825021,0.00001361628,0.0006790296],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99719036,0.00024561532,0.0005743078,0.0004749657,0.0011616909,0.00035308438],"domain_scores_gemma":[0.99713576,0.00037310796,0.00028311697,0.0013686108,0.0007010651,0.00013832512],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0025571005,0.00021984188,0.00036656423,0.00025109373,0.00021884489,0.00011505814,0.0015198974,0.000076799544,0.0013079568],"category_scores_gemma":[0.0013876033,0.00019357206,0.00012847545,0.0028283298,0.00003401812,0.00085333874,0.00019265081,0.00022737686,0.0018769423],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.507232e-7,0.000034073775,0.00038818843,0.00014316244,0.00001305646,9.655221e-7,0.00003064992,0.00016124135,5.427747e-7,0.0010628097,0.030896677,0.967268],"study_design_scores_gemma":[0.0006168242,0.00009943942,0.0013847415,0.000705852,0.000081710845,0.000016029499,0.000003615261,0.84542316,0.000011532301,0.000097952216,0.15127255,0.0002865783],"about_ca_topic_score_codex":0.0000013582506,"about_ca_topic_score_gemma":0.0000010557691,"teacher_disagreement_score":0.9669814,"about_ca_system_score_codex":0.000112997805,"about_ca_system_score_gemma":0.00008088573,"threshold_uncertainty_score":0.999605},"labels":[],"label_agreement":null},{"id":"W3109639060","doi":"10.18280/jesa.530506","title":"Performance Analysis of Active Queue Management Algorithm Based on Reinforcement Learning","year":2020,"lang":"en","type":"article","venue":"Journal Européen des Systèmes Automatisés","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Xiamen University; Xiamen University of Technology","keywords":"Active queue management; Random early detection; Computer science; Network congestion; Reinforcement learning; Queue; Q-learning; The Internet; Computer network; Queueing theory; Queue management system; Load balancing (electrical power); Algorithm; Network packet; Artificial intelligence; Mathematics","score_opus":0.013442148799799639,"score_gpt":0.2266533379072076,"score_spread":0.21321118910740797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3109639060","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017540943,0.00007045505,0.9758293,0.0005812737,0.00016358515,0.00017346196,0.0000014919069,0.00019836871,0.0054411376],"genre_scores_gemma":[0.97259456,0.000100912475,0.026341515,0.0005517866,0.00008564869,0.000008840569,0.0000030397794,0.000013162901,0.00030054964],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979253,0.00024704798,0.00056184316,0.0002870701,0.00067782524,0.00030092386],"domain_scores_gemma":[0.9987249,0.00011309102,0.00051490276,0.0002626298,0.00017398418,0.00021051105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039817696,0.00019886438,0.0004144169,0.00037324568,0.0002594456,0.00016688569,0.000670077,0.00003979293,0.000087871354],"category_scores_gemma":[0.000035305267,0.00017020226,0.00024077391,0.0014538398,0.00004456699,0.00035625036,0.00010804941,0.00031655628,0.000039691382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016583926,0.000018552822,0.00019629454,0.00002499771,0.00037790896,0.00003472686,0.00028506704,0.44737777,0.0000071413474,0.0005564789,0.000105047075,0.55099946],"study_design_scores_gemma":[0.0005675392,0.00047735465,0.05690307,0.0001225748,0.0002829187,0.000010204086,0.000058294823,0.9406885,0.000053077056,0.000016199798,0.000661505,0.00015878382],"about_ca_topic_score_codex":0.0000029649786,"about_ca_topic_score_gemma":5.178528e-7,"teacher_disagreement_score":0.9550536,"about_ca_system_score_codex":0.000120410885,"about_ca_system_score_gemma":0.00006436499,"threshold_uncertainty_score":0.6940646},"labels":[],"label_agreement":null},{"id":"W3110255888","doi":"10.1109/ccece47787.2020.9255720","title":"Safely Engineering Egress Traffic Changes","year":2020,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Heuristic; The Internet; Scale (ratio); Automation; Traffic engineering; Internet traffic; Service (business); Service provider; Distributed computing; Computer network; Computer security; World Wide Web; Artificial intelligence; Engineering","score_opus":0.014254875435836261,"score_gpt":0.18460002411254645,"score_spread":0.1703451486767102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3110255888","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008784915,0.00036129015,0.94540524,0.041668035,0.00038849819,0.000116421485,5.662962e-7,0.0012443702,0.0020306348],"genre_scores_gemma":[0.9884849,0.000013152071,0.007983171,0.0029854588,0.00028101596,0.000009608554,4.882892e-7,0.000006067584,0.00023612735],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993768,0.000011341814,0.00008129458,0.00022103592,0.00012369733,0.00018584354],"domain_scores_gemma":[0.9996233,0.00004537946,0.00001865351,0.00014928296,0.000021801525,0.00014156461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000051029343,0.00008898703,0.00010066253,0.000023080658,0.000033232867,0.00007810455,0.00044619286,0.000030111169,0.000044696648],"category_scores_gemma":[0.000013774766,0.00007779711,0.00003085954,0.00022060094,0.000007026655,0.00011901362,0.00006312127,0.00008016878,0.00012642446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039320425,0.000010948959,0.000008846856,0.000008438704,0.000014960739,0.000019774769,0.00039395885,0.047913346,0.0002558802,0.048551265,0.0041446257,0.898674],"study_design_scores_gemma":[0.00019308388,0.000045807843,0.00006508114,0.000004706868,0.0000023690734,0.0000033653355,0.000007521381,0.9619208,0.00012306285,0.0000052575874,0.0375192,0.00010976313],"about_ca_topic_score_codex":6.069707e-7,"about_ca_topic_score_gemma":0.0000028515485,"teacher_disagreement_score":0.97969997,"about_ca_system_score_codex":0.000006396578,"about_ca_system_score_gemma":0.000016090296,"threshold_uncertainty_score":0.3172474},"labels":[],"label_agreement":null},{"id":"W3121787738","doi":"","title":"Walled Gardens: The New Shape of the Public Internet","year":2012,"lang":"en","type":"article","venue":"OCAD University Open Research Repository (OCAD University)","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario College of Art and Design","funders":"","keywords":"The Internet; Multiprotocol Label Switching; Internet Protocol; Reachability; Business; Internet Draft; Telecommunications; Internet privacy; Computer science; Engineering; World Wide Web; Internet Architecture Board; Quality of service","score_opus":0.05629607833083601,"score_gpt":0.2577810473480528,"score_spread":0.2014849690172168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3121787738","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056570243,0.00024857343,0.007726269,0.010955988,0.000824605,0.0009476416,0.000002941196,0.00010409919,0.92261964],"genre_scores_gemma":[0.7407583,0.00003995029,0.00025305894,0.000067710265,0.00009914158,2.1625803e-7,7.630938e-7,0.0000066152406,0.25877425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9964879,0.0014601824,0.00016256046,0.00042052087,0.0007790811,0.00068976206],"domain_scores_gemma":[0.997478,0.0003566363,0.00016720398,0.0011644426,0.000435086,0.000398603],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0012144254,0.00017162478,0.00023083886,0.00022508201,0.0011490857,0.0003248084,0.0074711344,0.0001406999,0.00000986537],"category_scores_gemma":[0.00006432432,0.00013075488,0.00018815581,0.0014053921,0.0005492263,0.0013323429,0.002532926,0.00069005776,0.000057661127],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008742301,0.00009994225,0.0022195233,0.0000050571102,0.00010171387,0.000044306445,0.0007374627,0.00001628721,0.00011797492,0.97416735,0.015103445,0.0072995373],"study_design_scores_gemma":[0.0012935797,0.00011178612,0.00501686,0.00005061086,0.000039520233,0.00003645116,0.0012192263,0.006802388,0.0003127876,0.00009285325,0.9848052,0.00021870079],"about_ca_topic_score_codex":0.00043883373,"about_ca_topic_score_gemma":0.00023026233,"teacher_disagreement_score":0.9740745,"about_ca_system_score_codex":0.00036669156,"about_ca_system_score_gemma":0.00083967333,"threshold_uncertainty_score":0.99789894},"labels":[],"label_agreement":null},{"id":"W3133904720","doi":"10.23919/icact51234.2021.9370861","title":"TCP Congestion Avoidance in Data Centres using Reinforcement Learning","year":2021,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; TCP tuning; Computer network; Zeta-TCP; TCP Friendly Rate Control; Reinforcement learning; TCP acceleration; Network congestion; Throughput; TCP Westwood plus; H-TCP; The Internet; Transmission Control Protocol; Artificial intelligence; Network packet; Telecommunications; Wireless; World Wide Web","score_opus":0.04299066574049768,"score_gpt":0.2721910091896834,"score_spread":0.22920034344918574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3133904720","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014716507,0.0005038388,0.97967935,0.0014425801,0.00033962738,0.00007903465,3.4168238e-7,0.00014024148,0.0030985072],"genre_scores_gemma":[0.98274904,0.000060566836,0.014737354,0.00048579657,0.00007045041,0.0000023651892,0.000013808534,0.000004253408,0.001876345],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988908,0.00010643557,0.00020568393,0.0003848109,0.00018451446,0.00022772087],"domain_scores_gemma":[0.9991605,0.000090066926,0.000055690798,0.0005789317,0.0000655166,0.000049265105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026568925,0.00008490996,0.00011229459,0.000041290372,0.00008061342,0.00013804773,0.00052533974,0.000036144324,0.00007477648],"category_scores_gemma":[0.00008751312,0.0000850788,0.0000169316,0.0003082773,0.000015819152,0.0005355021,0.00040956604,0.00015719887,0.000030140502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000081273565,0.00004267033,0.005048423,0.000009558374,0.000016066291,0.00010791278,0.00015947671,0.5968333,0.00057413476,0.06668489,0.00071272533,0.32980272],"study_design_scores_gemma":[0.00038900055,0.000007672082,0.00075697905,0.000038926883,0.0000031168881,0.000012929328,0.00004964599,0.9865899,0.0001291117,0.000075592165,0.011839513,0.00010757623],"about_ca_topic_score_codex":0.00003940593,"about_ca_topic_score_gemma":0.00014743525,"teacher_disagreement_score":0.96803254,"about_ca_system_score_codex":0.0000404578,"about_ca_system_score_gemma":0.00012721185,"threshold_uncertainty_score":0.34694126},"labels":[],"label_agreement":null},{"id":"W3135062675","doi":"10.1145/3453953.3453968","title":"A Rent-Seeking Framework for Multipath TCP","year":2021,"lang":"en","type":"article","venue":"ACM SIGMETRICS Performance Evaluation Review","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Multipath TCP; Computer science; Mathematical optimization; Nash equilibrium; Multipath propagation; Function (biology); Utility maximization; Utility maximization problem; Mathematical economics; Computer network; Economics; Mathematics; Channel (broadcasting)","score_opus":0.08501074543276876,"score_gpt":0.3548096472219973,"score_spread":0.26979890178922855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3135062675","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015863715,0.15727547,0.8345309,0.003988486,0.001081026,0.0010984637,0.0000024153078,0.00013950781,0.00029733896],"genre_scores_gemma":[0.35419092,0.15843226,0.47487992,0.010276638,0.0005538025,0.001231038,0.00007069436,0.00003392864,0.00033081058],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99736625,0.0002266398,0.0005770419,0.00056304166,0.0009086089,0.00035842045],"domain_scores_gemma":[0.9956354,0.0012157022,0.00031519693,0.0013701209,0.0013500552,0.00011355259],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0034088385,0.00019636238,0.00038009926,0.0001672493,0.0002470729,0.00015220226,0.0010071781,0.00009841046,0.0001584734],"category_scores_gemma":[0.009183252,0.00018505797,0.0001817652,0.0028550876,0.000018815805,0.00052850187,0.00022783481,0.00022248524,0.00012149818],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022580434,0.000039285023,0.00035901973,0.00039060152,0.000020066254,0.0000010805505,0.000038386064,0.00040942698,0.000008047029,0.009397005,0.0025735195,0.98676133],"study_design_scores_gemma":[0.000755494,0.00009063353,0.001081344,0.0023612177,0.00015088922,0.000015046256,0.000007111552,0.91199934,0.00009194908,0.002699991,0.08041625,0.00033074198],"about_ca_topic_score_codex":4.3459534e-7,"about_ca_topic_score_gemma":6.077177e-7,"teacher_disagreement_score":0.9864306,"about_ca_system_score_codex":0.000110119465,"about_ca_system_score_gemma":0.00041706619,"threshold_uncertainty_score":0.9991628},"labels":[],"label_agreement":null},{"id":"W3143448757","doi":"","title":"Measuring and billing user Internet traffic.","year":2010,"lang":"en","type":"article","venue":"Next Generation Internet","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"The Internet; Internet traffic; Internet service provider; Computer science; Internet privacy; Computer security; Internet transit; Service provider; Control (management); Service (business); World Wide Web; Business","score_opus":0.052413735696601384,"score_gpt":0.223767372972798,"score_spread":0.17135363727619662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3143448757","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63586545,0.00012104702,0.36083996,0.00063156773,0.0016399707,0.00010050169,4.389049e-7,0.000186078,0.00061500986],"genre_scores_gemma":[0.98609537,0.000013773531,0.010660548,0.0005877089,0.00070723897,0.000024218089,0.0000046876276,0.000011369446,0.0018950643],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893826,0.000046517547,0.00023979432,0.0003958425,0.00018007976,0.00019949646],"domain_scores_gemma":[0.99939847,0.000045037403,0.00007014687,0.0002840238,0.00008975855,0.00011258204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002541108,0.00014418404,0.00012638813,0.00008445791,0.00006297005,0.00059387885,0.00039391252,0.000092205664,0.00010673876],"category_scores_gemma":[0.000030211359,0.00013145387,0.000042205407,0.00010465665,0.00004123177,0.0005530156,0.000100288395,0.00025414076,0.00008523337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001072585,0.000051249634,0.000505273,0.0000070455194,0.00004033546,0.000009883121,0.001376876,0.0025801836,0.039364934,0.11502972,0.016379854,0.8246439],"study_design_scores_gemma":[0.00031713015,0.000040017138,0.00012189768,0.000010662241,0.0000057301804,0.000031643147,0.000008795064,0.95717597,0.0042339973,0.000051330357,0.03783669,0.00016611391],"about_ca_topic_score_codex":0.000019008221,"about_ca_topic_score_gemma":0.00028772917,"teacher_disagreement_score":0.9545958,"about_ca_system_score_codex":0.000013464915,"about_ca_system_score_gemma":0.000030157666,"threshold_uncertainty_score":0.57267874},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.026084443534727154,"score_gpt":0.2182216668738476,"score_spread":0.19213722333912042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3151453676","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028321357,0.0020544638,0.99329877,0.00047798577,0.0005874378,0.00040430625,0.00014572094,0.00016309986,0.000036073696],"genre_scores_gemma":[0.9963325,0.0000802369,0.003125447,0.0000761319,0.00010440909,0.00007153331,0.000010406394,0.000010546753,0.00018876037],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822474,0.0002043602,0.0003742393,0.0004650694,0.0004108106,0.00032076208],"domain_scores_gemma":[0.9991242,0.00009616056,0.00011329995,0.0003003481,0.00021177858,0.00015417104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035723596,0.00023750059,0.00029119308,0.00010109907,0.0004331574,0.00031278405,0.00016274658,0.00011699211,0.0000043344867],"category_scores_gemma":[0.0000034942457,0.00021678723,0.0000664008,0.00028955648,0.00008247036,0.00032403672,0.0000031099048,0.00016917076,0.000007036303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088521694,0.00016322538,0.000021767059,0.00002763891,0.00008932776,0.00005961238,0.000074775286,0.97074187,0.00022927653,0.0017053339,0.0015768581,0.025221795],"study_design_scores_gemma":[0.0013961648,0.000103153485,0.00015421848,0.00007868052,0.000050040817,0.00016557518,0.00009334048,0.99575454,0.000051470575,0.00009052853,0.001779991,0.0002822676],"about_ca_topic_score_codex":0.00023018103,"about_ca_topic_score_gemma":0.00004656429,"teacher_disagreement_score":0.9935004,"about_ca_system_score_codex":0.000099189434,"about_ca_system_score_gemma":0.00009412121,"threshold_uncertainty_score":0.88403267},"labels":[],"label_agreement":null},{"id":"W3159355823","doi":"10.1109/hpcc-smartcity-dss50907.2020.00119","title":"A Parallel Data Stream Layer for Large Data Workloads on WANs","year":2020,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Layer (electronics); Computer network; Distributed computing","score_opus":0.12583131518312685,"score_gpt":0.3076350581102884,"score_spread":0.18180374292716156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3159355823","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007150138,0.00014548177,0.9647633,0.031219766,0.00020647747,0.00028991935,0.00022035486,0.0003227541,0.002760459],"genre_scores_gemma":[0.86375284,0.000042558506,0.11114818,0.022085307,0.00084704225,0.000034969868,0.00057475414,0.000019252839,0.0014950942],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843514,0.000034228415,0.00018001752,0.0008217156,0.00020178572,0.00032709443],"domain_scores_gemma":[0.9971265,0.00020378924,0.000045546854,0.0024193174,0.000033276312,0.00017153016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026983442,0.00013381706,0.00016123326,0.000017743483,0.00010434846,0.0001705883,0.0043482045,0.000049806316,0.000082462524],"category_scores_gemma":[0.000076121185,0.000107994376,0.000029726056,0.0001888034,0.000010722331,0.00057168555,0.0012947766,0.00011466877,0.00019301494],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004822291,0.00009971344,0.00007675204,0.000006107802,0.000040874573,0.0000073280407,0.000075706586,0.0004124488,0.000004512271,0.13704312,0.5184156,0.34376967],"study_design_scores_gemma":[0.00073383807,0.00007631505,0.000030926174,0.0000064179403,0.000008842332,6.6738517e-7,0.000014975917,0.6823496,0.000003172963,0.00014211668,0.31652576,0.00010734455],"about_ca_topic_score_codex":0.000004044098,"about_ca_topic_score_gemma":0.000043698717,"teacher_disagreement_score":0.8636813,"about_ca_system_score_codex":0.000006026353,"about_ca_system_score_gemma":0.00007792998,"threshold_uncertainty_score":0.8080118},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02451723703655837,"score_gpt":0.24494680995963347,"score_spread":0.2204295729230751,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3159989400","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003376612,0.15756646,0.7753445,0.064081736,0.0005385019,0.0017743395,0.0000040628147,0.0004685256,0.00018812109],"genre_scores_gemma":[0.6580371,0.11396937,0.19920817,0.02627974,0.00069928105,0.0012277572,0.00010278045,0.00005213036,0.0004236271],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969801,0.0008264522,0.00077473815,0.0006462361,0.00029597775,0.00047653046],"domain_scores_gemma":[0.9924486,0.0016781779,0.0004837314,0.0047080056,0.00050621614,0.00017523815],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012730941,0.00036952546,0.000713022,0.00008458524,0.0004515988,0.00024933773,0.004406806,0.00010748662,0.00006525332],"category_scores_gemma":[0.0002190874,0.00034212205,0.00023962776,0.0005436526,0.000095757525,0.00059616123,0.0006084339,0.00040070535,0.00012563575],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056657523,0.000117195246,0.000051230774,0.00014948484,0.00007040489,0.0000014692737,0.000033304303,0.0025814662,0.0000011293693,0.042930927,0.13508801,0.8189697],"study_design_scores_gemma":[0.0014778372,0.00013605425,0.0002600956,0.0010801338,0.000102109065,0.000038898073,6.205085e-7,0.7113427,0.0000018993657,0.0011300958,0.28400612,0.00042346306],"about_ca_topic_score_codex":0.000006938387,"about_ca_topic_score_gemma":0.0000057358952,"teacher_disagreement_score":0.81854624,"about_ca_system_score_codex":0.00006353584,"about_ca_system_score_gemma":0.000028639675,"threshold_uncertainty_score":0.9999031},"labels":[],"label_agreement":null},{"id":"W3161358203","doi":"10.1023/a:1014834100392","title":"Connection Admission Control for PCS-to-Internet Protocol Internetworking","year":2002,"lang":"en","type":"article","venue":"International Journal of Wireless Information Networks","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Computer network; Internetworking; UMTS frequency bands; Network packet; The Internet; Quality of service; Admission control; Scalability; Wireless network; Wireless; Distributed computing; Telecommunications; World Wide Web","score_opus":0.013302794239198504,"score_gpt":0.25473521976752667,"score_spread":0.24143242552832817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3161358203","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00050827704,0.00002453667,0.9858366,0.0027953913,0.0036966645,0.0062880227,0.0000033224046,0.000089591354,0.00075758883],"genre_scores_gemma":[0.9873605,0.000013179368,0.004868088,0.002924893,0.0017394949,0.0028963108,0.000005826784,0.000012496596,0.00017923287],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976411,0.00007928499,0.0011782473,0.00016054921,0.0006400442,0.0003007672],"domain_scores_gemma":[0.9969144,0.00029053164,0.0010661556,0.00019428685,0.0013009893,0.00023365102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007246505,0.00020812596,0.00029158048,0.00038589732,0.00008382564,0.0005612245,0.0013844987,0.00013199136,0.000105544044],"category_scores_gemma":[0.00013231524,0.00018309677,0.0002274962,0.0002397786,0.000024339004,0.0023168414,0.00010096975,0.000303581,0.000041801697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039464992,0.000066364955,0.00018823332,0.000008524166,0.0001450294,0.000007100872,0.00045027,0.12340967,0.0000072209646,0.01368756,0.036839463,0.8247959],"study_design_scores_gemma":[0.0030100357,0.00028295952,0.00007238347,0.00020080665,0.0000111842355,0.00012271666,0.000024465104,0.8188772,0.000041162122,0.00017428453,0.17701954,0.00016322234],"about_ca_topic_score_codex":0.0000027258875,"about_ca_topic_score_gemma":0.0000024339924,"teacher_disagreement_score":0.9868522,"about_ca_system_score_codex":0.00017949505,"about_ca_system_score_gemma":0.000041528656,"threshold_uncertainty_score":0.74664694},"labels":[],"label_agreement":null},{"id":"W3163791259","doi":"10.1145/1030194.1015474","title":"Locating internet bottlenecks","year":2004,"lang":"en","type":"article","venue":"ACM SIGCOMM Computer Communication Review","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Bottleneck; Computer science; Computer network; Multihoming; The Internet; Network packet; Emulation; Distributed computing; Routing (electronic design automation); Internet topology; Internet Protocol; World Wide Web; Network topology; Embedded system","score_opus":0.02036760506841637,"score_gpt":0.2599633410511306,"score_spread":0.23959573598271425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3163791259","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016434483,0.1062039,0.85731256,0.033849996,0.00024828422,0.0004297321,4.876814e-7,0.0005011317,0.0012895463],"genre_scores_gemma":[0.43894124,0.032312457,0.5021098,0.02616059,0.00014642582,0.00014090516,0.000029798079,0.000026057734,0.000132664],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99803704,0.00036633768,0.0006238875,0.00040268103,0.00027057115,0.000299511],"domain_scores_gemma":[0.9947703,0.0003812421,0.00029560164,0.0042168214,0.0002000996,0.0001359229],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00075777445,0.00024192719,0.00040031876,0.00006698547,0.00018401253,0.00019863686,0.0058678454,0.00006592187,0.00003617422],"category_scores_gemma":[0.00010372744,0.00022698246,0.00020234846,0.0005262991,0.00006957109,0.0005010265,0.0019842812,0.00037293677,0.00042195016],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.0220766e-7,0.00007446627,0.000036707366,0.00014930648,0.000030779458,0.0000029174153,0.00015630964,0.0005151151,0.000001919557,0.10921358,0.007968502,0.88184947],"study_design_scores_gemma":[0.0030839797,0.00034934483,0.0010646578,0.015370221,0.00016769076,0.00030665888,0.00001636308,0.1817513,0.000088548004,0.029418185,0.76662046,0.0017626073],"about_ca_topic_score_codex":0.000035517587,"about_ca_topic_score_gemma":0.000013256804,"teacher_disagreement_score":0.8800869,"about_ca_system_score_codex":0.000087616674,"about_ca_system_score_gemma":0.00009441526,"threshold_uncertainty_score":0.9995109},"labels":[],"label_agreement":null},{"id":"W3168707590","doi":"10.1145/345063.339342","title":"On achievable service differentiation with token bucket marking for TCP","year":2000,"lang":"en","type":"article","venue":"ACM SIGMETRICS Performance Evaluation Review","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Concordia University","keywords":"Token bucket; Computer network; Leaky bucket; Computer science; Service (business); Network packet; Scalability; Differentiated services; Differentiated service; Set (abstract data type); Service provider; Operating system","score_opus":0.03753820493755486,"score_gpt":0.2830861536880323,"score_spread":0.24554794875047745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3168707590","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39214286,0.07829815,0.47914246,0.0230951,0.0015531577,0.01290305,0.000020185638,0.000974108,0.0118709095],"genre_scores_gemma":[0.92651886,0.043041468,0.015138147,0.012692895,0.0002554076,0.0013157161,0.00013657035,0.000038717564,0.00086224225],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997655,0.0001659395,0.00042455684,0.0004697473,0.0009638102,0.00032094977],"domain_scores_gemma":[0.99756384,0.00053777045,0.00023316189,0.00095072156,0.0006271212,0.00008738386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022390983,0.000219703,0.00032221706,0.00019291152,0.00027107168,0.00013790192,0.00092628703,0.00006258012,0.0005638787],"category_scores_gemma":[0.00037042118,0.00017343182,0.000073532974,0.0022112255,0.000011458095,0.0006645943,0.000051916166,0.00015107315,0.00023644272],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031216987,0.00004803518,0.00018086235,0.00032365628,0.000021667885,1.628337e-7,0.000027066239,0.004882781,0.0000020768287,0.0010289258,0.0027555837,0.990698],"study_design_scores_gemma":[0.0015148092,0.0004124686,0.0036853736,0.001475703,0.00017180733,0.000005931192,0.0000019069066,0.95048046,0.00003186729,0.00038616662,0.041495968,0.00033756072],"about_ca_topic_score_codex":0.00000205948,"about_ca_topic_score_gemma":0.0000034705959,"teacher_disagreement_score":0.9903604,"about_ca_system_score_codex":0.00010836563,"about_ca_system_score_gemma":0.00014364404,"threshold_uncertainty_score":0.70723444},"labels":[],"label_agreement":null},{"id":"W3180564489","doi":"10.5539/nct.v6n1p28","title":"The Performance and Future of QUIC Protocol in the Modern Internet","year":2021,"lang":"en","type":"article","venue":"Network and Communication Technologies","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer network; Computer science; Latency (audio); The Internet; Internet Protocol; World Wide Web; Telecommunications","score_opus":0.008990427047952845,"score_gpt":0.22898812913628525,"score_spread":0.21999770208833241,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3180564489","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22985125,0.19959061,0.10342018,0.3857765,0.0006414773,0.059519686,0.0000026305293,0.0029125337,0.018285137],"genre_scores_gemma":[0.98655736,0.005765257,0.002354825,0.00012088805,0.000019259189,0.0051193316,5.5874744e-7,0.0000021661488,0.000060367813],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993938,0.00012620445,0.00016162595,0.00011774423,0.0000829111,0.00011771335],"domain_scores_gemma":[0.99881625,0.0002291429,0.000082061364,0.00081898464,0.000047308284,0.000006227414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038766747,0.000065586486,0.00008644452,0.000016332997,0.00017683973,0.00009806865,0.0010057928,0.00006539111,4.4235927e-7],"category_scores_gemma":[0.000012388487,0.000037613765,0.000011660574,0.00028969135,0.00019452868,0.00010701072,0.0004607256,0.00022973667,3.4337654e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040805057,0.000010002808,0.0009486737,0.0000054912207,0.0000037804732,2.912368e-7,0.0002889979,0.000075743505,0.0000019053057,0.12978026,0.000612044,0.8682687],"study_design_scores_gemma":[0.00082247914,0.00016597004,0.009282523,0.00014852846,0.000008186741,0.00004724217,0.0023868755,0.583595,0.00017285149,0.092481785,0.31067818,0.00021037999],"about_ca_topic_score_codex":0.0000023241723,"about_ca_topic_score_gemma":0.0000500758,"teacher_disagreement_score":0.8680583,"about_ca_system_score_codex":0.000004754006,"about_ca_system_score_gemma":0.00002030039,"threshold_uncertainty_score":0.186903},"labels":[],"label_agreement":null},{"id":"W3198736075","doi":"10.1109/lcn52139.2021.9524966","title":"Low-Variance Latency Through Forward Error Correction on Wide-Area Networks","year":2021,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Latency (audio); Error detection and correction; Throughput; Real-time computing; Parallel computing; Computer network; Distributed computing; Algorithm; Wireless; Telecommunications","score_opus":0.013851884857882356,"score_gpt":0.22774276989526257,"score_spread":0.2138908850373802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198736075","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00087462773,0.00019980733,0.96103394,0.004444127,0.004524815,0.00012228111,4.2972363e-7,0.0004319823,0.02836798],"genre_scores_gemma":[0.9710994,0.000095132054,0.008205238,0.006234448,0.00022428334,0.000029927518,0.0000063919833,0.0000126227105,0.014092581],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853814,0.0000857863,0.00024216087,0.0005364886,0.00023882816,0.00035859464],"domain_scores_gemma":[0.9988482,0.00025543044,0.000076816104,0.00058206386,0.00014627742,0.00009119234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013754865,0.00017382868,0.00019730683,0.000024476985,0.00018007847,0.00017194613,0.00039355655,0.00011125855,0.00021481483],"category_scores_gemma":[0.000059206453,0.00015557784,0.00010606318,0.0005240738,0.00002605105,0.0004423016,0.00009618109,0.00023764816,0.0001814063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003906297,0.00024286038,0.0005741835,0.0000065136787,0.00006034296,0.0001381202,0.00022932778,0.18123826,0.00002412436,0.15832488,0.12064582,0.5384765],"study_design_scores_gemma":[0.00047166785,0.00009370416,0.00080297864,0.000056609944,0.0000094632605,0.000029718893,0.000025772313,0.97380024,0.00026155228,0.0017242754,0.022489294,0.0002347228],"about_ca_topic_score_codex":0.000012629286,"about_ca_topic_score_gemma":0.000062391686,"teacher_disagreement_score":0.97022474,"about_ca_system_score_codex":0.000044754226,"about_ca_system_score_gemma":0.00009048249,"threshold_uncertainty_score":0.634428},"labels":[],"label_agreement":null},{"id":"W3205923723","doi":"10.1109/tnet.2021.3118006","title":"Bound Inference and Reinforcement Learning-Based Path Construction in Bandwidth Tomography","year":2021,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Research Grants Council, University Grants Committee","keywords":"Bandwidth (computing); Computer science; Inference; Artificial intelligence; Path (computing); Inverse; Algorithm; Mathematics; Computer network","score_opus":0.012964939210906998,"score_gpt":0.2284827704830011,"score_spread":0.21551783127209412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205923723","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014371254,0.0004114298,0.9826254,0.0006175236,0.0012850076,0.00015782546,6.7334946e-7,0.00019681634,0.00033406142],"genre_scores_gemma":[0.99101585,0.00026262164,0.0080272835,0.00041938873,0.00012304613,0.000047646427,0.0000035515848,0.000011583936,0.00008902442],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983604,0.00016729307,0.00033134967,0.0005009577,0.00026515115,0.0003748799],"domain_scores_gemma":[0.998883,0.0003716984,0.00009820396,0.00044385938,0.00008707431,0.00011613626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025638912,0.00020323855,0.0002228698,0.00020562096,0.0003455342,0.0002539265,0.00026429456,0.000108611624,0.00003111058],"category_scores_gemma":[0.00001269727,0.00022151436,0.000090839036,0.000928782,0.0000849568,0.00025204598,0.000009534995,0.00048548324,0.000005613037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021485368,0.000043185206,0.0014419843,0.000009045365,0.000020696654,0.00002662528,0.000116617884,0.5556775,0.00003537748,0.00074269,0.000014745133,0.44185007],"study_design_scores_gemma":[0.0014739431,0.0001699886,0.00087168626,0.0002770486,0.000025674684,0.00003136245,0.00006229609,0.99075216,0.0004125561,0.001208708,0.004357457,0.00035714734],"about_ca_topic_score_codex":0.000017637263,"about_ca_topic_score_gemma":0.00013213554,"teacher_disagreement_score":0.9766446,"about_ca_system_score_codex":0.00005711329,"about_ca_system_score_gemma":0.0001534693,"threshold_uncertainty_score":0.90330935},"labels":[],"label_agreement":null},{"id":"W3211675861","doi":"10.32920/ryerson.14656449.v1","title":"Improving BGP Convergence And Reachability Through Stable Path Aggregation (SPAGG)","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Default-free zone; Computer science; Border Gateway Protocol; Convergence (economics); Scalability; Reachability; Routing protocol; Computer network; Path (computing); The Internet; Routing (electronic design automation); Distributed computing; Network mapping; Stability (learning theory); Theoretical computer science; Static routing","score_opus":0.01383918952924063,"score_gpt":0.22543872011696636,"score_spread":0.21159953058772574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211675861","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030725574,0.002702547,0.96118623,0.00075827807,0.0015020851,0.00035681247,0.000004021456,0.00046071963,0.0023037184],"genre_scores_gemma":[0.9122999,0.000691251,0.08586432,0.00035264323,0.00013836904,0.0000640653,0.000016986927,0.000012005966,0.0005604956],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998004,0.00013924352,0.00035178682,0.0009218183,0.00028057265,0.00030254186],"domain_scores_gemma":[0.9984198,0.00013155634,0.00016200863,0.0009720717,0.0002108856,0.000103657934],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004368028,0.00026523686,0.00033554912,0.000028996035,0.00012302618,0.0004996175,0.00057614275,0.00023225286,0.000055152468],"category_scores_gemma":[0.00005620774,0.00025540567,0.000083475024,0.00015806501,0.0000727449,0.0005466409,0.0010520894,0.00044271623,0.0000064925257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004910456,0.000055271365,0.000780279,0.00023422918,0.000047323592,0.000018934423,0.00095494534,0.0020750924,0.00013125889,0.03422388,0.0007608126,0.9607131],"study_design_scores_gemma":[0.00026219268,0.000031076543,0.0005951997,0.00012364853,0.000022108596,0.000010429701,0.00010382482,0.989537,0.00041089335,0.007421003,0.0010540335,0.0004286017],"about_ca_topic_score_codex":0.0005229357,"about_ca_topic_score_gemma":0.00009913588,"teacher_disagreement_score":0.9874619,"about_ca_system_score_codex":0.000073668205,"about_ca_system_score_gemma":0.0003030555,"threshold_uncertainty_score":0.9999898},"labels":[],"label_agreement":null},{"id":"W33262381","doi":"10.1038/s41598-020-77823-3","title":"Incorporating deadline scheduling into DCCP","year":2013,"lang":"en","type":"dissertation","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McGill University","keywords":"Network packet; Computer science; Scheduling (production processes); Computer network; Round-robin scheduling; Distributed computing; Dynamic priority scheduling; Quality of service; Engineering","score_opus":0.0082109776127523,"score_gpt":0.23823968248376837,"score_spread":0.23002870487101607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W33262381","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029671568,0.0010948827,0.9349139,0.0007415125,0.0028102866,0.00046208862,3.9246524e-7,0.00092866016,0.029376745],"genre_scores_gemma":[0.6932832,0.000027856928,0.27676237,0.00058127486,0.00067455566,0.00011550392,0.00018169201,0.000035233305,0.028338308],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984354,0.000048994,0.00041740213,0.0005256749,0.0003135526,0.0002589819],"domain_scores_gemma":[0.9987145,0.000103638515,0.00028635957,0.00048453666,0.00028402644,0.00012692006],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021311376,0.000277909,0.00029852623,0.00013748494,0.00018366588,0.00037391958,0.0009201593,0.00026638628,0.00011986319],"category_scores_gemma":[0.000049796803,0.0002489575,0.0001001239,0.0003121651,0.000013540102,0.0004296217,0.00006584111,0.00038734628,0.000623333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004573693,0.000023145582,0.000028229975,0.000040885716,0.000032203297,0.0000071413806,0.00034497344,0.000879912,0.00023649086,0.17123595,0.0012857226,0.82588077],"study_design_scores_gemma":[0.00037733698,0.00005612853,0.00014688139,0.00018159498,0.00002452398,0.0000045245524,0.00030287183,0.98446286,0.00043219197,0.011472545,0.0019317865,0.0006067365],"about_ca_topic_score_codex":0.00007753769,"about_ca_topic_score_gemma":0.00020447957,"teacher_disagreement_score":0.983583,"about_ca_system_score_codex":0.000038519185,"about_ca_system_score_gemma":0.00023802205,"threshold_uncertainty_score":0.99999624},"labels":[],"label_agreement":null},{"id":"W38056905","doi":"10.1021/acsami.3c10586","title":"A GoP based FEC technique for packet based video streaming","year":2006,"lang":"en","type":"article","venue":"International Conference on Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Shanghai Jiao Tong University; National Natural Science Foundation of China","keywords":"Computer science; Forward error correction; Network packet; Frame (networking); Lossy compression; Group of pictures; Real-time computing; Data compression; Transmission (telecommunications); Computer network; Algorithm; Decoding methods; Telecommunications; Artificial intelligence","score_opus":0.04927993869160498,"score_gpt":0.30945081571038696,"score_spread":0.260170877018782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W38056905","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019227808,0.000032291748,0.9420623,0.029190015,0.00019358408,0.00049260684,0.00005713471,0.00024175445,0.02753804],"genre_scores_gemma":[0.87291265,0.000008167481,0.124576576,0.000981633,0.000072168936,0.0008830647,0.0001580545,0.000010762267,0.00039695384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878734,0.00011832338,0.0003148735,0.00031002823,0.00026813688,0.00020132413],"domain_scores_gemma":[0.99716717,0.0007507911,0.0001660731,0.0013893032,0.00046909682,0.00005754196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031930773,0.00015972812,0.00013989185,0.00018062828,0.00026183468,0.00025662594,0.0027460733,0.00007736664,0.00006955249],"category_scores_gemma":[0.00007353935,0.00016388267,0.000112201094,0.00019534926,0.00009597545,0.00021524564,0.00014908086,0.00019616426,0.00003188231],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018775216,0.00024293749,0.00016354285,0.0000033359343,0.000014815455,9.239307e-7,0.0000122978745,0.0010324422,0.0012776406,0.95052785,0.0022056818,0.04449978],"study_design_scores_gemma":[0.0007309705,0.00007701433,0.00054541754,0.00009154853,0.000008198301,0.0000019430322,0.000010307589,0.9517418,0.0010854994,0.015951606,0.029553259,0.00020240988],"about_ca_topic_score_codex":0.00008084213,"about_ca_topic_score_gemma":0.00023490303,"teacher_disagreement_score":0.9507094,"about_ca_system_score_codex":0.000100246674,"about_ca_system_score_gemma":0.0002754459,"threshold_uncertainty_score":0.66829413},"labels":[],"label_agreement":null},{"id":"W38755654","doi":"10.1007/0-387-25551-6_8","title":"Advanced Methods for the Estimation of the Origin Destination Traffic Matrix","year":2006,"lang":"en","type":"book-chapter","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université de Montréal; Group for Research in Decision Analysis; Institut National de la Recherche Scientifique","funders":"","keywords":"Computer science; Router; Node (physics); Matrix (chemical analysis); Simple Network Management Protocol; Traffic generation model; Link (geometry); Data mining; Transit (satellite); Computer network; Simple (philosophy); Protocol (science); Network management; Algorithm; Engineering; Transport engineering; Public transport","score_opus":0.0186603324361528,"score_gpt":0.31128006149348414,"score_spread":0.29261972905733136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W38755654","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000050240064,0.00081546936,0.9662959,0.0014216425,0.00072720204,0.0009448187,0.0000039604056,0.00013058208,0.029655421],"genre_scores_gemma":[0.012084188,0.000036663376,0.60888016,0.00016892998,0.00017790872,0.00011448401,0.000010404203,0.000029792865,0.37849745],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988832,0.000053241456,0.00038279063,0.00029815623,0.00022854746,0.00015406267],"domain_scores_gemma":[0.99748045,0.0012931704,0.00039088295,0.0006139292,0.00019789134,0.00002370324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005926096,0.00021020231,0.00023556982,0.00005689919,0.00017476201,0.0000640432,0.00091710145,0.00014377649,0.000019973684],"category_scores_gemma":[0.000053989523,0.00011729665,0.0002204273,0.00008466681,0.00007741909,0.00013133699,0.00006757024,0.0001673222,0.0000066827974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031943068,0.0000033908989,5.895268e-8,0.000007470689,0.0000106700545,4.8467186e-8,0.0000085880765,0.13210593,0.000002547441,0.3558708,0.0011077686,0.5108795],"study_design_scores_gemma":[0.00028825065,0.000034071953,0.000010945822,0.0000485341,0.0000643437,0.0000038402736,0.0000011680609,0.88711745,0.000030583997,0.01750588,0.09476134,0.00013360979],"about_ca_topic_score_codex":0.0000028702016,"about_ca_topic_score_gemma":0.000009966547,"teacher_disagreement_score":0.7550115,"about_ca_system_score_codex":0.00004849952,"about_ca_system_score_gemma":0.00012875881,"threshold_uncertainty_score":0.47832188},"labels":[],"label_agreement":null},{"id":"W39121104","doi":"10.1371/journal.pone.0308571","title":"Forward Explicit Congestion Notification (FECN) for Datacenter Ethernet Networks","year":2007,"lang":"en","type":"article","venue":"PLoS ONE","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer network; Computer science; Ethernet; Network congestion; Computer security; Network packet","score_opus":0.04561736478124628,"score_gpt":0.23840706911093254,"score_spread":0.19278970432968626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W39121104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016420515,0.00020685274,0.980219,0.0014576119,0.00023942496,0.00077480543,0.0000055020355,0.00027851757,0.00039775463],"genre_scores_gemma":[0.96260995,0.000041059076,0.034822013,0.000825748,0.0005891195,0.00019315068,0.000065154214,0.000017806111,0.0008360089],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864584,0.0000359093,0.00028236225,0.00040079327,0.00026278745,0.0003723347],"domain_scores_gemma":[0.9987215,0.0003124785,0.00012598664,0.00053507957,0.00018490889,0.00012007934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069578295,0.00013770418,0.00018445755,0.00006429133,0.000115333336,0.00011737314,0.00051454967,0.000110637826,0.000016058013],"category_scores_gemma":[0.000057509733,0.0001365812,0.00005532769,0.00019283217,0.000022037508,0.00036658082,0.0000620165,0.00013657653,0.00006195606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027024827,0.0016081278,0.0022299646,0.0000652705,0.00033357623,0.000005776874,0.0003694292,0.002916718,0.0033947031,0.14042094,0.007138516,0.8412467],"study_design_scores_gemma":[0.0011322121,0.00016704708,0.0018091244,0.00009623409,0.00007711948,0.000001956807,0.000019397974,0.98631394,0.0019359278,0.0005955884,0.0075635947,0.00028785053],"about_ca_topic_score_codex":0.0000044804283,"about_ca_topic_score_gemma":0.000029652627,"teacher_disagreement_score":0.98339725,"about_ca_system_score_codex":0.000050923136,"about_ca_system_score_gemma":0.000023933273,"threshold_uncertainty_score":0.556962},"labels":[],"label_agreement":null},{"id":"W4212997113","doi":"10.1109/icnp52444.2021.9651972","title":"HLS: A Packet Scheduler for Hierarchical Fairness","year":2021,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Linux kernel; Scheduling (production processes); Network packet; Computer network; Network scheduler; Overhead (engineering); Distributed computing; Bandwidth (computing); Temporal isolation among virtual machines; Embedded system; Operating system; Transmission delay; Processing delay","score_opus":0.014932028738902772,"score_gpt":0.24525048843037608,"score_spread":0.2303184596914733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4212997113","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025908793,0.00014623479,0.9803475,0.010955231,0.00039904026,0.00010693724,0.0000012862436,0.00020910868,0.0052437712],"genre_scores_gemma":[0.8453756,0.000008198016,0.14540769,0.0028184415,0.00025309884,0.00007178519,0.0000046952955,0.0000071329237,0.006053382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991512,0.000043122443,0.00012816294,0.0003121681,0.00013200185,0.00023335464],"domain_scores_gemma":[0.999206,0.00020064611,0.000019767287,0.00034019127,0.00013398803,0.00009942759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014464188,0.000080956364,0.000118822376,0.000022442993,0.00008286032,0.00013848192,0.0003294312,0.000049858176,0.00009955922],"category_scores_gemma":[0.000052535674,0.00006872244,0.0000820039,0.00019867707,0.000023852697,0.00015902045,0.0000964263,0.00008172109,0.000061758765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004200538,0.000033715183,0.000039365492,0.0000034815093,0.000011512671,0.000009265918,0.000033116172,0.000050885355,0.000044187193,0.6340106,0.005167344,0.36059228],"study_design_scores_gemma":[0.0016272145,0.000078759454,0.0005317845,0.000019444837,0.000012248596,0.000048127848,0.000049993054,0.7837108,0.0010692547,0.04281207,0.1697141,0.0003262441],"about_ca_topic_score_codex":7.8820506e-7,"about_ca_topic_score_gemma":0.00000967548,"teacher_disagreement_score":0.8427847,"about_ca_system_score_codex":0.000009914551,"about_ca_system_score_gemma":0.00013771061,"threshold_uncertainty_score":0.28024197},"labels":[],"label_agreement":null},{"id":"W4214698899","doi":"10.3390/s22051818","title":"CCAIB: Congestion Control Based on Adaptive Integral Backstepping for Wireless Multi-Router Network","year":2022,"lang":"en","type":"article","venue":"Sensors","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada; Major Scientific and Technological Innovation Project of Shandong Province; Texas Space Grant Consortium","keywords":"Computer network; Computer science; Active queue management; Network congestion; Wireless network; Packet loss; Router; Network packet; Bottleneck; Wireless; Distributed computing; Telecommunications; Embedded system","score_opus":0.019103426273181203,"score_gpt":0.22916080234603786,"score_spread":0.21005737607285666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214698899","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015629975,0.00006272839,0.97847915,0.0025991856,0.0015789353,0.0009903233,0.000031224223,0.0003722235,0.00025623737],"genre_scores_gemma":[0.9834291,0.0000013355495,0.012086844,0.0033092042,0.00036578058,0.00033598478,0.000013248787,0.000026104926,0.0004324412],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978957,0.00036852527,0.00029775166,0.00056954595,0.00033832292,0.0005301597],"domain_scores_gemma":[0.9984151,0.0007358376,0.00016626096,0.00042905705,0.0001309678,0.00012273797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058509025,0.00024033869,0.00030206767,0.00009699374,0.0005239532,0.00009173304,0.000549053,0.00006765671,0.000031107316],"category_scores_gemma":[0.00003601512,0.00023552719,0.00018261916,0.00032129316,0.00005212522,0.00011342084,0.0000757965,0.00035278915,0.000023772202],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034779427,0.00009192452,0.00016785979,0.000003912949,0.00004015474,0.00001619812,0.00014655129,0.85827607,0.000012188719,0.020648137,0.0019355596,0.11831363],"study_design_scores_gemma":[0.0035916439,0.00049103954,0.0005059389,0.000030234036,0.000022816366,0.0000063150333,0.00008480225,0.9885343,0.0000071951395,0.00021303493,0.0062324223,0.00028026153],"about_ca_topic_score_codex":0.000013501646,"about_ca_topic_score_gemma":0.00001891262,"teacher_disagreement_score":0.96779907,"about_ca_system_score_codex":0.0001484102,"about_ca_system_score_gemma":0.000097303135,"threshold_uncertainty_score":0.96045196},"labels":[],"label_agreement":null},{"id":"W4220812597","doi":"10.23919/icact53585.2022.9728923","title":"TCP Congestion Avoidance in Data Centres using Reinforcement Learning","year":2022,"lang":"en","type":"article","venue":"2022 24th International Conference on Advanced Communication Technology (ICACT)","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"TCP tuning; Computer science; Computer network; Zeta-TCP; TCP Friendly Rate Control; Reinforcement learning; TCP acceleration; Network congestion; Throughput; The Internet; Transmission Control Protocol; TCP Westwood plus; H-TCP; TCP global synchronization; Artificial intelligence; Network packet; Telecommunications; Wireless; World Wide Web","score_opus":0.052423920857530726,"score_gpt":0.31236171560494613,"score_spread":0.2599377947474154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220812597","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11778402,0.003042141,0.7172487,0.12235259,0.0032315971,0.0024245658,0.00009289254,0.0030186996,0.03080483],"genre_scores_gemma":[0.98875505,0.0005994406,0.00888548,0.00058224046,0.000019055115,0.00020015593,0.0001976561,0.000014924221,0.00074598077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975369,0.0003452574,0.00054376514,0.00067682826,0.00056310056,0.0003341533],"domain_scores_gemma":[0.9970398,0.00018657635,0.00046398278,0.002043537,0.0002137846,0.000052308475],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0006223922,0.00021439765,0.00024100888,0.0005938006,0.0005228251,0.00010320461,0.0056813047,0.00009289164,0.00037444948],"category_scores_gemma":[0.00024267557,0.00025505837,0.000038677543,0.000829528,0.00013762357,0.00067624054,0.0029814409,0.0013173252,0.000029961515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076051736,0.00013711225,0.00080523075,0.0000025358006,0.000032459964,0.000010030629,0.000111086076,0.17902537,0.0012391858,0.5967046,0.00014076734,0.22171557],"study_design_scores_gemma":[0.0011363877,0.00011737256,0.00023511451,0.00006208121,0.000005635537,0.000023743725,0.00061072863,0.95380837,0.00016538617,0.007780227,0.03578323,0.00027170472],"about_ca_topic_score_codex":0.000025140545,"about_ca_topic_score_gemma":0.000053795215,"teacher_disagreement_score":0.870971,"about_ca_system_score_codex":0.000465278,"about_ca_system_score_gemma":0.00019559644,"threshold_uncertainty_score":0.99999017},"labels":[],"label_agreement":null},{"id":"W4226021634","doi":"10.1007/978-3-030-98785-5_25","title":"Zoom Session Quality: A Network-Level View","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Zoom; Computer science; Session (web analytics); Videoconferencing; Multimedia; Scale (ratio); Quality (philosophy); World Wide Web; Engineering","score_opus":0.035524688644608504,"score_gpt":0.2709814551200631,"score_spread":0.2354567664754546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226021634","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014866979,0.0021281743,0.98398316,0.0024046167,0.0055849887,0.00049033493,0.000008106539,0.00034610438,0.005039673],"genre_scores_gemma":[0.16655914,0.00084673805,0.79498947,0.024798777,0.005466353,0.0001601458,0.000049170827,0.00018854614,0.006941656],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994342,0.00017297256,0.00083097356,0.0020025705,0.0016455929,0.0010058527],"domain_scores_gemma":[0.9962439,0.0009374871,0.0004811303,0.0018580358,0.00020987976,0.00026958817],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022390338,0.00065561297,0.0008262093,0.00045096767,0.00068556913,0.0005786399,0.0045326035,0.00030634092,0.00027845273],"category_scores_gemma":[0.00006631056,0.000607646,0.00024061526,0.0010123894,0.00043442895,0.00065383856,0.0025332319,0.0014382043,0.00007935598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065417607,0.000018880079,0.000019162864,0.000017655895,0.000011346911,0.000067240944,0.00013450354,0.07943942,0.0000040182554,0.12126957,0.00020982209,0.79880184],"study_design_scores_gemma":[0.0005938607,0.00022605028,0.0001320851,0.0004961896,0.000017933231,0.00009875622,1.5550587e-7,0.72825885,0.000011819801,0.14210126,0.12682052,0.0012425063],"about_ca_topic_score_codex":0.000030729163,"about_ca_topic_score_gemma":0.000101420635,"teacher_disagreement_score":0.7975593,"about_ca_system_score_codex":0.00039260025,"about_ca_system_score_gemma":0.0009625321,"threshold_uncertainty_score":0.9996375},"labels":[],"label_agreement":null},{"id":"W4226248605","doi":"10.1007/978-3-030-98785-5_26","title":"Zoomiversity: A Case Study of Pandemic Effects on Post-secondary Teaching and Learning","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Pandemic; Campus network; Coronavirus disease 2019 (COVID-19); Zoom; Work (physics); Computer science; Transport engineering; Geography; Computer security; Engineering; Medicine","score_opus":0.009241002347274995,"score_gpt":0.22364390470501463,"score_spread":0.21440290235773965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226248605","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19406477,0.00041594237,0.8021964,0.00020062632,0.0010909783,0.0007602605,0.0000021150415,0.0001877296,0.0010812088],"genre_scores_gemma":[0.98680043,0.000010255765,0.012191178,0.0006982103,0.00014278808,0.000007931745,0.0000011480927,0.000017086324,0.00013099327],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99716306,0.00030579208,0.00032952195,0.0011646143,0.0006714002,0.00036560372],"domain_scores_gemma":[0.99664783,0.0022275029,0.00027700435,0.0006348749,0.00008870525,0.0001241076],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0015155299,0.00036494393,0.00050886563,0.00066117395,0.00083247357,0.00018176835,0.0012172738,0.00013086449,0.000015170799],"category_scores_gemma":[0.0001190392,0.00035144918,0.0000749814,0.00024033559,0.00019556783,0.0003375484,0.0013709116,0.0026513455,0.0000027160431],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014893896,0.000053316566,0.0002578114,0.000027773858,0.000021809825,0.0020618408,0.0042645736,0.020906461,0.00001585296,0.0019858691,0.0000023537893,0.97038746],"study_design_scores_gemma":[0.003676263,0.008374783,0.00055880955,0.0005368055,0.00009070111,0.004262602,0.000052746487,0.973924,0.000024707973,0.0049317344,0.0020810172,0.0014858514],"about_ca_topic_score_codex":0.00021630981,"about_ca_topic_score_gemma":0.00015051143,"teacher_disagreement_score":0.9689016,"about_ca_system_score_codex":0.00015001834,"about_ca_system_score_gemma":0.00027503312,"threshold_uncertainty_score":0.9998937},"labels":[],"label_agreement":null},{"id":"W4230063436","doi":"10.1145/948229.948231","title":"On the number of distributed measurement points for network tomography","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of New Brunswick","funders":"","keywords":"Beacon; Computer science; Computer network; IP forwarding; Network tomography; The Internet; Latency (audio); Internet topology; Routing protocol; Distributed computing; Routing (electronic design automation); Routing table; Set (abstract data type); Static routing; Network topology; Topology (electrical circuits); Mathematics; Telecommunications; World Wide Web","score_opus":0.01995927565009897,"score_gpt":0.2246201648856769,"score_spread":0.20466088923557793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230063436","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015691583,0.00005365107,0.9885158,0.0020123187,0.0003130077,0.00028470755,0.000002292226,0.00006222856,0.0071868547],"genre_scores_gemma":[0.9906565,0.000002123446,0.008233955,0.00094050856,0.000037185604,0.000052100746,8.3145403e-7,0.000003536728,0.00007324277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912256,0.00008593825,0.00015938867,0.0001653767,0.00026202996,0.00020468138],"domain_scores_gemma":[0.9991132,0.00028245006,0.000060337657,0.00033630925,0.00016554355,0.00004214733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007592973,0.0000820195,0.00010294027,0.000011071116,0.000093794166,0.000032618555,0.00032879546,0.00002697137,0.0000684424],"category_scores_gemma":[0.00007725542,0.000049998678,0.0001030508,0.00029478132,0.000025119893,0.000043495795,0.000016177408,0.0000481364,0.000014831585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000841641,0.00003822665,0.00035353948,0.0000015839281,0.0000284967,1.7107148e-7,0.000009414765,0.000565711,0.0000028134355,0.9539423,0.031710465,0.013338868],"study_design_scores_gemma":[0.004476287,0.00050087576,0.006119763,0.00017916587,0.00008876232,0.000015198497,0.000070335234,0.19379288,0.001951827,0.602595,0.18930483,0.00090508163],"about_ca_topic_score_codex":0.0000012571445,"about_ca_topic_score_gemma":0.000003927972,"teacher_disagreement_score":0.98908734,"about_ca_system_score_codex":0.000012081342,"about_ca_system_score_gemma":0.000032523723,"threshold_uncertainty_score":0.2038887},"labels":[],"label_agreement":null},{"id":"W4230368799","doi":"10.32920/ryerson.14651493","title":"Policy Disputes In BGP: Analysis, Detection And Proposed Solution","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Border Gateway Protocol; Default-free zone; Computer science; Routing protocol; Routing (electronic design automation); Computer network; Network mapping; Distance-vector routing protocol; The Internet; Distributed computing; Autonomous system (mathematics); Path vector protocol; Protocol (science); Static routing; Artificial intelligence","score_opus":0.008206067280736388,"score_gpt":0.2344970049512897,"score_spread":0.2262909376705533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230368799","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036366966,0.00043449955,0.959864,0.0022043833,0.00025758543,0.00022186198,7.844212e-7,0.00017605525,0.00047382416],"genre_scores_gemma":[0.9898292,0.00016333698,0.009461022,0.00017349125,0.0001454408,0.00002034966,0.00001155827,0.0000049699656,0.0001906556],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985353,0.00012380235,0.00027155378,0.0006524871,0.00019014139,0.00022672093],"domain_scores_gemma":[0.99918854,0.00005744947,0.00010641707,0.00048744938,0.00008141435,0.00007871726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026600208,0.00017682422,0.0003195798,0.00050949934,0.000062942294,0.0003756649,0.0003340723,0.00019360866,0.000007301559],"category_scores_gemma":[0.000038996037,0.00016545894,0.00012014625,0.0010995743,0.000032277207,0.00018061565,0.0006172192,0.00032632527,0.0000023876066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071470145,0.00006942124,0.0016430384,0.000034757355,0.00024800096,0.000015370659,0.00033270463,0.0126841925,0.00025855954,0.014881432,0.000016431371,0.96980894],"study_design_scores_gemma":[0.00022035913,0.0000168298,0.021772156,0.000027721939,0.00007083672,0.0000028740837,0.000018153061,0.97580284,0.00015008921,0.001677394,0.000043584325,0.00019714354],"about_ca_topic_score_codex":0.0008124229,"about_ca_topic_score_gemma":0.0042438535,"teacher_disagreement_score":0.9696118,"about_ca_system_score_codex":0.00008887732,"about_ca_system_score_gemma":0.00022070507,"threshold_uncertainty_score":0.67472196},"labels":[],"label_agreement":null},{"id":"W4230529600","doi":"10.1145/511335.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":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03497306590581862,"score_gpt":0.22636739065720735,"score_spread":0.19139432475138873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230529600","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016282146,0.0007701117,0.97864115,0.006540216,0.0015287551,0.00019497209,0.0000015849492,0.00042490216,0.010270091],"genre_scores_gemma":[0.97919446,0.000017010037,0.01740169,0.002254808,0.0004174881,0.000030847234,0.00000944216,0.000009539728,0.0006647007],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835646,0.00015420535,0.0003232658,0.00047276824,0.00030147072,0.00039184073],"domain_scores_gemma":[0.99874544,0.000117482996,0.00011377902,0.00076344033,0.0001268114,0.00013303498],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00029919753,0.00014882936,0.00016930012,0.000047314275,0.00016910033,0.00016167012,0.0008565234,0.00009690218,0.0006458325],"category_scores_gemma":[0.000021955011,0.00014050418,0.0000735866,0.0003390078,0.00004575911,0.00022482604,0.00007876544,0.00012409639,0.0009148681],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009904474,0.0001814431,0.0017793736,0.0000021202038,0.000054607324,0.000007785465,0.00006804516,0.0036531736,0.00023728986,0.013689162,0.04991778,0.9303993],"study_design_scores_gemma":[0.0013202962,0.000071982126,0.0031645233,0.000018280138,0.000029143466,0.0000028121433,0.0000090397,0.95491946,0.00021955399,0.016367732,0.023545904,0.00033126835],"about_ca_topic_score_codex":0.000035453286,"about_ca_topic_score_gemma":0.000079189704,"teacher_disagreement_score":0.97756624,"about_ca_system_score_codex":0.000041990686,"about_ca_system_score_gemma":0.000027527018,"threshold_uncertainty_score":0.999863},"labels":[],"label_agreement":null},{"id":"W4231245602","doi":"10.32920/ryerson.14645313.v1","title":"Study Of Resilient Packet Ring Based On OPNET","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Ring oscillator; Computer science; Network packet; Key (lock); Queue; Fuzzy logic; Computer network; Engineering; Artificial intelligence; Computer security; Electronic engineering","score_opus":0.02374863432270133,"score_gpt":0.25830069490977303,"score_spread":0.2345520605870717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231245602","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39982894,0.00013406057,0.58033586,0.00089648284,0.0017770886,0.00092696724,0.0000028123677,0.0003380321,0.01575974],"genre_scores_gemma":[0.9935296,0.000004629641,0.0056340056,0.00032030416,0.00007916624,0.00005560568,0.0000048535358,0.000009019486,0.0003627845],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798197,0.00022521098,0.0003651,0.00071402517,0.0005114591,0.00020226707],"domain_scores_gemma":[0.9979549,0.00018728182,0.00016818575,0.0014600419,0.00014574046,0.00008382423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035948236,0.00021318028,0.0003706388,0.000116870164,0.00004703875,0.00016117019,0.0010180833,0.00011112722,0.000059986574],"category_scores_gemma":[0.000028857912,0.00018929724,0.00011214585,0.00019439857,0.000016293337,0.0000482824,0.0007993357,0.00037887142,0.000009244605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004126819,0.0021960202,0.0018133549,0.000068028785,0.00013039217,0.0001684176,0.001300059,0.760063,0.000011711565,0.008411559,0.0020015484,0.22379465],"study_design_scores_gemma":[0.0010014089,0.00037341058,0.0037207238,0.00017997672,0.000024632745,0.0000010414471,0.00033919403,0.9937247,0.000109583896,0.000100102465,0.00015304075,0.0002722088],"about_ca_topic_score_codex":0.000048214686,"about_ca_topic_score_gemma":0.000094750016,"teacher_disagreement_score":0.5937007,"about_ca_system_score_codex":0.000037436534,"about_ca_system_score_gemma":0.0002076847,"threshold_uncertainty_score":0.7719317},"labels":[],"label_agreement":null},{"id":"W4232051886","doi":"10.32920/ryerson.14654205","title":"Admission Control and Bandwidth Allocation for Class A Traffic in RPR Networks","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Dynamic bandwidth allocation; Computer science; Bandwidth allocation; Admission control; Bandwidth (computing); Network traffic control; Quality of service; Computer network; Traffic shaping; Bandwidth management; Traffic policing; Internet traffic; Channel allocation schemes; The Internet; Distributed computing; Real-time computing; Network packet; Telecommunications","score_opus":0.010371110395304705,"score_gpt":0.23312990286501467,"score_spread":0.22275879246970998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232051886","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013910614,0.0026645681,0.9757437,0.005271299,0.00091741123,0.0010682849,0.000002261213,0.00020850776,0.00021331481],"genre_scores_gemma":[0.9860159,0.00028738385,0.011539056,0.0011280617,0.00025771544,0.00036814107,0.000037777274,0.000016743512,0.00034922743],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979876,0.0001573504,0.0004440284,0.0008827603,0.00016035292,0.00036789596],"domain_scores_gemma":[0.9985931,0.0003855917,0.0001591833,0.00054572185,0.00013827,0.00017812302],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055259676,0.00029133426,0.00047694464,0.00011977887,0.000088118264,0.00042937076,0.00052883214,0.0004088514,0.000012260555],"category_scores_gemma":[0.000057313737,0.00027015607,0.00012756593,0.00018242665,0.000031814747,0.00017792467,0.00026598456,0.000452482,0.0000011430242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005188642,0.00007831263,0.00009865731,0.0000523799,0.000039644765,0.000009039501,0.00017299637,0.3213919,0.000011687875,0.008273463,0.0011829346,0.6686371],"study_design_scores_gemma":[0.0019779357,0.000056517096,0.0007605907,0.00018774964,0.000025736248,0.0000063032353,0.000028537783,0.99469364,0.0000027408983,0.00042809604,0.0015329354,0.00029924474],"about_ca_topic_score_codex":0.000015335088,"about_ca_topic_score_gemma":0.0002496691,"teacher_disagreement_score":0.97210526,"about_ca_system_score_codex":0.00006479822,"about_ca_system_score_gemma":0.0002708588,"threshold_uncertainty_score":0.9999751},"labels":[],"label_agreement":null},{"id":"W4232643876","doi":"10.1109/infocom.2007.74","title":"On the Performance of Primal/Dual Schemes for Congestion Control in Networks with Dynamic Flows","year":2008,"lang":"en","type":"article","venue":"2008 Proceedings IEEE INFOCOM - The 27th Conference on Computer Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Mathematical optimization; FIFO (computing and electronics); Queueing theory; Stability (learning theory); Dual (grammatical number); Maximization; Utility maximization; Network congestion; Flow control (data); Class (philosophy); Function (biology); Mathematics; Mathematical economics; Network packet; Computer network","score_opus":0.027423203565521047,"score_gpt":0.235608443829142,"score_spread":0.20818524026362095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232643876","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35639113,0.00018253164,0.6222031,0.016469175,0.00033535942,0.0028502434,0.000011264615,0.0002611387,0.0012960427],"genre_scores_gemma":[0.9843339,0.00034739514,0.012974205,0.0015120847,0.00007426457,0.0006764124,0.0000062730633,0.000020052788,0.00005542061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980997,0.00010527692,0.00057772466,0.00039315378,0.00038472627,0.00043940614],"domain_scores_gemma":[0.9961324,0.0013555209,0.0004332343,0.0013196656,0.0006798473,0.00007937792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007008463,0.00032567963,0.00038899464,0.00015783946,0.0007734805,0.0001581877,0.0031343636,0.00011768423,0.0000055887845],"category_scores_gemma":[0.000037182253,0.00020441014,0.00009727057,0.0006197238,0.00053447485,0.00041498741,0.00020999154,0.0006905497,0.0000106610405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059453904,0.0006917152,0.0021182734,0.000043465305,0.00018735389,0.0000022261336,0.0024523332,0.086132735,0.00013461498,0.7795422,0.0034338778,0.12466668],"study_design_scores_gemma":[0.0014987383,0.00073616044,0.0029280805,0.00026118415,0.00001801488,0.000033683024,0.0000325918,0.99226564,0.000031200943,0.00043227035,0.001510805,0.00025160055],"about_ca_topic_score_codex":0.000010027464,"about_ca_topic_score_gemma":0.00003296825,"teacher_disagreement_score":0.90613294,"about_ca_system_score_codex":0.00007579706,"about_ca_system_score_gemma":0.0002334482,"threshold_uncertainty_score":0.83356035},"labels":[],"label_agreement":null},{"id":"W4233217713","doi":"10.1017/s0021900200117863","title":"A Stochastic Ordering Property for Leaky Bucket Regulated Flows in Packet Networks","year":2007,"lang":"en","type":"article","venue":"Journal of Applied Probability","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Leaky bucket; Poisson distribution; Constant (computer programming); Network packet; Regular polygon; Superposition principle; Poisson process; Property (philosophy); Stationary process; Stochastic process; Process (computing); Control theory (sociology); Applied mathematics; Mathematical analysis; Statistics; Computer science; Computer network; Geometry","score_opus":0.015339943255662153,"score_gpt":0.2282470256589828,"score_spread":0.21290708240332065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233217713","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1328557,0.00008860255,0.8651955,0.00043976094,0.00034827378,0.0007554047,4.6241053e-7,0.000049137077,0.00026715334],"genre_scores_gemma":[0.9591422,0.0000029902021,0.04037999,0.00014407681,0.00027137386,0.000025729165,6.547127e-7,0.000011088429,0.000021911523],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802244,0.000044349126,0.00087308505,0.00031481337,0.0002841357,0.0004611859],"domain_scores_gemma":[0.9984786,0.0003526611,0.00037429365,0.0003583493,0.00027531732,0.00016077638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003638415,0.00017965247,0.00040079904,0.00011784695,0.00008497439,0.00007963363,0.0006084701,0.00013324285,0.000006283589],"category_scores_gemma":[0.000107404616,0.0001236519,0.00012178642,0.0004860523,0.000053156986,0.00022219577,0.00007841806,0.00040864656,0.0000016531619],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010781767,0.00024866205,0.0001716881,0.00003660585,0.000038865855,0.000011584556,0.00036868366,0.36794817,0.00019238364,0.011457435,0.00031826453,0.6181295],"study_design_scores_gemma":[0.0027802861,0.00030033712,0.001685837,0.000085362284,0.000022140399,0.000046301786,0.000038581067,0.96282613,0.000080343976,0.030523056,0.0013306822,0.000280934],"about_ca_topic_score_codex":0.0000032655403,"about_ca_topic_score_gemma":0.00010962855,"teacher_disagreement_score":0.8262865,"about_ca_system_score_codex":0.00015919545,"about_ca_system_score_gemma":0.00016922396,"threshold_uncertainty_score":0.50423783},"labels":[],"label_agreement":null},{"id":"W4234337510","doi":"10.32920/ryerson.14654205.v1","title":"Admission Control and Bandwidth Allocation for Class A Traffic in RPR Networks","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Dynamic bandwidth allocation; Computer science; Bandwidth allocation; Admission control; Bandwidth (computing); Network traffic control; Computer network; Quality of service; Traffic shaping; Bandwidth management; Traffic policing; Internet traffic; Channel allocation schemes; Distributed computing; The Internet; Real-time computing; Network packet; Telecommunications","score_opus":0.010371110395304705,"score_gpt":0.23312990286501467,"score_spread":0.22275879246970998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234337510","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013910614,0.0026645681,0.9757437,0.005271299,0.00091741123,0.0010682849,0.000002261213,0.00020850776,0.00021331481],"genre_scores_gemma":[0.9860159,0.00028738385,0.011539056,0.0011280617,0.00025771544,0.00036814107,0.000037777274,0.000016743512,0.00034922743],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979876,0.0001573504,0.0004440284,0.0008827603,0.00016035292,0.00036789596],"domain_scores_gemma":[0.9985931,0.0003855917,0.0001591833,0.00054572185,0.00013827,0.00017812302],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055259676,0.00029133426,0.00047694464,0.00011977887,0.000088118264,0.00042937076,0.00052883214,0.0004088514,0.000012260555],"category_scores_gemma":[0.000057313737,0.00027015607,0.00012756593,0.00018242665,0.000031814747,0.00017792467,0.00026598456,0.000452482,0.0000011430242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005188642,0.00007831263,0.00009865731,0.0000523799,0.000039644765,0.000009039501,0.00017299637,0.3213919,0.000011687875,0.008273463,0.0011829346,0.6686371],"study_design_scores_gemma":[0.0019779357,0.000056517096,0.0007605907,0.00018774964,0.000025736248,0.0000063032353,0.000028537783,0.99469364,0.0000027408983,0.00042809604,0.0015329354,0.00029924474],"about_ca_topic_score_codex":0.000015335088,"about_ca_topic_score_gemma":0.0002496691,"teacher_disagreement_score":0.97210526,"about_ca_system_score_codex":0.00006479822,"about_ca_system_score_gemma":0.0002708588,"threshold_uncertainty_score":0.9999751},"labels":[],"label_agreement":null},{"id":"W4235366758","doi":"10.1109/icatm.1998.688186","title":"A dynamic call admission scheme for VBR traffic in ATM networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Variable bitrate; Call Admission Control; Computer science; Computer network; Quality of service; Blocking (statistics); Bandwidth (computing); Call blocking; Scheme (mathematics); Admission control; Constant bitrate; Real-time computing; Telecommunications","score_opus":0.012286754349353602,"score_gpt":0.22551877897383293,"score_spread":0.21323202462447932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235366758","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016201427,0.000932355,0.97707576,0.0033998007,0.0003698035,0.00039705867,4.9382425e-7,0.0003320822,0.0012912357],"genre_scores_gemma":[0.96113425,0.000060771672,0.033249322,0.000737706,0.00006627766,0.0000685469,0.0000020302132,0.0000101393125,0.0046709687],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885017,0.000034858447,0.00023972383,0.00037822954,0.00010950873,0.00038750056],"domain_scores_gemma":[0.9993198,0.00014303596,0.00004557603,0.00031737323,0.00003484374,0.00013938475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018120754,0.00013905912,0.00017071444,0.00006931466,0.000074807685,0.00007862188,0.00048407563,0.00010324544,0.00009029025],"category_scores_gemma":[0.00002134993,0.00012009735,0.00008043452,0.00032447182,0.000017801409,0.00020199937,0.000052600037,0.00013981585,0.000042912758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012505029,0.00011070917,0.000073220224,0.0000052224077,0.000007665486,0.000009330148,0.000094722745,0.058626357,0.000013013341,0.009319855,0.010541983,0.92118543],"study_design_scores_gemma":[0.0009817936,0.000073224684,0.00017476152,0.000021673894,0.000002591229,0.0000060538955,0.0000052705946,0.9886776,0.0000012824988,0.00009664722,0.009798926,0.00016017628],"about_ca_topic_score_codex":0.0000029539237,"about_ca_topic_score_gemma":0.000098285105,"teacher_disagreement_score":0.9449328,"about_ca_system_score_codex":0.000044941607,"about_ca_system_score_gemma":0.000018119414,"threshold_uncertainty_score":0.4897428},"labels":[],"label_agreement":null},{"id":"W4236152459","doi":"10.32920/ryerson.14644398.v1","title":"Multicast Optimization And Recovery In Multihoming Environment","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Rendezvous; Multicast; Multihoming; Computer network; Computer science; Distributed computing; Router; Protocol Independent Multicast; Pragmatic General Multicast; Source-specific multicast; Tree (set theory); Xcast; Network congestion; The Internet; Engineering; Network packet; Internet Protocol; Mathematics","score_opus":0.009606708626572391,"score_gpt":0.19793376102516994,"score_spread":0.18832705239859754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236152459","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011218803,0.0006290348,0.98651713,0.0005643304,0.00034669365,0.00021047842,6.757698e-7,0.000068365436,0.00044446965],"genre_scores_gemma":[0.5302461,0.0006157515,0.4685192,0.00027959514,0.000053075502,0.000045748235,0.000009149685,0.0000082147835,0.0002231831],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883544,0.00007913185,0.00023487546,0.00055945053,0.00012939649,0.00016167415],"domain_scores_gemma":[0.9993762,0.00009471811,0.00007123382,0.0003873444,0.000016524526,0.000054014206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001757261,0.00015156032,0.00020141139,0.000077154335,0.000031590567,0.00025428235,0.00025527622,0.0001472879,0.000041716685],"category_scores_gemma":[0.000018034158,0.00015551997,0.00004082183,0.00005661111,0.000020107305,0.00016530904,0.00085219514,0.00024942958,0.0000047507524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018400507,0.000031386433,0.00014634692,0.0000096801095,0.000008680996,0.000016449707,0.00014940347,0.7399105,0.000008446012,0.00030702408,0.000010912447,0.25939938],"study_design_scores_gemma":[0.00032423448,0.000008825135,0.00043010694,0.000068472735,0.0000048419965,0.000003895202,0.0000346206,0.9987731,0.000018930637,0.000056569665,0.00010703923,0.00016935985],"about_ca_topic_score_codex":0.00003081984,"about_ca_topic_score_gemma":0.000023315295,"teacher_disagreement_score":0.51902723,"about_ca_system_score_codex":0.00006106605,"about_ca_system_score_gemma":0.00005086274,"threshold_uncertainty_score":0.63419205},"labels":[],"label_agreement":null},{"id":"W4238296509","doi":"10.22215/etd/2016-11574","title":"Delay-based Rate Control Algorithms for the Real-time Video Transmission Application","year":2016,"lang":"en","type":"dissertation","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Communication source; Network packet; Algorithm; Real-time computing; Transmission delay; Network delay; Transmission (telecommunications); Videoconferencing; Computer network; Multimedia; Telecommunications","score_opus":0.0072232936007733915,"score_gpt":0.24372266259378325,"score_spread":0.23649936899300986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238296509","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000052262054,0.00033115293,0.98992926,0.0040565003,0.0005481352,0.0020104572,0.00002007159,0.00043022388,0.0026219161],"genre_scores_gemma":[0.5228943,0.0018329542,0.14237516,0.009066326,0.0051917164,0.02124495,0.002579119,0.00050795893,0.29430747],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980748,0.00011894084,0.00044814963,0.0006814446,0.00030295656,0.0003736901],"domain_scores_gemma":[0.99699295,0.0014843551,0.00030284678,0.00074282096,0.0003515797,0.00012545368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006752606,0.0003441434,0.00035467435,0.00008748816,0.0003873128,0.00016447702,0.0011251647,0.0002976706,0.000075300166],"category_scores_gemma":[0.000018984469,0.00019788812,0.000277606,0.00018967433,0.000028035236,0.00017470711,0.000007949995,0.00015202403,0.0001583736],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020022527,0.00003152066,6.9578977e-7,0.000022751654,0.00007294017,8.232002e-7,0.00004459438,0.0005220935,0.0041572624,0.009602618,0.0031808896,0.9821636],"study_design_scores_gemma":[0.002212814,0.00009343972,0.00009970492,0.000075085016,0.00013986073,8.2892535e-7,0.000007920855,0.9576496,0.000829282,0.0012603974,0.03729684,0.00033421867],"about_ca_topic_score_codex":0.000029163133,"about_ca_topic_score_gemma":0.00001579367,"teacher_disagreement_score":0.98182935,"about_ca_system_score_codex":0.000054489967,"about_ca_system_score_gemma":0.00031977778,"threshold_uncertainty_score":0.8069643},"labels":[],"label_agreement":null},{"id":"W4238489256","doi":"10.1007/978-3-319-04645-7_5","title":"Conclusions and Future Directions","year":2014,"lang":"en","type":"book-chapter","venue":"SpringerBriefs in computer science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Provisioning; Quality of service; Computer science; Channel (broadcasting); Poisson distribution; Context (archaeology); Computer network; Mean square; Statistics; Mathematics; Geography","score_opus":0.007637185824983309,"score_gpt":0.21062750477044972,"score_spread":0.2029903189454664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238489256","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009023518,0.0013719826,0.8941533,0.0034524933,0.0050725527,0.0003530417,0.0000026116068,0.00042486505,0.09507894],"genre_scores_gemma":[0.2090377,0.010763263,0.5814262,0.015439567,0.02575538,0.00018335826,0.0000137274055,0.00033422562,0.15704654],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971047,0.000029930085,0.0004179782,0.0013039091,0.00061835384,0.0005250977],"domain_scores_gemma":[0.99806476,0.00017818838,0.00019084236,0.0010965607,0.00017677977,0.00029289996],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00082236785,0.00038941271,0.00045578045,0.00051737064,0.00050925673,0.00049241044,0.0018755544,0.00021894142,0.00003670227],"category_scores_gemma":[0.00001286065,0.00038457668,0.00009191041,0.0003605407,0.00069264317,0.00038507662,0.0015850664,0.0006039907,0.00006125166],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.659598e-7,0.0000045891256,0.000008763694,0.0000048738125,0.000003854775,0.0000130983335,0.00008350824,0.00006479619,0.0000018802766,0.48957652,0.00012032204,0.51011705],"study_design_scores_gemma":[0.00029484055,0.0000831679,0.00039566567,0.00014168536,0.000008712625,0.000071547656,7.4790034e-7,0.22789365,0.0000037820741,0.011000041,0.7595776,0.000528584],"about_ca_topic_score_codex":0.000011428938,"about_ca_topic_score_gemma":0.000034081666,"teacher_disagreement_score":0.75945723,"about_ca_system_score_codex":0.00013088807,"about_ca_system_score_gemma":0.00033223542,"threshold_uncertainty_score":0.9998606},"labels":[],"label_agreement":null},{"id":"W4238683154","doi":"10.32920/ryerson.14644398","title":"Multicast Optimization And Recovery In Multihoming Environment","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Rendezvous; Multicast; Multihoming; Computer network; Computer science; Distributed computing; Pragmatic General Multicast; Router; Protocol Independent Multicast; Source-specific multicast; Tree (set theory); Xcast; Single point of failure; The Internet; Engineering; Internet Protocol","score_opus":0.009606708626572391,"score_gpt":0.19793376102516994,"score_spread":0.18832705239859754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238683154","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011218803,0.0006290348,0.98651713,0.0005643304,0.00034669365,0.00021047842,6.757698e-7,0.000068365436,0.00044446965],"genre_scores_gemma":[0.5302461,0.0006157515,0.4685192,0.00027959514,0.000053075502,0.000045748235,0.000009149685,0.0000082147835,0.0002231831],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883544,0.00007913185,0.00023487546,0.00055945053,0.00012939649,0.00016167415],"domain_scores_gemma":[0.9993762,0.00009471811,0.00007123382,0.0003873444,0.000016524526,0.000054014206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001757261,0.00015156032,0.00020141139,0.000077154335,0.000031590567,0.00025428235,0.00025527622,0.0001472879,0.000041716685],"category_scores_gemma":[0.000018034158,0.00015551997,0.00004082183,0.00005661111,0.000020107305,0.00016530904,0.00085219514,0.00024942958,0.0000047507524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018400507,0.000031386433,0.00014634692,0.0000096801095,0.000008680996,0.000016449707,0.00014940347,0.7399105,0.000008446012,0.00030702408,0.000010912447,0.25939938],"study_design_scores_gemma":[0.00032423448,0.000008825135,0.00043010694,0.000068472735,0.0000048419965,0.000003895202,0.0000346206,0.9987731,0.000018930637,0.000056569665,0.00010703923,0.00016935985],"about_ca_topic_score_codex":0.00003081984,"about_ca_topic_score_gemma":0.000023315295,"teacher_disagreement_score":0.51902723,"about_ca_system_score_codex":0.00006106605,"about_ca_system_score_gemma":0.00005086274,"threshold_uncertainty_score":0.63419205},"labels":[],"label_agreement":null},{"id":"W4238739646","doi":"10.22215/etd/2007-08476","title":"Complex boundary value techniques applied to two queue networks with coupled processing","year":2007,"lang":"en","type":"dissertation","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Canadian Heritage","funders":"","keywords":"Queue; Computer science; Computer network","score_opus":0.009685974756690524,"score_gpt":0.2780686285085672,"score_spread":0.26838265375187664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238739646","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006144227,0.00027229253,0.9323744,0.00019912112,0.0003117244,0.0011271741,7.8898444e-7,0.0014958724,0.063604206],"genre_scores_gemma":[0.68072796,0.00002228619,0.30518693,0.0043342733,0.0009490159,0.00046290286,0.00039091578,0.00011477931,0.007810969],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972357,0.000037553516,0.00051333744,0.0009395086,0.0006211023,0.0006527563],"domain_scores_gemma":[0.99836457,0.00009496636,0.00029041883,0.00062520517,0.00036194013,0.00026289388],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048470474,0.00053349003,0.0005819287,0.00028447344,0.00039167842,0.0007140611,0.0011627882,0.00029683026,0.00004182826],"category_scores_gemma":[0.0000056918943,0.00044748723,0.00008061278,0.0009170769,0.00005086391,0.00021752476,0.00007006697,0.00054987974,0.000031235308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024455183,0.000067025256,0.000008329066,0.00005456809,0.00005039028,0.000025123976,0.0003364449,0.009603373,0.00013233843,0.039112974,0.0028349138,0.94753],"study_design_scores_gemma":[0.00093831215,0.00025951746,0.00045981703,0.0004690112,0.00008181204,0.000026670241,0.00022025456,0.9720921,0.0003236891,0.0005443838,0.023215784,0.0013686314],"about_ca_topic_score_codex":0.00007322326,"about_ca_topic_score_gemma":0.000908867,"teacher_disagreement_score":0.9624888,"about_ca_system_score_codex":0.000110650726,"about_ca_system_score_gemma":0.0005043353,"threshold_uncertainty_score":0.9997977},"labels":[],"label_agreement":null},{"id":"W4238906210","doi":"10.1109/cdc.1989.70237","title":"A decentralized control strategy for dynamic routing","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Controller (irrigation); Queue; Computer science; Routing (electronic design automation); Clearance; Distributed computing; Control (management); Information flow; Control theory (sociology); Computer network; Artificial intelligence","score_opus":0.013316850196331765,"score_gpt":0.2522219124771032,"score_spread":0.2389050622807714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238906210","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013682139,0.00019392601,0.99279976,0.0005893533,0.00026650724,0.00035889586,0.000001196821,0.0002486229,0.0041735265],"genre_scores_gemma":[0.9737793,0.0000073242286,0.024458699,0.0007312102,0.000016837714,0.00005375504,8.705335e-7,0.0000064770597,0.00094550796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999014,0.000066161265,0.00018930357,0.00026614656,0.00010330024,0.00036108805],"domain_scores_gemma":[0.9993319,0.00021140974,0.000052926425,0.00023766677,0.00007228055,0.00009381921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002890674,0.000108084765,0.00015023167,0.00002711885,0.000110934285,0.00013710049,0.00029843766,0.000045111752,0.00004505491],"category_scores_gemma":[0.000053504933,0.00009242174,0.00008315564,0.00013073707,0.000014943467,0.00017226794,0.000009139824,0.000055010612,0.000023689132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009751831,0.00002469612,0.000051044914,0.000001990729,0.000020927762,0.0000024870994,0.000021883214,0.0026618554,0.000060148122,0.8102061,0.00041555287,0.18652354],"study_design_scores_gemma":[0.0028677217,0.00006411152,0.00008129364,0.0000047025264,0.000010586662,0.000012873638,0.000020735612,0.9836634,0.000042022984,0.0048761573,0.008204358,0.00015207646],"about_ca_topic_score_codex":0.000002602355,"about_ca_topic_score_gemma":0.000015368878,"teacher_disagreement_score":0.9810015,"about_ca_system_score_codex":0.000024525269,"about_ca_system_score_gemma":0.000090915564,"threshold_uncertainty_score":0.3768849},"labels":[],"label_agreement":null},{"id":"W4239553643","doi":"10.1145/1539024.1508880","title":"GINI","year":2009,"lang":"en","type":"article","venue":"ACM SIGCSE Bulletin","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Virtual machine; The Internet; Set (abstract data type); Network topology; Operating system; Programming language","score_opus":0.008488547664246456,"score_gpt":0.21447406647032274,"score_spread":0.2059855188060763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239553643","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01838047,0.0011787104,0.50517464,0.41455534,0.0012469472,0.0004159507,0.0000012971394,0.0018123579,0.057234317],"genre_scores_gemma":[0.9632071,0.0000210022,0.023665978,0.009651032,0.00022711557,0.000007193389,8.649088e-7,0.000004393113,0.0032152685],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991083,0.000042643558,0.00014357534,0.00027844688,0.00017033017,0.00025666034],"domain_scores_gemma":[0.99891496,0.00012983345,0.0000438457,0.0007728367,0.00004081894,0.0000976917],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00017194187,0.00010609114,0.000115036746,0.00003641441,0.00008428891,0.00009604361,0.0011653223,0.00004859043,0.00024404612],"category_scores_gemma":[0.00010959114,0.00009643729,0.000055889006,0.00015158826,0.00001772297,0.00005936413,0.000101210615,0.00011661463,0.0016789562],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056542694,0.00003927863,0.00002308755,6.079446e-7,0.000004417084,0.000025769645,0.00006464513,0.0000961551,0.00005126132,0.045919474,0.1403349,0.8134347],"study_design_scores_gemma":[0.00060068036,0.00015502363,0.0014879298,0.000012631085,0.0000051393645,0.000023294251,0.000006994667,0.00638413,0.00016743751,0.007744988,0.98317385,0.0002379269],"about_ca_topic_score_codex":0.0000025873846,"about_ca_topic_score_gemma":4.4172197e-7,"teacher_disagreement_score":0.94482666,"about_ca_system_score_codex":0.000012174821,"about_ca_system_score_gemma":0.00002447268,"threshold_uncertainty_score":0.99909836},"labels":[],"label_agreement":null},{"id":"W4240177344","doi":"10.1145/1012888.1005727","title":"A mean-field analysis of short lived interacting TCP flows","year":2004,"lang":"en","type":"article","venue":"ACM SIGMETRICS Performance Evaluation Review","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Transmission (telecommunications); Limit (mathematics); File size; Flow (mathematics); Download; Transmission rate; Mathematics; Computer science; Statistics; Mathematical analysis; Geometry; Telecommunications","score_opus":0.06680602776336374,"score_gpt":0.34198845252966353,"score_spread":0.2751824247662998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240177344","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33588654,0.104254834,0.5517782,0.0031375824,0.0010505059,0.0016441306,0.0000020848113,0.00021305295,0.0020331019],"genre_scores_gemma":[0.95450455,0.031269934,0.0128175225,0.001235144,0.000051179963,0.00008476561,0.000014016166,0.0000067724704,0.000016129754],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973865,0.0001535454,0.00079679553,0.00039325614,0.001032047,0.00023782566],"domain_scores_gemma":[0.99691594,0.0006986377,0.0003515923,0.0011128804,0.0008353523,0.00008559911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00358751,0.0001752788,0.00055347715,0.0007777841,0.00010453486,0.00005904664,0.0011333224,0.000063431406,0.00017351232],"category_scores_gemma":[0.002839059,0.0001549969,0.00026743466,0.0077439193,0.000014229119,0.00067002344,0.00019326624,0.00020209649,0.000049099523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035957523,0.000047924183,0.0011309054,0.00013939696,0.00022683118,6.467694e-7,0.00016590765,0.027336372,0.000020554739,0.0005282091,0.00013738469,0.9702623],"study_design_scores_gemma":[0.00038867054,0.00015805055,0.0034977715,0.0010497501,0.0014337407,0.0000036101917,0.00001493932,0.9912532,0.00019713894,0.00006314301,0.0017098383,0.00023014679],"about_ca_topic_score_codex":0.000010239576,"about_ca_topic_score_gemma":0.000013710416,"teacher_disagreement_score":0.9700321,"about_ca_system_score_codex":0.00012747274,"about_ca_system_score_gemma":0.00021245726,"threshold_uncertainty_score":0.63205904},"labels":[],"label_agreement":null},{"id":"W4240435199","doi":"10.1145/2499368.2451140","title":"Why you should care about quantile regression","year":2013,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Quantile regression; Quantile; Variance (accounting); Property (philosophy); Computer experiment; Regression analysis; Field (mathematics); Regression; Data mining; Statistics; Machine learning; Simulation; Mathematics","score_opus":0.023463831647667667,"score_gpt":0.26114636798421054,"score_spread":0.23768253633654288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240435199","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70739937,0.020771457,0.15651952,0.06529528,0.009087925,0.00244593,0.00003106757,0.0038302178,0.03461921],"genre_scores_gemma":[0.98787516,0.000032014796,0.008067936,0.0032230176,0.00028397646,0.000042323078,0.000010363699,0.000012293397,0.0004529282],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99860376,0.0000749967,0.00021559543,0.00042430856,0.00032394353,0.00035738223],"domain_scores_gemma":[0.9983207,0.00029034953,0.00011930151,0.0009771277,0.00014425271,0.00014825276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009755019,0.00018665746,0.0001935174,0.0000684751,0.00019363532,0.0003639291,0.0015969392,0.000108154236,0.00021267794],"category_scores_gemma":[0.000093528026,0.0001405534,0.00006722291,0.00020680473,0.000044396547,0.00071641704,0.00027468923,0.00018078183,0.0006146422],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012586582,0.00004996872,0.0043667774,0.00004266974,0.000031044387,0.000028776152,0.002068526,0.000746337,0.00030902526,0.009847932,0.12783353,0.85466284],"study_design_scores_gemma":[0.002614294,0.00059498975,0.03141645,0.0005829304,0.000100946825,0.000035949477,0.002125421,0.3559876,0.001633867,0.0034038564,0.5996273,0.0018763399],"about_ca_topic_score_codex":0.00020424102,"about_ca_topic_score_gemma":0.000078757635,"teacher_disagreement_score":0.8527865,"about_ca_system_score_codex":0.000018168874,"about_ca_system_score_gemma":0.000037738653,"threshold_uncertainty_score":0.79001874},"labels":[],"label_agreement":null},{"id":"W4241317331","doi":"10.1145/511365.511371","title":"Context-aware TCP/IP","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Computer network; Internet protocol suite; Internet Protocol; Transmission Control Protocol; TCP tuning; TCP global synchronization; Network congestion; TCP acceleration; The Internet; Network packet; Distributed computing; World Wide Web","score_opus":0.017469892655271036,"score_gpt":0.1845057292104258,"score_spread":0.16703583655515475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241317331","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00075073016,0.0003916708,0.930225,0.011097725,0.0004265047,0.00008623265,3.3379942e-7,0.00054252765,0.05647923],"genre_scores_gemma":[0.972422,0.000012426258,0.0016919787,0.0033167796,0.000090080044,0.000008548317,2.226168e-7,0.000003459707,0.022454487],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993466,0.000024680308,0.00010784823,0.0002058892,0.00012797925,0.00018698229],"domain_scores_gemma":[0.99948764,0.000059593272,0.000023315306,0.00030643327,0.000040415456,0.000082599836],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000060625876,0.0000759114,0.00008636343,0.000027267242,0.000082661536,0.00008548539,0.00044835047,0.000034911332,0.0011101295],"category_scores_gemma":[0.000006424436,0.00006271554,0.000043357184,0.00016809662,0.000020038942,0.00020585998,0.000053779364,0.000069384354,0.0015967744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.484503e-7,0.000018132687,0.00006189706,5.718964e-7,0.000004988164,0.0000074178147,0.00005158107,0.000032212334,0.0000022656484,0.17437656,0.06238207,0.7630618],"study_design_scores_gemma":[0.00040741224,0.000036685837,0.00022155768,0.0000040117525,0.0000024802976,0.000014073285,0.000017975623,0.7898972,0.000031894295,0.00056383846,0.20866473,0.00013813787],"about_ca_topic_score_codex":0.0000042839592,"about_ca_topic_score_gemma":0.00001078185,"teacher_disagreement_score":0.9716713,"about_ca_system_score_codex":0.000009672958,"about_ca_system_score_gemma":0.000006771401,"threshold_uncertainty_score":0.999803},"labels":[],"label_agreement":null},{"id":"W4242395338","doi":"10.1109/icppw.2004.1328030","title":"Constrained cost minimization for multipoint communication groups","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Minification; Span (engineering); Routing (electronic design automation); Range (aeronautics); Distributed computing; Quality of service; Path (computing); Mathematical optimization; Core (optical fiber); Computer network; Mathematics; Telecommunications; Engineering","score_opus":0.015214721452649602,"score_gpt":0.24298070035791103,"score_spread":0.22776597890526143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242395338","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043461117,0.00007858956,0.9850946,0.010111525,0.000084919026,0.00051111955,0.0000016202112,0.00024909817,0.0034338834],"genre_scores_gemma":[0.7414273,0.00001429264,0.25667033,0.001140247,0.0000734866,0.000112050904,0.000013639908,0.000003781604,0.00054485333],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993954,0.000037931975,0.00017935506,0.00016460412,0.00008086826,0.00014189792],"domain_scores_gemma":[0.9991942,0.00022206249,0.00006032585,0.00035612666,0.00011318372,0.00005407609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017994431,0.000072078896,0.00008356635,0.000033376025,0.00012128164,0.00008525607,0.00039426988,0.00004033298,0.000034783323],"category_scores_gemma":[0.00003248074,0.00006634695,0.000041236995,0.00010126089,0.000033846976,0.00030704745,0.000043248634,0.000043499007,0.000037344664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061905316,0.000033661552,0.000017847207,0.0000013085019,0.0000056313233,6.871109e-8,0.000110343644,0.003376605,0.000025624404,0.2919607,0.0037679053,0.70069414],"study_design_scores_gemma":[0.0009767349,0.000022781398,0.00009560191,0.0000056022354,0.0000038895723,0.0000030303522,0.000022874361,0.9476171,0.00012098852,0.00059653504,0.05044579,0.00008903511],"about_ca_topic_score_codex":0.0000023622017,"about_ca_topic_score_gemma":0.000042559896,"teacher_disagreement_score":0.9442405,"about_ca_system_score_codex":0.000026598076,"about_ca_system_score_gemma":0.00003178702,"threshold_uncertainty_score":0.270555},"labels":[],"label_agreement":null},{"id":"W4242639259","doi":"10.1145/1272998.1273021","title":"Comparing the performance of web server architectures","year":2007,"lang":"en","type":"article","venue":"ACM SIGOPS Operating Systems Review","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Operating system; Thread (computing); Server; Web server; Server farm; Client–server model; The Internet","score_opus":0.023689938635063294,"score_gpt":0.26001428861684445,"score_spread":0.23632434998178115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242639259","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7364337,0.2382077,0.019240389,0.001475742,0.0010065672,0.0013560521,8.11375e-7,0.00022326485,0.0020557698],"genre_scores_gemma":[0.9957929,0.0017506267,0.0014084425,0.0006865737,0.00016997347,0.00003204052,7.569042e-7,0.000008448379,0.0001502158],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982842,0.00021683902,0.0006492304,0.00024805526,0.00032556796,0.00027607149],"domain_scores_gemma":[0.9980866,0.0004318612,0.00023131704,0.0010491225,0.00014253875,0.000058597387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026455158,0.00015589077,0.00041621894,0.000031305677,0.00020278532,0.00009886658,0.0015629798,0.00003439503,0.000005385283],"category_scores_gemma":[0.00018937467,0.00009380713,0.0000852282,0.00038277704,0.00004103401,0.00011536322,0.00024073906,0.00020120916,0.000026519696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012261698,0.00010285856,0.055719428,0.011429074,0.00024413584,0.00002518795,0.0013046215,0.054438017,0.0012851574,0.043694925,0.0058331816,0.82591116],"study_design_scores_gemma":[0.00080264674,0.000216223,0.008448118,0.021216607,0.00008796416,0.00030502057,0.0000754387,0.92932534,0.00035128655,0.000015304719,0.038488816,0.0006672054],"about_ca_topic_score_codex":0.000027754182,"about_ca_topic_score_gemma":0.000018399423,"teacher_disagreement_score":0.87488735,"about_ca_system_score_codex":0.000018893203,"about_ca_system_score_gemma":0.00006399689,"threshold_uncertainty_score":0.38253435},"labels":[],"label_agreement":null},{"id":"W4243131022","doi":"10.1007/978-0-387-74437-7_8","title":"Modeling Traffic Flow Control Protocols","year":2008,"lang":"en","type":"book-chapter","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science","score_opus":0.02576192165105298,"score_gpt":0.22903874526877818,"score_spread":0.2032768236177252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243131022","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[7.6812773e-7,0.0002823015,0.7122343,0.00049746287,0.00022794263,0.0076895715,0.0000050555304,0.0007700139,0.27829254],"genre_scores_gemma":[0.01756412,0.00019952025,0.030688513,0.0027600555,0.0015063147,0.0069369595,0.00001598818,0.00013498528,0.94019353],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976198,0.000027518588,0.0005578081,0.0008123394,0.00054867455,0.00043385456],"domain_scores_gemma":[0.99839026,0.000084232604,0.00013547656,0.0009648286,0.00021079209,0.00021443827],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018219656,0.0005035283,0.0006279906,0.00014651383,0.00021093427,0.00017129794,0.001248069,0.00041696912,0.00025381788],"category_scores_gemma":[0.000007750301,0.00044703344,0.00033128727,0.00004373909,0.000056768225,0.00024325402,0.00009459586,0.00052838586,0.00067945145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017498465,0.000018514895,6.804091e-8,0.000010580825,0.000069045855,0.00006697944,0.00004560936,0.348909,3.258902e-7,0.114729114,0.009630828,0.52650243],"study_design_scores_gemma":[0.0009857645,0.000078595,6.371705e-8,0.00010541585,0.000016347887,0.000049953906,4.8362585e-7,0.8365836,2.3579656e-7,0.00087048596,0.1608711,0.00043790863],"about_ca_topic_score_codex":0.0000014871475,"about_ca_topic_score_gemma":0.000009551711,"teacher_disagreement_score":0.68154585,"about_ca_system_score_codex":0.00006258415,"about_ca_system_score_gemma":0.00029881435,"threshold_uncertainty_score":0.9997981},"labels":[],"label_agreement":null},{"id":"W4243435461","doi":"10.1109/pdcat.2007.4420181","title":"Two Tree-Based Algorithms for Network Spare Capacity Design","year":2007,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Spare part; Computer science; Tree (set theory); Algorithm design; Algorithm; Engineering; Mathematics; Operations management","score_opus":0.053422082467263855,"score_gpt":0.2679088806525975,"score_spread":0.21448679818533364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243435461","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017824971,0.000091984715,0.99487,0.0007966112,0.0006823099,0.0004485286,0.0000010443781,0.0004126369,0.0025186515],"genre_scores_gemma":[0.38123694,8.9769657e-7,0.6160497,0.0016345764,0.0005743124,0.000034939643,0.0000018176704,0.000008484905,0.00045829458],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985741,0.00005759433,0.00024113111,0.00036861954,0.00019955327,0.00055905327],"domain_scores_gemma":[0.9985111,0.00074313965,0.00006959812,0.00038695888,0.000120718665,0.00016849347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012143032,0.00015544184,0.00017407618,0.00004490746,0.00018567007,0.000100715224,0.00054878567,0.000063120046,0.000023165041],"category_scores_gemma":[0.000023441424,0.00013462453,0.00010082096,0.000315251,0.000037763723,0.00015665735,0.000031206335,0.00009312513,0.00002913375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044935532,0.000046561727,0.00017578829,0.000003225168,0.000017366945,0.00000733594,0.000027495234,0.076901756,0.000014803922,0.08468893,0.010465715,0.8276061],"study_design_scores_gemma":[0.0013395107,0.00013154256,0.00030277384,0.00000990389,0.000009500301,0.0000028350257,0.000005639742,0.98417115,0.0004166344,0.0030858936,0.010315144,0.00020948624],"about_ca_topic_score_codex":0.000015208211,"about_ca_topic_score_gemma":0.00011850576,"teacher_disagreement_score":0.90726936,"about_ca_system_score_codex":0.000039366172,"about_ca_system_score_gemma":0.000080090795,"threshold_uncertainty_score":0.54898286},"labels":[],"label_agreement":null},{"id":"W4243648164","doi":"10.32920/ryerson.14656449","title":"Improving BGP Convergence And Reachability Through Stable Path Aggregation (SPAGG)","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Default-free zone; Computer science; Border Gateway Protocol; Convergence (economics); Scalability; Reachability; Routing protocol; Path (computing); Computer network; The Internet; Routing (electronic design automation); Stability (learning theory); Distributed computing; Path vector protocol; Network mapping; Mathematical optimization; Mathematics; Algorithm; Static routing","score_opus":0.01383918952924063,"score_gpt":0.22543872011696636,"score_spread":0.21159953058772574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243648164","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030725574,0.002702547,0.96118623,0.00075827807,0.0015020851,0.00035681247,0.000004021456,0.00046071963,0.0023037184],"genre_scores_gemma":[0.9122999,0.000691251,0.08586432,0.00035264323,0.00013836904,0.0000640653,0.000016986927,0.000012005966,0.0005604956],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998004,0.00013924352,0.00035178682,0.0009218183,0.00028057265,0.00030254186],"domain_scores_gemma":[0.9984198,0.00013155634,0.00016200863,0.0009720717,0.0002108856,0.000103657934],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004368028,0.00026523686,0.00033554912,0.000028996035,0.00012302618,0.0004996175,0.00057614275,0.00023225286,0.000055152468],"category_scores_gemma":[0.00005620774,0.00025540567,0.000083475024,0.00015806501,0.0000727449,0.0005466409,0.0010520894,0.00044271623,0.0000064925257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004910456,0.000055271365,0.000780279,0.00023422918,0.000047323592,0.000018934423,0.00095494534,0.0020750924,0.00013125889,0.03422388,0.0007608126,0.9607131],"study_design_scores_gemma":[0.00026219268,0.000031076543,0.0005951997,0.00012364853,0.000022108596,0.000010429701,0.00010382482,0.989537,0.00041089335,0.007421003,0.0010540335,0.0004286017],"about_ca_topic_score_codex":0.0005229357,"about_ca_topic_score_gemma":0.00009913588,"teacher_disagreement_score":0.9874619,"about_ca_system_score_codex":0.000073668205,"about_ca_system_score_gemma":0.0003030555,"threshold_uncertainty_score":0.9999898},"labels":[],"label_agreement":null},{"id":"W4243850977","doi":"10.22215/etd/2005-07926","title":"SDP based simulated annealing on bandwidth reservation with multi-path routing","year":2005,"lang":"en","type":"dissertation","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Canadian Heritage; Library and Archives Canada","funders":"","keywords":"Reservation; Computer science; Computer network","score_opus":0.016842403075003492,"score_gpt":0.2551971144783651,"score_spread":0.2383547114033616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243850977","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08120818,0.00017009414,0.8988472,0.0010797108,0.0010144588,0.0010525043,0.0000058204346,0.001508377,0.015113663],"genre_scores_gemma":[0.9655802,0.000006850558,0.02362056,0.0009127143,0.00026808758,0.000024206816,0.00041523617,0.000042737953,0.009129401],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777156,0.00010396229,0.000422639,0.00075103005,0.000543024,0.0004077801],"domain_scores_gemma":[0.9983993,0.00024419467,0.0003274499,0.00060070516,0.00030763773,0.00012069731],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034847882,0.00038588725,0.0003405008,0.00020308871,0.0002631501,0.00028495188,0.0006399447,0.00028473142,0.00005057242],"category_scores_gemma":[0.00005188504,0.0003127494,0.00009317171,0.00052883505,0.000012055042,0.000326193,0.000017334372,0.00043670277,0.000052484407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040875684,0.00017490276,0.00032168382,0.000036903395,0.0000692024,0.00003061406,0.00049836613,0.71958524,0.000053687454,0.008950507,0.00061087444,0.26925924],"study_design_scores_gemma":[0.001555765,0.00020243722,0.0014676807,0.00039102006,0.000025778681,7.890006e-7,0.000076487806,0.99489915,0.00023271317,0.000012412177,0.0007196098,0.00041617532],"about_ca_topic_score_codex":0.000051918545,"about_ca_topic_score_gemma":0.0005591897,"teacher_disagreement_score":0.88437206,"about_ca_system_score_codex":0.00009056856,"about_ca_system_score_gemma":0.0002671524,"threshold_uncertainty_score":0.99993247},"labels":[],"label_agreement":null},{"id":"W4244460768","doi":"10.32920/ryerson.14645313","title":"Study Of Resilient Packet Ring Based On OPNET","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Ring oscillator; Computer science; Network packet; Key (lock); Queue; Fuzzy logic; Computer network; Engineering; Computer security; Artificial intelligence","score_opus":0.02374863432270133,"score_gpt":0.25830069490977303,"score_spread":0.2345520605870717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244460768","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39982894,0.00013406057,0.58033586,0.00089648284,0.0017770886,0.00092696724,0.0000028123677,0.0003380321,0.01575974],"genre_scores_gemma":[0.9935296,0.000004629641,0.0056340056,0.00032030416,0.00007916624,0.00005560568,0.0000048535358,0.000009019486,0.0003627845],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798197,0.00022521098,0.0003651,0.00071402517,0.0005114591,0.00020226707],"domain_scores_gemma":[0.9979549,0.00018728182,0.00016818575,0.0014600419,0.00014574046,0.00008382423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035948236,0.00021318028,0.0003706388,0.000116870164,0.00004703875,0.00016117019,0.0010180833,0.00011112722,0.000059986574],"category_scores_gemma":[0.000028857912,0.00018929724,0.00011214585,0.00019439857,0.000016293337,0.0000482824,0.0007993357,0.00037887142,0.000009244605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004126819,0.0021960202,0.0018133549,0.000068028785,0.00013039217,0.0001684176,0.001300059,0.760063,0.000011711565,0.008411559,0.0020015484,0.22379465],"study_design_scores_gemma":[0.0010014089,0.00037341058,0.0037207238,0.00017997672,0.000024632745,0.0000010414471,0.00033919403,0.9937247,0.000109583896,0.000100102465,0.00015304075,0.0002722088],"about_ca_topic_score_codex":0.000048214686,"about_ca_topic_score_gemma":0.000094750016,"teacher_disagreement_score":0.5937007,"about_ca_system_score_codex":0.000037436534,"about_ca_system_score_gemma":0.0002076847,"threshold_uncertainty_score":0.7719317},"labels":[],"label_agreement":null},{"id":"W4245377403","doi":"10.22215/etd/2007-06175","title":"Bandwidth allocation and fairness in resilient packet rings","year":2007,"lang":"en","type":"dissertation","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Canadian Heritage; Library and Archives Canada","funders":"","keywords":"Computer science; Network packet; Bandwidth (computing); Computer network; Telecommunications; Political science","score_opus":0.006276123708255069,"score_gpt":0.2560612099457356,"score_spread":0.24978508623748055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245377403","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31549484,0.002441029,0.59755826,0.0013866589,0.0025654596,0.0010896415,0.0000016666295,0.00055140856,0.07891107],"genre_scores_gemma":[0.9834571,0.00010877167,0.0021581654,0.00021518684,0.00007952974,0.00003222737,0.00006132268,0.000011788637,0.013875944],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873316,0.000036257206,0.00028812967,0.00045910964,0.00024890326,0.00023441497],"domain_scores_gemma":[0.99936295,0.00008779488,0.00010400038,0.00027778244,0.00008964676,0.000077830446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036546375,0.00018123406,0.00020426342,0.00022344288,0.000052345156,0.00012355112,0.0003282168,0.00019928456,0.000018717192],"category_scores_gemma":[0.000019229397,0.00017014398,0.000031869895,0.00030002568,0.0000144566275,0.00020628703,0.000028669047,0.00021025677,0.000020419522],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004130795,0.000044573986,0.00058888557,0.000046623056,0.000011172042,0.000015294452,0.00089428696,0.00011468635,0.000035836158,0.1085148,0.0011517777,0.88854074],"study_design_scores_gemma":[0.0063508716,0.00047237915,0.40556455,0.0014987277,0.0001015137,0.000047610978,0.0027000876,0.52423006,0.0026205957,0.019353004,0.03354297,0.0035176447],"about_ca_topic_score_codex":0.00006863215,"about_ca_topic_score_gemma":0.0014573231,"teacher_disagreement_score":0.8850231,"about_ca_system_score_codex":0.000042126823,"about_ca_system_score_gemma":0.00008145061,"threshold_uncertainty_score":0.693827},"labels":[],"label_agreement":null},{"id":"W4245592334","doi":"10.32920/ryerson.14668122","title":"The transformation of network neutrality in Canada","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Toronto Metropolitan University; McMaster University; York University","funders":"","keywords":"Net neutrality; Internet transit; The Internet; Computer science; Network management; Internet access; Computer network; Deep packet inspection; Internet traffic; Network packet; Bandwidth management; Telecommunications; Broadband; Computer security; Bandwidth (computing); World Wide Web","score_opus":0.010323058838145644,"score_gpt":0.20418874794206013,"score_spread":0.1938656891039145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245592334","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09152726,0.0022810495,0.88077474,0.012760333,0.0037038291,0.00059618196,0.000003571815,0.00007067529,0.008282388],"genre_scores_gemma":[0.9985732,0.00017805716,0.00086552027,0.00024713678,0.000054522294,0.00002283987,0.0000046536047,0.0000023432224,0.000051725103],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883837,0.00014436043,0.00039151803,0.00019735139,0.00022112808,0.00020728064],"domain_scores_gemma":[0.99910027,0.00018897557,0.000112091184,0.00048371573,0.00007760083,0.00003736625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003976437,0.000102118574,0.00019276609,0.000011661703,0.00005057986,0.000088810135,0.0007530943,0.00006134766,0.000007650247],"category_scores_gemma":[0.0000060015677,0.00007430883,0.00005863655,0.00018430094,0.000015405729,0.00008093767,0.00016356207,0.00030334582,3.2916137e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000553554,0.000008453732,0.00080756476,0.00003143431,0.000025713884,0.0000058728438,0.00033030022,0.4149804,6.1441256e-7,0.09143818,0.0014612384,0.4909047],"study_design_scores_gemma":[0.00020059425,0.000005764021,0.012767132,0.00008498717,0.0000061533065,0.000001730708,0.00015497538,0.98183763,0.000028122793,0.0023259737,0.002426966,0.00015996804],"about_ca_topic_score_codex":0.6495607,"about_ca_topic_score_gemma":0.98604006,"teacher_disagreement_score":0.90704596,"about_ca_system_score_codex":0.0001367953,"about_ca_system_score_gemma":0.0024280364,"threshold_uncertainty_score":0.43072322},"labels":[],"label_agreement":null},{"id":"W4247306048","doi":"10.1109/inm.2003.1194161","title":"Tariff-based pricing and admission control for DiffServ networks","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Tariff; Admission control; Quality of service; Pricing strategies; Architecture; Computer science; Computer network; Differentiated services; Control (management); Business; Operations research; Marketing; Engineering; Artificial intelligence","score_opus":0.007609018968417628,"score_gpt":0.2077828040144327,"score_spread":0.20017378504601507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247306048","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016921365,0.00037108816,0.9948815,0.0014269379,0.0002692414,0.00034818158,3.5407936e-7,0.0001707373,0.0008398011],"genre_scores_gemma":[0.96670526,0.0000060428542,0.030169882,0.0025535503,0.000064797154,0.000045809422,8.9493113e-7,0.000006880109,0.00044685972],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991315,0.000060891387,0.0001594864,0.00028968303,0.00009766992,0.00026079392],"domain_scores_gemma":[0.99915516,0.0003627954,0.00005169302,0.00022527721,0.000054730306,0.00015033325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002928803,0.00011524066,0.00014872506,0.000035223286,0.00016718995,0.00010718444,0.00018222332,0.0000682546,0.000018708934],"category_scores_gemma":[0.000056550653,0.00009067416,0.000048765796,0.00012156118,0.000018224406,0.00013230229,0.000014018029,0.00007636915,0.0000021818937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057644418,0.00008808077,0.002441182,0.000015084023,0.000028234434,0.0000042800084,0.000039490173,0.047832936,0.00010750038,0.46856466,0.0038193404,0.47700158],"study_design_scores_gemma":[0.0020557572,0.00008810043,0.00043839862,0.00001330702,0.0000099926565,0.000002991742,0.000004299046,0.9827417,0.000050620416,0.0008253491,0.013640179,0.00012928178],"about_ca_topic_score_codex":0.0000026907403,"about_ca_topic_score_gemma":0.000004786265,"teacher_disagreement_score":0.96501315,"about_ca_system_score_codex":0.000012687214,"about_ca_system_score_gemma":0.00004950859,"threshold_uncertainty_score":0.36975852},"labels":[],"label_agreement":null},{"id":"W4247626332","doi":"10.32920/ryerson.14668122.v1","title":"The transformation of network neutrality in Canada","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Toronto Metropolitan University; McMaster University; York University","funders":"","keywords":"Net neutrality; Internet transit; Computer science; The Internet; Network management; Deep packet inspection; Internet access; Internet traffic; Network packet; Computer network; Bandwidth management; Broadband; Telecommunications; Computer security; Bandwidth (computing); World Wide Web","score_opus":0.010323058838145644,"score_gpt":0.20418874794206013,"score_spread":0.1938656891039145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247626332","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09152726,0.0022810495,0.88077474,0.012760333,0.0037038291,0.00059618196,0.000003571815,0.00007067529,0.008282388],"genre_scores_gemma":[0.9985732,0.00017805716,0.00086552027,0.00024713678,0.000054522294,0.00002283987,0.0000046536047,0.0000023432224,0.000051725103],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883837,0.00014436043,0.00039151803,0.00019735139,0.00022112808,0.00020728064],"domain_scores_gemma":[0.99910027,0.00018897557,0.000112091184,0.00048371573,0.00007760083,0.00003736625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003976437,0.000102118574,0.00019276609,0.000011661703,0.00005057986,0.000088810135,0.0007530943,0.00006134766,0.000007650247],"category_scores_gemma":[0.0000060015677,0.00007430883,0.00005863655,0.00018430094,0.000015405729,0.00008093767,0.00016356207,0.00030334582,3.2916137e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000553554,0.000008453732,0.00080756476,0.00003143431,0.000025713884,0.0000058728438,0.00033030022,0.4149804,6.1441256e-7,0.09143818,0.0014612384,0.4909047],"study_design_scores_gemma":[0.00020059425,0.000005764021,0.012767132,0.00008498717,0.0000061533065,0.000001730708,0.00015497538,0.98183763,0.000028122793,0.0023259737,0.002426966,0.00015996804],"about_ca_topic_score_codex":0.6495607,"about_ca_topic_score_gemma":0.98604006,"teacher_disagreement_score":0.90704596,"about_ca_system_score_codex":0.0001367953,"about_ca_system_score_gemma":0.0024280364,"threshold_uncertainty_score":0.43072322},"labels":[],"label_agreement":null},{"id":"W4248634712","doi":"10.1109/iscas.2014.6865610","title":"Deflection routing in complex networks","year":2014,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Deflection routing; Computer science; Network topology; Deflection (physics); Reinforcement learning; Scalability; Distributed computing; Computer network; Hierarchical routing; Static routing; The Internet; Routing protocol; Topology (electrical circuits); Routing (electronic design automation); Artificial intelligence; Engineering; Physics","score_opus":0.01317685002811909,"score_gpt":0.22244572466834056,"score_spread":0.20926887464022148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248634712","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029126029,0.000010476518,0.97182333,0.0007174957,0.00020025209,0.000051338196,9.336268e-9,0.00020493359,0.024079582],"genre_scores_gemma":[0.98946744,0.000002074142,0.00915516,0.0009930155,0.0001408123,0.000005431403,5.5169755e-7,0.0000028228108,0.00023269658],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935246,0.00006926026,0.00013078791,0.00018080967,0.00007554772,0.0001911227],"domain_scores_gemma":[0.99965054,0.00008909858,0.000028769644,0.00017539907,0.000017356291,0.000038816066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029598022,0.00005941732,0.00008199726,0.000040863986,0.00005622391,0.00007285232,0.00024043409,0.000033969165,0.000022298944],"category_scores_gemma":[0.000013257201,0.000054335425,0.000022711924,0.0002628121,0.000009479079,0.00013999235,0.000046645477,0.00008728865,0.000032037635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015282253,0.0000106987745,0.0030852004,4.0200547e-7,0.0000014588778,6.0512195e-7,0.000026541062,0.027683852,0.000012109935,0.3118532,0.0008676403,0.65645677],"study_design_scores_gemma":[0.00024244258,0.000019372017,0.0122862235,0.0000035395415,6.605453e-7,0.0000032100647,0.0000033734614,0.983564,0.0000029601235,0.00085334637,0.0029516043,0.00006925415],"about_ca_topic_score_codex":0.00003417332,"about_ca_topic_score_gemma":0.0001734779,"teacher_disagreement_score":0.98655486,"about_ca_system_score_codex":0.000017913522,"about_ca_system_score_gemma":0.000006843924,"threshold_uncertainty_score":0.22157343},"labels":[],"label_agreement":null},{"id":"W4249093509","doi":"10.1145/2637364.2592006","title":"On the relevance of adversarial queueing theory in practice","year":2014,"lang":"en","type":"article","venue":"ACM SIGMETRICS Performance Evaluation Review","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Queueing theory; Adversarial system; Robustness (evolution); Queue; Scheduling (production processes); Synchronization (alternating current); Computer network; Mathematical optimization; Mathematics; Artificial intelligence","score_opus":0.031021484522513756,"score_gpt":0.3047774683118247,"score_spread":0.27375598378931093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249093509","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05438366,0.19262682,0.6512976,0.04553311,0.0037355064,0.006388098,0.00000206685,0.00028303967,0.045750078],"genre_scores_gemma":[0.95648086,0.033516124,0.0039591575,0.0057988223,0.000084231804,0.00011348324,0.0000016322476,0.0000072083953,0.000038453723],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99683213,0.0012700208,0.0005087911,0.00028360347,0.00091731746,0.00018813221],"domain_scores_gemma":[0.98948675,0.008437549,0.00045331003,0.0011079831,0.00047965362,0.000034773348],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.016590597,0.00012584441,0.0002502739,0.00017605546,0.00009049817,0.000032446227,0.0011229021,0.000045432476,0.00005111155],"category_scores_gemma":[0.03639729,0.00008725192,0.00006290018,0.0021851603,0.000036595866,0.0005715669,0.00012018909,0.00024752028,0.00008331564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012695919,0.00002994936,0.000064123626,0.00007771515,0.000007767427,1.5178888e-7,0.000048823476,0.003166673,0.000002005612,0.16401137,0.00058812374,0.8319906],"study_design_scores_gemma":[0.00093785144,0.00026421805,0.0014205424,0.0022634363,0.000109979046,0.0000044570616,0.000014490893,0.9511994,0.000050535786,0.0069671585,0.03654043,0.00022747942],"about_ca_topic_score_codex":0.0000024106114,"about_ca_topic_score_gemma":0.0000010882939,"teacher_disagreement_score":0.94803274,"about_ca_system_score_codex":0.000071818184,"about_ca_system_score_gemma":0.00014607715,"threshold_uncertainty_score":0.97171956},"labels":[],"label_agreement":null},{"id":"W4249329879","doi":"10.1109/pads.2003.1207430","title":"Hybrid packet/fluid flow network simulation","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Georgia Institute of Technology","keywords":"Computer science; Network packet; Jitter; Emulation; Latency (audio); Traffic generation model; Network traffic control; Computer network; Speedup; Network traffic simulation; Real-time computing; Distributed computing; Parallel computing","score_opus":0.010222227202287035,"score_gpt":0.22049021811086722,"score_spread":0.21026799090858017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249329879","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040696785,0.00014563977,0.98830265,0.0017226713,0.0006110913,0.000120843964,3.5226435e-7,0.00048984087,0.0045372397],"genre_scores_gemma":[0.94962364,0.000008074061,0.04789196,0.0015515607,0.00047089174,0.000007377627,0.0000025703102,0.000006255793,0.00043763657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904984,0.000029010664,0.00016932741,0.00027356416,0.00018926208,0.00028897074],"domain_scores_gemma":[0.9993473,0.0000869371,0.000036916335,0.0003682605,0.000063008585,0.000097531265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016645258,0.000108897686,0.000110562265,0.000026543636,0.00012805355,0.00011915935,0.00037058833,0.00003161986,0.00005731007],"category_scores_gemma":[0.0000134560405,0.00009574041,0.000059036614,0.00019265649,0.000018645731,0.0003277473,0.00006514564,0.00007692686,0.00033934182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027962822,0.000012498438,0.000018296925,5.7148424e-7,0.000005217366,0.0000067699916,0.000016746662,0.7005345,0.0000029433259,0.068263665,0.0013481717,0.22978778],"study_design_scores_gemma":[0.00052323216,0.00003926303,0.00018003643,0.00000890136,0.0000036865792,0.0000069038592,0.0000012717893,0.97124267,0.000038724793,0.017594015,0.010228161,0.0001331202],"about_ca_topic_score_codex":0.0000050945705,"about_ca_topic_score_gemma":0.000006443271,"teacher_disagreement_score":0.945554,"about_ca_system_score_codex":0.000034245186,"about_ca_system_score_gemma":0.00005858083,"threshold_uncertainty_score":0.43616655},"labels":[],"label_agreement":null},{"id":"W4249822786","doi":"10.1145/500213.500232","title":"Preemptive bandwidth allocation protocol for multicast, multi-streams environments","year":2001,"lang":"en","type":"article","venue":"Proceedings of the ninth ACM international conference on Multimedia - MULTIMEDIA '01","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Multicast; Computer network; Distributed computing; Bandwidth (computing); Quality of service; Bandwidth allocation; Dynamic bandwidth allocation","score_opus":0.061406751109613765,"score_gpt":0.3206525673007922,"score_spread":0.2592458161911785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249822786","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055557705,0.0000690885,0.4286498,0.056115516,0.010887777,0.42478928,0.0005131347,0.001928948,0.021488745],"genre_scores_gemma":[0.6623374,0.000034637535,0.21953836,0.00054018345,0.0007607202,0.113117024,0.0000339244,0.000073342075,0.003564401],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99659204,0.000037853693,0.0007856361,0.0009462993,0.0010560973,0.00058206054],"domain_scores_gemma":[0.997158,0.00051834714,0.00080847373,0.0005730286,0.0006764665,0.00026566524],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050779415,0.00049946643,0.00042452788,0.00022288499,0.00021599542,0.0002194605,0.0038323374,0.00022775024,0.0002232024],"category_scores_gemma":[0.0015853398,0.00038737463,0.00027511368,0.0002841573,0.00033136952,0.000785276,0.0006329178,0.00042904326,0.000088494955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019951928,0.0028733546,0.014275926,0.00011161702,0.00050177553,0.0000047084936,0.0037015434,0.0005740637,0.029839288,0.017407978,0.005070461,0.92364407],"study_design_scores_gemma":[0.0070130685,0.00029149055,0.0057382197,0.00030940698,0.00003625134,0.000009674605,0.0001713097,0.9625385,0.012967188,0.00078375987,0.009676354,0.00046477112],"about_ca_topic_score_codex":0.000028221222,"about_ca_topic_score_gemma":0.000013927031,"teacher_disagreement_score":0.9619644,"about_ca_system_score_codex":0.00020007636,"about_ca_system_score_gemma":0.00013921117,"threshold_uncertainty_score":0.99985784},"labels":[],"label_agreement":null},{"id":"W4250341926","doi":"10.22215/etd/2005-08373","title":"A proportional congestion control solution for real-time traffic","year":2005,"lang":"en","type":"dissertation","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Canadian Heritage; Library and Archives Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science","score_opus":0.007837692459403179,"score_gpt":0.2401959276024348,"score_spread":0.2323582351430316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250341926","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01081313,0.00073661044,0.93961775,0.0052762846,0.0040499885,0.005334097,0.00007843798,0.0028301917,0.031263504],"genre_scores_gemma":[0.7800038,0.00022081635,0.05204354,0.00068954774,0.0032851053,0.0023982127,0.0035570627,0.00012155188,0.15768039],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974981,0.000079686135,0.0006416899,0.0007940764,0.0004908532,0.00049559947],"domain_scores_gemma":[0.99818516,0.00023107776,0.00044341895,0.00042715494,0.0005535362,0.00015968352],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046134024,0.00040329565,0.0004912893,0.00019881604,0.00026475318,0.00020725868,0.0006132393,0.00047354054,0.00018683988],"category_scores_gemma":[0.000055560435,0.00038572878,0.00030052647,0.00020752307,0.00003084612,0.00042485943,0.000012683084,0.00023330784,0.0002510129],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030211575,0.00017531551,0.0000026784187,0.000056495748,0.0001305666,0.0000035239862,0.0001317388,0.0043978724,0.0006012677,0.06921742,0.02400667,0.90097433],"study_design_scores_gemma":[0.0023889705,0.0002410756,0.0005735966,0.000086369415,0.00013499442,0.00001254372,0.000019690184,0.98445034,0.000036205103,0.00048409624,0.010985285,0.0005868282],"about_ca_topic_score_codex":0.0000070240153,"about_ca_topic_score_gemma":0.00017337126,"teacher_disagreement_score":0.9800525,"about_ca_system_score_codex":0.00014553475,"about_ca_system_score_gemma":0.0005609188,"threshold_uncertainty_score":0.99985945},"labels":[],"label_agreement":null},{"id":"W4251839725","doi":"10.1007/3-540-45139-0_17","title":"Modeling and verifying a price model for congestion control in computer networks using promela/spin","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Promela; Computer science; Network packet; Network congestion; Convergence (economics); Enforcement; Model checking; Computer network; Distributed computing; Theoretical computer science","score_opus":0.025443230262340966,"score_gpt":0.24967872851485948,"score_spread":0.2242354982525185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251839725","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006967185,0.0010472022,0.99512196,0.00043707044,0.0010455246,0.0014078481,0.0000042259708,0.000169431,0.000070034825],"genre_scores_gemma":[0.6354019,0.00007346398,0.3625853,0.0012283301,0.00059292535,0.000042031847,0.000003793944,0.000042783806,0.000029429646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957283,0.000058823833,0.0008050318,0.001820031,0.0005861367,0.0010016336],"domain_scores_gemma":[0.9978985,0.0005013199,0.000292803,0.0007630308,0.0003203817,0.00022391637],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001323263,0.00066497293,0.00084587646,0.000743744,0.00032907416,0.0006441402,0.0014371201,0.0005213617,0.000002114179],"category_scores_gemma":[0.000041651972,0.0006685873,0.00013134559,0.00052848057,0.0003143202,0.00078303175,0.0005041754,0.00092271826,0.0000015898542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022011494,0.000015337268,0.000020591948,0.000021982856,0.000008756005,0.000018145178,0.00017197113,0.63990885,0.000007787488,0.0045628683,0.0000014902603,0.35524023],"study_design_scores_gemma":[0.0014684105,0.00013244263,0.00000941837,0.0006697084,0.000020811814,0.00007502296,1.3315298e-7,0.97786605,0.0000015333876,0.019014243,0.00004520033,0.00069704436],"about_ca_topic_score_codex":0.000026242726,"about_ca_topic_score_gemma":0.00010729087,"teacher_disagreement_score":0.6347052,"about_ca_system_score_codex":0.00038272116,"about_ca_system_score_gemma":0.0004998624,"threshold_uncertainty_score":0.9995765},"labels":[],"label_agreement":null},{"id":"W4253388873","doi":"10.1145/964725.633048","title":"Route oscillations in I-BGP with route reflection","year":2002,"lang":"en","type":"article","venue":"ACM SIGCOMM Computer Communication Review","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Border Gateway Protocol; Computer science; Default-free zone; Reflection (computer programming); Protocol (science); Computer network; Routing (electronic design automation); Routing protocol; Distributed computing; Static routing","score_opus":0.03686506544077125,"score_gpt":0.25991397008201556,"score_spread":0.2230489046412443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253388873","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012048524,0.12865579,0.7678427,0.0887833,0.00038314285,0.0017304783,0.0000035036137,0.0009798845,0.01041634],"genre_scores_gemma":[0.6013922,0.097297914,0.28703368,0.013118585,0.0001460208,0.0003192387,0.000038150374,0.000037988553,0.000616229],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976509,0.0006647178,0.00062228047,0.00044064844,0.0003098353,0.00031156925],"domain_scores_gemma":[0.99530643,0.00047643954,0.00028862795,0.0036259813,0.00019234799,0.00011015469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005955788,0.0002509269,0.00043003264,0.00015174852,0.00026765474,0.00018451862,0.002889899,0.00007318367,0.000070693924],"category_scores_gemma":[0.00005266821,0.00022055155,0.00010010945,0.0013337312,0.0000617457,0.00074949866,0.00067141076,0.00041563017,0.00020224665],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002987248,0.00014736752,0.0016168884,0.00009713767,0.000031698713,0.000005153297,0.00025196327,0.0013469973,0.0000019427694,0.022497341,0.01307192,0.9609286],"study_design_scores_gemma":[0.0011369996,0.00015882184,0.0061648097,0.003017824,0.00004607071,0.00009710774,0.000005026772,0.5629097,0.000002204037,0.001088044,0.42478976,0.0005836126],"about_ca_topic_score_codex":0.000039110946,"about_ca_topic_score_gemma":0.00016715759,"teacher_disagreement_score":0.960345,"about_ca_system_score_codex":0.00012519398,"about_ca_system_score_gemma":0.000038518778,"threshold_uncertainty_score":0.8993831},"labels":[],"label_agreement":null},{"id":"W4254142471","doi":"10.24124/2016/bpgub1146","title":"Prediction and preemptive control of network congestion in distributed real-time environment","year":2016,"lang":"en","type":"dissertation","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Computer science; Network congestion; Network traffic control; Packet loss; Computer network; Explicit Congestion Notification; Routing protocol; Hierarchical routing; Distributed computing; Real-time computing; Network packet; Link-state routing protocol; TCP tuning","score_opus":0.004723724040074513,"score_gpt":0.18787973330268362,"score_spread":0.1831560092626091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254142471","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0704521,0.0018473729,0.90694475,0.0009408916,0.0016204466,0.0029356221,0.0003556787,0.0005016408,0.014401483],"genre_scores_gemma":[0.99417853,0.00096441153,0.00085767766,0.000021549644,0.00017925195,0.00013342011,0.00037213857,0.000016963242,0.003276044],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825215,0.0001590175,0.0005119993,0.0005141771,0.00028042146,0.00028223946],"domain_scores_gemma":[0.99888116,0.0002787933,0.0003507,0.00032929785,0.00007087973,0.00008917626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003426842,0.00025413366,0.00044228582,0.00009504102,0.000056238845,0.000034475364,0.00026734127,0.0002966009,0.00006833845],"category_scores_gemma":[0.00002145684,0.00021056,0.00006261561,0.00013347314,0.000049105518,0.00022447844,0.000030891806,0.00015614156,0.00002255129],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013633409,0.00037471013,0.011540746,0.0001621743,0.00046669767,0.000028655842,0.00081419037,0.01483672,0.0030129896,0.09496619,0.0039164503,0.86851716],"study_design_scores_gemma":[0.009937329,0.0011345666,0.40437344,0.0016710997,0.0002932439,0.000013545007,0.00010453185,0.5693743,0.000342058,0.009693632,0.0017856503,0.0012765964],"about_ca_topic_score_codex":0.000029830913,"about_ca_topic_score_gemma":0.000036146903,"teacher_disagreement_score":0.92372644,"about_ca_system_score_codex":0.00008401589,"about_ca_system_score_gemma":0.00007513065,"threshold_uncertainty_score":0.85863876},"labels":[],"label_agreement":null},{"id":"W4254227203","doi":"10.1145/3261684","title":"Session details: Network traffic characteristics and services","year":2010,"lang":"en","type":"article","venue":"ACM SIGMETRICS Performance Evaluation Review","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Session (web analytics); Computer science; Computer network; World Wide Web","score_opus":0.0244794771576786,"score_gpt":0.2851883118864095,"score_spread":0.26070883472873085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254227203","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.861343,0.11407666,0.015761493,0.0031898578,0.0027774528,0.0018701502,0.0000028380143,0.0004032648,0.0005752818],"genre_scores_gemma":[0.9004569,0.08419549,0.012163833,0.0025633574,0.00041534405,0.00012313203,0.00002567167,0.000013762837,0.00004249552],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99779487,0.00016301147,0.0005246719,0.00044251027,0.0007448222,0.00033011986],"domain_scores_gemma":[0.9976938,0.0003453334,0.0003456154,0.00097578985,0.0004881799,0.00015128296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036994047,0.00021459849,0.00036781823,0.00014298751,0.00028447562,0.0001902265,0.0009821744,0.000107033775,0.00011864189],"category_scores_gemma":[0.000525967,0.00018016172,0.00006082289,0.0016638853,0.000036950063,0.000791421,0.00023847914,0.0003645134,0.00011415897],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019334573,0.00001887733,0.0033255997,0.00037913278,0.000008943275,5.684563e-7,0.000020529173,0.00020313734,0.000009737967,0.0004572643,0.00063876814,0.9949355],"study_design_scores_gemma":[0.00041597942,0.00007294813,0.0332187,0.001000117,0.00011912739,0.000022136126,0.0000026213531,0.9218519,0.0000055501646,0.00012459236,0.04286935,0.0002970248],"about_ca_topic_score_codex":6.207159e-7,"about_ca_topic_score_gemma":0.0000036791803,"teacher_disagreement_score":0.9946385,"about_ca_system_score_codex":0.000026913955,"about_ca_system_score_gemma":0.00013456409,"threshold_uncertainty_score":0.7346782},"labels":[],"label_agreement":null},{"id":"W4254235863","doi":"10.1145/2490301.2451140","title":"Why you should care about quantile regression","year":2013,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Quantile regression; Variance (accounting); Quantile; Property (philosophy); Field (mathematics); Regression analysis; Computer experiment; Regression; Data mining; Statistics; Machine learning; Simulation; Mathematics","score_opus":0.015172498167634654,"score_gpt":0.25094406846787726,"score_spread":0.2357715703002426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254235863","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016073935,0.001264998,0.9559143,0.022267535,0.0015665274,0.0008529929,0.0000036689535,0.0008732479,0.0011827551],"genre_scores_gemma":[0.67494714,0.00006160362,0.29900476,0.023121594,0.0021794492,0.00022354179,0.000030894018,0.00006683185,0.00036418787],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965846,0.00030564907,0.00046793037,0.0010560956,0.00072399277,0.00086171983],"domain_scores_gemma":[0.99634093,0.0005199133,0.0001553524,0.002291958,0.0002774754,0.0004143992],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016034454,0.00048709393,0.00046213617,0.00024832838,0.00034494846,0.000576615,0.0035133664,0.00019962064,0.00012745653],"category_scores_gemma":[0.000062539606,0.00036594,0.00025458838,0.000533883,0.00011706309,0.00043639875,0.001434421,0.000768809,0.00030396253],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011118615,0.00003891499,0.0004316855,0.000023970999,0.00002954522,0.000023856212,0.0020278676,0.0032653804,0.0001890139,0.0015475155,0.074055545,0.9183556],"study_design_scores_gemma":[0.0024358165,0.0007913302,0.0060023763,0.00038299634,0.000035534675,0.00016750908,0.00011671949,0.29138994,0.00049106893,0.012170627,0.6845008,0.0015152692],"about_ca_topic_score_codex":0.0002386763,"about_ca_topic_score_gemma":0.000117590105,"teacher_disagreement_score":0.9168403,"about_ca_system_score_codex":0.000053896292,"about_ca_system_score_gemma":0.00011264491,"threshold_uncertainty_score":0.99987924},"labels":[],"label_agreement":null},{"id":"W4254804027","doi":"10.22215/etd/2007-07819","title":"Voice traffic protection in an IP network","year":2007,"lang":"en","type":"dissertation","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Canadian Heritage","funders":"","keywords":"Computer science; Humanities; Art","score_opus":0.015374579658373154,"score_gpt":0.2692623889572899,"score_spread":0.25388780929891674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254804027","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2908477,0.0015894803,0.6573785,0.00058642053,0.010188669,0.0030336913,0.0000016295425,0.002366196,0.034007717],"genre_scores_gemma":[0.9727147,0.000038765327,0.008985414,0.00041930054,0.0014387027,0.00022322134,0.00017489615,0.000044924713,0.015960062],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799806,0.00011353049,0.00042519253,0.00064653094,0.00033634715,0.00048031457],"domain_scores_gemma":[0.99904484,0.000054998545,0.00017035691,0.0004804886,0.00012594495,0.00012339297],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000578277,0.00028005595,0.00028876585,0.00022970996,0.00011370868,0.00019738017,0.0007237545,0.00042216902,0.000039644885],"category_scores_gemma":[0.000011749328,0.00027626826,0.00008310392,0.00084228785,0.000010906367,0.0004500717,0.00001741369,0.00056028157,0.00015659643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005953512,0.000075549666,0.000015100296,0.000018607758,0.000009869578,0.000012916968,0.00032354318,0.028813591,0.000011116522,0.007077875,0.00080507505,0.9627772],"study_design_scores_gemma":[0.00084776036,0.00029226235,0.0059843436,0.00020867848,0.000018450573,0.000007745858,0.00020255205,0.9783662,0.000030802716,0.00063589314,0.012600369,0.0008049253],"about_ca_topic_score_codex":0.0000411008,"about_ca_topic_score_gemma":0.0064694867,"teacher_disagreement_score":0.9619723,"about_ca_system_score_codex":0.000074423406,"about_ca_system_score_gemma":0.00015672408,"threshold_uncertainty_score":0.99996895},"labels":[],"label_agreement":null},{"id":"W4256131189","doi":"10.1145/2964791.2901487","title":"Network Calculus Analysis of a Feedback System with Random Service","year":2016,"lang":"en","type":"article","venue":"ACM SIGMETRICS Performance Evaluation Review","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Network calculus; Computer science; Service (business); Extension (predicate logic); Feedback control; Distributed computing; Calculus (dental); Theoretical computer science; Computer network; Control engineering; Quality of service; Engineering","score_opus":0.03302812604553042,"score_gpt":0.2696644633861825,"score_spread":0.2366363373406521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256131189","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017995495,0.08385691,0.89136857,0.0031814238,0.00053874863,0.0018208859,0.0000056306385,0.00021483841,0.0010175128],"genre_scores_gemma":[0.97745204,0.016077004,0.0046712793,0.0013597435,0.00012679341,0.00022363444,0.000010604336,0.000011632448,0.00006725817],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969802,0.00037084921,0.0007091115,0.00043206156,0.0011929473,0.00031484966],"domain_scores_gemma":[0.994786,0.0007913356,0.00060967176,0.0014010684,0.0023065826,0.00010529885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004487145,0.00020348167,0.00075318676,0.00040324187,0.00011406504,0.00003934372,0.0011458722,0.000059896545,0.000087084416],"category_scores_gemma":[0.00073678285,0.00011885774,0.00015544824,0.012828964,0.000029590688,0.00049336534,0.0001434779,0.00008044877,0.00008983495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003402087,0.000024746072,0.0033355206,0.00059416925,0.00044420423,6.9044387e-7,0.000022599732,0.022488032,0.000002588048,0.0019810619,0.0014392055,0.96963316],"study_design_scores_gemma":[0.002293516,0.00012934025,0.009442332,0.0034932785,0.0025464706,0.0000046308996,0.000004574232,0.978095,0.000009337775,0.000011663702,0.0037031032,0.0002667338],"about_ca_topic_score_codex":0.000006848735,"about_ca_topic_score_gemma":0.000012504869,"teacher_disagreement_score":0.96936643,"about_ca_system_score_codex":0.00013846977,"about_ca_system_score_gemma":0.00023509744,"threshold_uncertainty_score":0.6163892},"labels":[],"label_agreement":null},{"id":"W4281694763","doi":"10.1145/3543146.3543170","title":"Correlation-Aware Flow Consolidation for Load Balancing and Beyond","year":2022,"lang":"en","type":"article","venue":"ACM SIGMETRICS Performance Evaluation Review","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Consolidation (business); Uncorrelated; Percentile; Computer science; Load balancing (electrical power); Correlation; Flow (mathematics); Econometrics; Mathematics; Statistics; Economics","score_opus":0.03244279118129651,"score_gpt":0.2907942979518791,"score_spread":0.2583515067705826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281694763","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005150673,0.119682476,0.86344755,0.0056737545,0.001688887,0.0034087147,0.000020632504,0.00018959279,0.000737734],"genre_scores_gemma":[0.9375594,0.0292414,0.023546422,0.0067590033,0.00017839244,0.0021683057,0.0002076754,0.0000227847,0.00031657136],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977754,0.0002083397,0.00044177708,0.00039019118,0.00096850964,0.00021579157],"domain_scores_gemma":[0.9977316,0.00066824345,0.00029543,0.0005652315,0.0006693707,0.00007009266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004601185,0.00014199657,0.0002478387,0.00018214951,0.0005892981,0.00008291431,0.0005509345,0.000033382395,0.00018188464],"category_scores_gemma":[0.0013618773,0.00014498924,0.00006320823,0.0015184999,0.00001906098,0.00056175963,0.00024269271,0.00016675914,0.000021493306],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045735064,0.000017612861,0.00065730466,0.00017850999,0.000011498389,1.8519792e-7,0.00007283983,0.017085504,0.0000014916623,0.0011254292,0.007109529,0.9737355],"study_design_scores_gemma":[0.00072242884,0.00013077044,0.0007877965,0.000113365604,0.00008187053,0.000013635387,0.00001285023,0.9540696,0.0000032028893,0.0002975042,0.043596245,0.0001706987],"about_ca_topic_score_codex":8.918148e-7,"about_ca_topic_score_gemma":7.536032e-7,"teacher_disagreement_score":0.9735648,"about_ca_system_score_codex":0.00024273913,"about_ca_system_score_gemma":0.00039846043,"threshold_uncertainty_score":0.591249},"labels":[],"label_agreement":null},{"id":"W4281767233","doi":"10.1109/noms54207.2022.9789762","title":"On Minimizing TCP Retransmission Delay in Softwarized Networks","year":2022,"lang":"en","type":"article","venue":"NOMS 2022-2022 IEEE/IFIP Network Operations and Management Symposium","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer network; Retransmission; Computer science; Network packet; TCP global synchronization; End-to-end delay; Transmission delay; Transmission Control Protocol; TCP Friendly Rate Control; TCP acceleration; Processing delay; Packet loss; Cache; Zeta-TCP; Real-time computing","score_opus":0.005962691807962288,"score_gpt":0.20312963896404745,"score_spread":0.19716694715608515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281767233","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006941996,0.0020090307,0.9718082,0.0064182975,0.004667007,0.0018711807,0.000009898234,0.0004508467,0.0058235237],"genre_scores_gemma":[0.9547663,0.0051426836,0.01733093,0.008295179,0.00087416917,0.0022301394,0.000145937,0.00009255431,0.011122118],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99653596,0.00045883868,0.00063957827,0.0010465333,0.00057058764,0.00074849353],"domain_scores_gemma":[0.9986952,0.00019793729,0.00010846765,0.0007614442,0.000041333064,0.00019562051],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.001145374,0.00037512268,0.0003872983,0.00031484137,0.0015645011,0.0003010032,0.0008583682,0.000098040255,0.00022878562],"category_scores_gemma":[0.000005082411,0.00039278326,0.00012479065,0.0014423024,0.000052384865,0.00038683496,0.0005145083,0.00067599583,0.000014108738],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088901594,0.00018178578,0.00014178349,0.00001253308,0.000074482494,0.000104163504,0.0002597474,0.866745,0.000038679013,0.060883816,0.032242257,0.039226845],"study_design_scores_gemma":[0.001805095,0.00024727613,0.00020549177,0.00005524912,0.00004977897,0.0000173825,0.00010003288,0.94033015,0.0000026042985,0.00046682512,0.05625599,0.00046413852],"about_ca_topic_score_codex":0.000029253913,"about_ca_topic_score_gemma":0.00007882669,"teacher_disagreement_score":0.9544773,"about_ca_system_score_codex":0.00018196832,"about_ca_system_score_gemma":0.00005637005,"threshold_uncertainty_score":0.9998524},"labels":[],"label_agreement":null},{"id":"W4285307446","doi":"10.1109/tnse.2022.3185253","title":"Pareto: Fair Congestion Control With Online Reinforcement Learning","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada); University of Toronto","funders":"","keywords":"Reinforcement learning; Computer science; Pareto principle; Heuristics; Network congestion; Variety (cybernetics); Artificial intelligence; Flow control (data); Machine learning; Distributed computing; Memetics; Mathematical optimization; Computer network; Network packet","score_opus":0.005640305181627298,"score_gpt":0.18160569013900518,"score_spread":0.17596538495737787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285307446","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016843092,0.000091940754,0.98130727,0.00048383753,0.00065971626,0.00019571767,0.0000014481702,0.00031803784,0.00009894171],"genre_scores_gemma":[0.99696934,0.00003597696,0.0023330324,0.00034464605,0.000081969825,0.00009828484,8.6786815e-7,0.000010286854,0.00012561388],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983459,0.000033074622,0.00017591545,0.00039798513,0.0005932351,0.00045387706],"domain_scores_gemma":[0.99935895,0.000113024966,0.000053518757,0.00023089319,0.00008875836,0.0001548438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060498907,0.00015963479,0.00015180135,0.00015470624,0.0010843229,0.00014468166,0.00040979745,0.0000247877,0.000016542079],"category_scores_gemma":[0.0000050665803,0.0001495859,0.000030556097,0.0011348511,0.00008774506,0.0004362753,0.000008061694,0.0004760162,0.0000026165114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022247184,0.00002083569,0.000020890744,0.0000027691467,0.000013231445,0.0000066066204,0.00008741149,0.9323068,0.00012563601,0.0014532515,0.000036920614,0.06590337],"study_design_scores_gemma":[0.00064131117,0.00038338362,0.00022703016,0.000023230965,0.000014676081,0.000044024782,0.000053196403,0.9953162,0.000035715835,0.000009396614,0.003054247,0.00019755754],"about_ca_topic_score_codex":0.000007831379,"about_ca_topic_score_gemma":0.000007010898,"teacher_disagreement_score":0.9801262,"about_ca_system_score_codex":0.0001229052,"about_ca_system_score_gemma":0.00014906576,"threshold_uncertainty_score":0.83398443},"labels":[],"label_agreement":null},{"id":"W4285789900","doi":"10.48550/arxiv.1909.08386","title":"Intelligent Active Queue Management Using Explicit Congestion\\n Notification","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Active queue management; Network congestion; Explicit Congestion Notification; Computer science; Computer network; Random early detection; Queue; Transport layer; Layer (electronics); Network packet; Slow-start","score_opus":0.08664444519132984,"score_gpt":0.19869319073125677,"score_spread":0.11204874553992693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285789900","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07657471,0.00006434303,0.91821325,0.00016001124,0.0014162168,0.0007023397,0.000008599613,0.00027752217,0.0025829873],"genre_scores_gemma":[0.99462104,0.00026274266,0.0024781693,0.00013646117,0.00010860343,0.000003844294,0.00002287546,0.000019348568,0.0023468928],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784756,0.00015967397,0.00024973697,0.0012606671,0.00013496421,0.00034739068],"domain_scores_gemma":[0.9977919,0.00010089455,0.0003429236,0.0013899616,0.00023071836,0.00014363727],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021517457,0.0003390027,0.00032109238,0.00028059207,0.00015347174,0.00016570832,0.0015516529,0.000266164,0.00003349213],"category_scores_gemma":[0.000009009769,0.00041036573,0.00018918734,0.00046996315,0.00005464232,0.00035751125,0.0012148033,0.0004989215,0.0002681175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027590146,0.00006434943,0.0001478781,0.00003899087,0.00013090968,0.00005508876,0.00012561242,0.64918494,0.000009563647,0.3254716,0.00009726477,0.0246462],"study_design_scores_gemma":[0.0003599163,0.000025528858,0.00044119117,0.00013969794,0.00012284525,0.0000031652125,0.00015639004,0.9893862,0.00008110962,0.007747576,0.001093413,0.000442951],"about_ca_topic_score_codex":0.00006400479,"about_ca_topic_score_gemma":0.000014886617,"teacher_disagreement_score":0.91804636,"about_ca_system_score_codex":0.00054342294,"about_ca_system_score_gemma":0.0001698053,"threshold_uncertainty_score":0.99983484},"labels":[],"label_agreement":null},{"id":"W4290991029","doi":"10.1145/3544216.3544248","title":"DeepQueueNet","year":2022,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Chinese University of Hong Kong; National Natural Science Foundation of China","keywords":"Computer science; Scalability; Discrete event simulation; Estimator; Speedup; Visibility; Network topology; Queueing theory; Distributed computing; Artificial intelligence; Computer engineering; Simulation; Computer network; Parallel computing","score_opus":0.004937365578942918,"score_gpt":0.17513488364743443,"score_spread":0.1701975180684915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4290991029","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020357154,0.000112383306,0.95049495,0.0038104285,0.00043694017,0.000050996267,3.1189643e-7,0.00034128566,0.042716987],"genre_scores_gemma":[0.98625153,0.0000010026174,0.0063949213,0.002754031,0.000030724266,0.000030948177,4.479438e-7,0.0000016378065,0.004534777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958247,0.000034136083,0.000050159946,0.00011577021,0.00012265348,0.00009483724],"domain_scores_gemma":[0.9997424,0.000023542536,0.000011815132,0.00018433662,0.000008356296,0.0000295357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000101420635,0.000029276602,0.000033259315,0.000020389474,0.00014504376,0.000027878026,0.000436898,0.0000044136036,0.00055699795],"category_scores_gemma":[0.0000015899147,0.00002771751,0.000019282212,0.00015131863,0.000003260216,0.00006522007,0.00019371473,0.00005731308,0.000055510893],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.482027e-7,0.000011060132,0.00005577653,1.1656541e-7,0.000002174127,0.0000052615346,0.00003053588,0.0022032869,0.000008984301,0.65967774,0.01401904,0.32398525],"study_design_scores_gemma":[0.00021876577,0.000052797775,0.00019777767,1.9086087e-7,0.0000010168652,0.000023940585,0.00002178896,0.59549594,0.000018019464,0.0046322467,0.39925086,0.00008667028],"about_ca_topic_score_codex":0.0000035886687,"about_ca_topic_score_gemma":0.0000016295229,"teacher_disagreement_score":0.9842158,"about_ca_system_score_codex":0.000013435274,"about_ca_system_score_gemma":0.000024129644,"threshold_uncertainty_score":0.6098737},"labels":[],"label_agreement":null},{"id":"W4292074852","doi":"10.1109/wowmom54355.2022.00042","title":"An In-depth Analysis of Subflow Degradation for Multi-path TCP on High Speed Rails","year":2022,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Natural Science Foundation of China; European Commission","keywords":"Computer science; Adaptability; Degradation (telecommunications); Handover; Path (computing); Throughput; Transmission (telecommunications); Quality of experience; Computer network; Speedup; Real-time computing; Telecommunications; Wireless; Quality of service; Operating system","score_opus":0.03060163261111944,"score_gpt":0.2765034107997165,"score_spread":0.24590177818859707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292074852","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2234365,0.0000140655975,0.7755056,0.0003933019,0.00017346436,0.00023947193,0.0000100809375,0.000076349505,0.00015114668],"genre_scores_gemma":[0.97147095,0.0000017758648,0.02769485,0.00033461564,0.00001757422,0.000037487647,0.00003859516,0.0000045927163,0.0003995316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989494,0.00011054159,0.0002374764,0.00031113272,0.0002306307,0.00016080006],"domain_scores_gemma":[0.99930507,0.00012534221,0.00009595442,0.0003680457,0.000056480014,0.00004909383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004067158,0.000084305626,0.00021425048,0.00033733188,0.00008364425,0.00003332861,0.0004684376,0.000022508022,0.00008980499],"category_scores_gemma":[0.000013805489,0.00007886304,0.00010084561,0.0011280632,0.000011363433,0.00015880365,0.00004411853,0.000072118055,0.0000021693618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011437297,0.0007214613,0.006023504,0.000005758686,0.00021528345,0.000004950372,0.00044499844,0.43131477,0.00070651586,0.15342784,0.0005068751,0.40651366],"study_design_scores_gemma":[0.0009169692,0.00022256178,0.017532285,0.0000015550683,0.000050534432,2.5269756e-7,0.000059272912,0.9806644,0.00015884016,0.00010505915,0.00019438297,0.000093938055],"about_ca_topic_score_codex":0.000105670086,"about_ca_topic_score_gemma":0.00030329297,"teacher_disagreement_score":0.7480345,"about_ca_system_score_codex":0.000046512934,"about_ca_system_score_gemma":0.000043234206,"threshold_uncertainty_score":0.32159415},"labels":[],"label_agreement":null},{"id":"W4292342699","doi":"10.1145/3547115.3547195","title":"Priority-aware forward error correction for HTTP","year":2022,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; HOL; Blocking (statistics); Error detection and correction; Tree (set theory); Computer network; Forward error correction; Operating system; Programming language; Algorithm; Decoding methods","score_opus":0.01297187345178192,"score_gpt":0.24186313807514936,"score_spread":0.22889126462336745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292342699","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010820238,0.000040185118,0.98988456,0.0028738386,0.0035290804,0.0003256119,0.0000027976816,0.00037703413,0.0018848842],"genre_scores_gemma":[0.9752009,0.0000015612192,0.007166861,0.0013238026,0.00017476465,0.00032958153,0.00000607107,0.0000071248473,0.015789362],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992043,0.00004276756,0.00012364755,0.0002575433,0.00017870597,0.00019307446],"domain_scores_gemma":[0.9994933,0.00011306481,0.000045258883,0.00023861964,0.000055820594,0.00005396283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023776489,0.00007336766,0.00009406693,0.000044975703,0.00039540243,0.00005850461,0.0004118295,0.000019973806,0.00011827028],"category_scores_gemma":[0.000012550599,0.000071473245,0.00007732463,0.00021279181,0.000008874162,0.00015641071,0.00014338389,0.00010791207,0.00001922985],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024745148,0.00005502388,0.00012107135,0.0000032819778,0.0000137814295,0.0000021629796,0.00016207917,0.0052256584,0.000011765049,0.06668296,0.09316501,0.83453244],"study_design_scores_gemma":[0.00038356162,0.00014724654,0.0000913166,0.0000010025537,0.0000045606475,0.000011211224,0.000078362384,0.779652,0.00001751031,0.00076649006,0.21875547,0.00009127276],"about_ca_topic_score_codex":0.000009540515,"about_ca_topic_score_gemma":0.000017007631,"teacher_disagreement_score":0.9827177,"about_ca_system_score_codex":0.0000565953,"about_ca_system_score_gemma":0.000073148454,"threshold_uncertainty_score":0.30411556},"labels":[],"label_agreement":null},{"id":"W4311356504","doi":"10.18280/mmep.090521","title":"Design an Optimal Fractional Order PI Controller for Congestion Avoidance in Internet Routers","year":2022,"lang":"en","type":"article","venue":"Mathematical Modelling and Engineering Problems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Active queue management; Control theory (sociology); Queue; PID controller; Network congestion; Robustness (evolution); Computer science; Network packet; Controller (irrigation); Real-time computing; Engineering; Control engineering; Computer network; Control (management)","score_opus":0.0274469772357542,"score_gpt":0.21376481042615686,"score_spread":0.18631783319040265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311356504","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004779765,0.00015366486,0.99410075,0.00031948127,0.00012238664,0.00037248197,0.0000011142031,0.00013360984,0.000016761462],"genre_scores_gemma":[0.71242857,0.0000049615946,0.28698078,0.000051886956,0.00002728195,0.00039843883,0.000002302629,0.000011415883,0.000094333685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990254,0.000042206622,0.0002467127,0.00028828174,0.00015571529,0.00024169867],"domain_scores_gemma":[0.99940914,0.0003204315,0.00004185633,0.000117280964,0.00003691363,0.000074352865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006131643,0.0001298474,0.00019202883,0.00007883756,0.0000831672,0.000098113705,0.00020813703,0.000040084007,0.000011622638],"category_scores_gemma":[0.000020817646,0.00012976577,0.000027947566,0.00012470146,0.000012715667,0.00021408543,0.00005031009,0.00021382359,0.0000022731645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003601092,0.000061500825,0.0000014213259,0.00003111139,0.0000116309475,0.0000012492691,0.0005210676,0.95138794,0.000024881248,0.04088349,0.000019718022,0.0070199557],"study_design_scores_gemma":[0.00072791777,0.0001428155,0.0000026327498,0.00003747368,0.000006131816,0.000017307679,0.0000132057685,0.9917181,0.0000058961564,0.0067759054,0.00039792105,0.00015465087],"about_ca_topic_score_codex":0.0000029945254,"about_ca_topic_score_gemma":1.6388836e-7,"teacher_disagreement_score":0.7076488,"about_ca_system_score_codex":0.000042360425,"about_ca_system_score_gemma":0.000019447989,"threshold_uncertainty_score":0.52916944},"labels":[],"label_agreement":null},{"id":"W4323310521","doi":"10.5121/csit.2023.130401","title":"Measuring Performance of Web Protocol with Updated Transport Layer Techniques for Faster Web Browsing","year":2023,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of the Fraser Valley","funders":"University of Aberdeen","keywords":"Computer science; Transport layer; Transmission Control Protocol; Network congestion; Protocol stack; Computer network; The Internet; Internet protocol suite; TCP tuning; Window (computing); TCP Friendly Rate Control; Hypertext Transfer Protocol; Application layer; Layer (electronics); Operating system","score_opus":0.03074242348304658,"score_gpt":0.24632176704017267,"score_spread":0.2155793435571261,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323310521","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16907682,0.0000036173124,0.7620969,0.000983041,0.00010095749,0.056450814,0.000005850947,0.0027065123,0.008575521],"genre_scores_gemma":[0.95313436,9.96948e-7,0.021692833,0.00010192558,0.000045039553,0.023904018,0.0000024654403,0.000013799234,0.0011045608],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899685,0.000016516895,0.00023901039,0.00026228378,0.00022456415,0.00026075382],"domain_scores_gemma":[0.9994229,0.000029452702,0.00007624167,0.0002705413,0.00015296302,0.000047915928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031550816,0.00012443136,0.00017006473,0.00011269974,0.000078932935,0.000032903532,0.00036551896,0.00004807115,0.000016392843],"category_scores_gemma":[0.0000019928532,0.000091158,0.00004794629,0.00047506104,0.000031165862,0.00035225684,0.00002729658,0.00007291146,0.000009372034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007185803,0.00017206125,0.015028212,0.0004949925,0.00013520378,0.000016533764,0.0004885656,0.0038780198,0.02955492,0.008912128,0.0047993013,0.9358015],"study_design_scores_gemma":[0.0014753792,0.00041751258,0.0013552611,0.00017956084,0.000012270378,0.000008134011,0.000017193313,0.9391857,0.03148279,0.000030543324,0.025572998,0.00026269403],"about_ca_topic_score_codex":0.0000017301157,"about_ca_topic_score_gemma":0.000017999224,"teacher_disagreement_score":0.93553877,"about_ca_system_score_codex":0.000012047568,"about_ca_system_score_gemma":0.0001232283,"threshold_uncertainty_score":0.37173152},"labels":[],"label_agreement":null},{"id":"W4352977279","doi":"10.1109/tnse.2023.3257034","title":"Multipath Congestion Control: Measurement, Analysis, and Optimization From the Energy Perspective","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Multipath TCP; Computer science; Network congestion; Energy consumption; Multipath propagation; Efficient energy use; Computer network; Throughput; Energy (signal processing); Distributed computing; Exploit; The Internet; Wireless; Engineering; Channel (broadcasting); Telecommunications; Network packet","score_opus":0.010976283743876167,"score_gpt":0.19715817908179847,"score_spread":0.18618189533792232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4352977279","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022915981,0.00031641548,0.9956461,0.0008808024,0.00047491802,0.00009556641,0.0000036170497,0.00026937397,0.000021612252],"genre_scores_gemma":[0.99603754,0.00036672907,0.003218256,0.00022125038,0.00010225361,0.00003566432,6.2819e-7,0.0000061719797,0.00001148113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867815,0.00003791849,0.00013683655,0.00040713084,0.0004402569,0.00029969597],"domain_scores_gemma":[0.9991517,0.00024044709,0.00003792817,0.0002430071,0.00021741023,0.00010947309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007875447,0.00013179296,0.00014417944,0.00019367937,0.0005266738,0.0002508508,0.00027644372,0.000041632877,0.0000024577787],"category_scores_gemma":[0.000022572794,0.00010537534,0.00004287224,0.0026975337,0.00011270589,0.00039415777,0.000004708903,0.00012698295,0.0000018881996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005809432,0.0000063475613,0.00002780033,5.5428825e-7,0.000074256466,0.0000012030602,0.00015659371,0.9675761,0.00017549547,0.0023485622,0.000039025093,0.029588291],"study_design_scores_gemma":[0.00030122127,0.000027372675,0.002060607,0.000016809514,0.00009313075,0.0000015802791,0.000048506867,0.9970914,0.000057197147,0.000056725436,0.00012436054,0.00012105585],"about_ca_topic_score_codex":0.00012070179,"about_ca_topic_score_gemma":0.000093672366,"teacher_disagreement_score":0.993746,"about_ca_system_score_codex":0.000072347815,"about_ca_system_score_gemma":0.00006753341,"threshold_uncertainty_score":0.42970815},"labels":[],"label_agreement":null},{"id":"W4376607990","doi":"10.1109/tnet.2023.3268982","title":"Graph-Tensor Neural Networks for Network Traffic Data Imputation","year":2023,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Science Foundation of Fujian Province; National Natural Science Foundation of China","keywords":"Computer science; Imputation (statistics); Artificial neural network; Data mining; Graph; Traffic generation model; Algorithm; Artificial intelligence; Missing data; Theoretical computer science; Machine learning; Computer network","score_opus":0.05153299197999835,"score_gpt":0.28153342578009444,"score_spread":0.2300004338000961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376607990","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001705962,0.00056213315,0.9828049,0.0021109153,0.009721646,0.0009161739,0.000027344744,0.0021062016,0.0000447051],"genre_scores_gemma":[0.9779167,0.00034738702,0.016103633,0.0010963915,0.003671906,0.00031159524,0.00015949635,0.0000861316,0.00030675498],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99609476,0.0002121461,0.0006711696,0.0012763013,0.0004494766,0.0012961164],"domain_scores_gemma":[0.995605,0.0015621999,0.00022984641,0.0022039649,0.00014182585,0.00025717326],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001101139,0.0004526686,0.00045168577,0.00029054724,0.0011370191,0.00042815803,0.0026616722,0.00025225186,0.000011727487],"category_scores_gemma":[0.000021467644,0.00046919778,0.0002930836,0.002635101,0.00008106038,0.0007414923,0.00005122652,0.0005659181,0.000050495182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000429151,0.000029714769,0.000009284725,0.00000592045,0.00005858786,0.0000085418615,0.00004163205,0.54187024,0.0000010455037,0.0002769351,0.006345431,0.45130974],"study_design_scores_gemma":[0.0010631824,0.00017422224,0.00010079519,0.00007435392,0.000088751265,0.000021953407,0.000022152084,0.98526925,0.0000025950983,0.0012871601,0.0114127165,0.00048284032],"about_ca_topic_score_codex":0.0000054549228,"about_ca_topic_score_gemma":0.00008479661,"teacher_disagreement_score":0.9762108,"about_ca_system_score_codex":0.000058609323,"about_ca_system_score_gemma":0.00007511214,"threshold_uncertainty_score":0.99977595},"labels":[],"label_agreement":null},{"id":"W4380902102","doi":"10.1007/978-3-031-35836-4_8","title":"An Analysis of Theoretical Network Communication Speedup Using Multiple Fungible Paths","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes on data engineering and communications technologies","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Speedup; Internet of Things; Throughput; Computer network; Bandwidth (computing); Mobile device; The Internet; Distributed computing; Telecommunications; Wireless; Computer security; World Wide Web; Operating system","score_opus":0.03626925276655776,"score_gpt":0.2628069969134494,"score_spread":0.22653774414689162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380902102","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019898613,0.007891695,0.9863348,0.0018332168,0.000093501985,0.00030856393,0.00027528428,0.002520673,0.00054325827],"genre_scores_gemma":[0.8593666,0.0059435684,0.13353029,0.000039803264,0.000024206047,0.000016889697,0.0009871192,0.00004315242,0.000048376365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860793,0.000048049213,0.00039600607,0.00050503475,0.000202644,0.00024030957],"domain_scores_gemma":[0.9879713,0.0017837894,0.00021982919,0.009881274,0.00010190387,0.000041908337],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00040624582,0.0003191203,0.00053889037,0.00042441764,0.00022445322,0.00012897655,0.0058900956,0.0004513469,0.0000038565663],"category_scores_gemma":[0.00030271255,0.00029497704,0.000093337716,0.00062924594,0.00036532548,0.00018279963,0.0023963472,0.00085026474,0.000004005526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003620769,0.000019419027,0.000029224813,0.00001168438,0.00031472163,8.200501e-7,0.00003442224,0.22005382,0.000018951465,0.59884894,0.00002203416,0.1806423],"study_design_scores_gemma":[0.000085744075,0.000052091043,0.000031964206,0.00018229734,0.00041869373,0.0000023347097,0.000011374042,0.98148423,0.000016814129,0.015426103,0.0020096158,0.0002787045],"about_ca_topic_score_codex":0.000015613216,"about_ca_topic_score_gemma":0.00007569975,"teacher_disagreement_score":0.85916764,"about_ca_system_score_codex":0.00003402606,"about_ca_system_score_gemma":0.000033851382,"threshold_uncertainty_score":0.99995023},"labels":[],"label_agreement":null},{"id":"W4381162652","doi":"10.1145/3592149.3592803","title":"A Multipath Extension to the QUIC Module for ns-3","year":2023,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Scalability; The Internet; Computer network; Multipath propagation; Network congestion; Transmission (telecommunications); Distributed computing; Operating system; Telecommunications","score_opus":0.026647621194994916,"score_gpt":0.26258161808854646,"score_spread":0.23593399689355155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381162652","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008633568,0.000027007849,0.968441,0.021070795,0.00056818454,0.00039174082,0.000001106731,0.00049003103,0.00037656692],"genre_scores_gemma":[0.97463655,0.0000049439714,0.014741998,0.0034224798,0.00019269163,0.00016564595,0.0000013491336,0.0000061322894,0.0068282187],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993118,0.000021019563,0.00009081692,0.00023982,0.00012095951,0.0002155751],"domain_scores_gemma":[0.9992899,0.00017425815,0.000015527481,0.00039386755,0.000063203974,0.00006328988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030011582,0.00006256957,0.00006848241,0.000039942322,0.0001473516,0.00007321217,0.0004675335,0.000021381333,0.000007233079],"category_scores_gemma":[0.000045229932,0.000037740945,0.000048663293,0.00038328662,0.000007602172,0.00007825189,0.00011920221,0.00003545844,0.00055179995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008455068,0.000012958583,0.000018559744,0.0000017819018,0.0000056417057,0.0000024592296,0.00021387599,0.016648365,0.00012902055,0.06343583,0.11646196,0.80306107],"study_design_scores_gemma":[0.00021653356,0.000045812543,0.0009887095,0.000004187157,0.0000018566423,0.000001382504,0.000019687051,0.9301346,0.00004265812,0.0007584734,0.06772307,0.00006305709],"about_ca_topic_score_codex":0.000007177398,"about_ca_topic_score_gemma":0.00002744585,"teacher_disagreement_score":0.966003,"about_ca_system_score_codex":0.000007567812,"about_ca_system_score_gemma":0.000020221021,"threshold_uncertainty_score":0.7092456},"labels":[],"label_agreement":null},{"id":"W4383427084","doi":"10.1007/978-3-031-36183-8_4","title":"iPerfOPS: A Tool for Machine Learning-Based Optimization Through Protocol Selection","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Throughput; Protocol (science); Network congestion; Transmission Control Protocol; Selection (genetic algorithm); Computer network; Distributed computing; Machine learning; Artificial intelligence; Operating system; Network packet","score_opus":0.017420031207495884,"score_gpt":0.25829255529611905,"score_spread":0.24087252408862317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383427084","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.88961e-7,0.000019174122,0.9757414,0.0008913191,0.00087133667,0.021471906,0.000004584265,0.0007359132,0.0002634917],"genre_scores_gemma":[0.006294963,0.0000066589223,0.96900123,0.0019095015,0.0010866272,0.019806495,0.000035219597,0.00010764215,0.0017516321],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965487,0.00005951974,0.0005410675,0.001470957,0.0007489534,0.00063076994],"domain_scores_gemma":[0.9977306,0.000758532,0.00035818116,0.0006190253,0.00044532065,0.00008834094],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009092168,0.0005037921,0.0004609471,0.00046972217,0.0004960779,0.00059032755,0.0015909349,0.00034689033,0.00002550552],"category_scores_gemma":[0.0001830138,0.00046919502,0.00017116922,0.00088694517,0.00024603345,0.00055995036,0.00028749226,0.0007403538,0.00002897323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022872326,0.000016689874,0.000014349435,0.000037644088,0.000006988687,0.000004844569,0.00006111876,0.70923144,0.000004085569,0.0053758794,0.000028806053,0.28519526],"study_design_scores_gemma":[0.0009465748,0.00044590136,0.0000051460056,0.00023612045,0.00001027857,0.000011185734,2.9960148e-8,0.97729844,0.00011643887,0.014377358,0.0060333414,0.0005192125],"about_ca_topic_score_codex":0.000011141082,"about_ca_topic_score_gemma":0.000046839305,"teacher_disagreement_score":0.28467605,"about_ca_system_score_codex":0.0002521298,"about_ca_system_score_gemma":0.0007653307,"threshold_uncertainty_score":0.99977595},"labels":[],"label_agreement":null},{"id":"W4385841889","doi":"10.5121/ijcnc.2023.15401","title":"Enhancing HTTP Web Protocol Performance with Updated Transport Layer Techniques","year":2023,"lang":"en","type":"article","venue":"International journal of Computer Networks & Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of the Fraser Valley","funders":"University of Aberdeen","keywords":"Computer science; Computer network; Transmission Control Protocol; Transport layer; Network congestion; Internet protocol suite; TCP Friendly Rate Control; Protocol stack; Hypertext Transfer Protocol; TCP tuning; The Internet; Application layer; Internet Protocol; Layer (electronics); Operating system","score_opus":0.01713911752999102,"score_gpt":0.2843338941116,"score_spread":0.26719477658160895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385841889","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038200084,0.00003678976,0.9860239,0.00522845,0.00048541513,0.0031495497,0.0000018793581,0.00039697633,0.00085699995],"genre_scores_gemma":[0.8911118,0.00018993155,0.105380155,0.00064813683,0.00069456623,0.0018087568,0.000019326324,0.000020545398,0.00012677228],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812526,0.0001371413,0.00072193,0.00019264458,0.00056439353,0.00025861524],"domain_scores_gemma":[0.99726665,0.00021064839,0.0005218492,0.0008596131,0.0010287481,0.00011247682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007123415,0.00018430514,0.0002482957,0.0003332546,0.00018736547,0.00019137813,0.004199403,0.000077011086,0.000013786874],"category_scores_gemma":[0.0000048243014,0.00015126471,0.0001217137,0.0006906511,0.000096882606,0.000833465,0.00037351754,0.0005323436,0.000020252406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019835522,0.0003305028,0.003684133,0.000011224527,0.00053265254,0.000112038106,0.00046304052,0.106730804,0.00019410893,0.017284065,0.0090919165,0.86136717],"study_design_scores_gemma":[0.00083065685,0.00021015493,0.0031682153,0.00028233882,0.000017186061,0.0002185238,0.000008239704,0.8809966,0.0001209692,0.0001292515,0.11382805,0.00018981859],"about_ca_topic_score_codex":0.000002945518,"about_ca_topic_score_gemma":0.0000242456,"teacher_disagreement_score":0.8872918,"about_ca_system_score_codex":0.000070687114,"about_ca_system_score_gemma":0.00024111487,"threshold_uncertainty_score":0.7803605},"labels":[],"label_agreement":null},{"id":"W4385993958","doi":"10.1145/3609021","title":"Proceedings of the 1st Workshop on eBPF and Kernel Extensions","year":2023,"lang":"en","type":"paratext","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Bayerische Staatsministerium für Wirtschaft, Landesentwicklung und Energie; Hungarian Scientific Research Fund; Bundesministerium für Bildung und Forschung; National Natural Science Foundation of China; Natural Sciences and Engineering Research Council of Canada; Nemzeti Kutatási Fejlesztési és Innovációs Hivatal; European Commission; Deutsche Forschungsgemeinschaft; University of Minnesota; Nemzeti Kutatási, Fejlesztési és Innovaciós Alap; National Science Foundation","keywords":"Kernel (algebra); Computer science; Network congestion; Artificial intelligence; Theoretical computer science; Computer network; Mathematics; Discrete mathematics","score_opus":0.01990998829476589,"score_gpt":0.2416128044753159,"score_spread":0.22170281618055002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385993958","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046837535,0.0019124983,0.018021358,0.023545563,0.011685644,0.001564268,0.000027902719,0.0006277338,0.9379313],"genre_scores_gemma":[0.086955875,0.00081675017,0.00067184656,0.0014034585,0.00043894892,0.000052801428,0.00000262238,0.00003155053,0.9096261],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987211,0.0000146841585,0.00024227583,0.00047549914,0.00030972366,0.00023668433],"domain_scores_gemma":[0.9990005,0.00025271633,0.00016860246,0.00033705856,0.0001638589,0.00007728388],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000161577,0.00021316965,0.00028975148,0.00008417882,0.00013711941,0.00013675033,0.00090419233,0.0001957834,0.00009780435],"category_scores_gemma":[0.000043461343,0.00013043091,0.00010285193,0.00049786485,0.00009253039,0.000081536,0.00041203518,0.0003695119,0.0010303506],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045589236,0.00001855292,0.0000035177593,0.000018727023,0.000024611592,7.146048e-7,0.00007822024,0.00014601595,0.000013715632,0.040809166,0.8878309,0.07105126],"study_design_scores_gemma":[0.001555099,0.00024416446,0.0026877832,0.0030389954,0.00012887287,0.000043089414,0.00038799964,0.19738416,0.00018533207,0.0027269402,0.79018223,0.0014353106],"about_ca_topic_score_codex":0.0000075200815,"about_ca_topic_score_gemma":0.0000079073925,"teacher_disagreement_score":0.19723815,"about_ca_system_score_codex":0.000014875896,"about_ca_system_score_gemma":0.00008112628,"threshold_uncertainty_score":0.99974746},"labels":[],"label_agreement":null},{"id":"W4386486716","doi":"10.1145/3600061.3603275","title":"Toward Fair and Efficient Congestion Control: Machine Learning Aided Congestion Control (MLACC)","year":2023,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Bottleneck; Computer science; Network congestion; Latency (audio); Packet loss; Network packet; Heuristics; Computer network; Distributed computing; Real-time computing; Embedded system; Operating system","score_opus":0.013301687951616828,"score_gpt":0.21324341696475232,"score_spread":0.1999417290131355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386486716","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075185314,0.0007468122,0.90334195,0.014152633,0.0011010087,0.00087889226,0.0000115323255,0.0030917816,0.0014900524],"genre_scores_gemma":[0.99668837,0.00010378094,0.00068095606,0.0010056169,0.0001859684,0.0000915925,0.000018821147,0.000024944093,0.0011999513],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973057,0.0003577659,0.0004673292,0.00075907167,0.00047660887,0.0006335285],"domain_scores_gemma":[0.99809456,0.0008456398,0.00018214721,0.00037721367,0.00021441231,0.00028602697],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011112816,0.00033531577,0.00045866787,0.00025900445,0.00034326097,0.000330473,0.0004582968,0.00017209361,0.000051417344],"category_scores_gemma":[0.00026370402,0.00029712898,0.00010903619,0.000646504,0.00011954944,0.00030815264,0.00013164374,0.00041597156,0.00032540652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003857014,0.0001234456,0.004936475,0.000046518762,0.00019590936,0.00013564533,0.0006114091,0.35289064,0.0010243688,0.14583069,0.0019360294,0.4918832],"study_design_scores_gemma":[0.005112463,0.00023095746,0.01610455,0.00003365865,0.000046396,0.000041849053,0.000055589004,0.97346365,0.000024945424,0.00041886154,0.004113318,0.0003537606],"about_ca_topic_score_codex":0.000057840036,"about_ca_topic_score_gemma":0.000026771915,"teacher_disagreement_score":0.92150307,"about_ca_system_score_codex":0.00005669662,"about_ca_system_score_gemma":0.00007567455,"threshold_uncertainty_score":0.9999481},"labels":[],"label_agreement":null},{"id":"W4387402711","doi":"10.2139/ssrn.4594375","title":"Evaluating Tcp Bbrv3 Performance in Wired Broadband Networks","year":2023,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"","keywords":"Broadband; Computer network; Computer science; Telecommunications; Business","score_opus":0.031772510531543834,"score_gpt":0.28816942983806637,"score_spread":0.25639691930652253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387402711","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15144503,0.010241081,0.82968616,0.0031743427,0.004025553,0.00057096366,0.0000010429118,0.0004474805,0.00040835515],"genre_scores_gemma":[0.98360586,0.011416876,0.0011423054,0.00017620253,0.0012387246,0.0000614153,0.000007112809,0.00004902537,0.0023024816],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940192,0.00033576452,0.0008025563,0.0007625236,0.0006918848,0.0033880773],"domain_scores_gemma":[0.99826837,0.00019368264,0.00052667334,0.0006894833,0.00017630734,0.00014550753],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0060873046,0.0004131024,0.0005234494,0.00034455664,0.00028182723,0.00043761285,0.0021082293,0.00035312734,0.000008351708],"category_scores_gemma":[0.000078964775,0.00040261488,0.0002244838,0.00059021567,0.00004514467,0.00033844326,0.00074333744,0.0065915426,0.000047953497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031537318,0.000028649094,0.0011387994,0.000012156177,0.000100324265,0.000014462948,0.00016092959,0.41495115,0.0000023122254,0.012970942,0.00011327696,0.57047546],"study_design_scores_gemma":[0.001050555,0.00022640638,0.0017213909,0.00029250182,0.000028720502,0.00017314246,0.000056355926,0.9565215,0.0000014895979,0.03914997,0.00035829487,0.00041964994],"about_ca_topic_score_codex":0.00003323806,"about_ca_topic_score_gemma":0.0005758018,"teacher_disagreement_score":0.83216083,"about_ca_system_score_codex":0.0012362743,"about_ca_system_score_gemma":0.004663632,"threshold_uncertainty_score":0.9998426},"labels":[],"label_agreement":null},{"id":"W4389544347","doi":"10.1109/vtc2023-fall60731.2023.10333611","title":"Meta-DAMS: Delay-Aware Multipath Scheduler using Hybrid Meta Reinforcement Learning","year":2023,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Network scheduler; Multipath propagation; Network packet; Reinforcement learning; Emulation; Scheduling (production processes); Transmission delay; Real-time computing; Packet loss; Computer network; Distributed computing; Processing delay; Channel (broadcasting)","score_opus":0.10178406811521411,"score_gpt":0.28951690099105365,"score_spread":0.18773283287583953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389544347","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060035256,0.00040600324,0.9900559,0.0007485705,0.00036599435,0.00023165788,9.2611407e-7,0.0011774321,0.0010099435],"genre_scores_gemma":[0.97465056,0.000038680373,0.01721282,0.00067519053,0.000104556806,0.00007238792,0.000009000301,0.000019103518,0.0072177127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799174,0.00014107078,0.00037143173,0.00051988865,0.0004558517,0.00051998673],"domain_scores_gemma":[0.99888057,0.00018031197,0.00012443327,0.0005222633,0.00013395466,0.00015844486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007420463,0.0002552223,0.00045766405,0.00016445166,0.00030797493,0.00021952653,0.0006458391,0.0000481889,0.00042918982],"category_scores_gemma":[0.000032599208,0.00019106097,0.00039097163,0.0006190501,0.00003166058,0.0005345365,0.00035366864,0.0002413795,0.00045868361],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000583168,0.000018108498,0.000042773005,0.000008215627,0.003565524,0.00007763849,0.00013568567,0.9384373,0.00007317759,0.011960313,0.0013886552,0.044286773],"study_design_scores_gemma":[0.00035578842,0.000041124906,0.000012068581,0.000004951358,0.001232188,0.00001736319,0.00003840876,0.98861897,0.00019490438,0.00012169341,0.0091208955,0.00024166467],"about_ca_topic_score_codex":0.000057424044,"about_ca_topic_score_gemma":0.000007059457,"teacher_disagreement_score":0.9728431,"about_ca_system_score_codex":0.00003916683,"about_ca_system_score_gemma":0.00008373637,"threshold_uncertainty_score":0.779124},"labels":[],"label_agreement":null},{"id":"W4390988671","doi":"10.5267/j.ijdns.2023.11.019","title":"A four-state Markov model for modelling bursty traffic and benchmarking of random early detection","year":2024,"lang":"en","type":"article","venue":"International Journal of Data and Network Science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Burstiness; Active queue management; Computer science; Traffic generation model; Random early detection; Computer network; Network packet; Internet traffic; Markov process; Markov chain; Queueing theory; The Internet; Network congestion; Machine learning; Mathematics; Statistics","score_opus":0.03161097420641505,"score_gpt":0.2766898454851153,"score_spread":0.24507887127870026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390988671","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13309689,0.001207036,0.86429614,0.00033507275,0.00095011195,0.000075668555,0.000013684158,0.000013467033,0.000011912802],"genre_scores_gemma":[0.9329877,0.0005438587,0.06603049,0.000042803455,0.00037274172,0.0000018111582,0.0000012066675,0.000003994529,0.000015421947],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986717,0.000023829018,0.0003647715,0.00029573115,0.00046601827,0.00017794796],"domain_scores_gemma":[0.99891734,0.00032561034,0.00018624958,0.00016662061,0.00031322706,0.00009096671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001965052,0.000087489985,0.00015566232,0.00017996106,0.000116588206,0.00044258343,0.0011320078,0.0000245655,7.2659253e-7],"category_scores_gemma":[0.000031948344,0.00007152734,0.000043005763,0.00026574376,0.0001507907,0.0019201584,0.0002386995,0.0001278615,1.3745083e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009223278,0.000006804021,0.000022446337,0.000006234181,0.000032861677,0.000006537935,0.00019954632,0.345225,0.00009517876,0.0010326877,0.000075245065,0.6532052],"study_design_scores_gemma":[0.000567561,0.0000811845,0.00005245006,0.0001720722,0.000019372144,0.00011846124,0.0000048642773,0.9958546,0.000019137804,0.0026957314,0.0003415362,0.00007302004],"about_ca_topic_score_codex":0.0000030636008,"about_ca_topic_score_gemma":0.000006816761,"teacher_disagreement_score":0.7998908,"about_ca_system_score_codex":0.00002228797,"about_ca_system_score_gemma":0.00017256549,"threshold_uncertainty_score":0.42678422},"labels":[],"label_agreement":null},{"id":"W4393323334","doi":"10.1051/e3sconf/202450701070","title":"Estimation of PCU’s in Heterogeneous Traffic by Different methods","year":2024,"lang":"en","type":"article","venue":"E3S Web of Conferences","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Horizon College and Seminary","funders":"","keywords":"Computer science; Estimation; Engineering; Systems engineering","score_opus":0.01632936140555553,"score_gpt":0.2934420796403167,"score_spread":0.2771127182347612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393323334","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42045495,0.0044464273,0.572123,0.00067950744,0.0006239406,0.00017107061,0.000006261109,0.00013292793,0.0013618981],"genre_scores_gemma":[0.9936356,0.00010657373,0.006112549,0.000020308535,0.000018799741,0.000017000246,0.000003395454,0.000004407144,0.00008138346],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988165,0.00017097803,0.00038548114,0.00026182938,0.0002075577,0.00015766032],"domain_scores_gemma":[0.9992406,0.00037851784,0.00008745656,0.00020770056,0.00004024949,0.000045476154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032642655,0.00012591567,0.0002830247,0.00015482899,0.000016618507,0.000068726345,0.000448101,0.00006276923,0.000054822907],"category_scores_gemma":[0.000024100755,0.00010081943,0.00007610935,0.00028432545,0.00007437534,0.00014697865,0.000044697605,0.00010191945,0.0000043698137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056343756,0.00004876455,0.00008192606,0.000040317536,0.000023551063,0.0000029306598,0.0002070569,0.009061456,0.00061994995,0.036076482,0.00022753669,0.9536044],"study_design_scores_gemma":[0.00018985139,0.000116394505,0.00021155916,0.00012896403,0.000010541167,0.0000036031204,0.000017995473,0.9912276,0.0050603575,0.0014785443,0.001450728,0.00010383897],"about_ca_topic_score_codex":0.000013684989,"about_ca_topic_score_gemma":0.000028777715,"teacher_disagreement_score":0.9821662,"about_ca_system_score_codex":0.0000128991915,"about_ca_system_score_gemma":0.00029001216,"threshold_uncertainty_score":0.4111297},"labels":[],"label_agreement":null},{"id":"W4396567689","doi":"10.1016/j.comcom.2024.04.037","title":"Evaluating TCP BBRv3 performance in wired broadband networks","year":2024,"lang":"en","type":"article","venue":"Computer Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"Office of Advanced Cyberinfrastructure; Oklahoma Arts Council; National Science Foundation","keywords":"Computer science; Broadband; Computer network; Telecommunications","score_opus":0.05569152008295426,"score_gpt":0.31944932197490633,"score_spread":0.2637578018919521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396567689","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008227334,0.007133715,0.976523,0.0040807067,0.00086551806,0.0002605774,7.147315e-7,0.00060981506,0.0022986513],"genre_scores_gemma":[0.90683,0.0005619638,0.09171567,0.00040703558,0.00018316806,0.00007986429,0.00001038505,0.000012564353,0.00019931264],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985485,0.00024133168,0.00036782326,0.0003621967,0.00018342114,0.00029672976],"domain_scores_gemma":[0.997342,0.00053874677,0.000050368984,0.0019152001,0.000077175995,0.000076506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063944375,0.00015169101,0.00017103713,0.00016740256,0.00024059236,0.00042844898,0.002431396,0.00006871322,0.000009771123],"category_scores_gemma":[0.000009590946,0.00015174337,0.00006866828,0.00089073903,0.000081656886,0.0005300865,0.00087457546,0.0003678522,0.000073395306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017621754,0.000040283034,0.00039794092,0.000009448574,0.000016182685,0.0000033224815,0.00037313683,0.054790277,0.0000044075377,0.03644192,0.0011813019,0.90674],"study_design_scores_gemma":[0.00025229415,0.000050422805,0.0030464781,0.00018228155,0.0000069101457,0.00001635668,0.0000040198793,0.9736766,0.0000015253501,0.00037503007,0.022223411,0.0001646734],"about_ca_topic_score_codex":0.0000069822486,"about_ca_topic_score_gemma":0.00003152471,"teacher_disagreement_score":0.9188863,"about_ca_system_score_codex":0.00006617535,"about_ca_system_score_gemma":0.00011547009,"threshold_uncertainty_score":0.6187915},"labels":[],"label_agreement":null},{"id":"W4399662193","doi":"10.37376/glj.vi71.5845","title":"EXPERT SYSTEM FOR TRAFFIC DETECTION IN DISTRIBUTED NETWORKS","year":2024,"lang":"en","type":"article","venue":"المجلة الليبية العالمية","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Network traffic control; Distributed computing; Network packet; Traffic generation model; Resource (disambiguation); Stability (learning theory); Computer network; State (computer science); Control (management); Artificial intelligence","score_opus":0.008894013381858983,"score_gpt":0.22383138260857902,"score_spread":0.21493736922672002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399662193","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008222635,0.0042336485,0.9807899,0.0009205457,0.00354452,0.00060093426,0.000011910482,0.0014549828,0.00022092136],"genre_scores_gemma":[0.99737847,0.000047846865,0.0011373542,0.00013174079,0.00072300044,0.00039592755,0.000021558593,0.000026827329,0.00013724693],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980483,0.0000951957,0.00041501658,0.00067398854,0.00021405201,0.0005534385],"domain_scores_gemma":[0.9989777,0.00032489936,0.000054701955,0.00044478913,0.00006614804,0.00013173195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042925143,0.00024840765,0.0002844736,0.00017294944,0.00014741448,0.00038019996,0.0005557746,0.00018617706,0.0000058887763],"category_scores_gemma":[0.000023326576,0.00023117973,0.00017456562,0.00088147685,0.00003477726,0.00039627275,0.00006625772,0.00025046442,0.000048238053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003614301,0.000042411364,0.000008482995,0.00006653022,0.000035864537,0.000058272235,0.0002128715,0.04746211,0.00010143607,0.02534244,0.00206116,0.9245723],"study_design_scores_gemma":[0.0006004542,0.00009138675,0.000074694,0.00019194979,0.000011962691,0.000042775508,0.000059415222,0.9696651,0.00016539145,0.000120544224,0.0287148,0.00026150476],"about_ca_topic_score_codex":0.0000145451895,"about_ca_topic_score_gemma":0.000076539596,"teacher_disagreement_score":0.9891559,"about_ca_system_score_codex":0.00023926256,"about_ca_system_score_gemma":0.00008553854,"threshold_uncertainty_score":0.9427236},"labels":[],"label_agreement":null},{"id":"W4401508761","doi":"10.1109/icicse61805.2024.10625669","title":"Behind The TCP-newCWV Implementation To Improve Bursty Application Performance","year":2024,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of the Fraser Valley","funders":"University of Aberdeen","keywords":"Computer science; Computer network","score_opus":0.005894409945041512,"score_gpt":0.2574886788249244,"score_spread":0.25159426887988284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401508761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024525631,0.0001338402,0.9581648,0.013553941,0.0005732917,0.00045070078,0.0000012626743,0.00032775584,0.0022687437],"genre_scores_gemma":[0.9939857,0.000013299987,0.0025959173,0.0012450501,0.00023806767,0.00018057831,0.0000028332079,0.000005082549,0.0017334592],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992472,0.000018299846,0.00013554591,0.00027242154,0.00016116365,0.00016539246],"domain_scores_gemma":[0.9995138,0.00005570478,0.000018816516,0.0003217176,0.000038957372,0.00005100946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025568684,0.00007637182,0.000049997365,0.000036966892,0.00012588689,0.00025396826,0.00041445805,0.000021777209,0.000055436525],"category_scores_gemma":[0.0000021022984,0.00004917678,0.000029417664,0.0002268735,0.0000113285705,0.0003030532,0.00007614902,0.000078408455,0.000428937],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015353693,0.000003992667,0.000078847406,0.0000042239203,0.0000069898447,3.118657e-7,0.0002813445,0.00022531596,0.00029383088,0.06246084,0.0052549397,0.93138784],"study_design_scores_gemma":[0.00014331832,0.00008538,0.002936957,0.0000083713585,0.000010035839,0.0000048412503,0.00006371653,0.84946066,0.0011594117,0.000517283,0.14547831,0.0001316845],"about_ca_topic_score_codex":0.00003328407,"about_ca_topic_score_gemma":0.00006192659,"teacher_disagreement_score":0.96946007,"about_ca_system_score_codex":0.000032364904,"about_ca_system_score_gemma":0.000049762904,"threshold_uncertainty_score":0.55132604},"labels":[],"label_agreement":null},{"id":"W4401509307","doi":"10.1109/iccworkshops59551.2024.10615558","title":"Technology Overview of P2P FTTR Solutions","year":2024,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nokia (Canada)","funders":"","keywords":"Computer science","score_opus":0.03500622094426637,"score_gpt":0.27022625248912335,"score_spread":0.235220031544857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401509307","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039936518,0.014284258,0.9604498,0.012343617,0.000500283,0.000065120046,8.5693256e-7,0.00074703613,0.011209642],"genre_scores_gemma":[0.98849356,0.00021416433,0.0090089105,0.00018593785,0.00004048801,0.00001172265,2.9230654e-7,0.0000030381284,0.0020418686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949306,0.0000121556,0.00011835529,0.00016047369,0.00007940405,0.00013654592],"domain_scores_gemma":[0.99962133,0.000048689024,0.000013062372,0.00025852094,0.000034421355,0.000024002227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010500707,0.000049178423,0.000082340506,0.00011212373,0.000033092085,0.000032818174,0.00034895216,0.00004482486,0.0000820668],"category_scores_gemma":[0.0000074865256,0.000039745566,0.000044576664,0.0006274659,0.000039566294,0.00011823703,0.00010952304,0.00007132341,0.00015470159],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.2140869e-7,0.0000057983134,0.000005901474,0.000005852015,0.000006812582,0.0000023232833,0.000008682985,0.00002642149,0.00003876108,0.5862738,0.0031343275,0.4104912],"study_design_scores_gemma":[0.00016973568,0.00008050187,0.00013689342,0.00011775736,0.00001725077,0.000042287153,0.000019788495,0.66073996,0.0002776386,0.06129012,0.27694237,0.00016566613],"about_ca_topic_score_codex":0.0000036908314,"about_ca_topic_score_gemma":0.000006974095,"teacher_disagreement_score":0.9880942,"about_ca_system_score_codex":0.00000905445,"about_ca_system_score_gemma":0.000062672436,"threshold_uncertainty_score":0.19884275},"labels":[],"label_agreement":null},{"id":"W4401631861","doi":"10.22215/etd/2024-16123","title":"Performance Evaluation of HTTP/2 and HTTP/3(QUIC) using Lighthouse","year":2024,"lang":"en","type":"dissertation","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Strong","keywords":"Throughput; Computer science; Computer network; Packet loss; Network packet; Web server; Protocol (science); Hypertext Transfer Protocol; Server; World Wide Web; Operating system; The Internet; Wireless","score_opus":0.02910971712605065,"score_gpt":0.2877274385290955,"score_spread":0.25861772140304484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401631861","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9763038,0.0034760926,0.0049759466,0.00008986871,0.0017545222,0.00039992467,0.0000013290039,0.00018954476,0.012808961],"genre_scores_gemma":[0.9928002,0.00019387562,0.0029032119,0.000031940373,0.00014477865,0.000024103501,0.000022960212,0.000019611596,0.0038593588],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838305,0.000069199916,0.0003315272,0.00042507364,0.00062040513,0.00017072371],"domain_scores_gemma":[0.9990312,0.00004758248,0.0001638185,0.00033116905,0.00037111447,0.0000551125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006893781,0.00019695485,0.00025226866,0.00017629424,0.00007455117,0.0001269733,0.0003106406,0.00017348929,0.000030519415],"category_scores_gemma":[0.00001984681,0.00017438826,0.00006339344,0.00029617324,0.000019682819,0.00029224055,0.000045376182,0.00018469378,0.000027380729],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018864775,0.000026761603,0.000047439797,0.00021195207,0.000074634605,0.0000020575894,0.0011570565,0.002403697,0.00049223396,0.008344062,0.00071466016,0.9865066],"study_design_scores_gemma":[0.00024778408,0.000046115056,0.00071829325,0.00027646087,0.00018958794,0.000005803407,0.0000810506,0.9971146,0.0004918427,0.0002184998,0.00041726994,0.00019268013],"about_ca_topic_score_codex":0.000017361845,"about_ca_topic_score_gemma":0.000047781432,"teacher_disagreement_score":0.9947109,"about_ca_system_score_codex":0.00004735261,"about_ca_system_score_gemma":0.0003446877,"threshold_uncertainty_score":0.7111347},"labels":[],"label_agreement":null},{"id":"W4402126453","doi":"10.1109/blackseacom61746.2024.10646283","title":"Improving TCP Fairness in Non-Programmable Networks Using P4-Programmable Data Planes","year":2024,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"Office of Naval Research","keywords":"Computer science; Computer network","score_opus":0.028346085471111747,"score_gpt":0.2686034805896467,"score_spread":0.24025739511853497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402126453","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004181312,0.0018997452,0.98976916,0.00037826019,0.0018189362,0.00038125578,0.0000028751708,0.00083582103,0.00073260855],"genre_scores_gemma":[0.94493693,0.00004124689,0.053331204,0.00018975664,0.00059915916,0.0000384045,0.000037906444,0.000029486555,0.0007958918],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99751526,0.00006273536,0.00039324418,0.0009803894,0.00027643293,0.0007719615],"domain_scores_gemma":[0.99837303,0.00016317681,0.000056751767,0.0012143974,0.00004635309,0.00014630664],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00080977584,0.00025223935,0.00027399536,0.00016634318,0.00014187653,0.0014498486,0.0018295286,0.00013363302,0.00003357277],"category_scores_gemma":[0.000015875441,0.00022160943,0.000056436977,0.0011230519,0.000050190236,0.0015094877,0.00082753855,0.00035889374,0.00004683366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000845233,0.000040029696,0.000360187,0.000044899934,0.000026630923,0.00021111184,0.000058723257,0.0410011,0.0000318707,0.01165345,0.0008470586,0.9457165],"study_design_scores_gemma":[0.00033490526,0.000032889344,0.000046341018,0.00010188342,0.000015838785,0.00005508233,0.000031009473,0.9869926,0.000009803552,0.000265459,0.011823244,0.0002909481],"about_ca_topic_score_codex":0.00091204926,"about_ca_topic_score_gemma":0.00047744397,"teacher_disagreement_score":0.9459915,"about_ca_system_score_codex":0.000060248796,"about_ca_system_score_gemma":0.00017257787,"threshold_uncertainty_score":0.99958676},"labels":[],"label_agreement":null},{"id":"W4402156993","doi":"10.1109/icc51166.2024.10622372","title":"Reducing the Impact of RTT Unfairness using P4-Programmable Data Planes","year":2024,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"Office of Naval Research; National Science Foundation","keywords":"Computer science; Parallel computing","score_opus":0.06234650117809085,"score_gpt":0.33259028368281207,"score_spread":0.2702437825047212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402156993","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09144097,0.0027484088,0.90085226,0.0011584287,0.000849541,0.00023751862,0.00001260809,0.0004713537,0.0022288894],"genre_scores_gemma":[0.9937913,0.000014985563,0.0056922548,0.000023625096,0.00017182164,0.0000024273784,0.0000061785595,0.000006412266,0.0002910204],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991023,0.000048051268,0.0001697091,0.0003124653,0.00015520246,0.00021225483],"domain_scores_gemma":[0.9987744,0.00017861217,0.000035043042,0.0009332275,0.00003482658,0.00004390171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043522447,0.00009583166,0.00011706543,0.000042835756,0.00008634656,0.0003274911,0.001262794,0.000030406136,0.000043293596],"category_scores_gemma":[0.000013524732,0.000052581014,0.000057830977,0.0004362848,0.000046302277,0.00048796917,0.0003152551,0.00010322324,0.000014976778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007991352,0.000030280173,0.00019349242,0.000024205292,0.00013439299,0.000027472968,0.00032423742,0.050635282,0.0003812307,0.03570693,0.0053797862,0.9071547],"study_design_scores_gemma":[0.00007224225,0.000026737578,0.00011008671,0.00005005409,0.000013692904,0.000052584302,0.00002300052,0.9976918,0.000053021602,0.00041602866,0.0014159757,0.00007477218],"about_ca_topic_score_codex":0.00074009993,"about_ca_topic_score_gemma":0.000016413456,"teacher_disagreement_score":0.94705653,"about_ca_system_score_codex":0.00002060121,"about_ca_system_score_gemma":0.0001946571,"threshold_uncertainty_score":0.31580043},"labels":[],"label_agreement":null},{"id":"W4403052954","doi":"10.1007/978-3-031-71874-8_4","title":"A Brief History of Per-Flow QoS in the Internet","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; The Internet; Quality of service; Flow (mathematics); Data flow diagram; Computer network; Database; World Wide Web; Mathematics","score_opus":0.012848805701871137,"score_gpt":0.21139354811238875,"score_spread":0.19854474241051762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403052954","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000035932073,0.003966467,0.97601986,0.0016949669,0.006079465,0.0003256594,0.0000022568292,0.00009064925,0.011784762],"genre_scores_gemma":[0.81450135,0.00016927713,0.15446192,0.010842657,0.0034026017,0.000069961585,0.000007995553,0.00009159764,0.01645266],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99705404,0.00005349815,0.00052718585,0.001082577,0.000843023,0.00043965556],"domain_scores_gemma":[0.99793416,0.0005732672,0.00018445807,0.0011168389,0.00011890981,0.0000723589],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011067059,0.00037726626,0.00044944533,0.00061112805,0.000034116034,0.0002083929,0.0040186853,0.00022168615,0.000041524247],"category_scores_gemma":[0.000034263052,0.00027889336,0.0001595643,0.00040737676,0.00072462787,0.00026599117,0.00068899157,0.0010018133,0.00005264325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068903196,0.000030008496,0.0000139520935,0.000044029573,0.0000111714435,0.00014349814,0.0038230342,0.017053584,0.0000096286685,0.12883615,0.0014194425,0.8486086],"study_design_scores_gemma":[0.00021548994,0.00013870014,0.00003479273,0.00048632265,0.000010213192,0.000077784134,3.2657135e-7,0.8952029,0.000012213706,0.031848725,0.071626306,0.00034622423],"about_ca_topic_score_codex":0.000050675982,"about_ca_topic_score_gemma":0.00021348266,"teacher_disagreement_score":0.87814933,"about_ca_system_score_codex":0.0005137587,"about_ca_system_score_gemma":0.0007809059,"threshold_uncertainty_score":0.9999663},"labels":[],"label_agreement":null},{"id":"W4403981008","doi":"10.1145/3646547.3688453","title":"Replication: \"Taking a long look at QUIC\"","year":2024,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Replication (statistics); Biology; Virology","score_opus":0.017114765537513888,"score_gpt":0.2597504159866373,"score_spread":0.24263565044912339,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403981008","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027851006,0.0017473372,0.9462171,0.0069806655,0.0005812587,0.000095293275,2.1979848e-7,0.0010936905,0.04049934],"genre_scores_gemma":[0.9702615,0.000017186927,0.004442616,0.0008792306,0.00022951432,0.000024175022,0.0000011886716,0.000005922503,0.024138669],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991204,0.00001925631,0.00012537932,0.00043742912,0.0001405873,0.00015691652],"domain_scores_gemma":[0.99911827,0.00008870976,0.00002460278,0.0006827353,0.00002833207,0.000057376357],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000194635,0.0000716326,0.00006561698,0.000041704345,0.000085335596,0.00024080016,0.00039696478,0.00003183018,0.0002545682],"category_scores_gemma":[0.000013480857,0.000059249734,0.000049180482,0.00027276625,0.00001726027,0.0002470494,0.00013624296,0.00006822575,0.0009142558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010010123,0.0000048355723,0.00013425272,0.0000052929004,0.000009612672,0.000025057341,0.00007430135,0.000092405935,0.000036122587,0.2829006,0.012012104,0.7047044],"study_design_scores_gemma":[0.000111780566,0.000022341517,0.0009228968,0.000041236322,0.0000069585317,0.000086552034,0.0000051602096,0.86068076,0.00020694117,0.0013173481,0.13644463,0.00015340926],"about_ca_topic_score_codex":0.0000042960196,"about_ca_topic_score_gemma":0.000017576413,"teacher_disagreement_score":0.96747637,"about_ca_system_score_codex":0.00004622087,"about_ca_system_score_gemma":0.00004419057,"threshold_uncertainty_score":0.9998636},"labels":[],"label_agreement":null},{"id":"W4404628296","doi":"10.1109/ciot63799.2024.10757095","title":"Optimizing multi-service migration and downtime at the network edge using deep reinforcement learning","year":2024,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Downtime; Reinforcement learning; Computer science; Enhanced Data Rates for GSM Evolution; Edge device; Artificial intelligence; Service (business); Operating system; Business","score_opus":0.020023262438437998,"score_gpt":0.2406181885834181,"score_spread":0.2205949261449801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404628296","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072260806,0.0032179474,0.98550373,0.0024250655,0.0004246224,0.00016730669,3.7516518e-8,0.00028970977,0.0007455028],"genre_scores_gemma":[0.94878304,0.000113499416,0.04620404,0.001290484,0.00029941968,0.000016129483,0.0000032159967,0.0000115195635,0.0032786452],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990728,0.00006666304,0.00017609545,0.00028937706,0.00014636757,0.00024870964],"domain_scores_gemma":[0.99950606,0.00015324817,0.00003899994,0.00019763868,0.000047232774,0.00005681119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035290423,0.0001186542,0.000092120375,0.000023513123,0.0004375983,0.00046606403,0.00022018456,0.00004318686,0.000055318917],"category_scores_gemma":[0.000006730734,0.00008076467,0.000037259793,0.00034237848,0.000021874941,0.00033730463,0.00024073628,0.00015343587,0.00006058965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031576024,0.0000024572562,0.00008332592,0.000008176064,0.000020718655,0.0000038699964,0.00078843767,0.9001408,0.000111512505,0.00584936,0.0003197764,0.09266841],"study_design_scores_gemma":[0.00015201303,0.000017022894,0.0000615302,0.000043914806,0.000017088672,0.000017204056,0.00004458542,0.9872085,0.000024046818,0.000027629036,0.012275325,0.000111152505],"about_ca_topic_score_codex":0.00006821188,"about_ca_topic_score_gemma":0.00037720962,"teacher_disagreement_score":0.941557,"about_ca_system_score_codex":0.00004742992,"about_ca_system_score_gemma":0.000030119769,"threshold_uncertainty_score":0.44942662},"labels":[],"label_agreement":null},{"id":"W4406266770","doi":"10.1109/vtc2024-fall63153.2024.10757972","title":"Multipath Routing Compatible Congestion Control","year":2024,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Multipath routing; Computer science; Multipath propagation; Computer network; Routing (electronic design automation); Network congestion; Dynamic Source Routing; Routing protocol","score_opus":0.008758969152855851,"score_gpt":0.226326976105621,"score_spread":0.21756800695276515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406266770","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002970614,0.0006079276,0.982689,0.0029126504,0.001102438,0.00016463324,0.0000013899438,0.0014597334,0.008091598],"genre_scores_gemma":[0.99126405,0.000008344913,0.0065544075,0.00067962456,0.00020160881,0.000021356955,0.0000016140441,0.000007951516,0.0012610462],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898154,0.000060465416,0.0001916282,0.00033807274,0.00017991816,0.00024835937],"domain_scores_gemma":[0.99929863,0.0002825792,0.00002453814,0.00025013773,0.000056253994,0.00008784537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030697006,0.000117016,0.00013392788,0.00007072691,0.00009510754,0.0004031977,0.00033351535,0.000048271675,0.00006266192],"category_scores_gemma":[0.000021253141,0.00009612834,0.00006498925,0.00027637638,0.00002346219,0.00041240727,0.00004190409,0.00014157215,0.00042263037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029184127,0.00001484407,0.00022895995,0.0000061072788,0.000021930155,0.000024088578,0.00011240103,0.0025568057,0.00011122192,0.4663306,0.0023757967,0.52821434],"study_design_scores_gemma":[0.00041095287,0.00003584282,0.0005218185,0.00003963893,0.000009213694,0.00001610526,0.000011145411,0.98801285,0.00003966686,0.0007035983,0.010069132,0.00013001685],"about_ca_topic_score_codex":0.000019443003,"about_ca_topic_score_gemma":0.000010163962,"teacher_disagreement_score":0.9882934,"about_ca_system_score_codex":0.000030036079,"about_ca_system_score_gemma":0.00006389587,"threshold_uncertainty_score":0.5432199},"labels":[],"label_agreement":null},{"id":"W4408777685","doi":"10.2139/ssrn.5170292","title":"Cross-vs. In-Region Courier Routing in On-Demand Delivery","year":2025,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of Toronto","funders":"","keywords":"Routing (electronic design automation); Business; On demand; Computer science; Computer network; Commerce","score_opus":0.009102972226662885,"score_gpt":0.2522391817464198,"score_spread":0.2431362095197569,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408777685","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31370237,0.009454418,0.6608746,0.0076110302,0.0033857864,0.00071461627,0.0000031358622,0.00019454693,0.0040595164],"genre_scores_gemma":[0.99259645,0.0038799497,0.0001854947,0.000608695,0.00042435125,0.000023164732,0.000002251744,0.000013503319,0.00226615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956646,0.0002585469,0.0006831772,0.0006726402,0.0003983648,0.0023226894],"domain_scores_gemma":[0.998721,0.00020345396,0.00034223133,0.0005139458,0.0001301648,0.000089186484],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0025418915,0.0003475177,0.00047463283,0.0004915979,0.00016520057,0.0004114086,0.0015476866,0.0003532628,0.0000050264152],"category_scores_gemma":[0.00006585451,0.00034120187,0.00020149814,0.00040012674,0.000046859834,0.00025087578,0.00048334684,0.006879227,0.000013679518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001984445,0.00016949365,0.014170121,0.000024685232,0.00013532981,0.00016814079,0.0005334291,0.08097487,0.0000014477621,0.47772568,0.00016425767,0.4257341],"study_design_scores_gemma":[0.0058209803,0.00048431376,0.012405285,0.0020814426,0.000051185758,0.00047507073,0.00018433404,0.60596246,0.000011009279,0.36842325,0.0027713352,0.0013293723],"about_ca_topic_score_codex":0.000093949384,"about_ca_topic_score_gemma":0.0009059793,"teacher_disagreement_score":0.6788941,"about_ca_system_score_codex":0.0018428888,"about_ca_system_score_gemma":0.0058266358,"threshold_uncertainty_score":0.999904},"labels":[],"label_agreement":null},{"id":"W4408847654","doi":"10.1145/3712676.3718341","title":"A Congestion Control Test Suite for Real-Time Communication","year":2025,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Suite; Computer science; Network congestion; Test suite; Test (biology); Computer network; Real-time computing; Test case; Network packet","score_opus":0.005086508238853602,"score_gpt":0.2339110439726546,"score_spread":0.22882453573380102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408847654","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007812623,0.00015880211,0.9586648,0.014620202,0.00016032171,0.0006675,0.0000051983084,0.0005495079,0.024392415],"genre_scores_gemma":[0.96165025,0.000056605655,0.022398906,0.0016872874,0.000042890293,0.00022917562,0.000011505906,0.000005686154,0.013917683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917793,0.00006890331,0.00022126808,0.00024290604,0.0000908199,0.00019818232],"domain_scores_gemma":[0.99749017,0.0015725099,0.00006778704,0.0006117035,0.0002088737,0.000048938928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004091243,0.00010382072,0.00016244111,0.000075278134,0.0001794625,0.00014459612,0.00063944707,0.00006765017,0.00002043491],"category_scores_gemma":[0.00015066794,0.00009564865,0.000064610176,0.00024548703,0.00003981482,0.0002317867,0.000059841994,0.0000671566,0.00006155307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029141844,0.000086708504,0.0004980916,0.000009239162,0.000030803087,4.7125891e-7,0.00003995997,0.00048444304,0.0011461497,0.67910075,0.028247815,0.29032645],"study_design_scores_gemma":[0.0023586077,0.000089179615,0.002256711,0.000039550418,0.0000302595,0.0000018579503,0.000007946857,0.9640233,0.00011623399,0.007631989,0.02328747,0.00015689533],"about_ca_topic_score_codex":0.000018744695,"about_ca_topic_score_gemma":0.000020749212,"teacher_disagreement_score":0.9635389,"about_ca_system_score_codex":0.000036530782,"about_ca_system_score_gemma":0.000090022244,"threshold_uncertainty_score":0.39004388},"labels":[],"label_agreement":null},{"id":"W4409102161","doi":"10.1109/lwc.2025.3557313","title":"A-Gamba: An Adaptive Graph-Mamba Model for Traffic Prediction in Wireless Cellular Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Wireless; Computer network; Wireless network; Graph; Telecommunications; Theoretical computer science","score_opus":0.023216375453546313,"score_gpt":0.24893911688605927,"score_spread":0.22572274143251295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409102161","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12313059,0.0003033849,0.8681313,0.0067076734,0.0004795272,0.0007601984,0.000014848752,0.00036565957,0.00010680762],"genre_scores_gemma":[0.98041195,0.00016112246,0.015987853,0.0023533544,0.00007384632,0.0008051213,0.00006199529,0.00002389149,0.000120845216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977947,0.00034839337,0.00057693233,0.00058945024,0.0001998201,0.00049073156],"domain_scores_gemma":[0.99664813,0.00042489002,0.00016802594,0.0024938667,0.00015560427,0.00010948427],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005617949,0.0002806843,0.00034834904,0.00038478122,0.00049026374,0.00017204133,0.0029239876,0.00018437653,8.8259065e-7],"category_scores_gemma":[0.000007355414,0.00031695017,0.0001556263,0.0010186954,0.00023604798,0.0006749931,0.00018556579,0.0005271332,0.00000381853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004605897,0.0002500424,0.0000863592,0.000009939573,0.000050386247,0.0000016154116,0.00045841903,0.79843307,0.0010493615,0.05830394,0.0022067751,0.13910405],"study_design_scores_gemma":[0.0010317116,0.00005046147,0.00014543218,0.000101719714,0.000032246277,0.0000013791517,0.000064382206,0.99757177,0.00005992364,0.0004526516,0.00022708604,0.00026121514],"about_ca_topic_score_codex":0.000028736911,"about_ca_topic_score_gemma":0.00038947497,"teacher_disagreement_score":0.8572814,"about_ca_system_score_codex":0.00015342506,"about_ca_system_score_gemma":0.00014186736,"threshold_uncertainty_score":0.99992824},"labels":[],"label_agreement":null},{"id":"W4409145138","doi":"10.1145/3712678.3721878","title":"Aero: A Pluggable Congestion Control for QUIC","year":2025,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Network congestion; Computer network","score_opus":0.005726165748544577,"score_gpt":0.23292305333013885,"score_spread":0.2271968875815943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409145138","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004815722,0.0002625704,0.9775885,0.008527765,0.0007239189,0.00047066374,0.000001774012,0.0003836592,0.011559628],"genre_scores_gemma":[0.9701949,0.000006924355,0.01209514,0.0036366265,0.000079061225,0.00021622748,0.0000017703455,0.00000398474,0.013765359],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915224,0.00003441572,0.00017895376,0.00029160007,0.00009332898,0.00024947998],"domain_scores_gemma":[0.9991132,0.00034548106,0.00003960514,0.0003137699,0.00013399063,0.000053942793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024439784,0.00010207152,0.00015896703,0.00007316041,0.0001301672,0.0001327825,0.00042262085,0.00006245177,0.000025118074],"category_scores_gemma":[0.000053271742,0.00008962129,0.00007454273,0.00023745945,0.000025058695,0.00020659502,0.000035104473,0.00006150538,0.000039946106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002441841,0.000025949012,0.00008710437,0.0000068157347,0.000026877804,6.847014e-7,0.000011809933,0.0010430699,0.00008062615,0.7208391,0.021403642,0.25644994],"study_design_scores_gemma":[0.0030043423,0.00008615152,0.00055432576,0.000024938867,0.00002492244,0.0000020842663,0.000010791614,0.8954671,0.00010025665,0.012821564,0.0877482,0.00015533078],"about_ca_topic_score_codex":0.000009020818,"about_ca_topic_score_gemma":0.000019437266,"teacher_disagreement_score":0.96971333,"about_ca_system_score_codex":0.000029116733,"about_ca_system_score_gemma":0.00011317428,"threshold_uncertainty_score":0.36546502},"labels":[],"label_agreement":null},{"id":"W4409640678","doi":"10.1109/ojits.2025.3562757","title":"Multi-Hop Upstream Anticipatory Traffic Signal Control With Deep Reinforcement Learning","year":2025,"lang":"en","type":"article","venue":"IEEE Open Journal of Intelligent Transportation Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Hop (telecommunications); Reinforcement learning; Upstream (networking); Computer science; Traffic signal; Computer network; Artificial intelligence; Real-time computing","score_opus":0.021491416479018702,"score_gpt":0.27033395143801614,"score_spread":0.24884253495899744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409640678","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03455822,0.0007312925,0.9625481,0.00017588778,0.0010807515,0.0006568959,0.0000010863972,0.000043951895,0.00020384089],"genre_scores_gemma":[0.99691135,0.00006849024,0.0019604082,0.00016197583,0.00009179293,0.000036951547,0.0000031926834,0.00001327092,0.0007525927],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974713,0.00022626169,0.0012288594,0.00027810186,0.00050376705,0.00029172466],"domain_scores_gemma":[0.9978956,0.00019072049,0.0007920608,0.00023037272,0.00072256086,0.00016871058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010491905,0.00023581854,0.00054043607,0.0002579339,0.00018121325,0.00041804317,0.001144771,0.00008230415,0.000027169408],"category_scores_gemma":[0.00000811805,0.00018192262,0.00015248997,0.00041415496,0.000049401453,0.0007118589,0.000006395187,0.00035635196,0.000014182242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026895772,0.00011229863,0.0014064952,0.000037998565,0.00031942216,0.00008856641,0.0013765574,0.9546692,0.00016369383,0.0018089684,0.00013823097,0.039609615],"study_design_scores_gemma":[0.0043555074,0.00076265977,0.0006206892,0.00095236296,0.00018706314,0.00005054281,0.0019180108,0.98623264,0.00080792623,0.0000073180063,0.0037867571,0.00031849684],"about_ca_topic_score_codex":0.000035835077,"about_ca_topic_score_gemma":0.00007553526,"teacher_disagreement_score":0.9623531,"about_ca_system_score_codex":0.00008738047,"about_ca_system_score_gemma":0.0003550754,"threshold_uncertainty_score":0.7418589},"labels":[],"label_agreement":null},{"id":"W4412722547","doi":"10.1109/ton.2025.3589553","title":"INCC: In-Network Congestion Control With Proactive Bottleneck Awareness","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Key Research and Development Program of China; Beijing Nova Program; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Bottleneck; Network congestion; Control (management); Computer science; Computer network; Business; Artificial intelligence","score_opus":0.008432641474071963,"score_gpt":0.22586281675768932,"score_spread":0.21743017528361736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412722547","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041085,0.00033331625,0.9893519,0.001093578,0.0022279408,0.0006503467,0.0000021404828,0.00037333232,0.001858921],"genre_scores_gemma":[0.9954402,0.000079168734,0.0025870956,0.00096293923,0.0002526881,0.000318394,0.0000012050648,0.000019644456,0.0003386581],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978135,0.0002396017,0.0003833429,0.0006631075,0.00028567543,0.0006147676],"domain_scores_gemma":[0.99859804,0.0005465914,0.00011900955,0.00052376656,0.00011513286,0.000097444485],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004144294,0.00031148602,0.00038700708,0.000253614,0.00040760357,0.00016459289,0.00052122585,0.00016640147,0.000008267671],"category_scores_gemma":[0.0000026192372,0.00028667555,0.000094202274,0.001515521,0.000078937905,0.00037804004,0.0000037422478,0.0005660668,0.000013674842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022981604,0.00011178158,0.00071874174,0.000007282602,0.00010461249,0.000018289173,0.00007279327,0.6405394,0.000005778039,0.0038618215,0.00013989887,0.35418975],"study_design_scores_gemma":[0.0042813714,0.00024957373,0.0022306454,0.000771234,0.00010052651,0.00001793277,0.00003379029,0.9860236,0.00017074496,0.0012261099,0.004370399,0.0005240813],"about_ca_topic_score_codex":0.00003251021,"about_ca_topic_score_gemma":0.00050395593,"teacher_disagreement_score":0.9913317,"about_ca_system_score_codex":0.0001773353,"about_ca_system_score_gemma":0.000262267,"threshold_uncertainty_score":0.9999585},"labels":[],"label_agreement":null},{"id":"W4412968818","doi":"10.1007/979-8-8688-1513-3_13","title":"Network Policies","year":2025,"lang":"en","type":"book-chapter","venue":"Certification study companion series","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brampton Civic Hospital","funders":"","keywords":"Business","score_opus":0.03590416566412706,"score_gpt":0.2528784690460569,"score_spread":0.2169743033819298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412968818","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007989147,0.0027724723,0.18302283,0.009473617,0.0044312133,0.0023701508,0.000020377262,0.00204372,0.7957857],"genre_scores_gemma":[0.1449127,0.0001596926,0.0012232042,0.00081338896,0.0007848006,0.00013901634,0.000050971616,0.00003788393,0.85187835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975834,0.00009106377,0.0007084835,0.0008093933,0.00046736764,0.00034029246],"domain_scores_gemma":[0.9974452,0.00017016866,0.0003948243,0.0014916167,0.00039406985,0.00010412014],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031213815,0.00045759784,0.0005955837,0.00019961843,0.00048880134,0.00043451312,0.0012836601,0.00020313838,0.000099521654],"category_scores_gemma":[0.000017315884,0.0004556091,0.00014441469,0.00022048064,0.00011176463,0.000355243,0.00038771334,0.00035577264,0.00032754504],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018213623,0.0000617212,0.00008568048,0.000011546512,0.000106378575,0.000003739729,0.00040273453,0.00030510232,0.0000023512061,0.85084313,0.07319443,0.07496498],"study_design_scores_gemma":[0.00040351306,0.00017178987,0.0015566516,0.000121388526,0.000103707585,0.000008727796,0.00012793853,0.0029809724,0.000004909346,0.03213824,0.96172535,0.00065683504],"about_ca_topic_score_codex":0.0000091436605,"about_ca_topic_score_gemma":0.000032616947,"teacher_disagreement_score":0.8885309,"about_ca_system_score_codex":0.00008576579,"about_ca_system_score_gemma":0.00018175118,"threshold_uncertainty_score":0.99978954},"labels":[],"label_agreement":null},{"id":"W4413363777","doi":"10.1016/j.array.2025.100472","title":"TCP DCERL+: Improving congestion control in mobile ad hoc networks","year":2025,"lang":"en","type":"article","venue":"Array","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Mobile ad hoc network; Computer network; Computer science; Network congestion","score_opus":0.003495819249890806,"score_gpt":0.2093483220109973,"score_spread":0.20585250276110648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413363777","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009953773,0.009836858,0.97427696,0.001747334,0.0013359652,0.00047032512,9.874645e-7,0.0002850565,0.0020927335],"genre_scores_gemma":[0.99507535,0.00021838173,0.0016250463,0.001941521,0.00009939793,0.00017804533,0.0000021384021,0.0000073982465,0.0008527202],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862766,0.00012259727,0.00030025162,0.0004290202,0.00013801121,0.00038247253],"domain_scores_gemma":[0.9990569,0.00026506736,0.000082578044,0.00044724494,0.000073349845,0.000074880794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040543,0.00015951005,0.00023531317,0.00013145062,0.000104341765,0.00013652245,0.00054129236,0.00011807835,0.000018589099],"category_scores_gemma":[0.000036190384,0.00015564697,0.00006843785,0.00051027443,0.00004357176,0.00029289976,0.00005282897,0.0002654544,0.0000345747],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027995417,0.00004335675,0.0009472362,0.000005901176,0.000016453498,0.000009705142,0.00009640966,0.019888686,0.000371321,0.008286597,0.0010141568,0.96929216],"study_design_scores_gemma":[0.003396347,0.00014956578,0.005786101,0.00010947889,0.000022964123,0.000005564567,0.000055294873,0.9179451,0.00007689099,0.0011117841,0.070988595,0.00035231598],"about_ca_topic_score_codex":0.0000075827197,"about_ca_topic_score_gemma":0.00009195046,"teacher_disagreement_score":0.9851216,"about_ca_system_score_codex":0.000070768714,"about_ca_system_score_gemma":0.0001053302,"threshold_uncertainty_score":0.6347099},"labels":[],"label_agreement":null},{"id":"W4413575504","doi":"10.64628/aap.4xkhuey6t","title":"Telecommuting can reduce congestion, but might create other traffic problems","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Telecommuting; Traffic congestion; Computer science; Transport engineering; Business; Engineering; Work (physics)","score_opus":0.021700665075356503,"score_gpt":0.2343149163243122,"score_spread":0.2126142512489557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413575504","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.272236,0.0059573585,0.64790165,0.03350143,0.00651,0.0023944576,0.000033236527,0.0042142523,0.027251601],"genre_scores_gemma":[0.96736735,0.00016078287,0.019585714,0.0013344364,0.000565782,0.00021960537,0.000040677172,0.000055344557,0.010670295],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964638,0.0003524965,0.0007040134,0.0013425467,0.00045242443,0.0006847598],"domain_scores_gemma":[0.997129,0.0002102876,0.00035688546,0.0016238076,0.00041575037,0.00026427227],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005936463,0.00055432844,0.0006473914,0.00015222024,0.0002652307,0.0010677837,0.0019126522,0.0004503224,0.00025319975],"category_scores_gemma":[0.000060393217,0.00051820563,0.0002711977,0.00036776753,0.00009461135,0.00018649289,0.0010206599,0.0010805889,0.00005200427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001177631,0.00028877694,0.0001929422,0.00018179415,0.00038470648,0.00009992373,0.0021243258,0.25450253,0.00023326963,0.0128696365,0.0074149515,0.72169536],"study_design_scores_gemma":[0.001352345,0.00010261802,0.00054358743,0.0010985793,0.0001350779,0.00016158342,0.00025644276,0.965419,0.0006697089,0.00078952865,0.027561944,0.0019096003],"about_ca_topic_score_codex":0.00033623495,"about_ca_topic_score_gemma":0.00070911314,"teacher_disagreement_score":0.71978575,"about_ca_system_score_codex":0.00013460947,"about_ca_system_score_gemma":0.0007406089,"threshold_uncertainty_score":0.9999692},"labels":[],"label_agreement":null},{"id":"W4416706962","doi":"10.1109/tmc.2025.3637283","title":"PEP-Policer: Eliminating the On-Off Traffic Pattern in PEP Over Satellite Networks","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Goodput; Geostationary orbit; Limiting; Satellite; Network congestion; Communications satellite","score_opus":0.008342108884710606,"score_gpt":0.25108116581208373,"score_spread":0.24273905692737313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416706962","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.105298035,0.0027567006,0.88054055,0.001840689,0.0067378525,0.0015593114,0.0000090552685,0.00036894015,0.00088887924],"genre_scores_gemma":[0.9936976,0.0010664273,0.00026799366,0.0033934556,0.00062218093,0.00017928901,0.0000023817759,0.000064042055,0.00070665625],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9934567,0.0010217912,0.0015698756,0.0016595472,0.0007178741,0.0015741843],"domain_scores_gemma":[0.9944015,0.003272898,0.00043403788,0.0014866494,0.00017155512,0.00023333635],"candidate_categories":["metaepi_narrow","sts","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0015504649,0.0009029012,0.00083422917,0.00066890253,0.0016999214,0.00086388143,0.0018533849,0.00044056287,0.00010210749],"category_scores_gemma":[0.0000144648875,0.0008274827,0.00057999697,0.0028220357,0.00028977802,0.0003253332,0.00003199512,0.0027183385,0.000113824615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000405734,0.00032971796,0.000038507722,0.000025543422,0.00007200086,0.000016655564,0.0011234141,0.49802965,0.0000025117336,0.00019516978,0.000082523446,0.50004375],"study_design_scores_gemma":[0.0019229101,0.00041552223,0.0011445477,0.0013986831,0.00011446255,0.000016681079,0.00039227115,0.991024,0.000054824373,0.000023261606,0.0028092028,0.00068363553],"about_ca_topic_score_codex":0.000083852756,"about_ca_topic_score_gemma":0.0003465805,"teacher_disagreement_score":0.88839954,"about_ca_system_score_codex":0.0004431574,"about_ca_system_score_gemma":0.0003271732,"threshold_uncertainty_score":0.99959975},"labels":[],"label_agreement":null},{"id":"W46401897","doi":"10.1007/0-387-32015-6_5","title":"Inter-Domain Traffic Engineering Using Mpls","year":2005,"lang":"en","type":"book-chapter","venue":"IFIP International Federation for Information Processing/IFIP","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Research Canada; Ericsson (Canada); Polytechnique Montréal","funders":"","keywords":"Multiprotocol Label Switching; Quality of service; Traffic engineering; Computer science; Computer network; Domain (mathematical analysis); Provisioning; Internet traffic engineering; Internet traffic; The Internet; Scheme (mathematics); Inter-domain; Distributed computing; World Wide Web; Mathematics","score_opus":0.016007519975987736,"score_gpt":0.23582208645448352,"score_spread":0.2198145664784958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W46401897","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000073445255,0.00017932322,0.9183753,0.001661785,0.0022017602,0.0007660127,0.00007652002,0.000560438,0.07610541],"genre_scores_gemma":[0.43064788,0.00014732602,0.31347618,0.008184676,0.008746799,0.00081899593,0.0042464444,0.00036773525,0.23336397],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969021,0.000014602454,0.0013679072,0.00049265375,0.00083050097,0.00039220357],"domain_scores_gemma":[0.99714214,0.0001224108,0.0009878472,0.00036113942,0.0012273202,0.00015913419],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00049861846,0.000569027,0.00042382872,0.000717144,0.00048985856,0.002450344,0.0010390454,0.00043442025,0.00015296062],"category_scores_gemma":[0.00008515805,0.0006197526,0.00028412047,0.00011055183,0.00005089099,0.005146454,0.00013170953,0.00043580914,0.00021368028],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047669964,0.000026069007,0.0000011899364,0.000108704386,0.000116602314,0.0000019586666,0.00065949466,0.07112547,0.000026035945,0.37563786,0.003931908,0.548317],"study_design_scores_gemma":[0.0006172269,0.000033221826,0.0000017801361,0.00024586957,0.000020533967,0.0000421175,0.00001807067,0.56957334,0.000030362853,0.0015616948,0.42742926,0.0004265417],"about_ca_topic_score_codex":0.0000016190583,"about_ca_topic_score_gemma":0.000007744202,"teacher_disagreement_score":0.6048991,"about_ca_system_score_codex":0.0005111015,"about_ca_system_score_gemma":0.0004271683,"threshold_uncertainty_score":0.9996254},"labels":[],"label_agreement":null},{"id":"W4697903","doi":"10.1007/978-1-4020-6270-4_8","title":"Scalable Communication for High Performance and Inexpensive Reliable Strict QoS","year":2007,"lang":"en","type":"book-chapter","venue":"New Technologies, Mobility and Security","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Backup; Scalability; Computer science; Computer network; Overhead (engineering); Quality of service; Path (computing); Distributed computing; Service (business); Data loss; Database; Operating system","score_opus":0.020126150418028885,"score_gpt":0.22608586652187104,"score_spread":0.20595971610384217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4697903","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14524058,0.1722892,0.40037352,0.035537887,0.0044841953,0.02205736,0.00042297642,0.02077466,0.19881962],"genre_scores_gemma":[0.9221446,0.021635741,0.026917016,0.00046527127,0.0001659421,0.00014333316,0.00006875866,0.000042924396,0.028416412],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831676,0.000017179671,0.000400459,0.000725768,0.00020099875,0.000338809],"domain_scores_gemma":[0.9977531,0.00040877727,0.00024248779,0.0012890536,0.0002243861,0.00008219031],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066645216,0.0003326965,0.00048136152,0.00015005528,0.00032450183,0.0001284678,0.0008497007,0.00083491096,0.0000084888925],"category_scores_gemma":[0.00012111881,0.0003217613,0.00005506082,0.0001043249,0.00038652628,0.00033480523,0.0006680896,0.00072692416,0.000005021823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005736688,0.000029006374,0.00007119277,0.00009440674,0.00002796381,0.0000016162245,0.00008133384,0.000010643226,0.000002203237,0.44383943,0.0058985413,0.5498863],"study_design_scores_gemma":[0.0019275969,0.0007889151,0.0004930335,0.0003608949,0.000083163555,0.00003150282,0.00010626556,0.03937624,0.00021231733,0.49820358,0.45743182,0.0009846581],"about_ca_topic_score_codex":0.0000970046,"about_ca_topic_score_gemma":0.00011572885,"teacher_disagreement_score":0.77690405,"about_ca_system_score_codex":0.000094155046,"about_ca_system_score_gemma":0.00013216792,"threshold_uncertainty_score":0.99992347},"labels":[],"label_agreement":null},{"id":"W59026020","doi":"10.5555/2414276.2414283","title":"Processor sharing and pricing implications","year":2012,"lang":"en","type":"article","venue":"International Teletraffic Congress","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Processor sharing; Computer science; Payment; Revenue; Bandwidth (computing); Operator (biology); Variable pricing; Operations research; Microeconomics; Computer network; Economics; Queueing theory; Finance; Mathematics; World Wide Web","score_opus":0.016702352200216798,"score_gpt":0.26411820424345456,"score_spread":0.24741585204323777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W59026020","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69014627,0.001397544,0.28016222,0.010635728,0.0041334527,0.00039062736,0.000006366052,0.00080413994,0.012323681],"genre_scores_gemma":[0.99600977,0.000032944845,0.0024242294,0.00034602024,0.00039703777,0.000049293172,0.0000037065481,0.000008206189,0.00072878395],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999038,0.000014044135,0.0001976865,0.0002795864,0.00019932468,0.00027140634],"domain_scores_gemma":[0.99930304,0.00010155761,0.00008653212,0.00023481852,0.00013940276,0.00013464964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022276066,0.00011333136,0.00010161632,0.00010576017,0.00011732849,0.00019883281,0.0007144831,0.00004486664,0.00003131071],"category_scores_gemma":[0.000056488778,0.00010864813,0.000032902346,0.00017562053,0.00004031779,0.0007231138,0.00020436612,0.00011987343,0.00003774533],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004749749,0.00008627319,0.038414627,0.000007540141,0.000053127605,0.0000026858004,0.00037457704,0.00021011446,0.00012665319,0.27754167,0.0010521251,0.68212587],"study_design_scores_gemma":[0.001977174,0.000070315684,0.1469935,0.00015282944,0.000040266597,0.0005591169,0.00013699275,0.68844736,0.00043469964,0.0028113567,0.15734623,0.0010301316],"about_ca_topic_score_codex":0.0000034871784,"about_ca_topic_score_gemma":0.0000034955467,"teacher_disagreement_score":0.68823725,"about_ca_system_score_codex":0.000038743172,"about_ca_system_score_gemma":0.00002391379,"threshold_uncertainty_score":0.4430542},"labels":[],"label_agreement":null},{"id":"W603536936","doi":"10.1007/978-1-4615-0288-3_24","title":"Effect of RTCP Bandwidth on Feedback Delay","year":2003,"lang":"en","type":"book-chapter","venue":"High Performance Computing Systems and Applications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"RTP Control Protocol; Session (web analytics); Computer science; Computer network; Multicast; Bandwidth (computing); Network packet; Internet Control Message Protocol; Protocol (science); Real-time computing; Medicine","score_opus":0.006432801402079048,"score_gpt":0.20782318950124304,"score_spread":0.20139038809916399,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W603536936","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016214434,0.007132578,0.6842648,0.000391561,0.0022398601,0.0048984895,0.000049134596,0.0008119712,0.2839972],"genre_scores_gemma":[0.96245146,0.00033792775,0.0005895105,0.0001332116,0.0005161887,0.00011113206,0.000018118135,0.000039353155,0.035803072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983942,0.000048793838,0.00050239696,0.00053685805,0.00027692242,0.00024086615],"domain_scores_gemma":[0.9983387,0.00031610942,0.00043605873,0.00068854145,0.00011805939,0.00010252095],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046360106,0.00034351158,0.00055819436,0.00012599153,0.00028370507,0.00010039006,0.0004685932,0.0002086025,0.0000053484036],"category_scores_gemma":[0.0000028339941,0.0002924085,0.000083215426,0.00009366479,0.000082291284,0.00007331594,0.00008912525,0.00029717418,0.00007129322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009923668,0.000015810549,0.0000411286,0.00038133198,0.000054257333,0.0000012203905,0.000027219317,0.0062148166,0.000004008448,0.6185021,0.0017184957,0.3730297],"study_design_scores_gemma":[0.0016529192,0.0012966421,0.0001619051,0.0020697804,0.00013753338,0.00011723973,0.0000028916165,0.41900834,0.000084268664,0.00048663674,0.57393956,0.001042277],"about_ca_topic_score_codex":0.00000497017,"about_ca_topic_score_gemma":3.2856033e-7,"teacher_disagreement_score":0.946237,"about_ca_system_score_codex":0.000040544965,"about_ca_system_score_gemma":0.000036709924,"threshold_uncertainty_score":0.9999528},"labels":[],"label_agreement":null},{"id":"W629066184","doi":"","title":"COMPILING TRAFFIC MODELS USING TSC","year":2001,"lang":"en","type":"article","venue":"Annual Simulation Symposium","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Compiler; Computer science; Template; Programming language; Code (set theory); Traffic model; Code generation; Software engineering; Parallel computing; Operating system; Computer network","score_opus":0.032073602652225044,"score_gpt":0.27476900615194333,"score_spread":0.2426954034997183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W629066184","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1501999,0.00010037322,0.84697115,0.0005967043,0.00039242473,0.00015355779,0.0000023837517,0.0003553305,0.0012281511],"genre_scores_gemma":[0.9947944,0.000013004366,0.0040643606,0.0005063708,0.00028424835,0.0000042326283,0.000004704922,0.000012685238,0.00031594487],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864525,0.000078527475,0.00029884186,0.0003663774,0.00029647275,0.00031451677],"domain_scores_gemma":[0.99906605,0.00016793088,0.000097030126,0.00033968088,0.0002119753,0.000117322736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020539635,0.00015705707,0.00017077419,0.000099707315,0.00023069167,0.00014820228,0.00039161908,0.000083934916,0.000016483304],"category_scores_gemma":[0.0000066705884,0.00015925647,0.00008019903,0.00041554423,0.000027102295,0.0012187965,0.000071522685,0.00011281649,0.000039448933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012282818,0.00003436416,0.00008447902,0.0000015667435,0.000010011717,0.000008241031,0.0005631519,0.9459986,0.00007005783,0.0061551775,0.00004957816,0.04701246],"study_design_scores_gemma":[0.00047690934,0.000032722823,0.000046629466,0.000012865726,0.000009861754,0.000013640137,0.000039333543,0.99473315,0.000008697086,0.00057876774,0.0038541397,0.00019325507],"about_ca_topic_score_codex":0.000007408553,"about_ca_topic_score_gemma":0.0000027672322,"teacher_disagreement_score":0.84459454,"about_ca_system_score_codex":0.000046090576,"about_ca_system_score_gemma":0.00005226314,"threshold_uncertainty_score":0.649429},"labels":[],"label_agreement":null},{"id":"W635273051","doi":"","title":"QoS-Aware Layer-2 Virtual Private Networks (VPNs) over EPON-WIMAX","year":2010,"lang":"en","type":"article","venue":"Institutional Repositories DataBase (IRDB)","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer network; Private network; WiMAX; Quality of service; Layer (electronics); Computer science; Telecommunications; Wireless; Materials science; Nanotechnology","score_opus":0.008642804793308334,"score_gpt":0.23222299863917195,"score_spread":0.2235801938458636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W635273051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.080745615,0.00034586666,0.88829666,0.00094649784,0.025768489,0.0003999629,0.00013408638,0.000783534,0.0025792732],"genre_scores_gemma":[0.98419195,0.00004765022,0.008590883,0.0007222562,0.005612251,0.000084275445,0.0002471481,0.00002282704,0.00048075902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99690884,0.000091544,0.00058142305,0.0009061491,0.0008893905,0.0006226534],"domain_scores_gemma":[0.99735427,0.0003102053,0.00022600219,0.0014328317,0.0003063306,0.0003703366],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043661872,0.00039378132,0.00032422555,0.00011909178,0.0009508198,0.00058533216,0.0013904073,0.00022871542,0.00007699202],"category_scores_gemma":[0.0002143308,0.00037095108,0.00015921787,0.00058217335,0.0004132837,0.002113549,0.0006672499,0.0008633114,0.0001275305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008289925,0.0001777508,0.00212743,0.000012496574,0.000091631235,0.00048394833,0.0000634288,0.0071622333,0.0029070596,0.94540256,0.013375257,0.02811331],"study_design_scores_gemma":[0.001702955,0.00015157893,0.005592275,0.00016167409,0.000058844165,0.0007497956,0.000017598142,0.33780104,0.0015641097,0.00067255605,0.6504527,0.0010748934],"about_ca_topic_score_codex":0.0000957394,"about_ca_topic_score_gemma":0.00012285305,"teacher_disagreement_score":0.94473,"about_ca_system_score_codex":0.00010570758,"about_ca_system_score_gemma":0.0005525373,"threshold_uncertainty_score":0.99987423},"labels":[],"label_agreement":null},{"id":"W635844038","doi":"10.1007/978-3-319-11701-0_5","title":"Adaptive Congestion Control (ACC)","year":2014,"lang":"en","type":"book-chapter","venue":"SpringerBriefs in computer science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Network congestion; Computer science; Computer network","score_opus":0.011505580994324728,"score_gpt":0.20632604808081406,"score_spread":0.19482046708648934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W635844038","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000038160022,0.00026447984,0.9325732,0.00077247253,0.00324522,0.00055837986,0.0000036681208,0.00043976717,0.06210468],"genre_scores_gemma":[0.88325113,0.000102478254,0.08674231,0.0037406317,0.0022045446,0.00007105215,0.0000037136845,0.000097793425,0.023786368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99496293,0.0000755714,0.00078953087,0.0019847646,0.001249111,0.0009380892],"domain_scores_gemma":[0.9965464,0.0004174493,0.00048687393,0.0017274442,0.00044773828,0.00037410893],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001900131,0.0006686135,0.0008205823,0.00075707963,0.00030855372,0.00063303835,0.004001401,0.0003504544,0.00005377282],"category_scores_gemma":[0.000047444286,0.000689062,0.0002071752,0.0004241325,0.0009206924,0.0007022606,0.0009016978,0.00092396693,0.00038085505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000966004,0.000011234001,0.0000141861165,0.000006949026,0.00001280217,0.000043436925,0.000045023444,0.005447596,0.000004638498,0.5568773,0.00017852763,0.43734863],"study_design_scores_gemma":[0.0012131743,0.0002974351,0.0004987419,0.0004032611,0.00002076682,0.000052980744,4.5676822e-7,0.93981993,0.0000137915695,0.020254672,0.036446262,0.0009785456],"about_ca_topic_score_codex":0.000019681662,"about_ca_topic_score_gemma":0.000034160308,"teacher_disagreement_score":0.9343723,"about_ca_system_score_codex":0.00038920654,"about_ca_system_score_gemma":0.0006748083,"threshold_uncertainty_score":0.99955606},"labels":[],"label_agreement":null},{"id":"W68716002","doi":"","title":"PARALLEL SIMULATION OF ATM NETWORKS: CASE STUDY AND LESSONS LEARNED","year":2007,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Saskatchewan","funders":"","keywords":"Asynchronous Transfer Mode; Computer science; Discrete event simulation; Network traffic simulation; Load balancing (electrical power); ATM adaptation layer; Network simulation; Broadband networks; Scheduling (production processes); Distributed computing; Synchronization (alternating current); Granularity; Simulation; Computer network; Real-time computing; Broadband; Network traffic control; Engineering; Telecommunications; Operating system","score_opus":0.04353702505136151,"score_gpt":0.3212447896980724,"score_spread":0.2777077646467109,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W68716002","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23678625,0.00009628391,0.76222456,0.00022824704,0.00007148336,0.00014823499,7.128444e-8,0.00007109181,0.00037380782],"genre_scores_gemma":[0.9953307,0.000006860022,0.004286132,0.00008737649,0.000051850828,0.0000026107396,2.039701e-7,0.0000033995966,0.00023089295],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992692,0.000047611185,0.00019944996,0.00021136845,0.00011354064,0.00015885005],"domain_scores_gemma":[0.99924153,0.0003323644,0.00006268822,0.00023259148,0.00006121233,0.00006959994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005159325,0.0000751341,0.000119337376,0.00004109983,0.00007997332,0.000038136266,0.00013233913,0.000036347283,0.0000068492554],"category_scores_gemma":[0.000012945392,0.00006413215,0.000022586033,0.00019478882,0.000024650253,0.00015088545,0.00006625207,0.00006627489,0.000002122589],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001286852,0.00008767079,0.0021146154,0.0000010299284,0.00001534046,0.00020799726,0.00038010508,0.3665847,0.0000011836493,0.00733262,0.000028447745,0.62323344],"study_design_scores_gemma":[0.00069568714,0.0001227784,0.0022926799,0.00000273197,0.0000094124425,0.00006087316,0.00047090498,0.99594337,0.0000010190267,0.0001663284,0.0001591896,0.00007503988],"about_ca_topic_score_codex":0.000061959174,"about_ca_topic_score_gemma":0.00027620702,"teacher_disagreement_score":0.75854445,"about_ca_system_score_codex":0.000006601278,"about_ca_system_score_gemma":0.00001291607,"threshold_uncertainty_score":0.26152334},"labels":[],"label_agreement":null},{"id":"W6931567372","doi":"10.5281/zenodo.4411963","title":"chakravala/AbstractTensors.jl v0.6.4","year":2021,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"","score_opus":0.02535190513163413,"score_gpt":0.2261034606286519,"score_spread":0.20075155549701776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931567372","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000993987,0.0009849605,0.08152795,0.001350496,0.0005058286,0.00037188036,0.0000715292,0.0028568825,0.91232055],"genre_scores_gemma":[0.01265318,0.00086739345,0.0038177276,0.0009139668,0.0019058777,1.7042862e-7,0.002388421,0.011491783,0.96596146],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975379,0.0003603177,0.00027147593,0.00080492615,0.0005329425,0.0004924257],"domain_scores_gemma":[0.99804807,0.000029009929,0.00020343896,0.0010934105,0.00037859904,0.0002474924],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00042652563,0.00027706483,0.0002962724,0.00031764034,0.0008918353,0.0013574273,0.0025191396,0.00021343959,0.046783105],"category_scores_gemma":[0.00019507647,0.00029896566,0.0001101926,0.00062004547,0.000116469644,0.00013138949,0.0014041312,0.0004760737,0.0127597535],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034520865,0.000052169064,1.1361232e-7,0.000031434953,0.00004607743,0.000048747283,0.000089319554,0.000018439618,0.000053553915,0.010308779,0.6646689,0.324679],"study_design_scores_gemma":[0.00036084367,0.00006831698,0.000025386329,0.00011392268,0.00001355467,0.00013741877,0.000025471965,0.0018679812,0.000015233396,0.00006667265,0.99699545,0.00030974948],"about_ca_topic_score_codex":0.0000149383995,"about_ca_topic_score_gemma":8.389535e-7,"teacher_disagreement_score":0.33232653,"about_ca_system_score_codex":0.00008178735,"about_ca_system_score_gemma":0.000011355131,"threshold_uncertainty_score":0.99994624},"labels":[],"label_agreement":null},{"id":"W6950017831","doi":"10.5281/zenodo.6536861","title":"Figure 3 in The record of Torosaurus (Ornithischia: Ceratopsidae) in Canada and its taxonomic implications","year":2022,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Holotype; Taxonomy (biology); Paratype; Race (biology); Context (archaeology)","score_opus":0.018306888963514203,"score_gpt":0.1985085941318664,"score_spread":0.18020170516835218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6950017831","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005135781,0.0017279346,0.001858086,0.0058243703,0.00033014416,0.0017543761,0.00058436004,0.00040659393,0.98237836],"genre_scores_gemma":[0.9450128,0.0011356542,0.00055176334,0.0012598034,0.00029437334,0.0000024590931,0.0009875329,0.0029602775,0.04779533],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986229,0.00039490574,0.00022875234,0.00033846247,0.00020437298,0.00021059257],"domain_scores_gemma":[0.9992223,0.000054261498,0.00014975114,0.00045804662,0.000061006318,0.000054678603],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00036510418,0.00011824624,0.0001627133,0.00019285265,0.0003151899,0.00015979048,0.0015362813,0.00004777712,0.008802739],"category_scores_gemma":[0.00009479254,0.00011180356,0.00001963951,0.00052522874,0.00003070116,0.00007603537,0.0006217493,0.00034948083,0.0001224049],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072497087,0.000038594484,0.000053307856,0.0000295463,0.000014297905,0.00001198553,0.00025265105,0.00008463448,0.000014559403,0.015598065,0.8196927,0.16420245],"study_design_scores_gemma":[0.00025973094,0.000037799604,0.0014137081,0.00002311247,0.0000035398205,0.00002039446,0.0000993005,0.0012353561,0.0000010193777,0.0000437547,0.99675167,0.00011059402],"about_ca_topic_score_codex":0.035164077,"about_ca_topic_score_gemma":0.038391907,"teacher_disagreement_score":0.93987703,"about_ca_system_score_codex":0.00024248207,"about_ca_system_score_gemma":0.000056038367,"threshold_uncertainty_score":0.99210334},"labels":[],"label_agreement":null},{"id":"W6976845232","doi":"10.6084/m9.figshare.12160533.v1","title":"Additional file 4 of Protection of the transplant kidney during cold perfusion with doxycycline: proteomic analysis in a rat model","year":2020,"lang":"en","type":"other","venue":"Figshare","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; University of Saskatchewan","funders":"","keywords":"Rat model; Kidney; Perfusion; Cold storage; Transplantation","score_opus":0.009537791302168343,"score_gpt":0.17730864279001254,"score_spread":0.1677708514878442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6976845232","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004380624,0.000014562072,0.00068342517,0.000094500494,0.00001138142,0.00077963585,0.9954762,0.000059986425,0.002875932],"genre_scores_gemma":[0.017188197,0.0000060140205,0.0059887567,0.00022583189,0.0003053355,0.008312475,0.8827321,0.00018674764,0.085054554],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990401,0.00005111454,0.00020490565,0.00030287038,0.00028589234,0.00011509966],"domain_scores_gemma":[0.9992232,0.00005858853,0.00033490045,0.00028734142,0.000043114724,0.000052872216],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000014583193,0.00015371642,0.0002886208,0.00017313471,0.000030011457,0.0000146241355,0.0004500331,0.00012628287,0.74005973],"category_scores_gemma":[0.00009912457,0.00010810442,0.00013897459,0.0007980836,0.000009893431,0.000047716912,0.000059270547,0.00021067,0.0000350778],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002172189,0.000025017545,9.992475e-7,0.00018004092,0.000053671993,0.0000032031364,0.000037441656,0.006417494,0.0000647162,0.0000048579336,0.9927158,0.00047506415],"study_design_scores_gemma":[0.0005612084,0.00005130011,0.00012878263,0.012294394,0.00006655013,0.000003845891,0.0000020806037,0.84619963,0.00036127944,0.000003649574,0.14008386,0.00024343515],"about_ca_topic_score_codex":0.000009514601,"about_ca_topic_score_gemma":0.00010698553,"teacher_disagreement_score":0.8526319,"about_ca_system_score_codex":0.000021729347,"about_ca_system_score_gemma":0.00028929714,"threshold_uncertainty_score":0.440837},"labels":[],"label_agreement":null},{"id":"W6984043559","doi":"","title":"Murray Pulver","year":2017,"lang":"en","type":"other","venue":"Bulletin of Miscellaneous Information (Royal Gardens Kew)","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Inflatable; Set (abstract data type); Singing; Launched; Collectable","score_opus":0.0056869658625787614,"score_gpt":0.1806211172063504,"score_spread":0.17493415134377163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6984043559","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[6.543198e-7,0.0005372132,0.000109601926,0.00034111855,0.00083099154,0.0002874181,0.000025088992,0.00038233152,0.9974856],"genre_scores_gemma":[0.00041645102,0.00023062031,0.0029276912,0.0003742877,0.00029508455,0.000015789896,0.000027409063,0.000061516526,0.9956511],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99858415,0.00005443787,0.00038161312,0.00025712658,0.00041272282,0.00030993047],"domain_scores_gemma":[0.99800617,0.00006957215,0.0007056632,0.00096356525,0.00012426937,0.00013076307],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00020172975,0.00030522168,0.00038962835,0.00006787578,0.000107936474,0.00017695373,0.0013650206,0.00035455488,0.14178896],"category_scores_gemma":[0.00006487824,0.0002925313,0.00016854139,0.0000046285086,0.000112165486,3.6091487e-7,0.00017579603,0.00024990362,0.017432379],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000093412245,0.000017801362,4.7080323e-7,0.0000762901,0.000043242344,0.000016459358,0.00003067256,0.00009447392,2.6098416e-8,0.00047449698,0.91901475,0.080221966],"study_design_scores_gemma":[0.00043644648,0.000057362016,0.000002695697,0.00020721681,0.0000234825,0.000039132134,0.0000040067002,0.000544399,9.660178e-7,0.000017010792,0.99835944,0.00030784262],"about_ca_topic_score_codex":0.0010273218,"about_ca_topic_score_gemma":0.00057319074,"teacher_disagreement_score":0.12435658,"about_ca_system_score_codex":0.000025957099,"about_ca_system_score_gemma":0.000050827442,"threshold_uncertainty_score":0.9999527},"labels":[],"label_agreement":null},{"id":"W6986352420","doi":"","title":"Performance Analysis of Wireless Multiprotocol Label Switching (WMPLS) Networks","year":2003,"lang":"en","type":"article","venue":"NPARC","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Multiprotocol Label Switching; Wireless; Wireless Application Protocol; Wireless network; Asynchronous communication; Wi-Fi array; Fixed wireless; Wireless WAN; Mode (computer interface)","score_opus":0.012363771494543945,"score_gpt":0.23539203845128248,"score_spread":0.22302826695673852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6986352420","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20286001,0.000023374287,0.7897274,0.00008011189,0.00014550179,0.00078284356,5.9121936e-7,0.000103354396,0.0062767942],"genre_scores_gemma":[0.98613405,0.0000126798905,0.013237156,0.00015182157,0.000033928412,0.00029650872,9.0133057e-7,0.0000065634727,0.00012635998],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880344,0.000095813746,0.0002883895,0.0002931885,0.00023508359,0.0002840727],"domain_scores_gemma":[0.9990705,0.000119765136,0.00014251057,0.0004829927,0.0001003751,0.00008384176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041409137,0.00012645256,0.0002886118,0.00015077267,0.00011087927,0.000049082744,0.0005041683,0.0000624715,0.00005850947],"category_scores_gemma":[0.000016989203,0.000115058036,0.00010119764,0.0012586522,0.000026291613,0.00022073077,0.00005097289,0.00015028317,0.000008072822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016579163,0.00012044784,0.017076619,0.000012822288,0.00033741829,0.000004071375,0.00023093005,0.07526112,0.0013044749,0.06530128,0.00018675234,0.8401475],"study_design_scores_gemma":[0.00050508557,0.000039893323,0.0026663295,0.000016719296,0.00008003716,0.0000015389282,0.0000073525953,0.99554837,0.00022673844,0.00012223553,0.00065454247,0.00013118061],"about_ca_topic_score_codex":0.0000033599692,"about_ca_topic_score_gemma":0.000008758018,"teacher_disagreement_score":0.92028725,"about_ca_system_score_codex":0.000019335637,"about_ca_system_score_gemma":0.000045830187,"threshold_uncertainty_score":0.46919304},"labels":[],"label_agreement":null},{"id":"W6992792768","doi":"","title":"A minimum-work weighted fair queuing algorithm for guaranteed end-to-end and quality-of-service in packet networks","year":2002,"lang":"en","type":"other","venue":"cIRcle (University of British Columbia)","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Weighted fair queueing; Fair queuing; Quality of service; Jitter; Scheduling (production processes); Scalability; Queueing theory; Generalized processor sharing; Network packet","score_opus":0.012127405059962768,"score_gpt":0.1933895603575737,"score_spread":0.18126215529761094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6992792768","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02214808,0.003654846,0.9570524,0.00064042344,0.0008723522,0.002171363,0.00056508946,0.0004508204,0.012444631],"genre_scores_gemma":[0.7280922,0.0013927852,0.15629326,0.0014274544,0.0007080623,0.000028280318,0.00015251832,0.00042913502,0.1114763],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980448,0.00015657394,0.00030924447,0.00076655607,0.00030077808,0.0004220597],"domain_scores_gemma":[0.9985292,0.0002571033,0.000394784,0.00048926263,0.00016350602,0.00016617078],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038632576,0.0001333704,0.0007815527,0.00019195824,0.00010629,0.00011729984,0.00090833247,0.000378445,0.00014653332],"category_scores_gemma":[0.000014630626,0.0004075924,0.0001527969,0.00093162624,0.00014346879,0.00016144147,0.0002444363,0.00023030848,0.0000069983153],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012453323,0.00008852184,0.00031711892,0.00011457413,0.00007410118,0.000048934453,0.00023416821,0.000035736815,0.0000011802991,0.000028782624,0.030597592,0.96844685],"study_design_scores_gemma":[0.013818178,0.000508585,0.24095649,0.006641646,0.00024521572,0.00007753475,0.0012410629,0.6684955,1.9993556e-7,0.0004216763,0.06505778,0.0025361704],"about_ca_topic_score_codex":0.045080554,"about_ca_topic_score_gemma":0.25512722,"teacher_disagreement_score":0.9659107,"about_ca_system_score_codex":0.000048941474,"about_ca_system_score_gemma":0.00006886883,"threshold_uncertainty_score":0.9998376},"labels":[],"label_agreement":null},{"id":"W6996130651","doi":"","title":"Quality-of-service routing for Voice-over-IP in service overlay networks","year":2010,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; McGill University","keywords":"Routing (electronic design automation); Service (business); Overlay network; Quality of service; Overlay; Convergence (economics); Policy-based routing","score_opus":0.019971063463114013,"score_gpt":0.2682842990868747,"score_spread":0.24831323562376068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6996130651","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9666515,0.0006382569,0.0008778899,0.00038395383,0.008581806,0.0029111155,0.0005637579,0.00084456103,0.018547144],"genre_scores_gemma":[0.9891455,0.00006565906,0.0054694805,0.0025808976,0.00025857243,0.0003881764,0.00058423606,0.00017302354,0.0013344565],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9934639,0.0005667164,0.002009503,0.00173679,0.0009947929,0.0012283191],"domain_scores_gemma":[0.9932344,0.0018308697,0.0016795391,0.0016315007,0.0012527463,0.00037092794],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["research_integrity"],"category_scores_codex":[0.0029175812,0.00097136426,0.0014104533,0.00044437108,0.0007514814,0.00022705391,0.0029604612,0.0016045613,0.000047971746],"category_scores_gemma":[0.000627999,0.0010906662,0.0004878503,0.0019433292,0.000029935296,0.0013201986,0.00031621434,0.0026631907,0.000066784254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042290633,0.00029058286,0.00012604578,0.000682838,0.00018944775,0.00001633887,0.000055734115,0.004198687,0.0042408714,0.36278027,0.000011441939,0.62698483],"study_design_scores_gemma":[0.022090148,0.0008826846,0.04541587,0.005614071,0.00079442625,0.00005826669,0.0010320192,0.69622695,0.008927638,0.08172039,0.12591802,0.011319531],"about_ca_topic_score_codex":0.0013471311,"about_ca_topic_score_gemma":0.04257919,"teacher_disagreement_score":0.6920282,"about_ca_system_score_codex":0.0003194239,"about_ca_system_score_gemma":0.00018592688,"threshold_uncertainty_score":0.99969155},"labels":[],"label_agreement":null},{"id":"W6999134194","doi":"","title":"Capacity allocation in service overlay networks","year":2011,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Politechnika Warszawska; Lunds Universitet; McGill University","keywords":"Quality of service; Overlay network; Blocking (statistics); Overlay; Optimization problem; The Internet; Routing (electronic design automation); Provisioning; Bandwidth (computing)","score_opus":0.018248768159805518,"score_gpt":0.21394401037582136,"score_spread":0.19569524221601584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6999134194","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8424671,0.0010607146,0.00048563373,0.00019319463,0.009218339,0.002265608,0.00015963464,0.0017144728,0.14243525],"genre_scores_gemma":[0.99237275,0.00021821145,0.001924183,0.0011788107,0.000121691206,0.00026452908,0.00032316375,0.000113100614,0.0034835401],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950953,0.0005282899,0.0010655927,0.0015696031,0.0007573691,0.0009838095],"domain_scores_gemma":[0.9966468,0.0002547396,0.0006947759,0.0014109495,0.0006192045,0.0003735181],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011244104,0.0008406805,0.0008034716,0.0004494223,0.0006107511,0.00019193366,0.0022515655,0.0011396642,0.000114165094],"category_scores_gemma":[0.000154512,0.0009409083,0.00026765573,0.0015306749,0.00003291668,0.0015690597,0.00019611124,0.0020655128,0.00038094018],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010538077,0.00022404955,0.000044448458,0.00010773598,0.00009817933,0.00004572488,0.000030048457,0.0021788853,0.00048736556,0.35519987,0.000014046865,0.64146423],"study_design_scores_gemma":[0.014270395,0.0011950741,0.05118765,0.0057812515,0.0010113576,0.00026281804,0.0005219723,0.4845506,0.013154118,0.20945928,0.2026135,0.01599201],"about_ca_topic_score_codex":0.000957096,"about_ca_topic_score_gemma":0.013695794,"teacher_disagreement_score":0.62547225,"about_ca_system_score_codex":0.0004940711,"about_ca_system_score_gemma":0.000109571454,"threshold_uncertainty_score":0.9993042},"labels":[],"label_agreement":null},{"id":"W7018498222","doi":"","title":"Dynamic multilateral peering : an efficient mechanism for controlled resource sharing","year":2004,"lang":"en","type":"dissertation","venue":"Mspace (University of Manitoba)","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Peering; Shared resource; Resource (disambiguation); Load sharing; Resource allocation","score_opus":0.00907773508096901,"score_gpt":0.20631955574301653,"score_spread":0.1972418206620475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7018498222","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5315503,0.00009729853,0.4650098,0.00046468855,0.000767805,0.0011215206,0.000013512047,0.0003131649,0.00066190585],"genre_scores_gemma":[0.97864354,0.000012327414,0.017592113,0.00003560595,0.000054042353,0.000005727159,0.0001362035,0.00003253713,0.003487904],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837196,0.000043149834,0.00018340068,0.0006759591,0.00035186304,0.00037365465],"domain_scores_gemma":[0.99862874,0.00007422605,0.0003659449,0.000523444,0.00027205973,0.00013557058],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026203587,0.000291705,0.0005675447,0.00025969473,0.00037677473,0.00009861985,0.0012911652,0.0002592235,0.0000026316582],"category_scores_gemma":[0.000017486755,0.00036943136,0.00029695302,0.00016782638,0.000027607133,0.00022184946,0.00011186027,0.00024168011,0.000010348748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006876751,0.0011874988,0.00021661444,0.0013300441,0.0013360046,0.00033293694,0.015219474,0.45616192,0.004493728,0.3956381,0.00046709593,0.116739824],"study_design_scores_gemma":[0.005854512,0.00018890656,0.0013095952,0.00022208632,0.00013697123,0.000003490025,0.0043255314,0.98657495,0.000045864803,0.0006923907,0.00025426247,0.00039144992],"about_ca_topic_score_codex":0.00024269318,"about_ca_topic_score_gemma":0.05198994,"teacher_disagreement_score":0.53041303,"about_ca_system_score_codex":0.00021619425,"about_ca_system_score_gemma":0.0001223203,"threshold_uncertainty_score":0.9998758},"labels":[],"label_agreement":null},{"id":"W7025021706","doi":"","title":"Suomen lapsiasiain toimikunta. Esitys lapsiasiainvaltuutetusta ja lapsi- ja perheasioiden koordinaatiosta. &#13;\\nKommissionen för barnfrågor i Finland. Framställning om en barnombudsman och koordinering av barn- och familjefrågor","year":2004,"lang":"fi","type":"other","venue":"STM:n Hallinnonalan avoin julkaisuarkisto (Julkari)","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quarter (Canadian coin); Data collection; Context (archaeology)","score_opus":0.012574768094535444,"score_gpt":0.23966247989668735,"score_spread":0.2270877118021519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7025021706","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015465215,0.028896019,0.34504682,0.022610376,0.015568265,0.013106249,0.0019646552,0.0054953764,0.55184704],"genre_scores_gemma":[0.35012808,0.002967256,0.019858334,0.0033668664,0.00808806,0.0008515717,0.0016933345,0.0022178653,0.61082864],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9718412,0.0035071848,0.005453859,0.00780803,0.0049796086,0.0064100907],"domain_scores_gemma":[0.98248893,0.0033231988,0.0032456063,0.0060019954,0.0014457989,0.0034944825],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"category_scores_codex":[0.0057941093,0.0058138897,0.0060450505,0.0027535707,0.0031030234,0.0031474757,0.009459754,0.004334855,0.009440895],"category_scores_gemma":[0.0013515265,0.006116449,0.0023985216,0.0039712344,0.0013354731,0.0018193985,0.0033495114,0.0073461197,0.009413015],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028123527,0.0057091485,0.017437417,0.0055373884,0.007508565,0.008784286,0.021863578,0.049945284,0.0021383683,0.061635483,0.26281014,0.553818],"study_design_scores_gemma":[0.011033662,0.0014287998,0.0059685223,0.005786297,0.0012492189,0.0007287102,0.0017771387,0.07869972,0.00014715592,0.002419085,0.8823669,0.008394776],"about_ca_topic_score_codex":0.002973499,"about_ca_topic_score_gemma":0.002225265,"teacher_disagreement_score":0.6195568,"about_ca_system_score_codex":0.0031534696,"about_ca_system_score_gemma":0.005092883,"threshold_uncertainty_score":0.9981948},"labels":[],"label_agreement":null},{"id":"W7031759001","doi":"","title":"","year":2021,"lang":"fr","type":"other","venue":"Directory of Open access Books (OAPEN Foundation)","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Ethnography; Power (physics); Field (mathematics); Hegemony","score_opus":0.10884411019348812,"score_gpt":0.3879801216985837,"score_spread":0.2791360115050956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7031759001","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003099988,0.004315915,0.14491403,0.0065694647,0.010252323,0.0053963205,0.0000066463567,0.00033714148,0.8251082],"genre_scores_gemma":[0.10295766,0.0012290203,0.012149589,0.0034115666,0.0016289155,0.0011163009,0.0005481811,0.00051833806,0.8764404],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9872716,0.0023298578,0.0030863858,0.0037923828,0.0019050546,0.0016146831],"domain_scores_gemma":[0.9868931,0.0017843116,0.004130629,0.004041106,0.0022558456,0.0008950145],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["metaepi_narrow","open_science","insufficient_payload"],"category_scores_codex":[0.0022727507,0.001858509,0.0034519685,0.0008808073,0.0011463186,0.023451796,0.027344972,0.00055430573,0.132118],"category_scores_gemma":[0.00064232224,0.002116531,0.00086529076,0.0021063213,0.0012630168,0.0129416725,0.0137291765,0.00120276,0.0011622648],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012574893,0.0005553605,0.0042937566,0.0003235922,0.0008911608,0.00013306177,0.0003748787,0.0009115604,0.00020847104,0.38709992,0.0015055388,0.60357696],"study_design_scores_gemma":[0.0037164106,0.00016311121,0.039493375,0.0032986484,0.00034436974,0.00006288325,0.00007238856,0.025231505,0.00052545266,0.003057344,0.9217542,0.0022803217],"about_ca_topic_score_codex":0.0051954878,"about_ca_topic_score_gemma":0.008980733,"teacher_disagreement_score":0.9202486,"about_ca_system_score_codex":0.0005972482,"about_ca_system_score_gemma":0.005260397,"threshold_uncertainty_score":0.99961543},"labels":[],"label_agreement":null},{"id":"W7045221881","doi":"","title":"Active congestion control using ABCD (available bandwidth-based congestion detection).","year":2004,"lang":"en","type":"dissertation","venue":"Scholarship at UWindsor (University of Windsor)","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Network congestion; Flow control (data); Explicit Congestion Notification; Packet loss; Network packet; Router; Throughput; Active queue management","score_opus":0.014201355853084428,"score_gpt":0.21118446543906158,"score_spread":0.19698310958597715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7045221881","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8973333,0.0009851196,0.091077745,0.0005925518,0.0030628995,0.0017765054,0.0001491828,0.0007352901,0.0042873635],"genre_scores_gemma":[0.99157834,0.000047053927,0.0028272546,0.00014089177,0.0001769259,0.000005692835,0.00029413018,0.00006366827,0.0048660645],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99585545,0.0004931656,0.0005156905,0.0013310371,0.0010626381,0.0007420355],"domain_scores_gemma":[0.9960474,0.0003197772,0.0011821535,0.0009916774,0.0010722217,0.00038681395],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00077947293,0.00070193125,0.0009600474,0.0007973821,0.001164011,0.0001896256,0.0015231266,0.001186159,0.00051802],"category_scores_gemma":[0.00015117158,0.00092602754,0.0005255436,0.0009914598,0.00021950137,0.0017901114,0.000105857005,0.0012742288,0.00036205133],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.02135358,0.0026501955,0.010991588,0.0021177465,0.0041092993,0.0010628749,0.007396538,0.1394891,0.122144096,0.007916667,0.0015276336,0.6792407],"study_design_scores_gemma":[0.08208714,0.0039197314,0.4744786,0.007751003,0.006807213,0.00030264352,0.0042393263,0.33385247,0.052080445,0.0050002537,0.017856384,0.011624813],"about_ca_topic_score_codex":0.00029420093,"about_ca_topic_score_gemma":0.0013835818,"teacher_disagreement_score":0.6676159,"about_ca_system_score_codex":0.0010181649,"about_ca_system_score_gemma":0.0012970449,"threshold_uncertainty_score":0.999319},"labels":[],"label_agreement":null},{"id":"W7071926719","doi":"","title":"XML-based Internet performance analysis","year":2000,"lang":"en","type":"other","venue":"Mspace (University of Manitoba)","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"XML; Markup language; The Internet; XHTML; RuleML; HTML; SGML","score_opus":0.007598576634372132,"score_gpt":0.16730108757436707,"score_spread":0.15970251093999493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7071926719","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002696197,0.0004169645,0.5234347,0.0010282237,0.00031878904,0.00024101003,0.000022589507,0.00064573385,0.47119582],"genre_scores_gemma":[0.36246017,0.00033849484,0.015417956,0.00024076238,0.00018529814,7.4160266e-7,0.000055425593,0.00010716563,0.621194],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989816,0.00006156234,0.00007469016,0.00040062555,0.0002662434,0.00021527159],"domain_scores_gemma":[0.9990438,0.000029699717,0.00020138126,0.00061338703,0.000026828511,0.000084899846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007085244,0.00019358317,0.0003876765,0.0005876146,0.00005579163,0.000030721698,0.0012199092,0.00018376822,0.00035301328],"category_scores_gemma":[0.0000011201585,0.00023958774,0.00023591101,0.0007270074,0.000096380136,0.0001065881,0.00010806862,0.00016580867,0.0002705944],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053378215,0.00012988917,0.012282538,0.00008691339,0.0012980934,0.00008034592,0.000099119585,0.004879362,0.0000016723292,0.0011330154,0.8337957,0.14615995],"study_design_scores_gemma":[0.00053207966,0.00007195901,0.007344501,0.00009638607,0.0003943179,0.0000010111005,0.000056557827,0.39796364,0.0000028227128,0.0000032804567,0.59322685,0.00030660725],"about_ca_topic_score_codex":0.0007740701,"about_ca_topic_score_gemma":0.074243635,"teacher_disagreement_score":0.5080167,"about_ca_system_score_codex":0.00003476967,"about_ca_system_score_gemma":0.00006508421,"threshold_uncertainty_score":0.9770104},"labels":[],"label_agreement":null},{"id":"W7072297103","doi":"","title":"Wireless GINI : an emulator for ad-hoc wireless local area networks","year":2005,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Local area network; Wi-Fi; Wireless network; Overlay; Wireless; Popularity; Overlay network; Reliability (semiconductor); Key (lock)","score_opus":0.013537024586807845,"score_gpt":0.23536038833219008,"score_spread":0.22182336374538225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7072297103","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94323665,0.0039167805,0.016373733,0.00021131884,0.012865231,0.0049310424,0.00096761767,0.0039285417,0.013569115],"genre_scores_gemma":[0.9877393,0.00050055404,0.0033936957,0.00089242903,0.00048199345,0.00073995575,0.0011300456,0.0003090082,0.0048129736],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9926332,0.0004383115,0.0014613514,0.002587328,0.0011421471,0.0017376238],"domain_scores_gemma":[0.9944837,0.0005900112,0.00094990025,0.0020327843,0.0009334536,0.0010101694],"candidate_categories":["metaepi_narrow","sts","research_integrity"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0011309412,0.001433014,0.0014471877,0.0004278823,0.0017265511,0.0005135471,0.0033344922,0.0016787025,0.00009239863],"category_scores_gemma":[0.00008877143,0.0015481951,0.0007419241,0.00090917177,0.000119488985,0.0020603144,0.00022765643,0.002050781,0.00013122345],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033516414,0.00027003503,0.000004085827,0.0000872716,0.00018015919,0.000041838048,0.000013302801,0.005272156,0.00021361095,0.13718167,0.000033970573,0.85636675],"study_design_scores_gemma":[0.0049344203,0.0010426915,0.00037382075,0.0010347095,0.00046707146,0.00007428295,0.00035597294,0.8270427,0.0016895195,0.007820573,0.15088838,0.0042758565],"about_ca_topic_score_codex":0.000025034731,"about_ca_topic_score_gemma":0.0021999564,"teacher_disagreement_score":0.8520909,"about_ca_system_score_codex":0.00070235477,"about_ca_system_score_gemma":0.00021889561,"threshold_uncertainty_score":0.999842},"labels":[],"label_agreement":null},{"id":"W7084397258","doi":"10.5281/zenodo.17244442","title":"L'Europe Unie - is indexed or registered in more than 25 international databasis, e.g Erih Plus, EBSCO, DOAJ, CEEOL, Jisc","year":2025,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Context (archaeology); Commons; Notice; European union; Politics","score_opus":0.04349728463941658,"score_gpt":0.2886476232852591,"score_spread":0.24515033864584254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7084397258","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020089116,0.00092006766,0.5814675,0.061336245,0.0025625175,0.0024004339,0.0006345329,0.0043215565,0.32626805],"genre_scores_gemma":[0.96887743,0.0005723322,0.0024155246,0.0032553289,0.00027052054,4.9446095e-7,0.0010259107,0.00062443374,0.02295801],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976946,0.0003072844,0.00040166176,0.000707872,0.00047295645,0.00041559123],"domain_scores_gemma":[0.99823314,0.00005500269,0.00013587755,0.0009276893,0.0005051283,0.0001431384],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006098023,0.00019841189,0.00021077572,0.0004764287,0.00076055364,0.0011690818,0.003098504,0.00007628995,0.0028648328],"category_scores_gemma":[0.0004606224,0.00019259834,0.00005136967,0.001554355,0.00014988947,0.00067705667,0.0023351219,0.00036919545,0.0013165878],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026226437,0.00018125707,0.00007458434,0.000053997835,0.00010150405,0.00012198886,0.0016104901,0.00035481274,0.00038632617,0.059836872,0.4447224,0.49229348],"study_design_scores_gemma":[0.0013418059,0.00006427761,0.002092704,0.00011182811,0.000008443384,0.000039717663,0.00014429411,0.03422792,0.00006677736,0.00017096972,0.96152204,0.00020920279],"about_ca_topic_score_codex":0.0000354309,"about_ca_topic_score_gemma":0.000005604361,"teacher_disagreement_score":0.94878834,"about_ca_system_score_codex":0.00020317615,"about_ca_system_score_gemma":0.000037071924,"threshold_uncertainty_score":0.9998678},"labels":[],"label_agreement":null},{"id":"W70847832","doi":"","title":"On the effectiveness of alternative paths in QoS routing: Research Articles","year":2004,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Computer network; Link-state routing protocol; Policy-based routing; Equal-cost multi-path routing; Static routing; Multipath routing; Dynamic Source Routing; Routing (electronic design automation); Distributed computing; Bandwidth (computing); Routing protocol","score_opus":0.05460799126789965,"score_gpt":0.3443266471273235,"score_spread":0.28971865585942386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W70847832","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8075151,0.0010384498,0.18126835,0.0061558145,0.0012584636,0.0003697134,0.0000019469542,0.000015171535,0.002377012],"genre_scores_gemma":[0.99946016,0.000104795596,0.00026656853,0.000044368302,0.00009354451,0.000016948348,4.284233e-7,0.0000041850053,0.000009028387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99642164,0.0019605688,0.0005352763,0.00009083286,0.0008808697,0.000110812965],"domain_scores_gemma":[0.99383974,0.003913024,0.000423344,0.00043055136,0.0013591984,0.00003411608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072322446,0.00006582485,0.00016011004,0.0002760589,0.00006025176,0.00012691275,0.0024122111,0.0000332138,0.0000020415298],"category_scores_gemma":[0.00059319416,0.000045385183,0.00006457179,0.00032028294,0.00009079356,0.00027862602,0.00016132217,0.00036939842,0.000009470514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012564445,0.0001525062,0.0005498797,0.0000020855894,0.000060199145,0.000010055564,0.0009373106,0.094799705,0.00032271838,0.89676356,0.000037610826,0.006238748],"study_design_scores_gemma":[0.01562034,0.0017276417,0.054862905,0.013290085,0.00002724891,0.00043818017,0.0048699104,0.4051043,0.018311907,0.48162907,0.0034480742,0.0006703268],"about_ca_topic_score_codex":0.00012619709,"about_ca_topic_score_gemma":0.000011251506,"teacher_disagreement_score":0.41513446,"about_ca_system_score_codex":0.00020827299,"about_ca_system_score_gemma":0.00014192646,"threshold_uncertainty_score":0.4482529},"labels":[],"label_agreement":null},{"id":"W7095332901","doi":"","title":"Author manuscript, published in &amp;quot;ACM SIGCOMM, Canada (2011)&amp;quot; Predicting and Tracking Internet Path Changes","year":2013,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Path (computing); traceroute; Tracking (education); The Internet; Path analysis (statistics); Trajectory","score_opus":0.027908870653685327,"score_gpt":0.2206949128145698,"score_spread":0.19278604216088446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7095332901","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72720516,0.0013347379,0.18876718,0.07246451,0.0033433787,0.0012842857,0.000010624059,0.00087903324,0.0047110775],"genre_scores_gemma":[0.9725254,0.000014329715,0.010531636,0.0022017353,0.00023584004,0.000109422996,0.0000119384795,0.00002075746,0.014348926],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975455,0.0001560304,0.0004554755,0.0007244674,0.00042239283,0.00069614203],"domain_scores_gemma":[0.99817705,0.00033049608,0.00016336408,0.00085783016,0.000160493,0.00031078563],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006240625,0.0002993328,0.00035343345,0.0001748877,0.00012124801,0.00089699053,0.0012810377,0.0001274212,0.0006638646],"category_scores_gemma":[0.00023597444,0.00026053275,0.000039197377,0.0002804024,0.0000528383,0.0011035253,0.000525175,0.00040981383,0.000054092397],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000120513905,0.000083671854,0.0424829,0.000044170985,0.000053957818,0.000030056828,0.002244727,0.00012553296,0.00014366761,0.0056130206,0.3336769,0.6154893],"study_design_scores_gemma":[0.0033364587,0.00024265374,0.13455592,0.0003877407,0.000047021007,0.00017591463,0.001225003,0.54582447,0.00014613078,0.0036054114,0.30839768,0.0020556],"about_ca_topic_score_codex":0.25143203,"about_ca_topic_score_gemma":0.75656945,"teacher_disagreement_score":0.6134337,"about_ca_system_score_codex":0.00013037348,"about_ca_system_score_gemma":0.00019945133,"threshold_uncertainty_score":0.9999847},"labels":[],"label_agreement":null},{"id":"W7096748852","doi":"","title":"Les Cahiers du GERAD ISSN: 0711–2440 Delay analysis of multichannel opportunistic spectrum access","year":2014,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Context (archaeology); Access to information; Transparency (behavior)","score_opus":0.01894585295573506,"score_gpt":0.2518887063790254,"score_spread":0.23294285342329032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7096748852","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022154095,0.00004555181,0.96933347,0.0024133567,0.00027231552,0.0001029519,0.0000034802897,0.00018179092,0.005493002],"genre_scores_gemma":[0.99333054,0.000029733179,0.004704111,0.0007587956,0.000108257605,0.0000104017745,0.000007510763,0.000008160471,0.0010424744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984979,0.00011638202,0.0003654127,0.0004214771,0.0002883053,0.0003105466],"domain_scores_gemma":[0.9985783,0.00033172738,0.00017229798,0.00061729335,0.00011305721,0.00018734371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041677846,0.0001755437,0.0004052027,0.00031742794,0.000148059,0.000146521,0.001133126,0.00008886775,0.00020121719],"category_scores_gemma":[0.00006485044,0.0001485531,0.00019951668,0.0009935094,0.00010439896,0.00028064215,0.00012453826,0.0001234039,0.000018440516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020065678,0.00014268221,0.0029600696,0.0000129033715,0.00090443366,0.000023610713,0.00045671832,0.033441234,0.000038468002,0.65929276,0.0015437338,0.30116332],"study_design_scores_gemma":[0.00033545675,0.000053476768,0.004342736,0.0000058811484,0.0002751279,0.0000035114915,0.00002204331,0.9919116,0.000052017444,0.0010793606,0.0017276413,0.00019116979],"about_ca_topic_score_codex":0.00037690665,"about_ca_topic_score_gemma":0.00043332847,"teacher_disagreement_score":0.97117645,"about_ca_system_score_codex":0.000034857785,"about_ca_system_score_gemma":0.000047969163,"threshold_uncertainty_score":0.605782},"labels":[],"label_agreement":null},{"id":"W7096839926","doi":"","title":"MBone Webcast: Network Setup and Data Collection","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Multicast; IP multicast; Asymmetric digital subscriber line; Session (web analytics); Pragmatic General Multicast; Source-specific multicast; Xcast; Reliable multicast; The Internet; Protocol Independent Multicast","score_opus":0.02283547352627819,"score_gpt":0.24015490611361054,"score_spread":0.21731943258733236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7096839926","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011001163,0.00065503607,0.97356844,0.001226851,0.00060042774,0.000118462805,6.219498e-7,0.00020321252,0.02252683],"genre_scores_gemma":[0.9041889,0.00013590037,0.08667175,0.0012915962,0.00020926722,0.000010036551,0.0000058288306,0.00000763253,0.0074791173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916804,0.00007238181,0.00011295936,0.00034372867,0.000105680774,0.00019721693],"domain_scores_gemma":[0.99918634,0.00008466396,0.000029910543,0.0005950617,0.000026335052,0.00007767014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036378534,0.00007708214,0.00009311004,0.000022396394,0.00016014633,0.0001291328,0.00036478712,0.000037337784,0.000057270252],"category_scores_gemma":[0.000023084966,0.000067857516,0.000010615422,0.000330734,0.00002207318,0.00032830512,0.00013738744,0.0000702678,0.00003529319],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064166306,0.00003388201,0.001446712,0.0000030363472,0.000027358794,0.000008880137,0.000051576466,0.0007402403,0.000008500068,0.44457376,0.22085139,0.33224824],"study_design_scores_gemma":[0.00050332624,0.00004598808,0.000762899,0.0000064144842,0.000008465013,0.00006410264,0.0000097720795,0.78029686,0.000007399457,0.0029986768,0.2151448,0.0001512936],"about_ca_topic_score_codex":0.000007302265,"about_ca_topic_score_gemma":0.000040070896,"teacher_disagreement_score":0.90308875,"about_ca_system_score_codex":0.000008263696,"about_ca_system_score_gemma":0.000049003076,"threshold_uncertainty_score":0.27671492},"labels":[],"label_agreement":null},{"id":"W7096876026","doi":"","title":"CSE 222 Final: Network Health Monitors","year":2001,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Measure (data warehouse); Implementation; Quarter (Canadian coin); The Internet; Network congestion; Term (time)","score_opus":0.025069258015408644,"score_gpt":0.2558568315166714,"score_spread":0.23078757350126272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7096876026","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037575713,0.0013815828,0.9660116,0.014813565,0.0012058652,0.00016056385,1.884691e-7,0.00067674916,0.011992315],"genre_scores_gemma":[0.957496,0.00034460708,0.025920486,0.00763188,0.0010093254,0.000019262821,0.0000014028395,0.000010037639,0.0075670048],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988267,0.00007052366,0.00019997261,0.00027840023,0.00018311899,0.0004412748],"domain_scores_gemma":[0.9992496,0.000075841424,0.00006198167,0.0003940398,0.00003820833,0.00018037343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002861402,0.00010947098,0.00014792701,0.000031865893,0.00018217912,0.000100881785,0.0005164124,0.000036976533,0.00007969633],"category_scores_gemma":[0.0000059460244,0.000093904266,0.000055167548,0.00043036844,0.000019483234,0.00020066297,0.00007918162,0.0001123858,0.00022400187],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004807217,0.000026042027,0.0024399343,0.0000011681219,0.000007392813,0.000013014058,0.000045210876,0.0055854684,2.6354576e-7,0.06992398,0.07675084,0.84520185],"study_design_scores_gemma":[0.00064351625,0.00014616757,0.0060416874,0.000023911745,0.000003225979,0.000051771218,0.00001901352,0.4512962,0.0000021388803,0.0037943465,0.53770673,0.00027129689],"about_ca_topic_score_codex":0.000048906164,"about_ca_topic_score_gemma":0.00004182196,"teacher_disagreement_score":0.95373845,"about_ca_system_score_codex":0.000031069256,"about_ca_system_score_gemma":0.000095057265,"threshold_uncertainty_score":0.3829305},"labels":[],"label_agreement":null},{"id":"W7097425664","doi":"","title":"Internet","year":2008,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"The Internet; Work (physics); Electronic markets; Market research","score_opus":0.0230387604146217,"score_gpt":0.19659272343494985,"score_spread":0.17355396302032816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097425664","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0083572585,0.000044537144,0.9342601,0.00092473277,0.00018334916,0.000021234642,2.0454497e-8,0.0002430405,0.055965733],"genre_scores_gemma":[0.9723175,0.000005860112,0.010904871,0.00096610957,0.000043474873,0.000002567074,1.0089333e-7,0.0000011243388,0.015758371],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997052,0.000008633269,0.000049267386,0.00009650808,0.00006146658,0.000078953126],"domain_scores_gemma":[0.99978006,0.000018062945,0.000008579753,0.00014329955,0.000015359563,0.00003464428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00002851228,0.000030756222,0.000035704932,0.000014479476,0.000024497005,0.0000141945575,0.000275293,0.000011940539,0.00008658637],"category_scores_gemma":[0.0000028099018,0.000024401907,0.000018324405,0.00007049424,0.0000138033365,0.00010962091,0.000040704886,0.000029114233,0.00042099884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011264603,0.000016763426,0.00086629804,2.9012503e-7,0.00000493437,0.000029862573,0.00015044937,0.00004398669,0.000009049028,0.53520644,0.073334895,0.3903359],"study_design_scores_gemma":[0.00046872642,0.00006192211,0.0047133258,0.0000032528299,0.0000012650088,0.00019802967,0.000004366799,0.8135523,0.0002804515,0.0013632528,0.17917329,0.00017980665],"about_ca_topic_score_codex":0.000004326388,"about_ca_topic_score_gemma":0.0000016775177,"teacher_disagreement_score":0.9639603,"about_ca_system_score_codex":0.0000037523785,"about_ca_system_score_gemma":0.000014033703,"threshold_uncertainty_score":0.54112285},"labels":[],"label_agreement":null},{"id":"W7097659745","doi":"","title":"CPSC502-Project Proposal","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Traffic generation model; Internet traffic engineering; The Internet; Internet layer; Traffic shaping; Network packet; Internet Protocol; Network traffic control; Internet traffic","score_opus":0.01001254351074698,"score_gpt":0.23631810685150398,"score_spread":0.226305563340757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097659745","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016236436,0.00010894795,0.9037562,0.0118731335,0.0002456499,0.00014978503,1.8451374e-7,0.0006423941,0.08160003],"genre_scores_gemma":[0.86085254,0.00000622169,0.12807256,0.0017369961,0.00035731998,0.000014984623,3.9529206e-7,0.0000039189536,0.008955043],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993668,0.000024173558,0.00010004733,0.00019697705,0.00013225443,0.00017971708],"domain_scores_gemma":[0.9996147,0.000026393205,0.000019691162,0.00026370355,0.000032263953,0.000043258333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000116388655,0.000066625114,0.00006548885,0.000036362206,0.00005600862,0.000086835746,0.0004210879,0.000027326514,0.00007792277],"category_scores_gemma":[0.0000056896906,0.000051150266,0.00003428425,0.00016679736,0.000015750666,0.00029241378,0.00006242831,0.00006201095,0.0005186953],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012769431,0.000017233784,0.000026031905,4.398872e-7,0.0000033196595,0.0000018075511,0.00004495057,0.000111846086,0.000016925542,0.292199,0.01669388,0.6908833],"study_design_scores_gemma":[0.00039830574,0.000050123515,0.00013612122,0.000003272429,0.0000026379666,0.000020082842,0.000009281028,0.6822165,0.00022540968,0.00083039334,0.31595263,0.00015520639],"about_ca_topic_score_codex":0.000006153853,"about_ca_topic_score_gemma":0.000024022294,"teacher_disagreement_score":0.8592289,"about_ca_system_score_codex":0.000013995662,"about_ca_system_score_gemma":0.00009930343,"threshold_uncertainty_score":0.6666952},"labels":[],"label_agreement":null},{"id":"W7100214253","doi":"","title":"University of Alberta NETWORK TOPOLOGY INFERENCE WITH END-TO-END UNICAST MEASUREMENTS","year":2016,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"traceroute; Unicast; Scheme (mathematics); Network topology; Identification (biology); Topology (electrical circuits); Network tomography; Inference; Logical topology","score_opus":0.020406707379182373,"score_gpt":0.21239325156955177,"score_spread":0.1919865441903694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100214253","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008420468,0.000018182787,0.96096474,0.0052686194,0.00014700137,0.00011659822,5.8161396e-7,0.00006065125,0.025003128],"genre_scores_gemma":[0.98345596,0.000008714124,0.012062167,0.0002919017,0.00003401139,7.093463e-7,2.2706503e-7,0.0000029426458,0.0041433885],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991184,0.00007863517,0.0001030668,0.00026851715,0.00018293333,0.00024848606],"domain_scores_gemma":[0.9990056,0.00025585873,0.00006165517,0.00042451025,0.00013053986,0.00012181551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001646216,0.00009090534,0.00015005085,0.000033018245,0.000068004025,0.000011813183,0.00068161875,0.00004116279,0.00034416546],"category_scores_gemma":[0.000019813508,0.00005968072,0.000026461841,0.00025271223,0.000093675335,0.00016374019,0.00016664638,0.000041589145,0.000087698],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010886302,0.00006500994,0.024838602,0.000002821158,0.00009359612,0.000010668989,0.00023178097,0.0017775316,0.00020361747,0.33974025,0.0038268925,0.6291004],"study_design_scores_gemma":[0.027973222,0.008058692,0.19086899,0.0014564544,0.0004082415,0.00015785557,0.0005518211,0.09766463,0.0020671738,0.020158835,0.64571357,0.004920498],"about_ca_topic_score_codex":0.00028373738,"about_ca_topic_score_gemma":0.0035309163,"teacher_disagreement_score":0.9750355,"about_ca_system_score_codex":0.000025044517,"about_ca_system_score_gemma":0.00011106362,"threshold_uncertainty_score":0.37683704},"labels":[],"label_agreement":null},{"id":"W7116774693","doi":"10.23919/cnsm67658.2025.11297480","title":"Exploiting Congestion Control Parameter Manipulation in QUIC for Security Implications","year":2025,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Agence Nationale de la Recherche","keywords":"Network congestion; The Internet; Vulnerability (computing); Idle; Bandwidth (computing); Access control; Node (physics)","score_opus":0.017353168153327464,"score_gpt":0.27150462464497954,"score_spread":0.25415145649165205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7116774693","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019740261,0.000071857095,0.96992886,0.0076510794,0.00022169802,0.0006181112,0.0000019193521,0.00019225407,0.0015739793],"genre_scores_gemma":[0.9910581,0.000004346628,0.0070452318,0.0012422084,0.000040858155,0.0004072191,0.0000058018377,0.000003511649,0.00019270231],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991106,0.00005586888,0.00026807628,0.0002965277,0.00006365117,0.00020526921],"domain_scores_gemma":[0.99891436,0.00061653595,0.00005891215,0.00027264655,0.000103857274,0.00003366422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029819005,0.00009071854,0.00013601463,0.0001255587,0.000095914686,0.00009978392,0.0002600258,0.00006400828,0.000005780473],"category_scores_gemma":[0.00010506837,0.00008993456,0.00005315291,0.00030922305,0.000016150365,0.00030004652,0.000028498993,0.00007759937,0.00000690808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000132228615,0.00003876909,0.0055961385,0.000008139397,0.000010538999,2.5805113e-7,0.00005368678,0.0023927945,0.00006272534,0.78691983,0.0005381698,0.20436572],"study_design_scores_gemma":[0.0014060526,0.000024828782,0.027771255,0.000024861432,0.000010313915,0.0000011258392,0.000019841558,0.8969411,0.00004001487,0.072460756,0.0011885064,0.00011133942],"about_ca_topic_score_codex":0.000016965556,"about_ca_topic_score_gemma":0.00009768686,"teacher_disagreement_score":0.9713179,"about_ca_system_score_codex":0.00005330396,"about_ca_system_score_gemma":0.000050813986,"threshold_uncertainty_score":0.3667425},"labels":[],"label_agreement":null},{"id":"W7128617506","doi":"10.1145/3768617.3770728","title":"A Prototyping Framework for P4-Programmable Traffic Managers","year":2025,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Key (lock); Rapid prototyping; Work (physics); Component (thermodynamics); Set (abstract data type)","score_opus":0.010449302217551039,"score_gpt":0.2692319490828274,"score_spread":0.25878264686527636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7128617506","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044784258,0.00024669248,0.9850539,0.005964382,0.00047364953,0.001352663,2.7378312e-7,0.0006677413,0.0057928516],"genre_scores_gemma":[0.39930055,0.000013370717,0.5900274,0.0026431186,0.00011310454,0.0013651297,0.0000012698472,0.000009350163,0.0065266844],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999013,0.00002357462,0.00017365995,0.00035561764,0.000096373355,0.0003377867],"domain_scores_gemma":[0.99923426,0.00022078422,0.0000365288,0.0003900072,0.0000623212,0.000056091663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022920921,0.000113769835,0.00014278026,0.00008608695,0.00017119496,0.00024166425,0.00060745445,0.00007977511,0.000014156701],"category_scores_gemma":[0.000041460815,0.00010177393,0.000098438846,0.00050154567,0.000025918098,0.00017506028,0.000064802676,0.00011255649,0.000022028042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008198983,0.000016570311,0.0000061435426,0.000013933926,0.000016316038,7.4029526e-7,0.000021681992,0.00093335524,0.0000010333911,0.4897062,0.001297842,0.50797796],"study_design_scores_gemma":[0.0005297514,0.00005941626,0.000034017878,0.00007671215,0.000013308265,0.0000010190319,0.00002593619,0.81744355,0.000041192427,0.045443587,0.13617146,0.00016003294],"about_ca_topic_score_codex":0.0000023429343,"about_ca_topic_score_gemma":0.000005363068,"teacher_disagreement_score":0.8165102,"about_ca_system_score_codex":0.00002376225,"about_ca_system_score_gemma":0.00007417174,"threshold_uncertainty_score":0.41502205},"labels":[],"label_agreement":null},{"id":"W7131262509","doi":"10.1109/cict67193.2025.11399121","title":"Resilient Retransmission Timeout (RTO) Algorithm for Improving TCP’s Data Traffic on Multi-hop Links","year":2025,"lang":"","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Retransmission; Timeout; Network packet; Packet loss; Transmission Control Protocol; Transmission (telecommunications); Network congestion; Data loss","score_opus":0.02885766688220026,"score_gpt":0.2866482376867529,"score_spread":0.25779057080455264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7131262509","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027822232,0.002834562,0.97839713,0.008981379,0.005008914,0.0023521965,0.00012216857,0.00056326186,0.0014621704],"genre_scores_gemma":[0.39357838,0.0005131669,0.5115388,0.006636124,0.0014108304,0.00021010068,0.0002235207,0.00010597422,0.08578312],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99348795,0.00029671664,0.0013008836,0.0029095435,0.0007184829,0.0012864007],"domain_scores_gemma":[0.9941535,0.0009740379,0.0003081318,0.0036761444,0.00042149404,0.00046668056],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017888781,0.0007675887,0.00078014843,0.00039175188,0.000966074,0.0007758378,0.004290945,0.0009265104,0.00016524042],"category_scores_gemma":[0.00022367857,0.0006961856,0.00033609144,0.001018409,0.00017301408,0.00071925303,0.0008784198,0.0013286738,0.0001373212],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016409693,0.0006215551,0.0000028371478,0.00011457183,0.00010599839,0.00001579934,0.00020035257,0.005874692,0.00008592259,0.0024179472,0.019023612,0.9713726],"study_design_scores_gemma":[0.0046824235,0.0006056963,0.000049981172,0.0005194938,0.00018986038,0.0000046955242,0.000072000184,0.9450017,0.00022856226,0.000055840712,0.0479033,0.0006864446],"about_ca_topic_score_codex":0.00003253194,"about_ca_topic_score_gemma":0.00005162973,"teacher_disagreement_score":0.9706862,"about_ca_system_score_codex":0.00019018116,"about_ca_system_score_gemma":0.0010943409,"threshold_uncertainty_score":0.9995489},"labels":[],"label_agreement":null},{"id":"W7132926355","doi":"","title":"A fuzzy reinforcement learning agent for quality of service routing","year":2005,"lang":"","type":"dissertation","venue":"TSpace","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Reinforcement learning; Fuzzy logic; Network packet; Quality of service; Routing (electronic design automation); Scheme (mathematics); Node (physics); Network topology; Term (time)","score_opus":0.04476977912093743,"score_gpt":0.35397054851652415,"score_spread":0.3092007693955867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7132926355","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10725353,0.00217875,0.84997237,0.0050353096,0.0031863528,0.0033136818,0.000005497569,0.00035721538,0.028697286],"genre_scores_gemma":[0.96385735,0.00015397485,0.0054542385,0.0007168417,0.0006463756,0.000187622,0.00017673093,0.000047645655,0.028759237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954947,0.00033600483,0.0015364375,0.00096585747,0.00085880765,0.0008081453],"domain_scores_gemma":[0.99496216,0.00071636937,0.002196041,0.00075553945,0.0011779931,0.0001918958],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019317134,0.0005951469,0.0009775704,0.00016145897,0.0005092201,0.00019245764,0.0010677058,0.00039715483,0.0001110196],"category_scores_gemma":[0.00027030252,0.0006651276,0.0004538685,0.0006502228,0.000036674395,0.00026417276,0.00015162936,0.00061330764,0.000064470994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059202214,0.00014677734,0.00009367036,0.0011551427,0.000300924,0.0000017589513,0.04455688,0.45341495,0.0009750976,0.061118253,0.00030558876,0.43733895],"study_design_scores_gemma":[0.0026841394,0.00043561708,0.00087561255,0.0009925783,0.00021739693,0.000002235081,0.013553714,0.9709784,0.0005650353,0.00012650937,0.008616552,0.0009522311],"about_ca_topic_score_codex":0.00047871913,"about_ca_topic_score_gemma":0.00068238826,"teacher_disagreement_score":0.8566038,"about_ca_system_score_codex":0.00018615487,"about_ca_system_score_gemma":0.00058887835,"threshold_uncertainty_score":0.99957997},"labels":[],"label_agreement":null},{"id":"W7132944756","doi":"","title":"End-to-end Internet traffic characterization","year":2007,"lang":"","type":"dissertation","venue":"TSpace","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Toronto","keywords":"The Internet; Packet analyzer; Network packet; Internet traffic engineering; Service provider; Internet service provider; Internet traffic","score_opus":0.01577677161919759,"score_gpt":0.30410071600194444,"score_spread":0.28832394438274683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7132944756","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41502327,0.00042435524,0.5660858,0.00193696,0.008717394,0.0013240599,0.000013388646,0.0005218115,0.0059529413],"genre_scores_gemma":[0.8800765,0.000140757,0.0015824027,0.0013176874,0.0013400499,0.00009479432,0.0010093374,0.000096066186,0.1143424],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99462956,0.00024918694,0.0010711149,0.0017212639,0.0011341114,0.001194785],"domain_scores_gemma":[0.99661666,0.00025932447,0.0007588494,0.0010751678,0.0005705985,0.00071938673],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00089659245,0.0009618282,0.0008836155,0.00074354815,0.00029025835,0.0008297481,0.0018168052,0.00075634767,0.002119951],"category_scores_gemma":[0.00008785049,0.001082763,0.00034159105,0.0015912176,0.00008535677,0.00050343113,0.00016043596,0.00095123047,0.0030199296],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028941446,0.00019421981,0.000026485995,0.00008170008,0.00012541845,0.00006775855,0.024822824,0.0018532801,0.00231054,0.0049103904,0.0014751499,0.9638428],"study_design_scores_gemma":[0.002115455,0.0008996837,0.011371992,0.0012780203,0.00033803712,0.000068739566,0.0024225707,0.77418417,0.0023352143,0.00002509945,0.20198616,0.0029748804],"about_ca_topic_score_codex":0.00006800172,"about_ca_topic_score_gemma":0.00028876145,"teacher_disagreement_score":0.96086794,"about_ca_system_score_codex":0.00023484149,"about_ca_system_score_gemma":0.0005019217,"threshold_uncertainty_score":0.99916226},"labels":[],"label_agreement":null},{"id":"W7132977230","doi":"","title":"Data network traffic modeling and engineering using stable and fractal processes","year":2002,"lang":"","type":"dissertation","venue":"TSpace","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Toronto; Mitacs; Government of Canada","keywords":"Fractional Brownian motion; Queueing theory; Traffic generation model; Fractal; Probability density function; Traffic equations; Gaussian process; Gaussian; Scaling","score_opus":0.04580298035875695,"score_gpt":0.28776413006334867,"score_spread":0.2419611497045917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7132977230","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.509366,0.05850524,0.42991757,0.00017016653,0.0010980774,0.0005628105,0.000016067677,0.00023956377,0.00012454671],"genre_scores_gemma":[0.9762045,0.0038233064,0.017929293,0.000044302047,0.0009564232,0.000015436326,0.00013244533,0.00007822924,0.00081604416],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965813,0.00006606398,0.00054251973,0.001489706,0.0004510629,0.00086930336],"domain_scores_gemma":[0.9979394,0.00029288017,0.00030478812,0.00090023875,0.00024629806,0.00031640072],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004806715,0.0006594951,0.0006812562,0.00014281845,0.00058032264,0.001029497,0.0009373551,0.00037635045,0.000034207897],"category_scores_gemma":[0.00013070447,0.0007435175,0.000039195926,0.00073401333,0.00004889834,0.0012359277,0.00038236383,0.0006806804,0.000005215365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030393405,0.000036127436,0.000019318606,0.0005087677,0.00009045743,0.000019896364,0.0034167527,0.90032,0.000029100047,0.0001396187,0.00012650118,0.095263064],"study_design_scores_gemma":[0.0005010999,0.000055175195,0.000015913722,0.0010213262,0.00021084887,0.00006081903,0.0008046797,0.9954791,0.0000023044481,0.000013369726,0.001095712,0.0007396462],"about_ca_topic_score_codex":0.000057381923,"about_ca_topic_score_gemma":0.0001502348,"teacher_disagreement_score":0.46683857,"about_ca_system_score_codex":0.000040040566,"about_ca_system_score_gemma":0.00034834872,"threshold_uncertainty_score":0.9995016},"labels":[],"label_agreement":null},{"id":"W7139346787","doi":"","title":"Performance and control of network systems","year":2004,"lang":"en","type":"article","venue":"TNO Repository","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Control (management); The Internet; Quality (philosophy); Publishing; Information system; Information technology","score_opus":0.003791862568664106,"score_gpt":0.1669446385992015,"score_spread":0.1631527760305374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7139346787","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44655034,0.0053533404,0.5342126,0.00026648055,0.0021934286,0.0003313388,4.903042e-7,0.0002522333,0.010839779],"genre_scores_gemma":[0.9985808,0.00002917628,0.00076244836,0.000066789646,0.000276838,0.000012518898,1.298389e-7,0.0000040773257,0.0002671801],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992837,0.00003621709,0.00020070178,0.00017445793,0.00014136553,0.00016361545],"domain_scores_gemma":[0.9994634,0.000048584003,0.000100054975,0.00026868182,0.000056602792,0.00006269838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015953701,0.000078255376,0.00015666931,0.000021100432,0.0000988874,0.000045041335,0.00022544972,0.000043313954,4.087054e-7],"category_scores_gemma":[0.0000029763214,0.00006943349,0.000027067377,0.00009898236,0.000051900864,0.00016289485,0.000033205324,0.000067917696,0.0000041857957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000109598295,0.00015285866,0.037799973,0.00020928557,0.00020456356,0.00009994597,0.00078516384,0.544829,0.0034228065,0.25001594,0.0015698845,0.16080098],"study_design_scores_gemma":[0.00393793,0.0005363634,0.034898102,0.0003611439,0.000058178164,0.00043177174,0.00003006813,0.95259356,0.00083231216,0.0004046883,0.0054579773,0.00045787386],"about_ca_topic_score_codex":0.00001559155,"about_ca_topic_score_gemma":4.4070745e-7,"teacher_disagreement_score":0.5520305,"about_ca_system_score_codex":0.00001849676,"about_ca_system_score_gemma":0.00005666014,"threshold_uncertainty_score":0.28314155},"labels":[],"label_agreement":null},{"id":"W80243497","doi":"","title":"Implementation of BGP in a network simulator","year":2004,"lang":"en","type":"dissertation","venue":"Summit (Simon Fraser University)","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Simon Fraser University","keywords":"Border Gateway Protocol; The Internet; Scalability; Computer science; Network mapping; Computer network; Default-free zone; Routing protocol; Internet Protocol; Internet layer; Protocol (science); Network simulation; Distributed computing; Routing (electronic design automation); World Wide Web; Operating system; Routing table; Link-state routing protocol","score_opus":0.007430006571144596,"score_gpt":0.22592606518062652,"score_spread":0.21849605860948193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W80243497","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9252459,0.0010943669,0.056721784,0.00032758826,0.0029659474,0.0015531062,0.000037463928,0.00041806832,0.011635793],"genre_scores_gemma":[0.99686134,0.000089146786,0.00066751306,0.000053853983,0.00009527202,0.000001927852,0.00014685032,0.000016253938,0.0020678486],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99850476,0.00009273925,0.00031399904,0.0004645239,0.00028377742,0.00034021333],"domain_scores_gemma":[0.9989969,0.000081221115,0.00031243483,0.00038023782,0.00013679075,0.000092415714],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001399305,0.00024181786,0.00035798413,0.0004440104,0.00007980612,0.00003631992,0.00082997663,0.00024060762,0.000073114665],"category_scores_gemma":[0.000005763249,0.0002985892,0.0001449476,0.0012771192,0.000022929142,0.00037216072,0.000060979488,0.00027100265,0.00001950731],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042086776,0.00030929988,0.27785438,0.00028312637,0.00031750774,0.0005076786,0.00049472717,0.15881383,0.0000056820045,0.15647098,0.009800105,0.3947218],"study_design_scores_gemma":[0.054122236,0.002479084,0.123795055,0.0049365694,0.0014675172,7.227274e-8,0.1607214,0.16012813,0.0035423797,0.02171543,0.45791024,0.009181858],"about_ca_topic_score_codex":0.00040030346,"about_ca_topic_score_gemma":0.18569078,"teacher_disagreement_score":0.44811013,"about_ca_system_score_codex":0.00021072011,"about_ca_system_score_gemma":0.0004854935,"threshold_uncertainty_score":0.9999466},"labels":[],"label_agreement":null},{"id":"W81871235","doi":"","title":"Proceedings of the 3rd international conference on Quality of service in heterogeneous wired/wireless networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Wireline; Scope (computer science); Quality of service; Telecommunications; Computer science; Service (business); Interoperability; Government (linguistics); Engineering management; Wireless; Engineering; Business; World Wide Web; Marketing","score_opus":0.02191425879203037,"score_gpt":0.24722763261914066,"score_spread":0.22531337382711028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W81871235","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9472549,0.000021953914,0.031154748,0.0045323465,0.0003618775,0.00020087701,0.0000019944773,0.000053190022,0.01641812],"genre_scores_gemma":[0.998877,0.0000044501144,0.0003814618,0.0004668471,0.000050291837,0.0000086378695,6.2382924e-7,0.0000030755846,0.00020762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899745,0.00002557561,0.00036281382,0.00020335428,0.00027817712,0.00013264161],"domain_scores_gemma":[0.9993102,0.00006351121,0.00019997834,0.00016600125,0.00023994017,0.000020385165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002428989,0.000087571556,0.00015881554,0.00003755426,0.000021943057,0.000032534896,0.00089930004,0.00005289224,0.000017289556],"category_scores_gemma":[0.0000057005545,0.00006293093,0.000051153827,0.00030234392,0.00003973194,0.00010615356,0.00012775621,0.00008502536,0.0000013676176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040700863,0.00016298676,0.011958896,0.000013771144,0.000012783576,5.701439e-7,0.00009842695,0.023349741,0.00083537743,0.93452984,0.0002920537,0.02870483],"study_design_scores_gemma":[0.00052077166,0.00003023519,0.023068644,0.000064266766,0.0000021175458,0.0000027047738,0.000025740977,0.9724696,0.0012311343,0.0024074255,0.000077908146,0.00009940208],"about_ca_topic_score_codex":0.00026352043,"about_ca_topic_score_gemma":0.00063962187,"teacher_disagreement_score":0.9491199,"about_ca_system_score_codex":0.000020838695,"about_ca_system_score_gemma":0.000029415625,"threshold_uncertainty_score":0.25662488},"labels":[],"label_agreement":null},{"id":"W92530893","doi":"10.1023/a:1009596207401","title":"A Distributed Fair Queueing (DFQ) Architecture for Wireless ATM Local Access Networks","year":2000,"lang":"en","type":"article","venue":"International Journal of Wireless Information Networks","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada Research Chairs; University of Toronto","funders":"","keywords":"Computer science; Computer network; Asynchronous Transfer Mode; Quality of service; Network packet; Wi-Fi; Scheduling (production processes); Local area network; Queueing theory; Data transmission; Base station; Wireless; Wireless network; Telecommunications","score_opus":0.006397050090726133,"score_gpt":0.24134544357864943,"score_spread":0.2349483934879233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W92530893","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008860937,0.00017864288,0.98501116,0.0027825308,0.002372607,0.0002857966,0.000020727188,0.00011885305,0.0003687276],"genre_scores_gemma":[0.9937348,0.00028291444,0.0023369521,0.0019088492,0.0015394652,0.00003193709,0.000099614925,0.000015467696,0.000050050272],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972025,0.00009416128,0.0012827025,0.00019928413,0.00077124214,0.00045007956],"domain_scores_gemma":[0.99713326,0.00037996363,0.0009261211,0.00027543277,0.0010593999,0.00022584062],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006367991,0.0002885218,0.0003939061,0.00024525306,0.00019339421,0.0009970482,0.0025810658,0.00022182793,0.00007546455],"category_scores_gemma":[0.00003042174,0.00025602413,0.00031767,0.00041610363,0.000096263284,0.003798387,0.00015335358,0.00060023845,0.0000105983145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001924682,0.000026239464,0.000070631424,0.00000392837,0.00010031963,0.000009183492,0.00010689584,0.48978588,3.857453e-7,0.0046696877,0.0031386607,0.5018957],"study_design_scores_gemma":[0.0019006617,0.00010330869,0.0004131967,0.00018394468,0.000023284487,0.00023320895,0.000038668706,0.95546395,0.000012468111,0.00066759955,0.04069748,0.00026226064],"about_ca_topic_score_codex":0.00001232836,"about_ca_topic_score_gemma":0.00001606919,"teacher_disagreement_score":0.98487383,"about_ca_system_score_codex":0.00019313917,"about_ca_system_score_gemma":0.00015921539,"threshold_uncertainty_score":0.9999892},"labels":[],"label_agreement":null}]}